code
stringlengths 3
1.05M
| repo_name
stringlengths 4
116
| path
stringlengths 3
942
| language
stringclasses 30
values | license
stringclasses 15
values | size
int32 3
1.05M
|
|---|---|---|---|---|---|
//-----------------------------------------------------------------------
// <copyright file="EventFilterBase.cs" company="Akka.NET Project">
// Copyright (C) 2009-2020 Lightbend Inc. <http://www.lightbend.com>
// Copyright (C) 2013-2020 .NET Foundation <https://github.com/akkadotnet/akka.net>
// </copyright>
//-----------------------------------------------------------------------
using System.Text;
using Akka.Event;
using Akka.TestKit.Internal.StringMatcher;
namespace Akka.TestKit.Internal
{
/// <summary>
/// TBD
/// </summary>
/// <param name="eventFilter">TBD</param>
/// <param name="logEvent">TBD</param>
public delegate void EventMatched(EventFilterBase eventFilter, LogEvent logEvent);
/// <summary>Internal!
/// Facilities for selectively filtering out expected events from logging so
/// that you can keep your test run’s console output clean and do not miss real
/// error messages.
/// <remarks>Note! Part of internal API. Breaking changes may occur without notice. Use at own risk.</remarks>
/// </summary>
public abstract class EventFilterBase : IEventFilter
{
private readonly IStringMatcher _sourceMatcher;
private readonly IStringMatcher _messageMatcher;
/// <summary>
/// TBD
/// </summary>
/// <param name="messageMatcher">TBD</param>
/// <param name="sourceMatcher">TBD</param>
protected EventFilterBase(IStringMatcher messageMatcher, IStringMatcher sourceMatcher)
{
_messageMatcher = messageMatcher ?? MatchesAll.Instance;
_sourceMatcher = sourceMatcher ?? MatchesAll.Instance;
}
/// <summary>
/// TBD
/// </summary>
public event EventMatched EventMatched;
/// <summary>
/// Determines whether the specified event should be filtered or not.
/// </summary>
/// <param name="evt">TBD</param>
/// <returns><c>true</c> to filter the event.</returns>
protected abstract bool IsMatch(LogEvent evt); //In Akka JVM this is called matches
/// <summary>
/// TBD
/// </summary>
/// <param name="logEvent">TBD</param>
/// <returns>TBD</returns>
public bool Apply(LogEvent logEvent)
{
if(IsMatch(logEvent))
{
OnEventMatched(logEvent);
return true;
}
return false;
}
/// <summary>
/// TBD
/// </summary>
/// <param name="logEvent">TBD</param>
protected virtual void OnEventMatched(LogEvent logEvent)
{
var delegt = EventMatched;
if(delegt != null) delegt(this, logEvent);
}
/// <summary>Internal helper.
/// <remarks>Note! Part of internal API. Breaking changes may occur without notice. Use at own risk.</remarks>
/// </summary>
/// <param name="src">TBD</param>
/// <param name="msg">TBD</param>
/// <returns>TBD</returns>
protected bool InternalDoMatch(string src, object msg)
{
var msgstr = msg == null ? "null" : msg.ToString();
return _sourceMatcher.IsMatch(src) && _messageMatcher.IsMatch(msgstr);
}
/// <summary>
/// TBD
/// </summary>
protected abstract string FilterDescriptiveName { get; }
/// <summary>
/// TBD
/// </summary>
/// <returns>TBD</returns>
public override string ToString()
{
var sb = new StringBuilder();
//if(_occurences > 1)
// sb.Append(_occurences == int.MaxValue ? "infinite" : _occurences.ToString(CultureInfo.InvariantCulture)).Append(" occurences of ");
sb.Append(FilterDescriptiveName);
var hasMessageMatcher = !(_messageMatcher is MatchesAll);
var hasSourceMatcher = !(_sourceMatcher is MatchesAll);
var hasBothMessageAndSourceMatcher = hasMessageMatcher && hasSourceMatcher;
if(hasMessageMatcher || hasSourceMatcher)
{
sb.Append(" when");
}
if(hasMessageMatcher)
{
sb.Append(" Message ");
sb.Append(_messageMatcher);
}
if(hasBothMessageAndSourceMatcher)
{
sb.Append(" and");
}
if(hasSourceMatcher)
{
sb.Append(" Source ");
sb.Append(_sourceMatcher);
}
return sb.ToString();
}
}
}
|
simonlaroche/akka.net
|
src/core/Akka.TestKit/EventFilter/Internal/EventFilterBase.cs
|
C#
|
apache-2.0
| 4,648 |
/*
* #%L
* Wisdom-Framework
* %%
* Copyright (C) 2013 - 2015 Wisdom Framework
* %%
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* #L%
*/
/*
* ModeShape (http://www.modeshape.org)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.wisdom.jcr.modeshape.api.impl;
import org.apache.felix.ipojo.annotations.Requires;
import org.modeshape.common.annotation.ThreadSafe;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import org.wisdom.api.annotations.Service;
import org.wisdom.api.http.Request;
import org.wisdom.jcr.modeshape.service.ModeshapeRepositoryFactory;
import org.wisdom.jcr.modeshape.api.NoSuchRepositoryException;
import org.wisdom.jcr.modeshape.RequestCredentials;
import org.wisdom.jcr.modeshape.WebJcrI18n;
import org.wisdom.jcr.modeshape.api.RepositoryManager;
import javax.jcr.Repository;
import javax.jcr.RepositoryException;
import javax.jcr.RepositoryFactory;
import javax.jcr.Session;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
/**
* Manager for accessing JCR Repository instances. This manager uses the idiomatic way to find JCR Repository (and ModeShape
* Repositories) instances via the {@link java.util.ServiceLoader} and {@link org.modeshape.jcr.api.RepositoriesContainer} mechanism.
*/
@ThreadSafe
@Service(RepositoryManager.class)
public class RepositoryManagerImpl implements RepositoryManager {
private static final Logger LOGGER = LoggerFactory.getLogger(RepositoryManagerImpl.class);
@Requires
RepositoryFactory repositoryFactory;
private RepositoryManagerImpl() {
}
/**
* Get a JCR Session for the named workspace in the named repository, using the supplied HTTP servlet request for
* authentication information.
*
* @param request the servlet request; may not be null or unauthenticated
* @param repositoryName the name of the repository in which the session is created
* @param workspaceName the name of the workspace to which the session should be connected
* @return an active session with the given workspace in the named repository
* @throws javax.jcr.RepositoryException if the named repository does not exist or there was a problem obtaining the named repository
*/
@Override
public Session getSession(Request request,
String repositoryName,
String workspaceName) throws RepositoryException {
// Go through all the RepositoryFactory instances and try to create one ...
Repository repository = getRepository(repositoryName);
// If there's no authenticated user, try an anonymous login
if (request == null || request.username() == null) {
return repository.login(workspaceName);
}
return repository.login(new RequestCredentials(request), workspaceName);
}
/**
* Returns the {@link javax.jcr.Repository} instance with the given name.
*
* @param repositoryName a {@code non-null} string
* @return a {@link javax.jcr.Repository} instance, never {@code null}
* @throws org.wisdom.jcr.modeshape.api.NoSuchRepositoryException if no repository with the given name exists.
*/
@Override
public Repository getRepository(String repositoryName) throws NoSuchRepositoryException {
Repository repository = null;
try {
Map<String, String> map = new HashMap<>();
map.put(org.modeshape.jcr.api.RepositoryFactory.REPOSITORY_NAME, repositoryName);
repository = repositoryFactory.getRepository(map);
} catch (RepositoryException e) {
throw new NoSuchRepositoryException(WebJcrI18n.cannotInitializeRepository.text(repositoryName), e);
}
if (repository == null) {
throw new NoSuchRepositoryException(WebJcrI18n.repositoryNotFound.text(repositoryName));
}
return repository;
}
/**
* Returns a set with all the names of the available repositories.
*
* @return a set with the names, never {@code null}
*/
@Override
public Set<String> getJcrRepositoryNames() {
try {
return ((ModeshapeRepositoryFactory) repositoryFactory).getRepositoryNames();
} catch (RepositoryException e) {
LOGGER.error(WebJcrI18n.cannotLoadRepositoryNames.text(), e);
return Collections.emptySet();
}
}
}
|
wisdom-framework/wisdom-jcr
|
wisdom-modeshape/src/main/java/org/wisdom/jcr/modeshape/api/impl/RepositoryManagerImpl.java
|
Java
|
apache-2.0
| 5,483 |
# Generated by the protocol buffer compiler. DO NOT EDIT!
# Source: google/cloud/aiplatform/v1/metadata_service.proto for package 'Google.Cloud.AIPlatform.V1'
# Original file comments:
# Copyright 2022 Google LLC
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
#
require 'grpc'
require 'google/cloud/aiplatform/v1/metadata_service_pb'
module Google
module Cloud
module AIPlatform
module V1
module MetadataService
# Service for reading and writing metadata entries.
class Service
include ::GRPC::GenericService
self.marshal_class_method = :encode
self.unmarshal_class_method = :decode
self.service_name = 'google.cloud.aiplatform.v1.MetadataService'
# Initializes a MetadataStore, including allocation of resources.
rpc :CreateMetadataStore, ::Google::Cloud::AIPlatform::V1::CreateMetadataStoreRequest, ::Google::Longrunning::Operation
# Retrieves a specific MetadataStore.
rpc :GetMetadataStore, ::Google::Cloud::AIPlatform::V1::GetMetadataStoreRequest, ::Google::Cloud::AIPlatform::V1::MetadataStore
# Lists MetadataStores for a Location.
rpc :ListMetadataStores, ::Google::Cloud::AIPlatform::V1::ListMetadataStoresRequest, ::Google::Cloud::AIPlatform::V1::ListMetadataStoresResponse
# Deletes a single MetadataStore and all its child resources (Artifacts,
# Executions, and Contexts).
rpc :DeleteMetadataStore, ::Google::Cloud::AIPlatform::V1::DeleteMetadataStoreRequest, ::Google::Longrunning::Operation
# Creates an Artifact associated with a MetadataStore.
rpc :CreateArtifact, ::Google::Cloud::AIPlatform::V1::CreateArtifactRequest, ::Google::Cloud::AIPlatform::V1::Artifact
# Retrieves a specific Artifact.
rpc :GetArtifact, ::Google::Cloud::AIPlatform::V1::GetArtifactRequest, ::Google::Cloud::AIPlatform::V1::Artifact
# Lists Artifacts in the MetadataStore.
rpc :ListArtifacts, ::Google::Cloud::AIPlatform::V1::ListArtifactsRequest, ::Google::Cloud::AIPlatform::V1::ListArtifactsResponse
# Updates a stored Artifact.
rpc :UpdateArtifact, ::Google::Cloud::AIPlatform::V1::UpdateArtifactRequest, ::Google::Cloud::AIPlatform::V1::Artifact
# Deletes an Artifact.
rpc :DeleteArtifact, ::Google::Cloud::AIPlatform::V1::DeleteArtifactRequest, ::Google::Longrunning::Operation
# Purges Artifacts.
rpc :PurgeArtifacts, ::Google::Cloud::AIPlatform::V1::PurgeArtifactsRequest, ::Google::Longrunning::Operation
# Creates a Context associated with a MetadataStore.
rpc :CreateContext, ::Google::Cloud::AIPlatform::V1::CreateContextRequest, ::Google::Cloud::AIPlatform::V1::Context
# Retrieves a specific Context.
rpc :GetContext, ::Google::Cloud::AIPlatform::V1::GetContextRequest, ::Google::Cloud::AIPlatform::V1::Context
# Lists Contexts on the MetadataStore.
rpc :ListContexts, ::Google::Cloud::AIPlatform::V1::ListContextsRequest, ::Google::Cloud::AIPlatform::V1::ListContextsResponse
# Updates a stored Context.
rpc :UpdateContext, ::Google::Cloud::AIPlatform::V1::UpdateContextRequest, ::Google::Cloud::AIPlatform::V1::Context
# Deletes a stored Context.
rpc :DeleteContext, ::Google::Cloud::AIPlatform::V1::DeleteContextRequest, ::Google::Longrunning::Operation
# Purges Contexts.
rpc :PurgeContexts, ::Google::Cloud::AIPlatform::V1::PurgeContextsRequest, ::Google::Longrunning::Operation
# Adds a set of Artifacts and Executions to a Context. If any of the
# Artifacts or Executions have already been added to a Context, they are
# simply skipped.
rpc :AddContextArtifactsAndExecutions, ::Google::Cloud::AIPlatform::V1::AddContextArtifactsAndExecutionsRequest, ::Google::Cloud::AIPlatform::V1::AddContextArtifactsAndExecutionsResponse
# Adds a set of Contexts as children to a parent Context. If any of the
# child Contexts have already been added to the parent Context, they are
# simply skipped. If this call would create a cycle or cause any Context to
# have more than 10 parents, the request will fail with an INVALID_ARGUMENT
# error.
rpc :AddContextChildren, ::Google::Cloud::AIPlatform::V1::AddContextChildrenRequest, ::Google::Cloud::AIPlatform::V1::AddContextChildrenResponse
# Retrieves Artifacts and Executions within the specified Context, connected
# by Event edges and returned as a LineageSubgraph.
rpc :QueryContextLineageSubgraph, ::Google::Cloud::AIPlatform::V1::QueryContextLineageSubgraphRequest, ::Google::Cloud::AIPlatform::V1::LineageSubgraph
# Creates an Execution associated with a MetadataStore.
rpc :CreateExecution, ::Google::Cloud::AIPlatform::V1::CreateExecutionRequest, ::Google::Cloud::AIPlatform::V1::Execution
# Retrieves a specific Execution.
rpc :GetExecution, ::Google::Cloud::AIPlatform::V1::GetExecutionRequest, ::Google::Cloud::AIPlatform::V1::Execution
# Lists Executions in the MetadataStore.
rpc :ListExecutions, ::Google::Cloud::AIPlatform::V1::ListExecutionsRequest, ::Google::Cloud::AIPlatform::V1::ListExecutionsResponse
# Updates a stored Execution.
rpc :UpdateExecution, ::Google::Cloud::AIPlatform::V1::UpdateExecutionRequest, ::Google::Cloud::AIPlatform::V1::Execution
# Deletes an Execution.
rpc :DeleteExecution, ::Google::Cloud::AIPlatform::V1::DeleteExecutionRequest, ::Google::Longrunning::Operation
# Purges Executions.
rpc :PurgeExecutions, ::Google::Cloud::AIPlatform::V1::PurgeExecutionsRequest, ::Google::Longrunning::Operation
# Adds Events to the specified Execution. An Event indicates whether an
# Artifact was used as an input or output for an Execution. If an Event
# already exists between the Execution and the Artifact, the Event is
# skipped.
rpc :AddExecutionEvents, ::Google::Cloud::AIPlatform::V1::AddExecutionEventsRequest, ::Google::Cloud::AIPlatform::V1::AddExecutionEventsResponse
# Obtains the set of input and output Artifacts for this Execution, in the
# form of LineageSubgraph that also contains the Execution and connecting
# Events.
rpc :QueryExecutionInputsAndOutputs, ::Google::Cloud::AIPlatform::V1::QueryExecutionInputsAndOutputsRequest, ::Google::Cloud::AIPlatform::V1::LineageSubgraph
# Creates a MetadataSchema.
rpc :CreateMetadataSchema, ::Google::Cloud::AIPlatform::V1::CreateMetadataSchemaRequest, ::Google::Cloud::AIPlatform::V1::MetadataSchema
# Retrieves a specific MetadataSchema.
rpc :GetMetadataSchema, ::Google::Cloud::AIPlatform::V1::GetMetadataSchemaRequest, ::Google::Cloud::AIPlatform::V1::MetadataSchema
# Lists MetadataSchemas.
rpc :ListMetadataSchemas, ::Google::Cloud::AIPlatform::V1::ListMetadataSchemasRequest, ::Google::Cloud::AIPlatform::V1::ListMetadataSchemasResponse
# Retrieves lineage of an Artifact represented through Artifacts and
# Executions connected by Event edges and returned as a LineageSubgraph.
rpc :QueryArtifactLineageSubgraph, ::Google::Cloud::AIPlatform::V1::QueryArtifactLineageSubgraphRequest, ::Google::Cloud::AIPlatform::V1::LineageSubgraph
end
Stub = Service.rpc_stub_class
end
end
end
end
end
|
googleapis/google-cloud-ruby
|
google-cloud-ai_platform-v1/lib/google/cloud/aiplatform/v1/metadata_service_services_pb.rb
|
Ruby
|
apache-2.0
| 8,284 |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#pragma once
#include "geode_defs.hpp"
using namespace System;
//using namespace System::Runtime::InteropServices;
namespace Apache
{
namespace Geode
{
namespace Client
{
/// <summary>
/// Each enum represents a predefined <see cref="RegionAttributes" /> in a <see cref="Cache" />.
/// These enum values can be used to create regions using a <see cref="RegionFactory" />
/// obtained by calling <see cref="Cache.CreateRegionFactory(RegionShortcut) />.
/// <p>Another way to use predefined region attributes is in cache.xml by setting
/// the refid attribute on a region element or region-attributes element to the
/// string of each value.
/// </summary>
public enum class RegionShortcut {
/// <summary>
/// A PROXY region has no local state and forwards all operations to a server.
/// </summary>
PROXY,
/// <summary>
/// A CACHING_PROXY region has local state but can also send operations to a server.
/// If the local state is not found then the operation is sent to the server
/// and the local state is updated to contain the server result.
/// </summary>
CACHING_PROXY,
/// <summary>
/// A CACHING_PROXY_ENTRY_LRU region has local state but can also send operations to a server.
/// If the local state is not found then the operation is sent to the server
/// and the local state is updated to contain the server result.
/// It also destroys entries when it detects that the number of entries has exceeded the default limit of #100000.
/// </summary>
CACHING_PROXY_ENTRY_LRU,
/// <summary>
/// A LOCAL region only has local state and never sends operations to a server.
/// </summary>
LOCAL,
/// <summary>
/// A LOCAL_ENTRY_LRU region only has local state and never sends operations to a server.
/// It also destroys entries when it detects that the number of entries has exceeded the default limit of #100000.
/// </summary>
LOCAL_ENTRY_LRU
} ;
} // namespace Client
} // namespace Geode
} // namespace Apache
|
pivotal-jbarrett/geode-native
|
clicache/src/RegionShortcut.hpp
|
C++
|
apache-2.0
| 3,019 |
@echo off
powershell -NoProfile -ExecutionPolicy Bypass -Command "& .\MakeSearchablePdfFromUrl.ps1"
echo Script finished with errorlevel=%errorlevel%
pause
|
bytescout/ByteScout-SDK-SourceCode
|
PDF.co Web API/PDF Make Searchable API/PowerShell/Make Searchable PDF From URL/run.bat
|
Batchfile
|
apache-2.0
| 157 |
include ../../../mk/pitchfork.mk
# Local variables
_VER = 1.66
_NAME = biopython-$(_VER)
_WRKSRC = $(WORKDIR)/$(_NAME)
# Local works
do-install: | $(PREFIX)/var/pkg/$(_NAME)
$(PREFIX)/var/pkg/$(_NAME):
rm -rf $(STAGING)/$(_NAME)
mkdir -p $(STAGING)/$(_NAME)
$(PIP) install --root $(STAGING)/$(_NAME) --no-deps biopython==$(_VER)
rsync -aKx $(STAGING)/$(_NAME)/$(PREFIX)/ $(PREFIX)/
cd $(STAGING)/$(_NAME)$(PREFIX) && find * ! -type d|grep -v '^$$'|sort -r > $@
do-clean:
rm -rf $(STAGING)/$(_NAME)
|
qldhpc/eb_local
|
ebfiles/p/pitchfork/old/ports/python/biopython/Makefile
|
Makefile
|
apache-2.0
| 511 |
/* ----------------------------------------------------------------------------
* This file was automatically generated by SWIG (http://www.swig.org).
* Version 3.0.8
*
* Do not make changes to this file unless you know what you are doing--modify
* the SWIG interface file instead.
* ----------------------------------------------------------------------------- */
package com.badlogic.gdx.physics.bullet.dynamics;
import com.badlogic.gdx.physics.bullet.BulletBase;
import com.badlogic.gdx.physics.bullet.linearmath.*;
import com.badlogic.gdx.physics.bullet.collision.*;
import com.badlogic.gdx.math.Vector3;
import com.badlogic.gdx.math.Quaternion;
import com.badlogic.gdx.math.Matrix3;
import com.badlogic.gdx.math.Matrix4;
public class btWheelInfo extends BulletBase {
private long swigCPtr;
protected btWheelInfo(final String className, long cPtr, boolean cMemoryOwn) {
super(className, cPtr, cMemoryOwn);
swigCPtr = cPtr;
}
/** Construct a new btWheelInfo, normally you should not need this constructor it's intended for low-level usage. */
public btWheelInfo(long cPtr, boolean cMemoryOwn) {
this("btWheelInfo", cPtr, cMemoryOwn);
construct();
}
@Override
protected void reset(long cPtr, boolean cMemoryOwn) {
if (!destroyed)
destroy();
super.reset(swigCPtr = cPtr, cMemoryOwn);
}
public static long getCPtr(btWheelInfo obj) {
return (obj == null) ? 0 : obj.swigCPtr;
}
@Override
protected void finalize() throws Throwable {
if (!destroyed)
destroy();
super.finalize();
}
@Override protected synchronized void delete() {
if (swigCPtr != 0) {
if (swigCMemOwn) {
swigCMemOwn = false;
DynamicsJNI.delete_btWheelInfo(swigCPtr);
}
swigCPtr = 0;
}
super.delete();
}
static public class RaycastInfo extends BulletBase {
private long swigCPtr;
protected RaycastInfo(final String className, long cPtr, boolean cMemoryOwn) {
super(className, cPtr, cMemoryOwn);
swigCPtr = cPtr;
}
/** Construct a new RaycastInfo, normally you should not need this constructor it's intended for low-level usage. */
public RaycastInfo(long cPtr, boolean cMemoryOwn) {
this("RaycastInfo", cPtr, cMemoryOwn);
construct();
}
@Override
protected void reset(long cPtr, boolean cMemoryOwn) {
if (!destroyed)
destroy();
super.reset(swigCPtr = cPtr, cMemoryOwn);
}
public static long getCPtr(RaycastInfo obj) {
return (obj == null) ? 0 : obj.swigCPtr;
}
@Override
protected void finalize() throws Throwable {
if (!destroyed)
destroy();
super.finalize();
}
@Override protected synchronized void delete() {
if (swigCPtr != 0) {
if (swigCMemOwn) {
swigCMemOwn = false;
DynamicsJNI.delete_btWheelInfo_RaycastInfo(swigCPtr);
}
swigCPtr = 0;
}
super.delete();
}
public void setContactNormalWS(btVector3 value) {
DynamicsJNI.btWheelInfo_RaycastInfo_contactNormalWS_set(swigCPtr, this, btVector3.getCPtr(value), value);
}
public btVector3 getContactNormalWS() {
long cPtr = DynamicsJNI.btWheelInfo_RaycastInfo_contactNormalWS_get(swigCPtr, this);
return (cPtr == 0) ? null : new btVector3(cPtr, false);
}
public void setContactPointWS(btVector3 value) {
DynamicsJNI.btWheelInfo_RaycastInfo_contactPointWS_set(swigCPtr, this, btVector3.getCPtr(value), value);
}
public btVector3 getContactPointWS() {
long cPtr = DynamicsJNI.btWheelInfo_RaycastInfo_contactPointWS_get(swigCPtr, this);
return (cPtr == 0) ? null : new btVector3(cPtr, false);
}
public void setSuspensionLength(float value) {
DynamicsJNI.btWheelInfo_RaycastInfo_suspensionLength_set(swigCPtr, this, value);
}
public float getSuspensionLength() {
return DynamicsJNI.btWheelInfo_RaycastInfo_suspensionLength_get(swigCPtr, this);
}
public void setHardPointWS(btVector3 value) {
DynamicsJNI.btWheelInfo_RaycastInfo_hardPointWS_set(swigCPtr, this, btVector3.getCPtr(value), value);
}
public btVector3 getHardPointWS() {
long cPtr = DynamicsJNI.btWheelInfo_RaycastInfo_hardPointWS_get(swigCPtr, this);
return (cPtr == 0) ? null : new btVector3(cPtr, false);
}
public void setWheelDirectionWS(btVector3 value) {
DynamicsJNI.btWheelInfo_RaycastInfo_wheelDirectionWS_set(swigCPtr, this, btVector3.getCPtr(value), value);
}
public btVector3 getWheelDirectionWS() {
long cPtr = DynamicsJNI.btWheelInfo_RaycastInfo_wheelDirectionWS_get(swigCPtr, this);
return (cPtr == 0) ? null : new btVector3(cPtr, false);
}
public void setWheelAxleWS(btVector3 value) {
DynamicsJNI.btWheelInfo_RaycastInfo_wheelAxleWS_set(swigCPtr, this, btVector3.getCPtr(value), value);
}
public btVector3 getWheelAxleWS() {
long cPtr = DynamicsJNI.btWheelInfo_RaycastInfo_wheelAxleWS_get(swigCPtr, this);
return (cPtr == 0) ? null : new btVector3(cPtr, false);
}
public void setIsInContact(boolean value) {
DynamicsJNI.btWheelInfo_RaycastInfo_isInContact_set(swigCPtr, this, value);
}
public boolean getIsInContact() {
return DynamicsJNI.btWheelInfo_RaycastInfo_isInContact_get(swigCPtr, this);
}
public void setGroundObject(long value) {
DynamicsJNI.btWheelInfo_RaycastInfo_groundObject_set(swigCPtr, this, value);
}
public long getGroundObject() {
return DynamicsJNI.btWheelInfo_RaycastInfo_groundObject_get(swigCPtr, this);
}
public RaycastInfo() {
this(DynamicsJNI.new_btWheelInfo_RaycastInfo(), true);
}
}
public void setRaycastInfo(btWheelInfo.RaycastInfo value) {
DynamicsJNI.btWheelInfo_raycastInfo_set(swigCPtr, this, btWheelInfo.RaycastInfo.getCPtr(value), value);
}
public btWheelInfo.RaycastInfo getRaycastInfo() {
long cPtr = DynamicsJNI.btWheelInfo_raycastInfo_get(swigCPtr, this);
return (cPtr == 0) ? null : new btWheelInfo.RaycastInfo(cPtr, false);
}
public void setWorldTransform(btTransform value) {
DynamicsJNI.btWheelInfo_worldTransform_set(swigCPtr, this, btTransform.getCPtr(value), value);
}
public btTransform getWorldTransform() {
long cPtr = DynamicsJNI.btWheelInfo_worldTransform_get(swigCPtr, this);
return (cPtr == 0) ? null : new btTransform(cPtr, false);
}
public void setChassisConnectionPointCS(btVector3 value) {
DynamicsJNI.btWheelInfo_chassisConnectionPointCS_set(swigCPtr, this, btVector3.getCPtr(value), value);
}
public btVector3 getChassisConnectionPointCS() {
long cPtr = DynamicsJNI.btWheelInfo_chassisConnectionPointCS_get(swigCPtr, this);
return (cPtr == 0) ? null : new btVector3(cPtr, false);
}
public void setWheelDirectionCS(btVector3 value) {
DynamicsJNI.btWheelInfo_wheelDirectionCS_set(swigCPtr, this, btVector3.getCPtr(value), value);
}
public btVector3 getWheelDirectionCS() {
long cPtr = DynamicsJNI.btWheelInfo_wheelDirectionCS_get(swigCPtr, this);
return (cPtr == 0) ? null : new btVector3(cPtr, false);
}
public void setWheelAxleCS(btVector3 value) {
DynamicsJNI.btWheelInfo_wheelAxleCS_set(swigCPtr, this, btVector3.getCPtr(value), value);
}
public btVector3 getWheelAxleCS() {
long cPtr = DynamicsJNI.btWheelInfo_wheelAxleCS_get(swigCPtr, this);
return (cPtr == 0) ? null : new btVector3(cPtr, false);
}
public void setSuspensionRestLength1(float value) {
DynamicsJNI.btWheelInfo_suspensionRestLength1_set(swigCPtr, this, value);
}
public float getSuspensionRestLength1() {
return DynamicsJNI.btWheelInfo_suspensionRestLength1_get(swigCPtr, this);
}
public void setMaxSuspensionTravelCm(float value) {
DynamicsJNI.btWheelInfo_maxSuspensionTravelCm_set(swigCPtr, this, value);
}
public float getMaxSuspensionTravelCm() {
return DynamicsJNI.btWheelInfo_maxSuspensionTravelCm_get(swigCPtr, this);
}
public float getSuspensionRestLength() {
return DynamicsJNI.btWheelInfo_getSuspensionRestLength(swigCPtr, this);
}
public void setWheelsRadius(float value) {
DynamicsJNI.btWheelInfo_wheelsRadius_set(swigCPtr, this, value);
}
public float getWheelsRadius() {
return DynamicsJNI.btWheelInfo_wheelsRadius_get(swigCPtr, this);
}
public void setSuspensionStiffness(float value) {
DynamicsJNI.btWheelInfo_suspensionStiffness_set(swigCPtr, this, value);
}
public float getSuspensionStiffness() {
return DynamicsJNI.btWheelInfo_suspensionStiffness_get(swigCPtr, this);
}
public void setWheelsDampingCompression(float value) {
DynamicsJNI.btWheelInfo_wheelsDampingCompression_set(swigCPtr, this, value);
}
public float getWheelsDampingCompression() {
return DynamicsJNI.btWheelInfo_wheelsDampingCompression_get(swigCPtr, this);
}
public void setWheelsDampingRelaxation(float value) {
DynamicsJNI.btWheelInfo_wheelsDampingRelaxation_set(swigCPtr, this, value);
}
public float getWheelsDampingRelaxation() {
return DynamicsJNI.btWheelInfo_wheelsDampingRelaxation_get(swigCPtr, this);
}
public void setFrictionSlip(float value) {
DynamicsJNI.btWheelInfo_frictionSlip_set(swigCPtr, this, value);
}
public float getFrictionSlip() {
return DynamicsJNI.btWheelInfo_frictionSlip_get(swigCPtr, this);
}
public void setSteering(float value) {
DynamicsJNI.btWheelInfo_steering_set(swigCPtr, this, value);
}
public float getSteering() {
return DynamicsJNI.btWheelInfo_steering_get(swigCPtr, this);
}
public void setRotation(float value) {
DynamicsJNI.btWheelInfo_rotation_set(swigCPtr, this, value);
}
public float getRotation() {
return DynamicsJNI.btWheelInfo_rotation_get(swigCPtr, this);
}
public void setDeltaRotation(float value) {
DynamicsJNI.btWheelInfo_deltaRotation_set(swigCPtr, this, value);
}
public float getDeltaRotation() {
return DynamicsJNI.btWheelInfo_deltaRotation_get(swigCPtr, this);
}
public void setRollInfluence(float value) {
DynamicsJNI.btWheelInfo_rollInfluence_set(swigCPtr, this, value);
}
public float getRollInfluence() {
return DynamicsJNI.btWheelInfo_rollInfluence_get(swigCPtr, this);
}
public void setMaxSuspensionForce(float value) {
DynamicsJNI.btWheelInfo_maxSuspensionForce_set(swigCPtr, this, value);
}
public float getMaxSuspensionForce() {
return DynamicsJNI.btWheelInfo_maxSuspensionForce_get(swigCPtr, this);
}
public void setEngineForce(float value) {
DynamicsJNI.btWheelInfo_engineForce_set(swigCPtr, this, value);
}
public float getEngineForce() {
return DynamicsJNI.btWheelInfo_engineForce_get(swigCPtr, this);
}
public void setBrake(float value) {
DynamicsJNI.btWheelInfo_brake_set(swigCPtr, this, value);
}
public float getBrake() {
return DynamicsJNI.btWheelInfo_brake_get(swigCPtr, this);
}
public void setBIsFrontWheel(boolean value) {
DynamicsJNI.btWheelInfo_bIsFrontWheel_set(swigCPtr, this, value);
}
public boolean getBIsFrontWheel() {
return DynamicsJNI.btWheelInfo_bIsFrontWheel_get(swigCPtr, this);
}
public void setClientInfo(long value) {
DynamicsJNI.btWheelInfo_clientInfo_set(swigCPtr, this, value);
}
public long getClientInfo() {
return DynamicsJNI.btWheelInfo_clientInfo_get(swigCPtr, this);
}
public btWheelInfo() {
this(DynamicsJNI.new_btWheelInfo__SWIG_0(), true);
}
public btWheelInfo(btWheelInfoConstructionInfo ci) {
this(DynamicsJNI.new_btWheelInfo__SWIG_1(btWheelInfoConstructionInfo.getCPtr(ci), ci), true);
}
public void updateWheel(btRigidBody chassis, btWheelInfo.RaycastInfo raycastInfo) {
DynamicsJNI.btWheelInfo_updateWheel(swigCPtr, this, btRigidBody.getCPtr(chassis), chassis, btWheelInfo.RaycastInfo.getCPtr(raycastInfo), raycastInfo);
}
public void setClippedInvContactDotSuspension(float value) {
DynamicsJNI.btWheelInfo_clippedInvContactDotSuspension_set(swigCPtr, this, value);
}
public float getClippedInvContactDotSuspension() {
return DynamicsJNI.btWheelInfo_clippedInvContactDotSuspension_get(swigCPtr, this);
}
public void setSuspensionRelativeVelocity(float value) {
DynamicsJNI.btWheelInfo_suspensionRelativeVelocity_set(swigCPtr, this, value);
}
public float getSuspensionRelativeVelocity() {
return DynamicsJNI.btWheelInfo_suspensionRelativeVelocity_get(swigCPtr, this);
}
public void setWheelsSuspensionForce(float value) {
DynamicsJNI.btWheelInfo_wheelsSuspensionForce_set(swigCPtr, this, value);
}
public float getWheelsSuspensionForce() {
return DynamicsJNI.btWheelInfo_wheelsSuspensionForce_get(swigCPtr, this);
}
public void setSkidInfo(float value) {
DynamicsJNI.btWheelInfo_skidInfo_set(swigCPtr, this, value);
}
public float getSkidInfo() {
return DynamicsJNI.btWheelInfo_skidInfo_get(swigCPtr, this);
}
}
|
Xhanim/libgdx
|
extensions/gdx-bullet/jni/swig-src/dynamics/com/badlogic/gdx/physics/bullet/dynamics/btWheelInfo.java
|
Java
|
apache-2.0
| 12,909 |
<!DOCTYPE html>
<html>
<head>
<style type="text/css">
dt {
font-weight: bold;
font-size: 100%;
}
pre {
margin-left: 2em;
white-space: normal;
}
</style>
</head>
<body>
<h1>Open Source Licensing Information</h1>
<p> The <a href="http://www.opensource.org/docs/definition.php">open source</a> and
<a href="http://www.gnu.org/philosophy/free-sw.html">free software</a> in
this product is available under one of the following licenses. These licenses
give you the freedom to run the software, study it, change it to meet your
needs, and share your changes with others. You can
<a href="https://developer.mozilla.org/en-US/docs/Mozilla/Boot_to_Gecko/Building_and_installing_Firefox_OS">download the source code</a>
from Mozilla. Please consult the source to see which license applies to which
parts of the code.
</p>
<p>We are very grateful for the hard work of tens of thousands of contributors
to many different open source and free software communities around the world
over the past 30 years, without whose efforts this product would not exist.
</p>
<ul>
<li><a href="#MPL20">Mozilla Public License 2.0</a></li>
<li><a href="#Apache20">Apache License 2.0</a></li>
<li><a href="#LGPL21">GNU Lesser General Public License 2.1</a></li>
<li><a href="#GPL20">GNU General Public License 2.0</a></li>
<li><a href="#EPL10">Eclipse Public License 1.0</a></li>
<li><a href="#Permissive">Permissive Licenses</a></li>
</ul>
<hr>
<a name="MPL20"></a>
<h2>Mozilla Public License 2.0</h2>
<h3 id="definitions">1. Definitions</h3>
<dl>
<dt>1.1. “Contributor”</dt>
<dd><p>means each individual or legal entity that creates, contributes to the creation of, or owns Covered Software.</p>
</dd>
<dt>1.2. “Contributor Version”</dt>
<dd><p>means the combination of the Contributions of others (if any) used by a Contributor and that particular Contributor’s Contribution.</p>
</dd>
<dt>1.3. “Contribution”</dt>
<dd><p>means Covered Software of a particular Contributor.</p>
</dd>
<dt>1.4. “Covered Software”</dt>
<dd><p>means Source Code Form to which the initial Contributor has attached the notice in Exhibit A, the Executable Form of such Source Code Form, and Modifications of such Source Code Form, in each case including portions thereof.</p>
</dd>
<dt>1.5. “Incompatible With Secondary Licenses”</dt>
<dd><p>means</p>
<ol type="a">
<li><p>that the initial Contributor has attached the notice described in Exhibit B to the Covered Software; or</p></li>
<li><p>that the Covered Software was made available under the terms of version 1.1 or earlier of the License, but not also under the terms of a Secondary License.</p></li>
</ol>
</dd>
<dt>1.6. “Executable Form”</dt>
<dd><p>means any form of the work other than Source Code Form.</p>
</dd>
<dt>1.7. “Larger Work”</dt>
<dd><p>means a work that combines Covered Software with other material, in a separate file or files, that is not Covered Software.</p>
</dd>
<dt>1.8. “License”</dt>
<dd><p>means this document.</p>
</dd>
<dt>1.9. “Licensable”</dt>
<dd><p>means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently, any and all of the rights conveyed by this License.</p>
</dd>
<dt>1.10. “Modifications”</dt>
<dd><p>means any of the following:</p>
<ol type="a">
<li><p>any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or</p></li>
<li><p>any new file in Source Code Form that contains any Covered Software.</p></li>
</ol>
</dd>
<dt>1.11. “Patent Claims” of a Contributor</dt>
<dd><p>means any patent claim(s), including without limitation, method, process, and apparatus claims, in any patent Licensable by such Contributor that would be infringed, but for the grant of the License, by the making, using, selling, offering for sale, having made, import, or transfer of either its Contributions or its Contributor Version.</p>
</dd>
<dt>1.12. “Secondary License”</dt>
<dd><p>means either the GNU General Public License, Version 2.0, the GNU Lesser General Public License, Version 2.1, the GNU Affero General Public License, Version 3.0, or any later versions of those licenses.</p>
</dd>
<dt>1.13. “Source Code Form”</dt>
<dd><p>means the form of the work preferred for making modifications.</p>
</dd>
<dt>1.14. “You” (or “Your”)</dt>
<dd><p>means an individual or a legal entity exercising rights under this License. For legal entities, “You” includes any entity that controls, is controlled by, or is under common control with You. For purposes of this definition, “control” means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity.</p>
</dd>
</dl>
<h3 id="license-grants-and-conditions">2. License Grants and Conditions</h3>
<h4 id="grants">2.1. Grants</h4>
<p>Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license:</p>
<ol type="a">
<li><p>under intellectual property rights (other than patent or trademark) Licensable by such Contributor to use, reproduce, make available, modify, display, perform, distribute, and otherwise exploit its Contributions, either on an unmodified basis, with Modifications, or as part of a Larger Work; and</p></li>
<li><p>under Patent Claims of such Contributor to make, use, sell, offer for sale, have made, import, and otherwise transfer either its Contributions or its Contributor Version.</p></li>
</ol>
<h4 id="effective-date">2.2. Effective Date</h4>
<p>The licenses granted in Section 2.1 with respect to any Contribution become effective for each Contribution on the date the Contributor first distributes such Contribution.</p>
<h4 id="limitations-on-grant-scope">2.3. Limitations on Grant Scope</h4>
<p>The licenses granted in this Section 2 are the only rights granted under this License. No additional rights or licenses will be implied from the distribution or licensing of Covered Software under this License. Notwithstanding Section 2.1(b) above, no patent license is granted by a Contributor:</p>
<ol type="a">
<li><p>for any code that a Contributor has removed from Covered Software; or</p></li>
<li><p>for infringements caused by: (i) Your and any other third party’s modifications of Covered Software, or (ii) the combination of its Contributions with other software (except as part of its Contributor Version); or</p></li>
<li><p>under Patent Claims infringed by Covered Software in the absence of its Contributions.</p></li>
</ol>
<p>This License does not grant any rights in the trademarks, service marks, or logos of any Contributor (except as may be necessary to comply with the notice requirements in Section 3.4).</p>
<h4 id="subsequent-licenses">2.4. Subsequent Licenses</h4>
<p>No Contributor makes additional grants as a result of Your choice to distribute the Covered Software under a subsequent version of this License (see Section 10.2) or under the terms of a Secondary License (if permitted under the terms of Section 3.3).</p>
<h4 id="representation">2.5. Representation</h4>
<p>Each Contributor represents that the Contributor believes its Contributions are its original creation(s) or it has sufficient rights to grant the rights to its Contributions conveyed by this License.</p>
<h4 id="fair-use">2.6. Fair Use</h4>
<p>This License is not intended to limit any rights You have under applicable copyright doctrines of fair use, fair dealing, or other equivalents.</p>
<h4 id="conditions">2.7. Conditions</h4>
<p>Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in Section 2.1.</p>
<h3 id="responsibilities">3. Responsibilities</h3>
<h4 id="distribution-of-source-form">3.1. Distribution of Source Form</h4>
<p>All distribution of Covered Software in Source Code Form, including any Modifications that You create or to which You contribute, must be under the terms of this License. You must inform recipients that the Source Code Form of the Covered Software is governed by the terms of this License, and how they can obtain a copy of this License. You may not attempt to alter or restrict the recipients’ rights in the Source Code Form.</p>
<h4 id="distribution-of-executable-form">3.2. Distribution of Executable Form</h4>
<p>If You distribute Covered Software in Executable Form then:</p>
<ol type="a">
<li><p>such Covered Software must also be made available in Source Code Form, as described in Section 3.1, and You must inform recipients of the Executable Form how they can obtain a copy of such Source Code Form by reasonable means in a timely manner, at a charge no more than the cost of distribution to the recipient; and</p></li>
<li><p>You may distribute such Executable Form under the terms of this License, or sublicense it under different terms, provided that the license for the Executable Form does not attempt to limit or alter the recipients’ rights in the Source Code Form under this License.</p></li>
</ol>
<h4 id="distribution-of-a-larger-work">3.3. Distribution of a Larger Work</h4>
<p>You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the Covered Software is not Incompatible With Secondary Licenses, this License permits You to additionally distribute such Covered Software under the terms of such Secondary License(s), so that the recipient of the Larger Work may, at their option, further distribute the Covered Software under the terms of either this License or such Secondary License(s).</p>
<h4 id="notices">3.4. Notices</h4>
<p>You may not remove or alter the substance of any license notices (including copyright notices, patent notices, disclaimers of warranty, or limitations of liability) contained within the Source Code Form of the Covered Software, except that You may alter any license notices to the extent required to remedy known factual inaccuracies.</p>
<h4 id="application-of-additional-terms">3.5. Application of Additional Terms</h4>
<p>You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Software. However, You may do so only on Your own behalf, and not on behalf of any Contributor. You must make it absolutely clear that any such warranty, support, indemnity, or liability obligation is offered by You alone, and You hereby agree to indemnify every Contributor for any liability incurred by such Contributor as a result of warranty, support, indemnity or liability terms You offer. You may include additional disclaimers of warranty and limitations of liability specific to any jurisdiction.</p>
<h3 id="inability-to-comply-due-to-statute-or-regulation">4. Inability to Comply Due to Statute or Regulation</h3>
<p>If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Software due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be placed in a text file included with all distributions of the Covered Software under this License. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it.</p>
<h3 id="termination">5. Termination</h3>
<p>5.1. The rights granted under this License will terminate automatically if You fail to comply with any of its terms. However, if You become compliant, then the rights granted under this License from a particular Contributor are reinstated (a) provisionally, unless and until such Contributor explicitly and finally terminates Your grants, and (b) on an ongoing basis, if such Contributor fails to notify You of the non-compliance by some reasonable means prior to 60 days after You have come back into compliance. Moreover, Your grants from a particular Contributor are reinstated on an ongoing basis if such Contributor notifies You of the non-compliance by some reasonable means, this is the first time You have received notice of non-compliance with this License from such Contributor, and You become compliant prior to 30 days after Your receipt of the notice.</p>
<p>5.2. If You initiate litigation against any entity by asserting a patent infringement claim (excluding declaratory judgment actions, counter-claims, and cross-claims) alleging that a Contributor Version directly or indirectly infringes any patent, then the rights granted to You by any and all Contributors for the Covered Software under Section 2.1 of this License shall terminate.</p>
<p>5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or Your distributors under this License prior to termination shall survive termination.</p>
<h3 id="disclaimer-of-warranty">6. Disclaimer of Warranty</h3>
<p><em>Covered Software is provided under this License on an “as is” basis, without warranty of any kind, either expressed, implied, or statutory, including, without limitation, warranties that the Covered Software is free of defects, merchantable, fit for a particular purpose or non-infringing. The entire risk as to the quality and performance of the Covered Software is with You. Should any Covered Software prove defective in any respect, You (not any Contributor) assume the cost of any necessary servicing, repair, or correction. This disclaimer of warranty constitutes an essential part of this License. No use of any Covered Software is authorized under this License except under this disclaimer.</em></p>
<h3 id="limitation-of-liability">7. Limitation of Liability</h3>
<p><em>Under no circumstances and under no legal theory, whether tort (including negligence), contract, or otherwise, shall any Contributor, or anyone who distributes Covered Software as permitted above, be liable to You for any direct, indirect, special, incidental, or consequential damages of any character including, without limitation, damages for lost profits, loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses, even if such party shall have been informed of the possibility of such damages. This limitation of liability shall not apply to liability for death or personal injury resulting from such party’s negligence to the extent applicable law prohibits such limitation. Some jurisdictions do not allow the exclusion or limitation of incidental or consequential damages, so this exclusion and limitation may not apply to You.</em></p>
<h3 id="litigation">8. Litigation</h3>
<p>Any litigation relating to this License may be brought only in the courts of a jurisdiction where the defendant maintains its principal place of business and such litigation shall be governed by laws of that jurisdiction, without reference to its conflict-of-law provisions. Nothing in this Section shall prevent a party’s ability to bring cross-claims or counter-claims.</p>
<h3 id="miscellaneous">9. Miscellaneous</h3>
<p>This License represents the complete agreement concerning the subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not be used to construe this License against a Contributor.</p>
<h3 id="versions-of-the-license">10. Versions of the License</h3>
<h4 id="new-versions">10.1. New Versions</h4>
<p>Mozilla Foundation is the license steward. Except as provided in Section 10.3, no one other than the license steward has the right to modify or publish new versions of this License. Each version will be given a distinguishing version number.</p>
<h4 id="effect-of-new-versions">10.2. Effect of New Versions</h4>
<p>You may distribute the Covered Software under the terms of the version of the License under which You originally received the Covered Software, or under the terms of any subsequent version published by the license steward.</p>
<h4 id="modified-versions">10.3. Modified Versions</h4>
<p>If you create software not governed by this License, and you want to create a new license for such software, you may create and use a modified version of this License if you rename the license and remove any references to the name of the license steward (except to note that such modified license differs from this License).</p>
<h4 id="distributing-source-code-form-that-is-incompatible-with-secondary-licenses">10.4. Distributing Source Code Form that is Incompatible With Secondary Licenses</h4>
<p>If You choose to distribute Source Code Form that is Incompatible With Secondary Licenses under the terms of this version of the License, the notice described in Exhibit B of this License must be attached.</p>
<h3 id="exhibit-a---source-code-form-license-notice">Exhibit A - Source Code Form License Notice</h3>
<blockquote>
<p>This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.</p>
</blockquote>
<p>If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice.</p>
<p>You may add additional accurate notices of copyright ownership.</p>
<h3 id="exhibit-b---incompatible-with-secondary-licenses-notice">Exhibit B - “Incompatible With Secondary Licenses” Notice</h3>
<blockquote>
<p>This Source Code Form is “Incompatible With Secondary Licenses”, as defined by the Mozilla Public License, v. 2.0.</p>
</blockquote>
<hr>
<a name="Apache20"></a>
<h2>Apache License 2.0</h2>
<h3><a name="definitions">1. Definitions</a>.</h3>
<p>"License" shall mean the terms and conditions for use, reproduction, and
distribution as defined by Sections 1 through 9 of this document.</p>
<p>"Licensor" shall mean the copyright owner or entity authorized by the
copyright owner that is granting the License.</p>
<p>"Legal Entity" shall mean the union of the acting entity and all other
entities that control, are controlled by, or are under common control with
that entity. For the purposes of this definition, "control" means (i) the
power, direct or indirect, to cause the direction or management of such
entity, whether by contract or otherwise, or (ii) ownership of fifty
percent (50%) or more of the outstanding shares, or (iii) beneficial
ownership of such entity.</p>
<p>"You" (or "Your") shall mean an individual or Legal Entity exercising
permissions granted by this License.</p>
<p>"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation source,
and configuration files.</p>
<p>"Object" form shall mean any form resulting from mechanical transformation
or translation of a Source form, including but not limited to compiled
object code, generated documentation, and conversions to other media types.</p>
<p>"Work" shall mean the work of authorship, whether in Source or Object form,
made available under the License, as indicated by a copyright notice that
is included in or attached to the work (an example is provided in the
Appendix below).</p>
<p>"Derivative Works" shall mean any work, whether in Source or Object form,
that is based on (or derived from) the Work and for which the editorial
revisions, annotations, elaborations, or other modifications represent, as
a whole, an original work of authorship. For the purposes of this License,
Derivative Works shall not include works that remain separable from, or
merely link (or bind by name) to the interfaces of, the Work and Derivative
Works thereof.</p>
<p>"Contribution" shall mean any work of authorship, including the original
version of the Work and any modifications or additions to that Work or
Derivative Works thereof, that is intentionally submitted to Licensor for
inclusion in the Work by the copyright owner or by an individual or Legal
Entity authorized to submit on behalf of the copyright owner. For the
purposes of this definition, "submitted" means any form of electronic,
verbal, or written communication sent to the Licensor or its
representatives, including but not limited to communication on electronic
mailing lists, source code control systems, and issue tracking systems that
are managed by, or on behalf of, the Licensor for the purpose of discussing
and improving the Work, but excluding communication that is conspicuously
marked or otherwise designated in writing by the copyright owner as "Not a
Contribution."</p>
<p>"Contributor" shall mean Licensor and any individual or Legal Entity on
behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.</p>
<h3><a name="copyright">2. Grant of Copyright License</a>.</h3> Subject to the
terms and conditions of this License, each Contributor hereby grants to You
a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of, publicly
display, publicly perform, sublicense, and distribute the Work and such
Derivative Works in Source or Object form.</p>
<h3><a name="patent">3. Grant of Patent License</a>.</h3> Subject to the terms
and conditions of this License, each Contributor hereby grants to You a
perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made, use,
offer to sell, sell, import, and otherwise transfer the Work, where such
license applies only to those patent claims licensable by such Contributor
that are necessarily infringed by their Contribution(s) alone or by
combination of their Contribution(s) with the Work to which such
Contribution(s) was submitted. If You institute patent litigation against
any entity (including a cross-claim or counterclaim in a lawsuit) alleging
that the Work or a Contribution incorporated within the Work constitutes
direct or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate as of the
date such litigation is filed.</p>
<h3><a name="redistribution">4. Redistribution</a>.</h3> You may reproduce and
distribute copies of the Work or Derivative Works thereof in any medium,
with or without modifications, and in Source or Object form, provided that
You meet the following conditions:</p>
<ol>
<li>
<p>You must give any other recipients of the Work or Derivative Works a
copy of this License; and</p>
</li>
<li>
<p>You must cause any modified files to carry prominent notices stating
that You changed the files; and</p>
</li>
<li>
<p>You must retain, in the Source form of any Derivative Works that You
distribute, all copyright, patent, trademark, and attribution notices from
the Source form of the Work, excluding those notices that do not pertain to
any part of the Derivative Works; and</p>
</li>
<li>
<p>If the Work includes a "NOTICE" text file as part of its distribution,
then any Derivative Works that You distribute must include a readable copy
of the attribution notices contained within such NOTICE file, excluding
those notices that do not pertain to any part of the Derivative Works, in
at least one of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or documentation,
if provided along with the Derivative Works; or, within a display generated
by the Derivative Works, if and wherever such third-party notices normally
appear. The contents of the NOTICE file are for informational purposes only
and do not modify the License. You may add Your own attribution notices
within Derivative Works that You distribute, alongside or as an addendum to
the NOTICE text from the Work, provided that such additional attribution
notices cannot be construed as modifying the License.
You may add Your own copyright statement to Your modifications and may
provide additional or different license terms and conditions for use,
reproduction, or distribution of Your modifications, or for any such
Derivative Works as a whole, provided Your use, reproduction, and
distribution of the Work otherwise complies with the conditions stated in
this License.</p>
</li>
</ol>
<h3><a name="contributions">5. Submission of Contributions</a>.</h3> Unless You
explicitly state otherwise, any Contribution intentionally submitted for
inclusion in the Work by You to the Licensor shall be under the terms and
conditions of this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify the
terms of any separate license agreement you may have executed with Licensor
regarding such Contributions.</p>
<h3><a name="trademarks">6. Trademarks</a>.</h3> This License does not grant
permission to use the trade names, trademarks, service marks, or product
names of the Licensor, except as required for reasonable and customary use
in describing the origin of the Work and reproducing the content of the
NOTICE file.</p>
<h3><a name="no-warranty">7. Disclaimer of Warranty</a>.</h3> Unless required by
applicable law or agreed to in writing, Licensor provides the Work (and
each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT
WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including,
without limitation, any warranties or conditions of TITLE,
NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You
are solely responsible for determining the appropriateness of using or
redistributing the Work and assume any risks associated with Your exercise
of permissions under this License.</p>
<h3><a name="no-liability">8. Limitation of Liability</a>.</h3> In no event and
under no legal theory, whether in tort (including negligence), contract, or
otherwise, unless required by applicable law (such as deliberate and
grossly negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a result
of this License or out of the use or inability to use the Work (including
but not limited to damages for loss of goodwill, work stoppage, computer
failure or malfunction, or any and all other commercial damages or losses),
even if such Contributor has been advised of the possibility of such
damages.</p>
<h3><a name="additional">9. Accepting Warranty or Additional Liability</a>.</h3>
While redistributing the Work or Derivative Works thereof, You may choose
to offer, and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this License.
However, in accepting such obligations, You may act only on Your own behalf
and on Your sole responsibility, not on behalf of any other Contributor,
and only if You agree to indemnify, defend, and hold each Contributor
harmless for any liability incurred by, or claims asserted against, such
Contributor by reason of your accepting any such warranty or additional
liability.</p>
<hr>
<a name="LGPL21"></a>
<h2>GNU Lesser General Public License 2.1</h2>
<p>This product contains code from the following LGPLed libraries:</p>
<ul>
<li><a href="http://www.libsdl.org/">SDL</a>
<li>Headers from <a href="http://www.yaffs.net/">yaffs2</a>
<li><a href="http://www.linuxfoundation.org/collaborate/workgroups/accessibility/iaccessible2">iAccessible2</a>
<li><a href="http://www.infradead.org/~tgr/libnl/">libnl</a>
<li><a href="http://developer.gnome.org/glib/">glib</a>
<li><a href="http://www.bluez.org/">bluez</a>
</ul>
<pre>
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
[This is the first released version of the Lesser GPL. It also counts
as the successor of the GNU Library Public License, version 2, hence
the version number 2.1.]
</pre>
<h3><a id="SEC2">Preamble</a></h3>
<p>
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
Licenses are intended to guarantee your freedom to share and change
free software--to make sure the software is free for all its users.
</p>
<p>
This license, the Lesser General Public License, applies to some
specially designated software packages--typically libraries--of the
Free Software Foundation and other authors who decide to use it. You
can use it too, but we suggest you first think carefully about whether
this license or the ordinary General Public License is the better
strategy to use in any particular case, based on the explanations below.
</p>
<p>
When we speak of free software, we are referring to freedom of use,
not price. Our General Public Licenses are designed to make sure that
you have the freedom to distribute copies of free software (and charge
for this service if you wish); that you receive source code or can get
it if you want it; that you can change the software and use pieces of
it in new free programs; and that you are informed that you can do
these things.
</p>
<p>
To protect your rights, we need to make restrictions that forbid
distributors to deny you these rights or to ask you to surrender these
rights. These restrictions translate to certain responsibilities for
you if you distribute copies of the library or if you modify it.
</p>
<p>
For example, if you distribute copies of the library, whether gratis
or for a fee, you must give the recipients all the rights that we gave
you. You must make sure that they, too, receive or can get the source
code. If you link other code with the library, you must provide
complete object files to the recipients, so that they can relink them
with the library after making changes to the library and recompiling
it. And you must show them these terms so they know their rights.
</p>
<p>
We protect your rights with a two-step method: (1) we copyright the
library, and (2) we offer you this license, which gives you legal
permission to copy, distribute and/or modify the library.
</p>
<p>
To protect each distributor, we want to make it very clear that
there is no warranty for the free library. Also, if the library is
modified by someone else and passed on, the recipients should know
that what they have is not the original version, so that the original
author's reputation will not be affected by problems that might be
introduced by others.
</p>
<p>
Finally, software patents pose a constant threat to the existence of
any free program. We wish to make sure that a company cannot
effectively restrict the users of a free program by obtaining a
restrictive license from a patent holder. Therefore, we insist that
any patent license obtained for a version of the library must be
consistent with the full freedom of use specified in this license.
</p>
<p>
Most GNU software, including some libraries, is covered by the
ordinary GNU General Public License. This license, the GNU Lesser
General Public License, applies to certain designated libraries, and
is quite different from the ordinary General Public License. We use
this license for certain libraries in order to permit linking those
libraries into non-free programs.
</p>
<p>
When a program is linked with a library, whether statically or using
a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library. The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom. The Lesser General
Public License permits more lax criteria for linking other code with
the library.
</p>
<p>
We call this license the "Lesser" General Public License because it
does Less to protect the user's freedom than the ordinary General
Public License. It also provides other free software developers Less
of an advantage over competing non-free programs. These disadvantages
are the reason we use the ordinary General Public License for many
libraries. However, the Lesser license provides advantages in certain
special circumstances.
</p>
<p>
For example, on rare occasions, there may be a special need to
encourage the widest possible use of a certain library, so that it becomes
a de-facto standard. To achieve this, non-free programs must be
allowed to use the library. A more frequent case is that a free
library does the same job as widely used non-free libraries. In this
case, there is little to gain by limiting the free library to free
software only, so we use the Lesser General Public License.
</p>
<p>
In other cases, permission to use a particular library in non-free
programs enables a greater number of people to use a large body of
free software. For example, permission to use the GNU C Library in
non-free programs enables many more people to use the whole GNU
operating system, as well as its variant, the GNU/Linux operating
system.
</p>
<p>
Although the Lesser General Public License is Less protective of the
users' freedom, it does ensure that the user of a program that is
linked with the Library has the freedom and the wherewithal to run
that program using a modified version of the Library.
</p>
<p>
The precise terms and conditions for copying, distribution and
modification follow. Pay close attention to the difference between a
"work based on the library" and a "work that uses the library". The
former contains code derived from the library, whereas the latter must
be combined with the library in order to run.
</p>
<h3><a id="SEC3">TERMS AND CONDITIONS FOR COPYING,
DISTRIBUTION AND MODIFICATION</a></h3>
<p>
<strong>0.</strong>
This License Agreement applies to any software library or other
program which contains a notice placed by the copyright holder or
other authorized party saying it may be distributed under the terms of
this Lesser General Public License (also called "this License").
Each licensee is addressed as "you".
</p>
<p>
A "library" means a collection of software functions and/or data
prepared so as to be conveniently linked with application programs
(which use some of those functions and data) to form executables.
</p>
<p>
The "Library", below, refers to any such software library or work
which has been distributed under these terms. A "work based on the
Library" means either the Library or any derivative work under
copyright law: that is to say, a work containing the Library or a
portion of it, either verbatim or with modifications and/or translated
straightforwardly into another language. (Hereinafter, translation is
included without limitation in the term "modification".)
</p>
<p>
"Source code" for a work means the preferred form of the work for
making modifications to it. For a library, complete source code means
all the source code for all modules it contains, plus any associated
interface definition files, plus the scripts used to control compilation
and installation of the library.
</p>
<p>
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running a program using the Library is not restricted, and output from
such a program is covered only if its contents constitute a work based
on the Library (independent of the use of the Library in a tool for
writing it). Whether that is true depends on what the Library does
and what the program that uses the Library does.
</p>
<p>
<strong>1.</strong>
You may copy and distribute verbatim copies of the Library's
complete source code as you receive it, in any medium, provided that
you conspicuously and appropriately publish on each copy an
appropriate copyright notice and disclaimer of warranty; keep intact
all the notices that refer to this License and to the absence of any
warranty; and distribute a copy of this License along with the
Library.
</p>
<p>
You may charge a fee for the physical act of transferring a copy,
and you may at your option offer warranty protection in exchange for a
fee.
</p>
<p>
<strong>2.</strong>
You may modify your copy or copies of the Library or any portion
of it, thus forming a work based on the Library, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
</p>
<ul>
<li><strong>a)</strong>
The modified work must itself be a software library.</li>
<li><strong>b)</strong>
You must cause the files modified to carry prominent notices
stating that you changed the files and the date of any change.</li>
<li><strong>c)</strong>
You must cause the whole of the work to be licensed at no
charge to all third parties under the terms of this License.</li>
<li><strong>d)</strong>
If a facility in the modified Library refers to a function or a
table of data to be supplied by an application program that uses
the facility, other than as an argument passed when the facility
is invoked, then you must make a good faith effort to ensure that,
in the event an application does not supply such function or
table, the facility still operates, and performs whatever part of
its purpose remains meaningful.
<p>
(For example, a function in a library to compute square roots has
a purpose that is entirely well-defined independent of the
application. Therefore, Subsection 2d requires that any
application-supplied function or table used by this function must
be optional: if the application does not supply it, the square
root function must still compute square roots.)</p></li>
</ul>
<p>
These requirements apply to the modified work as a whole. If identifiable
sections of that work are not derived from the Library, and can be
reasonably considered independent and separate works in themselves, then
this License, and its terms, do not apply to those sections when you
distribute them as separate works. But when you distribute the same
sections as part of a whole which is a work based on the Library, the
distribution of the whole must be on the terms of this License, whose
permissions for other licensees extend to the entire whole, and thus to
each and every part regardless of who wrote it.
</p>
<p>
Thus, it is not the intent of this section to claim rights or contest your
rights to work written entirely by you; rather, the intent is to exercise
the right to control the distribution of derivative or collective works
based on the Library.
</p>
<p>
In addition, mere aggregation of another work not based on the Library with
the Library (or with a work based on the Library) on a volume of a storage
or distribution medium does not bring the other work under the scope of
this License.
</p>
<p>
<strong>3.</strong>
You may opt to apply the terms of the ordinary GNU General Public
License instead of this License to a given copy of the Library. To do
this, you must alter all the notices that refer to this License, so
that they refer to the ordinary GNU General Public License, version 2,
instead of to this License. (If a newer version than version 2 of the
ordinary GNU General Public License has appeared, then you can specify
that version instead if you wish.) Do not make any other change in
these notices.
</p>
<p>
Once this change is made in a given copy, it is irreversible for
that copy, so the ordinary GNU General Public License applies to all
subsequent copies and derivative works made from that copy.
</p>
<p>
This option is useful when you wish to copy part of the code of
the Library into a program that is not a library.
</p>
<p>
<strong>4.</strong>
You may copy and distribute the Library (or a portion or
derivative of it, under Section 2) in object code or executable form
under the terms of Sections 1 and 2 above provided that you accompany
it with the complete corresponding machine-readable source code, which
must be distributed under the terms of Sections 1 and 2 above on a
medium customarily used for software interchange.
</p>
<p>
If distribution of object code is made by offering access to copy
from a designated place, then offering equivalent access to copy the
source code from the same place satisfies the requirement to
distribute the source code, even though third parties are not
compelled to copy the source along with the object code.
</p>
<p>
<strong>5.</strong>
A program that contains no derivative of any portion of the
Library, but is designed to work with the Library by being compiled or
linked with it, is called a "work that uses the Library". Such a
work, in isolation, is not a derivative work of the Library, and
therefore falls outside the scope of this License.
</p>
<p>
However, linking a "work that uses the Library" with the Library
creates an executable that is a derivative of the Library (because it
contains portions of the Library), rather than a "work that uses the
library". The executable is therefore covered by this License.
Section 6 states terms for distribution of such executables.
</p>
<p>
When a "work that uses the Library" uses material from a header file
that is part of the Library, the object code for the work may be a
derivative work of the Library even though the source code is not.
Whether this is true is especially significant if the work can be
linked without the Library, or if the work is itself a library. The
threshold for this to be true is not precisely defined by law.
</p>
<p>
If such an object file uses only numerical parameters, data
structure layouts and accessors, and small macros and small inline
functions (ten lines or less in length), then the use of the object
file is unrestricted, regardless of whether it is legally a derivative
work. (Executables containing this object code plus portions of the
Library will still fall under Section 6.)
</p>
<p>
Otherwise, if the work is a derivative of the Library, you may
distribute the object code for the work under the terms of Section 6.
Any executables containing that work also fall under Section 6,
whether or not they are linked directly with the Library itself.
</p>
<p>
<strong>6.</strong>
As an exception to the Sections above, you may also combine or
link a "work that uses the Library" with the Library to produce a
work containing portions of the Library, and distribute that work
under terms of your choice, provided that the terms permit
modification of the work for the customer's own use and reverse
engineering for debugging such modifications.
</p>
<p>
You must give prominent notice with each copy of the work that the
Library is used in it and that the Library and its use are covered by
this License. You must supply a copy of this License. If the work
during execution displays copyright notices, you must include the
copyright notice for the Library among them, as well as a reference
directing the user to the copy of this License. Also, you must do one
of these things:
</p>
<ul>
<li><strong>a)</strong> Accompany the work with the complete
corresponding machine-readable source code for the Library
including whatever changes were used in the work (which must be
distributed under Sections 1 and 2 above); and, if the work is an
executable linked with the Library, with the complete
machine-readable "work that uses the Library", as object code
and/or source code, so that the user can modify the Library and
then relink to produce a modified executable containing the
modified Library. (It is understood that the user who changes the
contents of definitions files in the Library will not necessarily
be able to recompile the application to use the modified
definitions.)</li>
<li><strong>b)</strong> Use a suitable shared library mechanism
for linking with the Library. A suitable mechanism is one that
(1) uses at run time a copy of the library already present on the
user's computer system, rather than copying library functions into
the executable, and (2) will operate properly with a modified
version of the library, if the user installs one, as long as the
modified version is interface-compatible with the version that the
work was made with.</li>
<li><strong>c)</strong> Accompany the work with a written offer,
valid for at least three years, to give the same user the
materials specified in Subsection 6a, above, for a charge no more
than the cost of performing this distribution.</li>
<li><strong>d)</strong> If distribution of the work is made by
offering access to copy from a designated place, offer equivalent
access to copy the above specified materials from the same
place.</li>
<li><strong>e)</strong> Verify that the user has already received
a copy of these materials or that you have already sent this user
a copy.</li>
</ul>
<p>
For an executable, the required form of the "work that uses the
Library" must include any data and utility programs needed for
reproducing the executable from it. However, as a special exception,
the materials to be distributed need not include anything that is
normally distributed (in either source or binary form) with the major
components (compiler, kernel, and so on) of the operating system on
which the executable runs, unless that component itself accompanies
the executable.
</p>
<p>
It may happen that this requirement contradicts the license
restrictions of other proprietary libraries that do not normally
accompany the operating system. Such a contradiction means you cannot
use both them and the Library together in an executable that you
distribute.
</p>
<p>
<strong>7.</strong> You may place library facilities that are a work
based on the Library side-by-side in a single library together with
other library facilities not covered by this License, and distribute
such a combined library, provided that the separate distribution of
the work based on the Library and of the other library facilities is
otherwise permitted, and provided that you do these two things:
</p>
<ul>
<li><strong>a)</strong> Accompany the combined library with a copy
of the same work based on the Library, uncombined with any other
library facilities. This must be distributed under the terms of
the Sections above.</li>
<li><strong>b)</strong> Give prominent notice with the combined
library of the fact that part of it is a work based on the
Library, and explaining where to find the accompanying uncombined
form of the same work.</li>
</ul>
<p>
<strong>8.</strong> You may not copy, modify, sublicense, link with,
or distribute the Library except as expressly provided under this
License. Any attempt otherwise to copy, modify, sublicense, link
with, or distribute the Library is void, and will automatically
terminate your rights under this License. However, parties who have
received copies, or rights, from you under this License will not have
their licenses terminated so long as such parties remain in full
compliance.
</p>
<p>
<strong>9.</strong>
You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Library or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Library (or any work based on the
Library), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Library or works based on it.
</p>
<p>
<strong>10.</strong>
Each time you redistribute the Library (or any work based on the
Library), the recipient automatically receives a license from the
original licensor to copy, distribute, link with or modify the Library
subject to these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties with
this License.
</p>
<p>
<strong>11.</strong>
If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Library at all. For example, if a patent
license would not permit royalty-free redistribution of the Library by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Library.
</p>
<p>
If any portion of this section is held invalid or unenforceable under any
particular circumstance, the balance of the section is intended to apply,
and the section as a whole is intended to apply in other circumstances.
</p>
<p>
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
</p>
<p>
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
</p>
<p>
<strong>12.</strong>
If the distribution and/or use of the Library is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Library under this License may add
an explicit geographical distribution limitation excluding those countries,
so that distribution is permitted only in or among countries not thus
excluded. In such case, this License incorporates the limitation as if
written in the body of this License.
</p>
<p>
<strong>13.</strong>
The Free Software Foundation may publish revised and/or new
versions of the Lesser General Public License from time to time.
Such new versions will be similar in spirit to the present version,
but may differ in detail to address new problems or concerns.
</p>
<p>
Each version is given a distinguishing version number. If the Library
specifies a version number of this License which applies to it and
"any later version", you have the option of following the terms and
conditions either of that version or of any later version published by
the Free Software Foundation. If the Library does not specify a
license version number, you may choose any version ever published by
the Free Software Foundation.
</p>
<p>
<strong>14.</strong>
If you wish to incorporate parts of the Library into other free
programs whose distribution conditions are incompatible with these,
write to the author to ask for permission. For software which is
copyrighted by the Free Software Foundation, write to the Free
Software Foundation; we sometimes make exceptions for this. Our
decision will be guided by the two goals of preserving the free status
of all derivatives of our free software and of promoting the sharing
and reuse of software generally.
</p>
<p>
<strong>NO WARRANTY</strong>
</p>
<p>
<strong>15.</strong>
BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
</p>
<p>
<strong>16.</strong>
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES.
</p>
<hr>
<a name="GPL20"></a>
<h2>GNU General Public License 2.0</h2>
<pre>
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
</pre>
<h3><a id="preamble"></a><a id="SEC2">Preamble</a></h3>
<p>
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Lesser General Public License instead.) You can apply it to
your programs, too.
</p>
<p>
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
</p>
<p>
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
</p>
<p>
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
</p>
<p>
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
</p>
<p>
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
</p>
<p>
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
</p>
<p>
The precise terms and conditions for copying, distribution and
modification follow.
</p>
<h3><a id="terms"></a><a id="SEC3">TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</a></h3>
<a id="section0"></a><p>
<strong>0.</strong>
This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
</p>
<p>
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
</p>
<a id="section1"></a><p>
<strong>1.</strong>
You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
</p>
<p>
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
</p>
<a id="section2"></a><p>
<strong>2.</strong>
You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
</p>
<dl>
<dt></dt>
<dd>
<strong>a)</strong>
You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
</dd>
<dt></dt>
<dd>
<strong>b)</strong>
You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
</dd>
<dt></dt>
<dd>
<strong>c)</strong>
If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
</dd>
</dl>
<p>
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
</p>
<p>
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
</p>
<p>
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
</p>
<a id="section3"></a><p>
<strong>3.</strong>
You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
</p>
<!-- we use this doubled UL to get the sub-sections indented, -->
<!-- while making the bullets as unobvious as possible. -->
<dl>
<dt></dt>
<dd>
<strong>a)</strong>
Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
</dd>
<dt></dt>
<dd>
<strong>b)</strong>
Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
</dd>
<dt></dt>
<dd>
<strong>c)</strong>
Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
</dd>
</dl>
<p>
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
</p>
<p>
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
</p>
<a id="section4"></a><p>
<strong>4.</strong>
You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
</p>
<a id="section5"></a><p>
<strong>5.</strong>
You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
</p>
<a id="section6"></a><p>
<strong>6.</strong>
Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
</p>
<a id="section7"></a><p>
<strong>7.</strong>
If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
</p>
<p>
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
</p>
<p>
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
</p>
<p>
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
</p>
<a id="section8"></a><p>
<strong>8.</strong>
If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
</p>
<a id="section9"></a><p>
<strong>9.</strong>
The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
</p>
<p>
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
</p>
<a id="section10"></a><p>
<strong>10.</strong>
If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
</p>
<a id="section11"></a><p><strong>NO WARRANTY</strong></p>
<p>
<strong>11.</strong>
BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
</p>
<a id="section12"></a><p>
<strong>12.</strong>
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
</p>
<hr>
<a name="EPL10"></a>
<h2>Eclipse Public License 1.0</h2>
<style type="text/css">
p.c2 {font-weight: bold}
div.c1 {text-align: right}
</style>
<p class="c2">1. DEFINITIONS</p>
<p>"Contribution" means:</p>
<blockquote>
a) in the case of the initial Contributor, the initial code and
documentation distributed under this Agreement, and<br>
b) in the case of each subsequent Contributor:<br>
i) changes to the Program, and<br>
ii) additions to the Program;
</blockquote>where such changes and/or additions to the Program originate
from and are distributed by that particular Contributor. A Contribution
'originates' from a Contributor if it was added to the Program by such
Contributor itself or anyone acting on such Contributor's behalf.
Contributions do not include additions to the Program which: (i) are
separate modules of software distributed in conjunction with the Program
under their own license agreement, and (ii) are not derivative works of the
Program.
<p>"Contributor" means any person or entity that distributes the
Program.</p>
<p>"Licensed Patents " mean patent claims licensable by a Contributor which
are necessarily infringed by the use or sale of its Contribution alone or
when combined with the Program.</p>
<p>"Program" means the Contributions distributed in accordance with this
Agreement.</p>
<p>"Recipient" means anyone who receives the Program under this Agreement,
including all Contributors.</p>
<p class="c2">2. GRANT OF RIGHTS</p>
<blockquote>
a) Subject to the terms of this Agreement, each Contributor hereby grants
Recipient a non-exclusive, worldwide, royalty-free copyright license to
reproduce, prepare derivative works of, publicly display, publicly
perform, distribute and sublicense the Contribution of such Contributor,
if any, and such derivative works, in source code and object code
form.<br>
b) Subject to the terms of this Agreement, each Contributor hereby grants
Recipient a non-exclusive, worldwide, royalty-free patent license under
Licensed Patents to make, use, sell, offer to sell, import and otherwise
transfer the Contribution of such Contributor, if any, in source code and
object code form. This patent license shall apply to the combination of
the Contribution and the Program if, at the time the Contribution is
added by the Contributor, such addition of the Contribution causes such
combination to be covered by the Licensed Patents. The patent license
shall not apply to any other combinations which include the Contribution.
No hardware per se is licensed hereunder.<br>
c) Recipient understands that although each Contributor grants the
licenses to its Contributions set forth herein, no assurances are
provided by any Contributor that the Program does not infringe the patent
or other intellectual property rights of any other entity. Each
Contributor disclaims any liability to Recipient for claims brought by
any other entity based on infringement of intellectual property rights or
otherwise. As a condition to exercising the rights and licenses granted
hereunder, each Recipient hereby assumes sole responsibility to secure
any other intellectual property rights needed, if any. For example, if a
third party patent license is required to allow Recipient to distribute
the Program, it is Recipient's responsibility to acquire that license
before distributing the Program.<br>
d) Each Contributor represents that to its knowledge it has sufficient
copyright rights in its Contribution, if any, to grant the copyright
license set forth in this Agreement.
</blockquote>
<p class="c2">3. REQUIREMENTS</p>
<p>A Contributor may choose to distribute the Program in object code form
under its own license agreement, provided that:</p>
<blockquote>
a) it complies with the terms and conditions of this Agreement; and<br>
b) its license agreement:<br>
i) effectively disclaims on behalf of all Contributors all warranties and
conditions, express and implied, including warranties or conditions of
title and non-infringement, and implied warranties or conditions of
merchantability and fitness for a particular purpose;<br>
ii) effectively excludes on behalf of all Contributors all liability for
damages, including direct, indirect, special, incidental and
consequential damages, such as lost profits;<br>
iii) states that any provisions which differ from this Agreement are
offered by that Contributor alone and not by any other party; and<br>
iv) states that source code for the Program is available from such
Contributor, and informs licensees how to obtain it in a reasonable
manner on or through a medium customarily used for software exchange.
</blockquote>
<p>When the Program is made available in source code form:</p>
<blockquote>
a) it must be made available under this Agreement; and<br>
b) a copy of this Agreement must be included with each copy of the
Program.
</blockquote>Contributors may not remove or alter any copyright notices
contained within the Program.
<p>Each Contributor must identify itself as the originator of its
Contribution, if any, in a manner that reasonably allows subsequent
Recipients to identify the originator of the Contribution.</p>
<p class="c2">4. COMMERCIAL DISTRIBUTION</p>
<p>Commercial distributors of software may accept certain responsibilities
with respect to end users, business partners and the like. While this
license is intended to facilitate the commercial use of the Program, the
Contributor who includes the Program in a commercial product offering
should do so in a manner which does not create potential liability for
other Contributors. Therefore, if a Contributor includes the Program in a
commercial product offering, such Contributor ("Commercial Contributor")
hereby agrees to defend and indemnify every other Contributor ("Indemnified
Contributor") against any losses, damages and costs (collectively "Losses")
arising from claims, lawsuits and other legal actions brought by a third
party against the Indemnified Contributor to the extent caused by the acts
or omissions of such Commercial Contributor in connection with its
distribution of the Program in a commercial product offering. The
obligations in this section do not apply to any claims or Losses relating
to any actual or alleged intellectual property infringement. In order to
qualify, an Indemnified Contributor must: a) promptly notify the Commercial
Contributor in writing of such claim, and b) allow the Commercial
Contributor to control, and cooperate with the Commercial Contributor in,
the defense and any related settlement negotiations. The Indemnified
Contributor may participate in any such claim at its own expense.</p>
<p>For example, a Contributor might include the Program in a commercial
product offering, Product X. That Contributor is then a Commercial
Contributor. If that Commercial Contributor then makes performance claims,
or offers warranties related to Product X, those performance claims and
warranties are such Commercial Contributor's responsibility alone. Under
this section, the Commercial Contributor would have to defend claims
against the other Contributors related to those performance claims and
warranties, and if a court requires any other Contributor to pay any
damages as a result, the Commercial Contributor must pay those damages.</p>
<p class="c2">5. NO WARRANTY</p>
<p>EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED
ON AN "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER
EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR
CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A
PARTICULAR PURPOSE. Each Recipient is solely responsible for determining
the appropriateness of using and distributing the Program and assumes all
risks associated with its exercise of rights under this Agreement ,
including but not limited to the risks and costs of program errors,
compliance with applicable laws, damage to or loss of data, programs or
equipment, and unavailability or interruption of operations.</p>
<p class="c2">6. DISCLAIMER OF LIABILITY</p>
<p>EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR
ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT
LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM
OR THE EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.</p>
<p class="c2">7. GENERAL</p>
<p>If any provision of this Agreement is invalid or unenforceable under
applicable law, it shall not affect the validity or enforceability of the
remainder of the terms of this Agreement, and without further action by the
parties hereto, such provision shall be reformed to the minimum extent
necessary to make such provision valid and enforceable.</p>
<p>If Recipient institutes patent litigation against any entity (including
a cross-claim or counterclaim in a lawsuit) alleging that the Program
itself (excluding combinations of the Program with other software or
hardware) infringes such Recipient's patent(s), then such Recipient's
rights granted under Section 2(b) shall terminate as of the date such
litigation is filed.</p>
<p>All Recipient's rights under this Agreement shall terminate if it fails
to comply with any of the material terms or conditions of this Agreement
and does not cure such failure in a reasonable period of time after
becoming aware of such noncompliance. If all Recipient's rights under this
Agreement terminate, Recipient agrees to cease use and distribution of the
Program as soon as reasonably practicable. However, Recipient's obligations
under this Agreement and any licenses granted by Recipient relating to the
Program shall continue and survive.</p>
<p>Everyone is permitted to copy and distribute copies of this Agreement,
but in order to avoid inconsistency the Agreement is copyrighted and may
only be modified in the following manner. The Agreement Steward reserves
the right to publish new versions (including revisions) of this Agreement
from time to time. No one other than the Agreement Steward has the right to
modify this Agreement. The Eclipse Foundation is the initial Agreement
Steward. The Eclipse Foundation may assign the responsibility to serve as
the Agreement Steward to a suitable separate entity. Each new version of
the Agreement will be given a distinguishing version number. The Program
(including Contributions) may always be distributed subject to the version
of the Agreement under which it was received. In addition, after a new
version of the Agreement is published, Contributor may elect to distribute
the Program (including its Contributions) under the new version. Except as
expressly stated in Sections 2(a) and 2(b) above, Recipient receives no
rights or licenses to the intellectual property of any Contributor under
this Agreement, whether expressly, by implication, estoppel or otherwise.
All rights in the Program not expressly granted under this Agreement are
reserved.</p>
<p>This Agreement is governed by the laws of the State of New York and the
intellectual property laws of the United States of America. No party to
this Agreement will bring a legal action under this Agreement more than one
year after the cause of action arose. Each party waives its rights to a
jury trial in any resulting litigation.</p>
<hr>
<a name="Permissive"></a>
<h2>Permissive Licenses</h2>
<p>Many free software licenses require reproduction of copyright ownership
information and the license text in the distribution documentation. Those
licenses are reproduced below.</p>
<hr>
<ul>
<li>Copyright © 1989 Carnegie Mellon University. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms are permitted
provided that the above copyright notice and this paragraph are
duplicated in all such forms and that any documentation,
advertising materials, and other materials related to such
distribution and use acknowledge that the software was developed
by Carnegie Mellon University. The name of the
University may not be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. </pre>
<hr>
<ul>
<li>Copyright © 2000-2002 Japan Network Information Center. All rights reserved.</li>
</ul>
<pre>The following License Terms and Conditions apply, unless a different
license is obtained from Japan Network Information Center ("JPNIC"),
a Japanese association, Kokusai-Kougyou-Kanda Bldg 6F, 2-3-4 Uchi-Kanda,
Chiyoda-ku, Tokyo 101-0047, Japan.
1. Use, Modification and Redistribution (including distribution of any
modified or derived work) in source and/or binary forms is permitted
under this License Terms and Conditions.
2. Redistribution of source code must retain the copyright notices as they
appear in each source code file, this License Terms and Conditions.
3. Redistribution in binary form must reproduce the Copyright Notice,
this License Terms and Conditions, in the documentation and/or other
materials provided with the distribution. For the purposes of binary
distribution the "Copyright Notice" refers to the following language:
"Copyright (c) 2000-2002 Japan Network Information Center. All rights reserved."
4. The name of JPNIC may not be used to endorse or promote products
derived from this Software without specific prior written approval of
JPNIC.
5. Disclaimer/Limitation of Liability: THIS SOFTWARE IS PROVIDED BY JPNIC
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JPNIC BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. </pre>
<hr>
<ul>
<li>Copyright © 2004 World Wide Web Consortium,</li>
<li>Copyright © 2000 World Wide Web Consortium, (Massachusetts Institute of Technology, Institut National de Recherche en Informatique et en Automatique, Keio University). All Rights Reserved.</li>
</ul>
<pre>Permission to copy, modify, and distribute this software and its
documentation, with or without modification, for any purpose and without fee
or royalty is hereby granted, provided that you include the following on ALL
copies of the software and documentation or portions thereof, including
modifications:
1. The full text of this NOTICE in a location viewable to users of the
redistributed or derivative work.
2. Any pre-existing intellectual property disclaimers, notices, or terms and
conditions. If none exist, the W3C Software Short Notice should be
included (hypertext is preferred, text is permitted) within the body of
any redistributed or derivative code.
3. Notice of any changes or modifications to the files, including the date
changes were made. (We recommend you provide URIs to the location from
which the code is derived.)
THIS SOFTWARE AND DOCUMENTATION IS PROVIDED "AS IS," AND COPYRIGHT HOLDERS
MAKE NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT
LIMITED TO, WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR
PURPOSE OR THAT THE USE OF THE SOFTWARE OR DOCUMENTATION WILL NOT INFRINGE
ANY THIRD PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS.
COPYRIGHT HOLDERS WILL NOT BE LIABLE FOR ANY DIRECT, INDIRECT, SPECIAL OR
CONSEQUENTIAL DAMAGES ARISING OUT OF ANY USE OF THE SOFTWARE OR DOCUMENTATION.
The name and trademarks of copyright holders may NOT be used in advertising
or publicity pertaining to the software without specific, written prior
permission. Title to copyright in this software and any associated
documentation will at all times remain with copyright holders. </pre>
<hr>
<ul>
</ul>
<pre>Boost Software License - Version 1.0 - August 17th, 2003
Permission is hereby granted, free of charge, to any person or organization
obtaining a copy of the software and accompanying documentation covered by
this license (the "Software") to use, reproduce, display, distribute,
execute, and transmit the Software, and to prepare derivative works of the
Software, and to permit third-parties to whom the Software is furnished to
do so, all subject to the following:
The copyright notices in the Software and this entire statement, including
the above license grant, this restriction and the following disclaimer,
must be included in all copies of the Software, in whole or in part, and
all derivative works of the Software, unless such copies or derivative
works are solely in the form of machine-executable object code generated by
a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2000-2003 Nara Institute of Science and Technology. All Rights Reserved.</li>
</ul>
<pre>Use, reproduction, and distribution of this software is permitted.
Any copy of this software, whether in its original form or modified,
must include both the above copyright notice and the following
paragraphs.
Nara Institute of Science and Technology (NAIST),
the copyright holders, disclaims all warranties with regard to this
software, including all implied warranties of merchantability and
fitness, in no event shall NAIST be liable for
any special, indirect or consequential damages or any damages
whatsoever resulting from loss of use, data or profits, whether in an
action of contract, negligence or other tortuous action, arising out
of or in connection with the use or performance of this software.
A large portion of the dictionary entries
originate from ICOT Free Software. The following conditions for ICOT
Free Software applies to the current dictionary as well.
Each User may also freely distribute the Program, whether in its
original form or modified, to any third party or parties, PROVIDED
that the provisions of Section 3 ("NO WARRANTY") will ALWAYS appear
on, or be attached to, the Program, which is distributed substantially
in the same form as set out herein and that such intended
distribution, if actually made, will neither violate or otherwise
contravene any of the laws and regulations of the countries having
jurisdiction over the User or the intended distribution itself.
NO WARRANTY
The program was produced on an experimental basis in the course of the
research and development conducted during the project and is provided
to users as so produced on an experimental basis. Accordingly, the
program is provided without any warranty whatsoever, whether express,
implied, statutory or otherwise. The term "warranty" used herein
includes, but is not limited to, any warranty of the quality,
performance, merchantability and fitness for a particular purpose of
the program and the nonexistence of any infringement or violation of
any right of any third party.
Each user of the program will agree and understand, and be deemed to
have agreed and understood, that there is no warranty whatsoever for
the program and, accordingly, the entire risk arising from or
otherwise connected with the program is assumed by the user.
Therefore, neither ICOT, the copyright holder, or any other
organization that participated in or was otherwise related to the
development of the program and their respective officials, directors,
officers and other employees shall be held liable for any and all
damages, including, without limitation, general, special, incidental
and consequential damages, arising out of or otherwise in connection
with the use or inability to use the program or any product, material
or result produced or otherwise obtained by using the program,
regardless of whether they have been advised of, or otherwise had
knowledge of, the possibility of such damages at any time during the
project or thereafter. Each user will be deemed to have agreed to the
foregoing by his or her commencement of use of the program. The term
"use" as used herein includes, but is not limited to, the use,
modification, copying and distribution of the program and the
production of secondary products from the program.
In the case where the program, whether in its original form or
modified, was distributed or delivered to or received by a user from
any person, organization or entity other than ICOT, unless it makes or
grants independently of ICOT any specific warranty to the user in
writing, such person, organization or entity, will also be exempted
from and not be held liable to the user for any such damages as noted
above as far as the program is concerned. </pre>
<hr>
<ul>
<li>Copyright © 1997 Causality Limited.</li>
<li>Copyright © 1997 Mark Brinicombe.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by Mark Brinicombe.
4. The name of the company nor the name of the author may be used to
endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1999-2008 The OpenSSL Project. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
3. All advertising materials mentioning features or use of this
software must display the following acknowledgment:
"This product includes software developed by the OpenSSL Project
for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
endorse or promote products derived from this software without
prior written permission. For written permission, please contact
[email protected].
5. Products derived from this software may not be called "OpenSSL"
nor may "OpenSSL" appear in their names without prior written
permission of the OpenSSL Project.
6. Redistributions of any form whatsoever must retain the following
acknowledgment:
"This product includes software developed by the OpenSSL Project
for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2009 Jouni Malinen <[email protected]> and contributors All Rights Reserved.</li>
<li>Copyright © 1998-2011 The OpenSSL Project. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
3. All advertising materials mentioning features or use of this
software must display the following acknowledgment:
"This product includes software developed by the OpenSSL Project
for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
endorse or promote products derived from this software without
prior written permission. For written permission, please contact
[email protected].
5. Products derived from this software may not be called "OpenSSL"
nor may "OpenSSL" appear in their names without prior written
permission of the OpenSSL Project.
6. Redistributions of any form whatsoever must retain the following
acknowledgment:
"This product includes software developed by the OpenSSL Project
for use in the OpenSSL Toolkit (http://www.openssl.org/)"
THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1998, 2001 Ben Harris</li>
<li>Copyright © 1994 Brini. All rights reserved.</li>
<li>Copyright © 1996 Brini.</li>
<li>Copyright © 1994-1996 Mark Brinicombe.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by Brini.
4. The name of the company nor the name of the author may be used to
endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY BRINI ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL BRINI OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1997 Mark Brinicombe All rights reserved.</li>
<li>Copyright © 2010 Android Open Source Project. All rights reserved.</li>
<li>Copyright © 1997 Mark Brinicombe</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by Mark Brinicombe
4. Neither the name of the University nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre>Copyright (c) 1998 - 2009, Paul Johnston & Contributors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Neither the name of the author nor the names of its contributors may be used
to endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1995-2009 International Business Machines Corporation and others</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, and/or sell copies of the Software, and to permit persons
to whom the Software is furnished to do so, provided that the above
copyright notice(s) and this permission notice appear in all copies of
the Software and that both the above copyright notice(s) and this
permission notice appear in supporting documentation.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
HOLDERS INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY
SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER
RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF
CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
Except as contained in this notice, the name of a copyright holder
shall not be used in advertising or otherwise to promote the sale, use
or other dealings in this Software without prior written authorization
of the copyright holder. </pre>
<hr>
<ul>
<li>Copyright © 2006 Keith Packard</li>
<li>Copyright © 2007-2008 Intel Corporation Jesse Barnes <[email protected]></li>
<li>Copyright © 2000 ATI Technologies Inc., Markham, Ontario, and VA Linux Systems Inc., Fremont, California.</li>
<li>Copyright © 2009 Marcin Kościelnicki</li>
<li>Copyright © 2009 VMware, Inc.</li>
<li>Copyright © 2007-2008 Dave Airlie</li>
<li>Copyright © 2008-2011 Red Hat Inc.</li>
<li>Copyright © 2006-2010 Advanced Micro Devices, Inc.</li>
<li>Copyright © 2005 Nicolai Haehnle et al.</li>
<li>Copyright © 2010 PathScale inc.</li>
<li>Copyright © 2009 Christian König.</li>
<li>Copyright © 2004 ATI Technologies Inc., Markham, Ontario</li>
<li>Copyright © 2009 Jerome Glisse.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007 Free Software Foundation, Inc.</li>
<li>Copyright © 2004 Simon Posnjak</li>
<li>Copyright © 1998 Cygnus Solutions</li>
<li>Copyright © 2005 Axis Communications AB</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
``Software''), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL SIMON POSNJAK BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2012 TJ Holowaychuk <[email protected]></li>
</ul>
<pre> Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the 'Software'), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2005-2006 Micronas USA Inc.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and the associated README documentation file (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007 Maarten Maathuis</li>
<li>Copyright © 2006-2007 Dave Airlie <[email protected]></li>
<li>Copyright © 2007-2008 Nouveau Project</li>
<li>Copyright © 2011 Red Hat, Inc.</li>
<li>Copyright © 2006 Dave Airlie</li>
<li>Copyright © 2007-2009 Stuart Bennett</li>
<li>Copyright © 2007 David Airlie</li>
<li>Copyright © 2009-2010 Nokia Corporation</li>
<li>Copyright © 2006-2008, 2010 Intel Corporation Jesse Barnes <[email protected]></li>
<li>Copyright © 2010 Daniel Vetter</li>
<li>Copyright © 2006-2010 Intel Corporation</li>
<li>Copyright © 2007 Dave Mueller</li>
<li>Copyright © 2009 Ben Skeggs</li>
<li>Copyright © 2005 Eric Anholt All Rights Reserved.</li>
<li>Copyright © 2005 Benjamin Herrenschmidt <[email protected]></li>
<li>Copyright © 2007, 2009 Tiago Vignatti <[email protected]></li>
<li>Copyright © 2005-2007 Kristian Hoegsberg <[email protected]></li>
<li>Copyright © 2009 Intel Corporation. All Rights Reserved.</li>
<li>Copyright © 1993-2003 NVIDIA, Corporation</li>
<li>Copyright © 2009</li>
<li>Copyright © 2011 SCore Corporation</li>
<li>Copyright © 2007 Paulo R. Zanoni <[email protected]></li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2004 The Unichrome Project. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sub license,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
THE UNICHROME PROJECT, AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2004 Renesas Technology</li>
<li>Copyright © 2008 Red Hat, Inc.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
``Software''), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL RENESAS TECHNOLOGY BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2009 Thomas Robinson <tlrobinson.net></li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation files
(the “Software”), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge,
publish, distribute, sublicense, and/or sell copies of the Software,
and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2002 Tungsten Graphics, Inc.</li>
<li>Copyright © 2004 BEAM Ltd.</li>
<li>Copyright © 2005 Thomas Hellstrom. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
BEAM LTD, TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2009-2010 Francisco Jerez. All Rights Reserved.</li>
<li>Copyright © 2010 Nouveau Project</li>
<li>Copyright © 2006-2007 Ben Skeggs.</li>
<li>Copyright © 2009 Red Hat <[email protected]></li>
<li>Copyright © 2009 Red Hat <[email protected]></li>
<li>Copyright © 2008 Maarten Maathuis. All Rights Reserved.</li>
<li>Copyright © 2007-2008 Ben Skeggs. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial
portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007-2009 The Khronos Group Inc.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and /or associated documentation files (the "Materials "), to
deal in the Materials without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
sell copies of the Materials, and to permit persons to whom the Materials are
furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Materials.
THE MATERIALS ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE MATERIALS OR THE USE OR OTHER DEALINGS IN THE
MATERIALS. </pre>
<hr>
<ul>
<li>Copyright © The Weather Channel, Inc. 2002. All Rights Reserved.</li>
<li>Copyright © 2005 Stephane Marchesin</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2006 Luc Verhaegen (quirks list)</li>
<li>Copyright © 2006 Dennis Munsie <[email protected]></li>
<li>Copyright © Red Hat Inc.</li>
<li>Copyright © 2010 Red Hat, Inc.</li>
<li>Copyright © 2007-2008 Intel Corporation Jesse Barnes <[email protected]></li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sub license,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2008-2009 Red Hat Inc.</li>
<li>Copyright © 2008-2010 Advanced Micro Devices, Inc.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE COPYRIGHT HOLDER(S) AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2002-2003 Dave Jones.</li>
<li>Copyright © 1999 Xi Graphics, Inc.</li>
<li>Copyright © 1999 Jeff Hartmann.</li>
<li>Copyright © 2004 Silicon Graphics, Inc.</li>
<li>Copyright © 1999 Precision Insight, Inc.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
JEFF HARTMANN, DAVE JONES, OR ANY OTHER CONTRIBUTORS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2005 Tom Wu All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND,
EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER
RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF
THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT
OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2006 Dave Airlie</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sub license, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1998, 2001, 2007-2008 Red Hat</li>
<li>Copyright © 2002-2008 Kaz Kojima</li>
<li>Copyright © 1996-2005, 2007-2010 Red Hat, Inc.</li>
<li>Copyright © 2003 Jakub Jelinek <[email protected]></li>
<li>Copyright © 2007-2008 Free Software Foundation, Inc.</li>
<li>Copyright © 2008 Red Hat, Inc</li>
<li>Copyright © 1996-2009 Anthony Green, Red Hat, Inc and others. See source files for details.</li>
<li>Copyright © 2001 John Beniton</li>
<li>Copyright © 2007-2009 Free Software Foundation, Inc</li>
<li>Copyright © 2009 Bradley Smith <[email protected]></li>
<li>Copyright © 2008 Björn König</li>
<li>Copyright © 2002 Roger Sayle</li>
<li>Copyright © 2002 Bo Thorsen</li>
<li>Copyright © 1998 Geoffrey Keating</li>
<li>Copyright © 2008 David Daney</li>
<li>Copyright © 2004, 2008-2009 Anthony Green</li>
<li>Copyright © 2000 Hewlett Packard Company</li>
<li>Copyright © 2000 Software AG</li>
<li>Copyright © 2002 Ranjit Mathew</li>
<li>Copyright © 2002, 2007 Bo Thorsen <[email protected]></li>
<li>Copyright © 1998 Andreas Schwab</li>
<li>Copyright © 2009 Daniel Witte</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
``Software''), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1991-2010 Unicode, Inc. All rights reserved. Distributed under the Terms of Use in http://www.unicode.org/copyright.html.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy
of the Unicode data files and any associated documentation (the "Data Files") or
Unicode software and any associated documentation (the "Software") to deal in
the Data Files or Software without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, and/or sell copies of
the Data Files or Software, and to permit persons to whom the Data Files or
Software are furnished to do so, provided that (a) the above copyright notice(s)
and this permission notice appear with all copies of the Data Files or Software,
(b) both the above copyright notice(s) and this permission notice appear in
associated documentation, and (c) there is clear notice in each modified Data
File or in the Software as well as in the documentation associated with the Data
File(s) or Software that the data or software has been modified.
THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD
PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS
NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL
DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR
SOFTWARE.
Except as contained in this notice, the name of a copyright holder shall not
be used in advertising or otherwise to promote the sale, use or other dealings
in these Data Files or Software without prior written authorization of the
copyright holder. </pre>
<hr>
<ul>
<li>Copyright © 2009 Jerome Glisse. All Rights Reserved.</li>
<li>Copyright © 2006 Tungsten Graphics, Inc., Bismarck., ND., USA. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sub license, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007-2008 Free Software Foundation, Inc</li>
<li>Copyright © 2000, 2007 Software AG</li>
<li>Copyright © 2002-2004 Free Software Foundation, Inc. based on ppc_closure.S</li>
<li>Copyright © 2000-2001 John Hornkvist</li>
<li>Copyright © 2002, 2009 Free Software Foundation, Inc. based on darwin.S by John Hornkvist</li>
<li>Copyright © 1998 Geoffrey Keating</li>
<li>Copyright © 2002, 2004, 2006-2007, 2009 Free Software Foundation, Inc.</li>
<li>Copyright © 2008 Red Hat, Inc. based on src/pa/linux.S</li>
<li>Copyright © 2002-2003, 2009 Free Software Foundation, Inc. based on darwin_closure.S</li>
<li>Copyright © 2008 Red Hat, Inc. derived from unix64.S</li>
<li>Copyright © 2008 Red Hat, Inc</li>
<li>Copyright © 2004 Anthony Green</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
``Software''), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007-2012 The Khronos Group Inc.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and/or associated documentation files (the
"Materials"), to deal in the Materials without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Materials, and to
permit persons to whom the Materials are furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Materials.
THE MATERIALS ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS. </pre>
<hr>
<ul>
<li>Copyright © 2009-2010 Ryan Lienhart Dahl. All rights reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to
deal in the Software without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
</pre>
<hr>
<ul>
<li>Copyright © 1993-1994 X Consortium</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2005-2006 Erik Waling</li>
<li>Copyright © 2007 Maarten Maathuis</li>
<li>Copyright © 2007-2009 Stuart Bennett</li>
<li>Copyright © 1993-2003 NVIDIA, Corporation</li>
<li>Copyright © 2006 Stephane Marchesin</li>
<li>Copyright © 2006 Dave Airlie</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1991-2004 Unicode, Inc. All rights reserved. Distributed under the Terms of Use in http://www.unicode.org/copyright.html.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy of
the Unicode data files and associated documentation (the "Data Files") or
Unicode software and associated documentation (the "Software") to deal in the
Data Files or Software without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, and/or sell copies of
the Data Files or Software, and to permit persons to whom the Data Files or
Software are furnished to do so, provided that (a) the above copyright notice(s)
and this permission notice appear in all copies of the Data Files or Software,
(b) both the above copyright notice(s) and this permission notice appear in
associated documentation, and (c) there is clear notice in each modified Data
File or in the Software as well as in the documentation associated with the Data
File(s) or Software that the data or software has been modified.
THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD
PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS
NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL
DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR
SOFTWARE.
Except as contained in this notice, the name of a copyright holder shall not be
used in advertising or otherwise to promote the sale, use or other dealings in
these Data Files or Software without prior written authorization of the
copyright holder. </pre>
<hr>
<ul>
<li>Copyright © 2004 Jon Smirl <[email protected]></li>
<li>Copyright © 1998-2003 VIA Technologies, Inc. All Rights Reserved.</li>
<li>Copyright © 2001-2003 S3 Graphics, Inc. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sub license,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
VIA, S3 GRAPHICS, AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1994-1996 SunSoft, Inc.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without restrict-
ion, including without limitation the rights to use, copy, modify,
merge, publish distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished
to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-
INFRINGEMENT. IN NO EVENT SHALL SUNSOFT, INC. OR ITS PARENT
COMPANY BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2005 Hewlett-Packard Development Company, L.P.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ </pre>
<hr>
<ul>
<li>Copyright © 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. USA. All Rights Reserved.</li>
<li>Copyright © 2007 David Airlie</li>
<li>Copyright © 2007-2008 Tungsten Graphics, Inc., Cedar Park, TX., USA, All Rights Reserved.</li>
<li>Copyright © 2010 Pauli Nieminen. All Rights Reserved.</li>
<li>Copyright © 2006 Tungsten Graphics, Inc., Bismack, ND. USA. All Rights Reserved.</li>
<li>Copyright © 2005 Thomas Hellstrom, All Rights Reserved.</li>
<li>Copyright © 2006-2010 VMware, Inc., Palo Alto, CA., USA All Rights Reserved.</li>
<li>Copyright © 2005 Thomas Hellstrom. All Rights Reserved.</li>
<li>Copyright © 2009 VMware, Inc., Palo Alto, CA., USA, All Rights Reserved.</li>
<li>Copyright © 2009 Red Hat Inc. All Rights Reserved.</li>
<li>Copyright © 2006 Tungsten Graphics, Inc., Bismarck, ND., USA. All Rights Reserved.</li>
<li>Copyright © 2004 The Unichrome project. All Rights Reserved.</li>
<li>Copyright © 2006 Tungsten Graphics, Inc., Bismarck, ND. USA. All Rights Reserved.</li>
<li>Copyright © 2006-2007 Tungsten Graphics, Inc., Cedar Park, TX., USA All Rights Reserved.</li>
<li>Copyright © 2004 Digeo, Inc., Palo Alto, CA, U.S.A. All Rights Reserved.</li>
<li>Copyright © 2006-2009 Vmware, Inc., Palo Alto, CA., USA All Rights Reserved.</li>
<li>Copyright © 2003 Tungsten Graphics, Inc., Cedar Park, Texas. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sub license, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1994 X Consortium</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to
deal in the Software without restriction, including without limitation the
rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © Dave Airlie 2005 All Rights Reserved.</li>
<li>Copyright © Paul Mackerras 2005</li>
<li>Copyright © Paul Mackerras 2005. All Rights Reserved.</li>
<li>Copyright © Alan Hourihane 2005 All Rights Reserved.</li>
<li>Copyright © Egbert Eich 2003,2004</li>
<li>Copyright © Paul Mackerras 2005 All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHOR BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2000 Ani Joshi <[email protected]></li>
<li>Copyright © 2003 Ben. Herrenschmidt <[email protected]></li>
<li>Copyright © 2000 ATI Technologies Inc., Markham, Ontario, and VA Linux Systems Inc., Fremont, California.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation on the rights to use, copy, modify, merge,
publish, distribute, sublicense, and/or sell copies of the Software,
and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial
portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NON-INFRINGEMENT. IN NO EVENT SHALL ATI, VA LINUX SYSTEMS AND/OR
THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007-2010 The Khronos Group Inc.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and/or associated documentation files (the
"Materials "), to deal in the Materials without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Materials, and to
permit persons to whom the Materials are furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Materials.
THE MATERIALS ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
MATERIALS OR THE USE OR OTHER DEALINGS IN THE MATERIALS. </pre>
<hr>
<ul>
<li>Copyright © 2008 Red Hat <[email protected]></li>
<li>Copyright © 2008 Intel Corporation <[email protected]></li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sub license, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial
portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NON-INFRINGEMENT. IN NO EVENT SHALL INTEL AND/OR ITS SUPPLIERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2002-2004 Dave Jones</li>
<li>Copyright © 1999 Jeff Hartmann</li>
<li>Copyright © 1999 Jeff Hartmann.</li>
<li>Copyright © 2004 Silicon Graphics, Inc.</li>
<li>Copyright © 1999 Precision Insight, Inc.</li>
<li>Copyright © 1999 Xi Graphics, Inc.</li>
<li>Copyright © 2002-2005 Dave Jones.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
JEFF HARTMANN, OR ANY OTHER CONTRIBUTORS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2008 M Joonas Pihlaja</li>
<li>Copyright © 2009 Red Hat</li>
<li>Copyright © 2011 Google, Inc.</li>
<li>Copyright © 2006 Bob Ippolito</li>
<li>Copyright © 2007 Dave Airlie <[email protected]></li>
<li>Copyright © 2010 Konstantin Belousov <[email protected]></li>
<li>Copyright © 2011 Linaro Limited</li>
<li>Copyright © 2009-2010 Ryan Lienhart Dahl. All rights reserved.</li>
<li>Copyright © 2007-2011 Mozilla Foundation</li>
<li>Copyright © 2008 Red Hat Inc.</li>
<li>Copyright © 1998-2007 Marti Maria</li>
<li>Copyright © 2007-2008 Red Hat, Inc.</li>
<li>Copyright © 2000-2005 CSR Ltd.</li>
<li>Copyright © 2006-2007 IBM</li>
<li>Copyright © 2008-2009 Benjamin Reed <[email protected]></li>
<li>Copyright © 2008-2011 Nokia Corporation</li>
<li>Copyright © 2004 BEA Systems</li>
<li>Copyright © 2002-2003 Stefan Haustein, Oberhausen, Rhld., Germany</li>
<li>Copyright © 2008-2010 The Khronos Group Inc.</li>
<li>Copyright © 2009 Ian Bicking, The Open Planning Project</li>
<li>Copyright © 2001-2007 Expat maintainers.</li>
<li>Copyright © 1998-2000 Thai Open Source Software Center Ltd and Clark Cooper</li>
<li>Copyright © 2006-2008 Intel Corporation</li>
<li>Copyright © 1999-2000 Ross Bencina and Phil Burk</li>
<li>Copyright © 2007 Tanner Lovelace <[email protected]></li>
<li>Copyright © 2011-2012 Fabien Cazenave, Mozilla.</li>
<li>Copyright © 2011 Erik Rose</li>
<li>Copyright © 2008 Colin Walters <[email protected]></li>
<li>Copyright © 2000-2012 by Francesco Zappa Nardelli</li>
<li>Copyright © 2005-2007 Henri Sivonen</li>
<li>Copyright © 2000-2006 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)</li>
<li>Copyright © 1997 Eric S. Raymond</li>
<li>Copyright © 2007-2009 Google, Inc</li>
<li>Copyright © 2009 The Mozilla Foundation <http://www.mozilla.org/></li>
<li>Copyright © 2007 David Mosberger-Tang</li>
<li>Copyright © 2007 James Coglan</li>
<li>Copyright © 2010 Lennart Poettering</li>
<li>Copyright © 2011 Konstantin Belousov <[email protected]></li>
<li>Copyright © 2001-2005 Hewlett-Packard Development Company, L.P.</li>
<li>Copyright © 2010-2011 by FERMI NATIONAL ACCELERATOR LABORATORY</li>
<li>Copyright © 2007 Keir Fraser, XenSource Inc</li>
<li>Copyright © 1998-2009 VMware, Inc. All rights reserved.</li>
<li>Copyright © 2009 Mozilla Corporation</li>
<li>Copyright © 2006 Lawrence Oluyede <[email protected]></li>
<li>Copyright © 2002, 2004 Hewlett-Packard Co.</li>
<li>Copyright © 2002-2005 ActiveState Corp.</li>
<li>Copyright © 2011-2012 The virtualenv developers</li>
<li>Copyright © 2001-2005 Hewlett-Packard Co</li>
<li>Copyright © 2007 David Turner</li>
<li>Copyright © 2012 the V8 project authors. All rights reserved.</li>
<li>Copyright © 2009 Jonas Bähr <[email protected]></li>
<li>Copyright © 2008 CodeSourcery</li>
<li>Copyright © 2006 Sony Computer Entertainment Inc.</li>
<li>Copyright © 2009 Red Hat, Inc. and/or its affiliates.</li>
<li>Copyright © 2003-2004 Fabrice Bellard</li>
<li>Copyright © 2008-2011 Collabora Ltd.</li>
<li>Copyright © 2009 Oliver Hunt <http://nerget.com></li>
<li>Copyright © 2007-2008 Tungsten Graphics, Inc., Cedar Park, TX., USA</li>
<li>Copyright © 2007 Jakob Bornecrantz <[email protected]></li>
<li>Copyright © 2007-2008 Michael G Schwern</li>
<li>Copyright © 2010 James Halliday ([email protected])</li>
<li>Copyright © 2005 Scott James Remnant <[email protected]>.</li>
<li>Copyright © 2004-2010 Apple Computer, Inc., Mozilla Foundation, and Opera Software ASA.</li>
<li>Copyright © 2007 Ian Bicking and Contributors</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2005-2006 Luc Verhaegen</li>
<li>Copyright © 1997-2003 by The XFree86 Project, Inc.</li>
<li>Copyright © 2001 Andy Ritger [email protected]</li>
<li>Copyright © 2007-2008 Intel Corporation Jesse Barnes <[email protected]></li>
<li>Copyright © 2007 Dave Airlie</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of the copyright holder(s)
and author(s) shall not be used in advertising or otherwise to promote
the sale, use or other dealings in this Software without prior written
authorization from the copyright holder(s) and author(s). </pre>
<hr>
<ul>
<li>Copyright © 1996-1997 David J. McKay</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
DAVID J. MCKAY BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1996-1998, 2000 Computing Research Labs, New Mexico State University</li>
<li>Copyright © 2001-2012 Francesco Zappa Nardelli</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE COMPUTING RESEARCH LAB OR NEW MEXICO STATE UNIVERSITY BE LIABLE FOR ANY
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT
OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR
THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2003 Leif Delgass.</li>
<li>Copyright © 2003 Leif Delgass. All Rights Reserved.</li>
<li>Copyright © 2009 The Linux Foundation. All Rights Reserved.</li>
<li>Copyright © 2003 José Fonseca.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2006 Tungsten Graphics Inc., Bismarck, ND., USA. All rights reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sub license,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2006 Behdad Esfahbod</li>
<li>Copyright © 2011 Codethink Limited</li>
<li>Copyright © 2009 Keith Stribley</li>
<li>Copyright © 2010, 2012 Mozilla Foundation</li>
<li>Copyright © 2007 Chris Wilson</li>
<li>Copyright © 2011 SIL International</li>
<li>Copyright © 2010-2012 Google, Inc.</li>
<li>Copyright © 2000, 2004, 2006-2010 Red Hat, Inc.</li>
<li>Copyright © 2008, 2010 Nokia Corporation and/or its subsidiary(-ies)</li>
<li>Copyright © 1998-2004 David Turner and Werner Lemberg</li>
<li>Copyright © 2005 David Turner</li>
<li>Copyright © 2011 Martin Hosken</li>
<li>Copyright © 2009 Martin Hosken and SIL International</li>
</ul>
<pre>Permission is hereby granted, without written agreement and without
license or royalty fees, to use, copy, modify, and distribute this
software and its documentation for any purpose, provided that the
above copyright notice and the following two paragraphs appear in
all copies of this software.
IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. </pre>
<hr>
<ul>
<li>Copyright © 2007-2008 Olav Bjorkoy (olav at bjorkoy.com)</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sub-license, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice, and every other copyright notice found in this
software, and all the attributions in every file, and this permission notice
shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1996 by Scott Laird</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL SCOTT LAIRD BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2004 Felix Kuehling All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sub license,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NON-INFRINGEMENT. IN NO EVENT SHALL FELIX KUEHLING BE LIABLE FOR
ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2002 Tungsten Graphics, Inc., Cedar Park, Texas. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2000 VA Linux Systems, Inc., Sunnyvale, California. All rights reserved.</li>
<li>Copyright © 2000 VA Linux Systems, Inc., Fremont, California.</li>
<li>Copyright © 2000 VA Linux Systems, Inc., Fremont, California. All rights reserved.</li>
<li>Copyright © 2000 VA Linux Systems, Inc., Fremont, California. All Rights Reserved.</li>
<li>Copyright © The Weather Channel, Inc. 2002.</li>
<li>Copyright © 2008 Stuart Bennett All Rights Reserved.</li>
<li>Copyright © 1999-2000 Precision Insight, Inc., Cedar Park, Texas.</li>
<li>Copyright © 2000-2001 VA Linux Systems, Inc., Sunnyvale, California. All Rights Reserved.</li>
<li>Copyright © 2007 Matthieu CASTET <[email protected]> All Rights Reserved.</li>
<li>Copyright © 2004 Nicolai Haehnle. All Rights Reserved.</li>
<li>Copyright © 2008 Jerome Glisse. All Rights Reserved.</li>
<li>Copyright © 2005 Stephane Marchesin</li>
<li>Copyright © 2005-2007 Stephane Marchesin All Rights Reserved.</li>
<li>Copyright © The Weather Channel, Inc. 2002. All Rights Reserved.</li>
<li>Copyright © 2007 Advanced Micro Devices, Inc. All Rights Reserved.</li>
<li>Copyright © 2002 Tungsten Graphics, Inc., Cedar Park, Texas. All rights reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2008 (c) Intel Corporation Jesse Barnes <[email protected]></li>
<li>Copyright © 2003 Tungsten Graphics, Inc., Cedar Park, Texas. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sub license, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2005 Thomas Hellstrom. All Rights Reserved.</li>
<li>Copyright © 2004 The Unichrome Project. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sub license,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the
next paragraph) shall be included in all copies or substantial portions
of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
THE AUTHOR(S), AND/OR THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007 Dave Airlied All Rights Reserved.</li>
<li>Copyright © 2009-2010 The Linux Foundation. All rights reserved.</li>
<li>Copyright © 2000 VA Linux Systems, Inc., Sunnyvale, California. All Rights Reserved.</li>
<li>Copyright © 2008 Ben Gamari <[email protected]> All Rights Reserved.</li>
<li>Copyright © 1999-2000 Precision Insight, Inc., Cedar Park, Texas.</li>
<li>Copyright © 2000 VA Linux Systems, Inc., Sunnyvale, California. All rights reserved.</li>
<li>Copyright © 2000 VA Linux Systems, Inc., Sunnyvale, California.</li>
<li>Copyright © 2008 Ben Gamari <[email protected]></li>
<li>Copyright © 2005 Stephane Marchesin. All Rights Reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
VA LINUX SYSTEMS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2006 Dave Airlie <[email protected]></li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
on the rights to use, copy, modify, merge, publish, distribute, sub
license, and/or sell copies of the Software, and to permit persons to whom
the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice (including the next
paragraph) shall be included in all copies or substantial portions of the
Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
THE COPYRIGHT HOLDERS AND/OR THEIR SUPPLIERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
USE OR OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1998-2009 Daniel Stenberg, <[email protected]>, et al.</li>
</ul>
<pre>This software is licensed as described in the file COPYING, which
you should have received as part of this distribution. The terms
are also available at http://curl.haxx.se/docs/copyright.html.
You may opt to use, copy, modify, merge, publish, distribute and/or sell
copies of the Software, and permit persons to whom the Software is
furnished to do so, under the terms of the COPYING file.
This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
KIND, either express or implied. </pre>
<hr>
<ul>
</ul>
<pre>SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
Copyright (C) Silicon Graphics, Inc. All Rights Reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice including the dates of first publication and either
this permission notice or a reference to http://oss.sgi.com/projects/FreeB/
shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of Silicon Graphics, Inc. shall
not be used in advertising or otherwise to promote the sale, use or other
dealings in this Software without prior written authorization from Silicon
Graphics, Inc. </pre>
<hr>
<ul>
<li>Copyright © 1987 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms are permitted
provided that: (1) source distributions retain this entire copyright
notice and comment, and (2) distributions including binaries display
the following acknowledgement: ``This product includes software
developed by the University of California, Berkeley and its contributors''
in the documentation or other materials provided with the distribution
and in all advertising materials mentioning features or use of this
software. Neither the name of the University nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. </pre>
<hr>
<ul>
<li>Copyright © 1990 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms with or without
modification are permitted provided that: (1) source distributions
retain this entire copyright notice and comment, and (2)
distributions including binaries display the following
acknowledgement: ``This product includes software developed by the
University of California, Berkeley and its contributors'' in the
documentation or other materials provided with the distribution and
in all advertising materials mentioning features or use of this
software. Neither the name of the University nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. </pre>
<hr>
<ul>
<li>Copyright © 2008 Android Open Source Project (source port randomization)</li>
<li>Copyright © 1985, 1988 1993</li>
<li>Copyright © 2008 Android Open Source Project (query id randomization)</li>
<li>Copyright © 1979-1980, 1983, 1985-1989, 1991-1994 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by the University of
California, Berkeley and its contributors.
4. Neither the name of the University nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1987-1992, 1994-1997 The Regents of the University of California. All rights reserved. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that: (1) source code distributions
retain the above copyright notice and this paragraph in its entirety, (2)
distributions including binary code include the above copyright notice and
this paragraph in its entirety in the documentation or other materials
provided with the distribution, and (3) all advertising materials mentioning
features or use of this software display the following acknowledgement:
``This product includes software developed by the University of California,
Lawrence Berkeley Laboratory and its contributors.'' Neither the name of
the University nor the names of its contributors may be used to endorse
or promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. </pre>
<hr>
<ul>
<li>Copyright © 1999-2000 RTFM, Inc. All Rights Reserved</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by Eric Rescorla for
RTFM, Inc.
4. Neither the name of RTFM, Inc. nor the name of Eric Rescorla may be
used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY ERIC RESCORLA AND RTFM, INC. ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY SUCH DAMAGE.
RTFM, Inc. has waived clause (3) above as of June 20, 2012 for files appearing
in this distribution. This waiver applies only to files included in this
distribution. it does not apply to any other part of ssldump not included in
this distribution. </pre>
<hr>
<ul>
<li>Copyright © 2003 Steven G. Kargl All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice unmodified, this list of conditions, and the following
disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2002 Jason Evans <[email protected]>. All rights reserved.</li>
<li>Copyright © 2008 Jason Evans <[email protected]>. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice(s), this list of conditions and the following disclaimer
unmodified other than the allowable addition of one or more
copyright notices.
2. Redistributions in binary form must reproduce the above copyright
notice(s), this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER(S) BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003 Steven G. Kargl All rights reserved.</li>
<li>Copyright © 2004 Richard Levitte <[email protected]> All rights reserved.</li>
<li>Copyright © 1991, 1993 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2006-2008 Alexander Chemeris</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008 Damien Miller <[email protected]></li>
<li>Copyright © 1997 Niels Provos <[email protected]></li>
<li>Copyright © 1995 Alex Tatmanjants <[email protected]> at Electronni Visti IA, Kiev, Ukraine. All rights reserved.</li>
<li>Copyright © 1997 Niklas Hallqvist. All rights reserved.</li>
<li>Copyright © 2008 Android Open Source Project (thread-safety) All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2010 Apple Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2006 Stefan Traby <[email protected]></li>
<li>Copyright © 2000-2010 Marc Alexander Lehmann <[email protected]></li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without modifica-
tion, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2004 Richard Levitte <[email protected]> All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL") version 2 as published by the Free
Software Foundation.
THIS SOFTWARE IS PROVIDED BY ALACRITECH, INC. ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ALACRITECH, INC. OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2007-2012 Mozilla Foundation. All rights reserved.</li>
<li>Copyright © 2009-2012 Facebook, Inc. All rights reserved.</li>
<li>Copyright © 2002-2012 Jason Evans <[email protected]>. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice(s),
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice(s),
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY EXPRESS
OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
EVENT SHALL THE COPYRIGHT HOLDER(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice and this list of conditions.
2. Redistributions in binary form must reproduce the above copyright
notice and this list of conditions in the documentation and/or other
materials provided with the distribution.
</pre>
<hr>
<ul>
<li>Copyright © 1994-2003 Dario Ballabio ([email protected])</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that redistributions of source
code retain the above copyright notice and this comment without
modification.
WARNING: if your 14/34F board has an old firmware revision (see below)
you must change "#undef" into "#define" in the following
statement.
</pre>
<hr>
<ul>
<li>Copyright © 2009-2011 The Linux Foundation. All rights reserved.</li>
<li>Copyright © 2002-2005 David Schultz <[email protected]></li>
<li>Copyright © 2011 The Android Open Source Project * All rights reserved.</li>
<li>Copyright © 2009 Android Open Source Project, All rights reserved.</li>
<li>Copyright © 2005 IBM Corporation Joachim Fenkes <[email protected]> Heiko J Schick <[email protected]></li>
<li>Copyright © 2005 IBM Corporation</li>
<li>Copyright © 2009 The Android Open Source Project</li>
<li>Copyright © 2008-2012 The Android Open Source Project. All rights reserved.</li>
<li>Copyright © 2009 The Android Open Project All rights reserved.</li>
<li>Copyright © 2003-2012 Michael Foord All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003, 2006-2011 Apple Inc. All rights reserved.</li>
<li>Copyright © 2007-2009 Torch Mobile, Inc.</li>
<li>Copyright © 2010-2011 Mozilla Corporation. All rights reserved.</li>
<li>Copyright © Research In Motion Limited 2010. All rights reserved.</li>
<li>Copyright © 2010 Google Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2011 NetLogic Microsystems, Inc. (NetLogic). All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY NETLOGIC ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL NETLOGIC OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008-2009, 2011 The Android Open Source Project</li>
<li>Copyright © 2011 Google Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2002 Daniel Hartmeier All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008-2010 The Android Open Source Project</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2004 Alex Aizman</li>
<li>Copyright © 2004 Dmitry Yusupov</li>
<li>Copyright © 2005 Mike Christie</li>
<li>Copyright © 2005-2006 Voltaire, Inc. All rights reserved. maintained by [email protected]</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or
without modification, are permitted provided that the following
conditions are met:
- Redistributions of source code must retain the above
copyright notice, this list of conditions and the following
disclaimer.
- Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials
provided with the distribution.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
Credits:
Christoph Hellwig
FUJITA Tomonori
Arne Redlich
Zhenyu Wang
Modified by:
Erez Zilber
</pre>
<hr>
<ul>
<li>Copyright © ST-Ericsson 2010-2011 Contact: Alexey Orishko <[email protected]> Original author: Hans Petter Selasky <[email protected]></li>
<li>Copyright © 2003 Mike Barcroft <[email protected]> All rights reserved.</li>
<li>Copyright © 2009-2010 Brad Penoff</li>
<li>Copyright © 2002 Tim J. Robbins All rights reserved.</li>
<li>Copyright © 2002 Markus Friedl All rights reserved.</li>
<li>Copyright © 2011-2012 Michael Tuexen</li>
<li>Copyright © 2006-2010 Roy Marples <[email protected]></li>
<li>Copyright © 2005 Tim J. Robbins. All rights reserved.</li>
<li>Copyright © 2009-2010 Humaira Kamal</li>
<li>Copyright © 2011-2012 Michael Tuexen All rights reserved.</li>
<li>Copyright © 2010 The Android Open Source Project. All rights reserved.</li>
<li>Copyright © 1982, 1986, 1988, 1990, 1993 The Regents of the University of California.</li>
<li>Copyright © 2006-2010 Roy Marples <[email protected]> All rights reserved</li>
<li>Copyright © 2003 Mike Barcroft <[email protected]></li>
<li>Copyright © 1999, 2001 Citrus Project, All rights reserved.</li>
<li>Copyright © 2002-2005, 2008 David Schultz <[email protected]> All rights reserved.</li>
<li>Copyright © 2002-2005 David Schultz <[email protected]></li>
<li>Copyright © 2002 Theo de Raadt</li>
<li>Copyright © 2002 Bob Beck <[email protected]></li>
<li>Copyright © 2011-2012 Irene Ruengeler</li>
<li>Copyright © 2005, 2009 David Schultz <[email protected]> All rights reserved.</li>
<li>Copyright © 2004-2005 David Schultz <[email protected]></li>
<li>Copyright © 2004 Stefan Farfeleder</li>
<li>Copyright © 2004 The FreeBSD Foundation</li>
<li>Copyright © 2004-2008 Robert N. M. Watson</li>
<li>Copyright © 2003 Networks Associates Technology, Inc. All rights reserved.</li>
<li>Copyright © 2012 Irene Ruengeler All rights reserved.</li>
<li>Copyright © 2002-2011 Tony Finch <[email protected]></li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2010-2012 by Robin Seggelmann. All rights reserved.</li>
<li>Copyright © 2010-2012 by Michael Tuexen. All rights reserved.</li>
<li>Copyright © 2010-2012 by Randall Stewart. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
a) Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
b) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009 Apple Inc. All rights reserved.</li>
<li>Copyright © 2009-2010 University of Szeged All rights reserved.</li>
<li>Copyright © 2010 Peter Varga ([email protected]), University of Szeged All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL UNIVERSITY OF SZEGED OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2007 David Schultz All rights reserved.</li>
<li>Copyright © 1992-2004 The FreeBSD Project. All rights reserved.</li>
<li>Copyright © 2004 Stefan Farfeleder All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2005 Colin Percival All rights reserved</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted providing that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2005, 2010 Voltaire Inc. All rights reserved.</li>
<li>Copyright © 2004-2005 Topspin Communications. All rights reserved.</li>
<li>Copyright © 2003-2010 Chelsio, Inc. All rights reserved.</li>
<li>Copyright © 2005 Sun Microsystems, Inc. All rights reserved.</li>
<li>Copyright © 2003-2010 Chelsio Communications, Inc. All rights reserved.</li>
<li>Copyright © 2005 Intel Inc. All rights reserved.</li>
<li>Copyright © 2005-2007 Cisco Systems. All rights reserved.</li>
<li>Copyright © 2005-2008 Mellanox Technologies. All rights reserved.</li>
<li>Copyright © 2005 Open Grid Computing, Inc. All rights reserved.</li>
<li>Copyright © 2005-2007 Cisco Systems, Inc. All rights reserved.</li>
<li>Copyright © 2006 Mellanox Technologies. All rights reserved</li>
<li>Copyright © 2002-2005 Network Appliance, Inc. All rights reserved.</li>
<li>Copyright © 2006-2009 Oracle. All rights reserved.</li>
<li>Copyright © 2009 HNR Consulting. All rights reserved.</li>
<li>Copyright © 2006-2008 Chelsio Communications. All rights reserved.</li>
<li>Copyright © 2004-2005 Mellanox Technologies Ltd. All rights reserved.</li>
<li>Copyright © 2004 Dmitry Yusupov</li>
<li>Copyright © 2006-2010 QLogic Corporation. All rights reserved.</li>
<li>Copyright © 2005 Mike Christie based on code maintained by [email protected]</li>
<li>Copyright © 2005 Ammasso, Inc. All rights reserved.</li>
<li>Copyright © 2003-2006 PathScale, Inc. All rights reserved.</li>
<li>Copyright © 2004 Alex Aizman</li>
<li>Copyright © 1999-2005 Mellanox Technologies, Inc. All rights reserved.</li>
<li>Copyright © 2004-2007 Voltaire, Inc. All rights reserved.</li>
<li>Copyright © 2006, 2009-2010 QLogic, Corporation. All rights reserved.</li>
<li>Copyright © 2004-2009 Intel Corporation. All rights reserved.</li>
<li>Copyright © 2004-2005 Topspin Corporation. All rights reserved.</li>
<li>Copyright © 2008 Cisco. All rights reserved.</li>
<li>Copyright © 2004-2005 Infinicon Corporation. All rights reserved.</li>
<li>Copyright © 2004-2007 Voltaire Corporation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or
without modification, are permitted provided that the following
conditions are met:
- Redistributions of source code must retain the above
copyright notice, this list of conditions and the following
disclaimer.
- Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials
provided with the distribution.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
</pre>
<hr>
<ul>
<li>Copyright © 2000-2002 Alacritech, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
THIS SOFTWARE IS PROVIDED BY ALACRITECH, INC. ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ALACRITECH, INC. OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2002 Marc Espie.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE OPENBSD PROJECT AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBSD
PROJECT OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008-2009 Apple Inc. All rights reserved.</li>
<li>Copyright © 2010 MIPS Technologies, Inc. All rights reserved.</li>
<li>Copyright © 2009 University of Szeged All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY MIPS TECHNOLOGIES, INC. ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL MIPS TECHNOLOGIES, INC. OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1994-2003 Dario Ballabio ([email protected])</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that redistributions of source
code retain the above copyright notice and this comment without
modification.
</pre>
<hr>
<ul>
<li>Copyright © 2009 The Android Open Source Project. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES ; LOSS
OF USE, DATA, OR PROFITS ; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2005 Cisco Systems. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or
without modification, are permitted provided that the following
conditions are met:
- Redistributions of source code must retain the above
copyright notice, this list of conditions and the following
disclaimer.
- Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials
provided with the distribution.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
$Id$
</pre>
<hr>
<ul>
<li>Copyright © 2010 Peter Varga ([email protected]), University of Szeged</li>
<li>Copyright © 2010 University of Szeged</li>
<li>Copyright © 2009 Apple Inc. All Rights Reserved.</li>
<li>Copyright © 2008 Apple Inc.</li>
<li>Copyright © 2008-2012 Apple Inc. All rights reserved.</li>
<li>Copyright © 2009-2010 University of Szeged All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2010-2011 Mozilla Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE MOZILLA FOUNDATION ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE MOZILLA FOUNDATION OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008-2009 Google Inc.</li>
<li>Copyright © 2006 Michael Emmel [email protected]. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, LOSS OF USE, DATA, OR
PROFITS, OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2006-2008 Jason Evans <[email protected]>. All rights reserved.</li>
<li>Copyright © the Mozilla Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice(s), this list of conditions and the following disclaimer as
the first lines of this file unmodified other than the possible
addition of one or more copyright notices.
2. Redistributions in binary form must reproduce the above copyright
notice(s), this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER(S) BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1995 Jason Downs. All rights reserved.</li>
<li>Copyright © 1998 Robert Nordier All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS
OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1989 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms are permitted
provided that the above copyright notice and this paragraph are
duplicated in all such forms and that any documentation,
advertising materials, and other materials related to such
distribution and use acknowledge that the software was developed
by the University of California, Berkeley. The name of the
University may not be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. </pre>
<hr>
<ul>
<li>Copyright © 1988 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms are permitted
provided that the above copyright notice and this paragraph are
duplicated in all such forms and that any documentation,
advertising materials, and other materials related to such
distribution and use acknowledge that the software was developed
by the University of California, Berkeley. The name of the
University may not be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. </pre>
<hr>
<ul>
<li>Copyright © 2009-2010 Witold Sowa <[email protected]></li>
<li>Copyright © 2004 2Wire, Inc</li>
<li>Copyright © 2003-2008 Jouni Malinen <[email protected]> and contributors All Rights Reserved.</li>
<li>Copyright © 2005-2006 Devicescape Software, Inc.</li>
<li>Copyright © 2009 Johannes Berg <[email protected]></li>
<li>Copyright © 2004 Luis R. Rodriguez <[email protected]></li>
<li>Copyright © 2000-2005 ATMEL Corporation</li>
<li>Copyright © 2006 Dan Williams <[email protected]> and Red Hat, Inc.</li>
<li>Copyright © 2004 Nikki Chumkov <[email protected]></li>
<li>Copyright © 2005 Zhu Yi <[email protected]></li>
<li>Copyright © 2004 Video54 Technologies</li>
<li>Copyright © 2007-2008 Intel Corporation</li>
<li>Copyright © 2008-2009 Jouke Witteveen</li>
<li>Copyright © 2004-2006 Giridhar Pemmasani <[email protected]></li>
<li>Copyright © 1999-2007 the contributors</li>
<li>Copyright © 2011 Kel Modderman <[email protected]></li>
<li>Copyright © 2004 Gunter Burchardt <[email protected]></li>
<li>Copyright © 2002-2004 Instant802 Networks, Inc.</li>
<li>Copyright © 2007 Andy Green <[email protected]></li>
<li>Copyright © 2012 The Linux Foundation. All rights reserved.</li>
<li>Copyright © 2002-2011 Jouni Malinen <[email protected]></li>
<li>Copyright © 2004-2005 Sam Leffler <[email protected]></li>
<li>Copyright © 2009 Atheros Communications</li>
<li>Copyright © 2004 Lubomir Gelo <[email protected]></li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name(s) of the above-listed copyright holder(s) nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre> ICU License - ICU 1.8.1 and later
COPYRIGHT AND PERMISSION NOTICE
Copyright (c) 1995-2008 International Business Machines Corporation and
others
All rights reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
provided that the above copyright notice(s) and this permission notice appear
in all copies of the Software and that both the above copyright notice(s) and
this permission notice appear in supporting documentation.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. IN
NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE
LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY
DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
Except as contained in this notice, the name of a copyright holder shall not
be used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization of the copyright holder.
All trademarks and registered trademarks mentioned herein are the property of
their respective owners. </pre>
<hr>
<ul>
<li>Copyright © 2010 Suitable Systems All rights reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the
"Software"), to deal with the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
- Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimers.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimers in the
documentation and/or other materials provided with the distribution.
- Neither the names of Suitable Systems nor the names of its
contributors may be used to endorse or promote products derived from
this Software without specific prior written permission.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
IN NO EVENT SHALL THE CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR
ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2011 University of Illinois at Urbana-Champaign. All rights reserved.</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal with
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimers.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimers in the
documentation and/or other materials provided with the distribution.
* Neither the names of the LLVM Team, University of Illinois at
Urbana-Champaign, nor the names of its contributors may be used to
endorse or promote products derived from this Software without specific
prior written permission.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1992-1994 by Jutta Degener and Carsten Bormann, Technische Universitaet Berlin</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software
for any purpose with or without fee is hereby granted,
provided that this notice is not removed and that neither
the authors nor the Technische Universitaet Berlin are
deemed to have made any representations as to the suitability
of this software for any purpose nor are held responsible
for any defects of this software. THERE IS ABSOLUTELY NO
WARRANTY FOR THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1990, 1993-1994, 1998 The Open Group</li>
<li>Copyright © 1993-1994, 1998 The Open Group.</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of The Open Group shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from The Open Group. </pre>
<hr>
<ul>
<li>Copyright © 1996 by Internet Software Consortium.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
SOFTWARE.
</pre>
<hr>
<ul>
<li>Copyright © 1994 by Ingo Wilken ([email protected])</li>
<li>Copyright © 1988 by Jef Poskanzer.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted, provided
that the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation. This software is provided "as is" without express or
implied warranty.
</pre>
<hr>
<ul>
<li>Copyright © 1994 Hewlett-Packard Company</li>
</ul>
<pre>Permission to use, copy, modify, distribute and sell this software
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and
that both that copyright notice and this permission notice appear
in supporting documentation. Hewlett-Packard Company makes no
representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty.
Copyright (c) 1997
Silicon Graphics Computer Systems, Inc.
Permission to use, copy, modify, distribute and sell this software
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and
that both that copyright notice and this permission notice appear
in supporting documentation. Silicon Graphics makes no
representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1992 Network Computing Devices, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted, provided
that the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Network Computing Devices may not be
used in advertising or publicity pertaining to distribution of the software
without specific, written prior permission. Network Computing Devices makes
no representations about the suitability of this software for any purpose.
It is provided ``as is'' without express or implied warranty.
NETWORK COMPUTING DEVICES DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS,
IN NO EVENT SHALL NETWORK COMPUTING DEVICES BE LIABLE FOR ANY SPECIAL,
INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1999 by Theodore Ts'o.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software for
any purpose with or without fee is hereby granted, provided that
the above copyright notice and this permission notice appear in all
copies. THE SOFTWARE IS PROVIDED "AS IS" AND THEODORE TS'O (THE
AUTHOR) DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER
RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. (Isn't </pre>
<hr>
<ul>
<li>Copyright © 1987, 1998 The Open Group</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of The Open Group shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from The Open Group.
Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
All Rights Reserved
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the name of Digital not be
used in advertising or publicity pertaining to distribution of the
software without specific, written prior permission. </pre>
<hr>
<ul>
<li>Copyright © David L. Mills 1993</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted, provided
that the above copyright notice appears in all copies and that both the
copyright notice and this permission notice appear in supporting
documentation, and that the name University of Delaware not be used in
advertising or publicity pertaining to distribution of the software
without specific, written prior permission. The University of Delaware
makes no representations about the suitability this software for any
purpose. It is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1991 by AT&T.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software for any
purpose without fee is hereby granted, provided that this entire notice
is included in all copies of any software which is or includes a copy
or modification of this software and in all copies of the supporting
documentation for such software.
THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR AT&T MAKES ANY
REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. </pre>
<hr>
<ul>
<li>Copyright © 1991-1995 Stichting Mathematisch Centrum Amsterdam, The Netherlands. All rights reserved.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the name of Stichting Mathematisch
Centrum or CWI not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior
permission.
STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1993-1994, 1998 The Open Group</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
THE OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of The Open Group shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from The Open Group. </pre>
<hr>
<ul>
<li>Copyright © 2005 Red Hat, Inc.</li>
<li>Copyright © 2004 David Reveman</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software
and its documentation for any purpose is hereby granted without
fee, provided that the above copyright notice appear in all copies
and that both that copyright notice and this permission notice
appear in supporting documentation, and that the name of David
Reveman not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior
permission. David Reveman makes no representations about the
suitability of this software for any purpose. It is provided "as
is" without express or implied warranty.
DAVID REVEMAN DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS, IN NO EVENT SHALL DAVID REVEMAN BE LIABLE FOR ANY SPECIAL,
INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER
RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2000-2007 by Kevin Atkinson</li>
</ul>
<pre>Permission to use, copy, modify, distribute and sell these word
lists, the associated scripts, the output created from the scripts,
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appears in all copies and
that both that copyright notice and this permission notice appear in
supporting documentation. Kevin Atkinson makes no representations
about the suitability of this array for any purpose. It is provided
"as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1987-1988 by MIT Student Information Processing Board.</li>
<li>Copyright © 1988 by the Student Information Processing Board of the Massachusetts Institute of Technology.</li>
<li>Copyright © 1987-1989 Massachusetts Institute of Technology (Student Information Processing Board)</li>
<li>Copyright © 1987-1989 by MIT</li>
<li>Copyright © 1987-1989 by Massachusetts Institute of Technology</li>
<li>Copyright © 1987 by the Student Information Processing Board of the Massachusetts Institute of Technology</li>
<li>Copyright © 1986-1988 by MIT Information Systems and the MIT Student Information Processing Board.</li>
<li>Copyright © 1987-1989, 2003 by MIT Student Information Processing Board</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and
its documentation for any purpose is hereby granted, provided that
the names of M.I.T. and the M.I.T. S.I.P.B. not be used in
advertising or publicity pertaining to distribution of the software
without specific, written prior permission. M.I.T. and the
M.I.T. S.I.P.B. make no representations about the suitability of
this software for any purpose. It is provided "as is" without
express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1998 Carnegie Mellon University</li>
</ul>
<pre>Permission to use, copy, modify and distribute this software and its
documentation is hereby granted for non-commercial purposes only
provided that this copyright notice appears in all copies and in
supporting documentation. </pre>
<hr>
<ul>
<li>Copyright © 2008-2009 Keith Packard</li>
<li>Copyright © 2007 Dave Airlie <[email protected]></li>
<li>Copyright © 2006-2009 Red Hat Inc.</li>
<li>Copyright © 2006-2008 Intel Corporation</li>
<li>Copyright © 2006, 2010 Joonas Pihlaja</li>
<li>Copyright © 2006 Eric Anholt</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that copyright
notice and this permission notice appear in supporting documentation, and
that the name of the copyright holders not be used in advertising or
publicity pertaining to distribution of the software without specific,
written prior permission. The copyright holders make no representations
about the suitability of this software for any purpose. It is provided "as
is" without express or implied warranty.
THE COPYRIGHT HOLDERS DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY SPECIAL, INDIRECT OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007-2008 Will Drewry <[email protected]></li>
<li>Copyright © 2008 Todd C. Miller <[email protected]></li>
<li>Copyright © 2007-2008 Pavel Roskin <[email protected]></li>
<li>Copyright © 2007-2008 Jiri Slaby <[email protected]></li>
<li>Copyright © 2008 Damien Miller <[email protected]></li>
<li>Copyright © 2007-2008 Michael Taylor <[email protected]></li>
<li>Copyright © 2010-2011 Mozilla Foundation</li>
<li>Copyright © 1997-1998, 2002, 2005 Todd C. Miller <[email protected]></li>
<li>Copyright © 2006-2009 Nick Kossifidis <[email protected]></li>
<li>Copyright © 1996 David Mazieres <[email protected]></li>
<li>Copyright © 2008-2009 Felix Fietkau <[email protected]></li>
<li>Copyright © 2007-2008 Matthew W. S. Bell <[email protected]></li>
<li>Copyright © 2004-2009 Reyk Floeter <[email protected]></li>
<li>Copyright © 2007-2008 Luis Rodriguez <[email protected]></li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1993 by Digital Equipment Corporation.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies, and that
the name of Digital Equipment Corporation not be used in advertising or
publicity pertaining to distribution of the document or software without
specific, written prior permission. </pre>
<hr>
<ul>
<li>Copyright © 1989 by Jef Poskanzer.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted, provided
that the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation. This software is provided "as is" without express or
implied warranty.
We are also required to state that
"The Graphics Interchange Format(c) is the Copyright property of
CompuServe Incorporated. GIF(sm) is a Service Mark property of
CompuServe Incorporated."
</pre>
<hr>
<ul>
<li>Copyright © 1993 by OpenVision Technologies, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appears in all copies and
that both that copyright notice and this permission notice appear in
supporting documentation, and that the name of OpenVision not be used
in advertising or publicity pertaining to distribution of the software
without specific, written prior permission. OpenVision makes no
representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty.
OPENVISION DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
EVENT SHALL OPENVISION BE LIABLE FOR ANY SPECIAL, INDIRECT OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1995-1996 Carnegie-Mellon University. All rights reserved.</li>
</ul>
<pre>Permission to use, copy, modify and distribute this software and
its documentation is hereby granted, provided that both the copyright
notice and this permission notice appear in all copies of the
software, derivative works or modified versions, and any portions
thereof, and that both notices appear in supporting documentation.
CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND
FOR ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1999 Samphan Raruenrom <[email protected]></li>
</ul>
<pre>Permission to use, copy, modify, distribute and sell this software
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and
that both that copyright notice and this permission notice appear
in supporting documentation. Samphan Raruenrom makes no
representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 2010 Nokia Corporation</li>
<li>Copyright © 2008 Mozilla Corporation</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Mozilla Corporation not be used in
advertising or publicity pertaining to distribution of the software without
specific, written prior permission. Mozilla Corporation makes no
representations about the suitability of this software for any purpose. It
is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1987-1989, 1998 The Open Group</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of The Open Group shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from The Open Group.
Copyright 1987, 1988, 1989 by
Digital Equipment Corporation, Maynard, Massachusetts.
All Rights Reserved
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the name of Digital not be
used in advertising or publicity pertaining to distribution of the
software without specific, written prior permission.
DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
SOFTWARE.
Copyright © 1998 Keith Packard
Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Keith Packard not be used in
advertising or publicity pertaining to distribution of the software without
specific, written prior permission. Keith Packard makes no </pre>
<hr>
<ul>
<li>Copyright © 1996-1998 Silicon Graphics Computer Systems, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, distribute and sell this software
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and
that both that copyright notice and this permission notice appear
in supporting documentation. Silicon Graphics makes no
representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty.
Copyright (c) 1994
Hewlett-Packard Company
Permission to use, copy, modify, distribute and sell this software
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and
that both that copyright notice and this permission notice appear
in supporting documentation. Hewlett-Packard Company makes no
representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 2007 Red Hat, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Red Hat not be used in advertising or
publicity pertaining to distribution of the software without specific,
written prior permission. Red Hat makes no representations about the
suitability of this software for any purpose. It is provided "as is"
without express or implied warranty.
RED HAT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL RED HAT
BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1994 The Australian National University. All rights reserved.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation is hereby granted, provided that the above copyright
notice appears in all copies. This software is provided without any
warranty, express or implied. The Australian National University
makes no representations about the suitability of this software for
any purpose.
IN NO EVENT SHALL THE AUSTRALIAN NATIONAL UNIVERSITY BE LIABLE TO ANY
PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF
THE AUSTRALIAN NATIONAL UNIVERSITY HAVE BEEN ADVISED OF THE POSSIBILITY
OF SUCH DAMAGE.
THE AUSTRALIAN NATIONAL UNIVERSITY SPECIFICALLY DISCLAIMS ANY WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
ON AN "AS IS" BASIS, AND THE AUSTRALIAN NATIONAL UNIVERSITY HAS NO
OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS,
OR MODIFICATIONS. </pre>
<hr>
<ul>
<li>Copyright © 2004 Sam Leffler, Errno Consulting</li>
<li>Copyright © 2004-2010 Atheros Communications Inc. All rights reserved.</li>
<li>Copyright © 2008-2009 Luis R. Rodriguez <[email protected]></li>
<li>Copyright © 2008 Michael Buesch <[email protected]></li>
<li>Copyright © 2010 Bruno Randolf <[email protected]></li>
<li>Copyright © 2009 Imre Kaloz <[email protected]></li>
<li>Copyright © 2006-2007 Ivo van Doorn</li>
<li>Copyright © 2008 Jouni Malinen <[email protected]></li>
<li>Copyright © 2004-2010 Atheros Corporation. All rights reserved.</li>
<li>Copyright © 2008-2011 Atheros Communications Inc.</li>
<li>Copyright © 2007 Dmitry Torokhov</li>
<li>Copyright © 2008 Luis Carlos Cobo <[email protected]></li>
<li>Copyright © 2008 Colin McCabe <[email protected]></li>
<li>Copyright © 2012 Grigori Goronzy <[email protected]></li>
<li>Copyright © 2009 Gabor Juhos <[email protected]></li>
<li>Copyright © 2006-2010 Johannes Berg <[email protected]></li>
<li>Copyright © 2010-2011 Broadcom Corporation</li>
<li>Copyright © 2004 Video54 Technologies, Inc.</li>
<li>Copyright © 2008 Michael Wu <[email protected]></li>
<li>Copyright © 2008 Michael Buesch <[email protected]></li>
<li>Copyright © 2004-2011 Atheros Communications, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2008 Aaron Plattner, NVIDIA Corporation</li>
<li>Copyright © 2005 Lars Knoll & Zack Rusin, Trolltech</li>
<li>Copyright © 2000 Keith Packard, member of The XFree86 Project, Inc.</li>
<li>Copyright © 2008 André Tupinambá <[email protected]></li>
<li>Copyright © 2007, 2009 Red Hat, Inc.</li>
<li>Copyright © 2000 SuSE, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Keith Packard not be used in
advertising or publicity pertaining to distribution of the software without
specific, written prior permission. Keith Packard makes no
representations about the suitability of this software for any purpose. It
is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 2008 Aaron Plattner, NVIDIA Corporation</li>
<li>Copyright © 2008 Rodrigo Kumpera</li>
<li>Copyright © 2005 Lars Knoll & Zack Rusin, Trolltech</li>
<li>Copyright © 2000 Keith Packard, member of The XFree86 Project, Inc.</li>
<li>Copyright © 2005 Trolltech AS</li>
<li>Copyright © 2004 Nicholas Miell</li>
<li>Copyright © 2004-2005, 2007, 2009 Red Hat, Inc.</li>
<li>Copyright © 2000 SuSE, Inc.</li>
<li>Copyright © 2008 André Tupinambá</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Red Hat not be used in advertising or
publicity pertaining to distribution of the software without specific,
written prior permission. Red Hat makes no representations about the
suitability of this software for any purpose. It is provided "as is"
without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 2006-2007 by Mike Taylor <[email protected]></li>
<li>Copyright © 2003-2004 by Peter Astrand <[email protected]></li>
<li>Copyright © 2006 by the Mozilla Foundation <http://www.mozilla.org/></li>
<li>Copyright © 2007-2008 by Mikeal Rogers <[email protected]></li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and
its associated documentation for any purpose and without fee is
hereby granted, provided that the above copyright notice appears in
all copies, and that both that copyright notice and this permission
notice appear in supporting documentation, and that the name of the
author not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior
permission.
THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, INDIRECT OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1997-1999 Carnegie Mellon University. All Rights Reserved.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and
its documentation is hereby granted (including for commercial or
for-profit use), provided that both the copyright notice and this
permission notice appear in all copies of the software, derivative
works, or modified versions, and any portions thereof.
THIS SOFTWARE IS EXPERIMENTAL AND IS KNOWN TO HAVE BUGS, SOME OF
WHICH MAY HAVE SERIOUS CONSEQUENCES. CARNEGIE MELLON PROVIDES THIS
SOFTWARE IN ITS ``AS IS'' CONDITION, AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH </pre>
<hr>
<ul>
<li>Copyright © 2002 Keith Packard, member of The XFree86 Project, Inc.</li>
<li>Copyright © 2004 Keith Packard</li>
<li>Copyright © 1998, 2004 Keith Packard Copyright 2007 Red Hat, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Keith Packard not be used in
advertising or publicity pertaining to distribution of the software without
specific, written prior permission. Keith Packard makes no
representations about the suitability of this software for any purpose. It
is provided "as is" without express or implied warranty.
KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2007 Luca Barbato</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Luca Barbato not be used in advertising or
publicity pertaining to distribution of the software without specific,
written prior permission. Luca Barbato makes no representations about the
suitability of this software for any purpose. It is provided "as is"
without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1987-1988 by the Student Information Processing Board of the Massachusetts Institute of Technology</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted, provided
that the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the names of M.I.T. and the M.I.T. S.I.P.B. not be
used in advertising or publicity pertaining to distribution of the software
without specific, written prior permission. M.I.T. and the M.I.T. S.I.P.B.
make no representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1999 Silicon Graphics Computer Systems, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, distribute and sell this software
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and
that both that copyright notice and this permission notice appear
in supporting documentation. Silicon Graphics makes no
representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1996-2011 Daniel Stenberg, <[email protected]>.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software for any purpose
with or without fee is hereby granted, provided that the above copyright
notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. IN
NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE
OR OTHER DEALINGS IN THE SOFTWARE.
Except as contained in this notice, the name of a copyright holder shall not
be used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization of the copyright holder. </pre>
<hr>
<ul>
<li>Copyright © Christian Werner <[email protected]></li>
</ul>
<pre>The authors hereby grant permission to use, copy, modify, distribute,
and license this software and its documentation for any purpose, provided
that existing copyright notices are retained in all copies and that this
notice is included verbatim in any distributions. No written agreement,
license, or royalty fee is required for any of the authorized uses.
Modifications to this software may be copyrighted by their authors
and need not follow the licensing terms described here, provided that
the new terms are clearly indicated on the first page of each file where
they apply.
IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY
FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT. THIS SOFTWARE
IS PROVIDED ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE
NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR
MODIFICATIONS. </pre>
<hr>
<ul>
<li>Copyright © 1995-1999 by Internet Software Consortium.</li>
<li>Copyright © 1995-2003 by Internet Software Consortium</li>
<li>Copyright © 2004, 2007 by Internet Systems Consortium, Inc. ("ISC")</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2009 ARM Ltd, Movial Creative Technologies Oy</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of ARM Ltd not be used in
advertising or publicity pertaining to distribution of the software without
specific, written prior permission. ARM Ltd makes no
representations about the suitability of this software for any purpose. It
is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1994 The Australian National University. All rights reserved.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation is hereby granted, provided that the above copyright
notice appears in all copies. This software is provided without any
warranty, express or implied. The Australian National University
makes no representations about the suitability of this software for
any purpose.
IN NO EVENT SHALL THE AUSTRALIAN NATIONAL UNIVERSITY BE LIABLE TO ANY
PARTY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF
THE AUSTRALIAN NATIONAL UNIVERSITY HAS BEEN ADVISED OF THE POSSIBILITY
OF SUCH DAMAGE.
THE AUSTRALIAN NATIONAL UNIVERSITY SPECIFICALLY DISCLAIMS ANY WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
ON AN "AS IS" BASIS, AND THE AUSTRALIAN NATIONAL UNIVERSITY HAS NO
OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS,
OR MODIFICATIONS. </pre>
<hr>
<ul>
<li>Copyright © 1997 by Princeton University. All rights reserved.</li>
</ul>
<pre>Permission to use, copy, modify and distribute this software and
database and its documentation for any purpose and without fee or
royalty is hereby granted, provided that you agree to comply with
the following copyright notice and statements, including the
disclaimer, and that the same appear on ALL copies of the software,
database and documentation, including modifications that you make
for internal use or for distribution.
THIS SOFTWARE AND DATABASE IS PROVIDED "AS IS" AND PRINCETON
UNIVERSITY MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR
IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PRINCETON
UNIVERSITY MAKES NO REPRESENTATIONS OR WARRANTIES OF MERCHANT-
ABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE
LICENSED SOFTWARE, DATABASE OR DOCUMENTATION WILL NOT INFRINGE ANY
THIRD PARTY PATENTS, COPYRIGHTS, TRADEMARKS OR OTHER RIGHTS.
The name of Princeton University or Princeton may not be used in
advertising or publicity pertaining to distribution of the software
and/or database. Title to copyright in this software, database and
any associated documentation shall at all times remain with
Princeton University and LICENSEE agrees to preserve same.
</pre>
<hr>
<ul>
<li>Copyright © 1991 by the Massachusetts Institute of Technology</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of M.I.T. not be used in advertising or
publicity pertaining to distribution of the software without specific,
written prior permission. M.I.T. makes no representations about the
suitability of this software for any purpose. It is provided "as is"
without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1999-2001 Naval Research Laboratory</li>
</ul>
<pre>Permission to use, copy, modify and distribute this software and its
documentation is hereby granted, provided that both the copyright
notice and this permission notice appear in all copies of the software,
derivative works or modified versions, and any portions thereof, and
that both notices appear in supporting documentation.
NRL ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS" CONDITION AND
DISCLAIMS ANY LIABILITY OF ANY KIND FOR ANY DAMAGES WHATSOEVER
RESULTING FROM THE USE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2009 Soren Sandmann</li>
<li>Copyright © 2000 SuSE, Inc.</li>
<li>Copyright © 2007, 2009 Red Hat, Inc.</li>
<li>Copyright © 1999 Keith Packard</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of SuSE not be used in advertising or
publicity pertaining to distribution of the software without specific,
written prior permission. SuSE makes no representations about the
suitability of this software for any purpose. It is provided "as is"
without express or implied warranty.
SuSE DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL SuSE
BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 1996 The Board of Trustees of The Leland Stanford Junior University. All Rights Reserved.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this
software and its documentation for any purpose and without
fee is hereby granted, provided that the above copyright
notice appear in all copies. Stanford University
makes no representations about the suitability of this
software for any purpose. It is provided "as is" without
express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 2002-2004 Google, Inc. All rights reserved.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation is hereby granted, provided that the above copyright
notice appears in all copies. This software is provided without any
warranty, express or implied.
ALTERNATIVELY, provided that this notice is retained in full, this product
may be distributed under the terms of the GNU General Public License (GPL),
in which case the provisions of the GPL apply INSTEAD OF those given above.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Changelog:
08/12/05 - Matt Domsch <[email protected]>
Only need extra skb padding on transmit, not receive.
06/18/04 - Matt Domsch <[email protected]>, Oleg Makarenko <[email protected]>
Use Linux kernel 2.6 arc4 and sha1 routines rather than
providing our own.
2/15/04 - TS: added #include <version.h> and testing for Kernel
version before using
MOD_DEC_USAGE_COUNT/MOD_INC_USAGE_COUNT which are
deprecated in 2.6
</pre>
<hr>
<ul>
<li>Copyright © 2000-2002 Red Hat.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software and its
documentation is hereby granted, provided that the above copyright
notice appears in all copies. This software is provided without any
warranty, express or implied. Red Hat makes no representations about
the suitability of this software for any purpose.
IN NO EVENT SHALL RED HAT BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT,
SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OF
THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF RED HAT HAS BEEN ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE.
RED HAT DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND
RED HAT HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES,
ENHANCEMENTS, OR MODIFICATIONS. </pre>
<hr>
<ul>
<li>Copyright © 1998 Mark of the Unicorn, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, distribute and sell this software
and its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and
that both that copyright notice and this permission notice appear
in supporting documentation. Mark of the Unicorn, Inc. makes no
representations about the suitability of this software for any
purpose. It is provided "as is" without express or implied warranty. </pre>
<hr>
<ul>
<li>Copyright © 1991, 2000-2001 by Lucent Technologies.</li>
</ul>
<pre>Permission to use, copy, modify, and distribute this software for any
purpose without fee is hereby granted, provided that this entire notice
is included in all copies of any software which is or includes a copy
or modification of this software and in all copies of the supporting
documentation for such software.
THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR LUCENT MAKES ANY
REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. </pre>
<hr>
<ul>
<li>Copyright © 2008 Red Hat, Inc.</li>
</ul>
<pre>Permission to use, copy, modify, distribute, and sell this software
and its documentation for any purpose is hereby granted without
fee, provided that the above copyright notice appear in all copies
and that both that copyright notice and this permission notice
appear in supporting documentation, and that the name of
Red Hat, Inc. not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior
permission. Red Hat, Inc. makes no representations about the
suitability of this software for any purpose. It is provided "as
is" without express or implied warranty.
RED HAT, INC. DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS, IN NO EVENT SHALL RED HAT, INC. BE LIABLE FOR ANY SPECIAL,
INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER
RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2010 Yahoo! Inc. All rights reserved.</li>
</ul>
<pre><!-- http://developer.yahoo.com/yui/license.html ->
http://yuilibrary.com/license/ -->
Redistribution and use of this software in source and binary forms, with or
without modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of Yahoo! Inc. nor the names of YUI's contributors may
be used to endorse or promote products derived from this software without
specific prior written permission of Yahoo! Inc.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2002-2010 Thorsten Glaser <[email protected]></li>
<li>Copyright © 2002-2010 * Thorsten Glaser <[email protected]></li>
</ul>
<pre>Provided that these terms and disclaimer and all copyright notices
are retained or reproduced in an accompanying document, permission
is granted to deal in this work without restriction, including un‐
limited rights to use, publicly perform, distribute, sell, modify,
merge, give away, or sublicence.
This work is provided “AS IS” and WITHOUT WARRANTY of any kind, to
the utmost extent permitted by applicable law, neither express nor
implied; without malicious intent or gross negligence. In no event
may a licensor, author or contributor be held liable for indirect,
direct, other damage, loss, or other issues arising in any way out
of dealing in the work, even if advised of the possibility of such
damage or existence of a defect, except proven that it results out
of said person’s immediate fault when using the work as intended. </pre>
<hr>
<ul>
<li>Copyright © 1995-1997 Eric Young ([email protected]) All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by Eric Young ([email protected])
THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1995-1998 Eric Young ([email protected]) All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
"This product includes cryptographic software written by
Eric Young ([email protected])"
The word 'cryptographic' can be left out if the rouines from the library
being used are not cryptographic related :-).
4. If you include any Windows specific code (or a derivative thereof) from
the apps directory (application code) you must include an acknowledgement:
"This product includes software written by Tim Hudson ([email protected])"
THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1996-2000, 2002-2004 The NetBSD Foundation, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by the NetBSD
Foundation, Inc. and its contributors.
4. Neither the name of The NetBSD Foundation nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009-2011 Mozilla Foundation and contributors</li>
</ul>
<pre><!-- http://opensource.org/licenses/BSD-3-Clause -->
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2010-2011 Google Inc.</li>
</ul>
<pre><!-- http://www.webmproject.org/license/software/ -->
Copyright (c) 2010, Google Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of Google nor the names of its contributors may be used
to endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS”
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
<!-- http://www.webmproject.org/license/additional/ -->
“This implementation” means the copyrightable works distributed by Google as
part of the WebM Project.
Google hereby grants to you a perpetual, worldwide, non-exclusive, no-charge,
royalty-free, irrevocable (except as stated in this section) patent license
to make, have made, use, offer to sell, sell, import, transfer, and otherwise
run, modify and propagate the contents of this implementation of VP8, where
such license applies only to those patent claims, both currently owned by
Google and acquired in the future, licensable by Google that are necessarily
infringed by this implementation of VP8. This grant does not include claims
that would be infringed only as a consequence of further modification of this
implementation. If you or your agent or exclusive licensee institute or order
or agree to the institution of patent litigation against any entity
(including a cross-claim or counterclaim in a lawsuit) alleging that this
implementation of VP8 or any code incorporated within this implementation of
VP8 constitutes direct or contributory patent infringement, or inducement of
patent infringement, then any patent rights granted to you under this License
for this implementation of VP8 shall terminate as of the date such litigation
is filed. </pre>
<hr>
<ul>
</ul>
<pre>This software is based in part on the work of the Independent JPEG Group. </pre>
<hr>
<ul>
<li>Copyright © 2011 Matteo Spinelli, http://cubiq.org</li>
</ul>
<pre>Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without
restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following
conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2010-2011 IBM Corporation and others.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Neither the name of the Eclipse Foundation, Inc. nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1983, 1993 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
[3 Deleted as of 22nd July 1999; see
ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
for details]
4. Neither the name of the University nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1997-1999 Justin T. Gibbs.</li>
<li>Copyright © 1997-1998 Kenneth D. Merry. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification, immediately at the beginning of the file.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2007 Network Appliance, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
Neither the name of the Network Appliance, Inc. nor the names of
its contributors may be used to endorse or promote products
derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1998 Softweyr LLC. All rights reserved.</li>
<li>Copyright © 1988, 1993 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notices, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notices, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
4. Neither the name of the University nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY SOFTWEYR LLC, THE REGENTS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SOFTWEYR LLC, THE
REGENTS, OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001-2007 by Cisco Systems, Inc. All rights reserved.</li>
<li>Copyright © 2000 Ben Harris.</li>
<li>Copyright © 2008-2012 by Michael Tuexen. All rights reserved.</li>
<li>Copyright © 1995-1997 and 1998 WIDE Project. All rights reserved.</li>
<li>Copyright © 2008-2012 by Randall Stewart. All rights reserved.</li>
<li>Copyright © 2007, 2011 The Android Open Source Project. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the project nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2002-2009 Xiph.org Foundation</li>
<li>Copyright © 2010 Robin Watts for Pinknoise Productions Ltd All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the
distribution.
* Neither the names of the Xiph.org Foundation nor Pinknoise
Productions Ltd nor the names of its contributors may be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2010-2011 Texas Instruments Incorporated - http://www.ti.com All rights reserved.</li>
<li>Copyright © 2010-2011 Texas Instruments Incorporated - http://www.ti.com</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of the above-listed copyright holders may not be used
to endorse or promote products derived from this software without
specific prior written permission.
ALTERNATIVELY, this software may be distributed under the terms of the
GNU General Public License ("GPL") version 2, as published by the Free
Software Foundation.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2005-2009 Myricom, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of Myricom, Inc. nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2002-2010 The ANGLE Project Authors. // All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
Neither the name of TransGaming Inc., Google Inc., 3DLabs Inc.
Ltd., nor the names of their contributors may be used to endorse
or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1993 Geoff Kuenning, Granada Hills, CA All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All modifications to the source code must be clearly marked as
such. Binary redistributions based on modified source code
must be clearly marked as modified versions in the documentation
and/or other materials provided with the distribution.
(clause 4 removed with permission from Geoff Kuenning)
5. The name of Geoff Kuenning may not be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY GEOFF KUENNING AND CONTRIBUTORS ``AS
IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL GEOFF
KUENNING OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001-2009 David M. Beazley (Dabeaz LLC) All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the David Beazley or Dabeaz LLC may be used to
endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2000-2009 Jython Developers. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the distribution.
- Neither the name of the Jython Developers nor the names of
its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2011 the Initial Developer. All Rights Reserved.</li>
<li>Copyright © 1996-2010 Julian R Seward. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. The origin of this software must not be misrepresented; you must
not claim that you wrote the original software. If you use this
software in a product, an acknowledgment in the product
documentation would be appreciated but is not required.
3. Altered source versions must be plainly marked as such, and must
not be misrepresented as being the original software.
4. The name of the author may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1999 Kungliga Tekniska Högskolan (Royal Institute of Technology, Stockholm, Sweden). All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of KTH nor the names of its contributors may be
used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001 Brian S. Julin All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
References:
HP-HIL Technical Reference Manual. Hewlett Packard Product No. 45918A
A note of thanks to HP for providing and shipping reference materials
free of charge to help in the development of HIL support for Linux.
</pre>
<hr>
<ul>
<li>Copyright © 2001 Brian S. Julin All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
References:
HP-HIL Technical Reference Manual. Hewlett Packard Product No. 45918A
</pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of IBM nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL IBM OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2012 The Linux Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of Code Aurora Forum, Inc. nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003 Constantin S. Svintsoff <[email protected]></li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of the authors may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2005 Oren J. Maurice <[email protected]></li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without modifica-
tion, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2007 Parakey Inc. All rights reserved.</li>
</ul>
<pre> Redistribution and use of this software in source and binary forms, with or
without modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of Parakey Inc. nor the names of its contributors may be
used to endorse or promote products derived from this software without
specific prior written permission of Parakey Inc.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2004 David Young. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of David Young may not be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY DAVID YOUNG ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL DAVID
YOUNG BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2004 Apple Computer, Inc. and The Mozilla Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the names of Apple Computer, Inc. ("Apple") or The Mozilla
Foundation ("Mozilla") nor the names of their contributors may be used
to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY APPLE, MOZILLA AND THEIR CONTRIBUTORS "AS
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE, MOZILLA OR
THEIR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003 Dag-Erling Coïdan Smørgrav All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer
in this position and unchanged.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009-2012 The Linux Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of The Linux Foundation nor
the names of its contributors may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NON-INFRINGEMENT ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001-2008 by Cisco Systems, Inc. All rights reserved.</li>
<li>Copyright © 2008-2012 by Brad Penoff. All rights reserved.</li>
<li>Copyright © 2008-2012 by Michael Tuexen. All rights reserved.</li>
<li>Copyright © 2008-2012 by Randall Stewart. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
a) Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
b) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the distribution.
c) Neither the name of Cisco Systems, Inc. nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
- Neither the name of the libjpeg-turbo Project nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS",
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2011 VMware, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the VMware, Inc. nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL VMWARE, INC. OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2011 The Linux Foundation. All rights reserved.</li>
<li>Copyright © 2008-2009 Motorola, Inc.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
- Neither the name of the Motorola, Inc. nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2007 Adobe Systems, Incorporated All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
Neither the name of Adobe Systems, Network Resonance nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1987-1988, 1990-1991, 1993-1994 Regents of the University of California. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. ***REMOVED*** - see
ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
4. Neither the name of the University nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1995 Jukka Marin <[email protected]>. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, and the entire permission notice in its entirety,
including the disclaimer of warranties.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote
products derived from this software without specific prior
written permission.
ALTERNATIVELY, this product may be distributed under the terms of
the GNU Public License, in which case the provisions of the GPL are
required INSTEAD OF the above restrictions. (This clause is
necessary due to a potential bad interaction between the GPL and
the restrictions contained in a BSD-style copyright.)
THIS SOFTWARE IS PROVIDED `AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2000 Dug Song <[email protected]></li>
<li>Copyright © 1980, 1982-1983, 1985-1995 Regents of the University of California. All rights reserved.</li>
<li>Copyright © 2005 Nick Mathewson <[email protected]></li>
<li>Copyright © 1992-1994 Henry Spencer.</li>
<li>Copyright © 1999 David E. O'Brien</li>
<li>Copyright © 2005 Robert N. M. Watson All rights reserved.</li>
<li>Copyright © UNIX System Laboratories, Inc. All or some portions of this file are derived from material licensed to the University of California by American Telephone and Telegraph Co. or Unix System Laboratories, Inc. and are reproduced herein with the permission of UNIX System Laboratories, Inc.</li>
<li>Copyright © 1982, 1986, 1993 * The Regents of the University of California. All rights reserved.</li>
<li>Copyright © 1987, 1993 The Regents of the University of California.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the University nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001-2007 Helge Deller <[email protected]> All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
HINT:
Support of the soft power switch button may be enabled or disabled at
runtime through the "/proc/sys/kernel/power" procfs entry.
</pre>
<hr>
<ul>
<li>Copyright © 1997 Justin T. Gibbs.</li>
<li>Copyright © 1995-1996 Daniel M. Eischen All rights reserved.</li>
<li>Copyright © 2000 Adaptec Inc. All rights reserved.</li>
<li>Copyright © 2000-2001 Christoph Hellwig. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2007-2009 Apple Inc. All rights reserved.</li>
<li>Copyright © 2006-2009 Mozilla Corporation. All rights reserved.</li>
<li>Copyright © 2006 Apple Computer, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of Apple Computer, Inc. ("Apple") nor the names of
its contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2000-2005 INRIA, France Telecom All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holders nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
- Neither the name of Analog Devices, Inc. nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
- The use of this software may or may not infringe the patent rights
of one or more patent holders. This license does not release you
from the requirement that you obtain separate licenses from these
patent holders to use this software.
THIS SOFTWARE IS PROVIDED BY ANALOG DEVICES "AS IS" AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, NON-INFRINGEMENT,
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL ANALOG DEVICES BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, INTELLECTUAL PROPERTY RIGHTS, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, and the entire permission notice in its entirety,
including the disclaimer of warranties.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote
products derived from this software without specific prior
written permission.
ALTERNATIVELY, this product may be distributed under the terms of
the GNU General Public License, in which case the provisions of the GPL are
required INSTEAD OF the above restrictions. (This clause is
necessary due to a potential bad interaction between the GPL and
the restrictions contained in a BSD-style copyright.)
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001-2005 Network Resonance, Inc.</li>
<li>Copyright © 2006-2007 Network Resonance, Inc. All Rights Reserved</li>
<li>Copyright © 1999, 2001 RTFM, Inc.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of Network Resonance, Inc. nor the name of any
contributors to this software may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, and the entire permission notice in its entirety,
including the disclaimer of warranties.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ALL OF
WHICH ARE HEREBY DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
USE OF THIS SOFTWARE, EVEN IF NOT ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2006-2012 the V8 project authors. All rights reserved.</li>
<li>Copyright © 2008-2009 The Linux Foundation. All rights reserved.</li>
<li>Copyright © 2008-2010 The Android Open Source Project. All rights reserved.</li>
<li>Copyright © 2008 Google, Inc. All Rights reserved</li>
<li>Copyright © 1998-2012 Google Inc. All rights reserved.</li>
<li>Copyright © 2008-2010 Google Inc. All rights reserved. http://code.google.com/p/protobuf</li>
<li>Copyright © 2005-2006, 2008-2011 Google Inc. All Rights Reserved.</li>
<li>Copyright © 2011 Martin Gieseking <[email protected]>.</li>
<li>Copyright © 2005 and onwards Google Inc.</li>
<li>Copyright © 2006-2012 The Chromium Authors. All rights reserved.</li>
<li>Copyright © 2008 Google Inc. All rights reserved</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Google, Inc. nor the names of its contributors
may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY SUN MICROSYSTEMS, INC. ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL SUN MICROSYSTEMS, INC. BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001 Christopher Gilbert All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the company nor the name of the author may be used to
endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009-2012 The Linux Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
Neither the name of The Linux Foundation nor the names of its contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2011 The WebRTC project authors. All rights reserved.</li>
<li>Copyright © 2011 The LibYuv Project Authors. All rights reserved.</li>
<li>Copyright © 2010 Google Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Google nor the names of its contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2004-2005 Sun Microsystems, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistribution of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistribution in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
Neither the name of Sun Microsystems, Inc. or the names of contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
This software is provided "AS IS," without a warranty of any kind. ALL
EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, INCLUDING
ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE
OR NON-INFRINGEMENT, ARE HEREBY EXCLUDED. SUN MICROSYSTEMS, INC. ("SUN")
AND ITS LICENSORS SHALL NOT BE LIABLE FOR ANY DAMAGES SUFFERED BY LICENSEE
AS A RESULT OF USING, MODIFYING OR DISTRIBUTING THIS SOFTWARE OR ITS
DERIVATIVES. IN NO EVENT WILL SUN OR ITS LICENSORS BE LIABLE FOR ANY LOST
REVENUE, PROFIT OR DATA, OR FOR DIRECT, INDIRECT, SPECIAL, CONSEQUENTIAL,
INCIDENTAL OR PUNITIVE DAMAGES, HOWEVER CAUSED AND REGARDLESS OF THE THEORY
OF LIABILITY, ARISING OUT OF THE USE OF OR INABILITY TO USE THIS SOFTWARE,
EVEN IF SUN HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. </pre>
<hr>
<ul>
<li>Copyright © 2005-2007 Jean-Marc Valin</li>
<li>Copyright © 2003-2004 Mark Borgerding</li>
</ul>
<pre> Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer. Redistributions in binary
form must reproduce the above copyright notice, this list of conditions and
the following disclaimer in the documentation and/or other materials provided
with the distribution. Neither the author nor the names of any contributors
may be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2000-2008 The Regents of the University of Michigan. All rights reserved.</li>
<li>Copyright © 2002-2003 The Regents of the University of Michigan. All rights reserved. > Marius Aamodt Eriksen <[email protected]></li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the University nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009 Jay Loden, Dave Daeschler, Giampaolo Rodola' All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the psutil authors nor the names of its contributors
may be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001 Brian S. Julin All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
References:
System Device Controller Microprocessor Firmware Theory of Operation
for Part Number 1820-4784 Revision B. Dwg No. A-1820-4784-2
Helge Deller's original hilkbd.c port for PA-RISC.
Driver theory of operation:
hp_sdc_put does all writing to the SDC. ISR can run on a different
CPU than hp_sdc_put, but only one CPU runs hp_sdc_put at a time
(it cannot really benefit from SMP anyway.) A tasket fit this perfectly.
All data coming back from the SDC is sent via interrupt and can be read
fully in the ISR, so there are no latency/throughput problems there.
The problem is with output, due to the slow clock speed of the SDC
compared to the CPU. This should not be too horrible most of the time,
but if used with HIL devices that support the multibyte transfer command,
keeping outbound throughput flowing at the 6500KBps that the HIL is
capable of is more than can be done at HZ=100.
Busy polling for IBF clear wastes CPU cycles and bus cycles. hp_sdc.ibf
is set to 0 when the IBF flag in the status register has cleared. ISR
may do this, and may also access the parts of queued transactions related
to reading data back from the SDC, but otherwise will not touch the
hp_sdc state. Whenever a register is written hp_sdc.ibf is set to 1.
The i8042 write index and the values in the 4-byte input buffer
starting at 0x70 are kept track of in hp_sdc.wi, and .r7[], respectively,
to minimize the amount of IO needed to the SDC. However these values
do not need to be locked since they are only ever accessed by hp_sdc_put.
A timer task schedules the tasklet once per second just to make
sure it doesn't freeze up and to allow for bad reads to time out.
</pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AS IS'' AND ANY EXPRESS
OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2012 The Linux Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of The Linux Foundation nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
</pre>
<hr>
<ul>
<li>Copyright © 2007 Eclipse Foundation, Inc. and its licensors.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
* Neither the name of the Eclipse Foundation, Inc. nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001-2006 Cisco Systems, Inc. * All rights reserved.</li>
<li>Copyright © 2001-2006 Cisco Systems, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
Neither the name of the Cisco Systems, Inc. nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009 Diego Giagio <[email protected]> All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of GIAGIO.COM nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
Alternatively, provided that this notice is retained in full, this
software may be distributed under the terms of the GNU General
Public License ("GPL") version 2, in which case the provisions of the
GPL apply INSTEAD OF those given above.
The provided data structures and external interfaces from this code
are not restricted to be used by modules with a GPL compatible license.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
Attention: iPhone device must be paired, otherwise it won't respond to our
driver. For more info: http://giagio.com/wiki/moin.cgi/iPhoneEthernetDriver
</pre>
<hr>
<ul>
<li>Copyright © 2007-2012 IETF Trust, Jean-Marc Valin. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name of Internet Society, IETF or IETF Trust, nor the
names of specific contributors, may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003 by Theodore Ts'o</li>
<li>Copyright © 1995-2001, 2004 Kungliga Tekniska Högskolan (Royal Institute of Technology, Stockholm, Sweden). All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the Institute nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2004 Intel Corporation.</li>
<li>Copyright © 2004-2008, 2010-2011 Wind River Systems All rights reserved.</li>
<li>Copyright © 1991-2007 Ericsson AB</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the names of the copyright holders nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL") version 2 as published by the Free
Software Foundation.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009 QUALCOMM USA, INC.</li>
</ul>
<pre> Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
· Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
· Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
· Neither the name of the QUALCOMM USA, INC. nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2005-2010 The Android Open Source Project. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of The Android Open Source Project nor the names
of its contributors may be used to endorse or promote products
derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2006-2012 IETF Trust and Skype Limited. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name of Internet Society, IETF or IETF Trust, nor the
names of specific contributors, may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS”
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1998-2007 InnoSys Incorporated. All Rights Reserved This file is available under a BSD-style copyright</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain this licence text
without modification, this list of conditions, and the following
disclaimer. The following copyright notice must appear immediately at
the beginning of all source files:
Copyright (c) 1998-2007 InnoSys Incorporated. All Rights Reserved
This file is available under a BSD-style copyright
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of InnoSys Incorprated may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY INNOSYS CORP. ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN
NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1996-1999, 2007 Theodore Ts'o.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, and the entire permission notice in its entirety,
including the disclaimer of warranties.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ALL OF
WHICH ARE HEREBY DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
USE OF THIS SOFTWARE, EVEN IF NOT ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
%End-Header%
</pre>
<hr>
<ul>
<li>Copyright © 2001 Brian S. Julin All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
References:
HP-HIL Technical Reference Manual. Hewlett Packard Product No. 45918A
Driver theory of operation:
Some access methods and an ISR is defined by the sub-driver
(e.g. hp_sdc_mlc.c). These methods are expected to provide a
few bits of logic in addition to raw access to the HIL MLC,
specifically, the ISR, which is entirely registered by the
sub-driver and invoked directly, must check for record
termination or packet match, at which point a semaphore must
be cleared and then the hil_mlcs_tasklet must be scheduled.
The hil_mlcs_tasklet processes the state machine for all MLCs
each time it runs, checking each MLC's progress at the current
node in the state machine, and moving the MLC to subsequent nodes
in the state machine when appropriate. It will reschedule
itself if output is pending. (This rescheduling should be replaced
at some point with a sub-driver-specific mechanism.)
A timer task prods the tasklet once per second to prevent
hangups when attached devices do not return expected data
and to initiate probes of the loop for new devices.
</pre>
<hr>
<ul>
<li>Copyright © 2006-2008, 2010 The Android Open Source Project</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Google Inc. nor the names of its contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY Google Inc. ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
EVENT SHALL Google Inc. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2005 Ingate Systems AB All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
Neither the name of the author(s) nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1998 Todd C. Miller <[email protected]> All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2008 Alan Stern</li>
<li>Copyright © 2009 Samsung Electronics</li>
<li>Copyright © 2003-2008 Alan Stern All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of the above-listed copyright holders may not be used
to endorse or promote products derived from this software without
specific prior written permission.
ALTERNATIVELY, this software may be distributed under the terms of the
GNU General Public License ("GPL") as published by the Free Software
Foundation, either version 2 of that License or (at your option) any
later version.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001-2005 by Thomas Winischhofer, Vienna, Austria</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3) The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2007 Google Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the
distribution.
* Neither the name of Google Inc. nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ </pre>
<hr>
<ul>
<li>Copyright © 2010 The WebM Project authors. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Google, nor the WebM Project, nor the names
of its contributors may be used to endorse or promote products
derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2000-2003 Adaptec Inc. All rights reserved.</li>
<li>Copyright © 2008-2009 USI Co., Ltd. All rights reserved.</li>
<li>Copyright © 1994-2002 Justin T. Gibbs.</li>
<li>Copyright © 1994-1998, 2000-2001 Justin T. Gibbs. All rights reserved.</li>
<li>Copyright © 2000-2011 Intel Corp. All rights reserved.</li>
<li>Copyright © 1997-1999 Doug Ledford</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. Redistributions in binary form must reproduce at minimum a disclaimer
substantially similar to the "NO WARRANTY" disclaimer below
("Disclaimer") and any redistribution must be conditioned upon
including a substantially similar Disclaimer requirement for further
binary redistribution.
3. Neither the names of the above-listed copyright holders nor the names
of any contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL") version 2 as published by the Free
Software Foundation.
NO WARRANTY
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES. </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the
distribution.
* Neither the name of Google Inc. nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE//
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, and the entire permission notice in its entirety,
including the disclaimer of warranties.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote
products derived from this software without specific prior
written permission.
ALTERNATIVELY, this product may be distributed under the terms of
the GNU General Public License, in which case the provisions of the GPL are
required INSTEAD OF the above restrictions. (This clause is
necessary due to a potential bad interaction between the GPL and
the restrictions contained in a BSD-style copyright.)
THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ALL OF
WHICH ARE HEREBY DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
USE OF THIS SOFTWARE, EVEN IF NOT ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
</pre>
<hr>
<ul>
<li>Copyright © 2005 by Thomas Winischhofer, Vienna, Austria</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3) The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESSED OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008 ARM Ltd All rights reserved.</li>
<li>Copyright © 2010-2011 The Android Open Source Project</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the company may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY ARM LTD ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL ARM LTD BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2004-2005 Jetro Lauha All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of the software product's copyright owner nor
the names of its contributors may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1994-2011 IETF Trust, Xiph.Org, Skype Limited, Octasic, Jean-Marc Valin, Timothy B. Terriberry, CSIRO, Gregory Maxwell, Mark Borgerding, Erik de Castro Lopo. All rights reserved.</li>
<li>Copyright © 2011-2012 IETF Trust, Jean-Marc Valin. All rights reserved.</li>
<li>Copyright © 2011-2012 IETF Trust, CSIRO, Xiph.Org Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name of Internet Society, IETF or IETF Trust, nor the
names of specific contributors, may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2010 Salvatore Sanfilippo <antirez at gmail dot com> All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Redis nor the names of its contributors may be used
to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009-2012 The Linux Foundation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of The Linux Foundation nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009 Tobias Doerffel <[email protected]></li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer,
without modification.
2. Redistributions in binary form must reproduce at minimum a disclaimer
similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
redistribution must be conditioned upon including a substantially
similar Disclaimer requirement for further binary redistribution.
3. Neither the names of the above-listed copyright holders nor the names
of any contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
NO WARRANTY
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGES. </pre>
<hr>
<ul>
<li>Copyright © 2007 Luis R. Rodriguez <[email protected]></li>
<li>Copyright © 2009 Bob Copeland <[email protected]></li>
<li>Copyright © 2002-2005 Sam Leffler, Errno Consulting</li>
<li>Copyright © 2002-2007 Sam Leffler, Errno Consulting All rights reserved.</li>
<li>Copyright © 2007 Jiri Slaby <[email protected]></li>
<li>Copyright © 2010 Bruno Randolf <[email protected]></li>
<li>Copyright © 2006 Devicescape Software, Inc.</li>
<li>Copyright © 2004-2005 Atheros Communications, Inc.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer,
without modification.
2. Redistributions in binary form must reproduce at minimum a disclaimer
similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
redistribution must be conditioned upon including a substantially
similar Disclaimer requirement for further binary redistribution.
3. Neither the names of the above-listed copyright holders nor the names
of any contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL") version 2 as published by the Free
Software Foundation.
NO WARRANTY
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGES. </pre>
<hr>
<ul>
<li>Copyright © 2001 Brian S. Julin All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
References:
HP-HIL Technical Reference Manual. Hewlett Packard Product No. 45918A
System Device Controller Microprocessor Firmware Theory of Operation
for Part Number 1820-4784 Revision B. Dwg No. A-1820-4784-2
</pre>
<hr>
<ul>
<li>Copyright © 2008 Google Inc.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of Google Inc. nor the names of its contributors may be
used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1997-1998 Justin T. Gibbs. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification, immediately at the beginning of the file.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Where this Software is combined with software released under the terms of
the GNU General Public License ("GPL") and the terms of the GPL would require the
combined work to also be released under the terms of the GPL, the terms
and conditions of this License will apply in addition to those of the
GPL with the exception of any terms or conditions of this License that
conflict with, or are expressly prohibited by, the GPL.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008 Thorvald Natvig</li>
<li>Copyright © 2000-2007 Josh Coalson</li>
<li>Copyright © 2003-2006 Epic Games</li>
<li>Copyright © 2002 Jean-Marc Valin & David Rowe</li>
<li>Copyright © 2005 Jean-Marc Valin, CSIRO, Christopher Montgomery</li>
<li>Copyright © 2011 Jyri Sarha, Texas Instruments</li>
<li>Copyright © 2005 Analog Devices</li>
<li>Copyright © 2006-2008 CSIRO, Jean-Marc Valin, Xiph.Org Foundation</li>
<li>Copyright © 1992-1994 Jutta Degener, Carsten Bormann</li>
<li>Copyright © 2002-2009 Xiph.org Foundation</li>
<li>Copyright © 2005-2008 Commonwealth Scientific and Industrial Research Organisation (CSIRO)</li>
<li>Copyright © 2005-2007 Analog Devices Inc.</li>
<li>Copyright © 2003-2004 Mark Borgerding</li>
<li>Copyright © 1992-1994 by Jutta Degener and Carsten Bormann, Technische Universitaet Berlin</li>
<li>Copyright © 1993, 2002, 2006 David Rowe</li>
<li>Copyright © 2002-2008 Jean-Marc Valin</li>
<li>Copyright © 2003 Epic Games (written by Jean-Marc Valin)</li>
<li>Copyright © 2003 EpicGames</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name of the Xiph.org Foundation nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003 The NetBSD Foundation, Inc. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of The NetBSD Foundation nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009 The Mozilla Foundation All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the Mozilla Foundation nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY The Mozilla Foundation ''AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL The Mozilla Foundation BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001 Brian S. Julin All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU General Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
References:
System Device Controller Microprocessor Firmware Theory of Operation
for Part Number 1820-4784 Revision B. Dwg No. A-1820-4784-2
efirtc.c by Stephane Eranian/Hewlett Packard
</pre>
<hr>
<ul>
<li>Copyright © Braunschweig, GERMANY</li>
<li>Copyright © 2002-2007 Volkswagen Group Electronic Research All rights reserved.</li>
<li>Copyright © 2003 Matthias Brukner, Trajet Gmbh, Rebenring 33,</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of Volkswagen nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
Alternatively, provided that this notice is retained in full, this
software may be distributed under the terms of the GNU General
Public License ("GPL") version 2, in which case the provisions of the
GPL apply INSTEAD OF those given above.
The provided data structures and external interfaces from this code
are not restricted to be used by modules with a GPL compatible license.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
Send feedback to <[email protected]>
</pre>
<hr>
<ul>
<li>Copyright © 2003 by Clemens Ladisch <[email protected]> All rights reserved.</li>
<li>Copyright © 2002-2009 Clemens Ladisch All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed and/or modified under the
terms of the GNU General Public License as published by the Free Software
Foundation; either version 2 of the License, or (at your option) any later
version.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008 Atheros Communications.</li>
<li>Copyright © 2006-2007 Sony Corporation. All Rights Reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Sony Corporation nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1998-2003 InnoSys Incorporated. All Rights Reserved This file is available under a BSD-style copyright</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain this licence text
without modification, this list of conditions, and the following
disclaimer. The following copyright notice must appear immediately at
the beginning of all source files:
Copyright (C) 1998-2000 InnoSys Incorporated. All Rights Reserved
This file is available under a BSD-style copyright
2. The name of InnoSys Incorporated may not be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY INNOSYS CORP. ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN
NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2010 Intel Corporation All rights reserved.</li>
<li>Copyright © 2007-2009 Intel Corporation. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Neither the name of Intel Corporation nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2001-2004 Ben Fennema <[email protected]> All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer,
without modification.
2. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
Alternatively, this software may be distributed under the terms of the
GNU Public License ("GPL").
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 1994-2005 Axis Communications. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Neither the name of Axis Communications nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY AXIS COMMUNICATIONS AND ITS CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL AXIS
COMMUNICATIONS OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2008 Thorvald Natvig</li>
<li>Copyright © 2000-2007 Niels Provos <[email protected]> All rights reserved.</li>
<li>Copyright © 1995-1996 Michael Elizabeth Chastain <[email protected]></li>
<li>Copyright © Google Inc.</li>
<li>Copyright © 1993 Christopher G. Demetriou All rights reserved.</li>
<li>Copyright © 2000 PocketPenguins Inc. Linux for Hitachi SuperH port by Greg Banks <[email protected]></li>
<li>Copyright © 2000 IBM Deutschland Entwicklung GmbH, IBM Coporation</li>
<li>Copyright © 1997 Christos Zoulas. All rights reserved.</li>
<li>Copyright © 2006 Maxim Yegorushkin <[email protected]> All rights reserved.</li>
<li>Copyright © 1999 IBM Deutschland Entwicklung GmbH, IBM Corporation</li>
<li>Copyright © 2006-2008 CSIRO, Jean-Marc Valin, Xiph.Org Foundation</li>
<li>Copyright © 1993-1996 Rick Sladkey <[email protected]></li>
<li>Copyright © 2002-2008 Jean-Marc Valin</li>
<li>Copyright © 1995-1999 Tekram Technology Co., Ltd.</li>
<li>Copyright © 1991-1992 Paul Kranenburg <[email protected]></li>
<li>Copyright © 1995-1996 Erik Theisen. All rights reserved.</li>
<li>Copyright © 1995 Ted Lemon (hereinafter referred to as the author)</li>
<li>Copyright © 1996-2001 Wichert Akkerman <[email protected]> All rights reserved.</li>
<li>Copyright © 1998-2001 Wichert Akkerman <[email protected]> All rights reserved.</li>
<li>Copyright © 2003 Epic Games (written by Jean-Marc Valin)</li>
<li>Copyright © 2006-2010 Freescale Semiconductor, Inc.</li>
<li>Copyright © 2000 PocketPenguins Inc. Linux for Hitachi SuperH port by Greg Banks <[email protected]> All rights reserved.</li>
<li>Copyright © 2004-2006 Epic Games</li>
<li>Copyright © 1993-1996 Rick Sladkey <[email protected]> All rights reserved.</li>
<li>Copyright © 1996-1999 Wichert Akkerman <[email protected]></li>
<li>Copyright © 1995-1996 Michael Elizabeth Chastain <[email protected]> All rights reserved.</li>
<li>Copyright © 1993 Branko Lankester <[email protected]></li>
<li>Copyright © 1999, 2001 Hewlett-Packard Co David Mosberger-Tang <[email protected]> All rights reserved.</li>
<li>Copyright © 1998 by Richard Braakman <[email protected]>.</li>
<li>Copyright © 1993 Ulrich Pegelow <[email protected]></li>
<li>Copyright © 2000 IBM Deutschland Entwicklung GmbH, IBM Coporation Authors: Ulrich Weigand <[email protected]> D.J. Barrow <[email protected],[email protected]> All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2005 by Thomas Winischhofer, Vienna, Austria</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3) The name of the author may not be used to endorse or promote products
derived from this software without specific psisusbr written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESSED OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2009-2011 Code Aurora Forum. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Code Aurora nor
the names of its contributors may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NON-INFRINGEMENT ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2003-2012 IETF Trust, Mark Borgerding. All rights reserved.</li>
<li>Copyright © 2003-2012 IETF Trust, Mark Borgerding, Jean-Marc Valin Xiph.Org Foundation, CSIRO. All rights reserved.</li>
</ul>
<pre>Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
- Neither the name of Internet Society, IETF or IETF Trust, nor the
names of specific contributors, may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
<li>Copyright © 2010, 2012 Adobe Systems Incorporated (http://www.adobe.com/), with Reserved Font Name 'Source'. All Rights Reserved. Source is a trademark of Adobe Systems Incorporated in the United States and/or other countries.</li>
<li>Copyright © 1997-2011 SIL International (http://scripts.sil.org/) with Reserved Font Names "Charis" and "SIL".</li>
</ul>
<pre> This Font Software is licensed under the SIL Open Font License, Version 1.1.
This license is copied below, and is also available with a FAQ at:
http://scripts.sil.org/OFL
----------------------------------------------------------- SIL OPEN FONT
LICENSE Version 1.1 - 26 February 2007
-----------------------------------------------------------
PREAMBLE The goals of the Open Font License (OFL) are to stimulate worldwide
development of collaborative font projects, to support the font creation
efforts of academic and linguistic communities, and to provide a free and open
framework in which fonts may be shared and improved in partnership with
others.
The OFL allows the licensed fonts to be used, studied, modified and
redistributed freely as long as they are not sold by themselves. The fonts,
including any derivative works, can be bundled, embedded, redistributed and/or
sold with any software provided that any reserved names are not used by
derivative works. The fonts and derivatives, however, cannot be released under
any other type of license. The requirement for fonts to remain under this
license does not apply to any document created using the fonts or their
derivatives.
DEFINITIONS "Font Software" refers to the set of files released by the
Copyright Holder(s) under this license and clearly marked as such. This may
include source files, build scripts and documentation.
"Reserved Font Name" refers to any names specified as such after the
copyright statement(s).
"Original Version" refers to the collection of Font Software components as
distributed by the Copyright Holder(s).
"Modified Version" refers to any derivative made by adding to, deleting, or
substituting -- in part or in whole -- any of the components of the Original
Version, by changing formats or by porting the Font Software to a new
environment.
"Author" refers to any designer, engineer, programmer, technical writer or
other person who contributed to the Font Software.
PERMISSION & CONDITIONS Permission is hereby granted, free of charge, to any
person obtaining a copy of the Font Software, to use, study, copy, merge,
embed, modify, redistribute, and sell modified and unmodified copies of the
Font Software, subject to the following conditions:
1) Neither the Font Software nor any of its individual components, in
Original or Modified Versions, may be sold by itself.
2) Original or Modified Versions of the Font Software may be bundled,
redistributed and/or sold with any software, provided that each copy contains
the above copyright notice and this license. These can be included either as
stand-alone text files, human-readable headers or in the appropriate machine-
readable metadata fields within text or binary files as long as those fields
can be easily viewed by the user.
3) No Modified Version of the Font Software may use the Reserved Font Name(s)
unless explicit written permission is granted by the corresponding Copyright
Holder. This restriction only applies to the primary font name as presented to
the users.
4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
Software shall not be used to promote, endorse or advertise any Modified
Version, except to acknowledge the contribution(s) of the Copyright Holder(s)
and the Author(s) or with their explicit written permission.
5) The Font Software, modified or unmodified, in part or in whole, must be
distributed entirely under this license, and must not be distributed under any
other license. The requirement for fonts to remain under this license does not
apply to any document created using the Font Software.
TERMINATION This license becomes null and void if any of the above conditions
are not met.
DISCLAIMER THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE COPYRIGHT
HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, INCLUDING ANY
GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF THE USE OR
INABILITY TO USE THE FONT SOFTWARE OR FROM OTHER DEALINGS IN THE FONT
SOFTWARE. </pre>
<hr>
<ul>
<li>Copyright © 2002 NVIDIA Corporation.</li>
</ul>
<pre>NVIDIA Corporation("NVIDIA") supplies this software to you in
consideration of your agreement to the following terms, and your use,
installation, modification or redistribution of this NVIDIA software
constitutes acceptance of these terms. If you do not agree with these
terms, please do not use, install, modify or redistribute this NVIDIA
software.
In consideration of your agreement to abide by the following terms, and
subject to these terms, NVIDIA grants you a personal, non-exclusive
license, under NVIDIA's copyrights in this original NVIDIA software (the
"NVIDIA Software"), to use, reproduce, modify and redistribute the
NVIDIA Software, with or without modifications, in source and/or binary
forms; provided that if you redistribute the NVIDIA Software, you must
retain the copyright notice of NVIDIA, this notice and the following
text and disclaimers in all such redistributions of the NVIDIA Software.
Neither the name, trademarks, service marks nor logos of NVIDIA
Corporation may be used to endorse or promote products derived from the
NVIDIA Software without specific prior written permission from NVIDIA.
Except as expressly stated in this notice, no other rights or licenses
express or implied, are granted by NVIDIA herein, including but not
limited to any patent rights that may be infringed by your derivative
works or by other works in which the NVIDIA Software may be
incorporated. No hardware is licensed hereunder.
THE NVIDIA SOFTWARE IS BEING PROVIDED ON AN "AS IS" BASIS, WITHOUT
WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED,
INCLUDING WITHOUT LIMITATION, WARRANTIES OR CONDITIONS OF TITLE,
NON-INFRINGEMENT, MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR
ITS USE AND OPERATION EITHER ALONE OR IN COMBINATION WITH OTHER
PRODUCTS.
IN NO EVENT SHALL NVIDIA BE LIABLE FOR ANY SPECIAL, INDIRECT,
INCIDENTAL, EXEMPLARY, CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
TO, LOST PROFITS; PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) OR ARISING IN ANY WAY
OUT OF THE USE, REPRODUCTION, MODIFICATION AND/OR DISTRIBUTION OF THE
NVIDIA SOFTWARE, HOWEVER CAUSED AND WHETHER UNDER THEORY OF CONTRACT,
TORT (INCLUDING NEGLIGENCE), STRICT LIABILITY OR OTHERWISE, EVEN IF
NVIDIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. </pre>
<hr>
<ul>
</ul>
<pre><!-- http://opensource.org/licenses/bsd-license.php -->
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE. </pre>
</body>
</html>
|
sergecodd/FireFox-OS
|
B2G/gaia/apps/settings/resources/open_source_license.html
|
HTML
|
apache-2.0
| 538,881 |
body, html{
font-family: Helvetica;
margin:0;
padding:0;
}
section {
position: relative;
width:100%;
padding:20px 0px;
height: auto;
}
/********************** fonts ***************************/
@font-face {
font-family:FuturaStd-Bold;
src: url(Fonts/FuturaStd-Bold.otf);
}
@font-face{
font-family: FuturaStd-Book;
src:url(Fonts/FuturaStd-Book.otf);
}
@font-face{
font-family: Gotham-Black;
src:url(Fonts/Gotham-Black.otf);
}
@font-face{
font-family: Gotham-Bold;
src:url(Fonts/Gotham-Bold.otf);
}
@font-face{
font-family: GothamRnd-Bold;
src:url(Fonts/GothamRnd-Bold.otf);
}
@font-face{
font-family: GothamRnd-Book;
src:url(Fonts/GothamRnd-Book.otf);
}
@font-face{
font-family: MyriadPro-Bold;
src:url(Fonts/MyriadPro-Bold.otf);
}
@font-face{
font-family: MyriadPro-Regular;
src:url(Fonts/MyriadPro-Regular.otf);
}
/********************** Menu ***************************/
#menu{
position:fixed;
top:0px;
left:0px;
width:100%;
height:50px;
z-index:10;
background:url(images/header.png);
text-align:left;
}
#headernom{
padding-top:10px;
}
.empty{
position:relative;
width:100%;
z-index:1;
height:50px;
}
.gracias
{
margin-bottom:0px;
font-family:FuturaStd-Bold;
color:#0a416a;
}
ul {
text-align: center;
display: inline;
margin: 0;
padding: 15px 4px 17px 0;
list-style: none;
}
ul li {
font: bold 12px/18px sans-serif;
display: inline-block;
margin-right: -4px;
position: relative;
padding: 15px 20px;
color: #fff;
cursor: pointer;
-webkit-transition: all 0.2s;
-moz-transition: all 0.2s;
-ms-transition: all 0.2s;
-o-transition: all 0.2s;
transition: all 0.2s;
}
ul li:hover {
color: #fff;
font-weight:bold;
}
/********************** End Menu ***************************/
/********************** Intro Section ***************************/
#intro {
background:url(images/doodllll.png) #fafaec repeat;
}
.content{
position:relative;
width:900px;
margin:auto;
text-align:center;
margin-bottom:25px;
margin-top:25px;
}
.par{
margin-bottom:10px;
}
iframe {
position:relative;
width:560px;
float:left;
}
.registrar{
position:relative;
width:300px;
padding:10px 10px;
margin-left:10px;
float:left;
font-family:Gotham-Black;
}
#logoSection
{
margin-bottom:15px;
}
.action{
color:#015886;
font-family:FuturaStd-Bold;
margin-top:0px;
margin-bottom:0px;
padding-bottom:0px;
padding-top:0px;
}
.imgs{
margin-left:10px;
}
/********************** End Intro Section ***************************/
p{
text-align:center;
max-width: 500px;
margin:0px auto;
padding:0px 25px;
}
#logo{
max-width:50%;
}
#mail {
background: #FFF;
width: 180px;
font-size:14px;
padding:5px 7px ;
margin:0;
margin-bottom:5px;
margin-top:5px;
border:#CCC thin solid;
border-radius:4px;
-webkit-border-radius:4px;
}
.radio{
color:#015886;
margin-top:1px;
font-family:"GothamRnd-Book","Gotham";
}
.float_left{
color:#015886;
}
.interes{
color:#015886;
margin-top:5px;
margin-bottom:0px;
}
.footer{
position: relative;
width: 100%;
height: auto;
background: #3C3C3C;
}
.foot{
display:inline;
}
.imagen{
max-width:80%;
}
}
.parrafo1{
font-size:200%;
color:#6f6969;
font-family:"Gotham-Black", "Gotham";
}
.parrafo2{
color:#6f6969;
font-family:"GothamRnd-Book","Gotham";
}
strong {
font-family:"GothamRnd-Bold","Gotham";
}
.myButton {
margin-top:30px;
background:-webkit-gradient(linear, left top, left bottom, color-stop(0.05, #0088ff), color-stop(1, #0091ff));
background:-moz-linear-gradient(top, #0088ff 5%, #0091ff 100%);
background:-webkit-linear-gradient(top, #0088ff 5%, #0091ff 100%);
background:-o-linear-gradient(top, #0088ff 5%, #0091ff 100%);
background:-ms-linear-gradient(top, #0088ff 5%, #0091ff 100%);
background:linear-gradient(to bottom, #0088ff 5%, #0091ff 100%);
filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#0088ff', endColorstr='#0091ff',GradientType=0);
background-color:#0088ff;
-moz-border-radius:28px;
-webkit-border-radius:28px;
border-radius:28px;
border:1px solid #0962e8;
display:inline-block;
cursor:pointer;
color:#ffffff;
font-family:arial;
font-size:17px;
padding:14px 55px;
text-decoration:none;
}
.myButton:hover {
background:-webkit-gradient(linear, left top, left bottom, color-stop(0.05, #0091ff), color-stop(1, #0088ff));
background:-moz-linear-gradient(top, #0091ff 5%, #0088ff 100%);
background:-webkit-linear-gradient(top, #0091ff 5%, #0088ff 100%);
background:-o-linear-gradient(top, #0091ff 5%, #0088ff 100%);
background:-ms-linear-gradient(top, #0091ff 5%, #0088ff 100%);
background:linear-gradient(to bottom, #0091ff 5%, #0088ff 100%);
filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#0091ff', endColorstr='#0088ff',GradientType=0);
background-color:#0091ff;
}
.myButton:active {
position:relative;
top:1px;
}
/********************** a Links ***************************/
a {
display: inline;
}
a:link{
text-decoration:none;
color: #3D3D3D;
}
a:hover{
color:#2CB2FF;
}
a:visited {
color: #3D3D3D;
}
a:active {
color:#2CB2FF;
}
/********************** Clearfix Hack ***************************/
.cf:before,
.cf:after {content: " "; display: table;}
.cf:after {clear: both;}
.cf {*zoom: 1;}
|
jresendiz27/SimpleWebSocketChat
|
public/stylesheets/data.css
|
CSS
|
apache-2.0
| 5,369 |
using System.Resources;
using System.Reflection;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
[assembly: AssemblyTitle("DataTransfer1")]
[assembly: AssemblyDescription("")]
[assembly: AssemblyConfiguration("")]
[assembly: AssemblyCompany("")]
[assembly: AssemblyProduct("DataTransfer1")]
[assembly: AssemblyCopyright("Copyright © 2014")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
[assembly: NeutralResourcesLanguage("en")]
// Version information for an assembly consists of the following four values:
//
// Major Version
// Minor Version
// Build Number
// Revision
//
// You can specify all the values or you can default the Build and Revision Numbers
// by using the '*' as shown below:
// [assembly: AssemblyVersion("1.0.*")]
[assembly: AssemblyVersion("1.0.0.0")]
[assembly: AssemblyFileVersion("1.0.0.0")]
|
weima-sage/xamarin-forms-book-preview-2
|
Chapter24/DataTransfer1/DataTransfer1/DataTransfer1/Properties/AssemblyInfo.cs
|
C#
|
apache-2.0
| 1,084 |
// Generated by CoffeeScript 1.10.0
(function() {
var sixDaysBefore;
App.Metrics = (function() {
function Metrics() {}
Metrics.repoEffectivenessIcon = function(repo) {
var rating;
rating = this.repoEffectiveness(repo);
if (rating >= 0 && rating < 3) {
return "fa-frown-o";
}
if (rating >= 3 && rating < 4.5) {
return "fa-meh-o";
}
if (rating >= 4.5 && rating < 7) {
return "fa-smile-o";
}
if (rating >= 7 && rating <= 10) {
return "fa-smile-o green-glow";
}
throw new RangeError("Rating was " + rating + ", but must be between 0 and 10");
};
Metrics.repoEffectivenessDesc = function(repo) {
return this.effectivenessDesc(this.repoEffectiveness(repo));
};
Metrics.repoEffectiveness = function(repo) {
return this.effectiveness(repo.closedPullRequestCount(), repo.openPullRequestCount(), repo.closedIssueCount(), repo.openIssueCount());
};
Metrics.effectivenessForIssues = function(weekOfIssues) {
var repo;
repo = new App.Repo('none/none', null, null, null, false);
repo.rawdata.issues = weekOfIssues;
return this.repoEffectiveness(repo);
};
Metrics.effectiveness = function(merged_prs, proposed_prs, closed_issues, new_issues) {
var inputs, issues, prs;
inputs = [merged_prs, proposed_prs, closed_issues, new_issues].join(", ");
prs = this.pr_effectiveness(merged_prs, proposed_prs);
issues = this.issue_effectiveness(closed_issues, new_issues);
return (0.66 * prs) + (0.34 * issues);
};
Metrics.prEffectiveness = function(repo) {
return this.pr_effectiveness(repo.closedPullRequestCount(), repo.openPullRequestCount());
};
Metrics.issueEffectiveness = function(repo) {
return this.issue_effectiveness(repo.closedIssueCount(), repo.openIssueCount());
};
Metrics.pr_effectiveness = function(merged_prs, proposed_prs) {
return this.scaled(this.ratio(merged_prs, proposed_prs));
};
Metrics.issue_effectiveness = function(closed_issues, new_issues) {
return this.scaled(this.ratio(closed_issues, new_issues));
};
Metrics.effectivenessDesc = function(rating) {
if (rating >= 0 && rating < 4) {
return "In the weeds";
}
if (rating >= 4 && rating < 7) {
return "Doing fine";
}
if (rating >= 7 && rating <= 10) {
return "Super effective!";
}
throw new RangeError("Rating was " + rating + ", but must be between 0 and 10");
};
Metrics.ratio = function(x, y) {
if (x === 0 && y === 0) {
return 1;
} else {
return x / y;
}
};
Metrics.scaled = function(ratio) {
if (ratio === Infinity) {
return 10;
}
return 10 * (ratio / (1 + ratio));
};
Metrics.groupByWeek = function(anArray, attribute) {
var items, previousDays, ref, thisWeek, weekEndingDate, weekStartingDate;
if (attribute == null) {
throw new RangeError("required param \"attribute\" not supplied");
}
if (_.isEmpty(anArray)) {
return [];
}
items = _.sortBy(anArray, attribute);
weekEndingDate = _.last(items)[attribute];
weekStartingDate = sixDaysBefore(weekEndingDate);
ref = _.partition(items, function(i) {
return i[attribute] >= weekStartingDate;
}), thisWeek = ref[0], previousDays = ref[1];
return this.groupByWeek(previousDays, attribute).concat([thisWeek]);
};
Metrics.randomIntFromInterval = function(min, max) {
return Math.floor(Math.random() * (max - min + 1) + min);
};
return Metrics;
})();
sixDaysBefore = function(aDate) {
return new Date(aDate.getFullYear(), aDate.getMonth(), aDate.getDate() - 6);
};
}).call(this);
|
dogweather/ducking-octo-dangerzone
|
lib/metrics.js
|
JavaScript
|
apache-2.0
| 3,844 |
#import "MWMSearchFilterViewController.h"
#import "MWMTypes.h"
#import "MWMHotelParams.h"
@class MWMSearchHotelsFilterViewController;
@protocol MWMSearchHotelsFilterViewControllerDelegate<NSObject>
- (void)hotelsFilterViewController:(MWMSearchHotelsFilterViewController *)viewController
didSelectParams:(MWMHotelParams *)params;
- (void)hotelsFilterViewControllerDidCancel:(MWMSearchHotelsFilterViewController *)viewController;
@end
@interface MWMSearchHotelsFilterViewController : MWMSearchFilterViewController
- (void)applyParams:(MWMHotelParams *)params;
@property (nonatomic, weak) id<MWMSearchHotelsFilterViewControllerDelegate> delegate;
@end
|
alexzatsepin/omim
|
iphone/Maps/UI/Search/Filters/MWMSearchHotelsFilterViewController.h
|
C
|
apache-2.0
| 678 |
<?php
$mkdir = "../../../../";
include($mkdir."conexion/config.inc.php");
$pcCod = $_POST['id'];
$query = 'SELECT * FROM sa_planes_estudio WHERE sa_planes_estudio.codigo ='.$pcCod;
$result = mysql_query($query);
$json = array();
$contadorIteracion = 0;
while ($fila = mysql_fetch_array($result)) {
// $json[$contadorIteracion] = array
// (
// "codPlan" => $fila["codigo"],
// "nombrePlan" => $fila["nombre"],
// "uvPlan" => $fila["uv"]
// );
$json[$contadorIteracion] = array
(
"codPlan" => $fila["codigo"],
"nombrePlan" => $fila["nombre"]
);
$contadorIteracion++;
}
//Retornamos el jason con todos los elmentos tomados de la base de datos.
echo json_encode($json);
?>
|
hllanosp/proyecto-ciencias-juridicas
|
pages/SecretariaAcademica/Mantenimiento/PlanesEstudio/actualizarPlanes.php
|
PHP
|
apache-2.0
| 872 |
<?php
/**
Template Name: Page with background only v2
*/
?>
<?php get_header(); ?>
<section id="content" role="main">
<?php if ( have_posts() ) : while ( have_posts() ) : the_post(); ?>
<header class="header">
</header>
<?php if ( has_post_thumbnail() ) { the_post_thumbnail(); } ?>
<?php the_content(); ?>
<div class="entry-links"><?php wp_link_pages(); ?></div>
<?php if ( ! post_password_required() ) comments_template('', true); ?>
<?php endwhile; endif; ?>
</section>
<?php //get_sidebar(); ?>
<?php get_footer(); ?>
|
Doap/sinkjuice.com
|
wp-content/themes/caricaturas-de-laprensa/background-only-v2.php
|
PHP
|
apache-2.0
| 524 |
/**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.hadoop.yarn.server.resourcemanager;
import static org.junit.Assert.assertNotNull;
import static org.junit.Assert.fail;
import java.io.IOException;
import java.util.Collection;
import org.apache.commons.logging.Log;
import org.apache.commons.logging.LogFactory;
import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.http.lib.StaticUserWebFilter;
import org.apache.hadoop.net.NetworkTopology;
import org.apache.hadoop.security.AuthenticationFilterInitializer;
import org.apache.hadoop.security.UserGroupInformation;
import org.apache.hadoop.yarn.api.records.Priority;
import org.apache.hadoop.yarn.api.records.Resource;
import org.apache.hadoop.yarn.api.records.ResourceRequest;
import org.apache.hadoop.yarn.conf.YarnConfiguration;
import org.apache.hadoop.yarn.exceptions.YarnException;
import org.apache.hadoop.yarn.exceptions.YarnRuntimeException;
import org.apache.hadoop.yarn.server.resourcemanager.rmapp.attempt.RMAppAttemptState;
import org.apache.hadoop.yarn.server.resourcemanager.rmnode.RMNode;
import org.apache.hadoop.yarn.server.resourcemanager.scheduler.capacity.CapacityScheduler;
import org.apache.hadoop.yarn.server.resourcemanager.scheduler.event.AppAttemptRemovedSchedulerEvent;
import org.apache.hadoop.yarn.server.resourcemanager.scheduler.event.NodeAddedSchedulerEvent;
import org.apache.hadoop.yarn.server.resourcemanager.scheduler.event.NodeUpdateSchedulerEvent;
import org.apache.hadoop.yarn.server.security.http.RMAuthenticationFilterInitializer;
import org.apache.hadoop.yarn.util.resource.Resources;
import org.junit.After;
import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;
public class TestResourceManager {
private static final Log LOG = LogFactory.getLog(TestResourceManager.class);
private ResourceManager resourceManager = null;
@Before
public void setUp() throws Exception {
Configuration conf = new YarnConfiguration();
conf.set(YarnConfiguration.RM_SCHEDULER,
CapacityScheduler.class.getCanonicalName());
UserGroupInformation.setConfiguration(conf);
resourceManager = new ResourceManager();
resourceManager.init(conf);
resourceManager.getRMContext().getContainerTokenSecretManager().rollMasterKey();
resourceManager.getRMContext().getNMTokenSecretManager().rollMasterKey();
}
@After
public void tearDown() throws Exception {
resourceManager.stop();
}
private org.apache.hadoop.yarn.server.resourcemanager.NodeManager
registerNode(String hostName, int containerManagerPort, int httpPort,
String rackName, Resource capability) throws IOException,
YarnException {
org.apache.hadoop.yarn.server.resourcemanager.NodeManager nm =
new org.apache.hadoop.yarn.server.resourcemanager.NodeManager(
hostName, containerManagerPort, httpPort, rackName, capability,
resourceManager);
NodeAddedSchedulerEvent nodeAddEvent1 =
new NodeAddedSchedulerEvent(resourceManager.getRMContext()
.getRMNodes().get(nm.getNodeId()));
resourceManager.getResourceScheduler().handle(nodeAddEvent1);
return nm;
}
@Test
public void testResourceAllocation() throws IOException,
YarnException, InterruptedException {
LOG.info("--- START: testResourceAllocation ---");
final int memory = 4 * 1024;
final int vcores = 4;
// Register node1
String host1 = "host1";
org.apache.hadoop.yarn.server.resourcemanager.NodeManager nm1 =
registerNode(host1, 1234, 2345, NetworkTopology.DEFAULT_RACK,
Resources.createResource(memory, vcores));
// Register node2
String host2 = "host2";
org.apache.hadoop.yarn.server.resourcemanager.NodeManager nm2 =
registerNode(host2, 1234, 2345, NetworkTopology.DEFAULT_RACK,
Resources.createResource(memory/2, vcores/2));
// Submit an application
Application application = new Application("user1", resourceManager);
application.submit();
application.addNodeManager(host1, 1234, nm1);
application.addNodeManager(host2, 1234, nm2);
// Application resource requirements
final int memory1 = 1024;
Resource capability1 = Resources.createResource(memory1, 1);
Priority priority1 =
org.apache.hadoop.yarn.server.resourcemanager.resource.Priority.create(1);
application.addResourceRequestSpec(priority1, capability1);
Task t1 = new Task(application, priority1, new String[] {host1, host2});
application.addTask(t1);
final int memory2 = 2048;
Resource capability2 = Resources.createResource(memory2, 1);
Priority priority0 =
org.apache.hadoop.yarn.server.resourcemanager.resource.Priority.create(0); // higher
application.addResourceRequestSpec(priority0, capability2);
// Send resource requests to the scheduler
application.schedule();
// Send a heartbeat to kick the tires on the Scheduler
nodeUpdate(nm1);
// Get allocations from the scheduler
application.schedule();
checkResourceUsage(nm1, nm2);
LOG.info("Adding new tasks...");
Task t2 = new Task(application, priority1, new String[] {host1, host2});
application.addTask(t2);
Task t3 = new Task(application, priority0, new String[] {ResourceRequest.ANY});
application.addTask(t3);
// Send resource requests to the scheduler
application.schedule();
checkResourceUsage(nm1, nm2);
// Send heartbeats to kick the tires on the Scheduler
nodeUpdate(nm2);
nodeUpdate(nm2);
nodeUpdate(nm1);
nodeUpdate(nm1);
// Get allocations from the scheduler
LOG.info("Trying to allocate...");
application.schedule();
checkResourceUsage(nm1, nm2);
// Complete tasks
LOG.info("Finishing up tasks...");
application.finishTask(t1);
application.finishTask(t2);
application.finishTask(t3);
// Notify scheduler application is finished.
AppAttemptRemovedSchedulerEvent appRemovedEvent1 =
new AppAttemptRemovedSchedulerEvent(
application.getApplicationAttemptId(), RMAppAttemptState.FINISHED, false);
resourceManager.getResourceScheduler().handle(appRemovedEvent1);
checkResourceUsage(nm1, nm2);
LOG.info("--- END: testResourceAllocation ---");
}
private void nodeUpdate(
org.apache.hadoop.yarn.server.resourcemanager.NodeManager nm1) {
RMNode node = resourceManager.getRMContext().getRMNodes().get(nm1.getNodeId());
// Send a heartbeat to kick the tires on the Scheduler
NodeUpdateSchedulerEvent nodeUpdate = new NodeUpdateSchedulerEvent(node);
resourceManager.getResourceScheduler().handle(nodeUpdate);
}
@Test
public void testNodeHealthReportIsNotNull() throws Exception{
String host1 = "host1";
final int memory = 4 * 1024;
org.apache.hadoop.yarn.server.resourcemanager.NodeManager nm1 =
registerNode(host1, 1234, 2345, NetworkTopology.DEFAULT_RACK,
Resources.createResource(memory, 1));
nm1.heartbeat();
nm1.heartbeat();
Collection<RMNode> values = resourceManager.getRMContext().getRMNodes().values();
for (RMNode ni : values) {
assertNotNull(ni.getHealthReport());
}
}
private void checkResourceUsage(
org.apache.hadoop.yarn.server.resourcemanager.NodeManager... nodes ) {
for (org.apache.hadoop.yarn.server.resourcemanager.NodeManager nodeManager : nodes) {
nodeManager.checkResourceUsage();
}
}
@Test (timeout = 30000)
public void testResourceManagerInitConfigValidation() throws Exception {
Configuration conf = new YarnConfiguration();
conf.setInt(YarnConfiguration.RM_AM_MAX_ATTEMPTS, -1);
try {
resourceManager = new MockRM(conf);
fail("Exception is expected because the global max attempts" +
" is negative.");
} catch (YarnRuntimeException e) {
// Exception is expected.
if (!e.getMessage().startsWith(
"Invalid global max attempts configuration")) throw e;
}
}
@Test
public void testNMExpiryAndHeartbeatIntervalsValidation() throws Exception {
Configuration conf = new YarnConfiguration();
conf.setLong(YarnConfiguration.RM_NM_EXPIRY_INTERVAL_MS, 1000);
conf.setLong(YarnConfiguration.RM_NM_HEARTBEAT_INTERVAL_MS, 1001);
try {
resourceManager = new MockRM(conf);
} catch (YarnRuntimeException e) {
// Exception is expected.
if (!e.getMessage().startsWith("Nodemanager expiry interval should be no"
+ " less than heartbeat interval")) {
throw e;
}
}
}
@Test(timeout = 50000)
public void testFilterOverrides() throws Exception {
String filterInitializerConfKey = "hadoop.http.filter.initializers";
String[] filterInitializers =
{
AuthenticationFilterInitializer.class.getName(),
RMAuthenticationFilterInitializer.class.getName(),
AuthenticationFilterInitializer.class.getName() + ","
+ RMAuthenticationFilterInitializer.class.getName(),
AuthenticationFilterInitializer.class.getName() + ", "
+ RMAuthenticationFilterInitializer.class.getName(),
AuthenticationFilterInitializer.class.getName() + ", "
+ this.getClass().getName() };
for (String filterInitializer : filterInitializers) {
resourceManager = new ResourceManager() {
@Override
protected void doSecureLogin() throws IOException {
// Skip the login.
}
};
Configuration conf = new YarnConfiguration();
conf.set(YarnConfiguration.RM_SCHEDULER,
CapacityScheduler.class.getCanonicalName());
conf.set(filterInitializerConfKey, filterInitializer);
conf.set("hadoop.security.authentication", "kerberos");
conf.set("hadoop.http.authentication.type", "kerberos");
try {
try {
UserGroupInformation.setConfiguration(conf);
} catch (Exception e) {
// ignore we just care about getting true for
// isSecurityEnabled()
LOG.info("Got expected exception");
}
resourceManager.init(conf);
resourceManager.startWepApp();
} catch (RuntimeException e) {
// Exceptions are expected because we didn't setup everything
// just want to test filter settings
String tmp = resourceManager.getConfig().get(filterInitializerConfKey);
if (filterInitializer.contains(this.getClass().getName())) {
Assert.assertEquals(RMAuthenticationFilterInitializer.class.getName()
+ "," + this.getClass().getName(), tmp);
} else {
Assert.assertEquals(
RMAuthenticationFilterInitializer.class.getName(), tmp);
}
resourceManager.stop();
}
}
// simple mode overrides
String[] simpleFilterInitializers =
{ "", StaticUserWebFilter.class.getName() };
for (String filterInitializer : simpleFilterInitializers) {
resourceManager = new ResourceManager();
Configuration conf = new YarnConfiguration();
conf.set(YarnConfiguration.RM_SCHEDULER,
CapacityScheduler.class.getCanonicalName());
conf.set(filterInitializerConfKey, filterInitializer);
try {
UserGroupInformation.setConfiguration(conf);
resourceManager.init(conf);
resourceManager.startWepApp();
} catch (RuntimeException e) {
// Exceptions are expected because we didn't setup everything
// just want to test filter settings
String tmp = resourceManager.getConfig().get(filterInitializerConfKey);
if (filterInitializer.equals(StaticUserWebFilter.class.getName())) {
Assert.assertEquals(RMAuthenticationFilterInitializer.class.getName()
+ "," + StaticUserWebFilter.class.getName(), tmp);
} else {
Assert.assertEquals(
RMAuthenticationFilterInitializer.class.getName(), tmp);
}
resourceManager.stop();
}
}
}
}
|
NJUJYB/disYarn
|
hadoop-yarn-project/hadoop-yarn/hadoop-yarn-server/hadoop-yarn-server-resourcemanager/src/test/java/org/apache/hadoop/yarn/server/resourcemanager/TestResourceManager.java
|
Java
|
apache-2.0
| 12,846 |
using System;
using System.Collections.Generic;
using System.Linq;
namespace Kingdom.OrTools.Sat.Parameters
{
internal class IndividualParameterTestCases : ParameterTestCasesBase
{
/// <summary>
/// Returns the <paramref name="descriptors"/> that are exclusively
/// <see cref="TestCaseDescriptor{T}"/> and not
/// <see cref="RepeatedTestCaseDescriptor{T}"/>.
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="descriptors"></param>
/// <param name="precision"></param>
/// <returns></returns>
private static IEnumerable<object[]> GetDescriptorTestCases<T>(IEnumerable<TestCaseDescriptor> descriptors, int? precision = null)
where T : IComparable
{
// ReSharper disable once LoopCanBeConvertedToQuery
foreach (var descriptor in descriptors.OfType<TestCaseDescriptor<T>>())
{
TestCaseDescriptor d = descriptor;
yield return GetRange(d.Instance, d.ValueType, d.Value, d.Rendered, d.Instance.Ordinal, precision).ToArray();
}
}
/// <summary>
/// Returns the <paramref name="descriptors"/> that are exclusively
/// <see cref="RepeatedTestCaseDescriptor{T}"/> and not
/// <see cref="TestCaseDescriptor{T}"/>.
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="descriptors"></param>
/// <param name="precision"></param>
/// <returns></returns>
private static IEnumerable<object[]> GetRepeatedDescriptorTestCases<T>(IEnumerable<TestCaseDescriptor> descriptors, int? precision = null)
where T : IComparable
{
// ReSharper disable once LoopCanBeConvertedToQuery
foreach (var descriptor in descriptors.OfType<RepeatedTestCaseDescriptor<T>>())
{
var d = descriptor;
yield return GetRange(d.Instance, d.ItemType, (object)d.Value, d.Rendered, d.Instance.Ordinal, precision).ToArray();
}
}
// ReSharper disable PossibleMultipleEnumeration
/// <summary>
/// Returns all those <paramref name="descriptors"/> that are exclusively
/// <see cref="TestCaseDescriptor{T}"/> of the form <typeparamref name="T1"/>,
/// <typeparamref name="T2"/>, <typeparamref name="T3"/>, <typeparamref name="T4"/>,
/// and <typeparamref name="T5"/>.
/// </summary>
/// <typeparam name="T1"></typeparam>
/// <typeparam name="T2"></typeparam>
/// <typeparam name="T3"></typeparam>
/// <typeparam name="T4"></typeparam>
/// <typeparam name="T5"></typeparam>
/// <param name="descriptors"></param>
/// <returns></returns>
/// <see cref="GetDescriptorTestCases{T}"/>
private static IEnumerable<object[]> GetAllDescriptorTestCases<T1, T2, T3, T4, T5>(IEnumerable<TestCaseDescriptor> descriptors)
where T1 : IComparable
where T2 : IComparable
where T3 : IComparable
where T4 : IComparable
where T5 : IComparable
{
foreach (var tc in GetDescriptorTestCases<T1>(descriptors))
{
yield return tc;
}
foreach (var tc in GetDescriptorTestCases<T2>(descriptors))
{
yield return tc;
}
foreach (var tc in GetDescriptorTestCases<T3>(descriptors))
{
yield return tc;
}
foreach (var tc in GetDescriptorTestCases<T4>(descriptors))
{
yield return tc;
}
foreach (var tc in GetDescriptorTestCases<T5>(descriptors))
{
yield return tc;
}
}
// ReSharper restore PossibleMultipleEnumeration
// ReSharper disable PossibleMultipleEnumeration
/// <summary>
/// Returns all those <paramref name="descriptors"/> that are exclusively
/// <see cref="RepeatedTestCaseDescriptor{T}"/> of the form <typeparamref name="T1"/>,
/// <typeparamref name="T2"/>, <typeparamref name="T3"/>, <typeparamref name="T4"/>,
/// and <typeparamref name="T5"/>.
/// </summary>
/// <typeparam name="T1"></typeparam>
/// <typeparam name="T2"></typeparam>
/// <typeparam name="T3"></typeparam>
/// <typeparam name="T4"></typeparam>
/// <typeparam name="T5"></typeparam>
/// <param name="descriptors"></param>
/// <returns></returns>
/// <see cref="GetRepeatedDescriptorTestCases{T}"/>
private static IEnumerable<object[]> GetAllRepeatedDescriptorTestCases<T1, T2, T3, T4, T5>(IEnumerable<TestCaseDescriptor> descriptors)
where T1 : IComparable
where T2 : IComparable
where T3 : IComparable
where T4 : IComparable
where T5 : IComparable
{
foreach (var tc in GetRepeatedDescriptorTestCases<T1>(descriptors))
{
yield return tc;
}
foreach (var tc in GetRepeatedDescriptorTestCases<T2>(descriptors))
{
yield return tc;
}
foreach (var tc in GetRepeatedDescriptorTestCases<T3>(descriptors))
{
yield return tc;
}
foreach (var tc in GetRepeatedDescriptorTestCases<T4>(descriptors))
{
yield return tc;
}
foreach (var tc in GetRepeatedDescriptorTestCases<T5>(descriptors))
{
yield return tc;
}
}
// ReSharper restore PossibleMultipleEnumeration
private static IEnumerable<object[]> _privateCases;
protected override IEnumerable<object[]> Cases
{
get
{
const int defaultPrecision = 3;
// ReSharper disable PossibleMultipleEnumeration
IEnumerable<object[]> GetAll(IEnumerable<TestCaseDescriptor> descriptors)
{
// Does not really matter the order of the generic arguments but for consistency sake throughout.
foreach (var tc in GetAllDescriptorTestCases<bool, int, long, Month, AnnotatedWeekday>(descriptors))
{
yield return tc;
}
// With Double generic arguments being the odd man out due to Precision requirements.
foreach (var tc in GetDescriptorTestCases<double>(descriptors, defaultPrecision))
{
yield return tc;
}
// Ditto Singular Descriptor Test Cases, rinse and repeat for Repeated, pardon the pun.
foreach (var tc in GetAllRepeatedDescriptorTestCases<bool, int, long, Month, AnnotatedWeekday>(descriptors))
{
yield return tc;
}
foreach (var tc in GetRepeatedDescriptorTestCases<double>(descriptors, defaultPrecision))
{
yield return tc;
}
}
// ReSharper restore PossibleMultipleEnumeration
// We think this is a bit cleaner now that we depend upon a statically defined Descriptors in the base class.
return _privateCases ?? (_privateCases = GetAll(Descriptors).ToArray());
}
}
}
}
|
mwpowellhtx/Kingdom.ConstraintSolvers
|
src/Kingdom.OrTools.Sat.Parameters.Tests/Cases/IndividualParameterTestCases.cs
|
C#
|
apache-2.0
| 7,664 |
/**
*
* Copyright 2004 The Apache Software Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.geronimo.kernel;
import java.io.IOException;
import java.io.Serializable;
/**
* @version $Rev$ $Date$
*/
public class ClassLoaderReference extends ClassLoader implements Serializable {
private ClassLoader classloader;
public ClassLoaderReference(ClassLoader parent) {
super(parent);
}
private void readObject(java.io.ObjectInputStream in) throws IOException, ClassNotFoundException{
in.defaultReadObject();
ObjectInputStreamExt objectInputStreamExt = (ObjectInputStreamExt)in;
classloader = objectInputStreamExt.getClassloader();
}
private Object readResolve() {
return classloader;
}
}
|
vibe13/geronimo
|
modules/kernel/src/java/org/apache/geronimo/kernel/ClassLoaderReference.java
|
Java
|
apache-2.0
| 1,307 |
#!/bin/sh
make ci
|
360EntSecGroup-Skylar/goreporter
|
linters/spellcheck/misspell/precommit.sh
|
Shell
|
apache-2.0
| 18 |
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License.
// <auto-generated/>
#nullable disable
using System;
using System.Collections.Generic;
namespace Azure.Search.Documents.Indexes.Models
{
/// <summary> A skill for merging two or more strings into a single unified string, with an optional user-defined delimiter separating each component part. </summary>
public partial class MergeSkill : SearchIndexerSkill
{
/// <summary> Initializes a new instance of MergeSkill. </summary>
/// <param name="inputs"> Inputs of the skills could be a column in the source data set, or the output of an upstream skill. </param>
/// <param name="outputs"> The output of a skill is either a field in a search index, or a value that can be consumed as an input by another skill. </param>
public MergeSkill(IEnumerable<InputFieldMappingEntry> inputs, IEnumerable<OutputFieldMappingEntry> outputs) : base(inputs, outputs)
{
if (inputs == null)
{
throw new ArgumentNullException(nameof(inputs));
}
if (outputs == null)
{
throw new ArgumentNullException(nameof(outputs));
}
ODataType = "#Microsoft.Skills.Text.MergeSkill";
}
/// <summary> Initializes a new instance of MergeSkill. </summary>
/// <param name="oDataType"> Identifies the concrete type of the skill. </param>
/// <param name="name"> The name of the skill which uniquely identifies it within the skillset. A skill with no name defined will be given a default name of its 1-based index in the skills array, prefixed with the character '#'. </param>
/// <param name="description"> The description of the skill which describes the inputs, outputs, and usage of the skill. </param>
/// <param name="context"> Represents the level at which operations take place, such as the document root or document content (for example, /document or /document/content). The default is /document. </param>
/// <param name="inputs"> Inputs of the skills could be a column in the source data set, or the output of an upstream skill. </param>
/// <param name="outputs"> The output of a skill is either a field in a search index, or a value that can be consumed as an input by another skill. </param>
/// <param name="insertPreTag"> The tag indicates the start of the merged text. By default, the tag is an empty space. </param>
/// <param name="insertPostTag"> The tag indicates the end of the merged text. By default, the tag is an empty space. </param>
internal MergeSkill(string oDataType, string name, string description, string context, IList<InputFieldMappingEntry> inputs, IList<OutputFieldMappingEntry> outputs, string insertPreTag, string insertPostTag) : base(oDataType, name, description, context, inputs, outputs)
{
InsertPreTag = insertPreTag;
InsertPostTag = insertPostTag;
ODataType = oDataType ?? "#Microsoft.Skills.Text.MergeSkill";
}
/// <summary> The tag indicates the start of the merged text. By default, the tag is an empty space. </summary>
public string InsertPreTag { get; set; }
/// <summary> The tag indicates the end of the merged text. By default, the tag is an empty space. </summary>
public string InsertPostTag { get; set; }
}
}
|
stankovski/azure-sdk-for-net
|
sdk/search/Azure.Search.Documents/src/Generated/Models/MergeSkill.cs
|
C#
|
apache-2.0
| 3,483 |
/**
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.camel.component.jms;
import javax.jms.ConnectionFactory;
import org.apache.camel.CamelContext;
import org.apache.camel.builder.RouteBuilder;
import org.apache.camel.test.junit4.CamelTestSupport;
import org.junit.Test;
import static org.apache.camel.component.jms.JmsComponent.jmsComponentAutoAcknowledge;
public class JmsRequestReplyExclusiveReplyToRemoveAddRouteTest extends CamelTestSupport {
@Test
public void testJmsRequestReplyExclusiveFixedReplyTo() throws Exception {
assertEquals("Hello A", template.requestBody("direct:start", "A"));
// stop and remove route
context.getRouteController().stopRoute("start");
context.removeRoute("start");
// add new route using same jms endpoint uri
context.addRoutes(new RouteBuilder() {
@Override
public void configure() throws Exception {
from("direct:start2").routeId("start2")
.to("activemq:queue:foo?replyTo=bar&replyToType=Exclusive")
.to("log:start2");
}
});
// and it should still work
assertEquals("Hello B", template.requestBody("direct:start2", "B"));
assertEquals("Hello C", template.requestBody("direct:start2", "C"));
assertEquals("Hello D", template.requestBody("direct:start2", "D"));
assertEquals("Hello E", template.requestBody("direct:start2", "E"));
}
protected CamelContext createCamelContext() throws Exception {
CamelContext camelContext = super.createCamelContext();
ConnectionFactory connectionFactory = CamelJmsTestHelper.createConnectionFactory();
camelContext.addComponent("activemq", jmsComponentAutoAcknowledge(connectionFactory));
return camelContext;
}
@Override
protected RouteBuilder createRouteBuilder() throws Exception {
return new RouteBuilder() {
@Override
public void configure() throws Exception {
from("direct:start").routeId("start")
.to("activemq:queue:foo?replyTo=bar&replyToType=Exclusive")
.to("log:start");
from("activemq:queue:foo").routeId("foo")
.transform(body().prepend("Hello "));
}
};
}
}
|
punkhorn/camel-upstream
|
components/camel-jms/src/test/java/org/apache/camel/component/jms/JmsRequestReplyExclusiveReplyToRemoveAddRouteTest.java
|
Java
|
apache-2.0
| 3,124 |
package org.apereo.cas.support.saml.mdui.web.flow;
import org.apereo.cas.config.CoreSamlConfiguration;
import org.apereo.cas.support.saml.mdui.config.SamlMetadataUIConfiguration;
import org.apereo.cas.support.saml.mdui.config.SamlMetadataUIWebflowConfiguration;
import org.apereo.cas.web.flow.BaseWebflowConfigurerTests;
import org.apereo.cas.web.flow.CasWebflowConfigurer;
import lombok.val;
import org.junit.jupiter.api.Tag;
import org.junit.jupiter.api.Test;
import org.springframework.context.annotation.Import;
import org.springframework.webflow.engine.Flow;
import static org.junit.jupiter.api.Assertions.*;
/**
* This is {@link SamlMetadataUIWebflowConfigurerTests}.
*
* @author Misagh Moayyed
* @since 6.2.0
*/
@Import({
CoreSamlConfiguration.class,
SamlMetadataUIConfiguration.class,
SamlMetadataUIWebflowConfiguration.class,
BaseWebflowConfigurerTests.SharedTestConfiguration.class
})
@Tag("SAML")
public class SamlMetadataUIWebflowConfigurerTests extends BaseWebflowConfigurerTests {
@Test
public void verifyOperation() {
assertFalse(casWebflowExecutionPlan.getWebflowConfigurers().isEmpty());
val flow = (Flow) this.loginFlowDefinitionRegistry.getFlowDefinition(CasWebflowConfigurer.FLOW_ID_LOGIN);
assertNotNull(flow);
}
}
|
pdrados/cas
|
support/cas-server-support-saml-mdui/src/test/java/org/apereo/cas/support/saml/mdui/web/flow/SamlMetadataUIWebflowConfigurerTests.java
|
Java
|
apache-2.0
| 1,297 |
// Copyright 2000-2021 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 license that can be found in the LICENSE file.
package com.intellij.ide.util;
import com.intellij.openapi.fileTypes.FileType;
import com.intellij.openapi.project.Project;
import com.intellij.openapi.util.NlsContexts;
import com.intellij.psi.PsiFile;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
/**
* @author yole
*/
public abstract class TreeFileChooserFactory {
public static TreeFileChooserFactory getInstance(Project project) {
return project.getService(TreeFileChooserFactory.class);
}
@NotNull
public abstract TreeFileChooser createFileChooser(@NlsContexts.DialogTitle @NotNull String title,
@Nullable PsiFile initialFile,
@Nullable FileType fileType,
@Nullable TreeFileChooser.PsiFileFilter filter);
@NotNull
public abstract TreeFileChooser createFileChooser(@NlsContexts.DialogTitle @NotNull String title,
@Nullable PsiFile initialFile,
@Nullable FileType fileType,
@Nullable TreeFileChooser.PsiFileFilter filter,
boolean disableStructureProviders);
@NotNull
public abstract TreeFileChooser createFileChooser(@NlsContexts.DialogTitle @NotNull String title,
@Nullable PsiFile initialFile,
@Nullable FileType fileType,
@Nullable TreeFileChooser.PsiFileFilter filter,
boolean disableStructureProviders,
boolean showLibraryContents);
}
|
ingokegel/intellij-community
|
platform/lang-api/src/com/intellij/ide/util/TreeFileChooserFactory.java
|
Java
|
apache-2.0
| 2,028 |
pimatic-wink
============
Pimatic plugin to interface with Wink connected devices. Currently supports the following device types:
1. Light Bulbs
2. Binary Switches
3. Shades
4. Locks - only lock/unlock functions are supported
5. Light Switches - This not a Wink device but, a varition on light_bulb and only offers on/off functionality. This will not be added automatically by discovery. If you want to use it, you will have to do it manually. You can change the class for a device added by auto-discovery to `WinkLightBulb` by editing the config.json file.
This plugin suppports auto-discovery available since pimatic v0.90, and that is the preferred way of adding devices, it will retrieve all the parameters it needs using the Wink API.
This version subscribes to pubnub streams where Wink publishes real-time device statutes - google 'wink pubnub' if you want further info.
The plugin should preferrably be installed using the pimatic UI functions. After installing the plugin you should edit the parameters and set the username and password. After this restart pimatic, this will retrieve the OAuth token that the plugin needs to make Wink API calls
Plugin
------
{
"plugin": "wink",
"client_id": "quirky_wink_android_app",
"client_secret": "e749124ad386a5a35c0ab554a4f2c045",
"username": "[email protected]",
"password": "123456",
"auth_token": "0000aaaaa99999988889999332211333"
},
`client_id` and `client_secret` are used for OAuth token generation.
You can email wink support and request a personalized `client_id` and `client_secret`, it's been known to take considerable time to get it, so these were taken from the Android Wink app, first seen here:
https://github.com/davidgruhin/WinkPost/blob/master/js/wink.js#L335
`username` and `password` are those used to log in to the official Wink app.
`auth_token` is generated by accessing the Wink API - the plug will automatically do this, after you the `username` and `password` and restart pimatic. You can also retrieve this using the CLI - see usage not below
Devices
-------
`device_id`, `pubnub_subscribe_key`, `pubnub_channel` are used to interact with devices and subscribe to status updates. If you use pimatic auto-discovery to add devices, these will be automatically populated for you. You can also manually populate these, by retrieving the device map using the CLI and looking them up in the device map.
{
"id": "my-light-bulb", //unique id used by pimatic
"class": "WinkLightBulb", //this should match the device type
"name": "Office Light Bulb" //call it what you want
"device_id": "212917", //retrieved from Wink device map
"pubnub_channel": "very_long_string", //retrieved from Wink device map
"pubnub_subscribe_key": "a_string" //retrieved from Wink device map
},
{
"id": "my-switch",
"class": "WinkBinarySwitch",
"name": "Outlet",
"device_id": "718646",
"pubnub_channel": "very_long_string",
"pubnub_subscribe_key": "a_string"
},
{
"id": "my-lock",
"class": "WinkLock",
"name": "Front Door",
"device_id": "404706",
"pubnub_channel": "very_long_string",
"pubnub_subscribe_key": "a_string"
},
{
"id": "my-shade",
"class": "WinkShade",
"name": "Curtains",
"device_id": "516323",
"pubnub_channel": "very_long_string",
"pubnub_subscribe_key": "a_string"
},
{
"id": "my-floodlight",
"class": "WinkLightSwitch", //this MUST be a light_bulb type device
"name": "Curtains",
"device_id": "201551",
"pubnub_channel": "very_long_string",
"pubnub_subscribe_key": "a_string"
},
Bonus: CLI
----------
pimatic-wink includes a bonus utility that can be run from the command line (via `node`).
See wink-cli.js for more information.
Commands to retrive auth_token and device map - you don't need to do this manually, the plugin does this for you. The auth_token will be retrieved in the first run after installing. Device can be retrieved using auto-discovery.
auth token :
node wink-cli.js auth_token '[email protected]' '123456'
device map:
node wink-cli.js auth_token device_map
|
dgmltn/pimatic-wink
|
README.md
|
Markdown
|
apache-2.0
| 4,407 |
/*
* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file accompanying this file. This file is distributed
* on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
* express or implied. See the License for the specific language governing
* permissions and limitations under the License.
*/
#pragma once
#include <aws/cognito-idp/CognitoIdentityProvider_EXPORTS.h>
#include <aws/core/utils/memory/stl/AWSString.h>
namespace Aws
{
namespace CognitoIdentityProvider
{
namespace Model
{
enum class DomainStatusType
{
NOT_SET,
CREATING,
DELETING,
UPDATING,
ACTIVE,
FAILED
};
namespace DomainStatusTypeMapper
{
AWS_COGNITOIDENTITYPROVIDER_API DomainStatusType GetDomainStatusTypeForName(const Aws::String& name);
AWS_COGNITOIDENTITYPROVIDER_API Aws::String GetNameForDomainStatusType(DomainStatusType value);
} // namespace DomainStatusTypeMapper
} // namespace Model
} // namespace CognitoIdentityProvider
} // namespace Aws
|
cedral/aws-sdk-cpp
|
aws-cpp-sdk-cognito-idp/include/aws/cognito-idp/model/DomainStatusType.h
|
C
|
apache-2.0
| 1,239 |
(function(a){a.extend({foucs:function(c){var l=a(".index_b_hero"),f=l.find("li.hero"),e=l.find("a.prev"),h=l.find("a.next"),d={interval:c&&c.interval||3500,animateTime:c&&c.animateTime||500,direction:c&&(c.direction==="right"),_imgLen:f.length},g=0,b=function(i){return g+i>=d._imgLen?g+i-d._imgLen:g+i},j=function(i){return g-i<0?d._imgLen+g-i:g-i},k=function(i){f.eq((i?j(2):b(2))).css("left",(i?"-2008px":"2008px"));f.animate({left:(i?"+":"-")+"=1004px"},d.animateTime);g=i?j(1):b(1)},m=setInterval(function(){k(d.direction)},d.interval);f.eq(g).css("left",0).end().eq(g+1).css("left","1004px").end().eq(g-1).css("left","-1004px");l.find(".hero-wrap").add(e).add(h).hover(function(){clearInterval(m)},function(){m=setInterval(function(){k(d.direction)},d.interval)});e.click(function(){if(a(":animated").length===0){k(false)}});h.click(function(){if(a(":animated").length===0){k(true)}})}})}(jQuery));
|
lpx84/naiya-mean
|
naiya-shop/mia/public/mia/js/jquery.js
|
JavaScript
|
apache-2.0
| 904 |
/*
* Copyright (c) 2005-2010 Grameen Foundation USA
* All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
* implied. See the License for the specific language governing
* permissions and limitations under the License.
*
* See also http://www.apache.org/licenses/LICENSE-2.0.html for an
* explanation of the license and how it is applied.
*/
package org.mifos.dto.domain;
import java.util.List;
import org.mifos.dto.screen.AccountingDetailsDto;
import org.mifos.dto.screen.LoanAmountDetailsDto;
@SuppressWarnings("PMD")
public class LoanProductRequest {
private final ProductDetailsDto productDetails;
private final boolean includeInLoanCycleCounter;
private final boolean waiverInterest;
private final Integer currencyId;
private final Integer interestRateType;
private final MinMaxDefaultDto interestRateRange;
private final RepaymentDetailsDto repaymentDetails;
private final LoanAmountDetailsDto loanAmountDetails;
private final List<Integer> applicableFees;
private final AccountingDetailsDto accountDetails;
// used for response details
private boolean multiCurrencyEnabled;
private String currencyCode;
private String interestRateTypeName;
private List<String> fees;
private List<String> funds;
private String interestGlCodeValue;
private String principalGlCodeValue;
public LoanProductRequest(ProductDetailsDto loanProductDetails, final boolean includeInLoanCycleCounter, boolean waiverInterest, Integer currencyId, LoanAmountDetailsDto loanAmountDetails, Integer interestRateType,
MinMaxDefaultDto interestRateRange, RepaymentDetailsDto repaymentDetails, List<Integer> applicableFees, AccountingDetailsDto accountDetails) {
this.productDetails = loanProductDetails;
this.includeInLoanCycleCounter = includeInLoanCycleCounter;
this.waiverInterest = waiverInterest;
this.currencyId = currencyId;
this.loanAmountDetails = loanAmountDetails;
this.interestRateType = interestRateType;
this.interestRateRange = interestRateRange;
this.repaymentDetails = repaymentDetails;
this.applicableFees = applicableFees;
this.accountDetails = accountDetails;
}
public Integer getInterestRateType() {
return this.interestRateType;
}
public MinMaxDefaultDto getInterestRateRange() {
return this.interestRateRange;
}
public RepaymentDetailsDto getRepaymentDetails() {
return this.repaymentDetails;
}
public LoanAmountDetailsDto getLoanAmountDetails() {
return this.loanAmountDetails;
}
public List<Integer> getApplicableFees() {
return this.applicableFees;
}
public AccountingDetailsDto getAccountDetails() {
return this.accountDetails;
}
public boolean isIncludeInLoanCycleCounter() {
return this.includeInLoanCycleCounter;
}
public boolean isWaiverInterest() {
return this.waiverInterest;
}
public Integer getCurrencyId() {
return this.currencyId;
}
public ProductDetailsDto getProductDetails() {
return this.productDetails;
}
public boolean isMultiCurrencyEnabled() {
return this.multiCurrencyEnabled;
}
public void setMultiCurrencyEnabled(boolean multiCurrencyEnabled) {
this.multiCurrencyEnabled = multiCurrencyEnabled;
}
public String getCurrencyCode() {
return this.currencyCode;
}
public void setCurrencyCode(String currencyCode) {
this.currencyCode = currencyCode;
}
public String getInterestRateTypeName() {
return this.interestRateTypeName;
}
public void setInterestRateTypeName(String interestRateTypeName) {
this.interestRateTypeName = interestRateTypeName;
}
public List<String> getFees() {
return this.fees;
}
public void setFees(List<String> fees) {
this.fees = fees;
}
public List<String> getFunds() {
return this.funds;
}
public void setFunds(List<String> funds) {
this.funds = funds;
}
public String getInterestGlCodeValue() {
return this.interestGlCodeValue;
}
public void setInterestGlCodeValue(String interestGlCodeValue) {
this.interestGlCodeValue = interestGlCodeValue;
}
public String getPrincipalGlCodeValue() {
return this.principalGlCodeValue;
}
public void setPrincipalGlCodeValue(String principalGlCodeValue) {
this.principalGlCodeValue = principalGlCodeValue;
}
}
|
maduhu/mifos-head
|
serviceInterfaces/src/main/java/org/mifos/dto/domain/LoanProductRequest.java
|
Java
|
apache-2.0
| 4,990 |
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.apache.geronimo.web.info;
import java.io.Serializable;
import java.util.EnumSet;
import javax.servlet.SessionTrackingMode;
/**
* @version $Rev:$ $Date:$
*/
public class SessionConfigInfo implements Serializable{
public Integer sessionTimeoutMinutes;
public SessionCookieConfigInfo sessionCookieConfig;
public EnumSet<SessionTrackingMode> sessionTrackingModes;
}
|
apache/geronimo
|
plugins/j2ee/geronimo-web/src/main/java/org/apache/geronimo/web/info/SessionConfigInfo.java
|
Java
|
apache-2.0
| 1,202 |
<header class="bar bar-nav" xmlns="http://www.w3.org/1999/html">
<a href="#plans/abs/gears" class="btn pull-left btn-positive">
Back
</a>
<ul class="steps-menu">
<li>Diver</li>
<li class="active">Gears</li>
<li>Water</li>
<li>Results</li>
</ul>
</header>
<div class="bar bar-standard bar-footer">
<a href="#config" class="icon icon-gear pull-right"></a>
</div>
<div class="content">
<div class="card">
<ul class="table-view">
<li class="table-view-cell">
<a class="navigate-right" href="#plans/<%= id %>/gears/store/CYLINDER">
<img class="media-object pull-left" src="img/gears/cylinders.png">
<span class="badge badge-positive"><%=categories.CYLINDER.length%></span>
<h3>Cylinders</h3>
</a>
</li>
<li class="table-view-cell">
<a class="navigate-right" href="#plans/<%= id %>/gears/store/BCD">
<img class="media-object pull-left" src="img/gears/bcds.png">
<span class="badge badge-positive"><%=categories.BCD.length%></span>
<h3>BCDs</h3>
</a>
</li>
<li class="table-view-cell">
<a class="navigate-right" href="#plans/<%= id %>/gears/store/REGULATOR">
<img class="media-object pull-left" src="img/gears/regulators.png">
<span class="badge badge-positive"><%=categories.REGULATOR.length%></span>
<h3>Regulators</h3>
</a>
</li>
<li class="table-view-cell">
<a class="navigate-right" href="#plans/<%= id %>/gears/store/SUIT">
<img class="media-object pull-left" src="img/gears/suits.png">
<span class="badge badge-positive"><%=categories.SUIT.length%></span>
<h3>Suits</h3>
</a>
</li>
<li class="table-view-cell">
<a class="navigate-right" href="#plans/<%= id %>/gears/store/MISC">
<img class="media-object pull-left" src="img/gears/miscs.png">
<span class="badge badge-positive"><%=categories.MISC.length%></span>
<h3>Misc</h3>
</a>
</li>
</ul>
</div>
</div>
|
tmaret/lead
|
www/templates/StoreView.html
|
HTML
|
apache-2.0
| 2,421 |
# Axe Developer Guide
Axe runs a series of tests to check for accessibility of content and functionality on a website. A test is made up of a series of Rules which are, themselves, made up of Checks. Axe executes these Rules asynchronously and, when the Rules are finished running, runs a callback function which is passed a Result structure. Since some Rules run on the page level while others do not, tests will also run in one of two ways. If a document is specified, the page level rules will run, otherwise they will not.
Axe 3.0 supports open Shadow DOM: see our virtual DOM APIs and test utilities for developing axe-core moving forward. Note: we do not and cannot support closed Shadow DOM.
1. [Getting Started](#getting-started)
1. [Environment Pre-requisites](#environment-pre-requisites)
1. [Building axe.js](#building-axejs)
1. [Running Tests](#running-tests)
1. [API Reference](#api-reference)
1. [Supported CSS Selectors](#supported-css-selectors)
1. [Architecture Overview](#architecture-overview)
1. [Rules](#rules)
1. [Checks](#checks)
1. [Common Functions](#common-functions)
1. [Virtual Nodes](#virtual-nodes)
1. [Core Utilities](#core-utilities)
1. [Virtual DOM APIs](#virtual-dom-apis)
1. [API Name: axe.utils.getFlattenedTree](#api-name-axeutilsgetflattenedtree)
1. [API Name: axe.utils.getNodeFromTree](#api-name-axeutilsgetnodefromtree)
1. [Test Utilities](#test-utilities)
1. [Test Util Name: axe.testUtils.MockCheckContext](#test-util-name-mockcheckcontext)
1. [Test Util Name: axe.testUtils.shadowSupport](#test-util-name-shadowsupport)
1. [Test Util Name: axe.testUtils.fixtureSetup](#test-util-name-fixturesetup)
1. [Test Util Name: axe.testUtils.checkSetup](#test-util-name-checksetup)
1. [Using Rule Generation CLI](#using-rule-generation-cli)
## Getting Started
### Environment Pre-requisites
1. You must have NodeJS installed.
1. Install npm development dependencies. In the root folder of your axe-core repository, run `npm install`
### Building axe.js
To build axe.js, simply run `npm run build` in the root folder of the axe-core repository. axe.js and axe.min.js are placed into the root folder.
### Running Tests
To run all tests from the command line you can run `npm test`, which will run all unit and integration tests using headless chrome and Selenium Webdriver.
You can also load tests in any supported browser, which is helpful for debugging. Tests require a local server to run, you must first start a local server to serve files. You can use Grunt to start one by running `npm start`. Once your local server is running you can load the following pages in any browser to run tests:
1. [Core Tests](../test/core/)
2. [Commons Tests](../test/commons/)
3. [Check Tests](../test/checks/)
4. [Rule Matches](../test/rule-matches/)
5. [Integration Tests](../test/integration/rules/)
6. There are additional tests located in [test/integration/full/](../test/integration/full/) for tests that need to be run against their own document.
### API Reference
[See API exposed on axe](./API.md#section-2-api-reference)
### Supported CSS Selectors
Axe supports the following CSS selectors:
- Type, Class, ID, and Universal selectors. E.g `div.main, #main`
- Pseudo selector `not`. E.g `th:not([scope])`
- Descendant and Child combinators. E.g. `table td`, `ul > li`
- Attribute selectors `=`, `^=`, `$=`, `*=`. E.g `a[href^="#"]`
## Architecture Overview
Axe tests for accessibility using objects called Rules. Each Rule tests for a high-level aspect of accessibility, such as color contrast, button labels, and alternate text for images. Each rule is made up of a series of Checks. Depending on the rule; all, some, or none of these checks must pass in order for the rule to pass.
Upon execution, a Rule runs each of its Checks against all relevant nodes. Which nodes are relevant is determined by the Rule's `selector` property and `matches` function. If a Rule has no Checks that apply to a given node, the Rule will result in an inapplicable result.
After execution, a Check will return `true`, `false`, or `undefined` depending on whether or not the tested condition was satisfied. The result, as well as more information on what caused the Check to pass or fail, will be stored in either the `passes`, `violations`, or `incomplete` arrays.
### Rules
Rules are defined by JSON files in the [lib/rules directory](../lib/rules). The JSON object is used to seed the [Rule object](../lib/core/base/rule.js#L30). A valid Rule JSON consists of the following:
- `id` - `String` A unique name of the Rule.
- `selector` - **optional** `String` which is a [CSS selector](#supported-css-selectors) that specifies the elements of the page on which the Rule runs. axe-core will look inside of the light DOM and _open_ [Shadow DOM](https://developer.mozilla.org/en-US/docs/Web/Web_Components/Shadow_DOM) trees for elements matching the provided selector. If omitted, the rule will run against every node.
- `excludeHidden` - **optional** `Boolean` Whether the rule should exclude hidden elements. Defaults to `true`.
- `enabled` - **optional** `Boolean` Whether the rule is enabled by default. Defaults to `true`.
- `pageLevel` - **optional** `Boolean` Whether the rule is page level. Page level rules will only run if given an entire `document` as context.
- `matches` - **optional** `String` The ID of the filtering function that will exclude elements that match the `selector` property. See the [`metadata-function-map`](../lib/core/base/metadata-function-map.js) file for all defined IDs.
- `impact` - **optional** `String` (one of `minor`, `moderate`, `serious`, or `critical`). Override the impact defined by checks.
- `tags` - **optional** `Array` Strings of the accessibility guidelines of which the Rule applies.
- `metadata` - `Object` Consisting of:
- `description` - `String` Text string that describes what the rule does.
- `helpUrl` - `String` **optional** URL that provides more information about the specifics of the violation. Links to a page on the Deque University site.
- `help` - `String` Help text that describes the test that was performed.
- `any` - `Array` Checks that make up this Rule; one of these checks must return `true` for a Rule to pass.
- `all` - `Array` Checks that make up this Rule; all these checks must return `true` for a Rule to pass.
- `none` - `Array` Checks that make up this Rule; none of these checks must return `true` for a Rule to pass.
The `any`, `all` and `none` arrays must contain either a `String` which references the `id` of the Check; or an object of the following format:
- `id` - `String` The unique ID of the Check.
- `options` - `Mixed` Any options the Check requires that are specific to the Rule.
There is a Grunt target which will ensure each Rule has a valid format, which can be run with `npx grunt validate`.
#### Matches Function
A Rule's `matches` function is executed against each node which matches the Rule's `selector` and receive two parameters:
- `node` – node, the DOM Node to test
- `virtualNode`– object, the virtual DOM representation of the node. See [virtualNode documentation](#virtual-nodes) for more.
The matches function must return either `true` or `false`. Common functions are provided as `commons`. [See the data-table matches function for an example.](../lib/rules/data-table-matches.js)
### Checks
Similar to Rules, Checks are defined by JSON files in the [lib/checks directory](../lib/checks). The JSON object is used to seed the [Check object](../lib/core/base/check.js). A valid Check JSON consists of the following:
- `id` - `String` A unique name of the Check
- `evaluate` - `String` The ID of the function that implements the check's functionality. See the [`metadata-function-map`](../lib/core/base/metadata-function-map.js) file for all defined IDs.
- `after` - **optional** `String` The ID of the function that gets called for checks that operate on a page-level basis, to process the results from the iframes.
- `options` - **optional** `Object` Any information the Check needs that you might need to customize and/or is locale specific. Options can be overridden at runtime (with the options parameter) or config-time. For example, the [valid-lang](../lib/checks/language/valid-lang.json) Check defines what ISO 639-1 language codes it should accept as valid. Options do not need to follow any specific format or type; it is up to the author of a Check to determine the most appropriate format.
- `metadata` - `Object` Consisting of:
- `impact` - `String` (one of `minor`, `moderate`, `serious`, or `critical`)
- `messages` - `Object` These messages are displayed when the Check passes or fails
- `pass` - `String` [doT.js](http://olado.github.io/doT/) template string displayed when the Check passes
- `fail` - `String` [doT.js](http://olado.github.io/doT/) template string displayed when the Check fails
- `incomplete` – `String|Object` – [doT.js](http://olado.github.io/doT/) template string displayed when the Check is incomplete OR an object with `missingData` on why it returned incomplete. Refer to [rules.md](./rule-development.md).
#### Check `evaluate`
A Check's evaluate function is run a special context in order to give access to APIs which provide more information. Checks will run against a single node and do not have access to other frames. A Check must either return `true` or `false`.
The following variables are defined for `Check#evaluate`:
- `node` - `HTMLElement` The element that the Check is run against
- `options` - `Mixed` Any options specific to this Check that may be necessary. If not specified by the user at run-time or configure-time; it will use `options` as defined by the Check's JSON file.
- `virtualNode` – `Object` The virtualNode object for use with Shadow DOM. See [virtualNode documentation](#virtual-nodes).
- `this.data()` - `Function` Free-form data that either the Check message requires or is presented as `data` in the CheckResult object. Subsequent calls to `this.data()` will overwrite previous. See [aria-valid-attr](../lib/checks/aria/aria-valid-attr-value-evaluate.js) for example usage.
- `this.relatedNodes()` - `Function` Array or NodeList of elements that are related to this Check. For example the [duplicate-id](../lib/checks/parsing/duplicate-id-evaluate.js) Check will add all Elements which share the same ID.
#### Check `after`
You can use the `after` function to evaluate nodes that might be in other frames or to filter the number of violations or passes produced. The `after` function runs once for each Rule in the top-most (or originating) frame. Due to this, you should not perform DOM operations in after functions, but instead operate on `data` defined by the Check.
For example, the [duplicate-id](../lib/checks/parsing/duplicate-id.json) Check include an [after function](../lib/checks/parsing/duplicate-id-after.js) which reduces the number of violations so that only one violation per instance of a duplicate ID is found.
The following variables are defined for `Check#after`:
- `results` - `Array` Contains [CheckResults](#checkresult) for every matching node.
The after function must return an `Array` of CheckResults, due to this, it is a very common pattern to just use `Array#filter` to filter results:
```js
var uniqueIds = [];
return results.filter(function(r) {
if (uniqueIds.indexOf(r.data) === -1) {
uniqueIds.push(r.data);
return true;
}
return false;
});
```
#### Pass, Fail and Incomplete Templates
Occasionally, you may want to add additional information about why a Check passed, failed or returned undefined into its message. For example, the [aria-valid-attr](../lib/checks/aria/valid-attr.json) will add information about any invalid ARIA attributes to its fail message. The message uses a [custom message format](./check-message-template.md). In the Check message, you have access to the `data` object as `data`.
```js
// aria-valid-attr check
"messages": {
"pass": "ARIA attributes are used correctly for the defined role",
"fail": {
"singular": "ARIA attribute is not allowed: ${data.values}",
"plural": "ARIA attributes are not allowed: ${data.values}"
},
"incomplete": "axe-core couldn't tell because of ${data.missingData}"
}
```
See [Developing Axe-core Rules](./rule-development.md) for more information
on writing rules and checks, including incomplete results.
#### CheckResult
When a Check is executed, its result is then added to a [CheckResult object](../lib/core/base/check-result.js). Much like the RuleResult object, the CheckResult object only contains information that is required to determine whether a Check, and its parent Rule passed or failed. `metadata` from the originating Check is combined later and will not be available until axe reaches the reporting stage.
A CheckResult has the following properties:
- `id` - `String` The ID of the Check this CheckResult belongs to.
- `data` - `Mixed` Any data the Check's evaluate function added with `this.data()`. Typically used to insert data from analysis into a message or to perform further tests in the post-processing function.
- `relatedNodes` - `Array` Nodes that are related to the current Check as defined by [check.evaluate](#check-evaluate).
- `result` - `Boolean` The return value of [check.evaluate](#check-evaluate).
### Common Functions
Common functions are an internal library used by the rules and checks. If you have code repeated across rules and checks, you can use these functions and contribute to them. Documentation is available in [source code](../lib/commons/).
#### Commons and Shadow DOM
To support open Shadow DOM while maintaining backwards compatibility, commons functions that query DOM nodes must operate on an in-memory representation of the DOM using axe-core’s built-in [API methods and utility functions](./API.md#virtual-dom-utilities).
Commons functions should do the virtual tree lookup and call a `virtual` function including the rest of the commons code. The naming of this special function should contain the original commons function name with `Virtual` added to signify it expects to operate on a virtual DOM tree.
Let’s look at an example:
```js
// lib/commons/text/accessible-text.js
import { getNodeFromTree } from '../../core/utils';
import accessibleTextVirtual from './accessible-text-virtual';
function accessibleText(element, inLabelledbyContext) {
let virtualNode = getNodeFromTree(axe._tree[0], element); // throws an exception on purpose if axe._tree not correct
return accessibleTextVirtual(virtualNode, inLabelledbyContext);
}
export default accessibleText;
// lib/commons/text/accessible-text-virtual.js
function accessibleTextVirtual(element, inLabelledbyContext) {
// rest of the commons code minus the virtual tree lookup, since it’s passed in
}
```
`accessibleTextVirtual` would only be called directly if you’ve got a virtual node you can use. If you don’t already have one, call the `accessibleText` lookup function, which passes on a virtual DOM node with both the light DOM and Shadow DOM (if applicable).
### Virtual Nodes
To support open Shadow DOM, axe-core has the ability to handle virtual nodes in [rule matches](#matches-function) and [check evaluate](#check-evaluate) functions. The full set of API methods for Shadow DOM can be found in the [API documentation](./API.md#virtual-dom-utilities), but the general structure for a virtualNode is as follows:
```js
{
actualNode: <HTMLElement>,
children: <Array>,
parent: <VirtualNode>,
shadowId: <String>,
attr: <Function>,
hasAttr: <Function>,
props: <Object>,
}
```
- A virtualNode is an object containing an HTML DOM element (`actualNode`).
- Children contains an array of child VirtualNodes.
- Parent is the VirtualNode parent
- The shadowID indicates whether the node is in an open shadow root and if it is, which one it is inside the boundary.
- Attr is a function which returns the value of the passed in attribute, similar to `node.getAttribute()` (e.g. `vNode.attr('aria-label')`)
- HasAttr is a function which returns true if the VirtualNode has the attribute, similar to `node.hasAttribute()` (e.g. `vNode.hasAttr('aria-label')`)
- Props is an object of HTML DOM element properties. The general structure is as follows:
```js
{
nodeName: <String>,
nodeType: <Number>,
id: <String>,
nodeValue: <String>
}
```
### Core Utilities
Core Utilities are an internal library that provides axe with functionality used throughout its core processes. Most notably among these are the queue function and the DqElement constructor.
#### Common Utility Functions
In addition to the ARIA lookupTable, there are also utility functions on the axe.commons.aria and axe.commons.dom namespaces:
- `axe.commons.aria.implicitRole` - Get the implicit role for a given node
- `axe.commons.aria.label` - Gets the accessible ARIA label text of a given element
- `axe.commons.dom.isVisible` - Determine whether an element is visible
#### Queue Function
The queue function creates an asynchronous "queue", list of functions to be invoked in parallel, but not necessarily returned in order. The queue function returns an object with the following methods:
- `defer(func)` Defer a function that may or may not run asynchronously
- `then(callback)` The callback to execute once all "deferred" functions have completed. Will only be invoked once.
- `abort()` Abort the "queue" and prevent `then` function from firing
#### DqElement Class
The DqElement is a "serialized" `HTMLElement`. It will calculate the CSS selector, grab the source outerHTML and offer an array for storing frame paths. The DqElement class takes the following parameters:
- `Element` - `HTMLElement` The element to serialize
- `Spec` - `Object` Properties to use in place of the element when instantiated on Elements from other frames
```js
var firstH1 = document.getElementByTagName('h1')[0];
var dqH1 = new axe.utils.DqElement(firstH1);
```
Elements returned by the DqElement class have the following methods and properties:
- `selector` - `string` A unique CSS selector for the element
- `source` - `string` The generated HTML source code of the element
- `element` - `DOMNode` The element which this object is based off or the containing frame, used for sorting.
- `toJSON()` - Returns an object containing the selector and source properties
## Virtual DOM APIs
Note: You shouldn’t need the Shadow DOM APIs below unless you’re working on the axe-core
engine, as rules and checks already have `virtualNode` objects passed in. However, these APIs
will make it easier to work with the virtual DOM.
### API Name: axe.utils.getFlattenedTree
#### Description
Recursively return an array containing the virtual DOM tree for the node specified, excluding comment nodes
and shadow DOM nodes `<content>` and `<slot>`. This method will return a flattened tree containing both
light and shadow DOM, if applicable.
#### Synopsis
```js
var element = document.body;
axe.utils.getFlattenedTree(element, shadowId);
```
#### Parameters
- `node` – HTMLElement. The current HTML node for which you want a flattened DOM tree.
- `shadowId` – string(optional). ID of the shadow DOM that is the closest shadow ancestor of the node
#### Returns
An array of objects, where each object is a virtualNode:
```js
[
{
actualNode: body,
children: [virtualNodes],
shadowId: undefined
}
];
```
### API Name: axe.utils.getNodeFromTree
#### Description
Recursively return a single node from a virtual DOM tree. This is commonly used in rules and checks where the node is readily available without querying the DOM.
#### Synopsis
```js
axe.utils.getNodeFromTree(axe._tree[0], node);
```
#### Parameters
- `vNode` – object. The flattened DOM tree to fetch a virtual node from
- `node` – HTMLElement. The HTML DOM node for which you need a virtual representation
#### Returns
A virtualNode object:
```js
{
actualNode: div,
children: [virtualNodes],
shadowId: undefined
}
```
## Test Utilities
All tests must support open Shadow DOM, so we created some test utilities to make this easier.
### Test Util Name: MockCheckContext
Create a check context for mocking and resetting data and relatedNodes in tests.
#### Synopsis
```js
describe('region', function() {
var fixture = document.getElementById('fixture');
var checkContext = new axe.testUtils.MockCheckContext();
afterEach(function() {
fixture.innerHTML = '';
checkContext.reset();
});
it('should return true when all content is inside the region', function() {
assert.isTrue(checks.region.evaluate.apply(checkContext, checkArgs));
assert.equal(checkContext._relatedNodes.length, 0);
});
});
```
#### Parameters
None
#### Returns
An object containing the data, relatedNodes, and a way to reset them.
```js
{
data: (){},
relatedNodes: (){},
reset: (){}
}
```
### Test Util Name: shadowSupport
Provides an API for determining Shadow DOM v0 and v1 support in tests. For example: PhantomJS doesn't have Shadow DOM support, while some browsers do.
#### Synopsis
```js
(axe.testUtils.shadowSupport.v1 ? it : xit)(
'should test Shadow tree content',
function() {
// The rest of the shadow DOM test
}
);
```
#### Parameters
None
#### Returns
An object containing booleans for the following Shadow DOM supports: `v0`, `v1`, or `undefined`.
### Test Util Name: fixtureSetup
Method for injecting content into a fixture and caching the flattened DOM tree (light and Shadow DOM together).
#### Synopsis
```js
it(
'should return true if there is only one ' +
type +
' element with the same name',
function() {
axe.testUtils.fixtureSetup(
'<input type="' +
type +
'" id="target" name="uniqueyname">' +
'<input type="' +
type +
'" name="differentname">'
);
var node = fixture.querySelector('#target');
assert.isTrue(check.evaluate.call(checkContext, node));
}
);
```
#### Parameters
- `content` – Node|String. Stuff to go into the fixture (html or DOM node)
#### Returns
An HTML Element for the fixture
### Test Util Name: checkSetup
Create check arguments.
#### Synopsis
```js
it('should return true when all content is inside the region', function() {
var checkArgs = checkSetup(
'<div id="target"><div role="main"><a href="a.html#mainheader">Click Here</a><div><h1 id="mainheader" tabindex="0">Introduction</h1></div></div></div>'
);
assert.isTrue(checks.region.evaluate.apply(checkContext, checkArgs));
assert.equal(checkContext._relatedNodes.length, 0);
});
```
#### Parameters
- `content` – String|Node. Stuff to go into the fixture (html or node)
- `options` – Object. Options argument for the check (optional, default: {})
- `target` – String. Target for the check, CSS selector (default: '#target')
#### Returns
An array with the DOM Node, options and virtualNode
```js
[node, options, virtualNode];
```
## Using Rule Generation CLI
Axe provides a CLI for generating the necessary files and configuration assets for authoring a rule.
To invoke the rule generator, run:
```sh
npm run rule-gen
```
The CLI acts a wizard, by asking a series of questions related to generation of the rule, for example:
```sh
- What is the name of the RULE? (Eg: aria-valid): sample-rule
- Does the RULE need a MATCHES file to be created?: Yes
- Would you like to create a CHECK for the RULE?: No
- Would you like to create UNIT test files? Yes
- Would you like to create INTEGRATION test files? Yes
```
Upon answering of which the assets are created in the respective directories.
|
GoogleCloudPlatform/prometheus-engine
|
third_party/prometheus_ui/base/web/ui/react-app/node_modules/axe-core/doc/developer-guide.md
|
Markdown
|
apache-2.0
| 23,718 |
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
// bthread - A M:N threading library to make applications more concurrent.
// Date: Wed Mar 14 17:44:58 CST 2018
#include "bthread/sys_futex.h"
#include "butil/scoped_lock.h"
#include "butil/atomicops.h"
#include <pthread.h>
#include <unordered_map>
#if defined(OS_MACOSX)
namespace bthread {
class SimuFutex {
public:
SimuFutex() : counts(0)
, ref(0) {
pthread_mutex_init(&lock, NULL);
pthread_cond_init(&cond, NULL);
}
~SimuFutex() {
pthread_mutex_destroy(&lock);
pthread_cond_destroy(&cond);
}
public:
pthread_mutex_t lock;
pthread_cond_t cond;
int32_t counts;
int32_t ref;
};
static pthread_mutex_t s_futex_map_mutex = PTHREAD_MUTEX_INITIALIZER;
static pthread_once_t init_futex_map_once = PTHREAD_ONCE_INIT;
static std::unordered_map<void*, SimuFutex>* s_futex_map = NULL;
static void InitFutexMap() {
// Leave memory to process's clean up.
s_futex_map = new (std::nothrow) std::unordered_map<void*, SimuFutex>();
if (NULL == s_futex_map) {
exit(1);
}
return;
}
int futex_wait_private(void* addr1, int expected, const timespec* timeout) {
if (pthread_once(&init_futex_map_once, InitFutexMap) != 0) {
LOG(FATAL) << "Fail to pthread_once";
exit(1);
}
std::unique_lock<pthread_mutex_t> mu(s_futex_map_mutex);
SimuFutex& simu_futex = (*s_futex_map)[addr1];
++simu_futex.ref;
mu.unlock();
int rc = 0;
{
std::unique_lock<pthread_mutex_t> mu1(simu_futex.lock);
if (static_cast<butil::atomic<int>*>(addr1)->load() == expected) {
++simu_futex.counts;
if (timeout) {
timespec timeout_abs = butil::timespec_from_now(*timeout);
if ((rc = pthread_cond_timedwait(&simu_futex.cond, &simu_futex.lock, &timeout_abs)) != 0) {
errno = rc;
rc = -1;
}
} else {
if ((rc = pthread_cond_wait(&simu_futex.cond, &simu_futex.lock)) != 0) {
errno = rc;
rc = -1;
}
}
--simu_futex.counts;
} else {
errno = EAGAIN;
rc = -1;
}
}
std::unique_lock<pthread_mutex_t> mu1(s_futex_map_mutex);
if (--simu_futex.ref == 0) {
s_futex_map->erase(addr1);
}
mu1.unlock();
return rc;
}
int futex_wake_private(void* addr1, int nwake) {
if (pthread_once(&init_futex_map_once, InitFutexMap) != 0) {
LOG(FATAL) << "Fail to pthread_once";
exit(1);
}
std::unique_lock<pthread_mutex_t> mu(s_futex_map_mutex);
auto it = s_futex_map->find(addr1);
if (it == s_futex_map->end()) {
mu.unlock();
return 0;
}
SimuFutex& simu_futex = it->second;
++simu_futex.ref;
mu.unlock();
int nwakedup = 0;
int rc = 0;
{
std::unique_lock<pthread_mutex_t> mu1(simu_futex.lock);
nwake = (nwake < simu_futex.counts)? nwake: simu_futex.counts;
for (int i = 0; i < nwake; ++i) {
if ((rc = pthread_cond_signal(&simu_futex.cond)) != 0) {
errno = rc;
break;
} else {
++nwakedup;
}
}
}
std::unique_lock<pthread_mutex_t> mu2(s_futex_map_mutex);
if (--simu_futex.ref == 0) {
s_futex_map->erase(addr1);
}
mu2.unlock();
return nwakedup;
}
} // namespace bthread
#endif
|
brpc/brpc
|
src/bthread/sys_futex.cpp
|
C++
|
apache-2.0
| 4,297 |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.jackrabbit.oak.security.user;
import com.google.common.base.Predicates;
import com.google.common.collect.Iterators;
import org.apache.jackrabbit.api.security.user.Authorizable;
import org.apache.jackrabbit.api.security.user.Group;
import org.apache.jackrabbit.api.security.user.UserManager;
import org.apache.jackrabbit.commons.iterator.RangeIteratorAdapter;
import org.apache.jackrabbit.oak.namepath.NamePathMapper;
import org.apache.jackrabbit.oak.spi.security.principal.EveryonePrincipal;
import org.apache.jackrabbit.oak.spi.security.user.DynamicMembershipProvider;
import org.jetbrains.annotations.NotNull;
import javax.jcr.RepositoryException;
import java.util.Collections;
import java.util.Iterator;
import static org.apache.jackrabbit.oak.spi.security.user.UserConstants.REP_PRINCIPAL_NAME;
class EveryoneMembershipProvider implements DynamicMembershipProvider {
private final UserManager userManager;
private final String repPrincipalName;
EveryoneMembershipProvider(@NotNull UserManager userManager, @NotNull NamePathMapper namePathMapper) {
this.userManager = userManager;
this.repPrincipalName = namePathMapper.getJcrName(REP_PRINCIPAL_NAME);
}
@Override
public boolean coversAllMembers(@NotNull Group group) {
return Utils.isEveryone(group);
}
@Override
public @NotNull Iterator<Authorizable> getMembers(@NotNull Group group, boolean includeInherited) throws RepositoryException {
if (Utils.isEveryone(group)) {
Iterator<Authorizable> result = Iterators.filter(userManager.findAuthorizables(repPrincipalName, null, UserManager.SEARCH_TYPE_AUTHORIZABLE), Predicates.notNull());
return Iterators.filter(result, authorizable -> !Utils.isEveryone(authorizable));
} else {
return RangeIteratorAdapter.EMPTY;
}
}
@Override
public boolean isMember(@NotNull Group group, @NotNull Authorizable authorizable, boolean includeInherited) throws RepositoryException {
return Utils.isEveryone(group);
}
@Override
public @NotNull Iterator<Group> getMembership(@NotNull Authorizable authorizable, boolean includeInherited) throws RepositoryException {
Authorizable everyoneGroup = userManager.getAuthorizable(EveryonePrincipal.getInstance());
if (everyoneGroup instanceof Group) {
return new RangeIteratorAdapter(Collections.singleton((Group) everyoneGroup));
} else {
return RangeIteratorAdapter.EMPTY;
}
}
}
|
apache/jackrabbit-oak
|
oak-core/src/main/java/org/apache/jackrabbit/oak/security/user/EveryoneMembershipProvider.java
|
Java
|
apache-2.0
| 3,359 |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.ignite.ml.tree.randomforest.data;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Set;
import org.apache.ignite.ml.IgniteModel;
import org.apache.ignite.ml.math.primitives.vector.Vector;
/**
* Tree root class.
*/
public class RandomForestTreeModel implements IgniteModel<Vector, Double> {
/** Serial version uid. */
private static final long serialVersionUID = 531797299171329057L;
/** Root node. */
private TreeNode rootNode;
/** Used features. */
private Set<Integer> usedFeatures;
/**
* Create an instance of TreeRoot.
*
* @param root Root.
* @param usedFeatures Used features.
*/
public RandomForestTreeModel(TreeNode root, Set<Integer> usedFeatures) {
this.rootNode = root;
this.usedFeatures = usedFeatures;
}
public RandomForestTreeModel() {
}
/** {@inheritDoc} */
@Override public Double predict(Vector vector) {
return rootNode.predict(vector);
}
/** */
public Set<Integer> getUsedFeatures() {
return usedFeatures;
}
/** */
public TreeNode getRootNode() {
return rootNode;
}
/**
* @return All leafs in tree.
*/
public List<TreeNode> leafs() {
List<TreeNode> res = new ArrayList<>();
leafs(rootNode, res);
return res;
}
/**
* @param root Root.
* @param res Result list.
*/
private void leafs(TreeNode root, List<TreeNode> res) {
if (root.getType() == TreeNode.Type.LEAF)
res.add(root);
else {
leafs(root.getLeft(), res);
leafs(root.getRight(), res);
}
}
/**
* Represents DecisionTree as String.
*
* @param node Decision tree.
* @param pretty Use pretty mode.
*/
public static String printTree(TreeNode node, boolean pretty) {
StringBuilder builder = new StringBuilder();
printTree(node, 0, builder, pretty, false);
return builder.toString();
}
/**
* Recursive implementation of DecisionTree to String converting.
*
* @param node Decision tree.
* @param depth Current depth.
* @param builder String builder.
* @param pretty Use pretty mode.
*/
private static void printTree(TreeNode node, int depth, StringBuilder builder, boolean pretty,
boolean isThen) {
builder.append(pretty ? String.join("", Collections.nCopies(depth, "\t")) : "");
if (node.getType() == TreeNode.Type.LEAF) {
TreeNode leaf = node;
builder.append(String.format("%s return ", isThen ? "then" : "else"))
.append(String.format("%.4f", leaf.getVal()));
}
else if (node.getType() == TreeNode.Type.CONDITIONAL) {
TreeNode cond = node;
String prefix = depth == 0 ? "" : (isThen ? "then " : "else ");
builder.append(String.format("%sif (x", prefix))
.append(cond.getFeatureId())
.append(" > ")
.append(String.format("%.4f", cond.getVal()))
.append(pretty ? ")\n" : ") ");
printTree(cond.getLeft(), depth + 1, builder, pretty, true);
builder.append(pretty ? "\n" : " ");
printTree(cond.getRight(), depth + 1, builder, pretty, false);
}
else
throw new IllegalArgumentException();
}
/** {@inheritDoc} */
@Override public String toString(boolean pretty) {
return printTree(getRootNode(), pretty);
}
/** {@inheritDoc} */
@Override public String toString() {
return printTree(getRootNode(), false);
}
}
|
ascherbakoff/ignite
|
modules/ml/src/main/java/org/apache/ignite/ml/tree/randomforest/data/RandomForestTreeModel.java
|
Java
|
apache-2.0
| 4,527 |
/*!
* UI development toolkit for HTML5 (OpenUI5)
* (c) Copyright 2009-2016 SAP SE or an SAP affiliate company.
* Licensed under the Apache License, Version 2.0 - see LICENSE.txt.
*/
// Provides control sap.ui.core.search.SearchProvider.
sap.ui.define(['jquery.sap.global', 'sap/ui/core/Element', 'sap/ui/core/library'],
function(jQuery, Element, library) {
"use strict";
/**
* Constructor for a new search/SearchProvider.
*
* @param {string} [sId] id for the new control, generated automatically if no id is given
* @param {object} [mSettings] initial settings for the new control
*
* @class
* Abstract base class for all SearchProviders which can be e.g. attached to a SearchField. Do not create instances of this class, but use a concrete sub class instead.
* @extends sap.ui.core.Element
* @version 1.42.8
*
* @constructor
* @public
* @alias sap.ui.core.search.SearchProvider
* @ui5-metamodel This control/element also will be described in the UI5 (legacy) designtime metamodel
*/
var SearchProvider = Element.extend("sap.ui.core.search.SearchProvider", /** @lends sap.ui.core.search.SearchProvider.prototype */ { metadata : {
library : "sap.ui.core",
properties : {
/**
* Icon of the Search Provider
*/
icon : {type : "string", group : "Misc", defaultValue : null}
}
}});
/**
* Call this function to get suggest values from the search provider.
* The given callback function is called with the suggest value (type 'string', 1st parameter)
* and an array of the suggestions (type '[string]', 2nd parameter).
*
* @param {string} sValue The value for which suggestions are requested.
* @param {function} fnCallback The callback function which is called when the suggestions are available.
* @public
* @ui5-metamodel This method also will be described in the UI5 (legacy) designtime metamodel
*/
SearchProvider.prototype.suggest = function(sValue, fnCallback) {
jQuery.sap.log.warning("sap.ui.core.search.SearchProvider is the abstract base class for all SearchProviders. Do not create instances of this class, but use a concrete sub class instead.");
};
return SearchProvider;
});
|
icgretethe/BeAware
|
resources/sap/ui/core/search/SearchProvider-dbg.js
|
JavaScript
|
apache-2.0
| 2,176 |
/**
*
* Copyright 2004 The Apache Software Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.geronimo.timer.vm;
import EDU.oswego.cs.dl.util.concurrent.Executor;
import org.apache.geronimo.gbean.GBeanInfo;
import org.apache.geronimo.gbean.GBeanInfoBuilder;
import org.apache.geronimo.timer.NontransactionalExecutorTaskFactory;
import org.apache.geronimo.timer.PersistentTimer;
import org.apache.geronimo.timer.ThreadPooledTimer;
import org.apache.geronimo.transaction.context.TransactionContextManager;
import org.apache.geronimo.j2ee.j2eeobjectnames.NameFactory;
/**
*
*
* @version $Rev$ $Date$
*
* */
public class VMStoreThreadPooledNonTransactionalTimer extends ThreadPooledTimer {
public VMStoreThreadPooledNonTransactionalTimer(TransactionContextManager transactionContextManager, Executor threadPool) {
super(new NontransactionalExecutorTaskFactory(transactionContextManager),
new VMWorkerPersistence(), threadPool, transactionContextManager);
}
public static final GBeanInfo GBEAN_INFO;
static {
GBeanInfoBuilder infoFactory = GBeanInfoBuilder.createStatic(VMStoreThreadPooledNonTransactionalTimer.class);
infoFactory.addInterface(PersistentTimer.class);
infoFactory.addReference("ThreadPool", Executor.class, NameFactory.GERONIMO_SERVICE);
infoFactory.addReference("TransactionContextManager", TransactionContextManager.class, NameFactory.TRANSACTION_CONTEXT_MANAGER);
infoFactory.setConstructor(new String[] {"TransactionContextManager", "ThreadPool"});
GBEAN_INFO = infoFactory.getBeanInfo();
}
public static GBeanInfo getGBeanInfo() {
return GBEAN_INFO;
}
}
|
meetdestiny/geronimo-trader
|
modules/timer/src/java/org/apache/geronimo/timer/vm/VMStoreThreadPooledNonTransactionalTimer.java
|
Java
|
apache-2.0
| 2,244 |
package ml.puredark.hviewer.utils;
import android.annotation.TargetApi;
import android.content.Context;
import android.net.Uri;
import android.os.Build;
import android.os.Environment;
import android.os.storage.StorageManager;
import android.provider.DocumentsContract;
import android.support.annotation.NonNull;
import android.support.annotation.Nullable;
import android.support.v4.content.ContextCompat;
import android.util.Log;
import java.io.File;
import java.io.IOException;
import java.lang.reflect.Array;
import java.lang.reflect.Method;
import java.util.ArrayList;
/**
* Created by PureDark on 2016/9/24.
*/
public class UriUtil {
private static final String PRIMARY_VOLUME_NAME = "primary";
static String TAG = "TAG";
public static boolean isKitkat() {
return Build.VERSION.SDK_INT == Build.VERSION_CODES.KITKAT;
}
public static boolean isAndroid5() {
return Build.VERSION.SDK_INT >= Build.VERSION_CODES.LOLLIPOP;
}
@NonNull
public static String getSdCardPath() {
String sdCardDirectory = Environment.getExternalStorageDirectory().getAbsolutePath();
try {
sdCardDirectory = new File(sdCardDirectory).getCanonicalPath();
} catch (IOException ioe) {
Log.e(TAG, "Could not get SD directory", ioe);
}
return sdCardDirectory;
}
public static ArrayList<String> getExtSdCardPaths(Context con) {
ArrayList<String> paths = new ArrayList<String>();
File[] files = ContextCompat.getExternalFilesDirs(con, "external");
File firstFile = files[0];
for (File file : files) {
if (file != null && !file.equals(firstFile)) {
int index = file.getAbsolutePath().lastIndexOf("/Android/data");
if (index < 0) {
Log.w("", "Unexpected external file dir: " + file.getAbsolutePath());
} else {
String path = file.getAbsolutePath().substring(0, index);
try {
path = new File(path).getCanonicalPath();
} catch (IOException e) {
// Keep non-canonical path.
}
paths.add(path);
}
}
}
return paths;
}
@Nullable
public static String getFullPathFromTreeUri(@Nullable final Uri treeUri, Context con) {
if (treeUri == null) {
return null;
}
String volumePath = getVolumePath(getVolumeIdFromTreeUri(treeUri), con);
if (volumePath == null) {
return File.separator;
}
if (volumePath.endsWith(File.separator)) {
volumePath = volumePath.substring(0, volumePath.length() - 1);
}
String documentPath = getDocumentPathFromTreeUri(treeUri);
if (documentPath.endsWith(File.separator)) {
documentPath = documentPath.substring(0, documentPath.length() - 1);
}
if (documentPath.length() > 0) {
if (documentPath.startsWith(File.separator)) {
return volumePath + documentPath;
} else {
return volumePath + File.separator + documentPath;
}
} else {
return volumePath;
}
}
private static String getVolumePath(final String volumeId, Context con) {
if (Build.VERSION.SDK_INT < Build.VERSION_CODES.LOLLIPOP) {
return null;
}
try {
StorageManager mStorageManager =
(StorageManager) con.getSystemService(Context.STORAGE_SERVICE);
Class<?> storageVolumeClazz = Class.forName("android.os.storage.StorageVolume");
Method getVolumeList = mStorageManager.getClass().getMethod("getVolumeList");
Method getUuid = storageVolumeClazz.getMethod("getUuid");
Method getPath = storageVolumeClazz.getMethod("getPath");
Method isPrimary = storageVolumeClazz.getMethod("isPrimary");
Object result = getVolumeList.invoke(mStorageManager);
final int length = Array.getLength(result);
for (int i = 0; i < length; i++) {
Object storageVolumeElement = Array.get(result, i);
String uuid = (String) getUuid.invoke(storageVolumeElement);
Boolean primary = (Boolean) isPrimary.invoke(storageVolumeElement);
// primary volume?
if (primary && PRIMARY_VOLUME_NAME.equals(volumeId)) {
return (String) getPath.invoke(storageVolumeElement);
}
// other volumes?
if (uuid != null) {
if (uuid.equals(volumeId)) {
return (String) getPath.invoke(storageVolumeElement);
}
}
}
// not found.
return null;
} catch (Exception ex) {
return null;
}
}
@TargetApi(Build.VERSION_CODES.LOLLIPOP)
private static String getVolumeIdFromTreeUri(final Uri treeUri) {
final String docId = DocumentsContract.getTreeDocumentId(treeUri);
final String[] split = docId.split(":");
if (split.length > 0) {
return split[0];
} else {
return null;
}
}
@TargetApi(Build.VERSION_CODES.LOLLIPOP)
private static String getDocumentPathFromTreeUri(final Uri treeUri) {
final String docId = DocumentsContract.getTreeDocumentId(treeUri);
final String[] split = docId.split(":");
if ((split.length >= 2) && (split[1] != null)) {
return split[1];
} else {
return File.separator;
}
}
}
|
PureDark/H-Viewer
|
app/src/main/java/ml/puredark/hviewer/utils/UriUtil.java
|
Java
|
apache-2.0
| 5,783 |
// Copyright (c) 2015 Alachisoft
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
using System;
using System.Collections.Generic;
namespace Enyim.Caching.Memcached.Protocol.Binary
{
public abstract class BinaryOperation : Operation
{
protected abstract BinaryRequest Build();
protected internal override IList<ArraySegment<byte>> GetBuffer()
{
return this.Build().CreateBuffer();
}
protected internal override bool ReadResponseAsync(PooledSocket socket, System.Action<bool> next)
{
throw new System.NotSupportedException();
}
}
}
#region [ License information ]
/* ************************************************************
*
* Copyright (c) 2010 Attila Kisk�, enyim.com
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* ************************************************************/
#endregion
|
Teino1978-Corp/NCache
|
Integration/MemCached/Clients/Enyim.Caching/Src/Enyim.Caching/Memcached/Protocol/Binary/BinaryOperation.cs
|
C#
|
apache-2.0
| 1,908 |
/*
* Copyright (c) 2013 - 2014, Freescale Semiconductor, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* o Redistributions of source code must retain the above copyright notice, this list
* of conditions and the following disclaimer.
*
* o Redistributions in binary form must reproduce the above copyright notice, this
* list of conditions and the following disclaimer in the documentation and/or
* other materials provided with the distribution.
*
* o Neither the name of Freescale Semiconductor, Inc. nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef __FSL_PIT_HAL_H__
#define __FSL_PIT_HAL_H__
#include <assert.h>
#include <stdint.h>
#include <stdbool.h>
#include "fsl_pit_features.h"
#include "fsl_device_registers.h"
/*!
* @addtogroup pit_hal
* @{
*/
/*******************************************************************************
* API
******************************************************************************/
#if defined(__cplusplus)
extern "C" {
#endif
/*!
* @name Initialization
* @{
*/
/*!
* @brief Enables the PIT module.
*
* This function enables the PIT timer clock (Note: this function does not un-gate
* the system clock gating control). It should be called before any other timer
* related setup.
*/
static inline void pit_hal_enable(void)
{
BW_PIT_MCR_MDIS(0U);
}
/*!
* @brief Disables the PIT module.
*
* This function disables all PIT timer clocks(Note: it does not affect the
* SIM clock gating control).
*/
static inline void pit_hal_disable(void)
{
BW_PIT_MCR_MDIS(1U);
}
/*!
* @brief Configures the timers to continue running or stop in debug mode.
*
* In debug mode, the timers may or may not be frozen, based on the configuration of
* this function. This is intended to aid software development, allowing the developer
* to halt the processor, investigate the current state of the system (for example,
* the timer values), and continue the operation.
*
* @param timerRun Timers run or stop in debug mode.
* - true: Timers continue to run in debug mode.
* - false: Timers stop in debug mode.
*/
static inline void pit_hal_configure_timer_run_in_debug(bool timerRun)
{
BW_PIT_MCR_FRZ(!timerRun);
}
#if FSL_FEATURE_PIT_HAS_CHAIN_MODE
/*!
* @brief Enables or disables the timer chain with the previous timer.
*
* When a timer has a chain mode enabled, it only counts after the previous
* timer has expired. If the timer n-1 has counted down to 0, counter n
* decrements the value by one. This allows the developers to chain timers together
* and form a longer timer. The first timer (timer 0) cannot be chained to any
* other timer.
*
* @param timer Timer channel number which is chained with the previous timer.
* @param enable Enable or disable chain.
* - true: Current timer is chained with the previous timer.
* - false: Timer doesn't chain with other timers.
*/
static inline void pit_hal_configure_timer_chain(uint32_t timer, bool enable)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
BW_PIT_TCTRLn_CHN(timer, enable);
}
#endif /* FSL_FEATURE_PIT_HAS_CHAIN_MODE*/
/* @} */
/*!
* @name Timer Start and Stop
* @{
*/
/*!
* @brief Starts the timer counting.
*
* After calling this function, timers load the start value as specified by the function
* pit_hal_set_timer_period_count(uint32_t timer, uint32_t count), count down to
* 0, and load the respective start value again. Each time a timer reaches 0,
* it generates a trigger pulse and sets the time-out interrupt flag.
*
* @param timer Timer channel number
*/
static inline void pit_hal_timer_start(uint32_t timer)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
BW_PIT_TCTRLn_TEN(timer, 1U);
}
/*!
* @brief Stops the timer from counting.
*
* This function stops every timer from counting. Timers reload their periods
* respectively after they call the pit_hal_timer_start the next time.
*
* @param timer Timer channel number
*/
static inline void pit_hal_timer_stop(uint32_t timer)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
BW_PIT_TCTRLn_TEN(timer, 0U);
}
/*!
* @brief Checks to see whether the current timer is started or not.
*
* @param timer Timer channel number
* @return Current timer running status
* -true: Current timer is running.
* -false: Current timer has stopped.
*/
static inline bool pit_hal_is_timer_started(uint32_t timer)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
return BR_PIT_TCTRLn_TEN(timer);
}
/* @} */
/*!
* @name Timer Period
* @{
*/
/*!
* @brief Sets the timer period in units of count.
*
* Timers begin counting from the value set by this function.
* The counter period of a running timer can be modified by first stopping
* the timer, setting a new load value, and starting the timer again. If
* timers are not restarted, the new value is loaded after the next trigger
* event.
*
* @param timer Timer channel number
* @param count Timer period in units of count
*/
static inline void pit_hal_set_timer_period_count(uint32_t timer, uint32_t count)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
HW_PIT_LDVALn_WR(timer, count);
}
/*!
* @brief Returns the current timer period in units of count.
*
* @param timer Timer channel number
* @return Timer period in units of count
*/
static inline uint32_t pit_hal_read_timer_period_count(uint32_t timer)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
return HW_PIT_LDVALn_RD(timer);
}
/*!
* @brief Reads the current timer counting value.
*
* This function returns the real-time timer counting value, in a range from 0 to a
* timer period.
*
* @param timer Timer channel number
* @return Current timer counting value
*/
static inline uint32_t pit_hal_read_timer_count(uint32_t timer)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
return HW_PIT_CVALn_RD(timer);
}
#if FSL_FEATURE_PIT_HAS_LIFETIME_TIMER
/*!
* @brief Reads the current lifetime counter value.
*
* The lifetime timer is a 64-bit timer which chains timer 0 and timer 1 together.
* Timer 0 and 1 are chained by calling the pit_hal_configure_timer_chain
* before using this timer. The period of lifetime timer is equal to the "period of
* timer 0 * period of timer 1". For the 64-bit value, the higher 32-bit has
* the value of timer 1, and the lower 32-bit has the value of timer 0.
*
* @return Current lifetime timer value
*/
uint64_t pit_hal_read_lifetime_timer_count(void);
#endif /*FSL_FEATURE_PIT_HAS_LIFETIME_TIMER*/
/* @} */
/*!
* @name Interrupt
* @{
*/
/*!
* @brief Enables or disables the timer interrupt.
*
* If enabled, an interrupt happens when a timeout event occurs
* (Note: NVIC should be called to enable pit interrupt in system level).
*
* @param timer Timer channel number
* @param enable Enable or disable interrupt.
* - true: Generate interrupt when timer counts to 0.
* - false: No interrupt is generated.
*/
static inline void pit_hal_configure_interrupt(uint32_t timer, bool enable)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
BW_PIT_TCTRLn_TIE(timer, enable);
}
/*!
* @brief Checks whether the timer interrupt is enabled or not.
*
* @param timer Timer channel number
* @return Status of enabled or disabled interrupt
* - true: Interrupt is enabled.
* - false: Interrupt is disabled.
*/
static inline bool pit_hal_is_interrupt_enabled(uint32_t timer)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
return BR_PIT_TCTRLn_TIE(timer);
}
/*!
* @brief Clears the timer interrupt flag.
*
* This function clears the timer interrupt flag after a timeout event
* occurs.
*
* @param timer Timer channel number
*/
static inline void pit_hal_clear_interrupt_flag(uint32_t timer)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
/* Write 1 will clear the flag. */
HW_PIT_TFLGn_WR(timer, 1U);
}
/*!
* @brief Reads the current timer timeout flag.
*
* Every time the timer counts to 0, this flag is set.
*
* @param timer Timer channel number
* @return Current status of the timeout flag
* - true: Timeout has occurred.
* - false: Timeout has not yet occurred.
*/
static inline bool pit_hal_is_timeout_occurred(uint32_t timer)
{
assert(timer < FSL_FEATURE_PIT_TIMER_COUNT);
return HW_PIT_TFLGn_RD(timer);
}
/* @} */
#if defined(__cplusplus)
}
#endif
/*! @}*/
#endif /* __FSL_PIT_HAL_H__*/
/*******************************************************************************
* EOF
*******************************************************************************/
|
NordicSemiconductor/mbed
|
libraries/mbed/targets/hal/TARGET_Freescale/TARGET_KPSDK_MCUS/TARGET_KPSDK_CODE/hal/pit/fsl_pit_hal.h
|
C
|
apache-2.0
| 9,658 |
--TEST--
Put - Only key parameter.Data parameter missing.
--FILE--
<?php
include dirname(__FILE__)."/../../astestframework/astest-phpt-loader.inc";
aerospike_phpt_runtest("Put", "testPUTWithOnlyKeyParameter");
--EXPECT--
ERR_PARAM
|
aerospike/aerospike-client-php
|
src/tests/phpt/Put/CheckWithOnlyKeyParameter.phpt
|
PHP
|
apache-2.0
| 232 |
# Text Analysis of The Collected Works of William Shakespeare #
The Collected Works of William Shakespeare was used as a dataset to test trees during development. This is not actually a large dataset by today's standards, at <10 MB of text files, but nonetheless useful for testing. It's unclear how the Bard would feel about his work being used for this purpose, no offense intended!
Standalone programs to build trees from and analyze The Collected Works of William Shakespeare can be found [here](../code/src/test/java/com/googlecode/concurrenttrees/examples/shakespeare/).
Some output from these programs:
* Radix Tree of the **individual words** contained in all of Shakespeare's works
* Tree [viewable here](../code/src/test/resources/shakespeare-trees/radix-tree-words-shakespeare-collected-works.txt)
* Values are the works containing those words
* 29,008 nodes
* Suffix Tree of the **individual words** contained in all of Shakespeare's works
* Tree [viewable here](../code/src/test/resources/shakespeare-trees/suffix-tree-words-shakespeare-collected-works.txt)
* Values in this output are the complete words associated with each suffix
* 75,780 nodes
* Suffix Tree of Shakespeare's Tragedy, Antony and Cleopatra
* 280 MB in RAM using `DefaultCharSequenceNodeFactory`
* Insufficient RAM to build tree using `DefaultCharArrayNodeFactory`
* 29.438 GB if written to disk (highlights problems suffered by `DefaultCharArrayNodeFactory`)
* 217,697 nodes
* Suffix Tree of the entirety of Shakespeare's Tragedies (10 plays)
* 2.0 GB in RAM using `DefaultCharSequenceNodeFactory`
* Insufficient RAM to build tree using `DefaultCharArrayNodeFactory`
* 248.997 GB if written to disk (highlights memory which would be required by `DefaultCharArrayNodeFactory`)
* 1,965,884 nodes
* The Longest Common Substring of Shakespeare's Tragedies (10 plays)
* Output [viewable here](../code/src/test/resources/shakespeare-trees/tragedies-longest-common-substring.txt)
* Longest common substring is: "**` dramatis personae `**"
|
npgall/concurrent-trees
|
documentation/ShakespeareCollectedWorks.md
|
Markdown
|
apache-2.0
| 2,095 |
package com.hsj.http.interceptor;
import java.io.IOException;
import okhttp3.Interceptor;
import okhttp3.Response;
/**
* @Author:HSJ
* @E-mail:[email protected]
* @Date:2017/08/08 00:05
* @Class:CacheInterceptor
* @Description:缓存拦截器
*/
public class CacheInterceptor implements Interceptor{
@Override
public Response intercept(Chain chain) throws IOException {
return null;
}
}
|
hushengjun/FastAndroid
|
library/http/src/main/java/com/hsj/http/interceptor/CacheInterceptor.java
|
Java
|
apache-2.0
| 422 |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.solr.client.solrj.request;
import static org.hamcrest.CoreMatchers.anyOf;
import static org.hamcrest.CoreMatchers.equalTo;
import static org.hamcrest.CoreMatchers.is;
import java.io.File;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Locale;
import java.util.Map;
import java.util.SortedMap;
import java.util.TreeMap;
import org.apache.commons.io.FileUtils;
import org.apache.solr.client.solrj.SolrClient;
import org.apache.solr.client.solrj.impl.BaseHttpSolrClient;
import org.apache.solr.client.solrj.request.schema.AnalyzerDefinition;
import org.apache.solr.client.solrj.request.schema.FieldTypeDefinition;
import org.apache.solr.client.solrj.request.schema.SchemaRequest;
import org.apache.solr.client.solrj.response.SolrResponseBase;
import org.apache.solr.client.solrj.response.schema.FieldTypeRepresentation;
import org.apache.solr.client.solrj.response.schema.SchemaRepresentation;
import org.apache.solr.client.solrj.response.schema.SchemaResponse;
import org.apache.solr.common.SolrException;
import org.apache.solr.common.util.NamedList;
import org.apache.solr.common.util.SimpleOrderedMap;
import org.apache.solr.util.RestTestBase;
import org.eclipse.jetty.servlet.ServletHolder;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
/**
* Test the functionality (accuracy and failure) of the methods exposed by the classes {@link
* SchemaRequest} and {@link SchemaResponse}.
*/
public class SchemaTest extends RestTestBase {
private static void assertValidSchemaResponse(SolrResponseBase schemaResponse) {
assertEquals(
"Response contained errors: " + schemaResponse.toString(), 0, schemaResponse.getStatus());
assertNull(
"Response contained errors: " + schemaResponse.toString(),
schemaResponse.getResponse().get("errors"));
}
private static void assertFailedSchemaResponse(
ThrowingRunnable runnable, String expectedErrorMessage) {
BaseHttpSolrClient.RemoteExecutionException e =
expectThrows(BaseHttpSolrClient.RemoteExecutionException.class, runnable);
SimpleOrderedMap<?> errorMap = (SimpleOrderedMap<?>) e.getMetaData().get("error");
assertEquals(
"org.apache.solr.api.ApiBag$ExceptionWithErrObject",
((NamedList) errorMap.get("metadata")).get("error-class"));
List<?> details = (List<?>) errorMap.get("details");
assertTrue(
((List<?>) ((Map<?, ?>) details.get(0)).get("errorMessages"))
.get(0)
.toString()
.contains(expectedErrorMessage));
}
private static void createStoredStringField(String fieldName, SolrClient solrClient)
throws Exception {
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
fieldAttributes.put("name", fieldName);
fieldAttributes.put("type", "string");
fieldAttributes.put("stored", true);
SchemaRequest.AddField addFieldRequest = new SchemaRequest.AddField(fieldAttributes);
addFieldRequest.process(solrClient);
}
private static SchemaRequest.AddFieldType createFieldTypeRequest(String fieldTypeName) {
FieldTypeDefinition fieldTypeDefinition = new FieldTypeDefinition();
Map<String, Object> fieldTypeAttributes = new LinkedHashMap<>();
fieldTypeAttributes.put("name", fieldTypeName);
fieldTypeAttributes.put("class", "solr.TextField");
fieldTypeDefinition.setAttributes(fieldTypeAttributes);
AnalyzerDefinition indexAnalyzerDefinition = new AnalyzerDefinition();
Map<String, Object> iTokenizerAttributes = new LinkedHashMap<>();
iTokenizerAttributes.put("class", "solr.PathHierarchyTokenizerFactory");
iTokenizerAttributes.put("delimiter", "/");
indexAnalyzerDefinition.setTokenizer(iTokenizerAttributes);
fieldTypeDefinition.setIndexAnalyzer(indexAnalyzerDefinition);
AnalyzerDefinition queryAnalyzerDefinition = new AnalyzerDefinition();
Map<String, Object> qTokenizerAttributes = new LinkedHashMap<>();
qTokenizerAttributes.put("class", "solr.KeywordTokenizerFactory");
queryAnalyzerDefinition.setTokenizer(qTokenizerAttributes);
fieldTypeDefinition.setQueryAnalyzer(queryAnalyzerDefinition);
return new SchemaRequest.AddFieldType(fieldTypeDefinition);
}
@Before
public void init() throws Exception {
File tmpSolrHome = createTempDir().toFile();
FileUtils.copyDirectory(
new File(getFile("solrj/solr/collection1").getParent()), tmpSolrHome.getAbsoluteFile());
final SortedMap<ServletHolder, String> extraServlets = new TreeMap<>();
System.setProperty("managed.schema.mutable", "true");
System.setProperty("enable.update.log", "false");
createJettyAndHarness(
tmpSolrHome.getAbsolutePath(),
"solrconfig-managed-schema.xml",
"schema.xml",
"/solr",
true,
extraServlets);
}
@After
public void cleanup() throws Exception {
if (jetty != null) {
jetty.stop();
jetty = null;
}
if (restTestHarness != null) {
restTestHarness.close();
}
restTestHarness = null;
}
@Test
public void testSchemaRequestAccuracy() throws Exception {
SchemaRequest schemaRequest = new SchemaRequest();
SchemaResponse schemaResponse = schemaRequest.process(getSolrClient());
assertValidSchemaResponse(schemaResponse);
SchemaRepresentation schemaRepresentation = schemaResponse.getSchemaRepresentation();
assertNotNull(schemaRepresentation);
assertEquals("test", schemaRepresentation.getName());
assertEquals(1.6, schemaRepresentation.getVersion(), 0.001f);
assertEquals("id", schemaRepresentation.getUniqueKey());
assertFalse(schemaRepresentation.getFields().isEmpty());
assertFalse(schemaRepresentation.getDynamicFields().isEmpty());
assertFalse(schemaRepresentation.getFieldTypes().isEmpty());
assertFalse(schemaRepresentation.getCopyFields().isEmpty());
}
@Test
public void testSchemaNameRequestAccuracy() throws Exception {
SchemaRequest.SchemaName schemaNameRequest = new SchemaRequest.SchemaName();
SchemaResponse.SchemaNameResponse schemaNameResponse =
schemaNameRequest.process(getSolrClient());
assertValidSchemaResponse(schemaNameResponse);
assertEquals("test", schemaNameResponse.getSchemaName());
}
@Test
public void testSchemaVersionRequestAccuracy() throws Exception {
SchemaRequest.SchemaVersion schemaVersionRequest = new SchemaRequest.SchemaVersion();
SchemaResponse.SchemaVersionResponse schemaVersionResponse =
schemaVersionRequest.process(getSolrClient());
assertValidSchemaResponse(schemaVersionResponse);
assertEquals(1.6, schemaVersionResponse.getSchemaVersion(), 0.001);
}
@Test
public void testGetFieldsAccuracy() throws Exception {
SchemaRequest.Fields fieldsSchemaRequest = new SchemaRequest.Fields();
SchemaResponse.FieldsResponse fieldsResponse = fieldsSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(fieldsResponse);
List<Map<String, Object>> fields = fieldsResponse.getFields();
assertThat(fields.isEmpty(), is(false));
}
@Test
public void testGetFieldAccuracy() throws Exception {
String fieldName = "signatureField";
SchemaRequest.Field fieldSchemaRequest = new SchemaRequest.Field(fieldName);
SchemaResponse.FieldResponse fieldResponse = fieldSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(fieldResponse);
Map<String, Object> fieldAttributes = fieldResponse.getField();
assertThat(fieldName, is(equalTo(fieldAttributes.get("name"))));
assertThat("string", is(equalTo(fieldAttributes.get("type"))));
}
@Test
public void testGetDynamicFieldsAccuracy() throws Exception {
SchemaRequest.DynamicFields dynamicFieldsSchemaRequest = new SchemaRequest.DynamicFields();
SchemaResponse.DynamicFieldsResponse dynamicFieldsResponse =
dynamicFieldsSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(dynamicFieldsResponse);
List<Map<String, Object>> fields = dynamicFieldsResponse.getDynamicFields();
assertThat(fields.isEmpty(), is(false));
}
@Test
public void testGetDynamicFieldAccuracy() throws Exception {
String dynamicFieldName = "*_i";
SchemaRequest.DynamicField dynamicFieldSchemaRequest =
new SchemaRequest.DynamicField(dynamicFieldName);
SchemaResponse.DynamicFieldResponse dynamicFieldResponse =
dynamicFieldSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(dynamicFieldResponse);
Map<String, Object> dynamicFieldAttributes = dynamicFieldResponse.getDynamicField();
assertThat(dynamicFieldName, is(equalTo(dynamicFieldAttributes.get("name"))));
assertThat("int", is(equalTo(dynamicFieldAttributes.get("type"))));
}
@Test
public void testGetFieldTypesAccuracy() throws Exception {
SchemaRequest.FieldTypes fieldTypesRequest = new SchemaRequest.FieldTypes();
SchemaResponse.FieldTypesResponse fieldTypesResponse =
fieldTypesRequest.process(getSolrClient());
assertValidSchemaResponse(fieldTypesResponse);
List<FieldTypeRepresentation> fieldTypes = fieldTypesResponse.getFieldTypes();
assertThat(fieldTypes.isEmpty(), is(false));
}
@Test
public void testGetFieldTypeAccuracy() throws Exception {
String fieldType = "string";
SchemaRequest.FieldType fieldTypeSchemaRequest = new SchemaRequest.FieldType(fieldType);
SchemaResponse.FieldTypeResponse fieldTypeResponse =
fieldTypeSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(fieldTypeResponse);
FieldTypeRepresentation fieldTypeDefinition = fieldTypeResponse.getFieldType();
assertThat(fieldType, is(equalTo(fieldTypeDefinition.getAttributes().get("name"))));
assertThat("solr.StrField", is(equalTo(fieldTypeDefinition.getAttributes().get("class"))));
}
@Test
public void testGetCopyFieldsAccuracy() throws Exception {
SchemaRequest.CopyFields copyFieldsRequest = new SchemaRequest.CopyFields();
SchemaResponse.CopyFieldsResponse copyFieldsResponse =
copyFieldsRequest.process(getSolrClient());
assertValidSchemaResponse(copyFieldsResponse);
List<Map<String, Object>> copyFieldsAttributes = copyFieldsResponse.getCopyFields();
assertThat(copyFieldsAttributes.isEmpty(), is(false));
}
@Test
public void testGetUniqueKeyAccuracy() throws Exception {
SchemaRequest.UniqueKey uniqueKeyRequest = new SchemaRequest.UniqueKey();
SchemaResponse.UniqueKeyResponse uniqueKeyResponse = uniqueKeyRequest.process(getSolrClient());
assertValidSchemaResponse(uniqueKeyResponse);
assertEquals("id", uniqueKeyResponse.getUniqueKey());
}
@Test
public void testGetGlobalSimilarityAccuracy() throws Exception {
SchemaRequest.GlobalSimilarity globalSimilarityRequest = new SchemaRequest.GlobalSimilarity();
SchemaResponse.GlobalSimilarityResponse globalSimilarityResponse =
globalSimilarityRequest.process(getSolrClient());
assertValidSchemaResponse(globalSimilarityResponse);
assertEquals(
"org.apache.solr.search.similarities.SchemaSimilarityFactory",
globalSimilarityResponse.getSimilarity().get("class"));
}
@Test
public void testAddFieldAccuracy() throws Exception {
SchemaRequest.Fields fieldsSchemaRequest = new SchemaRequest.Fields();
SchemaResponse.FieldsResponse initialFieldsResponse =
fieldsSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(initialFieldsResponse);
List<Map<String, Object>> initialFields = initialFieldsResponse.getFields();
String fieldName = "accuracyField";
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
fieldAttributes.put("name", fieldName);
fieldAttributes.put("type", "string");
fieldAttributes.put("stored", false);
fieldAttributes.put("indexed", true);
fieldAttributes.put("default", "accuracy");
fieldAttributes.put("required", true);
SchemaRequest.AddField addFieldUpdateSchemaRequest =
new SchemaRequest.AddField(fieldAttributes);
SchemaResponse.UpdateResponse addFieldResponse =
addFieldUpdateSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldResponse);
SchemaResponse.FieldsResponse currentFieldsResponse =
fieldsSchemaRequest.process(getSolrClient());
assertEquals(0, currentFieldsResponse.getStatus());
List<Map<String, Object>> currentFields = currentFieldsResponse.getFields();
assertEquals(initialFields.size() + 1, currentFields.size());
SchemaRequest.Field fieldSchemaRequest = new SchemaRequest.Field(fieldName);
SchemaResponse.FieldResponse newFieldResponse = fieldSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(newFieldResponse);
Map<String, Object> newFieldAttributes = newFieldResponse.getField();
assertThat(fieldName, is(equalTo(newFieldAttributes.get("name"))));
assertThat("string", is(equalTo(newFieldAttributes.get("type"))));
assertThat(false, is(equalTo(newFieldAttributes.get("stored"))));
assertThat(true, is(equalTo(newFieldAttributes.get("indexed"))));
assertThat("accuracy", is(equalTo(newFieldAttributes.get("default"))));
assertThat(true, is(equalTo(newFieldAttributes.get("required"))));
}
@Test
public void addFieldShouldntBeCalledTwiceWithTheSameName() throws Exception {
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
String fieldName = "failureField";
fieldAttributes.put("name", fieldName);
fieldAttributes.put("type", "string");
SchemaRequest.AddField addFieldUpdateSchemaRequest =
new SchemaRequest.AddField(fieldAttributes);
SchemaResponse.UpdateResponse addFieldFirstResponse =
addFieldUpdateSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldFirstResponse);
assertFailedSchemaResponse(
() -> addFieldUpdateSchemaRequest.process(getSolrClient()),
"Field '" + fieldName + "' already exists.");
}
@Test
public void testDeleteFieldAccuracy() throws Exception {
String fieldName = "fieldToBeDeleted";
Map<String, Object> fieldAttributesRequest = new LinkedHashMap<>();
fieldAttributesRequest.put("name", fieldName);
fieldAttributesRequest.put("type", "string");
SchemaRequest.AddField addFieldUpdateSchemaRequest =
new SchemaRequest.AddField(fieldAttributesRequest);
SchemaResponse.UpdateResponse addFieldResponse =
addFieldUpdateSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldResponse);
SchemaRequest.Field fieldSchemaRequest = new SchemaRequest.Field(fieldName);
SchemaResponse.FieldResponse initialFieldResponse = fieldSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(initialFieldResponse);
Map<String, Object> fieldAttributesResponse = initialFieldResponse.getField();
assertThat(fieldName, is(equalTo(fieldAttributesResponse.get("name"))));
SchemaRequest.DeleteField deleteFieldRequest = new SchemaRequest.DeleteField(fieldName);
SchemaResponse.UpdateResponse deleteFieldResponse = deleteFieldRequest.process(getSolrClient());
assertValidSchemaResponse(deleteFieldResponse);
expectThrows(SolrException.class, () -> fieldSchemaRequest.process(getSolrClient()));
}
@Test
public void deletingAFieldThatDoesntExistInTheSchemaShouldFail() {
String fieldName = "fieldToBeDeleted";
SchemaRequest.DeleteField deleteFieldRequest = new SchemaRequest.DeleteField(fieldName);
assertFailedSchemaResponse(
() -> deleteFieldRequest.process(getSolrClient()),
"The field '" + fieldName + "' is not present in this schema, and so cannot be deleted.");
}
@Test
public void testReplaceFieldAccuracy() throws Exception {
// Given
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
String fieldName = "accuracyField";
fieldAttributes.put("name", fieldName);
fieldAttributes.put("type", "string");
fieldAttributes.put("stored", false);
fieldAttributes.put("indexed", true);
fieldAttributes.put("required", true);
SchemaRequest.AddField addFieldUpdateSchemaRequest =
new SchemaRequest.AddField(fieldAttributes);
SchemaResponse.UpdateResponse addFieldResponse =
addFieldUpdateSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldResponse);
// When : update the field definition
fieldAttributes.put("stored", true);
fieldAttributes.put("indexed", false);
SchemaRequest.ReplaceField replaceFieldRequest =
new SchemaRequest.ReplaceField(fieldAttributes);
SchemaResponse.UpdateResponse replaceFieldResponse =
replaceFieldRequest.process(getSolrClient());
assertValidSchemaResponse(replaceFieldResponse);
// Then
SchemaRequest.Field fieldSchemaRequest = new SchemaRequest.Field(fieldName);
SchemaResponse.FieldResponse newFieldResponse = fieldSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(newFieldResponse);
Map<String, Object> newFieldAttributes = newFieldResponse.getField();
assertThat(fieldName, is(equalTo(newFieldAttributes.get("name"))));
assertThat("string", is(equalTo(newFieldAttributes.get("type"))));
assertThat(true, is(equalTo(newFieldAttributes.get("stored"))));
assertThat(false, is(equalTo(newFieldAttributes.get("indexed"))));
assertThat(true, is(equalTo(newFieldAttributes.get("required"))));
}
@Test
public void testAddDynamicFieldAccuracy() throws Exception {
SchemaRequest.DynamicFields dynamicFieldsSchemaRequest = new SchemaRequest.DynamicFields();
SchemaResponse.DynamicFieldsResponse initialDFieldsResponse =
dynamicFieldsSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(initialDFieldsResponse);
List<Map<String, Object>> initialDFields = initialDFieldsResponse.getDynamicFields();
String dFieldName = "*_acc";
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
fieldAttributes.put("name", dFieldName);
fieldAttributes.put("type", "string");
fieldAttributes.put("stored", false);
fieldAttributes.put("indexed", true);
// Dynamic fields cannot be required or have a default value
SchemaRequest.AddDynamicField addFieldUpdateSchemaRequest =
new SchemaRequest.AddDynamicField(fieldAttributes);
SchemaResponse.UpdateResponse addFieldResponse =
addFieldUpdateSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldResponse);
SchemaResponse.DynamicFieldsResponse currentDFieldsResponse =
dynamicFieldsSchemaRequest.process(getSolrClient());
assertEquals(0, currentDFieldsResponse.getStatus());
List<Map<String, Object>> currentFields = currentDFieldsResponse.getDynamicFields();
assertEquals(initialDFields.size() + 1, currentFields.size());
SchemaRequest.DynamicField dFieldRequest = new SchemaRequest.DynamicField(dFieldName);
SchemaResponse.DynamicFieldResponse newFieldResponse = dFieldRequest.process(getSolrClient());
assertValidSchemaResponse(newFieldResponse);
Map<String, Object> newFieldAttributes = newFieldResponse.getDynamicField();
assertThat(dFieldName, is(equalTo(newFieldAttributes.get("name"))));
assertThat("string", is(equalTo(newFieldAttributes.get("type"))));
assertThat(false, is(equalTo(newFieldAttributes.get("stored"))));
assertThat(true, is(equalTo(newFieldAttributes.get("indexed"))));
}
@Test
public void addDynamicFieldShouldntBeCalledTwiceWithTheSameName() throws Exception {
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
String dynamicFieldName = "*_failure";
fieldAttributes.put("name", dynamicFieldName);
fieldAttributes.put("type", "string");
SchemaRequest.AddDynamicField addDFieldUpdateSchemaRequest =
new SchemaRequest.AddDynamicField(fieldAttributes);
SolrClient client = getSolrClient();
SchemaResponse.UpdateResponse addDFieldFirstResponse =
addDFieldUpdateSchemaRequest.process(client);
assertValidSchemaResponse(addDFieldFirstResponse);
assertFailedSchemaResponse(
() -> addDFieldUpdateSchemaRequest.process(getSolrClient()),
"[schema.xml] Duplicate DynamicField definition for '" + dynamicFieldName + "'");
}
@Test
public void testDeleteDynamicFieldAccuracy() throws Exception {
String dynamicFieldName = "*_del";
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
fieldAttributes.put("name", dynamicFieldName);
fieldAttributes.put("type", "string");
SchemaRequest.AddDynamicField addFieldUpdateSchemaRequest =
new SchemaRequest.AddDynamicField(fieldAttributes);
SchemaResponse.UpdateResponse addDynamicFieldResponse =
addFieldUpdateSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(addDynamicFieldResponse);
SchemaRequest.DynamicField dynamicFieldSchemaRequest =
new SchemaRequest.DynamicField(dynamicFieldName);
SchemaResponse.DynamicFieldResponse initialDFieldResponse =
dynamicFieldSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(initialDFieldResponse);
Map<String, Object> fieldAttributesResponse = initialDFieldResponse.getDynamicField();
assertThat(dynamicFieldName, is(equalTo(fieldAttributesResponse.get("name"))));
SchemaRequest.DeleteDynamicField deleteFieldRequest =
new SchemaRequest.DeleteDynamicField(dynamicFieldName);
SchemaResponse.UpdateResponse deleteDynamicFieldResponse =
deleteFieldRequest.process(getSolrClient());
assertValidSchemaResponse(deleteDynamicFieldResponse);
expectThrows(SolrException.class, () -> dynamicFieldSchemaRequest.process(getSolrClient()));
}
@Test
public void deletingADynamicFieldThatDoesntExistInTheSchemaShouldFail() throws Exception {
String dynamicFieldName = "*_notexists";
SchemaRequest.DeleteDynamicField deleteDynamicFieldRequest =
new SchemaRequest.DeleteDynamicField(dynamicFieldName);
assertFailedSchemaResponse(
() -> deleteDynamicFieldRequest.process(getSolrClient()),
"The dynamic field '"
+ dynamicFieldName
+ "' is not present in this schema, and so cannot be deleted.");
}
@Test
public void testReplaceDynamicFieldAccuracy() throws Exception {
// Given
String fieldName = "*_replace";
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
fieldAttributes.put("name", fieldName);
fieldAttributes.put("type", "string");
fieldAttributes.put("stored", false);
fieldAttributes.put("indexed", true);
SchemaRequest.AddDynamicField addDFieldUpdateSchemaRequest =
new SchemaRequest.AddDynamicField(fieldAttributes);
SchemaResponse.UpdateResponse addFieldResponse =
addDFieldUpdateSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldResponse);
// When : update the field definition
Map<String, Object> replaceFieldAttributes = new LinkedHashMap<>(fieldAttributes);
replaceFieldAttributes.put("stored", true);
replaceFieldAttributes.put("indexed", false);
SchemaRequest.ReplaceDynamicField replaceFieldRequest =
new SchemaRequest.ReplaceDynamicField(replaceFieldAttributes);
SchemaResponse.UpdateResponse replaceFieldResponse =
replaceFieldRequest.process(getSolrClient());
assertValidSchemaResponse(replaceFieldResponse);
// Then
SchemaRequest.DynamicField dynamicFieldSchemaRequest =
new SchemaRequest.DynamicField(fieldName);
SchemaResponse.DynamicFieldResponse newFieldResponse =
dynamicFieldSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(newFieldResponse);
Map<String, Object> newFieldAttributes = newFieldResponse.getDynamicField();
assertThat(fieldName, is(equalTo(newFieldAttributes.get("name"))));
assertThat("string", is(equalTo(newFieldAttributes.get("type"))));
assertThat(true, is(equalTo(newFieldAttributes.get("stored"))));
assertThat(false, is(equalTo(newFieldAttributes.get("indexed"))));
}
@Test
public void testAddFieldTypeAccuracy() throws Exception {
SchemaRequest.FieldTypes fieldTypesRequest = new SchemaRequest.FieldTypes();
SchemaResponse.FieldTypesResponse initialFieldTypesResponse =
fieldTypesRequest.process(getSolrClient());
assertValidSchemaResponse(initialFieldTypesResponse);
List<FieldTypeRepresentation> initialFieldTypes = initialFieldTypesResponse.getFieldTypes();
FieldTypeDefinition fieldTypeDefinition = new FieldTypeDefinition();
Map<String, Object> fieldTypeAttributes = new LinkedHashMap<>();
String fieldTypeName = "accuracyTextField";
fieldTypeAttributes.put("name", fieldTypeName);
fieldTypeAttributes.put("class", "solr.TextField");
fieldTypeAttributes.put("positionIncrementGap", "100");
fieldTypeDefinition.setAttributes(fieldTypeAttributes);
AnalyzerDefinition analyzerDefinition = new AnalyzerDefinition();
Map<String, Object> charFilterAttributes = new LinkedHashMap<>();
charFilterAttributes.put("class", "solr.PatternReplaceCharFilterFactory");
charFilterAttributes.put("replacement", "$1$1");
charFilterAttributes.put("pattern", "([a-zA-Z])\\\\1+");
analyzerDefinition.setCharFilters(Collections.singletonList(charFilterAttributes));
Map<String, Object> tokenizerAttributes = new LinkedHashMap<>();
tokenizerAttributes.put("class", "solr.WhitespaceTokenizerFactory");
analyzerDefinition.setTokenizer(tokenizerAttributes);
Map<String, Object> filterAttributes = new LinkedHashMap<>();
filterAttributes.put("class", "solr.WordDelimiterGraphFilterFactory");
filterAttributes.put("preserveOriginal", "0");
analyzerDefinition.setFilters(Collections.singletonList(filterAttributes));
fieldTypeDefinition.setAnalyzer(analyzerDefinition);
SchemaRequest.AddFieldType addFieldTypeRequest =
new SchemaRequest.AddFieldType(fieldTypeDefinition);
SchemaResponse.UpdateResponse addFieldTypeResponse =
addFieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldTypeResponse);
SchemaResponse.FieldTypesResponse currentFieldTypesResponse =
fieldTypesRequest.process(getSolrClient());
assertEquals(0, currentFieldTypesResponse.getStatus());
List<FieldTypeRepresentation> currentFieldTypes = currentFieldTypesResponse.getFieldTypes();
assertEquals(initialFieldTypes.size() + 1, currentFieldTypes.size());
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
String fieldName = "accuracyField";
fieldAttributes.put("name", fieldName);
fieldAttributes.put("type", fieldTypeName);
SchemaRequest.AddField addFieldRequest = new SchemaRequest.AddField(fieldAttributes);
SchemaResponse.UpdateResponse addFieldResponse = addFieldRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldResponse);
Map<String, Object> dynamicFieldAttributes = new LinkedHashMap<>();
String dynamicFieldName = "*_accuracy";
dynamicFieldAttributes.put("name", dynamicFieldName);
dynamicFieldAttributes.put("type", fieldTypeName);
SchemaRequest.AddDynamicField addDynamicFieldRequest =
new SchemaRequest.AddDynamicField(dynamicFieldAttributes);
SchemaResponse.UpdateResponse addDynamicFieldResponse =
addDynamicFieldRequest.process(getSolrClient());
assertValidSchemaResponse(addDynamicFieldResponse);
SchemaRequest.FieldType fieldTypeRequest = new SchemaRequest.FieldType(fieldTypeName);
SchemaResponse.FieldTypeResponse newFieldTypeResponse =
fieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(newFieldTypeResponse);
FieldTypeRepresentation newFieldTypeRepresentation = newFieldTypeResponse.getFieldType();
assertThat(fieldTypeName, is(equalTo(newFieldTypeRepresentation.getAttributes().get("name"))));
assertThat(
"solr.TextField", is(equalTo(newFieldTypeRepresentation.getAttributes().get("class"))));
assertThat(
analyzerDefinition.getTokenizer().get("class"),
is(equalTo(newFieldTypeRepresentation.getAnalyzer().getTokenizer().get("class"))));
}
@Test
public void addFieldTypeWithSimilarityAccuracy() throws Exception {
FieldTypeDefinition fieldTypeDefinition = new FieldTypeDefinition();
Map<String, Object> fieldTypeAttributes = new LinkedHashMap<>();
String fieldTypeName = "fullClassNames";
fieldTypeAttributes.put("name", fieldTypeName);
fieldTypeAttributes.put("class", "org.apache.solr.schema.TextField");
fieldTypeDefinition.setAttributes(fieldTypeAttributes);
AnalyzerDefinition analyzerDefinition = new AnalyzerDefinition();
Map<String, Object> charFilterAttributes = new LinkedHashMap<>();
charFilterAttributes.put("class", "solr.PatternReplaceCharFilterFactory");
charFilterAttributes.put("replacement", "$1$1");
charFilterAttributes.put("pattern", "([a-zA-Z])\\\\1+");
analyzerDefinition.setCharFilters(Collections.singletonList(charFilterAttributes));
Map<String, Object> tokenizerAttributes = new LinkedHashMap<>();
tokenizerAttributes.put("class", "solr.WhitespaceTokenizerFactory");
analyzerDefinition.setTokenizer(tokenizerAttributes);
fieldTypeDefinition.setAnalyzer(analyzerDefinition);
Map<String, Object> similarityAttributes = new LinkedHashMap<>();
similarityAttributes.put("class", "org.apache.lucene.misc.SweetSpotSimilarity");
fieldTypeDefinition.setSimilarity(similarityAttributes);
SchemaRequest.AddFieldType addFieldTypeRequest =
new SchemaRequest.AddFieldType(fieldTypeDefinition);
SchemaResponse.UpdateResponse addFieldTypeResponse =
addFieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldTypeResponse);
// similarity is not shown by default for the fieldType
SchemaRequest.FieldType fieldTypeRequest = new SchemaRequest.FieldType(fieldTypeName);
SchemaResponse.FieldTypeResponse newFieldTypeResponse =
fieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(newFieldTypeResponse);
FieldTypeRepresentation newFieldTypeRepresentation = newFieldTypeResponse.getFieldType();
assertThat(fieldTypeName, is(equalTo(newFieldTypeRepresentation.getAttributes().get("name"))));
assertThat(
similarityAttributes.get("class"),
is(equalTo(newFieldTypeRepresentation.getSimilarity().get("class"))));
}
@Test
public void addFieldTypeWithAnalyzerClassAccuracy() throws Exception {
Map<String, Object> fieldTypeAttributes = new LinkedHashMap<>();
String fieldTypeName = "nameText";
fieldTypeAttributes.put("name", fieldTypeName);
fieldTypeAttributes.put("class", "solr.TextField");
FieldTypeDefinition fieldTypeDefinition = new FieldTypeDefinition();
fieldTypeDefinition.setAttributes(fieldTypeAttributes);
Map<String, Object> analyzerAttributes = new LinkedHashMap<>();
analyzerAttributes.put("class", "org.apache.lucene.analysis.core.WhitespaceAnalyzer");
analyzerAttributes.put("luceneMatchVersion", "5.0.0");
AnalyzerDefinition analyzerDefinition = new AnalyzerDefinition();
analyzerDefinition.setAttributes(analyzerAttributes);
fieldTypeDefinition.setAnalyzer(analyzerDefinition);
SchemaRequest.AddFieldType addFieldTypeRequest =
new SchemaRequest.AddFieldType(fieldTypeDefinition);
SchemaResponse.UpdateResponse addFieldTypeResponse =
addFieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldTypeResponse);
SchemaRequest.FieldType fieldTypeRequest = new SchemaRequest.FieldType(fieldTypeName);
SchemaResponse.FieldTypeResponse newFieldTypeResponse =
fieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(newFieldTypeResponse);
FieldTypeRepresentation newFieldTypeRepresentation = newFieldTypeResponse.getFieldType();
assertThat(fieldTypeName, is(equalTo(newFieldTypeRepresentation.getAttributes().get("name"))));
assertThat(
analyzerAttributes.get("class"),
is(equalTo(newFieldTypeRepresentation.getAnalyzer().getAttributes().get("class"))));
}
@Test
public void addFieldTypeShouldntBeCalledTwiceWithTheSameName() throws Exception {
Map<String, Object> fieldTypeAttributes = new LinkedHashMap<>();
String fieldName = "failureInt";
fieldTypeAttributes.put("name", fieldName);
fieldTypeAttributes.put("class", RANDOMIZED_NUMERIC_FIELDTYPES.get(Integer.class));
fieldTypeAttributes.put("omitNorms", true);
fieldTypeAttributes.put("positionIncrementGap", 0);
FieldTypeDefinition fieldTypeDefinition = new FieldTypeDefinition();
fieldTypeDefinition.setAttributes(fieldTypeAttributes);
SchemaRequest.AddFieldType addFieldTypeRequest =
new SchemaRequest.AddFieldType(fieldTypeDefinition);
SchemaResponse.UpdateResponse addFieldTypeFirstResponse =
addFieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldTypeFirstResponse);
assertFailedSchemaResponse(
() -> addFieldTypeRequest.process(getSolrClient()),
"Field type '" + fieldName + "' already exists.");
}
@Test
public void testDeleteFieldTypeAccuracy() throws Exception {
Map<String, Object> fieldTypeAttributes = new LinkedHashMap<>();
String fieldTypeName = "delInt";
fieldTypeAttributes.put("name", fieldTypeName);
fieldTypeAttributes.put("class", RANDOMIZED_NUMERIC_FIELDTYPES.get(Integer.class));
fieldTypeAttributes.put("omitNorms", true);
fieldTypeAttributes.put("positionIncrementGap", 0);
FieldTypeDefinition fieldTypeDefinition = new FieldTypeDefinition();
fieldTypeDefinition.setAttributes(fieldTypeAttributes);
SchemaRequest.AddFieldType addFieldTypeRequest =
new SchemaRequest.AddFieldType(fieldTypeDefinition);
SolrClient c = getSolrClient();
SchemaResponse.UpdateResponse addFieldTypeResponse = addFieldTypeRequest.process(c);
assertValidSchemaResponse(addFieldTypeResponse);
SchemaRequest.FieldType fieldTypeRequest = new SchemaRequest.FieldType(fieldTypeName);
SchemaResponse.FieldTypeResponse initialFieldTypeResponse =
fieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(initialFieldTypeResponse);
FieldTypeRepresentation responseFieldTypeRepresentation =
initialFieldTypeResponse.getFieldType();
assertThat(
fieldTypeName, is(equalTo(responseFieldTypeRepresentation.getAttributes().get("name"))));
SchemaRequest.DeleteFieldType deleteFieldTypeRequest =
new SchemaRequest.DeleteFieldType(fieldTypeName);
SchemaResponse.UpdateResponse deleteFieldTypeResponse =
deleteFieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(deleteFieldTypeResponse);
try {
fieldTypeRequest.process(getSolrClient());
fail(
String.format(
Locale.ROOT,
"after removal, the field type %s shouldn't be anymore available over Schema API",
fieldTypeName));
} catch (SolrException e) {
// success
}
}
@Test
public void deletingAFieldTypeThatDoesntExistInTheSchemaShouldFail() throws Exception {
String fieldType = "fieldTypeToBeDeleted";
SchemaRequest.DeleteFieldType deleteFieldTypeRequest =
new SchemaRequest.DeleteFieldType(fieldType);
assertFailedSchemaResponse(
() -> deleteFieldTypeRequest.process(getSolrClient()),
"The field type '"
+ fieldType
+ "' is not present in this schema, and so cannot be deleted.");
}
@Test
public void testReplaceFieldTypeAccuracy() throws Exception {
// a fixed value for comparison after update, be contraian from the randomized 'default'
final boolean useDv = Boolean.getBoolean(NUMERIC_DOCVALUES_SYSPROP);
// Given
Map<String, Object> fieldTypeAttributes = new LinkedHashMap<>();
String fieldTypeName = "replaceInt";
fieldTypeAttributes.put("name", fieldTypeName);
fieldTypeAttributes.put("class", RANDOMIZED_NUMERIC_FIELDTYPES.get(Integer.class));
fieldTypeAttributes.put("docValues", useDv);
fieldTypeAttributes.put("omitNorms", true);
fieldTypeAttributes.put("positionIncrementGap", 0);
FieldTypeDefinition fieldTypeDefinition = new FieldTypeDefinition();
fieldTypeDefinition.setAttributes(fieldTypeAttributes);
SchemaRequest.AddFieldType addFieldTypeRequest =
new SchemaRequest.AddFieldType(fieldTypeDefinition);
SchemaResponse.UpdateResponse addFieldTypeResponse =
addFieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(addFieldTypeResponse);
// When : update the field definition
fieldTypeAttributes.put("positionIncrementGap", 42);
fieldTypeAttributes.put("omitNorms", false);
FieldTypeDefinition replaceFieldTypeDefinition = new FieldTypeDefinition();
replaceFieldTypeDefinition.setAttributes(fieldTypeAttributes);
SchemaRequest.ReplaceFieldType replaceFieldTypeRequest =
new SchemaRequest.ReplaceFieldType(replaceFieldTypeDefinition);
SchemaResponse.UpdateResponse replaceFieldTypeResponse =
replaceFieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(replaceFieldTypeResponse);
// Then
SchemaRequest.FieldType fieldTypeRequest = new SchemaRequest.FieldType(fieldTypeName);
SchemaResponse.FieldTypeResponse newFieldTypeResponse =
fieldTypeRequest.process(getSolrClient());
assertValidSchemaResponse(newFieldTypeResponse);
FieldTypeRepresentation replacedFieldTypeRepresentation = newFieldTypeResponse.getFieldType();
Map<String, Object> replacedFieldTypeAttributes =
replacedFieldTypeRepresentation.getAttributes();
assertThat(fieldTypeName, is(equalTo(replacedFieldTypeAttributes.get("name"))));
assertThat(
RANDOMIZED_NUMERIC_FIELDTYPES.get(Integer.class),
is(equalTo(replacedFieldTypeAttributes.get("class"))));
assertThat(false, is(equalTo(replacedFieldTypeAttributes.get("omitNorms"))));
assertThat("42", is(equalTo(replacedFieldTypeAttributes.get("positionIncrementGap"))));
// should be unchanged...
assertThat(useDv, is(equalTo(replacedFieldTypeAttributes.get("docValues"))));
}
@Test
public void testCopyFieldAccuracy() throws Exception {
SchemaRequest.CopyFields copyFieldsSchemaRequest = new SchemaRequest.CopyFields();
SchemaResponse.CopyFieldsResponse initialCopyFieldsResponse =
copyFieldsSchemaRequest.process(getSolrClient());
List<Map<String, Object>> initialCopyFieldsAttributes =
initialCopyFieldsResponse.getCopyFields();
String srcFieldName = "copyfield";
String destFieldName1 = "destField1", destFieldName2 = "destField2";
createStoredStringField(srcFieldName, getSolrClient());
createStoredStringField(destFieldName1, getSolrClient());
createStoredStringField(destFieldName2, getSolrClient());
SchemaRequest.AddCopyField addCopyFieldRequest =
new SchemaRequest.AddCopyField(srcFieldName, Arrays.asList(destFieldName1, destFieldName2));
SchemaResponse.UpdateResponse addCopyFieldResponse =
addCopyFieldRequest.process(getSolrClient());
assertValidSchemaResponse(addCopyFieldResponse);
SchemaResponse.CopyFieldsResponse currentCopyFieldsResponse =
copyFieldsSchemaRequest.process(getSolrClient());
List<Map<String, Object>> currentCopyFields = currentCopyFieldsResponse.getCopyFields();
assertEquals(initialCopyFieldsAttributes.size() + 2, currentCopyFields.size());
}
@Test
public void testCopyFieldWithMaxCharsAccuracy() throws Exception {
SchemaRequest.CopyFields copyFieldsSchemaRequest = new SchemaRequest.CopyFields();
SchemaResponse.CopyFieldsResponse initialCopyFieldsResponse =
copyFieldsSchemaRequest.process(getSolrClient());
List<Map<String, Object>> initialCopyFieldsAttributes =
initialCopyFieldsResponse.getCopyFields();
String srcFieldName = "copyfield";
String destFieldName1 = "destField1", destFieldName2 = "destField2";
createStoredStringField(srcFieldName, getSolrClient());
createStoredStringField(destFieldName1, getSolrClient());
createStoredStringField(destFieldName2, getSolrClient());
Integer maxChars = 200;
SchemaRequest.AddCopyField addCopyFieldRequest =
new SchemaRequest.AddCopyField(
srcFieldName, Arrays.asList(destFieldName1, destFieldName2), maxChars);
SchemaResponse.UpdateResponse addCopyFieldResponse =
addCopyFieldRequest.process(getSolrClient());
assertValidSchemaResponse(addCopyFieldResponse);
SchemaResponse.CopyFieldsResponse currentCopyFieldsResponse =
copyFieldsSchemaRequest.process(getSolrClient());
List<Map<String, Object>> currentCopyFields = currentCopyFieldsResponse.getCopyFields();
assertEquals(initialCopyFieldsAttributes.size() + 2, currentCopyFields.size());
for (Map<String, Object> currentCopyField : currentCopyFields) {
if (srcFieldName.equals(currentCopyField.get("source"))) {
String currentDestFieldName = (String) currentCopyField.get("dest");
int currentMaxChars = (Integer) currentCopyField.get("maxChars");
assertThat(
currentDestFieldName, anyOf(is(equalTo(destFieldName1)), is(equalTo(destFieldName2))));
assertTrue(maxChars == currentMaxChars);
}
}
}
@Test
public void copyFieldsShouldFailWhenOneOfTheFieldsDoesntExistInTheSchema() throws Exception {
String srcFieldName = "srcnotexist";
String destFieldName1 = "destNotExist1", destFieldName2 = "destNotExist2";
SchemaRequest.AddCopyField addCopyFieldRequest =
new SchemaRequest.AddCopyField(srcFieldName, Arrays.asList(destFieldName1, destFieldName2));
assertFailedSchemaResponse(
() -> addCopyFieldRequest.process(getSolrClient()),
"copyField source :'"
+ srcFieldName
+ "' is not a glob and doesn't match any explicit field or dynamicField.");
}
@Test
public void testDeleteCopyFieldAccuracy() throws Exception {
String srcFieldName = "copyfield";
String destFieldName1 = "destField1", destFieldName2 = "destField2";
createStoredStringField(srcFieldName, getSolrClient());
createStoredStringField(destFieldName1, getSolrClient());
createStoredStringField(destFieldName2, getSolrClient());
SchemaRequest.AddCopyField addCopyFieldRequest =
new SchemaRequest.AddCopyField(srcFieldName, Arrays.asList(destFieldName1, destFieldName2));
SchemaResponse.UpdateResponse addCopyFieldResponse =
addCopyFieldRequest.process(getSolrClient());
System.out.println(addCopyFieldResponse);
assertValidSchemaResponse(addCopyFieldResponse);
SchemaRequest.DeleteCopyField deleteCopyFieldRequest1 =
new SchemaRequest.DeleteCopyField(srcFieldName, Arrays.asList(destFieldName1));
assertValidSchemaResponse(deleteCopyFieldRequest1.process(getSolrClient()));
SchemaRequest.DeleteCopyField deleteCopyFieldRequest2 =
new SchemaRequest.DeleteCopyField(srcFieldName, Arrays.asList(destFieldName2));
assertValidSchemaResponse(deleteCopyFieldRequest2.process(getSolrClient()));
}
@Test
public void deleteCopyFieldShouldFailWhenOneOfTheFieldsDoesntExistInTheSchema() throws Exception {
String srcFieldName = "copyfield";
String destFieldName1 = "destField1", destFieldName2 = "destField2";
SchemaRequest.DeleteCopyField deleteCopyFieldsRequest =
new SchemaRequest.DeleteCopyField(
srcFieldName, Arrays.asList(destFieldName1, destFieldName2));
assertFailedSchemaResponse(
() -> deleteCopyFieldsRequest.process(getSolrClient()),
"Copy field directive not found: '" + srcFieldName + "' -> '" + destFieldName1 + "'");
}
@Test
public void testMultipleUpdateRequestAccuracy() throws Exception {
String fieldTypeName = "accuracyTextField";
SchemaRequest.AddFieldType addFieldTypeRequest = createFieldTypeRequest(fieldTypeName);
String field1Name = "accuracyField1";
String field2Name = "accuracyField2";
Map<String, Object> fieldAttributes = new LinkedHashMap<>();
fieldAttributes.put("name", field1Name);
fieldAttributes.put("type", fieldTypeName);
fieldAttributes.put("stored", true);
fieldAttributes.put("indexed", true);
SchemaRequest.AddField addFieldName1Request = new SchemaRequest.AddField(fieldAttributes);
fieldAttributes.put("name", field2Name);
SchemaRequest.AddField addFieldName2Request = new SchemaRequest.AddField(fieldAttributes);
List<SchemaRequest.Update> list = new ArrayList<>(3);
list.add(addFieldTypeRequest);
list.add(addFieldName1Request);
list.add(addFieldName2Request);
SchemaRequest.MultiUpdate multiUpdateRequest = new SchemaRequest.MultiUpdate(list);
SchemaResponse.UpdateResponse multipleUpdatesResponse =
multiUpdateRequest.process(getSolrClient());
assertValidSchemaResponse(multipleUpdatesResponse);
SchemaRequest.FieldType fieldTypeSchemaRequest = new SchemaRequest.FieldType(fieldTypeName);
SchemaResponse.FieldTypeResponse fieldTypeResponse =
fieldTypeSchemaRequest.process(getSolrClient());
assertValidSchemaResponse(fieldTypeResponse);
FieldTypeRepresentation fieldTypeRepresentation = fieldTypeResponse.getFieldType();
assertThat(fieldTypeName, is(equalTo(fieldTypeRepresentation.getAttributes().get("name"))));
SchemaRequest.Field field1SchemaRequest = new SchemaRequest.Field(field1Name);
SchemaResponse.FieldResponse field1Response = field1SchemaRequest.process(getSolrClient());
assertValidSchemaResponse(field1Response);
Map<String, ?> field1Attributes = field1Response.getField();
assertThat(field1Name, is(equalTo(field1Attributes.get("name"))));
assertThat(fieldTypeName, is(equalTo(field1Attributes.get("type"))));
assertThat(true, is(equalTo(field1Attributes.get("stored"))));
assertThat(true, is(equalTo(field1Attributes.get("indexed"))));
SchemaRequest.Field field2SchemaRequest = new SchemaRequest.Field(field1Name);
SchemaResponse.FieldResponse field2Response = field2SchemaRequest.process(getSolrClient());
assertValidSchemaResponse(field2Response);
Map<String, ?> field2Attributes = field2Response.getField();
assertThat(field1Name, is(equalTo(field2Attributes.get("name"))));
assertThat(fieldTypeName, is(equalTo(field2Attributes.get("type"))));
assertThat(true, is(equalTo(field2Attributes.get("stored"))));
assertThat(true, is(equalTo(field2Attributes.get("indexed"))));
}
}
|
apache/solr
|
solr/solrj/src/test/org/apache/solr/client/solrj/request/SchemaTest.java
|
Java
|
apache-2.0
| 47,536 |
define([], function() {
function initGui() {
PaintApp.elements.airButton = document.getElementById('air-button');
PaintApp.paletteModesButtons.push(PaintApp.elements.airButton)
PaintApp.elements.airButton.addEventListener("click", function() {
PaintApp.paletteRemoveActiveClass();
PaintApp.addActiveClassToElement(PaintApp.elements.airButton);
PaintApp.switchMode("AirBrush");
});
}
var clientX, clientY, timeout;
var density = 50;
function getRandomInt(min, max) {
return Math.floor(Math.random() * (max - min + 1)) + min;
}
var AirBrush = {
initGui: initGui,
point: undefined,
onMouseDown: function(event) {
PaintApp.modes.AirBrush.point = event.point;
var ctx = PaintApp.elements.canvas.getContext("2d");
clientX = event.point.x;
clientY = event.point.y;
ctx.lineJoin = ctx.lineCap = 'round';
ctx.fillStyle = PaintApp.data.color.fill;
timeout = setTimeout(function draw() {
for (var i = density; i--; ) {
var radius = 30;
var offsetX = getRandomInt(-radius, radius);
var offsetY = getRandomInt(-radius, radius);
ctx.fillRect(clientX + offsetX, clientY + offsetY, PaintApp.data.size/6, PaintApp.data.size/6);
}
if (!timeout) return;
timeout = setTimeout(draw, 50);
}, 50);
},
onMouseDrag: function(event) {
if (!PaintApp.modes.AirBrush.point) {
return;
}
var ctx = PaintApp.elements.canvas.getContext("2d");
clientX = event.point.x;
clientY = event.point.y;
PaintApp.modes.AirBrush.point = event.point;
},
onMouseUp: function(event) {
PaintApp.saveCanvas();
clearTimeout(timeout);
}
}
return AirBrush;
})
|
SnehaMohanty/SnehaMohanty.github.io
|
js/modes/modes-air.js
|
JavaScript
|
apache-2.0
| 1,720 |
/*
* Copyright 2014 Splunk, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License"): you may
* not use this file except in compliance with the License. You may obtain
* a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations
* under the License.
*/
namespace Splunk.ModularInputs
{
using System.Xml.Serialization;
/// <summary>
/// Base class for input definition.
/// </summary>
[XmlRoot("input")]
public class InputDefinitionBase
{
/// <summary>
/// The hostname for the Splunk server that runs the modular input.
/// </summary>
[XmlElement("server_host")]
public string ServerHost { get; set; }
/// <summary>
/// The management URI for the Splunk server, identified by host, port,
/// and protocol.
/// </summary>
[XmlElement("server_uri")]
public string ServerUri { get; set; }
/// <summary>
/// The directory used for a modular input to save checkpoints.
/// </summary>
/// <remarks>
/// <para>
/// This location is where Splunk tracks the input state from sources
/// it is reading from.
/// </para>
/// </remarks>
[XmlElement("checkpoint_dir")]
public string CheckpointDirectory { get; set; }
/// <summary>
/// The REST API session key for this modular input.
/// </summary>
[XmlElement("session_key")]
public string SessionKey { get; set; }
}
}
|
paulcbetts/splunk-sdk-csharp-pcl
|
src/Splunk.ModularInputs/Splunk/ModularInputs/InputDefinitionBase.cs
|
C#
|
apache-2.0
| 1,858 |
/* config.h. Generated from config.h.in by configure. */
/* config.h.in. Generated from configure.in by autoheader. */
/* Define to 1 if you have the <arpa/inet.h> header file. */
#define HAVE_ARPA_INET_H 1
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define to 1 if you have the `fork' function. */
#define HAVE_FORK 1
/* Define to 1 if you have the `gethostbyname' function. */
#define HAVE_GETHOSTBYNAME 1
/* Define to 1 if you have the <inttypes.h> header file. */
#define HAVE_INTTYPES_H 1
/* Define to 1 if your system has a GNU libc compatible `malloc' function, and
to 0 otherwise. */
#define HAVE_MALLOC 1
/* Define to 1 if you have the `memmove' function. */
#define HAVE_MEMMOVE 1
/* Define to 1 if you have the <memory.h> header file. */
#define HAVE_MEMORY_H 1
/* Define to 1 if you have the `memset' function. */
#define HAVE_MEMSET 1
/* Define to 1 if you have the <netdb.h> header file. */
#define HAVE_NETDB_H 1
/* Define to 1 if you have the <netinet/in.h> header file. */
#define HAVE_NETINET_IN_H 1
/* Define to 1 if your system has a GNU libc compatible `realloc' function,
and to 0 otherwise. */
#define HAVE_REALLOC 1
/* Define to 1 if you have the `socket' function. */
#define HAVE_SOCKET 1
/* Define to 1 if stdbool.h conforms to C99. */
#define HAVE_STDBOOL_H 1
/* Define to 1 if you have the <stdint.h> header file. */
#define HAVE_STDINT_H 1
/* Define to 1 if you have the <stdlib.h> header file. */
#define HAVE_STDLIB_H 1
/* Define to 1 if you have the `strcasecmp' function. */
#define HAVE_STRCASECMP 1
/* Define to 1 if you have the `strdup' function. */
#define HAVE_STRDUP 1
/* Define to 1 if you have the <strings.h> header file. */
#define HAVE_STRINGS_H 1
/* Define to 1 if you have the <string.h> header file. */
#define HAVE_STRING_H 1
/* Define to 1 if you have the `strtoul' function. */
#define HAVE_STRTOUL 1
/* Define to 1 if you have the <sys/socket.h> header file. */
#define HAVE_SYS_SOCKET_H 1
/* Define to 1 if you have the <sys/stat.h> header file. */
#define HAVE_SYS_STAT_H 1
/* Define to 1 if you have the <sys/types.h> header file. */
#define HAVE_SYS_TYPES_H 1
/* Define to 1 if you have the <unistd.h> header file. */
#define HAVE_UNISTD_H 1
/* Define to 1 if you have the `vfork' function. */
#define HAVE_VFORK 1
/* Define to 1 if you have the <vfork.h> header file. */
/* #undef HAVE_VFORK_H */
/* Define to 1 if you have the <vmci/vmci_sockets.h> header file. */
/* #undef HAVE_VMCI_VMCI_SOCKETS_H */
/* Define to 1 if `fork' works. */
#define HAVE_WORKING_FORK 1
/* Define to 1 if `vfork' works. */
#define HAVE_WORKING_VFORK 1
/* Define to 1 if the system has the type `_Bool'. */
#define HAVE__BOOL 1
/* Define to the sub-directory in which libtool stores uninstalled libraries.
*/
#define LT_OBJDIR ".libs/"
/* Name of package */
#define PACKAGE "gvirtus-cublas"
/* Define to the address where bug reports for this package should be sent. */
#define PACKAGE_BUGREPORT "http://osl.uniparthenope.it/mailman/listinfo/gvirtus-devel"
/* Define to the full name of this package. */
#define PACKAGE_NAME "gvirtus-cublas"
/* Define to the full name and version of this package. */
#define PACKAGE_STRING "gvirtus-cublas 01-beta2"
/* Define to the one symbol short name of this package. */
#define PACKAGE_TARNAME "gvirtus-cublas"
/* Define to the home page for this package. */
#define PACKAGE_URL ""
/* Define to the version of this package. */
#define PACKAGE_VERSION "01-beta2"
/* Define to 1 if you have the ANSI C header files. */
#define STDC_HEADERS 1
/* Version number of package */
#define VERSION "01-beta2"
/* Define for Solaris 2.5.1 so the uint32_t typedef from <sys/synch.h>,
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
#define below would cause a syntax error. */
/* #undef _UINT32_T */
/* Define to `__inline__' or `__inline' if that's what the C compiler
calls it, or to nothing if 'inline' is not supported under any name. */
#ifndef __cplusplus
/* #undef inline */
#endif
/* Define to rpl_malloc if the replacement function should be used. */
/* #undef malloc */
/* Define to `int' if <sys/types.h> does not define. */
/* #undef pid_t */
/* Define to rpl_realloc if the replacement function should be used. */
/* #undef realloc */
/* Define to `unsigned int' if <sys/types.h> does not define. */
/* #undef size_t */
/* Define to the type of an unsigned integer type of width exactly 32 bits if
such a type exists and the standard includes do not define it. */
/* #undef uint32_t */
/* Define as `fork' if `vfork' does not work. */
/* #undef vfork */
|
raffmont/GVirtuS
|
gvirtus.curand/config.h
|
C
|
apache-2.0
| 4,753 |
<!DOCTYPE html>
<!--[if lt IE 7]> <html class="no-js lt-ie9 lt-ie8 lt-ie7"> <![endif]-->
<!--[if IE 7]> <html class="no-js lt-ie9 lt-ie8"> <![endif]-->
<!--[if IE 8]> <html class="no-js lt-ie9"> <![endif]-->
<!--[if gt IE 8]><!--> <html class="no-js"> <!--<![endif]-->
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
{exp:seo_lite use_last_segment="y" default_title="No Deposit Home Loans - {site_name}"}
<meta name="viewport" content="width=device-width, initial-scale=1">
<link rel="shortcut icon" href="{assets}/img/icons/favicon.ico" type="image/x-icon">
<link rel="apple-touch-icon" href="{assets}/img/mobile_icons/apple-touch-icon.png">
<link rel="stylesheet" href="{assets}/css/normalize.css">
<link rel="stylesheet" href="{assets}/css/fonts.css">
<link rel="stylesheet" href="{assets}/css/slick.css">
<link rel="stylesheet" href="{assets}/css/landing.css">
<script src="{assets}/js/vendor/modernizr-2.6.2-respond-1.1.0.min.js"></script>
</head>
<body id="banksia">
<header id="header">
<div class="container">
{if last_segment == 'thank-you'}
<!-- <h1>Thanks!</h1> -->
{if:else}
<h1><span class="green">Brand New Homes</span> Available Now</h1>
{/if}
<a id="logo" href="{site_url}"><img src="{assets}/img/home-logo.png" alt="HomeStart" /></a>
</div>
</header>
<div id="wrapper">
{if last_segment == 'thank-you'}
<div class="container">
<h2>Thank you for contacting HomeStart!</h2>
<p>One of our consultants will get in touch with you within 24 hours.</p>
<a href="tel:+61892314567" class="button blue">Call HomeStart</a>
<a href="{site_url}" class="button green">Go to website</a>
</div>
{if:else}
<div id="start">
<div id="slider">
<div><img src="{assets}/img/banksia/023.jpg" alt="" /></div>
<div><img src="{assets}/img/banksia/021.jpg" alt="" /></div>
<div><img src="{assets}/img/banksia/007.jpg" alt="" /></div>
<div><img src="{assets}/img/banksia/013.jpg" alt="" /></div>
<div><img src="{assets}/img/banksia/018.jpg" alt="" /></div>
</div>
<div class="container">
<h2><span style="font-size:1.2em;">Brand New Homes Available Now!</span><br /><span class="green">Full turnkey packages ready to move into today starting from only $418k.</span></h2>
<p>Banksia Grove is a master planned community only 15 minutes from Burns Beach and 10 minutes from Joondalup. HomeStart has completed several amazing homes in this lovely area that you could move into today.</p>
<p>With finishes and specifications second to none, these lovely houses were designed with stunning modern decor. Your brand new home comes fully finished with wall paint, tiled living areas, carpeted bedrooms, stainless steel kitchen appliances and fully reticulated landscaping.</p>
<p>First-class features include:</p>
<ul>
<li>3 bedrooms plus a study or 4th bedroom</li>
<li>Contemporary elevation</li>
<li>Skillion, Colorbond roof</li>
<li>Tiled living areas & window treatments throughout home</li>
<li>Stainless steel European appliances</li>
<li>Paved generous size alfresco</li>
<li>High ceilings</li>
<li>Double garage</li>
<li>Fully landscaped with reticulation</li>
</ul>
<br/>
<p><strong>Don't miss this opportunity, register your interest now to be among the first in line for one of these amazing homes.</strong></p>
</div>
</div>
<div id="form">
<div class="container">
<h2>Register your interest</h2>
<p>Simply fill out the form below and our consultant will be in contact within 24 hours.</p>
{exp:freeform:form form_name="banksia_grove_interest" inline_errors="yes" return="banksia-grove/thank-you"}
<div>
{freeform:field:name attr:placeholder="Name" attr:required="required"}
{if freeform:error:name}<span class="error">{freeform:error:name}</span>{/if}
</div>
<div>
{freeform:field:email attr:type="email" attr:placeholder="Email Address" attr:required="required"}
{if freeform:error:email}<span class="error">{freeform:error:email}</span>{/if}
</div>
<div>
{freeform:field:phone attr:type="tel" attr:placeholder="Phone Number" attr:required="required" attr:pattern="[0-9]{8,12}" attr:minlength="8" attr:minlength="12"}
{if freeform:error:phone}<span class="error">{freeform:error:phone}</span>{/if}
</div>
<div>
{freeform:field:enquiry attr:placeholder="Comment"}
{if freeform:error:enquiry}<span class="error">{freeform:error:enquiry}</span>{/if}
</div>
<div>
<label>{freeform:label:first_buyer}</label>
{freeform:field:first_buyer}
{if freeform:error:first_buyer}<span class="error">{freeform:error:first_buyer}</span>{/if}
</div>
<div>
<button type="submit" name="submit" value="submit" class="green">Send</button>
</div>
{/exp:freeform:form}
</div>
</div>
<!-- <div id="buttons" class="clearfix">
<a href="#" class="button green form">Register</a>
<a href="tel:+61892314567" class="button blue">Call HomeStart</a>
</div> -->
{/if}
</div>
<script src="//ajax.googleapis.com/ajax/libs/jquery/1.11.1/jquery.min.js"></script>
<script src="http://ajax.aspnetcdn.com/ajax/jquery.validate/1.13.0/jquery.validate.min.js"></script>
<script src="{assets}/js/vendor/slick.min.js"></script>
<script>
$(function(){$('#slider').slick({adaptiveHeight:false,arrows:false,autoplay:true,autoplaySpeed:3000,dots:false,infinite:true,lazyLoad:'ondemand',slidesToShow:1,speed:800});$('a.form').click(function(e){e.preventDefault();$('#start').fadeOut(function(){$('#form').fadeIn();});});
$('input[type=radio]').attr('required','required');
$.validator.addMethod('tel',function(v,e){
return this.optional(e)||/[0-9]{8,12}/.test(v);
},'Must be between 8 and 12 digits');
$('form').validate({rules:{phone:{tel:true}},
errorPlacement:function(error,element){
element.before(error);
}
});
});
</script>
<script>
(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
})(window,document,'script','//www.google-analytics.com/analytics.js','ga');
ga('create', 'UA-9954473-1', 'auto');
ga('send', 'pageview');
</script>
</body>
</html>
|
AusQB/HomeStart
|
Web/www/public_html/template/default_site_old/available-now.group/index.html
|
HTML
|
apache-2.0
| 6,697 |
/*
// Licensed to DynamoBI Corporation (DynamoBI) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. DynamoBI licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
*/
package org.eigenbase.util;
import java.util.*;
/**
* StringRepresentationComparator compares two objects by comparing their {@link
* Object#toString()} representations.
*
* @author John V. Sichi
* @version $Id$
*/
public class StringRepresentationComparator<T>
implements Comparator<T>
{
//~ Methods ----------------------------------------------------------------
// implement Comparator
public int compare(T o1, T o2)
{
return o1.toString().compareTo(o2.toString());
}
// implement Comparator
public boolean equals(Object obj)
{
return obj.getClass().getName().equals(getClass().getName());
}
public int hashCode()
{
return getClass().getName().hashCode();
}
}
// End StringRepresentationComparator.java
|
LucidDB/luciddb
|
farrago/src/org/eigenbase/util/StringRepresentationComparator.java
|
Java
|
apache-2.0
| 1,595 |
<!DOCTYPE html>
<html lang="en">
<head>
<title>ClaimResult Struct Reference</title>
<link rel="stylesheet" type="text/css" href="../css/jazzy.css" />
<link rel="stylesheet" type="text/css" href="../css/highlight.css" />
<meta charset='utf-8'>
<script src="../js/jquery.min.js" defer></script>
<script src="../js/jazzy.js" defer></script>
</head>
<body>
<a name="//apple_ref/swift/Struct/ClaimResult" class="dashAnchor"></a>
<a title="ClaimResult Struct Reference"></a>
<header>
<div class="content-wrapper">
<p><a href="../index.html"> Docs</a> (75% documented)</p>
<p class="header-right"><a href="https://github.com/vakoc/particle-swift"><img src="../img/gh.png"/>View on GitHub</a></p>
</div>
</header>
<div class="content-wrapper">
<p id="breadcrumbs">
<a href="../index.html"> Reference</a>
<img id="carat" src="../img/carat.png" />
ClaimResult Struct Reference
</p>
</div>
<div class="content-wrapper">
<nav class="sidebar">
<ul class="nav-groups">
<li class="nav-group-name">
<a href="../Classes.html">Classes</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Classes/EventSource.html">EventSource</a>
</li>
<li class="nav-group-task">
<a href="../Classes/EventSource/Event.html">– Event</a>
</li>
<li class="nav-group-task">
<a href="../Classes/EventSource/State.html">– State</a>
</li>
<li class="nav-group-task">
<a href="../Classes/EventSource/Config.html">– Config</a>
</li>
<li class="nav-group-task">
<a href="../Classes/ParticleCloud.html">ParticleCloud</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Global Variables.html">Global Variables</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Global Variables.html#/s:v13ParticleSwift14globalLogLevelOS_8LogLevel">globalLogLevel</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Enums.html">Enums</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Enums/BuildResult.html">BuildResult</a>
</li>
<li class="nav-group-task">
<a href="../Enums/LogLevel.html">LogLevel</a>
</li>
<li class="nav-group-task">
<a href="../Enums/ParticleError.html">ParticleError</a>
</li>
<li class="nav-group-task">
<a href="../Enums/Result.html">Result</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Extensions.html">Extensions</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Extensions/Array.html">Array</a>
</li>
<li class="nav-group-task">
<a href="../Extensions/Date.html">Date</a>
</li>
<li class="nav-group-task">
<a href="../Extensions/Dictionary.html">Dictionary</a>
</li>
<li class="nav-group-task">
<a href="../Extensions/Notification.html">Notification</a>
</li>
<li class="nav-group-task">
<a href="../Extensions/ParticleError.html">ParticleError</a>
</li>
<li class="nav-group-task">
<a href="../Extensions/UUID.html">UUID</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Functions.html">Functions</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Functions.html#/s:F13ParticleSwiftoi2eeFTVS_11ClaimResultS0__Sb">==(_:_:)</a>
</li>
<li class="nav-group-task">
<a href="../Functions.html#/s:F13ParticleSwiftoi2eeFTVS_17DeviceInformationS0__Sb">==(_:_:)</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Protocols.html">Protocols</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Protocols/EventSourceDelegate.html">EventSourceDelegate</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/OAuthAuthenticatable.html">OAuthAuthenticatable</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/SecureStorage.html">SecureStorage</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/StringKeyedDictionaryConvertible.html">StringKeyedDictionaryConvertible</a>
</li>
<li class="nav-group-task">
<a href="../Protocols/WebServiceCallable.html">WebServiceCallable</a>
</li>
</ul>
</li>
<li class="nav-group-name">
<a href="../Structs.html">Structs</a>
<ul class="nav-group-tasks">
<li class="nav-group-task">
<a href="../Structs/BinaryInfo.html">BinaryInfo</a>
</li>
<li class="nav-group-task">
<a href="../Structs/BinaryInfo/Size.html">– Size</a>
</li>
<li class="nav-group-task">
<a href="../Structs/BuildIssue.html">BuildIssue</a>
</li>
<li class="nav-group-task">
<a href="../Structs/BuildIssue/IssueType.html">– IssueType</a>
</li>
<li class="nav-group-task">
<a href="../Structs/ClaimResult.html">ClaimResult</a>
</li>
<li class="nav-group-task">
<a href="../Structs/DeviceDetailInformation.html">DeviceDetailInformation</a>
</li>
<li class="nav-group-task">
<a href="../Structs/DeviceInformation.html">DeviceInformation</a>
</li>
<li class="nav-group-task">
<a href="../Structs/DeviceInformation/Product.html">– Product</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Library.html">Library</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Library/Scope.html">– Scope</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Library/Sort.html">– Sort</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Library/SortOrder.html">– SortOrder</a>
</li>
<li class="nav-group-task">
<a href="../Structs/OAuthToken.html">OAuthToken</a>
</li>
<li class="nav-group-task">
<a href="../Structs/OAuthTokenListEntry.html">OAuthTokenListEntry</a>
</li>
<li class="nav-group-task">
<a href="../Structs/ParticleSwiftInfo.html">ParticleSwiftInfo</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Product.html">Product</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Product/ProductType.html">– ProductType</a>
</li>
<li class="nav-group-task">
<a href="../Structs/ProductTeamInvitation.html">ProductTeamInvitation</a>
</li>
<li class="nav-group-task">
<a href="../Structs/ProductTeamInvitation/Invite.html">– Invite</a>
</li>
<li class="nav-group-task">
<a href="../Structs/ProductTeamMember.html">ProductTeamMember</a>
</li>
<li class="nav-group-task">
<a href="../Structs/SourceFile.html">SourceFile</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Webhook.html">Webhook</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Webhook/RequestType.html">– RequestType</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Webhook/Counter.html">– Counter</a>
</li>
<li class="nav-group-task">
<a href="../Structs/Webhook/Log.html">– Log</a>
</li>
</ul>
</li>
</ul>
</nav>
<article class="main-content">
<section>
<section class="section">
<h1>ClaimResult</h1>
<div class="declaration">
<div class="language">
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">struct</span> <span class="kt">ClaimResult</span></code></pre>
</div>
</div>
<p>The result of the claim cloud method</p>
</section>
<section class="section task-group-section">
<div class="task-group">
<ul>
<li class="item">
<div>
<code>
<a name="/s:vV13ParticleSwift11ClaimResult9claimCodeSS"></a>
<a name="//apple_ref/swift/Property/claimCode" class="dashAnchor"></a>
<a class="token" href="#/s:vV13ParticleSwift11ClaimResult9claimCodeSS">claimCode</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>The claim code</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="k">var</span> <span class="nv">claimCode</span><span class="p">:</span> <span class="kt">String</span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:vV13ParticleSwift11ClaimResult9deviceIDsGSaSS_"></a>
<a name="//apple_ref/swift/Property/deviceIDs" class="dashAnchor"></a>
<a class="token" href="#/s:vV13ParticleSwift11ClaimResult9deviceIDsGSaSS_">deviceIDs</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>The associated devices</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="k">var</span> <span class="nv">deviceIDs</span><span class="p">:</span> <span class="p">[</span><span class="kt">String</span><span class="p">]</span></code></pre>
</div>
</div>
</section>
</div>
</li>
</ul>
</div>
<div class="task-group">
<ul>
<li class="item">
<div>
<code>
<a name="/s:FV13ParticleSwift11ClaimResultcFT4withGVs10DictionarySSP___GSqS0__"></a>
<a name="//apple_ref/swift/Method/init(with:)" class="dashAnchor"></a>
<a class="token" href="#/s:FV13ParticleSwift11ClaimResultcFT4withGVs10DictionarySSP___GSqS0__">init(with:)</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>Undocumented</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="kd">struct</span> <span class="kt">ClaimResult</span></code></pre>
</div>
</div>
</section>
</div>
</li>
<li class="item">
<div>
<code>
<a name="/s:vV13ParticleSwift11ClaimResult10dictionaryGVs10DictionarySSP__"></a>
<a name="//apple_ref/swift/Property/dictionary" class="dashAnchor"></a>
<a class="token" href="#/s:vV13ParticleSwift11ClaimResult10dictionaryGVs10DictionarySSP__">dictionary</a>
</code>
</div>
<div class="height-container">
<div class="pointer-container"></div>
<section class="section">
<div class="pointer"></div>
<div class="abstract">
<p>The claim result as a dictionary using keys compatible with the original web service</p>
</div>
<div class="declaration">
<h4>Declaration</h4>
<div class="language">
<p class="aside-title">Swift</p>
<pre class="highlight"><code><span class="kd">public</span> <span class="k">var</span> <span class="nv">dictionary</span><span class="p">:</span> <span class="p">[</span><span class="kt">String</span> <span class="p">:</span> <span class="kt">Any</span><span class="p">]</span></code></pre>
</div>
</div>
</section>
</div>
</li>
</ul>
</div>
</section>
</section>
<section id="footer">
<p>© 2017 <a class="link" href="" target="_blank" rel="external">Mark Vakoc</a>. All rights reserved. (Last updated: 2017-03-21)</p>
<p>Generated by <a class="link" href="https://github.com/realm/jazzy" target="_blank" rel="external">jazzy ♪♫ v0.7.2</a>, a <a class="link" href="http://realm.io" target="_blank" rel="external">Realm</a> project.</p>
</section>
</article>
</div>
</body>
</div>
</html>
|
vakoc/particle-swift
|
Docs/docsets/.docset/Contents/Resources/Documents/Structs/ClaimResult.html
|
HTML
|
apache-2.0
| 15,669 |
---
title: "Flink On Windows"
layout: redirect
redirect: deployment/resource-providers/standalone/index
permalink: /tutorials/flink_on_windows.html
---
<!--
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing,
software distributed under the License is distributed on an
"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, either express or implied. See the License for the
specific language governing permissions and limitations
under the License.
-->
|
aljoscha/flink
|
docs/redirects/tutorials_flink_on_windows.zh.md
|
Markdown
|
apache-2.0
| 916 |
// Copyright 2015 Google Inc. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package com.google.api.ads.adwords.axis.utils.v201502.shopping;
import static org.junit.Assert.assertEquals;
import com.google.api.ads.adwords.axis.v201502.cm.ProductOfferId;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;
/**
* Tests for comparing {@link ProductOfferId} dimensions.
*/
@RunWith(JUnit4.class)
public class ProductOfferIdComparatorTest extends BaseProductDimensionComparatorTest {
@Override
ProductOfferId createOtherProductDimension() {
return ProductDimensions.createOfferId(null);
}
@Test
public void testCaseInsensitive() {
ProductOfferId offerId1 = ProductDimensions.createOfferId("ABC");
ProductOfferId offerId2 = ProductDimensions.createOfferId("AbC");
assertEquals("OfferIds that only differ in case should be equivalent", 0,
comparator.compare(offerId1, offerId2));
}
}
|
raja15792/googleads-java-lib
|
modules/adwords_axis/src/test/java/com/google/api/ads/adwords/axis/utils/v201502/shopping/ProductOfferIdComparatorTest.java
|
Java
|
apache-2.0
| 1,485 |
package org.arquillian.smart.testing.hub.storage.local;
import java.io.File;
import java.io.IOException;
import java.nio.file.Files;
import java.nio.file.Path;
/**
* A class responsible for performing actions on a file or directory.
*/
public class LocalStorageAction {
private final Path path;
private final boolean isDirectory;
LocalStorageAction(Path path, boolean isDirectory) {
this.path = path;
this.isDirectory = isDirectory;
}
/**
* Creates the given file or directory set in previous steps. If the type is a file, then the parent directory (and
* the whole path) is created as well.
*
* @return A {@link Path} of the created entry
*
* @throws IOException
* If anything bad happens
*/
public Path create() throws IOException {
if (!path.toFile().exists()) {
if (isDirectory) {
return Files.createDirectories(path);
} else {
Files.createDirectories(path.getParent());
return Files.createFile(path);
}
}
return path;
}
public Path getPath() {
return path;
}
public File getFile() {
return path.toFile();
}
}
|
arquillian/smart-testing
|
core/src/main/java/org/arquillian/smart/testing/hub/storage/local/LocalStorageAction.java
|
Java
|
apache-2.0
| 1,251 |
package org.wso2.carbon.apimgt.rest.api.store.v1.dto;
import com.fasterxml.jackson.annotation.JsonProperty;
import com.fasterxml.jackson.annotation.JsonCreator;
import javax.validation.constraints.*;
import io.swagger.annotations.*;
import java.util.Objects;
import javax.xml.bind.annotation.*;
import org.wso2.carbon.apimgt.rest.api.util.annotations.Scope;
public class UserDTO {
private String username = null;
private String password = null;
private String firstName = null;
private String lastName = null;
private String email = null;
/**
**/
public UserDTO username(String username) {
this.username = username;
return this;
}
@ApiModelProperty(required = true, value = "")
@JsonProperty("username")
@NotNull
public String getUsername() {
return username;
}
public void setUsername(String username) {
this.username = username;
}
/**
**/
public UserDTO password(String password) {
this.password = password;
return this;
}
@ApiModelProperty(required = true, value = "")
@JsonProperty("password")
@NotNull
public String getPassword() {
return password;
}
public void setPassword(String password) {
this.password = password;
}
/**
**/
public UserDTO firstName(String firstName) {
this.firstName = firstName;
return this;
}
@ApiModelProperty(required = true, value = "")
@JsonProperty("firstName")
@NotNull
public String getFirstName() {
return firstName;
}
public void setFirstName(String firstName) {
this.firstName = firstName;
}
/**
**/
public UserDTO lastName(String lastName) {
this.lastName = lastName;
return this;
}
@ApiModelProperty(required = true, value = "")
@JsonProperty("lastName")
@NotNull
public String getLastName() {
return lastName;
}
public void setLastName(String lastName) {
this.lastName = lastName;
}
/**
**/
public UserDTO email(String email) {
this.email = email;
return this;
}
@ApiModelProperty(required = true, value = "")
@JsonProperty("email")
@NotNull
public String getEmail() {
return email;
}
public void setEmail(String email) {
this.email = email;
}
@Override
public boolean equals(java.lang.Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
UserDTO user = (UserDTO) o;
return Objects.equals(username, user.username) &&
Objects.equals(password, user.password) &&
Objects.equals(firstName, user.firstName) &&
Objects.equals(lastName, user.lastName) &&
Objects.equals(email, user.email);
}
@Override
public int hashCode() {
return Objects.hash(username, password, firstName, lastName, email);
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("class UserDTO {\n");
sb.append(" username: ").append(toIndentedString(username)).append("\n");
sb.append(" password: ").append(toIndentedString(password)).append("\n");
sb.append(" firstName: ").append(toIndentedString(firstName)).append("\n");
sb.append(" lastName: ").append(toIndentedString(lastName)).append("\n");
sb.append(" email: ").append(toIndentedString(email)).append("\n");
sb.append("}");
return sb.toString();
}
/**
* Convert the given object to string with each line indented by 4 spaces
* (except the first line).
*/
private String toIndentedString(java.lang.Object o) {
if (o == null) {
return "null";
}
return o.toString().replace("\n", "\n ");
}
}
|
harsha89/carbon-apimgt
|
components/apimgt/org.wso2.carbon.apimgt.rest.api.store.v1/src/gen/java/org/wso2/carbon/apimgt/rest/api/store/v1/dto/UserDTO.java
|
Java
|
apache-2.0
| 3,683 |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.jackrabbit.oak.spi.security.authorization.principalbased.impl;
import com.google.common.collect.ImmutableSet;
import com.google.common.collect.Iterables;
import org.apache.jackrabbit.oak.namepath.NamePathMapper;
import org.apache.jackrabbit.oak.spi.security.authorization.permission.Permissions;
import org.apache.jackrabbit.oak.spi.security.authorization.permission.RepositoryPermission;
import org.apache.jackrabbit.oak.spi.security.privilege.PrivilegeConstants;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import org.junit.Before;
import org.junit.Test;
import java.lang.reflect.Field;
import java.util.Set;
import static org.apache.jackrabbit.oak.spi.security.authorization.permission.Permissions.NAMESPACE_MANAGEMENT;
import static org.apache.jackrabbit.oak.spi.security.authorization.permission.Permissions.NODE_TYPE_DEFINITION_MANAGEMENT;
import static org.apache.jackrabbit.oak.spi.security.privilege.PrivilegeConstants.JCR_NAMESPACE_MANAGEMENT;
import static org.apache.jackrabbit.oak.spi.security.privilege.PrivilegeConstants.JCR_NODE_TYPE_DEFINITION_MANAGEMENT;
import static org.apache.jackrabbit.oak.spi.security.privilege.PrivilegeConstants.JCR_WORKSPACE_MANAGEMENT;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertSame;
import static org.junit.Assert.assertTrue;
public class RepositoryPermissionTest extends AbstractPrincipalBasedTest {
private PrincipalBasedPermissionProvider permissionProvider;
@Before
public void before() throws Exception {
super.before();
permissionProvider = createPermissionProvider(root, getTestSystemUser().getPrincipal());
}
@Override
protected NamePathMapper getNamePathMapper() {
return NamePathMapper.DEFAULT;
}
private void setupPermissions(@Nullable String effectivePath, @NotNull String... privNames) throws Exception {
// set principal-based policy for 'testPrincipal'
setupPrincipalBasedAccessControl(getTestSystemUser().getPrincipal(), effectivePath, privNames);
if (root.hasPendingChanges()) {
root.commit();
}
}
@Test
public void testGetRepositoryPermissionsTwice() {
assertSame(permissionProvider.getRepositoryPermission(), permissionProvider.getRepositoryPermission());
}
@Test
public void testGetRepositoryPermissionsAfterRefresh() {
RepositoryPermission rp = permissionProvider.getRepositoryPermission();
permissionProvider.refresh();
assertSame(rp, permissionProvider.getRepositoryPermission());
}
@Test
public void testRefreshResetsRepositoryPermissions() throws Exception {
RepositoryPermission rp = permissionProvider.getRepositoryPermission();
Field f = rp.getClass().getDeclaredField("grantedPermissions");
f.setAccessible(true);
assertEquals((long) -1, f.get(rp));
// force evaluation
rp.isGranted(NAMESPACE_MANAGEMENT);
assertEquals(Permissions.NO_PERMISSION, f.get(rp));
// reset permission provider
permissionProvider.refresh();
assertEquals((long) -1, f.get(rp));
}
@Test
public void testIsGrantedNoPermissions() {
assertTrue(permissionProvider.getRepositoryPermission().isGranted(Permissions.NO_PERMISSION));
}
@Test
public void testIsGrantedNoPermissionSetup() {
assertFalse(permissionProvider.getRepositoryPermission().isGranted(NAMESPACE_MANAGEMENT));
}
@Test
public void testIsGrantedNoRepoPermissionSetup() throws Exception {
setupPermissions(testContentJcrPath, PrivilegeConstants.JCR_ALL);
permissionProvider.refresh();
assertFalse(permissionProvider.getRepositoryPermission().isGranted(NAMESPACE_MANAGEMENT));
}
@Test
public void testIsGrantedRepoPermissionSetup() throws Exception {
setupPermissions(null, PrivilegeConstants.JCR_NODE_TYPE_DEFINITION_MANAGEMENT);
permissionProvider.refresh();
assertFalse(permissionProvider.getRepositoryPermission().isGranted(NAMESPACE_MANAGEMENT));
assertFalse(permissionProvider.getRepositoryPermission().isGranted(NAMESPACE_MANAGEMENT| NODE_TYPE_DEFINITION_MANAGEMENT));
assertFalse(permissionProvider.getRepositoryPermission().isGranted(Permissions.ALL));
assertTrue(permissionProvider.getRepositoryPermission().isGranted(NODE_TYPE_DEFINITION_MANAGEMENT));
}
@Test
public void getPrivileges() throws Exception {
assertTrue(permissionProvider.getPrivileges(null).isEmpty());
setupPermissions(null, JCR_WORKSPACE_MANAGEMENT);
permissionProvider.refresh();
Set<String> privNames = permissionProvider.getPrivileges(null);
assertTrue(Iterables.elementsEqual(ImmutableSet.of(JCR_WORKSPACE_MANAGEMENT), privNames));
}
@Test
public void hasPrivileges() throws Exception {
assertFalse(permissionProvider.hasPrivileges(null, JCR_NAMESPACE_MANAGEMENT));
setupPermissions(null, JCR_NAMESPACE_MANAGEMENT);
permissionProvider.refresh();
assertTrue(permissionProvider.hasPrivileges(null, JCR_NAMESPACE_MANAGEMENT));
assertFalse(permissionProvider.hasPrivileges(null, JCR_NAMESPACE_MANAGEMENT, JCR_WORKSPACE_MANAGEMENT));
assertFalse(permissionProvider.hasPrivileges(null, JCR_NODE_TYPE_DEFINITION_MANAGEMENT));
}
}
|
apache/jackrabbit-oak
|
oak-authorization-principalbased/src/test/java/org/apache/jackrabbit/oak/spi/security/authorization/principalbased/impl/RepositoryPermissionTest.java
|
Java
|
apache-2.0
| 6,286 |
package godo
import (
"context"
"net/http"
"time"
)
// BalanceService is an interface for interfacing with the Balance
// endpoints of the DigitalOcean API
// See: https://developers.digitalocean.com/documentation/v2/#balance
type BalanceService interface {
Get(context.Context) (*Balance, *Response, error)
}
// BalanceServiceOp handles communication with the Balance related methods of
// the DigitalOcean API.
type BalanceServiceOp struct {
client *Client
}
var _ BalanceService = &BalanceServiceOp{}
// Balance represents a DigitalOcean Balance
type Balance struct {
MonthToDateBalance string `json:"month_to_date_balance"`
AccountBalance string `json:"account_balance"`
MonthToDateUsage string `json:"month_to_date_usage"`
GeneratedAt time.Time `json:"generated_at"`
}
func (r Balance) String() string {
return Stringify(r)
}
// Get DigitalOcean balance info
func (s *BalanceServiceOp) Get(ctx context.Context) (*Balance, *Response, error) {
path := "v2/customers/my/balance"
req, err := s.client.NewRequest(ctx, http.MethodGet, path, nil)
if err != nil {
return nil, nil, err
}
root := new(Balance)
resp, err := s.client.Do(ctx, req, root)
if err != nil {
return nil, resp, err
}
return root, resp, err
}
|
kangwoo/prometheus
|
vendor/github.com/digitalocean/godo/balance.go
|
GO
|
apache-2.0
| 1,266 |
<!--
To change this template, choose Tools | Templates
and open the template in the editor.
-->
<table>
<tr jms-foreach="auto">
<td for-property-html="auto.make_display"></td>
<td for-property-html="auto.make_country"></td>
</tr>
</table>
|
mssalvo/jMsvc
|
demo/exampleInclude/html/body.html
|
HTML
|
apache-2.0
| 263 |
@(user: models.User)(implicit messages: Messages)
@main(Messages("home.title"), Some(user)) {
<div class="user col-md-6 col-md-offset-3">
<div class="row">
<hr class="col-md-12" />
<h4 class="col-md-8">@Messages("welcome.signed.in")</h4>
<div class="col-md-4 text-right">
<img src="@user.avatarURL.getOrElse(routes.Assets.at("images/silhouette.png"))" height="40px" />
</div>
<hr class="col-md-12" />
</div>
<div class="row data">
<div class="col-md-12">
<div class="row">
<p class="col-md-6"><strong>@Messages("email"):</strong></p><p class="col-md-6">@user.email.getOrElse("None")</p>
</div>
<div class="row">
<p class="col-md-6"><strong>@Messages("full.name"):</strong></p><p class="col-md-6">@user.profile.fullName.getOrElse("None")</p>
</div>
<div class="row">
<p class="col-md-6"><strong>@Messages("age"):</strong></p><p class="col-md-6">@user.profile.age.getOrElse("None")</p>
</div>
<div class="row">
<p class="col-md-6"><strong>@Messages("sex"):</strong></p>
<p class="col-md-6">
@{
user.profile.sex match {
case Some("M") => Messages("sex.Male")
case Some("F") => Messages("sex.Female")
case None => Messages("None")
case _ => println("^_^")
}
}
</p>
</div>
</div>
</div>
<div class="row">
<hr class="col-md-12" />
<div class="col-md-4">
<p class="form-group"><a href="@routes.ApplicationController.pass">@Messages("edit.pass.now")</a></p>
</div>
<div class="col-md-4">
<p class="form-group"><a href="@routes.ApplicationController.profile">@Messages("edit.profile.now")</a></p>
</div>
</div>
</div>
}
|
renexdev/Play-Auth-Slick-Seed-Load-Schema
|
app/views/admin.scala.html
|
HTML
|
apache-2.0
| 2,241 |
/*
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the MIT License. See License.txt in the project root for
* license information.
*
* Code generated by Microsoft (R) AutoRest Code Generator.
* Changes may cause incorrect behavior and will be lost if the code is
* regenerated.
*/
'use strict';
/**
* Data Lake Store file status list information.
*
*/
class FileStatuses {
/**
* Create a FileStatuses.
* @property {array} [fileStatus] the object containing the list of
* properties of the files.
*/
constructor() {
}
/**
* Defines the metadata of FileStatuses
*
* @returns {object} metadata of FileStatuses
*
*/
mapper() {
return {
required: false,
serializedName: 'FileStatuses',
type: {
name: 'Composite',
className: 'FileStatuses',
modelProperties: {
fileStatus: {
required: false,
readOnly: true,
serializedName: 'fileStatus',
type: {
name: 'Sequence',
element: {
required: false,
serializedName: 'FileStatusPropertiesElementType',
type: {
name: 'Composite',
className: 'FileStatusProperties'
}
}
}
}
}
}
};
}
}
module.exports = FileStatuses;
|
xingwu1/azure-sdk-for-node
|
lib/services/datalake.Store/lib/filesystem/models/fileStatuses.js
|
JavaScript
|
apache-2.0
| 1,428 |
/**
* Copyright 2011-2019 Asakusa Framework Team.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.asakusafw.utils.java.model.syntax;
/**
* An interface which represents qualified names.
* <ul>
* <li> Specified In: <ul>
* <li> {@code [JLS3:6.2] Names and Identifiers} </li>
* </ul> </li>
* </ul>
*/
public interface QualifiedName
extends Name {
/**
* Returns the name qualifier.
* @return the name qualifier
*/
Name getQualifier();
/**
* Returns the simple name on the tail.
* @return the simple name on the tail
*/
SimpleName getSimpleName();
}
|
ashigeru/asakusafw
|
utils-project/java-dom/src/main/java/com/asakusafw/utils/java/model/syntax/QualifiedName.java
|
Java
|
apache-2.0
| 1,144 |
# -*- coding: utf-8 -*-
"""The SQLite blob path specification implementation."""
from dfvfs.lib import definitions
from dfvfs.path import factory
from dfvfs.path import path_spec
class SQLiteBlobPathSpec(path_spec.PathSpec):
"""SQLite blob file path specification.
Attributes:
column_name (str): name of the column in which the blob is stored.
row_condition (tuple): condition of the row in which the blob is stored.
The condition is a tuple in the form: (column_name, operator, value).
The condition must yield a single result.
row_index (int): index of the row in which the blob is stored.
table_name (str): name of the table in which the blob is stored.
"""
TYPE_INDICATOR = definitions.TYPE_INDICATOR_SQLITE_BLOB
def __init__(
self, column_name=None, parent=None, row_condition=None,
row_index=None, table_name=None, **kwargs):
"""Initializes a path specification.
Note that the SQLite blob file path specification must have a parent.
Args:
column_name (Optional[str]): name of the column in which the blob is
stored.
parent (Optional[PathSpec]): parent path specification.
row_condition (Optional[tuple]): condition of the row in which the blob
is stored. The condition is a tuple in the form: (column_name,
operator, value). The condition must yield a single result.
row_index (Optional[int]): index of the row in which the blob is stored.
table_name (Optional[str]): name of the table in which the blob is
stored.
Raises:
ValueError: when table_name, column_name, row_condition and row_index,
or parent is not set.
"""
if not table_name or not column_name or not parent:
raise ValueError('Missing table_name, column_name or parent value.')
if (row_condition and (
not isinstance(row_condition, tuple) or len(row_condition) != 3)):
raise ValueError((
'Unsupported row_condition not a tuple in the form: '
'(column_name, operator, value).'))
super(SQLiteBlobPathSpec, self).__init__(parent=parent, **kwargs)
self.column_name = column_name
self.row_condition = row_condition
self.row_index = row_index
self.table_name = table_name
@property
def comparable(self):
"""str: comparable representation of the path specification."""
string_parts = []
string_parts.append('table name: {0:s}'.format(self.table_name))
string_parts.append('column name: {0:s}'.format(self.column_name))
if self.row_condition is not None:
row_condition_string = ' '.join([
'{0!s}'.format(value) for value in self.row_condition])
string_parts.append('row condition: "{0:s}"'.format(
row_condition_string))
if self.row_index is not None:
string_parts.append('row index: {0:d}'.format(self.row_index))
return self._GetComparable(sub_comparable_string=', '.join(string_parts))
factory.Factory.RegisterPathSpec(SQLiteBlobPathSpec)
|
joachimmetz/dfvfs
|
dfvfs/path/sqlite_blob_path_spec.py
|
Python
|
apache-2.0
| 3,020 |
#vidal-search {
position:fixed;
bottom:0;
right:0;
width:50px;
height:50px;
z-index:999;
}
.vidal-result {
cursor:pointer;
background-color: #FFFF99;
text-decoration: underline !important;
}
.vidal-result:hover {
font-weight:bold !important;
}
|
fbiville/vidal-direct
|
vidal-search.css
|
CSS
|
apache-2.0
| 258 |
// ----------------------------------------------------------------------------------
//
// Copyright Microsoft Corporation
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// ----------------------------------------------------------------------------------
using System.Collections.Generic;
using Microsoft.Rest.Azure;
using Microsoft.WindowsAzure.Commands.ScenarioTest;
using Moq;
using System.Management.Automation;
using System.Threading;
using System.Threading.Tasks;
using Xunit;
using Microsoft.Azure.Commands.ScenarioTest;
using Microsoft.Azure.Commands.Insights.ActivityLogAlert;
using Microsoft.Azure.Management.Monitor;
using Microsoft.Azure.Management.Monitor.Models;
namespace Microsoft.Azure.Commands.Insights.Test.ActivityLogAlerts
{
public class EnableAzureRmActivityLogAlertTests
{
private readonly EnableAzureRmActivityLogAlertCommand cmdlet;
private readonly Mock<MonitorManagementClient> monitorClientMock;
private readonly Mock<IActivityLogAlertsOperations> insightsOperationsMock;
private Mock<ICommandRuntime> commandRuntimeMock;
private AzureOperationResponse<ActivityLogAlertResource> response;
private string resourceGroup;
private string name;
private ActivityLogAlertPatchBody body;
public EnableAzureRmActivityLogAlertTests(Xunit.Abstractions.ITestOutputHelper output)
{
ServiceManagemenet.Common.Models.XunitTracingInterceptor.AddToContext(new ServiceManagemenet.Common.Models.XunitTracingInterceptor(output));
TestExecutionHelpers.SetUpSessionAndProfile();
insightsOperationsMock = new Mock<IActivityLogAlertsOperations>();
monitorClientMock = new Mock<MonitorManagementClient>() { CallBase = true };
commandRuntimeMock = new Mock<ICommandRuntime>();
cmdlet = new EnableAzureRmActivityLogAlertCommand()
{
CommandRuntime = commandRuntimeMock.Object,
MonitorManagementClient = monitorClientMock.Object
};
response = new AzureOperationResponse<ActivityLogAlertResource>()
{
Body = ActivityLogAlertsUtilities.CreateActivityLogAlertResource(location: "westus", name: "alert1")
};
insightsOperationsMock.Setup(f => f.UpdateWithHttpMessagesAsync(It.IsAny<string>(), It.IsAny<string>(), It.IsAny<ActivityLogAlertPatchBody>(), It.IsAny<Dictionary<string, List<string>>>(), It.IsAny<CancellationToken>()))
.Returns(Task.FromResult<AzureOperationResponse<ActivityLogAlertResource>>(response))
.Callback((string r, string n, ActivityLogAlertPatchBody b, Dictionary<string, List<string>> headers, CancellationToken t) =>
{
this.resourceGroup = r;
this.name = n;
this.body = b;
});
monitorClientMock.SetupGet(f => f.ActivityLogAlerts).Returns(this.insightsOperationsMock.Object);
// Setup Confirmation
commandRuntimeMock.Setup(f => f.ShouldProcess(It.IsAny<string>())).Returns(true);
commandRuntimeMock.Setup(f => f.ShouldProcess(It.IsAny<string>(), It.IsAny<string>())).Returns(true);
commandRuntimeMock.Setup(f => f.ShouldProcess(It.IsAny<string>(), It.IsAny<string>(), It.IsAny<string>())).Returns(true);
commandRuntimeMock.Setup(f => f.ShouldContinue(It.IsAny<string>(), It.IsAny<string>())).Returns(true);
}
[Fact]
[Trait(Category.AcceptanceType, Category.CheckIn)]
public void EnableActivityLogAlertCommandParametersProcessing()
{
cmdlet.ResourceGroupName = Utilities.ResourceGroup;
cmdlet.Name = "alert1";
cmdlet.ExecuteCmdlet();
Assert.Equal(Utilities.ResourceGroup, this.resourceGroup);
Assert.Equal("alert1", this.name);
Assert.NotNull(this.body);
Assert.True(this.body.Enabled);
Assert.Null(this.body.Tags);
cmdlet.ExecuteCmdlet();
Assert.NotNull(this.body);
Assert.True(this.body.Enabled);
Assert.Null(this.body.Tags);
ActivityLogAlertResource resource = new ActivityLogAlertResource(location: "Global", scopes: null, condition: null, name: "andy0307rule", actions: null, id: "//subscriptions/07c0b09d-9f69-4e6e-8d05-f59f67299cb2/resourceGroups/Default-ActivityLogAlerts/providers/microsoft.insights/activityLogAlerts/andy0307rule")
{
Enabled = false
};
cmdlet.InputObject = new OutputClasses.PSActivityLogAlertResource(resource);
cmdlet.ExecuteCmdlet();
Assert.NotNull(this.body);
Assert.Equal("Default-ActivityLogAlerts", this.resourceGroup);
Assert.Equal("andy0307rule", this.name);
Assert.True(this.body.Enabled);
Assert.Null(this.body.Tags);
cmdlet.InputObject = null;
cmdlet.ResourceId = "/subscriptions/07c0b09d-9f69-4e6e-8d05-f59f67299cb2/resourceGroups/Default-ActivityLogAlerts/providers/microsoft.insights/activityLogAlerts/andy0307rule";
cmdlet.ExecuteCmdlet();
Assert.NotNull(this.body);
Assert.Equal("Default-ActivityLogAlerts", this.resourceGroup);
Assert.Equal("andy0307rule", this.name);
Assert.True(this.body.Enabled);
Assert.Null(this.body.Tags);
}
}
}
|
AzureAutomationTeam/azure-powershell
|
src/ResourceManager/Insights/Commands.Insights.Test/ActivityLogAlerts/EnableAzureRmActivityLogAlertTests.cs
|
C#
|
apache-2.0
| 6,020 |
@import url('http://fonts.googleapis.com/css?family=Open+Sans');
/*
CSS Reset
http://meyerweb.com/eric/tools/css/reset/
*/
html, body, div, span, applet, object, iframe,
h1, h2, h3, h4, h5, h6, p, blockquote, pre,
a, abbr, acronym, address, big, cite, code,
del, dfn, em, img, ins, kbd, q, s, samp,
small, strike, strong, sub, sup, tt, var,
b, u, i, center,
dl, dt, dd, ol, ul, li,
fieldset, form, label, legend,
table, caption, tbody, tfoot, thead, tr, th, td,
article, aside, canvas, details, embed,
figure, figcaption, footer, header, hgroup,
menu, nav, output, ruby, section, summary,
time, mark, audio, video {
margin: 0;
padding: 0;
border: 0;
font-size: 100%;
font: inherit;
vertical-align: baseline;
}
article, aside, details, figcaption, figure,
footer, header, hgroup, menu, nav, section {
display: block;
}
body {
line-height: 1;
}
ol, ul {
list-style: none;
}
blockquote, q {
quotes: none;
}
blockquote:before, blockquote:after,
q:before, q:after {
content: '';
content: none;
}
table {
border-collapse: collapse;
border-spacing: 0;
}
/* particleground demo */
* {
-webkit-box-sizing: border-box;
-moz-box-sizing: border-box;
box-sizing: border-box;
}
html, body {
width: 100%;
height: 100%;
overflow: hidden;
}
body {
background: #000000;
font-family: 'Open Sans', sans-serif;
font-weight: 300;
color: #91C948;
line-height: 1.3;
-webkit-font-smoothing: antialiased;
}
small {
font-size:10px;
}
// @-webkit-keyframes color_change {
// from { background-color: #000; }
// to { background-color: #011; }
// }
// @-moz-keyframes color_change {
// from { background-color: #000; }
// to { background-color: #011; }
// }
// @-ms-keyframes color_change {
// from { background-color: #000; }
// to { background-color: #011; }
// }
// @-o-keyframes color_change {
// from { background-color: #000; }
// to { background-color: #011; }
// }
// @keyframes color_change {
// from { background-color: #000; }
// to { background-color: #011; }
// }
#particles {
-webkit-animation: color_change 5s infinite alternate;
-moz-animation: color_change 5s infinite alternate;
-ms-animation: color_change 5s infinite alternate;
-o-animation: color_change 5s infinite alternate;
animation: color_change 5s infinite alternate;
width: 100%;
height: 100%;
overflow: hidden;
}
#intro {
position: absolute;
left: 0;
top: 50%;
padding: 0 25px;
width: 100%;
text-align: left;
}
h1 {
text-transform: uppercase;
font-size: 60px;
font-weight: 700;
letter-spacing: -0.1em;
}
h1::after {
content: '';
width: 100%;
display: block;
/* background: #91C948; */
height: 1px;
margin: 25px auto;
line-height: 1.1;
}
br {
content: " ";
display: block;
margin: 10px 0;
}
p {
margin: 0 0 30px 0;
font-size: 20px;
}
.btn {
display: inline-block;
padding: 15px 20px;
margin: 5px;
border: 1px solid #91C948;
text-transform: uppercase;
letter-spacing: 0.015em;
font-size: 15px;
font-weight: 300;
line-height: 1;
color: #91C948;
text-decoration: none;
-webkit-transition: all .5s;
-moz-transition: all .5s;
-o-transition: all .5s;
transition: all .5s;
}
.btn:hover {
color: ##91C948;
border-color: ##91C948;
}
@media only screen and (max-width: 1000px) {
h1 {
font-size: 60px;
}
}
@media only screen and (max-width: 800px) {
h1 {
font-size: 45px;
}
h1::after {
}
}
@media only screen and (max-width: 568px) {
#intro {
padding: 0 10px;
}
h1 {
font-size: 30px;
}
h1::after {
}
p {
font-size: 18px;
}
.btn {
padding: 10px 15px;
font-size: 10px;
}
}
@media only screen and (max-width: 320px) {
h1 {
font-size: 28px;
}
h1::after {
}
}
|
passiweinberger/passiweinberger.github.io
|
test/css/style.css
|
CSS
|
apache-2.0
| 3,803 |
/*
* Copyright 2014 the original author or authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.springframework.social.oauth2;
/**
* OAuth2 supports two types of authorization flow, typically referred to as "Client-side"
* and "Server-side". Use of implicit grant is discouraged unless there is no other
* option available.
*
* @author Roy Clarkson
*/
public enum GrantType {
/**
* AUTHORIZATION_CODE denotes the server-side authorization flow, and is associated
* with the response_type=code parameter value
*/
AUTHORIZATION_CODE,
/**
* IMPLICIT_GRANT denotes the client-side authorization flow and is associated with
* the response_type=token parameter value
*/
IMPLICIT_GRANT
}
|
domix/spring-social
|
spring-social-core/src/main/java/org/springframework/social/oauth2/GrantType.java
|
Java
|
apache-2.0
| 1,239 |
declare module 'date-fns/is_friday' {
import {isFriday} from 'date-fns'
export = isFriday
}
|
simhawk/simhawk.github.io
|
node_modules/date-fns/is_friday/index.d.ts
|
TypeScript
|
apache-2.0
| 96 |
# -*- coding: utf-8 -*-
#
# Copyright 2018 Google LLC
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# https://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""Unit tests."""
import mock
import pytest
from google.cloud import texttospeech_v1
from google.cloud.texttospeech_v1.proto import cloud_tts_pb2
class MultiCallableStub(object):
"""Stub for the grpc.UnaryUnaryMultiCallable interface."""
def __init__(self, method, channel_stub):
self.method = method
self.channel_stub = channel_stub
def __call__(self, request, timeout=None, metadata=None, credentials=None):
self.channel_stub.requests.append((self.method, request))
response = None
if self.channel_stub.responses:
response = self.channel_stub.responses.pop()
if isinstance(response, Exception):
raise response
if response:
return response
class ChannelStub(object):
"""Stub for the grpc.Channel interface."""
def __init__(self, responses=[]):
self.responses = responses
self.requests = []
def unary_unary(self,
method,
request_serializer=None,
response_deserializer=None):
return MultiCallableStub(method, self)
class CustomException(Exception):
pass
class TestTextToSpeechClient(object):
def test_list_voices(self):
# Setup Expected Response
expected_response = {}
expected_response = cloud_tts_pb2.ListVoicesResponse(
**expected_response)
# Mock the API response
channel = ChannelStub(responses=[expected_response])
patch = mock.patch('google.api_core.grpc_helpers.create_channel')
with patch as create_channel:
create_channel.return_value = channel
client = texttospeech_v1.TextToSpeechClient()
response = client.list_voices()
assert expected_response == response
assert len(channel.requests) == 1
expected_request = cloud_tts_pb2.ListVoicesRequest()
actual_request = channel.requests[0][1]
assert expected_request == actual_request
def test_list_voices_exception(self):
# Mock the API response
channel = ChannelStub(responses=[CustomException()])
patch = mock.patch('google.api_core.grpc_helpers.create_channel')
with patch as create_channel:
create_channel.return_value = channel
client = texttospeech_v1.TextToSpeechClient()
with pytest.raises(CustomException):
client.list_voices()
def test_synthesize_speech(self):
# Setup Expected Response
audio_content = b'16'
expected_response = {'audio_content': audio_content}
expected_response = cloud_tts_pb2.SynthesizeSpeechResponse(
**expected_response)
# Mock the API response
channel = ChannelStub(responses=[expected_response])
patch = mock.patch('google.api_core.grpc_helpers.create_channel')
with patch as create_channel:
create_channel.return_value = channel
client = texttospeech_v1.TextToSpeechClient()
# Setup Request
input_ = {}
voice = {}
audio_config = {}
response = client.synthesize_speech(input_, voice, audio_config)
assert expected_response == response
assert len(channel.requests) == 1
expected_request = cloud_tts_pb2.SynthesizeSpeechRequest(
input=input_, voice=voice, audio_config=audio_config)
actual_request = channel.requests[0][1]
assert expected_request == actual_request
def test_synthesize_speech_exception(self):
# Mock the API response
channel = ChannelStub(responses=[CustomException()])
patch = mock.patch('google.api_core.grpc_helpers.create_channel')
with patch as create_channel:
create_channel.return_value = channel
client = texttospeech_v1.TextToSpeechClient()
# Setup request
input_ = {}
voice = {}
audio_config = {}
with pytest.raises(CustomException):
client.synthesize_speech(input_, voice, audio_config)
|
jonparrott/google-cloud-python
|
texttospeech/tests/unit/gapic/v1/test_text_to_speech_client_v1.py
|
Python
|
apache-2.0
| 4,667 |
// Copyright (c) 2017 Marshall A. Greenblatt. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the name Chromium Embedded
// Framework nor the names of its contributors may be used to endorse
// or promote products derived from this software without specific prior
// written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// ---------------------------------------------------------------------------
//
// This file was generated by the CEF translator tool and should not edited
// by hand. See the translator.README.txt file in the tools directory for
// more information.
//
#ifndef CEF_INCLUDE_CAPI_CEF_SSL_STATUS_CAPI_H_
#define CEF_INCLUDE_CAPI_CEF_SSL_STATUS_CAPI_H_
#pragma once
#include "include/capi/cef_base_capi.h"
#include "include/capi/cef_values_capi.h"
#include "include/capi/cef_x509_certificate_capi.h"
#ifdef __cplusplus
extern "C" {
#endif
///
// Structure representing the SSL information for a navigation entry.
///
typedef struct _cef_sslstatus_t {
///
// Base structure.
///
cef_base_t base;
///
// Returns true (1) if the status is related to a secure SSL/TLS connection.
///
int (CEF_CALLBACK *is_secure_connection)(struct _cef_sslstatus_t* self);
///
// Returns a bitmask containing any and all problems verifying the server
// certificate.
///
cef_cert_status_t (CEF_CALLBACK *get_cert_status)(
struct _cef_sslstatus_t* self);
///
// Returns the SSL version used for the SSL connection.
///
cef_ssl_version_t (CEF_CALLBACK *get_sslversion)(
struct _cef_sslstatus_t* self);
///
// Returns a bitmask containing the page security content status.
///
cef_ssl_content_status_t (CEF_CALLBACK *get_content_status)(
struct _cef_sslstatus_t* self);
///
// Returns the X.509 certificate.
///
struct _cef_x509certificate_t* (CEF_CALLBACK *get_x509certificate)(
struct _cef_sslstatus_t* self);
} cef_sslstatus_t;
#ifdef __cplusplus
}
#endif
#endif // CEF_INCLUDE_CAPI_CEF_SSL_STATUS_CAPI_H_
|
mindthegab/SFE-Minuet-DesktopClient
|
minuet/CefGlue.Interop.Gen/include/capi/cef_ssl_status_capi.h
|
C
|
apache-2.0
| 3,285 |
<!DOCTYPE html>
<html lang="en">
<head>
<meta http-equiv="refresh" content="0;URL=constant.CL_QUEUE_ON_DEVICE_DEFAULT.html">
</head>
<body>
<p>Redirecting to <a href="constant.CL_QUEUE_ON_DEVICE_DEFAULT.html">constant.CL_QUEUE_ON_DEVICE_DEFAULT.html</a>...</p>
<script>location.replace("constant.CL_QUEUE_ON_DEVICE_DEFAULT.html" + location.search + location.hash);</script>
</body>
</html>
|
liebharc/clFFT
|
docs/bindings/cl_sys/cl_h/CL_QUEUE_ON_DEVICE_DEFAULT.v.html
|
HTML
|
apache-2.0
| 401 |
<?php
/*=========================================================================
Midas Server
Copyright Kitware SAS, 26 rue Louis Guérin, 69100 Villeurbanne, France.
All rights reserved.
For more information visit http://www.kitware.com/.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0.txt
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
=========================================================================*/
/** Error Controller */
class ErrorController extends AppController
{
public $_models = array();
public $_daos = array();
public $_components = array('NotifyError', 'Utility');
public $_forms = array();
private $_error;
private $_environment;
/** Init Controller */
public function init()
{
parent::init();
$error = $this->getParam('error_handler');
if (!isset($error) || empty($error)) {
return;
}
$session = new Zend_Session_Namespace('Auth_User');
$environment = Zend_Registry::get('configGlobal')->get('environment', 'production');
$this->_environment = $environment;
$this->Component->NotifyError->initNotifier($environment, $error, $session, $_SERVER);
$this->_error = $error;
$this->_environment = $environment;
$this->view->setScriptPath(BASE_PATH.'/core/views');
}
/** Error Action */
public function errorAction()
{
$error = $this->getParam('error_handler');
if (!isset($error) || empty($error)) {
$this->getResponse()->setHttpResponseCode(404);
$this->view->header = 'Error 404 - Not Found';
$this->view->message = 'The requested page was not found on this server.';
return;
}
$controller = $error->request->getParams();
$controller = $controller['controller'];
if ($controller != 'install' && !file_exists(LOCAL_CONFIGS_PATH.'/database.local.ini')
) {
$this->view->message = "Midas Server is not installed. Please go the <a href = '".$this->view->webroot."/install'> install page</a>.";
return;
}
switch ($this->_error->type) {
case Zend_Controller_Plugin_ErrorHandler::EXCEPTION_NO_ACTION:
case Zend_Controller_Plugin_ErrorHandler::EXCEPTION_NO_CONTROLLER:
case Zend_Controller_Plugin_ErrorHandler::EXCEPTION_NO_ROUTE:
$this->getResponse()->setHttpResponseCode(404);
$this->view->header = 'Error 404 - Not Found';
$this->view->message = 'The requested page was not found on this server.';
break;
default:
$code = $this->_error->exception->getCode();
$this->view->code = $code;
$this->view->exceptionText = $this->_error->exception->getMessage();
if ($code >= 400 && $code <= 417) {
$this->getResponse()->setHttpResponseCode($code);
if ($code == 403) {
if ($this->logged) {
$this->view->header = 'Error 403 - Access Denied';
} else {
$this->haveToBeLogged();
return;
}
} elseif ($code == 404) {
$this->view->header = 'Error 404 - Not Found';
}
} else {
$this->getResponse()->setHttpResponseCode(500);
}
$this->_applicationError();
break;
}
$fullMessage = $this->Component->NotifyError->getFullErrorMessage();
if (isset($this->fullMessage)) {
$this->getLogger()->warn($this->fullMessage);
} else {
$this->getLogger()->warn('URL: '.$this->Component->NotifyError->curPageURL()."\n".$fullMessage);
}
}
private function _applicationError()
{
$fullMessage = $this->Component->NotifyError->getFullErrorMessage();
$shortMessage = $this->Component->NotifyError->getShortErrorMessage();
$this->fullMessage = $fullMessage;
switch ($this->_environment) {
case 'production':
$this->view->message = $shortMessage;
break;
case 'testing':
$this->disableLayout();
$this->disableView();
$this->getResponse()->appendBody($shortMessage);
break;
default:
$this->view->message = nl2br($fullMessage);
}
}
}
|
jcfr/Midas
|
core/controllers/ErrorController.php
|
PHP
|
apache-2.0
| 5,057 |
---
layout: vakit_dashboard
title: KATTAQURGHON, OZBEKISTAN için iftar, namaz vakitleri ve hava durumu - ilçe/eyalet seç
permalink: /OZBEKISTAN/KATTAQURGHON
---
## KATTAQURGHON (OZBEKISTAN) için iftar, namaz vakitleri ve hava durumu görmek için bir ilçe/eyalet seç
Aşağıdaki listeden bir şehir ya da semt seçin
* [ (KATTAQURGHON, OZBEKISTAN) için iftar ve namaz vakitleri](/OZBEKISTAN/KATTAQURGHON/)
<script type="text/javascript">
var GLOBAL_COUNTRY = 'OZBEKISTAN';
var GLOBAL_CITY = 'KATTAQURGHON';
var GLOBAL_STATE = 'KATTAQURGHON';
</script>
|
hakanu/iftar
|
_posts_/vakit/OZBEKISTAN/KATTAQURGHON/2017-02-01-KATTAQURGHON.markdown
|
Markdown
|
apache-2.0
| 571 |
/*
* Waltz - Enterprise Architecture
* Copyright (C) 2016, 2017, 2018, 2019 Waltz open source project
* See README.md for more information
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific
*
*/
package org.finos.waltz.data.orgunit.search;
import org.finos.waltz.data.DatabaseVendorSpecific;
import org.finos.waltz.data.FullTextSearch;
import org.finos.waltz.data.orgunit.OrganisationalUnitDao;
import org.finos.waltz.model.entity_search.EntitySearchOptions;
import org.finos.waltz.model.orgunit.OrganisationalUnit;
import org.jooq.DSLContext;
import org.jooq.Field;
import org.jooq.impl.DSL;
import java.util.List;
import static org.finos.waltz.schema.tables.OrganisationalUnit.ORGANISATIONAL_UNIT;
public class PostgresOrganisationalUnitSearch implements FullTextSearch<OrganisationalUnit>, DatabaseVendorSpecific {
@Override
public List<OrganisationalUnit> searchFullText(DSLContext dsl, EntitySearchOptions options) {
Field<Double> rank = DSL
.field("ts_rank_cd(to_tsvector({0}), plainto_tsquery({1}))",
Double.class,
DSL.lower(ORGANISATIONAL_UNIT.DESCRIPTION),
DSL.inline(options.searchQuery().toLowerCase()));
return dsl
.select(ORGANISATIONAL_UNIT.fields())
.select(rank)
.from(ORGANISATIONAL_UNIT)
.where(rank.greaterThan(Double.MIN_VALUE))
.orderBy(rank.desc())
.limit(options.limit())
.fetch(OrganisationalUnitDao.TO_DOMAIN_MAPPER);
}
}
|
khartec/waltz
|
waltz-data/src/main/java/org/finos/waltz/data/orgunit/search/PostgresOrganisationalUnitSearch.java
|
Java
|
apache-2.0
| 2,028 |
<a class="co-m-footer-link" href="{{href}}">
<span class="co-m-footer-link--icon" ng-if="iconClass" ng-class="iconClass"></span>
<span ng-transclude></span>
</a>
|
coreos/coreos-web
|
src/ui/footer/footer-link.html
|
HTML
|
apache-2.0
| 166 |
// Generated by CoffeeScript 1.6.2
(function() {
var JSOG, isArray, nextId;
JSOG = {};
nextId = 1;
isArray = Array.isArray || function(obj) {
return Object.prototype.toString.call(obj) === '[object Array]';
};
JSOG.encode = function(original) {
var doEncode, idOf, sofar;
sofar = {};
idOf = function(obj) {
if (!obj.__jsogObjectId) {
obj.__jsogObjectId = "" + (nextId++);
}
return obj.__jsogObjectId;
};
doEncode = function(original) {
var encodeArray, encodeObject;
encodeObject = function(original) {
var id, key, result, value;
id = idOf(original);
if (sofar[id]) {
return {
'@ref': id
, id: original.id
, version: original.version
};
}
result = sofar[id] = {
'@id': id
};
for (key in original) {
value = original[key];
if (key !== '__jsogObjectId') {
result[key] = doEncode(value);
}
}
return result;
};
encodeArray = function(original) {
var val;
return (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = original.length; _i < _len; _i++) {
val = original[_i];
_results.push(doEncode(val));
}
return _results;
})();
};
if (original == null) {
return original;
} else if (isArray(original)) {
return encodeArray(original);
} else if (typeof original === 'object') {
return encodeObject(original);
} else {
return original;
}
};
return doEncode(original);
};
JSOG.decode = function(encoded) {
var doDecode, found;
found = {};
doDecode = function(encoded) {
var decodeArray, decodeObject;
decodeObject = function(encoded) {
var id, key, ref, result, value;
ref = encoded['@ref'];
if (ref != null) {
ref = ref.toString();
}
if (ref != null) {
return found[ref];
}
result = {};
id = encoded['@id'];
if (id != null) {
id = id.toString();
}
if (id) {
found[id] = result;
}
for (key in encoded) {
value = encoded[key];
if (key !== '@id') {
result[key] = doDecode(value);
}
}
return result;
};
decodeArray = function(encoded) {
var value;
return (function() {
var _i, _len, _results;
_results = [];
for (_i = 0, _len = encoded.length; _i < _len; _i++) {
value = encoded[_i];
_results.push(doDecode(value));
}
return _results;
})();
};
if (encoded == null) {
return encoded;
} else if (isArray(encoded)) {
return decodeArray(encoded);
} else if (typeof encoded === 'object') {
return decodeObject(encoded);
} else {
return encoded;
}
};
return doDecode(encoded);
};
JSOG.stringify = function(obj) {
return JSON.stringify(JSOG.encode(obj));
};
JSOG.parse = function(str) {
return JSOG.decode(JSON.parse(str));
};
if ((typeof module !== "undefined" && module !== null) && module.exports) {
module.exports = JSOG;
}
if (typeof window !== "undefined" && window !== null) {
window.JSOG = JSOG;
}
if (typeof define === 'function' && define.amd) {
define('JSOG', [], function() {
return JSOG;
});
}
return JSOG;
}).call(this);
|
gleb619/hotel_shop
|
src/main/webapp/resources/js/jsog/JSOG2.js
|
JavaScript
|
apache-2.0
| 3,670 |
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.apache.olingo.server.core.deserializer;
import java.net.URI;
import java.util.ArrayList;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import org.apache.olingo.commons.api.data.Entity;
import org.apache.olingo.commons.api.data.EntityCollection;
import org.apache.olingo.commons.api.data.Parameter;
import org.apache.olingo.commons.api.data.Property;
import org.apache.olingo.server.api.deserializer.DeserializerResult;
import org.apache.olingo.server.api.uri.queryoption.ExpandOption;
public class DeserializerResultImpl implements DeserializerResult {
private Entity entity;
private EntityCollection entitySet;
private ExpandOption expandOption;
private Property property;
private Map<String, Parameter> actionParameters;
private List<URI> entityReferences;
private DeserializerResultImpl() {}
@Override
public Entity getEntity() {
return entity;
}
@Override
public EntityCollection getEntityCollection() {
return entitySet;
}
@Override
public ExpandOption getExpandTree() {
return expandOption;
}
@Override
public Map<String, Parameter> getActionParameters() {
return actionParameters;
}
@Override
public Property getProperty() {
return property;
}
@Override
public List<URI> getEntityReferences() {
return entityReferences;
}
public static DeserializerResultBuilder with() {
return new DeserializerResultBuilder();
}
public static class DeserializerResultBuilder {
private Entity entity;
private EntityCollection entitySet;
private ExpandOption expandOption;
private Property property;
private Map<String, Parameter> actionParameters;
private List<URI> entityReferences;
public DeserializerResult build() {
DeserializerResultImpl result = new DeserializerResultImpl();
result.entity = entity;
result.entitySet = entitySet;
result.expandOption = expandOption;
result.property = property;
result.entityReferences = (entityReferences == null) ? new ArrayList<URI>() : entityReferences;
result.actionParameters = (actionParameters == null) ? new LinkedHashMap<String, Parameter>() : actionParameters;
return result;
}
public DeserializerResultBuilder entity(final Entity entity) {
this.entity = entity;
return this;
}
public DeserializerResultBuilder entityCollection(final EntityCollection entitySet) {
this.entitySet = entitySet;
return this;
}
public DeserializerResultBuilder expandOption(final ExpandOption expandOption) {
this.expandOption = expandOption;
return this;
}
public DeserializerResultBuilder property(final Property property) {
this.property = property;
return this;
}
public DeserializerResultBuilder entityReferences(final List<URI> entityReferences) {
this.entityReferences = entityReferences;
return this;
}
public DeserializerResultBuilder actionParameters(final Map<String, Parameter> actionParameters) {
this.actionParameters = actionParameters;
return this;
}
}
}
|
rareddy/olingo-odata4
|
lib/server-core/src/main/java/org/apache/olingo/server/core/deserializer/DeserializerResultImpl.java
|
Java
|
apache-2.0
| 3,940 |
程序设计的很多地方都要用到一个小技术：指定文本框的输入类型。即限制只能输入某几类或某类字符，甚至是某几个字符。
Android本身已经做了很多设计，如限制长度，限制只能输入整数或数字。
有时候这些还是不够的。我们可以在程序中根据需要自己定制。
主要涉及：EditText.addTextChangedListener，EditText.removeTextChangedListener，EditText.setFilters。
方法：
对EditText添加自定义的TextChange监听。在改监听中检测输入字符是否合法。
关键代码如下：
```
@Override
public void afterTextChanged(Editable s) {
String str = s.toString();
if (str.equals(tmp)) {
return;// 如果tmp==str则返回，因为这是我们设置的结果。否则会形成死循环。
}
StringBuffer sb = new StringBuffer();
for (int i = 0; i < str.length(); i++) {
if (digits.indexOf(str.charAt(i)) >= 0) {// 判断字符是否在可以输入的字符串中
sb.append(str.charAt(i));// 如果是，就添加到结果里，否则跳过
}
}
tmp = sb.toString();// 设置tmp，因为下面一句还会导致该事件被触发
editText.setText(tmp);// 设置结果
editText.invalidate();
}
```
运行结果如下：
|
EManual/EManual.github.io
|
android-tmp/test/android_userinterface/Android用户界面之EditText(编辑视图)/0006-自定义程序实现Android EditText只允许输入指定字符.md
|
Markdown
|
apache-2.0
| 1,274 |
import logging
import os.path
import re
import shutil
from cattle.type_manager import get_type, MARSHALLER
from cattle.storage import BaseStoragePool
from cattle.agent.handler import KindBasedMixin
from . import docker_client, get_compute
log = logging.getLogger('docker')
class DockerPool(KindBasedMixin, BaseStoragePool):
def __init__(self):
KindBasedMixin.__init__(self, kind='docker')
BaseStoragePool.__init__(self)
@staticmethod
def _get_image_by_id(id):
templates = docker_client().images(all=True)
templates = filter(lambda x: x['Id'] == id, templates)
if len(templates) > 0:
return templates[0]
return None
@staticmethod
def _get_image_by_label(tag):
templates = docker_client().images(all=True, name=tag.split(':', 1)[0])
templates = filter(lambda x: tag in x['RepoTags'], templates)
if len(templates) > 0:
return templates[0]
return None
def pull_image(self, image, progress):
if not self._is_image_active(image, None):
self._do_image_activate(image, None, progress)
def _is_image_active(self, image, storage_pool):
image_obj = self._get_image_by_label(image.data.dockerImage.fullName)
return image_obj is not None
def _do_image_activate(self, image, storage_pool, progress):
client = docker_client()
data = image.data.dockerImage
marshaller = get_type(MARSHALLER)
if progress is None:
client.pull(repository=data.qualifiedName, tag=data.tag)
else:
for status in client.pull(repository=data.qualifiedName,
tag=data.tag,
stream=True):
try:
log.info('Pulling [%s] status : %s', data.fullName, status)
status = marshaller.from_string(status)
message = status['status']
progress.update(message)
except:
pass
def _get_image_storage_pool_map_data(self, obj):
image = self._get_image_by_label(obj.image.data.dockerImage.fullName)
return {
'+data': {
'dockerImage': image
}
}
def _get_volume_storage_pool_map_data(self, obj):
return {
'volume': {
'format': 'docker'
}
}
def _is_volume_active(self, volume, storage_pool):
return True
def _is_volume_inactive(self, volume, storage_pool):
return True
def _is_volume_removed(self, volume, storage_pool):
if volume.deviceNumber == 0:
container = get_compute().get_container_by_name(
volume.instance.uuid)
return container is None
else:
if volume.data.fields['isHostPath']:
# If this is a host path volume, we'll never really remove it
# from disk, so just report is as removed for the purpose of
# handling the event.
return True
path = self._path_to_volume(volume)
return not os.path.exists(path)
def _do_volume_remove(self, volume, storage_pool, progress):
if volume.deviceNumber == 0:
container = get_compute().get_container_by_name(
volume.instance.uuid)
if container is None:
return
docker_client().remove_container(container)
else:
if not volume.data.fields['isHostPath']:
path = self._path_to_volume(volume)
if os.path.exists(path):
log.info("Deleting volume: %s" % volume.uri)
shutil.rmtree(path)
def _path_to_volume(self, volume):
host_path = volume.uri.replace('file://', '')
mounted_path = re.sub('^.*?/var/lib/docker', '/host/var/lib/docker',
host_path)
return mounted_path
|
ibuildthecloud/python-agent
|
cattle/plugins/docker/storage.py
|
Python
|
apache-2.0
| 4,039 |
/**
* @license
* Copyright 2018 Google LLC. All Rights Reserved.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* =============================================================================
*/
/**
* A ring buffer, providing O(1) FIFO, LIFO, and related operations.
*/
export class RingBuffer<T> {
// Note we store the indices in the range 0 <= index < 2*capacity.
// This allows us to distinguish the full from the empty case.
// See https://www.snellman.net/blog/archive/2016-12-13-ring-buffers/
protected begin = 0; // inclusive
protected end = 0; // exclusive
protected doubledCapacity: number;
protected data: T[];
/**
* Constructs a `RingBuffer`.
* @param capacity The number of items that the buffer can accomodate.
*/
constructor(public capacity: number) {
if (capacity == null) {
throw new RangeError('Can\'t create a ring buffer of unknown capacity.');
}
if (capacity < 1) {
throw new RangeError('Can\'t create ring buffer of capacity < 1.');
}
this.data = new Array<T>(capacity);
this.doubledCapacity = 2 * capacity;
}
/**
* Map any index into the range 0 <= index < 2*capacity.
*/
protected wrap(index: number) {
// don't trust % on negative numbers
while (index < 0) {
index += this.doubledCapacity;
}
return index % this.doubledCapacity;
}
protected get(index: number) {
if (index < 0) {
throw new RangeError('Can\'t get item at a negative index.');
}
return this.data[index % this.capacity];
}
protected set(index: number, value: T) {
if (index < 0) {
throw new RangeError('Can\'t set item at a negative index.');
}
this.data[index % this.capacity] = value;
}
/**
* Returns the current number of items in the buffer.
*/
length(): number {
let length = this.end - this.begin;
if (length < 0) {
length = this.doubledCapacity + length;
}
return length;
}
/**
* Reports whether the buffer is full.
* @returns true if the number of items in the buffer equals its capacity, and
* false otherwise.
*/
isFull() {
return this.length() === this.capacity;
}
/**
* Reports whether the buffer is empty.
* @returns true if the number of items in the buffer equals zero, and
* false otherwise.
*/
isEmpty() {
return this.length() === 0;
}
/**
* Adds an item to the end of the buffer.
*/
push(value: T) {
if (this.isFull()) {
throw new RangeError('Ring buffer is full.');
}
this.set(this.end, value);
this.end = this.wrap(this.end + 1);
}
/**
* Adds many items to the end of the buffer, in order.
*/
pushAll(values: T[]) {
for (const value of values) {
this.push(value);
}
}
/**
* Removes and returns the last item in the buffer.
*/
pop(): T {
if (this.isEmpty()) {
throw new RangeError('Ring buffer is empty.');
}
this.end = this.wrap(this.end - 1);
const result = this.get(this.end);
this.set(this.end, undefined);
return result;
}
/**
* Adds an item to the beginning of the buffer.
*/
unshift(value: T) {
if (this.isFull()) {
throw new RangeError('Ring buffer is full.');
}
this.begin = this.wrap(this.begin - 1);
this.set(this.begin, value);
}
/**
* Removes and returns the first item in the buffer.
*/
shift(): T {
if (this.isEmpty()) {
throw new RangeError('Ring buffer is empty.');
}
const result = this.get(this.begin);
this.set(this.begin, undefined);
this.begin = this.wrap(this.begin + 1);
return result;
}
/**
* Removes and returns a specific item in the buffer, and moves the last item
* to the vacated slot. This is useful for implementing a shuffling stream.
* Note that this operation necessarily scrambles the original order.
*
* @param relativeIndex: the index of the item to remove, relative to the
* first item in the buffer (e.g., hiding the ring nature of the underlying
* storage).
*/
shuffleExcise(relativeIndex: number): T {
if (this.isEmpty()) {
throw new RangeError('Ring buffer is empty.');
}
const index = this.wrap(this.begin + relativeIndex);
const result = this.get(index);
this.set(index, this.pop());
return result;
}
}
|
tensorflow/tfjs-data
|
tfjs-data/src/util/ring_buffer.ts
|
TypeScript
|
apache-2.0
| 4,854 |
# Basic set of tests for the hab pkg download command
#
# There are a number of pieces of this which are fragile, and could be
# implemented in a more clever fashion. There are many opportunites
# for cleaner code and more fine grained tests. However, they are a
# bit of a pain to program in bash. This is intended to provide
# minimal testing pending our figuring out the best approach for
# command line testing.
#
# Assumptions:
# 1. ${CACHE_DIR} can be set to a writable location on the filesystem
# Test the Habitat package downloader.
#
# Uses the `HAB_INTERNAL_BLDR_CHANNEL` environment variable to control
# the base packages channel for the exporter.
#
# Developers most likely want to run:
# HAB_TEST_CMD=./target/debug/hab test/end-to-end/test_pkg_download.sh
#
$cacheDir = "test-cache"
function Test-IdentDownloaded($FilePrefix) {
$path = Join-Path -Path $cacheDir "artifacts" "$FilePrefix-*"
if(!(Test-Path $path)) {
Write-Error "$path was not found."
}
}
function Test-GzipIdent {
Test-IdentDownloaded "core-gzip"
Test-IdentDownloaded "core-glibc"
Test-IdentDownloaded "core-gcc-libs"
Test-IdentDownloaded "core-grep"
Test-IdentDownloaded "core-linux-headers"
Test-IdentDownloaded "core-pcre"
Test-IdentDownloaded "core-less"
Test-IdentDownloaded "core-ncurses"
Test-IdentDownloaded "core-zlib"
if((Get-ChildItem (Join-Path $cacheDir "artifacts") -File).Count -ne 9) {
Write-Error "did not find 9 gzip artifacts"
}
}
function Test-RustIdent {
Test-IdentDownloaded "core-rust"
Test-IdentDownloaded "core-visual-cpp-redist-2015"
Test-IdentDownloaded "core-visual-cpp-build-tools-2015"
if((Get-ChildItem (Join-Path $cacheDir "artifacts") -File).Count -ne 3) {
Write-Error "did not find 3 gzip artifacts"
}
}
Describe "hab pkg download" {
$identFile = "ident_file"
$fixtures = "$PSScriptRoot/fixtures/pkg_download"
BeforeEach {
if(Test-Path $cacheDir) {
Remove-Item $cacheDir -Recurse -Force
}
}
It "'hab pkg download --channel stable --download-directory $cacheDir core/gzip' succeeds" {
hab pkg download --channel stable --download-directory $cacheDir core/gzip
Test-GzipIdent
}
It "'hab pkg download --channel stable --download-directory $cacheDir --file $identFile' succeeds" {
Set-Content $identFile -Value "core/gzip"
hab pkg download --channel stable --download-directory $cacheDir --file $identFile
Test-GzipIdent
}
It "'hab pkg download --channel stable --download-directory $cacheDir --file $identFile' succeeds with comments and empty lines" {
Set-Content $identFile -Value @"
# this is a series
# of comments, followed by empty lines and whitespaces
core/gzip
"@
hab pkg download --channel stable --download-directory $cacheDir --file $identFile
Test-GzipIdent
}
It "'hab pkg download --channel stable --download-directory $cacheDir core/rust --target=x86_64-windows' succeeds" {
hab pkg download --channel stable --download-directory $cacheDir core/rust --target=x86_64-windows
Test-RustIdent
}
It "fails when package is invalid" {
hab pkg download --download-directory $cacheDir arglebargle
$LASTEXITCODE | Should -Not -Be 0
}
It "fails when no package is provided" {
hab pkg download --download-directory $cacheDir
$LASTEXITCODE | Should -Not -Be 0
}
It "fails when invalid package is provided in file" {
Set-Content $identFile -Value "arglebargle"
hab pkg download --channel stable --download-directory $cacheDir --file $identFile
$LASTEXITCODE | Should -Not -Be 0
}
It "fails when package does not exist" {
hab pkg download --download-directory $cacheDir "core/half_life_4"
$LASTEXITCODE | Should -Not -Be 0
}
It "fails when cache dir cannot be created" {
New-Item $cacheDir
hab pkg download --download-directory $cacheDir "core/gzip"
$LASTEXITCODE | Should -Not -Be 0
}
It "fails when target is invalid" {
hab pkg download --download-directory $cacheDir "core/gzip" --target=6502-commodore
$LASTEXITCODE | Should -Not -Be 0
}
It "fails when token is invalid" {
hab pkg download --download-directory $cacheDir "core/gzip" --auth asdfa
$LASTEXITCODE | Should -Not -Be 0
}
It "fails when url is invalid" {
hab pkg download --download-directory $cacheDir "core/gzip" --url https://www.example.org
$LASTEXITCODE | Should -Not -Be 0
}
It "fails when channel is invalid" {
hab pkg download --download-directory $cacheDir "core/gzip" --channel number_5
$LASTEXITCODE | Should -Not -Be 0
}
It "succeeds with valid toml" {
hab pkg download --download-directory $cacheDir --file "$fixtures/happy_path.toml"
$LASTEXITCODE | Should -Be 0
}
It "succeeds with valid toml without a header" {
hab pkg download --download-directory $cacheDir --file "$fixtures/no_header.toml"
$LASTEXITCODE | Should -Be 0
}
It "fails with toml that has a bad header" {
hab pkg download --download-directory $cacheDir --file "$fixtures/bad_header.toml"
$LASTEXITCODE | Should -Be 1
}
It "fails with toml that has a bad ident" {
hab pkg download --download-directory $cacheDir --file "$fixtures/bad_ident.toml"
$LASTEXITCODE | Should -Be 1
}
It "fails with toml that has a bad target" {
hab pkg download --download-directory $cacheDir --file "$fixtures/bad_target.toml"
$LASTEXITCODE | Should -Be 1
}
It "fails with toml that has no target" {
hab pkg download --download-directory $cacheDir --file "$fixtures/no_target.toml"
$LASTEXITCODE | Should -Be 1
}
}
|
habitat-sh/habitat
|
test/end-to-end/test_pkg_download.ps1
|
PowerShell
|
apache-2.0
| 5,894 |
package cgeo.geocaching.settings.fragments;
import cgeo.geocaching.utils.functions.Action1;
import cgeo.geocaching.utils.functions.Action2;
import android.os.Bundle;
import android.view.View;
import androidx.annotation.DrawableRes;
import androidx.annotation.NonNull;
import androidx.annotation.Nullable;
import androidx.preference.Preference;
import androidx.preference.PreferenceFragmentCompat;
import androidx.preference.PreferenceGroup;
import androidx.preference.PreferenceScreen;
import java.util.ArrayList;
import org.apache.commons.lang3.StringUtils;
public abstract class BasePreferenceFragment extends PreferenceFragmentCompat {
// callback data
protected Action1<ArrayList<PrefSearchDescriptor>> searchdataCallback = null;
protected Action2<String, String> scrolltoCallback = null;
protected String scrolltoBaseKey = null;
protected String scrolltoPrefKey = null;
protected int icon = 0;
// automatic key generator
private int nextKey = 0;
public static class PrefSearchDescriptor {
public String baseKey;
public String prefKey;
public CharSequence prefTitle;
public CharSequence prefSummary;
public int prefCategoryIconRes;
PrefSearchDescriptor(final String baseKey, final String prefKey, final CharSequence prefTitle, final CharSequence prefSummary, @DrawableRes final int prefCategoryIconRes) {
this.baseKey = baseKey;
this.prefKey = prefKey;
this.prefTitle = prefTitle;
this.prefSummary = prefSummary;
this.prefCategoryIconRes = prefCategoryIconRes;
}
}
// sets icon resource for search info
public BasePreferenceFragment setIcon(@DrawableRes final int icon) {
this.icon = icon;
return this;
}
// sets callback to deliver searchable info about prefs to SettingsActivity
public void setSearchdataCallback(final Action1<ArrayList<PrefSearchDescriptor>> searchdataCallback) {
this.searchdataCallback = searchdataCallback;
}
// sets a callback to scroll to a specific pref after view has been created
public void setScrollToPrefCallback(final Action2<String, String> scrolltoCallback, final String scrolltoBaseKey, final String scrolltoPrefKey) {
this.scrolltoCallback = scrolltoCallback;
this.scrolltoBaseKey = scrolltoBaseKey;
this.scrolltoPrefKey = scrolltoPrefKey;
}
@Override
public void onViewCreated(@NonNull final View view, @Nullable final Bundle savedInstanceState) {
super.onViewCreated(view, savedInstanceState);
if (searchdataCallback != null) {
final PreferenceScreen prefScreen = getPreferenceScreen();
if (prefScreen != null) {
final String baseKey = prefScreen.getKey();
final ArrayList<PrefSearchDescriptor> data = new ArrayList<>();
doSearch(baseKey, data, prefScreen);
searchdataCallback.call(data);
searchdataCallback = null;
}
}
if (scrolltoCallback != null) {
scrolltoCallback.call(scrolltoBaseKey, scrolltoPrefKey);
scrolltoCallback = null;
}
}
/**
* searches recursively in all elements of given prefGroup for first occurrence of s
* returns found preference on success, null else
* (prefers preference entries over preference groups)
*/
private void doSearch(final String baseKey, final ArrayList<PrefSearchDescriptor> data, final PreferenceGroup start) {
final int prefCount = start.getPreferenceCount();
for (int i = 0; i < prefCount; i++) {
final Preference pref = start.getPreference(i);
// we can only address prefs that have a key, so create a generic one
if (StringUtils.isBlank(pref.getKey())) {
synchronized (this) {
pref.setKey(baseKey + "-" + (nextKey++));
}
}
data.add(new PrefSearchDescriptor(baseKey, pref.getKey(), pref.getTitle(), pref.getSummary(), icon));
if (pref instanceof PreferenceGroup) {
doSearch(baseKey, data, (PreferenceGroup) pref);
}
}
}
}
|
cgeo/cgeo
|
main/src/cgeo/geocaching/settings/fragments/BasePreferenceFragment.java
|
Java
|
apache-2.0
| 4,274 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"><!-- saved from url=(0014)about:internet --><!-- saved from url=(0014)about:internet --><html>
<head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>Hangle Unicode Composer's library</title><link rel="stylesheet" href="style.css" type="text/css" media="screen"><link rel="stylesheet" href="print.css" type="text/css" media="print"><link rel="stylesheet" href="override.css" type="text/css">
<base target="classFrame">
</head>
<body class="classFrameContent">
<h3> Index </h3>
<table cellpadding="0" cellspacing="5" width="100%">
<tbody>
<!--
<tr>
<td colspan="2"><a href="all-index-Symbols.html">Symbols</a></td>
</tr>
-->
<tr>
<td><a href="all-index-A.html">A</a></td>
<td><a href="all-index-N.html">N</a></td>
</tr>
<tr>
<td><a href="all-index-B.html">B</a></td>
<td><a href="all-index-O.html">O</a></td>
</tr>
<tr>
<td><a href="all-index-C.html">C</a></td>
<td><a href="all-index-P.html">P</a></td>
</tr>
<tr>
<td><a href="all-index-D.html">D</a></td>
<td><a href="all-index-Q.html">Q</a></td>
</tr>
<tr>
<td><a href="all-index-E.html">E</a></td>
<td><a href="all-index-R.html">R</a></td>
</tr>
<tr>
<td><a href="all-index-F.html">F</a></td>
<td><a href="all-index-S.html">S</a></td>
</tr>
<tr>
<td><a href="all-index-G.html">G</a></td>
<td><a href="all-index-T.html">T</a></td>
</tr>
<tr>
<td><a href="all-index-H.html">H</a></td>
<td><a href="all-index-U.html">U</a></td>
</tr>
<tr>
<td><a href="all-index-I.html">I</a></td>
<td><a href="all-index-V.html">V</a></td>
</tr>
<tr>
<td><a href="all-index-J.html">J</a></td>
<td><a href="all-index-W.html">W</a></td>
</tr>
<tr>
<td><a href="all-index-K.html">K</a></td>
<td><a href="all-index-X.html">X</a></td>
</tr>
<tr>
<td><a href="all-index-L.html">L</a></td>
<td><a href="all-index-Y.html">Y</a></td>
</tr>
<tr>
<td><a href="all-index-M.html">M</a></td>
<td><a href="all-index-Z.html">Z</a></td>
</tr>
</tbody></table>
</body><!--2013 blog.hansune.com<br/>Tue Sep 3 2013, 04:08 PM +09:00 --></html>
|
brownsoo/AS3-KoreanLanguageComposer
|
docs/index-list.html
|
HTML
|
apache-2.0
| 2,090 |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more contributor license
* agreements. See the NOTICE file distributed with this work for additional information regarding
* copyright ownership. The ASF licenses this file to You under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance with the License. You may obtain a
* copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License
* is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
* or implied. See the License for the specific language governing permissions and limitations under
* the License.
*/
package org.apache.geode.pdx.internal;
import java.io.DataInput;
import java.io.DataOutput;
import java.io.IOException;
import java.nio.ByteBuffer;
import java.text.SimpleDateFormat;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.SortedSet;
import java.util.TreeSet;
import com.fasterxml.jackson.databind.DeserializationFeature;
import com.fasterxml.jackson.databind.ObjectMapper;
import org.apache.commons.lang3.StringUtils;
import org.apache.geode.InternalGemFireException;
import org.apache.geode.annotations.Immutable;
import org.apache.geode.distributed.internal.DMStats;
import org.apache.geode.internal.ClassPathLoader;
import org.apache.geode.internal.InternalDataSerializer;
import org.apache.geode.internal.cache.GemFireCacheImpl;
import org.apache.geode.internal.cache.InternalCache;
import org.apache.geode.internal.serialization.DSCODE;
import org.apache.geode.internal.tcp.ByteBufferInputStream;
import org.apache.geode.internal.tcp.ByteBufferInputStream.ByteSource;
import org.apache.geode.internal.tcp.ByteBufferInputStream.ByteSourceFactory;
import org.apache.geode.internal.util.Hex;
import org.apache.geode.pdx.JSONFormatter;
import org.apache.geode.pdx.PdxSerializationException;
import org.apache.geode.pdx.WritablePdxInstance;
/**
* Implementation code in this class must be careful to not directly call super class state. Instead
* it must call {@link #getUnmodifiableReader()} and access the super class state using it. This
* class could be changed to not extend PdxReaderImpl but to instead have an instance variable that
* is a PdxReaderImpl but that would cause this class to use more memory.
* <p>
* We do not use this normal java io serialization when serializing this class in GemFire because
* Sendable takes precedence over Serializable.
*/
public class PdxInstanceImpl extends PdxReaderImpl implements InternalPdxInstance {
private static final long serialVersionUID = -1669268527103938431L;
private static final boolean USE_STATIC_MAPPER =
Boolean.getBoolean("PdxInstance.use-static-mapper");
@Immutable
private static final ObjectMapper mapper = USE_STATIC_MAPPER ? createObjectMapper() : null;
private static ObjectMapper createObjectMapper() {
ObjectMapper mapper = new ObjectMapper();
mapper.setDateFormat(new SimpleDateFormat("MM/dd/yyyy"));
mapper.configure(DeserializationFeature.FAIL_ON_UNKNOWN_PROPERTIES, false);
mapper.configure(com.fasterxml.jackson.core.JsonParser.Feature.ALLOW_UNQUOTED_FIELD_NAMES,
true);
return mapper;
}
private transient volatile Object cachedObjectForm;
/**
* Computes the hash code once and stores it. This is added to address the issue of identity value
* getting changed for each hash code call (as new objects instances are created in each call for
* the same object). The value 0 means the hash code is not yet computed (this avoids using extra
* variable for this), if the computation returns 0, it will be set to 1. This doesn't break the
* equality rule, where hash code can be same for non-equal objects.
*/
private static final int UNUSED_HASH_CODE = 0;
private transient volatile int cachedHashCode = UNUSED_HASH_CODE;
private static final ThreadLocal<Boolean> pdxGetObjectInProgress = new ThreadLocal<Boolean>();
public PdxInstanceImpl(PdxType pdxType, DataInput in, int len) {
super(pdxType, createDis(in, len));
}
protected PdxInstanceImpl(PdxReaderImpl original) {
super(original);
}
private static PdxInputStream createDis(DataInput in, int len) {
PdxInputStream dis;
if (in instanceof PdxInputStream) {
dis = new PdxInputStream((ByteBufferInputStream) in, len);
try {
int bytesSkipped = in.skipBytes(len);
int bytesRemaining = len - bytesSkipped;
while (bytesRemaining > 0) {
in.readByte();
bytesRemaining--;
}
} catch (IOException ex) {
throw new PdxSerializationException("Could not deserialize PDX", ex);
}
} else {
byte[] bytes = new byte[len];
try {
in.readFully(bytes);
} catch (IOException ex) {
throw new PdxSerializationException("Could not deserialize PDX", ex);
}
dis = new PdxInputStream(bytes);
}
return dis;
}
public static boolean getPdxReadSerialized() {
return pdxGetObjectInProgress.get() == null;
}
public static void setPdxReadSerialized(boolean readSerialized) {
if (!readSerialized) {
pdxGetObjectInProgress.set(true);
} else {
pdxGetObjectInProgress.remove();
}
}
@Override
public Object getField(String fieldName) {
return getUnmodifiableReader(fieldName).readField(fieldName);
}
private PdxWriterImpl convertToTypeWithNoDeletedFields(PdxReaderImpl ur) {
PdxOutputStream os = new PdxOutputStream();
PdxType pt = new PdxType(ur.getPdxType().getClassName(), !ur.getPdxType().getNoDomainClass());
InternalCache cache = GemFireCacheImpl
.getForPdx("PDX registry is unavailable because the Cache has been closed.");
TypeRegistry tr = cache.getPdxRegistry();
PdxWriterImpl writer = new PdxWriterImpl(pt, tr, os);
for (PdxField field : pt.getFields()) {
if (!field.isDeleted()) {
writer.writeRawField(field, ur.getRaw(field));
}
}
writer.completeByteStreamGeneration();
return writer;
}
@Override
public void sendTo(DataOutput out) throws IOException {
PdxReaderImpl ur = getUnmodifiableReader();
if (ur.getPdxType().getHasDeletedField()) {
PdxWriterImpl writer = convertToTypeWithNoDeletedFields(ur);
writer.sendTo(out);
} else {
out.write(DSCODE.PDX.toByte());
out.writeInt(ur.basicSize());
out.writeInt(ur.getPdxType().getTypeId());
ur.basicSendTo(out);
}
}
@Override
public byte[] toBytes() {
PdxReaderImpl ur = getUnmodifiableReader();
if (ur.getPdxType().getHasDeletedField()) {
PdxWriterImpl writer = convertToTypeWithNoDeletedFields(ur);
return writer.toByteArray();
} else {
byte[] result = new byte[PdxWriterImpl.HEADER_SIZE + ur.basicSize()];
ByteBuffer bb = ByteBuffer.wrap(result);
bb.put(DSCODE.PDX.toByte());
bb.putInt(ur.basicSize());
bb.putInt(ur.getPdxType().getTypeId());
ur.basicSendTo(bb);
return result;
}
}
@Override
public Object getCachedObject() {
Object result = this.cachedObjectForm;
if (result == null) {
result = getObject();
this.cachedObjectForm = result;
}
return result;
}
private String extractTypeMetaData() {
Object type = this.getField("@type");
if (type != null) {
if (type instanceof String) {
return (String) type;
} else {
throw new PdxSerializationException("Could not deserialize as invalid className found");
}
} else {
return null;
}
}
@Override
public Object getObject() {
if (getPdxType().getNoDomainClass()) {
// In case of Developer Rest APIs, All PdxInstances converted from Json will have a className
// =__GEMFIRE_JSON.
// Following code added to convert Json/PdxInstance into the Java object.
if (this.getClassName().equals(JSONFormatter.JSON_CLASSNAME)) {
// introspect the JSON, does the @type meta-data exist.
String className = extractTypeMetaData();
if (StringUtils.isNotBlank(className)) {
try {
String JSON = JSONFormatter.toJSON(this);
ObjectMapper objMapper = USE_STATIC_MAPPER ? mapper : createObjectMapper();
Object classInstance =
objMapper.readValue(JSON, ClassPathLoader.getLatest().forName(className));
return classInstance;
} catch (Exception e) {
throw new PdxSerializationException(
"Could not deserialize as java class '" + className + "' could not be resolved", e);
}
}
}
return this;
}
boolean wouldReadSerialized = PdxInstanceImpl.getPdxReadSerialized();
if (!wouldReadSerialized) {
return getUnmodifiableReader().basicGetObject();
} else {
PdxInstanceImpl.setPdxReadSerialized(false);
try {
return getUnmodifiableReader().basicGetObject();
} finally {
PdxInstanceImpl.setPdxReadSerialized(true);
}
}
}
@Override
public int hashCode() {
if (this.cachedHashCode != UNUSED_HASH_CODE) {
// Already computed.
return this.cachedHashCode;
}
PdxReaderImpl ur = getUnmodifiableReader();
// Compute hash code.
Collection<PdxField> fields = ur.getPdxType().getSortedIdentityFields();
int hashCode = 1;
for (PdxField ft : fields) {
switch (ft.getFieldType()) {
case CHAR:
case BOOLEAN:
case BYTE:
case SHORT:
case INT:
case LONG:
case DATE:
case FLOAT:
case DOUBLE:
case STRING:
case BOOLEAN_ARRAY:
case CHAR_ARRAY:
case BYTE_ARRAY:
case SHORT_ARRAY:
case INT_ARRAY:
case LONG_ARRAY:
case FLOAT_ARRAY:
case DOUBLE_ARRAY:
case STRING_ARRAY:
case ARRAY_OF_BYTE_ARRAYS: {
ByteSource buffer = ur.getRaw(ft);
if (!buffer.equals(ByteSourceFactory.create(ft.getFieldType().getDefaultBytes()))) {
hashCode = hashCode * 31 + buffer.hashCode();
}
break;
}
case OBJECT_ARRAY: {
Object[] oArray = ur.readObjectArray(ft);
if (oArray != null) {
// default value of null does not modify hashCode.
hashCode = hashCode * 31 + Arrays.deepHashCode(oArray);
}
break;
}
case OBJECT: {
Object objectValue = ur.readObject(ft);
if (objectValue == null) {
// default value of null does not modify hashCode.
} else if (objectValue.getClass().isArray()) {
Class<?> myComponentType = objectValue.getClass().getComponentType();
if (myComponentType.isPrimitive()) {
ByteSource buffer = getRaw(ft);
hashCode = hashCode * 31 + buffer.hashCode();
} else {
hashCode = hashCode * 31 + Arrays.deepHashCode((Object[]) objectValue);
}
} else {
hashCode = hashCode * 31 + objectValue.hashCode();
}
break;
}
default:
throw new InternalGemFireException("Unhandled field type " + ft.getFieldType());
}
}
int result = (hashCode == UNUSED_HASH_CODE) ? (hashCode + 1) : hashCode;
this.cachedHashCode = result;
return result;
}
@Override
public boolean equals(Object obj) {
if (obj == this)
return true;
if (obj == null) {
return false;
}
if (!(obj instanceof PdxInstanceImpl)) {
return false;
}
final PdxInstanceImpl other = (PdxInstanceImpl) obj;
PdxReaderImpl ur2 = other.getUnmodifiableReader();
PdxReaderImpl ur1 = getUnmodifiableReader();
if (!ur1.getPdxType().getClassName().equals(ur2.getPdxType().getClassName())) {
return false;
}
SortedSet<PdxField> myFields = ur1.getPdxType().getSortedIdentityFields();
SortedSet<PdxField> otherFields = ur2.getPdxType().getSortedIdentityFields();
if (!myFields.equals(otherFields)) {
if (ur1.getPdxType().getClassName().isEmpty()) {
return false;
}
// It is not ok to modify myFields and otherFields in place so make copies
myFields = new TreeSet<PdxField>(myFields);
otherFields = new TreeSet<PdxField>(otherFields);
addDefaultFields(myFields, otherFields);
addDefaultFields(otherFields, myFields);
}
Iterator<PdxField> myFieldIterator = myFields.iterator();
Iterator<PdxField> otherFieldIterator = otherFields.iterator();
while (myFieldIterator.hasNext()) {
PdxField myType = myFieldIterator.next();
PdxField otherType = otherFieldIterator.next();
switch (myType.getFieldType()) {
case CHAR:
case BOOLEAN:
case BYTE:
case SHORT:
case INT:
case LONG:
case DATE:
case FLOAT:
case DOUBLE:
case STRING:
case BOOLEAN_ARRAY:
case CHAR_ARRAY:
case BYTE_ARRAY:
case SHORT_ARRAY:
case INT_ARRAY:
case LONG_ARRAY:
case FLOAT_ARRAY:
case DOUBLE_ARRAY:
case STRING_ARRAY:
case ARRAY_OF_BYTE_ARRAYS: {
ByteSource myBuffer = ur1.getRaw(myType);
ByteSource otherBuffer = ur2.getRaw(otherType);
if (!myBuffer.equals(otherBuffer)) {
return false;
}
}
break;
case OBJECT_ARRAY: {
Object[] myArray = ur1.readObjectArray(myType);
Object[] otherArray = ur2.readObjectArray(otherType);
if (!Arrays.deepEquals(myArray, otherArray)) {
return false;
}
}
break;
case OBJECT: {
Object myObject = ur1.readObject(myType);
Object otherObject = ur2.readObject(otherType);
if (myObject != otherObject) {
if (myObject == null) {
return false;
}
if (otherObject == null) {
return false;
}
if (myObject.getClass().isArray()) { // for bug 42976
Class<?> myComponentType = myObject.getClass().getComponentType();
Class<?> otherComponentType = otherObject.getClass().getComponentType();
if (!myComponentType.equals(otherComponentType)) {
return false;
}
if (myComponentType.isPrimitive()) {
ByteSource myBuffer = getRaw(myType);
ByteSource otherBuffer = other.getRaw(otherType);
if (!myBuffer.equals(otherBuffer)) {
return false;
}
} else {
if (!Arrays.deepEquals((Object[]) myObject, (Object[]) otherObject)) {
return false;
}
}
} else if (!myObject.equals(otherObject)) {
return false;
}
}
}
break;
default:
throw new InternalGemFireException("Unhandled field type " + myType.getFieldType());
}
}
return true;
}
/**
* Any fields that are in otherFields but not in myFields are added to myFields as defaults. When
* adding fields they are inserted in the natural sort order. Note: myFields may be modified by
* this call.
*/
private static void addDefaultFields(SortedSet<PdxField> myFields,
SortedSet<PdxField> otherFields) {
for (PdxField f : otherFields) {
if (!myFields.contains(f)) {
myFields.add(new DefaultPdxField(f));
}
}
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
PdxReaderImpl ur = getUnmodifiableReader();
result.append("PDX[").append(ur.getPdxType().getTypeId()).append(",")
.append(ur.getPdxType().getClassName()).append("]{");
boolean firstElement = true;
for (PdxField fieldType : ur.getPdxType().getSortedIdentityFields()) {
if (firstElement) {
firstElement = false;
} else {
result.append(", ");
} ;
result.append(fieldType.getFieldName());
result.append("=");
try {
final Object value = ur.readField(fieldType.getFieldName());
if (value instanceof byte[]) {
result.append(Hex.toHex((byte[]) value));
} else if (value.getClass().isArray()) {
if (value instanceof short[]) {
result.append(Arrays.toString((short[]) value));
} else if (value instanceof int[]) {
result.append(Arrays.toString((int[]) value));
} else if (value instanceof long[]) {
result.append(Arrays.toString((long[]) value));
} else if (value instanceof char[]) {
result.append(Arrays.toString((char[]) value));
} else if (value instanceof float[]) {
result.append(Arrays.toString((float[]) value));
} else if (value instanceof double[]) {
result.append(Arrays.toString((double[]) value));
} else if (value instanceof boolean[]) {
result.append(Arrays.toString((boolean[]) value));
} else {
result.append(Arrays.deepToString((Object[]) value));
}
} else {
result.append(value);
}
} catch (RuntimeException e) {
result.append(e);
}
}
result.append("}");
return result.toString();
}
@Override
public List<String> getFieldNames() {
return getPdxType().getFieldNames();
}
@Override
PdxUnreadData getReadUnreadFieldsCalled() {
return null;
}
protected void clearCachedState() {
this.cachedHashCode = UNUSED_HASH_CODE;
this.cachedObjectForm = null;
}
@Override
public WritablePdxInstance createWriter() {
if (isEnum()) {
throw new IllegalStateException("PdxInstances that are an enum can not be modified.");
}
return new WritablePdxInstanceImpl(getUnmodifiableReader());
}
protected PdxReaderImpl getUnmodifiableReader() {
return this;
}
protected PdxReaderImpl getUnmodifiableReader(String fieldName) {
return this;
}
// All PdxReaderImpl methods that might change the ByteBuffer position
// need to be synchronized so that they are done atomically.
// This fixes bug 43178.
// primitive read methods all use absolute read methods so they do not set position
// so no sync is needed. Fixed width fields all use absolute read methods.
@Override
public synchronized String readString(String fieldName) {
return super.readString(fieldName);
}
@Override
public synchronized Object readObject(String fieldName) {
return super.readObject(fieldName);
}
@Override
public synchronized Object readObject(PdxField ft) {
return super.readObject(ft);
}
@Override
public synchronized char[] readCharArray(String fieldName) {
return super.readCharArray(fieldName);
}
@Override
public synchronized boolean[] readBooleanArray(String fieldName) {
return super.readBooleanArray(fieldName);
}
@Override
public synchronized byte[] readByteArray(String fieldName) {
return super.readByteArray(fieldName);
}
@Override
public synchronized short[] readShortArray(String fieldName) {
return super.readShortArray(fieldName);
}
@Override
public synchronized int[] readIntArray(String fieldName) {
return super.readIntArray(fieldName);
}
@Override
public synchronized long[] readLongArray(String fieldName) {
return super.readLongArray(fieldName);
}
@Override
public synchronized float[] readFloatArray(String fieldName) {
return super.readFloatArray(fieldName);
}
@Override
public synchronized double[] readDoubleArray(String fieldName) {
return super.readDoubleArray(fieldName);
}
@Override
public synchronized String[] readStringArray(String fieldName) {
return super.readStringArray(fieldName);
}
@Override
public synchronized Object[] readObjectArray(String fieldName) {
return super.readObjectArray(fieldName);
}
@Override
public synchronized Object[] readObjectArray(PdxField ft) {
return super.readObjectArray(ft);
}
@Override
public synchronized byte[][] readArrayOfByteArrays(String fieldName) {
return super.readArrayOfByteArrays(fieldName);
}
@Override
public synchronized Object readField(String fieldName) {
return super.readField(fieldName);
}
@Override
protected synchronized Object basicGetObject() {
DMStats stats = InternalDataSerializer.getDMStats(null);
long start = stats.startPdxInstanceDeserialization();
try {
return super.basicGetObject();
} finally {
stats.endPdxInstanceDeserialization(start);
}
}
// override getRaw to fix bug 43569
@Override
protected synchronized ByteSource getRaw(PdxField ft) {
return super.getRaw(ft);
}
@Override
protected synchronized void basicSendTo(DataOutput out) throws IOException {
super.basicSendTo(out);
}
@Override
protected synchronized void basicSendTo(ByteBuffer bb) {
super.basicSendTo(bb);
}
@Override
public String getClassName() {
return getPdxType().getClassName();
}
@Override
public boolean isEnum() {
return false;
}
@Override
public Object getRawField(String fieldName) {
return getUnmodifiableReader(fieldName).readRawField(fieldName);
}
@Override
public boolean isDeserializable() {
if (this.getClassName().equals(JSONFormatter.JSON_CLASSNAME)) {
return true;
}
return !getPdxType().getNoDomainClass();
}
}
|
davinash/geode
|
geode-core/src/main/java/org/apache/geode/pdx/internal/PdxInstanceImpl.java
|
Java
|
apache-2.0
| 21,815 |
'use strict';
angular.module("ngLocale", [], ["$provide", function($provide) {
var PLURAL_CATEGORY = {ZERO: "zero", ONE: "one", TWO: "two", FEW: "few", MANY: "many", OTHER: "other"};
function getDecimals(n) {
n = n + '';
var i = n.indexOf('.');
return (i == -1) ? 0 : n.length - i - 1;
}
function getVF(n, opt_precision) {
var v = opt_precision;
if (undefined === v) {
v = Math.min(getDecimals(n), 3);
}
var base = Math.pow(10, v);
var f = ((n * base) | 0) % base;
return {v: v, f: f};
}
$provide.value("$locale", {
"DATETIME_FORMATS": {
"AMPMS": [
"TOO",
"MUU"
],
"DAY": [
"Jumap\u00ediri",
"Jumat\u00e1tu",
"Juma\u00edne",
"Jumat\u00e1ano",
"Alam\u00edisi",
"Ijum\u00e1a",
"Jumam\u00f3osi"
],
"ERANAMES": [
"K\u0268r\u0268sit\u0289 s\u0268 anavyaal",
"K\u0268r\u0268sit\u0289 akavyaalwe"
],
"ERAS": [
"KSA",
"KA"
],
"FIRSTDAYOFWEEK": 0,
"MONTH": [
"K\u0289f\u00fangat\u0268",
"K\u0289naan\u0268",
"K\u0289keenda",
"Kwiikumi",
"Kwiinyamb\u00e1la",
"Kwiidwaata",
"K\u0289m\u0289\u0289nch\u0268",
"K\u0289v\u0268\u0268r\u0268",
"K\u0289saat\u0289",
"Kwiinyi",
"K\u0289saano",
"K\u0289sasat\u0289"
],
"SHORTDAY": [
"P\u00edili",
"T\u00e1atu",
"\u00cdne",
"T\u00e1ano",
"Alh",
"Ijm",
"M\u00f3osi"
],
"SHORTMONTH": [
"F\u00fangat\u0268",
"Naan\u0268",
"Keenda",
"Ik\u00fami",
"Inyambala",
"Idwaata",
"M\u0289\u0289nch\u0268",
"V\u0268\u0268r\u0268",
"Saat\u0289",
"Inyi",
"Saano",
"Sasat\u0289"
],
"STANDALONEMONTH": [
"K\u0289f\u00fangat\u0268",
"K\u0289naan\u0268",
"K\u0289keenda",
"Kwiikumi",
"Kwiinyamb\u00e1la",
"Kwiidwaata",
"K\u0289m\u0289\u0289nch\u0268",
"K\u0289v\u0268\u0268r\u0268",
"K\u0289saat\u0289",
"Kwiinyi",
"K\u0289saano",
"K\u0289sasat\u0289"
],
"WEEKENDRANGE": [
5,
6
],
"fullDate": "EEEE, d MMMM y",
"longDate": "d MMMM y",
"medium": "d MMM y HH:mm:ss",
"mediumDate": "d MMM y",
"mediumTime": "HH:mm:ss",
"short": "dd/MM/y HH:mm",
"shortDate": "dd/MM/y",
"shortTime": "HH:mm"
},
"NUMBER_FORMATS": {
"CURRENCY_SYM": "TSh",
"DECIMAL_SEP": ".",
"GROUP_SEP": ",",
"PATTERNS": [
{
"gSize": 3,
"lgSize": 3,
"maxFrac": 3,
"minFrac": 0,
"minInt": 1,
"negPre": "-",
"negSuf": "",
"posPre": "",
"posSuf": ""
},
{
"gSize": 3,
"lgSize": 3,
"maxFrac": 2,
"minFrac": 2,
"minInt": 1,
"negPre": "-\u00a4\u00a0",
"negSuf": "",
"posPre": "\u00a4\u00a0",
"posSuf": ""
}
]
},
"id": "lag-tz",
"localeID": "lag_TZ",
"pluralCat": function(n, opt_precision) { var i = n | 0; var vf = getVF(n, opt_precision); if (i == 1 && vf.v == 0) { return PLURAL_CATEGORY.ONE; } return PLURAL_CATEGORY.OTHER;}
});
}]);
|
yoyocms/YoYoCms.AbpProjectTemplate
|
src/YoYoCms.AbpProjectTemplate.Web/Scripts/i18n/angular-locale_lag-tz.js
|
JavaScript
|
apache-2.0
| 3,197 |
/**
* Copyright (C) 2012-2015 Dell, Inc.
* See annotations for authorship information
*
* ====================================================================
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* ====================================================================
*/
package org.dasein.cloud.digitalocean.models.rest;
import org.dasein.cloud.CloudException;
import org.dasein.cloud.InternalException;
import org.json.JSONException;
import org.json.JSONObject;
public class DigitalOceanPostAction extends DigitalOceanAction {
public DigitalOceanPostAction() {
method = RESTMethod.POST;
}
public String getType() {
return "unknown";
}
public JSONObject getDefaultJSON() throws CloudException, JSONException {
JSONObject postParameter = new JSONObject();
String type = getType();
//Identity service does not have type as parameter
if (type != null) {
postParameter.put("type", getType());
}
return postParameter;
}
@Override
public JSONObject getParameters() throws CloudException, JSONException, InternalException {
return getDefaultJSON();
}
}
|
maksimov/dasein-cloud-digitalocean
|
src/main/java/org/dasein/cloud/digitalocean/models/rest/DigitalOceanPostAction.java
|
Java
|
apache-2.0
| 1,616 |
/*------------------------------------------------------
Author : www.webthemez.com
License: Commons Attribution 3.0
http://creativecommons.org/licenses/by/3.0/
--------------------------------------------------------- */
(function ($) {
"use strict";
var mainApp = {
initFunction: function () {
/*MENU
------------------------------------*/
$('#main-menu').metisMenu();
$(window).bind("load resize", function () {
if ($(this).width() < 768) {
$('div.sidebar-collapse').addClass('collapse')
} else {
$('div.sidebar-collapse').removeClass('collapse')
}
});
/* MORRIS BAR CHART
-----------------------------------------*/
Morris.Bar({
element: 'morris-bar-chart',
data: [{
y: '2006',
a: 100,
b: 90
}, {
y: '2007',
a: 75,
b: 65
}, {
y: '2008',
a: 50,
b: 40
}, {
y: '2009',
a: 75,
b: 65
}, {
y: '2010',
a: 50,
b: 40
}, {
y: '2011',
a: 75,
b: 65
}, {
y: '2012',
a: 100,
b: 90
}],
xkey: 'y',
ykeys: ['a', 'b'],
labels: ['Series A', 'Series B'],
barColors: [
'#A6A6A6','#1cc09f',
'#A8E9DC'
],
hideHover: 'auto',
resize: true
});
/* MORRIS DONUT CHART
----------------------------------------*/
Morris.Donut({
element: 'morris-donut-chart',
data: [{
label: "Download Sales",
value: 12
}, {
label: "In-Store Sales",
value: 30
}, {
label: "Mail-Order Sales",
value: 20
}],
colors: [
'#A6A6A6','#1cc09f',
'#A8E9DC'
],
resize: true
});
/* MORRIS AREA CHART
----------------------------------------*/
Morris.Area({
element: 'morris-area-chart',
data: [{
period: '2010 Q1',
iphone: 2666,
ipad: null,
itouch: 2647
}, {
period: '2010 Q2',
iphone: 2778,
ipad: 2294,
itouch: 2441
}, {
period: '2010 Q3',
iphone: 4912,
ipad: 1969,
itouch: 2501
}, {
period: '2010 Q4',
iphone: 3767,
ipad: 3597,
itouch: 5689
}, {
period: '2011 Q1',
iphone: 6810,
ipad: 1914,
itouch: 2293
}, {
period: '2011 Q2',
iphone: 5670,
ipad: 4293,
itouch: 1881
}, {
period: '2011 Q3',
iphone: 4820,
ipad: 3795,
itouch: 1588
}, {
period: '2011 Q4',
iphone: 15073,
ipad: 5967,
itouch: 5175
}, {
period: '2012 Q1',
iphone: 10687,
ipad: 4460,
itouch: 2028
}, {
period: '2012 Q2',
iphone: 8432,
ipad: 5713,
itouch: 1791
}],
xkey: 'period',
ykeys: ['iphone', 'ipad', 'itouch'],
labels: ['iPhone', 'iPad', 'iPod Touch'],
pointSize: 2,
hideHover: 'auto',
pointFillColors:['#ffffff'],
pointStrokeColors: ['black'],
lineColors:['#A6A6A6','#1cc09f'],
resize: true
});
/* MORRIS LINE CHART
----------------------------------------*/
Morris.Line({
element: 'morris-line-chart',
data: [
{ y: '2014', a: 50, b: 90},
{ y: '2015', a: 165, b: 185},
{ y: '2016', a: 150, b: 130},
{ y: '2017', a: 175, b: 160},
{ y: '2018', a: 80, b: 65},
{ y: '2019', a: 90, b: 70},
{ y: '2020', a: 100, b: 125},
{ y: '2021', a: 155, b: 175},
{ y: '2022', a: 80, b: 85},
{ y: '2023', a: 145, b: 155},
{ y: '2024', a: 160, b: 195}
],
xkey: 'y',
ykeys: ['a', 'b'],
labels: ['Total Income', 'Total Outcome'],
fillOpacity: 0.6,
hideHover: 'auto',
behaveLikeLine: true,
resize: true,
pointFillColors:['#ffffff'],
pointStrokeColors: ['black'],
lineColors:['gray','#1cc09f']
});
},
initialization: function () {
mainApp.initFunction();
}
}
// Initializing ///
$(document).ready(function () {
mainApp.initFunction();
$("#sideNav").click(function(){
if($(this).hasClass('closed')){
$('.navbar-side').animate({left: '0px'});
$(this).removeClass('closed');
$('#page-wrapper').animate({'margin-left' : '260px'});
}
else{
$(this).addClass('closed');
$('.navbar-side').animate({left: '-260px'});
$('#page-wrapper').animate({'margin-left' : '0px'});
}
});
});
}(jQuery));
|
ArmstrongYang/hiShare
|
dashboardL/assets/js/custom-scripts.js
|
JavaScript
|
apache-2.0
| 6,364 |
import json
import requests
import urllib
from requests.adapters import HTTPAdapter
from requests.packages.urllib3.util.retry import Retry
from urlparse import urljoin
from urlparse import urlparse
from urlparse import parse_qs
from urlparse import urlsplit
class PetStoreClient(object):
def __init__(self, url='http://localhost:8080'):
self.index_url = url
self.headers = {
'Accept': 'application/json, text/plain',
'Content-Type': 'application/json'
}
self.session = requests.Session()
def make_request(self, url, method='GET', headers={}, body_string=None, **kw):
response = self.session.request(method, url, data=body_string, headers=headers, **kw)
return response.status_code, response.json()
def create_pet(self, pet):
"""
Creates a pet, returning the created pet response
:param pet:
:return:
"""
url = urljoin(self.index_url, '/pets')
return self.session.request('POST', url, self.headers, json.dumps(pet))
def update_pet(self, pet):
"""
Updates a pet, returning the updated pet response
:param pet:
:return:
"""
url = urljoin(self.index_url, '/pets')
return self.session.request('PUT', url, self.headers, json.dumps(pet))
def get_pet(self, pet_id):
"""
Returns the pet for the given id
:param pet_id:
:return:
"""
url = urljoin(self.index_url, "/pets?id={0}".format(pet_id))
return self.session.request('GET', url, self.headers)
def list_pets(self, page_size=10, offset=0):
"""
Returns a list of pets
:return:
"""
url = urljoin(self.index_url, "/pets?pageSize={0}&offset={1}".format(page_size, offset))
return self.session.request('GET', url, self.headers)
def find_pets_by_status(self, statuses):
"""
Returns a list of pets that match the statuses provided
:param statuses: A list of valid Pet statuses
:return:
"""
status_kv_pairs = map(lambda x: "status={0}".format(x), statuses)
params = "&".join(status_kv_pairs)
url = urljoin(self.index_url, "/pets/findByStatus?{0}".format(params))
return self.session.request('GET', url, self.headers)
def find_pets_by_tag(self, tags):
"""
Returns a list of pets which match the tags provided.
Note: The current implementation of Pet stores the tags in a comma-delimited string. An inherent
shortcoming of how tags are stored means that: 1. the most accurate method of finding matches is through using
the LIKE operator, and 2. an unintended result is that an input containing substrings and commas can pass, despite
not being a full tag itself. (eg. given tags "foo" and "bar" to create tag string "foo,bar", "o,b" would pass)
:param tags: A list of valid tags.
:return:
"""
tags_kv_pairs = map(lambda x: "tags={0}".format(x), tags)
params = "&".join(tags_kv_pairs)
url = urljoin(self.index_url, "/pets/findByTags?{0}".format(params))
return self.session.request('GET', url, self.headers)
def delete_pet(self, pet_id):
"""
Deletes a pet
:return:
"""
url = urljoin(self.index_url, "/pets?id={0}".format(pet_id))
return self.session.request('DELETE', url, self.headers)
def place_order(self, order):
"""
Places an order for a pet
"""
url = urljoin(self.index_url, '/orders')
return self.session.request('POST', url, self.headers, json.dumps(order))
|
jastice/intellij-scala
|
scala/scala-impl/testdata/localProjects/scala-pet-store/functional_test/pet_store_client.py
|
Python
|
apache-2.0
| 3,715 |
/*
*
* Copyright 2015 gRPC authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
/* This file is auto-generated */
#include "test/core/end2end/end2end_tests.h"
#include <stdbool.h>
#include <string.h>
#include <grpc/support/log.h>
#include "test/core/util/debugger_macros.h"
static bool g_pre_init_called = false;
extern void authority_not_supported(grpc_end2end_test_config config);
extern void authority_not_supported_pre_init(void);
extern void bad_hostname(grpc_end2end_test_config config);
extern void bad_hostname_pre_init(void);
extern void bad_ping(grpc_end2end_test_config config);
extern void bad_ping_pre_init(void);
extern void binary_metadata(grpc_end2end_test_config config);
extern void binary_metadata_pre_init(void);
extern void cancel_after_accept(grpc_end2end_test_config config);
extern void cancel_after_accept_pre_init(void);
extern void cancel_after_client_done(grpc_end2end_test_config config);
extern void cancel_after_client_done_pre_init(void);
extern void cancel_after_invoke(grpc_end2end_test_config config);
extern void cancel_after_invoke_pre_init(void);
extern void cancel_before_invoke(grpc_end2end_test_config config);
extern void cancel_before_invoke_pre_init(void);
extern void cancel_in_a_vacuum(grpc_end2end_test_config config);
extern void cancel_in_a_vacuum_pre_init(void);
extern void cancel_with_status(grpc_end2end_test_config config);
extern void cancel_with_status_pre_init(void);
extern void compressed_payload(grpc_end2end_test_config config);
extern void compressed_payload_pre_init(void);
extern void connectivity(grpc_end2end_test_config config);
extern void connectivity_pre_init(void);
extern void default_host(grpc_end2end_test_config config);
extern void default_host_pre_init(void);
extern void disappearing_server(grpc_end2end_test_config config);
extern void disappearing_server_pre_init(void);
extern void empty_batch(grpc_end2end_test_config config);
extern void empty_batch_pre_init(void);
extern void filter_call_init_fails(grpc_end2end_test_config config);
extern void filter_call_init_fails_pre_init(void);
extern void filter_causes_close(grpc_end2end_test_config config);
extern void filter_causes_close_pre_init(void);
extern void filter_latency(grpc_end2end_test_config config);
extern void filter_latency_pre_init(void);
extern void graceful_server_shutdown(grpc_end2end_test_config config);
extern void graceful_server_shutdown_pre_init(void);
extern void high_initial_seqno(grpc_end2end_test_config config);
extern void high_initial_seqno_pre_init(void);
extern void hpack_size(grpc_end2end_test_config config);
extern void hpack_size_pre_init(void);
extern void idempotent_request(grpc_end2end_test_config config);
extern void idempotent_request_pre_init(void);
extern void invoke_large_request(grpc_end2end_test_config config);
extern void invoke_large_request_pre_init(void);
extern void keepalive_timeout(grpc_end2end_test_config config);
extern void keepalive_timeout_pre_init(void);
extern void large_metadata(grpc_end2end_test_config config);
extern void large_metadata_pre_init(void);
extern void load_reporting_hook(grpc_end2end_test_config config);
extern void load_reporting_hook_pre_init(void);
extern void max_concurrent_streams(grpc_end2end_test_config config);
extern void max_concurrent_streams_pre_init(void);
extern void max_connection_age(grpc_end2end_test_config config);
extern void max_connection_age_pre_init(void);
extern void max_connection_idle(grpc_end2end_test_config config);
extern void max_connection_idle_pre_init(void);
extern void max_message_length(grpc_end2end_test_config config);
extern void max_message_length_pre_init(void);
extern void negative_deadline(grpc_end2end_test_config config);
extern void negative_deadline_pre_init(void);
extern void network_status_change(grpc_end2end_test_config config);
extern void network_status_change_pre_init(void);
extern void no_logging(grpc_end2end_test_config config);
extern void no_logging_pre_init(void);
extern void no_op(grpc_end2end_test_config config);
extern void no_op_pre_init(void);
extern void payload(grpc_end2end_test_config config);
extern void payload_pre_init(void);
extern void ping(grpc_end2end_test_config config);
extern void ping_pre_init(void);
extern void ping_pong_streaming(grpc_end2end_test_config config);
extern void ping_pong_streaming_pre_init(void);
extern void registered_call(grpc_end2end_test_config config);
extern void registered_call_pre_init(void);
extern void request_with_flags(grpc_end2end_test_config config);
extern void request_with_flags_pre_init(void);
extern void request_with_payload(grpc_end2end_test_config config);
extern void request_with_payload_pre_init(void);
extern void resource_quota_server(grpc_end2end_test_config config);
extern void resource_quota_server_pre_init(void);
extern void server_finishes_request(grpc_end2end_test_config config);
extern void server_finishes_request_pre_init(void);
extern void shutdown_finishes_calls(grpc_end2end_test_config config);
extern void shutdown_finishes_calls_pre_init(void);
extern void shutdown_finishes_tags(grpc_end2end_test_config config);
extern void shutdown_finishes_tags_pre_init(void);
extern void simple_cacheable_request(grpc_end2end_test_config config);
extern void simple_cacheable_request_pre_init(void);
extern void simple_delayed_request(grpc_end2end_test_config config);
extern void simple_delayed_request_pre_init(void);
extern void simple_metadata(grpc_end2end_test_config config);
extern void simple_metadata_pre_init(void);
extern void simple_request(grpc_end2end_test_config config);
extern void simple_request_pre_init(void);
extern void streaming_error_response(grpc_end2end_test_config config);
extern void streaming_error_response_pre_init(void);
extern void trailing_metadata(grpc_end2end_test_config config);
extern void trailing_metadata_pre_init(void);
extern void workaround_cronet_compression(grpc_end2end_test_config config);
extern void workaround_cronet_compression_pre_init(void);
extern void write_buffering(grpc_end2end_test_config config);
extern void write_buffering_pre_init(void);
extern void write_buffering_at_end(grpc_end2end_test_config config);
extern void write_buffering_at_end_pre_init(void);
void grpc_end2end_tests_pre_init(void) {
GPR_ASSERT(!g_pre_init_called);
g_pre_init_called = true;
grpc_summon_debugger_macros();
authority_not_supported_pre_init();
bad_hostname_pre_init();
bad_ping_pre_init();
binary_metadata_pre_init();
cancel_after_accept_pre_init();
cancel_after_client_done_pre_init();
cancel_after_invoke_pre_init();
cancel_before_invoke_pre_init();
cancel_in_a_vacuum_pre_init();
cancel_with_status_pre_init();
compressed_payload_pre_init();
connectivity_pre_init();
default_host_pre_init();
disappearing_server_pre_init();
empty_batch_pre_init();
filter_call_init_fails_pre_init();
filter_causes_close_pre_init();
filter_latency_pre_init();
graceful_server_shutdown_pre_init();
high_initial_seqno_pre_init();
hpack_size_pre_init();
idempotent_request_pre_init();
invoke_large_request_pre_init();
keepalive_timeout_pre_init();
large_metadata_pre_init();
load_reporting_hook_pre_init();
max_concurrent_streams_pre_init();
max_connection_age_pre_init();
max_connection_idle_pre_init();
max_message_length_pre_init();
negative_deadline_pre_init();
network_status_change_pre_init();
no_logging_pre_init();
no_op_pre_init();
payload_pre_init();
ping_pre_init();
ping_pong_streaming_pre_init();
registered_call_pre_init();
request_with_flags_pre_init();
request_with_payload_pre_init();
resource_quota_server_pre_init();
server_finishes_request_pre_init();
shutdown_finishes_calls_pre_init();
shutdown_finishes_tags_pre_init();
simple_cacheable_request_pre_init();
simple_delayed_request_pre_init();
simple_metadata_pre_init();
simple_request_pre_init();
streaming_error_response_pre_init();
trailing_metadata_pre_init();
workaround_cronet_compression_pre_init();
write_buffering_pre_init();
write_buffering_at_end_pre_init();
}
void grpc_end2end_tests(int argc, char **argv,
grpc_end2end_test_config config) {
int i;
GPR_ASSERT(g_pre_init_called);
if (argc <= 1) {
authority_not_supported(config);
bad_hostname(config);
bad_ping(config);
binary_metadata(config);
cancel_after_accept(config);
cancel_after_client_done(config);
cancel_after_invoke(config);
cancel_before_invoke(config);
cancel_in_a_vacuum(config);
cancel_with_status(config);
compressed_payload(config);
connectivity(config);
default_host(config);
disappearing_server(config);
empty_batch(config);
filter_call_init_fails(config);
filter_causes_close(config);
filter_latency(config);
graceful_server_shutdown(config);
high_initial_seqno(config);
hpack_size(config);
idempotent_request(config);
invoke_large_request(config);
keepalive_timeout(config);
large_metadata(config);
load_reporting_hook(config);
max_concurrent_streams(config);
max_connection_age(config);
max_connection_idle(config);
max_message_length(config);
negative_deadline(config);
network_status_change(config);
no_logging(config);
no_op(config);
payload(config);
ping(config);
ping_pong_streaming(config);
registered_call(config);
request_with_flags(config);
request_with_payload(config);
resource_quota_server(config);
server_finishes_request(config);
shutdown_finishes_calls(config);
shutdown_finishes_tags(config);
simple_cacheable_request(config);
simple_delayed_request(config);
simple_metadata(config);
simple_request(config);
streaming_error_response(config);
trailing_metadata(config);
workaround_cronet_compression(config);
write_buffering(config);
write_buffering_at_end(config);
return;
}
for (i = 1; i < argc; i++) {
if (0 == strcmp("authority_not_supported", argv[i])) {
authority_not_supported(config);
continue;
}
if (0 == strcmp("bad_hostname", argv[i])) {
bad_hostname(config);
continue;
}
if (0 == strcmp("bad_ping", argv[i])) {
bad_ping(config);
continue;
}
if (0 == strcmp("binary_metadata", argv[i])) {
binary_metadata(config);
continue;
}
if (0 == strcmp("cancel_after_accept", argv[i])) {
cancel_after_accept(config);
continue;
}
if (0 == strcmp("cancel_after_client_done", argv[i])) {
cancel_after_client_done(config);
continue;
}
if (0 == strcmp("cancel_after_invoke", argv[i])) {
cancel_after_invoke(config);
continue;
}
if (0 == strcmp("cancel_before_invoke", argv[i])) {
cancel_before_invoke(config);
continue;
}
if (0 == strcmp("cancel_in_a_vacuum", argv[i])) {
cancel_in_a_vacuum(config);
continue;
}
if (0 == strcmp("cancel_with_status", argv[i])) {
cancel_with_status(config);
continue;
}
if (0 == strcmp("compressed_payload", argv[i])) {
compressed_payload(config);
continue;
}
if (0 == strcmp("connectivity", argv[i])) {
connectivity(config);
continue;
}
if (0 == strcmp("default_host", argv[i])) {
default_host(config);
continue;
}
if (0 == strcmp("disappearing_server", argv[i])) {
disappearing_server(config);
continue;
}
if (0 == strcmp("empty_batch", argv[i])) {
empty_batch(config);
continue;
}
if (0 == strcmp("filter_call_init_fails", argv[i])) {
filter_call_init_fails(config);
continue;
}
if (0 == strcmp("filter_causes_close", argv[i])) {
filter_causes_close(config);
continue;
}
if (0 == strcmp("filter_latency", argv[i])) {
filter_latency(config);
continue;
}
if (0 == strcmp("graceful_server_shutdown", argv[i])) {
graceful_server_shutdown(config);
continue;
}
if (0 == strcmp("high_initial_seqno", argv[i])) {
high_initial_seqno(config);
continue;
}
if (0 == strcmp("hpack_size", argv[i])) {
hpack_size(config);
continue;
}
if (0 == strcmp("idempotent_request", argv[i])) {
idempotent_request(config);
continue;
}
if (0 == strcmp("invoke_large_request", argv[i])) {
invoke_large_request(config);
continue;
}
if (0 == strcmp("keepalive_timeout", argv[i])) {
keepalive_timeout(config);
continue;
}
if (0 == strcmp("large_metadata", argv[i])) {
large_metadata(config);
continue;
}
if (0 == strcmp("load_reporting_hook", argv[i])) {
load_reporting_hook(config);
continue;
}
if (0 == strcmp("max_concurrent_streams", argv[i])) {
max_concurrent_streams(config);
continue;
}
if (0 == strcmp("max_connection_age", argv[i])) {
max_connection_age(config);
continue;
}
if (0 == strcmp("max_connection_idle", argv[i])) {
max_connection_idle(config);
continue;
}
if (0 == strcmp("max_message_length", argv[i])) {
max_message_length(config);
continue;
}
if (0 == strcmp("negative_deadline", argv[i])) {
negative_deadline(config);
continue;
}
if (0 == strcmp("network_status_change", argv[i])) {
network_status_change(config);
continue;
}
if (0 == strcmp("no_logging", argv[i])) {
no_logging(config);
continue;
}
if (0 == strcmp("no_op", argv[i])) {
no_op(config);
continue;
}
if (0 == strcmp("payload", argv[i])) {
payload(config);
continue;
}
if (0 == strcmp("ping", argv[i])) {
ping(config);
continue;
}
if (0 == strcmp("ping_pong_streaming", argv[i])) {
ping_pong_streaming(config);
continue;
}
if (0 == strcmp("registered_call", argv[i])) {
registered_call(config);
continue;
}
if (0 == strcmp("request_with_flags", argv[i])) {
request_with_flags(config);
continue;
}
if (0 == strcmp("request_with_payload", argv[i])) {
request_with_payload(config);
continue;
}
if (0 == strcmp("resource_quota_server", argv[i])) {
resource_quota_server(config);
continue;
}
if (0 == strcmp("server_finishes_request", argv[i])) {
server_finishes_request(config);
continue;
}
if (0 == strcmp("shutdown_finishes_calls", argv[i])) {
shutdown_finishes_calls(config);
continue;
}
if (0 == strcmp("shutdown_finishes_tags", argv[i])) {
shutdown_finishes_tags(config);
continue;
}
if (0 == strcmp("simple_cacheable_request", argv[i])) {
simple_cacheable_request(config);
continue;
}
if (0 == strcmp("simple_delayed_request", argv[i])) {
simple_delayed_request(config);
continue;
}
if (0 == strcmp("simple_metadata", argv[i])) {
simple_metadata(config);
continue;
}
if (0 == strcmp("simple_request", argv[i])) {
simple_request(config);
continue;
}
if (0 == strcmp("streaming_error_response", argv[i])) {
streaming_error_response(config);
continue;
}
if (0 == strcmp("trailing_metadata", argv[i])) {
trailing_metadata(config);
continue;
}
if (0 == strcmp("workaround_cronet_compression", argv[i])) {
workaround_cronet_compression(config);
continue;
}
if (0 == strcmp("write_buffering", argv[i])) {
write_buffering(config);
continue;
}
if (0 == strcmp("write_buffering_at_end", argv[i])) {
write_buffering_at_end(config);
continue;
}
gpr_log(GPR_DEBUG, "not a test: '%s'", argv[i]);
abort();
}
}
|
msmania/grpc
|
test/core/end2end/end2end_nosec_tests.c
|
C
|
apache-2.0
| 16,322 |
/**
* Generated with Acceleo
*/
package org.wso2.developerstudio.eclipse.gmf.esb.components;
// Start of user code for imports
import org.eclipse.emf.common.notify.Notification;
import org.eclipse.emf.common.util.BasicDiagnostic;
import org.eclipse.emf.common.util.Diagnostic;
import org.eclipse.emf.common.util.WrappedException;
import org.eclipse.emf.ecore.EObject;
import org.eclipse.emf.ecore.EStructuralFeature;
import org.eclipse.emf.ecore.EcorePackage;
import org.eclipse.emf.ecore.resource.ResourceSet;
import org.eclipse.emf.ecore.util.Diagnostician;
import org.eclipse.emf.ecore.util.EcoreUtil;
import org.eclipse.emf.eef.runtime.api.notify.EStructuralFeatureNotificationFilter;
import org.eclipse.emf.eef.runtime.api.notify.IPropertiesEditionEvent;
import org.eclipse.emf.eef.runtime.api.notify.NotificationFilter;
import org.eclipse.emf.eef.runtime.context.PropertiesEditingContext;
import org.eclipse.emf.eef.runtime.impl.components.SinglePartPropertiesEditingComponent;
import org.eclipse.emf.eef.runtime.impl.utils.EEFConverterUtil;
import org.wso2.developerstudio.eclipse.gmf.esb.EsbPackage;
import org.wso2.developerstudio.eclipse.gmf.esb.JsonTransformMediatorProperty;
import org.wso2.developerstudio.eclipse.gmf.esb.parts.EsbViewsRepository;
import org.wso2.developerstudio.eclipse.gmf.esb.parts.JsonTransformMediatorPropertyPropertiesEditionPart;
// End of user code
/**
*
*
*/
public class JsonTransformMediatorPropertyPropertiesEditionComponent extends SinglePartPropertiesEditingComponent {
public static String BASE_PART = "Base"; //$NON-NLS-1$
/**
* Default constructor
*
*/
public JsonTransformMediatorPropertyPropertiesEditionComponent(PropertiesEditingContext editingContext, EObject jsonTransformMediatorProperty, String editing_mode) {
super(editingContext, jsonTransformMediatorProperty, editing_mode);
parts = new String[] { BASE_PART };
repositoryKey = EsbViewsRepository.class;
partKey = EsbViewsRepository.JsonTransformMediatorProperty.class;
}
/**
* {@inheritDoc}
*
* @see org.eclipse.emf.eef.runtime.api.component.IPropertiesEditionComponent#initPart(java.lang.Object, int, org.eclipse.emf.ecore.EObject,
* org.eclipse.emf.ecore.resource.ResourceSet)
*
*/
public void initPart(Object key, int kind, EObject elt, ResourceSet allResource) {
setInitializing(true);
if (editingPart != null && key == partKey) {
editingPart.setContext(elt, allResource);
final JsonTransformMediatorProperty jsonTransformMediatorProperty = (JsonTransformMediatorProperty)elt;
final JsonTransformMediatorPropertyPropertiesEditionPart basePart = (JsonTransformMediatorPropertyPropertiesEditionPart)editingPart;
// init values
if (isAccessible(EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyName))
basePart.setPropertyName(EEFConverterUtil.convertToString(EcorePackage.Literals.ESTRING, jsonTransformMediatorProperty.getPropertyName()));
if (isAccessible(EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyValue))
basePart.setPropertyValue(EEFConverterUtil.convertToString(EcorePackage.Literals.ESTRING, jsonTransformMediatorProperty.getPropertyValue()));
// init filters
// init values for referenced views
// init filters for referenced views
}
setInitializing(false);
}
/**
* {@inheritDoc}
* @see org.eclipse.emf.eef.runtime.impl.components.StandardPropertiesEditionComponent#associatedFeature(java.lang.Object)
*/
public EStructuralFeature associatedFeature(Object editorKey) {
if (editorKey == EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyName) {
return EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyName();
}
if (editorKey == EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyValue) {
return EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyValue();
}
return super.associatedFeature(editorKey);
}
/**
* {@inheritDoc}
* @see org.eclipse.emf.eef.runtime.impl.components.StandardPropertiesEditionComponent#updateSemanticModel(org.eclipse.emf.eef.runtime.api.notify.IPropertiesEditionEvent)
*
*/
public void updateSemanticModel(final IPropertiesEditionEvent event) {
JsonTransformMediatorProperty jsonTransformMediatorProperty = (JsonTransformMediatorProperty)semanticObject;
if (EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyName == event.getAffectedEditor()) {
jsonTransformMediatorProperty.setPropertyName((java.lang.String)EEFConverterUtil.createFromString(EcorePackage.Literals.ESTRING, (String)event.getNewValue()));
}
if (EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyValue == event.getAffectedEditor()) {
jsonTransformMediatorProperty.setPropertyValue((java.lang.String)EEFConverterUtil.createFromString(EcorePackage.Literals.ESTRING, (String)event.getNewValue()));
}
}
/**
* {@inheritDoc}
* @see org.eclipse.emf.eef.runtime.impl.components.StandardPropertiesEditionComponent#updatePart(org.eclipse.emf.common.notify.Notification)
*/
public void updatePart(Notification msg) {
super.updatePart(msg);
if (editingPart.isVisible()) {
JsonTransformMediatorPropertyPropertiesEditionPart basePart = (JsonTransformMediatorPropertyPropertiesEditionPart)editingPart;
if (EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyName().equals(msg.getFeature()) && msg.getNotifier().equals(semanticObject) && basePart != null && isAccessible(EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyName)) {
if (msg.getNewValue() != null) {
basePart.setPropertyName(EcoreUtil.convertToString(EcorePackage.Literals.ESTRING, msg.getNewValue()));
} else {
basePart.setPropertyName("");
}
}
if (EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyValue().equals(msg.getFeature()) && msg.getNotifier().equals(semanticObject) && basePart != null && isAccessible(EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyValue)) {
if (msg.getNewValue() != null) {
basePart.setPropertyValue(EcoreUtil.convertToString(EcorePackage.Literals.ESTRING, msg.getNewValue()));
} else {
basePart.setPropertyValue("");
}
}
}
}
/**
* {@inheritDoc}
*
* @see org.eclipse.emf.eef.runtime.impl.components.StandardPropertiesEditionComponent#getNotificationFilters()
*/
@Override
protected NotificationFilter[] getNotificationFilters() {
NotificationFilter filter = new EStructuralFeatureNotificationFilter(
EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyName(),
EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyValue() );
return new NotificationFilter[] {filter,};
}
/**
* {@inheritDoc}
*
* @see org.eclipse.emf.eef.runtime.api.component.IPropertiesEditionComponent#validateValue(org.eclipse.emf.eef.runtime.api.notify.IPropertiesEditionEvent)
*
*/
public Diagnostic validateValue(IPropertiesEditionEvent event) {
Diagnostic ret = Diagnostic.OK_INSTANCE;
if (event.getNewValue() != null) {
try {
if (EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyName == event.getAffectedEditor()) {
Object newValue = event.getNewValue();
if (newValue instanceof String) {
newValue = EEFConverterUtil.createFromString(EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyName().getEAttributeType(), (String)newValue);
}
ret = Diagnostician.INSTANCE.validate(EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyName().getEAttributeType(), newValue);
}
if (EsbViewsRepository.JsonTransformMediatorProperty.Properties.propertyValue == event.getAffectedEditor()) {
Object newValue = event.getNewValue();
if (newValue instanceof String) {
newValue = EEFConverterUtil.createFromString(EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyValue().getEAttributeType(), (String)newValue);
}
ret = Diagnostician.INSTANCE.validate(EsbPackage.eINSTANCE.getAbstractNameValueProperty_PropertyValue().getEAttributeType(), newValue);
}
} catch (IllegalArgumentException iae) {
ret = BasicDiagnostic.toDiagnostic(iae);
} catch (WrappedException we) {
ret = BasicDiagnostic.toDiagnostic(we);
}
}
return ret;
}
}
|
prabushi/devstudio-tooling-esb
|
plugins/org.wso2.developerstudio.eclipse.gmf.esb.edit/src-gen/org/wso2/developerstudio/eclipse/gmf/esb/components/JsonTransformMediatorPropertyPropertiesEditionComponent.java
|
Java
|
apache-2.0
| 8,320 |
/*
* Copyright 2012-2016 the original author or authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.springframework.boot.devtools.env;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map;
import org.springframework.boot.SpringApplication;
import org.springframework.boot.env.EnvironmentPostProcessor;
import org.springframework.core.Ordered;
import org.springframework.core.annotation.Order;
import org.springframework.core.env.ConfigurableEnvironment;
import org.springframework.core.env.MapPropertySource;
import org.springframework.core.env.PropertySource;
/**
* {@link EnvironmentPostProcessor} to add properties that make sense when working at
* development time.
*
* @author Phillip Webb
* @author Andy Wilkinson
* @since 1.3.0
*/
@Order(Ordered.LOWEST_PRECEDENCE)
public class DevToolsPropertyDefaultsPostProcessor implements EnvironmentPostProcessor {
private static final Map<String, Object> PROPERTIES;
static {
Map<String, Object> properties = new HashMap<String, Object>();
properties.put("spring.thymeleaf.cache", "false");
properties.put("spring.freemarker.cache", "false");
properties.put("spring.groovy.template.cache", "false");
properties.put("spring.mustache.cache", "false");
properties.put("server.session.persistent", "true");
properties.put("spring.h2.console.enabled", "true");
properties.put("spring.resources.cache-period", "0");
properties.put("spring.template.provider.cache", "false");
properties.put("spring.mvc.log-resolved-exception", "true");
PROPERTIES = Collections.unmodifiableMap(properties);
}
@Override
public void postProcessEnvironment(ConfigurableEnvironment environment,
SpringApplication application) {
if (isLocalApplication(environment)) {
PropertySource<?> propertySource = new MapPropertySource("refresh",
PROPERTIES);
environment.getPropertySources().addLast(propertySource);
}
}
private boolean isLocalApplication(ConfigurableEnvironment environment) {
return environment.getPropertySources().get("remoteUrl") == null;
}
}
|
lucassaldanha/spring-boot
|
spring-boot-devtools/src/main/java/org/springframework/boot/devtools/env/DevToolsPropertyDefaultsPostProcessor.java
|
Java
|
apache-2.0
| 2,597 |
/*
* GeoTools - The Open Source Java GIS Toolkit
* http://geotools.org
*
* (C) 2003-2008, Open Source Geospatial Foundation (OSGeo)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation;
* version 2.1 of the License.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*/
package org.geotools.data.crs;
import java.util.Iterator;
import java.util.NoSuchElementException;
import org.geotools.data.simple.SimpleFeatureIterator;
import org.geotools.feature.FeatureIterator;
import org.geotools.feature.simple.SimpleFeatureBuilder;
import org.geotools.geometry.jts.GeometryCoordinateSequenceTransformer;
import org.opengis.feature.simple.SimpleFeature;
import org.opengis.feature.simple.SimpleFeatureType;
import org.opengis.referencing.operation.MathTransform;
import org.opengis.referencing.operation.TransformException;
import com.vividsolutions.jts.geom.Geometry;
/**
* ReprojectFeatureReader provides a reprojection for FeatureTypes.
*
* <p>
* ReprojectFeatureReader is a wrapper used to reproject GeometryAttributes
* to a user supplied CoordinateReferenceSystem from the original
* CoordinateReferenceSystem supplied by the original FeatureReader.
* </p>
*
* <p>
* Example Use:
* <pre><code>
* ReprojectFeatureReader reader =
* new ReprojectFeatureReader( originalReader, reprojectCS );
*
* CoordinateReferenceSystem originalCS =
* originalReader.getFeatureType().getDefaultGeometry().getCoordinateSystem();
*
* CoordinateReferenceSystem newCS =
* reader.getFeatureType().getDefaultGeometry().getCoordinateSystem();
*
* assertEquals( reprojectCS, newCS );
* </code></pre>
* </p>
* TODO: handle the case where there is more than one geometry and the other
* geometries have a different CS than the default geometry
*
* @author jgarnett, Refractions Research, Inc.
* @author aaime
* @author $Author: jive $ (last modification)
*
*
* @source $URL$
* @version $Id$
*/
public class ReprojectFeatureIterator implements Iterator<SimpleFeature>, SimpleFeatureIterator {
FeatureIterator<SimpleFeature> reader;
SimpleFeatureType schema;
GeometryCoordinateSequenceTransformer transformer = new GeometryCoordinateSequenceTransformer();
public ReprojectFeatureIterator(FeatureIterator<SimpleFeature> reader, SimpleFeatureType schema,
MathTransform transform) {
this.reader = reader;
this.schema = schema;
transformer.setMathTransform(transform);
//set hte target coordinate system
transformer.setCoordinateReferenceSystem(schema.getCoordinateReferenceSystem());
}
/**
* Implement getFeatureType.
*
* <p>
* Description ...
* </p>
*
*
* @throws IllegalStateException DOCUMENT ME!
*
* @see org.geotools.data.FeatureReader#getFeatureType()
*/
public SimpleFeatureType getFeatureType() {
if (schema == null) {
throw new IllegalStateException("Reader has already been closed");
}
return schema;
}
/**
* Implement next.
*
* <p>
* Description ...
* </p>
*
*
* @throws java.io.IOException
* @throws IllegalAttributeException
* @throws java.util.NoSuchElementException
* @throws IllegalStateException DOCUMENT ME!
* @throws org.geotools.data.DataSourceException DOCUMENT ME!
*
* @see org.geotools.data.FeatureReader#next()
*/
public SimpleFeature next()
throws NoSuchElementException {
if (reader == null) {
throw new IllegalStateException("Reader has already been closed");
}
//grab the next feature
SimpleFeature next = reader.next();
Object[] attributes = next.getAttributes().toArray();
try {
for (int i = 0; i < attributes.length; i++) {
if (attributes[i] instanceof Geometry) {
attributes[i] = transformer.transform((Geometry) attributes[i]);
}
}
} catch (TransformException e) {
throw (IllegalStateException)new IllegalStateException("A transformation exception occurred while reprojecting data on the fly").initCause(e);
}
return SimpleFeatureBuilder.build(schema, attributes, next.getID());
}
public void remove() {
throw new UnsupportedOperationException("On the fly reprojection disables remove");
}
/**
* Implement hasNext.
*
* <p>
* Description ...
* </p>
*
*
* @throws java.io.IOException
* @throws IllegalStateException DOCUMENT ME!
*
* @see org.geotools.data.FeatureReader#hasNext()
*/
public boolean hasNext(){
if (reader == null) {
throw new IllegalStateException("Reader has already been closed");
}
return reader.hasNext();
}
/**
* Implement close.
*
* <p>
* Description ...
* </p>
*
* @throws java.io.IOException
* @throws IllegalStateException DOCUMENT ME!
*
* @see org.geotools.data.FeatureReader#close()
*/
public void close() {
if (reader == null) {
return;
}
reader.close();
reader = null;
schema = null;
}
}
|
FUNCATE/TerraMobile
|
sldparser/src/main/geotools/data/crs/ReprojectFeatureIterator.java
|
Java
|
apache-2.0
| 5,670 |
from django.conf.urls import url
from approvals import views
approval_list = views.ApprovalViewSet.as_view({
'get': 'list',
'post': 'create',
})
approval_detail = views.ApprovalViewSet.as_view({
'get': 'retrieve',
'patch': 'partial_update'
})
urlpatterns = [
url(r'^$', approval_list, name='list'),
url(r'^(?P<pk>[-\w]+)/$', approval_detail, name='detail'),
]
|
jnayak1/osf-meetings
|
meetings/approvals/urls.py
|
Python
|
apache-2.0
| 387 |
/*
* Copyright 2015 Dejan Djurovski
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.example.android.wearablemessageapiexample;
import android.app.Activity;
import android.content.DialogInterface;
import android.os.Bundle;
import android.widget.Toast;
import com.google.android.gms.common.ConnectionResult;
import com.google.android.gms.common.GooglePlayServicesUtil;
import com.google.android.gms.common.api.GoogleApiClient;
import com.google.android.gms.wearable.MessageApi;
import com.google.android.gms.wearable.MessageEvent;
import com.google.android.gms.wearable.Wearable;
import org.apache.http.NameValuePair;
import org.apache.http.client.HttpClient;
import org.apache.http.client.methods.HttpGet;
import org.apache.http.client.utils.URLEncodedUtils;
import org.apache.http.impl.client.DefaultHttpClient;
import org.apache.http.message.BasicNameValuePair;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
public class MobileActivity extends Activity {
private static final String BASE_URL = "http://battlebots-connect.cloudhub.io/addMovement";
private final String COMMAND_PATH = "/command";
private GoogleApiClient apiClient;
private MessageApi.MessageListener messageListener;
private String command;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.main_activity);
messageListener = messageListenerFactory();
apiClient = apiClientFactory();
}
@Override
protected void onResume() {
super.onResume();
// Check is Google Play Services available
int connectionResult = GooglePlayServicesUtil.isGooglePlayServicesAvailable(getApplicationContext());
if (connectionResult != ConnectionResult.SUCCESS) {
// Google Play Services is NOT available. Show appropriate error dialog
GooglePlayServicesUtil.showErrorDialogFragment(connectionResult, this, 0, new DialogInterface.OnCancelListener() {
@Override
public void onCancel(DialogInterface dialog) {
finish();
}
});
} else {
apiClient.connect();
}
}
@Override
protected void onPause() {
// Unregister Node and Message listeners, disconnect GoogleApiClient and disable buttons
Wearable.NodeApi.removeListener(apiClient, null);
Wearable.MessageApi.removeListener(apiClient, messageListener);
apiClient.disconnect();
super.onPause();
}
// Create MessageListener that receives messages sent from a wearable
private MessageApi.MessageListener messageListenerFactory(){
return new MessageApi.MessageListener() {
@Override
public void onMessageReceived(MessageEvent messageEvent) {
if (messageEvent.getPath().equals(COMMAND_PATH)) {
RobotCommand robotCommand = new RobotCommand(new String(messageEvent.getData()));
command = robotCommand.getCommand();
if(!command.isEmpty()) {
StringBuilder requestUrl = new StringBuilder(BASE_URL);
List<NameValuePair> params = new ArrayList<NameValuePair>();
params.add(new BasicNameValuePair("name",command));
params.add(new BasicNameValuePair("queue","1"));
String queryString = URLEncodedUtils.format(params, "utf-8");
requestUrl.append("?");
requestUrl.append(queryString);
HttpClient httpclient = new DefaultHttpClient();
try {
httpclient.execute(new HttpGet(requestUrl.toString()));
} catch (IOException e) {
e.printStackTrace();
}
}else{
//TODO: NO DETECTED COMMAND
}
}
}
};
}
// Create GoogleApiClient
private GoogleApiClient apiClientFactory(){
return new GoogleApiClient.Builder(getApplicationContext()).addConnectionCallbacks(new GoogleApiClient.ConnectionCallbacks() {
@Override
public void onConnected(Bundle bundle) {
// Register Node and Message listeners
Wearable.NodeApi.addListener(apiClient, null);
Wearable.MessageApi.addListener(apiClient, messageListener);
// If there is a connected node, get it's id that is used when sending messages
}
@Override
public void onConnectionSuspended(int i) {
}
}).addOnConnectionFailedListener(new GoogleApiClient.OnConnectionFailedListener() {
@Override
public void onConnectionFailed(ConnectionResult connectionResult) {
if (connectionResult.getErrorCode() == ConnectionResult.API_UNAVAILABLE)
Toast.makeText(getApplicationContext(), getString(R.string.wearable_api_unavailable), Toast.LENGTH_LONG).show();
}
}).addApi(Wearable.API).build();
}
}
|
mulesoft-labs/battlebots-android-wear-app
|
mobile/src/main/java/com/example/android/wearablemessageapiexample/MobileActivity.java
|
Java
|
apache-2.0
| 5,807 |
// Copyright (c) 2015 Alachisoft
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
using System;
using System.Collections.Generic;
using Enyim.Caching.Memcached.Results;
using Enyim.Caching.Memcached.Results.Extensions;
namespace Enyim.Caching.Memcached.Protocol.Binary
{
public class FlushOperation : BinaryOperation, IFlushOperation
{
public FlushOperation() { }
protected override BinaryRequest Build()
{
var request = new BinaryRequest(OpCode.Flush);
return request;
}
protected internal override IOperationResult ReadResponse(PooledSocket socket)
{
var response = new BinaryResponse();
var retval = response.Read(socket);
this.StatusCode = StatusCode;
var result = new BinaryOperationResult()
{
Success = retval,
StatusCode = this.StatusCode
};
result.PassOrFail(retval, "Failed to read response");
return result;
}
}
}
#region [ License information ]
/* ************************************************************
*
* Copyright (c) 2010 Attila Kisk�, enyim.com
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* ************************************************************/
#endregion
|
Teino1978-Corp/NCache
|
Integration/MemCached/Clients/Enyim.Caching/Src/Enyim.Caching/Memcached/Protocol/Binary/FlushOperation.cs
|
C#
|
apache-2.0
| 2,237 |
# CONTRIBUTING
TODO: how do we want to guide community contributors?
For now, if you're interested in contributing to SHARE/Trove, feel free to
[open an issue on github](https://github.com/CenterForOpenScience/SHARE/issues)
and start a conversation.
|
CenterForOpenScience/SHARE
|
CONTRIBUTING.md
|
Markdown
|
apache-2.0
| 252 |
/*
* Copyright (C) 2016 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.android.exoplayer2.decoder;
import com.google.android.exoplayer2.C;
import java.nio.ByteBuffer;
/**
* Holds input for a decoder.
*/
public class DecoderInputBuffer extends Buffer {
/**
* Disallows buffer replacement.
*/
public static final int BUFFER_REPLACEMENT_MODE_DISABLED = 0;
/**
* Allows buffer replacement using {@link ByteBuffer#allocate(int)}.
*/
public static final int BUFFER_REPLACEMENT_MODE_NORMAL = 1;
/**
* Allows buffer replacement using {@link ByteBuffer#allocateDirect(int)}.
*/
public static final int BUFFER_REPLACEMENT_MODE_DIRECT = 2;
/**
* {@link CryptoInfo} for encrypted data.
*/
public final CryptoInfo cryptoInfo;
/**
* The buffer's data, or {@code null} if no data has been set.
*/
public ByteBuffer data;
/**
* The time at which the sample should be presented.
*/
public long timeUs;
private final int bufferReplacementMode;
/**
* @param bufferReplacementMode Determines the behavior of {@link #ensureSpaceForWrite(int)}. One
* of {@link #BUFFER_REPLACEMENT_MODE_DISABLED}, {@link #BUFFER_REPLACEMENT_MODE_NORMAL} and
* {@link #BUFFER_REPLACEMENT_MODE_DIRECT}.
*/
public DecoderInputBuffer(int bufferReplacementMode) {
this.cryptoInfo = new CryptoInfo();
this.bufferReplacementMode = bufferReplacementMode;
}
/**
* Ensures that {@link #data} is large enough to accommodate a write of a given length at its
* current position.
* <p>
* If the capacity of {@link #data} is sufficient this method does nothing. If the capacity is
* insufficient then an attempt is made to replace {@link #data} with a new {@link ByteBuffer}
* whose capacity is sufficient. Data up to the current position is copied to the new buffer.
*
* @param length The length of the write that must be accommodated, in bytes.
* @throws IllegalStateException If there is insufficient capacity to accommodate the write and
* the buffer replacement mode of the holder is {@link #BUFFER_REPLACEMENT_MODE_DISABLED}.
*/
public void ensureSpaceForWrite(int length) throws IllegalStateException {
if (data == null) {
data = createReplacementByteBuffer(length);
return;
}
// Check whether the current buffer is sufficient.
int capacity = data.capacity();
int position = data.position();
int requiredCapacity = position + length;
if (capacity >= requiredCapacity) {
return;
}
// Instantiate a new buffer if possible.
ByteBuffer newData = createReplacementByteBuffer(requiredCapacity);
// Copy data up to the current position from the old buffer to the new one.
if (position > 0) {
data.position(0);
data.limit(position);
newData.put(data);
}
// Set the new buffer.
data = newData;
}
/**
* Returns whether the {@link C#BUFFER_FLAG_ENCRYPTED} flag is set.
*/
public final boolean isEncrypted() {
return getFlag(C.BUFFER_FLAG_ENCRYPTED);
}
/**
* Flips {@link #data} in preparation for being queued to a decoder.
*
* @see java.nio.Buffer#flip()
*/
public final void flip() {
data.flip();
}
@Override
public void clear() {
super.clear();
if (data != null) {
data.clear();
}
}
private ByteBuffer createReplacementByteBuffer(int requiredCapacity) {
if (bufferReplacementMode == BUFFER_REPLACEMENT_MODE_NORMAL) {
return ByteBuffer.allocate(requiredCapacity);
} else if (bufferReplacementMode == BUFFER_REPLACEMENT_MODE_DIRECT) {
return ByteBuffer.allocateDirect(requiredCapacity);
} else {
int currentCapacity = data == null ? 0 : data.capacity();
throw new IllegalStateException("Buffer too small (" + currentCapacity + " < "
+ requiredCapacity + ")");
}
}
}
|
Ood-Tsen/ExoPlayer
|
library/src/main/java/com/google/android/exoplayer2/decoder/DecoderInputBuffer.java
|
Java
|
apache-2.0
| 4,446 |
# generated from catkin/cmake/template/pkgConfig.cmake.in
# append elements to a list and remove existing duplicates from the list
# copied from catkin/cmake/list_append_deduplicate.cmake to keep pkgConfig
# self contained
macro(_list_append_deduplicate listname)
if(NOT "${ARGN}" STREQUAL "")
if(${listname})
list(REMOVE_ITEM ${listname} ${ARGN})
endif()
list(APPEND ${listname} ${ARGN})
endif()
endmacro()
# append elements to a list if they are not already in the list
# copied from catkin/cmake/list_append_unique.cmake to keep pkgConfig
# self contained
macro(_list_append_unique listname)
foreach(_item ${ARGN})
list(FIND ${listname} ${_item} _index)
if(_index EQUAL -1)
list(APPEND ${listname} ${_item})
endif()
endforeach()
endmacro()
# pack a list of libraries with optional build configuration keywords
# copied from catkin/cmake/catkin_libraries.cmake to keep pkgConfig
# self contained
macro(_pack_libraries_with_build_configuration VAR)
set(${VAR} "")
set(_argn ${ARGN})
list(LENGTH _argn _count)
set(_index 0)
while(${_index} LESS ${_count})
list(GET _argn ${_index} lib)
if("${lib}" MATCHES "^(debug|optimized|general)$")
math(EXPR _index "${_index} + 1")
if(${_index} EQUAL ${_count})
message(FATAL_ERROR "_pack_libraries_with_build_configuration() the list of libraries '${ARGN}' ends with '${lib}' which is a build configuration keyword and must be followed by a library")
endif()
list(GET _argn ${_index} library)
list(APPEND ${VAR} "${lib}${CATKIN_BUILD_CONFIGURATION_KEYWORD_SEPARATOR}${library}")
else()
list(APPEND ${VAR} "${lib}")
endif()
math(EXPR _index "${_index} + 1")
endwhile()
endmacro()
# unpack a list of libraries with optional build configuration keyword prefixes
# copied from catkin/cmake/catkin_libraries.cmake to keep pkgConfig
# self contained
macro(_unpack_libraries_with_build_configuration VAR)
set(${VAR} "")
foreach(lib ${ARGN})
string(REGEX REPLACE "^(debug|optimized|general)${CATKIN_BUILD_CONFIGURATION_KEYWORD_SEPARATOR}(.+)$" "\\1;\\2" lib "${lib}")
list(APPEND ${VAR} "${lib}")
endforeach()
endmacro()
if(denso_gui_CONFIG_INCLUDED)
return()
endif()
set(denso_gui_CONFIG_INCLUDED TRUE)
# set variables for source/devel/install prefixes
if("FALSE" STREQUAL "TRUE")
set(denso_gui_SOURCE_PREFIX /home/mike/catkin_ws/src/denso_gui)
set(denso_gui_DEVEL_PREFIX /home/mike/catkin_ws/devel)
set(denso_gui_INSTALL_PREFIX "")
set(denso_gui_PREFIX ${denso_gui_DEVEL_PREFIX})
else()
set(denso_gui_SOURCE_PREFIX "")
set(denso_gui_DEVEL_PREFIX "")
set(denso_gui_INSTALL_PREFIX /home/mike/catkin_ws/install)
set(denso_gui_PREFIX ${denso_gui_INSTALL_PREFIX})
endif()
# warn when using a deprecated package
if(NOT "" STREQUAL "")
set(_msg "WARNING: package 'denso_gui' is deprecated")
# append custom deprecation text if available
if(NOT "" STREQUAL "TRUE")
set(_msg "${_msg} ()")
endif()
message("${_msg}")
endif()
# flag project as catkin-based to distinguish if a find_package()-ed project is a catkin project
set(denso_gui_FOUND_CATKIN_PROJECT TRUE)
if(NOT " " STREQUAL " ")
set(denso_gui_INCLUDE_DIRS "")
set(_include_dirs "")
foreach(idir ${_include_dirs})
if(IS_ABSOLUTE ${idir} AND IS_DIRECTORY ${idir})
set(include ${idir})
elseif("${idir} " STREQUAL "include ")
get_filename_component(include "${denso_gui_DIR}/../../../include" ABSOLUTE)
if(NOT IS_DIRECTORY ${include})
message(FATAL_ERROR "Project 'denso_gui' specifies '${idir}' as an include dir, which is not found. It does not exist in '${include}'. Ask the maintainer 'Michael Hosmar <[email protected]>' to fix it.")
endif()
else()
message(FATAL_ERROR "Project 'denso_gui' specifies '${idir}' as an include dir, which is not found. It does neither exist as an absolute directory nor in '/home/mike/catkin_ws/install/${idir}'. Ask the maintainer 'Michael Hosmar <[email protected]>' to fix it.")
endif()
_list_append_unique(denso_gui_INCLUDE_DIRS ${include})
endforeach()
endif()
set(libraries "bcap_client;bcap_server")
foreach(library ${libraries})
# keep build configuration keywords, target names and absolute libraries as-is
if("${library}" MATCHES "^(debug|optimized|general)$")
list(APPEND denso_gui_LIBRARIES ${library})
elseif(TARGET ${library})
list(APPEND denso_gui_LIBRARIES ${library})
elseif(IS_ABSOLUTE ${library})
list(APPEND denso_gui_LIBRARIES ${library})
else()
set(lib_path "")
set(lib "${library}-NOTFOUND")
# since the path where the library is found is returned we have to iterate over the paths manually
foreach(path /home/mike/catkin_ws/install/lib;/home/mike/catkin_ws/devel/lib;/opt/ros/indigo/lib)
find_library(lib ${library}
PATHS ${path}
NO_DEFAULT_PATH NO_CMAKE_FIND_ROOT_PATH)
if(lib)
set(lib_path ${path})
break()
endif()
endforeach()
if(lib)
_list_append_unique(denso_gui_LIBRARY_DIRS ${lib_path})
list(APPEND denso_gui_LIBRARIES ${lib})
else()
# as a fall back for non-catkin libraries try to search globally
find_library(lib ${library})
if(NOT lib)
message(FATAL_ERROR "Project '${PROJECT_NAME}' tried to find library '${library}'. The library is neither a target nor built/installed properly. Did you compile project 'denso_gui'? Did you find_package() it before the subdirectory containing its code is included?")
endif()
list(APPEND denso_gui_LIBRARIES ${lib})
endif()
endif()
endforeach()
set(denso_gui_EXPORTED_TARGETS "")
# create dummy targets for exported code generation targets to make life of users easier
foreach(t ${denso_gui_EXPORTED_TARGETS})
if(NOT TARGET ${t})
add_custom_target(${t})
endif()
endforeach()
set(depends "std_srvs")
foreach(depend ${depends})
string(REPLACE " " ";" depend_list ${depend})
# the package name of the dependency must be kept in a unique variable so that it is not overwritten in recursive calls
list(GET depend_list 0 denso_gui_dep)
list(LENGTH depend_list count)
if(${count} EQUAL 1)
# simple dependencies must only be find_package()-ed once
if(NOT ${denso_gui_dep}_FOUND)
find_package(${denso_gui_dep} REQUIRED)
endif()
else()
# dependencies with components must be find_package()-ed again
list(REMOVE_AT depend_list 0)
find_package(${denso_gui_dep} REQUIRED ${depend_list})
endif()
_list_append_unique(denso_gui_INCLUDE_DIRS ${${denso_gui_dep}_INCLUDE_DIRS})
# merge build configuration keywords with library names to correctly deduplicate
_pack_libraries_with_build_configuration(denso_gui_LIBRARIES ${denso_gui_LIBRARIES})
_pack_libraries_with_build_configuration(_libraries ${${denso_gui_dep}_LIBRARIES})
_list_append_deduplicate(denso_gui_LIBRARIES ${_libraries})
# undo build configuration keyword merging after deduplication
_unpack_libraries_with_build_configuration(denso_gui_LIBRARIES ${denso_gui_LIBRARIES})
_list_append_unique(denso_gui_LIBRARY_DIRS ${${denso_gui_dep}_LIBRARY_DIRS})
list(APPEND denso_gui_EXPORTED_TARGETS ${${denso_gui_dep}_EXPORTED_TARGETS})
endforeach()
set(pkg_cfg_extras "")
foreach(extra ${pkg_cfg_extras})
if(NOT IS_ABSOLUTE ${extra})
set(extra ${denso_gui_DIR}/${extra})
endif()
include(${extra})
endforeach()
|
mikewrock/phd_backup_full
|
install/share/denso_gui/cmake/denso_guiConfig.cmake
|
CMake
|
apache-2.0
| 7,433 |
package com.sqli.echallenge.jformation.util;
import java.util.Random;
public class SqliRandomGenerator {
private static final String CHAR_LIST = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890";
private static final String NUM_LIST = "1234567890123456789012345678901234567890123456789012345678901234567890";
private static final int RANDOM_STRING_LENGTH = 10;
private static final int RANDOM_NUMBER_LENGTH = 20;
public String generateRandomString() {
StringBuffer randStr = new StringBuffer();
for (int i = 0; i < RANDOM_STRING_LENGTH; i++) {
int number = getRandomNumber();
char ch = CHAR_LIST.charAt(number);
randStr.append(ch);
}
return randStr.toString();
}
public String generateRandomNumber() {
StringBuffer randStr = new StringBuffer();
for (int i = 0; i < RANDOM_NUMBER_LENGTH; i++) {
int number = getRandomNumber();
char ch = NUM_LIST.charAt(number);
randStr.append(ch);
}
return randStr.toString();
}
public String generateRandomString(int length) {
StringBuffer randStr = new StringBuffer();
for (int i = 0; i < length; i++) {
int number = getRandomNumber();
char ch = CHAR_LIST.charAt(number);
randStr.append(ch);
}
return randStr.toString();
}
private int getRandomNumber() {
int randomInt = 0;
Random randomGenerator = new Random();
randomInt = randomGenerator.nextInt(CHAR_LIST.length());
if (randomInt - 1 == -1) {
return randomInt;
} else {
return randomInt - 1;
}
}
}
|
amiral2020/SQLiEchallengeJFormation
|
SQLiEchallengeJFormation/src/main/java/com/sqli/echallenge/jformation/util/SqliRandomGenerator.java
|
Java
|
apache-2.0
| 1,494 |
name "groovy"
maintainer "Kyle Allan"
maintainer_email "[email protected]"
license "Apache 2.0"
description "Installs/Configures groovy"
long_description IO.read(File.join(File.dirname(__FILE__), 'README.md'))
version "0.0.1"
depends "java"
depends "ark"
|
RiotGamesCookbooks/groovy-cookbook
|
metadata.rb
|
Ruby
|
apache-2.0
| 300 |
package com.ztiany.register;
import com.ztiany.register.dao.UserDao;
import com.ztiany.register.dao.impl.UserDaoImpl;
import com.ztiany.register.domain.User;
import org.junit.Test;
import java.util.Date;
import java.util.ResourceBundle;
/**
* @author Ztiany
* Email [email protected]
* Date 18.4.22 21:59
*/
public class TestDao {
@Test
public void testSave() {
UserDao userDao = new UserDaoImpl();
User user = new User();
user.setUsername("zhangxy");
user.setPassword("123456");
user.setEmail("[email protected]");
user.setBirthday(new Date());
userDao.save(user);
}
@Test
public void testNewDao() {
ResourceBundle rb = ResourceBundle.getBundle("dao");
System.out.println(rb.getString("dao"));
}
}
|
Ztiany/Repository
|
JavaEE/MVC-Sample-Register/src/test/java/com/ztiany/register/TestDao.java
|
Java
|
apache-2.0
| 803 |
package com.dax.daxtop.res;
import com.dax.daxtop.interfaces.NetworkProfile;
import java.awt.Frame;
import java.awt.Image;
import java.awt.Toolkit;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.net.URL;
import javax.swing.ImageIcon;
/**
* @author Dax Booysen
*
* ResourceLoader to load resources
*/
public abstract class ResourceLoader extends Frame
{
/** Load image from file, use wait for secure load completion */
public Image LoadImage(String rootDirectory, String fileName)
{
try
{
String path = (rootDirectory.isEmpty() ? "images/" : rootDirectory) + fileName;
// load resource
URL myurl = this.getClass().getResource(path);
// load normally
Toolkit tk = this.getToolkit();
return new ImageIcon(tk.getImage(myurl)).getImage();
}
catch(Exception e)
{
e.printStackTrace();
}
return null;
}
/** Load audio from file, use wait for secure load completion */
public URL LoadFile(Class<?> Class, String rootDirectory, String fileName)
{
try
{
String path = (rootDirectory.isEmpty() ? "audio/" : rootDirectory) + fileName;
URL myurl = Class.getResource(path);
return myurl;
}
catch(Exception e)
{
e.printStackTrace();
}
return null;
}
/** Use this to load data files you wish to store, returns null if file does not exist */
public static FileReader OpenLocalDataFileReader(NetworkProfile profile, String filename)
{
FileReader fr = null;
try
{
fr = new FileReader("./networks/" + profile.GetNetworkId() + "_" + filename);
}
catch(FileNotFoundException fnfe)
{
return null;
}
return fr;
}
}
|
daxfrost/daxtop
|
daxtop/trunk/dp-projects/Daxtop/src/com/dax/daxtop/res/ResourceLoader.java
|
Java
|
apache-2.0
| 1,925 |
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.camel.management;
import java.util.ArrayList;
import java.util.List;
import java.util.Set;
import javax.management.MBeanServer;
import javax.management.ObjectName;
import javax.management.openmbean.CompositeData;
import javax.management.openmbean.TabularData;
import org.apache.camel.Message;
import org.apache.camel.ValidationException;
import org.apache.camel.builder.RouteBuilder;
import org.apache.camel.spi.DataType;
import org.apache.camel.spi.Validator;
import org.junit.Test;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
public class ManagedValidatorRegistryTest extends ManagementTestSupport {
private static final Logger LOG = LoggerFactory.getLogger(ManagedValidatorRegistryTest.class);
@Test
public void testManageValidatorRegistry() throws Exception {
// JMX tests dont work well on AIX CI servers (hangs them)
if (isPlatform("aix")) {
return;
}
getMockEndpoint("mock:result").expectedMessageCount(1);
template.sendBody("direct:start", "Hello World");
assertMockEndpointsSatisfied();
// get the stats for the route
MBeanServer mbeanServer = getMBeanServer();
Set<ObjectName> set = mbeanServer.queryNames(new ObjectName("*:type=services,*"), null);
List<ObjectName> list = new ArrayList<>(set);
ObjectName on = null;
for (ObjectName name : list) {
if (name.getCanonicalName().contains("DefaultValidatorRegistry")) {
on = name;
break;
}
}
assertNotNull("Should have found ValidatorRegistry", on);
Integer max = (Integer) mbeanServer.getAttribute(on, "MaximumCacheSize");
assertEquals(1000, max.intValue());
Integer current = (Integer) mbeanServer.getAttribute(on, "Size");
assertEquals(3, current.intValue());
current = (Integer) mbeanServer.getAttribute(on, "StaticSize");
assertEquals(0, current.intValue());
current = (Integer) mbeanServer.getAttribute(on, "DynamicSize");
assertEquals(3, current.intValue());
String source = (String) mbeanServer.getAttribute(on, "Source");
assertTrue(source.startsWith("ValidatorRegistry"));
assertTrue(source.endsWith("capacity: 1000"));
TabularData data = (TabularData) mbeanServer.invoke(on, "listValidators", null, null);
for (Object row : data.values()) {
CompositeData composite = (CompositeData)row;
String type = (String)composite.get("type");
String description = (String)composite.get("description");
boolean isStatic = (boolean)composite.get("static");
boolean isDynamic = (boolean)composite.get("dynamic");
LOG.info("[{}][{}][{}][{}]", type, isStatic, isDynamic, description);
if (description.startsWith("ProcessorValidator")) {
if (description.contains("direct://transformer")) {
assertEquals("xml:foo", type);
} else if (description.contains("validate(simple{${body}} is not null")) {
assertEquals("json:test", type);
} else {
fail("Unexpected validator:" + description);
}
} else if (description.startsWith("MyValidator")) {
assertEquals("custom", type);
} else {
fail("Unexpected validator:" + description);
}
}
assertEquals(3, data.size());
}
@Override
protected RouteBuilder createRouteBuilder() throws Exception {
return new RouteBuilder() {
@Override
public void configure() throws Exception {
validator()
.type("xml:foo")
.withUri("direct:transformer");
validator()
.type("json:test")
.withExpression(body().isNotNull());
validator()
.type("custom")
.withJava(MyValidator.class);
from("direct:start").to("mock:result");
}
};
}
public static class MyValidator extends Validator {
@Override
public void validate(Message message, DataType type) throws ValidationException {
// empty
}
}
}
|
davidkarlsen/camel
|
core/camel-management-impl/src/test/java/org/apache/camel/management/ManagedValidatorRegistryTest.java
|
Java
|
apache-2.0
| 5,217 |
/**
* Copyright (C) 2014 Esup Portail http://www.esup-portail.org
* @Author (C) 2012 Julien Gribonvald <[email protected]>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.esupportail.publisher.service.factories;
import java.util.List;
import javax.servlet.http.HttpServletRequest;
import org.esupportail.publisher.domain.AbstractClassification;
import org.esupportail.publisher.domain.AbstractItem;
import org.esupportail.publisher.domain.LinkedFileItem;
import org.esupportail.publisher.domain.Subscriber;
import org.esupportail.publisher.web.rest.vo.ItemVO;
/**
* Created by jgribonvald on 03/06/16.
*/
public interface ItemVOFactory {
ItemVO from(final AbstractItem item, final List<AbstractClassification> classifications, final List<Subscriber> subscribers,
final List<LinkedFileItem> linkedFiles, final HttpServletRequest request);
}
|
GIP-RECIA/esup-publisher-ui
|
src/main/java/org/esupportail/publisher/service/factories/ItemVOFactory.java
|
Java
|
apache-2.0
| 1,413 |
package org.jtwig.render.expression.calculator.operation.binary.calculators;
import org.jtwig.render.RenderRequest;
import org.junit.Test;
import java.math.BigDecimal;
import static org.junit.Assert.assertSame;
import static org.mockito.Mockito.*;
public class SubtractOperationCalculatorTest {
private SubtractOperationCalculator underTest = new SubtractOperationCalculator();
@Test
public void calculate() throws Exception {
RenderRequest request = mock(RenderRequest.class, RETURNS_DEEP_STUBS);
BigDecimal left = mock(BigDecimal.class);
BigDecimal right = mock(BigDecimal.class);
BigDecimal expected = mock(BigDecimal.class);
when(left.subtract(right)).thenReturn(expected);
BigDecimal result = underTest.calculate(request, left, right);
assertSame(expected, result);
}
}
|
jtwig/jtwig-core
|
src/test/java/org/jtwig/render/expression/calculator/operation/binary/calculators/SubtractOperationCalculatorTest.java
|
Java
|
apache-2.0
| 854 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.