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
|
|---|---|---|---|---|---|
# -*- encoding : utf-8 -*-
class Top4R::Client
include Top4R::ClassUtilMixin
@@no_login_required_methods = {
:user => {
:info => 'taobao.user.get',
:multi_info => 'taobao.users.get'
},
:trade => {},
:area => {
:list => 'taobao.areas.get'
},
:logistic_company => {
:list => 'taobao.logistics.companies.get'
},
:shop => {
:cats_list => 'taobao.sellercats.list.get',
:shop_info => 'taobao.shop.get'
},
:item => {
:items_list => 'taobao.items.list.get',
:item => 'taobao.item.get'
},
:taobaoke_item => {
:taobaoke_items_get => 'taobao.taobaoke.items.get'
}
}
end
require 'top4r/client/base'
require 'top4r/client/user'
require 'top4r/client/shipping'
require 'top4r/client/trade'
require 'top4r/client/suite'
require 'top4r/client/item'
require 'top4r/client/shop'
require 'top4r/client/taobaokeitem'
|
biti/top4r
|
lib/top4r/client.rb
|
Ruby
|
mit
| 920
|
/**
@module ember-ui-components
*/
import Component from '@ember/component';
import ClickOutsideMixin from 'ember-ui-components/mixins/click-outside';
import layout from '../templates/components/uic-context-menu-container';
import setPosition from 'ember-ui-components/utils/set-position';
import getMousePosition from 'ember-ui-components/utils/get-mouse-position';
import { get } from '@ember/object';
import { alias } from '@ember/object/computed';
import { inject as service } from '@ember/service';
/**
@class ContextMenuContainerComponent
@namespace Components
*/
export default Component.extend(ClickOutsideMixin, {
layout,
/**
Injected `contextMenu` service
@property contextMenuService
@type {Object}
@private
*/
contextMenuService: service('context-menu'),
/**
@property tagName
@type {String}
@private
@default 'menu'
*/
tagName: 'menu',
/**
@property classNames
@type {Array}
@private
@default `['uic-context-menu-container', 'uic-menu-container']`
*/
classNames: ['uic-context-menu-container', 'uic-menu-container'],
/**
@property classNameBindings
@type {Array}
@private
@default `['hideOutline:no-outline']`
*/
classNameBindings: ['hideOutline:no-outline'],
/**
@property attributeBindings
@type {Array}
@private
@default `['tabindex']`
*/
attributeBindings: ['tabindex'],
/**
@property tabindex
@type {Integer}
@private
@default `1`
*/
tabindex: 1,
/**
If this property is true the element will be given the `no-outline` css class
which will hide the outline that an element is given when it is focused.
@property hideOutline
@type {Boolean}
@private
@default `true`
*/
hideOutline: true,
/**
@property contextMenuParams
@type {Object}
@private
*/
contextMenuParams: alias('contextMenuService.contextMenuParams'),
/**
## setPosition
Set the left/top css properties of an element.
`element` should be a reference to an HTML element. Either a string selector
that can be used with jQuery, or a jQuery selection object.
If `position` is not specified, then the current mouse position will be used.
`position` should be an Ember.Object with `x` and `y` properties.
Both `x` and `y` should be numbers
@method setPosition
@param {String|Object} element
@param {Object} position
*/
setPosition,
/**
@method handleClickOutside
@private
*/
handleClickOutside() {
get(this, 'closeContextMenu')();
},
/**
@method didInsertElement
@private
*/
didInsertElement() {
this._super(...arguments);
this.setPosition(this.$(), getMousePosition(this.get('contextMenuParams.event')));
this.$().focus();
},
/**
@event keyDown
@param {Object} event
@private
*/
keyDown(event) {
switch(event.keyCode) {
case 13: // enter
get(this, 'closeContextMenu')();
break;
case 27: // escape
get(this, 'closeContextMenu')();
break;
}
},
click() {
get(this, 'closeContextMenu')();
}
});
|
lozjackson/ember-ui-components
|
addon/components/uic-context-menu-container.js
|
JavaScript
|
mit
| 3,147
|
---
title: Class Reflection Extensions
---
Classes in PHP can expose "magic" properties and methods decided in run-time using class methods like `__get`, `__set`, and `__call`. Because PHPStan is all about static analysis (testing code for errors without running it), it has to know about those properties and methods beforehand.
When PHPStan stumbles upon a property or a method that is unknown to built-in class reflection, it iterates over all registered class reflection extensions until it finds one that defines the property or method.
The implementation is all about applying the [core concepts](/developing-extensions/core-concepts) so check out that guide first and then continue here.
Properties class reflection extensions
---------------------
To describe magic properties from `__get` and `__set` methods, an extension must implement the following interface:
```php
namespace PHPStan\Reflection;
interface PropertiesClassReflectionExtension
{
public function hasProperty(ClassReflection $classReflection, string $propertyName): bool;
public function getProperty(ClassReflection $classReflection, string $propertyName): PropertyReflection;
}
```
Most likely you will also have to create a new class implementing the [`PropertyReflection`](https://github.com/phpstan/phpstan-src/blob/master/src/Reflection/PropertyReflection.php) interface:
```php
namespace PHPStan\Reflection;
use PHPStan\TrinaryLogic;
use PHPStan\Type\Type;
interface PropertyReflection
{
public function getDeclaringClass(): ClassReflection;
public function isStatic(): bool;
public function isPrivate(): bool;
public function isPublic(): bool;
public function getDocComment(): ?string;
public function getReadableType(): Type;
public function getWritableType(): Type;
public function canChangeTypeAfterAssignment(): bool;
public function isReadable(): bool;
public function isWritable(): bool;
public function isDeprecated(): TrinaryLogic;
public function getDeprecatedDescription(): ?string;
public function isInternal(): TrinaryLogic;
}
```
This is how you register the extension in the [configuration file](/config-reference):
```yaml
services:
-
class: App\PHPStan\PropertiesFromAnnotationsClassReflectionExtension
tags:
- phpstan.broker.propertiesClassReflectionExtension
```
Methods class reflection extensions
---------------------
To describe magic methods from the `__call` method, an extension must implement the [`MethodsClassReflectionExtension`](https://github.com/phpstan/phpstan-src/blob/master/src/Reflection/MethodsClassReflectionExtension.php) interface:
```php
namespace PHPStan\Reflection;
interface MethodsClassReflectionExtension
{
public function hasMethod(ClassReflection $classReflection, string $methodName): bool;
public function getMethod(ClassReflection $classReflection, string $methodName): MethodReflection;
}
```
Most likely you will also have to implement a new class implementing the [`MethodReflection`](https://github.com/phpstan/phpstan-src/blob/master/src/Reflection/MethodReflection.php) interface:
```php
namespace PHPStan\Reflection;
use PHPStan\TrinaryLogic;
use PHPStan\Type\Type;
interface MethodReflection
{
public function getDeclaringClass(): ClassReflection;
public function isStatic(): bool;
public function isPrivate(): bool;
public function isPublic(): bool;
public function getDocComment(): ?string;
public function getName(): string;
public function getPrototype(): ClassMemberReflection;
/**
* @return \PHPStan\Reflection\ParametersAcceptor[]
*/
public function getVariants(): array;
public function isDeprecated(): TrinaryLogic;
public function getDeprecatedDescription(): ?string;
public function isFinal(): TrinaryLogic;
public function isInternal(): TrinaryLogic;
public function getThrowType(): ?Type;
public function hasSideEffects(): TrinaryLogic;
}
```
This is how you register the extension in the [configuration file](/config-reference):
```yaml
services:
-
class: App\PHPStan\EnumMethodsClassReflectionExtension
tags:
- phpstan.broker.methodsClassReflectionExtension
```
|
phpstan/phpstan
|
website/src/developing-extensions/class-reflection-extensions.md
|
Markdown
|
mit
| 4,129
|
from pandac.PandaModules import *
from toontown.toonbase.ToonBaseGlobal import *
from direct.directnotify import DirectNotifyGlobal
from direct.fsm import StateData
from direct.showbase.PythonUtil import PriorityCallbacks
from toontown.safezone import PublicWalk
from toontown.launcher import DownloadForceAcknowledge
import TrialerForceAcknowledge
import ZoneUtil
from toontown.friends import FriendsListManager
from toontown.toonbase import ToontownGlobals
from toontown.toon.Toon import teleportDebug
from toontown.estate import HouseGlobals
from toontown.toonbase import TTLocalizer
from otp.otpbase import OTPLocalizer
from otp.avatar import Emote
from otp.avatar.Avatar import teleportNotify
from direct.task import Task
import QuietZoneState
from toontown.distributed import ToontownDistrictStats
class Place(StateData.StateData, FriendsListManager.FriendsListManager):
notify = DirectNotifyGlobal.directNotify.newCategory('Place')
def __init__(self, loader, doneEvent):
StateData.StateData.__init__(self, doneEvent)
FriendsListManager.FriendsListManager.__init__(self)
self.loader = loader
self.dfaDoneEvent = 'dfaDoneEvent'
self.trialerFADoneEvent = 'trialerFADoneEvent'
self.zoneId = None
self.trialerFA = None
self._tiToken = None
self._leftQuietZoneLocalCallbacks = PriorityCallbacks()
self._leftQuietZoneSubframeCall = None
self._setZoneCompleteLocalCallbacks = PriorityCallbacks()
self._setZoneCompleteSubframeCall = None
return
def load(self):
StateData.StateData.load(self)
FriendsListManager.FriendsListManager.load(self)
self.walkDoneEvent = 'walkDone'
self.walkStateData = PublicWalk.PublicWalk(self.fsm, self.walkDoneEvent)
self.walkStateData.load()
self._tempFSM = self.fsm
def unload(self):
StateData.StateData.unload(self)
FriendsListManager.FriendsListManager.unload(self)
self.notify.info('Unloading Place (%s). Fsm in %s' % (self.zoneId, self._tempFSM.getCurrentState().getName()))
if self._leftQuietZoneSubframeCall:
self._leftQuietZoneSubframeCall.cleanup()
self._leftQuietZoneSubframeCall = None
if self._setZoneCompleteSubframeCall:
self._setZoneCompleteSubframeCall.cleanup()
self._setZoneCompleteSubframeCall = None
self._leftQuietZoneLocalCallbacks = None
self._setZoneCompleteLocalCallbacks = None
del self._tempFSM
taskMgr.remove('goHomeFailed')
del self.walkDoneEvent
self.walkStateData.unload()
del self.walkStateData
del self.loader
if self.trialerFA:
self.trialerFA.exit()
del self.trialerFA
return
def _getQZState(self):
if hasattr(base, 'cr') and hasattr(base.cr, 'playGame'):
if hasattr(base.cr.playGame, 'quietZoneStateData') and base.cr.playGame.quietZoneStateData:
return base.cr.playGame.quietZoneStateData
return None
def addLeftQuietZoneCallback(self, callback, priority = None):
qzsd = self._getQZState()
if qzsd:
return qzsd.addLeftQuietZoneCallback(callback, priority)
else:
token = self._leftQuietZoneLocalCallbacks.add(callback, priority=priority)
if not self._leftQuietZoneSubframeCall:
self._leftQuietZoneSubframeCall = SubframeCall(self._doLeftQuietZoneCallbacks, taskMgr.getCurrentTask().getPriority() - 1)
return token
def removeLeftQuietZoneCallback(self, token):
if token is not None:
if token in self._leftQuietZoneLocalCallbacks:
self._leftQuietZoneLocalCallbacks.remove(token)
qzsd = self._getQZState()
if qzsd:
qzsd.removeLeftQuietZoneCallback(token)
return
def _doLeftQuietZoneCallbacks(self):
self._leftQuietZoneLocalCallbacks()
self._leftQuietZoneLocalCallbacks.clear()
self._leftQuietZoneSubframeCall = None
return
def addSetZoneCompleteCallback(self, callback, priority = None):
qzsd = self._getQZState()
if qzsd:
return qzsd.addSetZoneCompleteCallback(callback, priority)
else:
token = self._setZoneCompleteLocalCallbacks.add(callback, priority=priority)
if not self._setZoneCompleteSubframeCall:
self._setZoneCompleteSubframeCall = SubframeCall(self._doSetZoneCompleteLocalCallbacks, taskMgr.getCurrentTask().getPriority() - 1)
return token
def removeSetZoneCompleteCallback(self, token):
if token is not None:
if token in self._setZoneCompleteLocalCallbacks:
self._setZoneCompleteLocalCallbacks.remove(token)
qzsd = self._getQZState()
if qzsd:
qzsd.removeSetZoneCompleteCallback(token)
return
def _doSetZoneCompleteLocalCallbacks(self):
self._setZoneCompleteSubframeCall = None
localCallbacks = self._setZoneCompleteLocalCallbacks
self._setZoneCompleteLocalCallbacks()
localCallbacks.clear()
return
def setState(self, state):
if hasattr(self, 'fsm'):
curState = self.fsm.getName()
if state == 'pet' or curState == 'pet':
self.preserveFriendsList()
self.fsm.request(state)
def getState(self):
if hasattr(self, 'fsm'):
curState = self.fsm.getCurrentState().getName()
return curState
def getZoneId(self):
return self.zoneId
def getTaskZoneId(self):
return self.getZoneId()
def isPeriodTimerEffective(self):
return 1
def handleTeleportQuery(self, fromAvatar, toAvatar):
if base.config.GetBool('want-tptrack', False):
if toAvatar == localAvatar:
toAvatar.doTeleportResponse(fromAvatar, toAvatar, toAvatar.doId, 1, toAvatar.defaultShard, base.cr.playGame.getPlaceId(), self.getZoneId(), fromAvatar.doId)
else:
self.notify.warning('handleTeleportQuery toAvatar.doId != localAvatar.doId' % (toAvatar.doId, localAvatar.doId))
else:
fromAvatar.d_teleportResponse(toAvatar.doId, 1, toAvatar.defaultShard, base.cr.playGame.getPlaceId(), self.getZoneId())
def enablePeriodTimer(self):
if self.isPeriodTimerEffective():
if base.cr.periodTimerExpired:
taskMgr.doMethodLater(5, self.redoPeriodTimer, 'redoPeriodTimer')
self.accept('periodTimerExpired', self.periodTimerExpired)
def disablePeriodTimer(self):
taskMgr.remove('redoPeriodTimer')
self.ignore('periodTimerExpired')
def redoPeriodTimer(self, task):
messenger.send('periodTimerExpired')
return Task.done
def periodTimerExpired(self):
self.fsm.request('final')
if base.localAvatar.book.isEntered:
base.localAvatar.book.exit()
base.localAvatar.b_setAnimState('CloseBook', 1, callback=self.__handlePeriodTimerBookClose)
else:
base.localAvatar.b_setAnimState('TeleportOut', 1, self.__handlePeriodTimerExitTeleport)
def exitPeriodTimerExpired(self):
pass
def __handlePeriodTimerBookClose(self):
base.localAvatar.b_setAnimState('TeleportOut', 1, self.__handlePeriodTimerExitTeleport)
def __handlePeriodTimerExitTeleport(self):
base.cr.loginFSM.request('periodTimeout')
def detectedPhoneCollision(self):
self.fsm.request('phone')
def detectedFishingCollision(self):
self.fsm.request('fishing')
def enterStart(self):
pass
def exitStart(self):
pass
def enterFinal(self):
pass
def exitFinal(self):
pass
def enterWalk(self, teleportIn = 0):
self.enterFLM()
self.walkStateData.enter()
if teleportIn == 0:
self.walkStateData.fsm.request('walking')
self.acceptOnce(self.walkDoneEvent, self.handleWalkDone)
if base.cr.productName in ['DisneyOnline-US', 'ES'] and not base.cr.isPaid() and base.localAvatar.tutorialAck:
base.localAvatar.chatMgr.obscure(0, 0)
base.localAvatar.chatMgr.normalButton.show()
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.questPage.acceptOnscreenHooks()
base.localAvatar.invPage.acceptOnscreenHooks()
base.localAvatar.questMap.acceptOnscreenHooks()
self.walkStateData.fsm.request('walking')
self.enablePeriodTimer()
def exitWalk(self):
self.exitFLM()
if base.cr.productName in ['DisneyOnline-US', 'ES'] and not base.cr.isPaid() and base.localAvatar.tutorialAck and not base.cr.whiteListChatEnabled:
base.localAvatar.chatMgr.obscure(1, 0)
self.disablePeriodTimer()
messenger.send('wakeup')
self.walkStateData.exit()
self.ignore(self.walkDoneEvent)
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
if base.cr.playGame.hood != None:
base.cr.playGame.hood.hideTitleText()
base.localAvatar.questPage.hideQuestsOnscreen()
base.localAvatar.questPage.ignoreOnscreenHooks()
base.localAvatar.invPage.ignoreOnscreenHooks()
base.localAvatar.invPage.hideInventoryOnscreen()
base.localAvatar.questMap.hide()
base.localAvatar.questMap.ignoreOnscreenHooks()
return
def handleWalkDone(self, doneStatus):
mode = doneStatus['mode']
if mode == 'StickerBook':
self.last = self.fsm.getCurrentState().getName()
self.fsm.request('stickerBook')
elif mode == 'Options':
self.last = self.fsm.getCurrentState().getName()
self.fsm.request('stickerBook', [base.localAvatar.optionsPage])
elif mode == 'Sit':
self.last = self.fsm.getCurrentState().getName()
self.fsm.request('sit')
else:
Place.notify.error('Invalid mode: %s' % mode)
def enterSit(self):
self.enterFLM()
base.localAvatar.laffMeter.start()
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.b_setAnimState('SitStart', 1)
self.accept('arrow_up', self.fsm.request, extraArgs=['walk'])
def exitSit(self):
self.exitFLM()
base.localAvatar.laffMeter.stop()
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
self.ignore('arrow_up')
def enterDrive(self):
self.enterFLM()
base.localAvatar.laffMeter.start()
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.b_setAnimState('SitStart', 1)
def exitDrive(self):
self.exitFLM()
base.localAvatar.laffMeter.stop()
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
def enterPush(self):
self.enterFLM()
base.localAvatar.laffMeter.start()
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.attachCamera()
base.localAvatar.startUpdateSmartCamera()
base.localAvatar.startPosHprBroadcast()
base.localAvatar.b_setAnimState('Push', 1)
def exitPush(self):
self.exitFLM()
base.localAvatar.laffMeter.stop()
base.localAvatar.setTeleportAvailable(0)
base.localAvatar.stopUpdateSmartCamera()
base.localAvatar.detachCamera()
base.localAvatar.stopPosHprBroadcast()
self.ignore('teleportQuery')
def enterStickerBook(self, page = None):
self.enterFLM()
base.localAvatar.laffMeter.start()
target = base.cr.doFind('DistributedTarget')
if target:
target.hideGui()
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
if page:
base.localAvatar.book.setPage(page)
base.localAvatar.b_setAnimState('OpenBook', 1, self.enterStickerBookGUI)
base.localAvatar.obscureMoveFurnitureButton(1)
def enterStickerBookGUI(self):
base.localAvatar.collisionsOn()
base.localAvatar.book.showButton()
base.localAvatar.book.enter()
base.localAvatar.setGuiConflict(1)
base.localAvatar.startSleepWatch(self.__handleFallingAsleep)
self.accept('bookDone', self.__handleBook)
base.localAvatar.b_setAnimState('ReadBook', 1)
self.enablePeriodTimer()
def __handleFallingAsleep(self, task):
base.localAvatar.book.exit()
base.localAvatar.b_setAnimState('CloseBook', 1, callback=self.__handleFallingAsleepBookClose)
return Task.done
def __handleFallingAsleepBookClose(self):
if hasattr(self, 'fsm'):
self.fsm.request('walk')
base.localAvatar.forceGotoSleep()
def exitStickerBook(self):
base.localAvatar.stopSleepWatch()
self.disablePeriodTimer()
self.exitFLM()
base.localAvatar.laffMeter.stop()
base.localAvatar.setGuiConflict(0)
base.localAvatar.book.exit()
base.localAvatar.book.hideButton()
base.localAvatar.collisionsOff()
self.ignore('bookDone')
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
base.localAvatar.obscureMoveFurnitureButton(-1)
target = base.cr.doFind('DistributedTarget')
if target:
target.showGui()
def __handleBook(self):
base.localAvatar.stopSleepWatch()
base.localAvatar.book.exit()
bookStatus = base.localAvatar.book.getDoneStatus()
if bookStatus['mode'] == 'close':
base.localAvatar.b_setAnimState('CloseBook', 1, callback=self.handleBookClose)
elif bookStatus['mode'] == 'teleport':
zoneId = bookStatus['hood']
base.localAvatar.collisionsOff()
base.localAvatar.b_setAnimState('CloseBook', 1, callback=self.handleBookCloseTeleport, extraArgs=[zoneId, zoneId])
elif bookStatus['mode'] == 'exit':
self.exitTo = bookStatus.get('exitTo')
base.localAvatar.collisionsOff()
base.localAvatar.b_setAnimState('CloseBook', 1, callback=self.__handleBookCloseExit)
elif bookStatus['mode'] == 'gohome':
zoneId = bookStatus['hood']
base.localAvatar.collisionsOff()
base.localAvatar.b_setAnimState('CloseBook', 1, callback=self.goHomeNow, extraArgs=[zoneId])
elif bookStatus['mode'] == 'startparty':
firstStart = bookStatus['firstStart']
hostId = bookStatus['hostId']
base.localAvatar.collisionsOff()
base.localAvatar.b_setAnimState('CloseBook', 1, callback=self.startPartyNow, extraArgs=[firstStart, hostId])
def handleBookCloseTeleport(self, hoodId, zoneId):
if localAvatar.hasActiveBoardingGroup():
rejectText = TTLocalizer.BoardingCannotLeaveZone
localAvatar.elevatorNotifier.showMe(rejectText)
return
self.requestLeave({'loader': ZoneUtil.getBranchLoaderName(zoneId),
'where': ZoneUtil.getToonWhereName(zoneId),
'how': 'teleportIn',
'hoodId': hoodId,
'zoneId': zoneId,
'shardId': None,
'avId': -1})
return
def __handleBookCloseExit(self):
base.localAvatar.b_setAnimState('TeleportOut', 1, self.__handleBookExitTeleport, [0])
def __handleBookExitTeleport(self, requestStatus):
if base.cr.timeManager:
base.cr.timeManager.setDisconnectReason(ToontownGlobals.DisconnectBookExit)
base.transitions.fadeScreen(1.0)
base.cr.gameFSM.request(self.exitTo)
def goHomeNow(self, curZoneId):
if localAvatar.hasActiveBoardingGroup():
rejectText = TTLocalizer.BoardingCannotLeaveZone
localAvatar.elevatorNotifier.showMe(rejectText)
return
hoodId = ToontownGlobals.MyEstate
self.requestLeave({'loader': 'safeZoneLoader',
'where': 'estate',
'how': 'teleportIn',
'hoodId': hoodId,
'zoneId': -1,
'shardId': None,
'avId': -1})
return
def startPartyNow(self, firstStart, hostId):
if localAvatar.hasActiveBoardingGroup():
rejectText = TTLocalizer.BoardingCannotLeaveZone
localAvatar.elevatorNotifier.showMe(rejectText)
return
base.localAvatar.creatingNewPartyWithMagicWord = False
base.localAvatar.aboutToPlanParty = False
hoodId = ToontownGlobals.PartyHood
if firstStart:
zoneId = 0
ToontownDistrictStats.refresh('shardInfoUpdated')
curShardTuples = base.cr.listActiveShards()
lowestPop = 100000000000000000L
shardId = None
for shardInfo in curShardTuples:
pop = shardInfo[2]
if pop < lowestPop:
lowestPop = pop
shardId = shardInfo[0]
if shardId == base.localAvatar.defaultShard:
shardId = None
base.cr.playGame.getPlace().requestLeave({'loader': 'safeZoneLoader',
'where': 'party',
'how': 'teleportIn',
'hoodId': hoodId,
'zoneId': zoneId,
'shardId': shardId,
'avId': -1})
else:
if hostId is None:
hostId = base.localAvatar.doId
base.cr.partyManager.sendAvatarToParty(hostId)
return
return
def handleBookClose(self):
if hasattr(self, 'fsm'):
self.fsm.request('walk')
if hasattr(self, 'toonSubmerged') and self.toonSubmerged == 1:
if hasattr(self, 'walkStateData'):
self.walkStateData.fsm.request('swimming', [self.loader.swimSound])
def requestLeave(self, requestStatus):
teleportDebug(requestStatus, 'requestLeave(%s)' % (requestStatus,))
if hasattr(self, 'fsm'):
self.doRequestLeave(requestStatus)
def doRequestLeave(self, requestStatus):
teleportDebug(requestStatus, 'requestLeave(%s)' % (requestStatus,))
self.fsm.request('DFA', [requestStatus])
def enterDFA(self, requestStatus):
teleportDebug(requestStatus, 'enterDFA(%s)' % (requestStatus,))
self.acceptOnce(self.dfaDoneEvent, self.enterDFACallback, [requestStatus])
self.dfa = DownloadForceAcknowledge.DownloadForceAcknowledge(self.dfaDoneEvent)
self.dfa.enter(base.cr.hoodMgr.getPhaseFromHood(requestStatus['hoodId']))
def exitDFA(self):
self.ignore(self.dfaDoneEvent)
def handleEnterTunnel(self, requestStatus, collEntry):
if localAvatar.hasActiveBoardingGroup():
rejectText = TTLocalizer.BoardingCannotLeaveZone
localAvatar.elevatorNotifier.showMe(rejectText)
dummyNP = NodePath('dummyNP')
dummyNP.reparentTo(render)
tunnelOrigin = requestStatus['tunnelOrigin']
dummyNP.setPos(localAvatar.getPos())
dummyNP.setH(tunnelOrigin.getH())
dummyNP.setPos(dummyNP, 0, 4, 0)
localAvatar.setPos(dummyNP.getPos())
dummyNP.removeNode()
del dummyNP
return
self.requestLeave(requestStatus)
def enterDFACallback(self, requestStatus, doneStatus):
teleportDebug(requestStatus, 'enterDFACallback%s' % ((requestStatus, doneStatus),))
self.dfa.exit()
del self.dfa
if doneStatus['mode'] == 'complete':
if requestStatus.get('tutorial', 0):
out = {'teleportIn': 'tunnelOut'}
requestStatus['zoneId'] = 22000
requestStatus['hoodId'] = 22000
else:
out = {'teleportIn': 'teleportOut',
'tunnelIn': 'tunnelOut',
'doorIn': 'doorOut'}
teleportDebug(requestStatus, 'requesting %s, requestStatus=%s' % (out[requestStatus['how']], requestStatus))
self.fsm.request(out[requestStatus['how']], [requestStatus])
elif doneStatus['mode'] == 'incomplete':
self.fsm.request('DFAReject')
else:
Place.notify.error('Unknown done status for DownloadForceAcknowledge: ' + `doneStatus`)
def enterDFAReject(self):
self.fsm.request('walk')
def exitDFAReject(self):
pass
def enterTrialerFA(self, requestStatus):
teleportDebug(requestStatus, 'enterTrialerFA(%s)' % requestStatus)
self.acceptOnce(self.trialerFADoneEvent, self.trialerFACallback, [requestStatus])
self.trialerFA = TrialerForceAcknowledge.TrialerForceAcknowledge(self.trialerFADoneEvent)
self.trialerFA.enter(requestStatus['hoodId'])
def exitTrialerFA(self):
pass
def trialerFACallback(self, requestStatus, doneStatus):
if doneStatus['mode'] == 'pass':
self.fsm.request('DFA', [requestStatus])
elif doneStatus['mode'] == 'fail':
self.fsm.request('trialerFAReject')
else:
Place.notify.error('Unknown done status for TrialerForceAcknowledge: %s' % doneStatus)
def enterTrialerFAReject(self):
self.fsm.request('walk')
def exitTrialerFAReject(self):
pass
def enterDoorIn(self, requestStatus):
NametagGlobals.setMasterArrowsOn(0)
door = base.cr.doId2do.get(requestStatus['doorDoId'])
door.readyToExit()
base.localAvatar.obscureMoveFurnitureButton(1)
base.localAvatar.startQuestMap()
def exitDoorIn(self):
NametagGlobals.setMasterArrowsOn(1)
base.localAvatar.obscureMoveFurnitureButton(-1)
def enterDoorOut(self):
base.localAvatar.obscureMoveFurnitureButton(1)
def exitDoorOut(self):
base.localAvatar.obscureMoveFurnitureButton(-1)
base.localAvatar.stopQuestMap()
def handleDoorDoneEvent(self, requestStatus):
self.doneStatus = requestStatus
messenger.send(self.doneEvent)
def handleDoorTrigger(self):
self.fsm.request('doorOut')
def enterTunnelIn(self, requestStatus):
self.notify.debug('enterTunnelIn(requestStatus=' + str(requestStatus) + ')')
tunnelOrigin = base.render.find(requestStatus['tunnelName'])
self.accept('tunnelInMovieDone', self.__tunnelInMovieDone)
base.localAvatar.reconsiderCheesyEffect()
base.localAvatar.tunnelIn(tunnelOrigin)
base.localAvatar.startQuestMap()
def __tunnelInMovieDone(self):
self.ignore('tunnelInMovieDone')
self.fsm.request('walk')
def exitTunnelIn(self):
pass
def enterTunnelOut(self, requestStatus):
hoodId = requestStatus['hoodId']
zoneId = requestStatus['zoneId']
how = requestStatus['how']
tunnelOrigin = requestStatus['tunnelOrigin']
fromZoneId = ZoneUtil.getCanonicalZoneId(self.getZoneId())
tunnelName = requestStatus.get('tunnelName')
if tunnelName == None:
tunnelName = base.cr.hoodMgr.makeLinkTunnelName(self.loader.hood.id, fromZoneId)
self.doneStatus = {'loader': ZoneUtil.getLoaderName(zoneId),
'where': ZoneUtil.getToonWhereName(zoneId),
'how': how,
'hoodId': hoodId,
'zoneId': zoneId,
'shardId': None,
'tunnelName': tunnelName}
self.accept('tunnelOutMovieDone', self.__tunnelOutMovieDone)
base.localAvatar.tunnelOut(tunnelOrigin)
base.localAvatar.stopQuestMap()
return
def __tunnelOutMovieDone(self):
self.ignore('tunnelOutMovieDone')
messenger.send(self.doneEvent)
def exitTunnelOut(self):
pass
def enterTeleportOut(self, requestStatus, callback):
base.localAvatar.laffMeter.start()
base.localAvatar.b_setAnimState('TeleportOut', 1, callback, [requestStatus])
base.localAvatar.obscureMoveFurnitureButton(1)
def exitTeleportOut(self):
base.localAvatar.laffMeter.stop()
base.localAvatar.stopQuestMap()
base.localAvatar.obscureMoveFurnitureButton(-1)
def enterDied(self, requestStatus, callback = None):
if callback == None:
callback = self.__diedDone
base.localAvatar.laffMeter.start()
camera.wrtReparentTo(render)
base.localAvatar.b_setAnimState('Died', 1, callback, [requestStatus])
base.localAvatar.obscureMoveFurnitureButton(1)
return
def __diedDone(self, requestStatus):
self.doneStatus = requestStatus
messenger.send(self.doneEvent)
def exitDied(self):
base.localAvatar.laffMeter.stop()
base.localAvatar.obscureMoveFurnitureButton(-1)
def getEstateZoneAndGoHome(self, requestStatus):
self.doneStatus = requestStatus
avId = requestStatus['avId']
self.acceptOnce('setLocalEstateZone', self.goHome)
if avId > 0:
base.cr.estateMgr.getLocalEstateZone(avId)
else:
base.cr.estateMgr.getLocalEstateZone(base.localAvatar.getDoId())
if HouseGlobals.WANT_TELEPORT_TIMEOUT:
taskMgr.doMethodLater(HouseGlobals.TELEPORT_TIMEOUT, self.goHomeFailed, 'goHomeFailed')
def goHome(self, ownerId, zoneId):
self.notify.debug('goHome ownerId = %s' % ownerId)
taskMgr.remove('goHomeFailed')
if ownerId > 0 and ownerId != base.localAvatar.doId and not base.cr.isFriend(ownerId):
self.doneStatus['failed'] = 1
self.goHomeFailed(None)
return
if ownerId == 0 and zoneId == 0:
if self.doneStatus['shardId'] is None or self.doneStatus['shardId'] is base.localAvatar.defaultShard:
self.doneStatus['failed'] = 1
self.goHomeFailed(None)
return
else:
self.doneStatus['hood'] = ToontownGlobals.MyEstate
self.doneStatus['zone'] = base.localAvatar.lastHood
self.doneStatus['loaderId'] = 'safeZoneLoader'
self.doneStatus['whereId'] = 'estate'
self.doneStatus['how'] = 'teleportIn'
messenger.send(self.doneEvent)
return
if self.doneStatus['zoneId'] == -1:
self.doneStatus['zoneId'] = zoneId
elif self.doneStatus['zoneId'] != zoneId:
self.doneStatus['where'] = 'house'
self.doneStatus['ownerId'] = ownerId
messenger.send(self.doneEvent)
messenger.send('localToonLeft')
return
def goHomeFailed(self, task):
self.notify.debug('goHomeFailed')
self.notifyUserGoHomeFailed()
self.ignore('setLocalEstateZone')
self.doneStatus['hood'] = base.localAvatar.lastHood
self.doneStatus['zone'] = base.localAvatar.lastHood
self.fsm.request('teleportIn', [self.doneStatus])
return Task.done
def notifyUserGoHomeFailed(self):
self.notify.debug('notifyUserGoHomeFailed')
failedToVisitAvId = self.doneStatus.get('avId', -1)
avName = None
if failedToVisitAvId != -1:
avatar = base.cr.identifyAvatar(failedToVisitAvId)
if avatar:
avName = avatar.getName()
if avName:
message = TTLocalizer.EstateTeleportFailedNotFriends % avName
else:
message = TTLocalizer.EstateTeleportFailed
base.localAvatar.setSystemMessage(0, message)
return
def enterTeleportIn(self, requestStatus):
self._tiToken = self.addSetZoneCompleteCallback(Functor(self._placeTeleportInPostZoneComplete, requestStatus), 100)
def _placeTeleportInPostZoneComplete(self, requestStatus):
teleportDebug(requestStatus, '_placeTeleportInPostZoneComplete(%s)' % (requestStatus,))
NametagGlobals.setMasterArrowsOn(0)
base.localAvatar.laffMeter.start()
base.localAvatar.startQuestMap()
base.localAvatar.reconsiderCheesyEffect()
base.localAvatar.obscureMoveFurnitureButton(1)
avId = requestStatus.get('avId', -1)
if avId != -1:
if base.cr.doId2do.has_key(avId):
teleportDebug(requestStatus, 'teleport to avatar')
avatar = base.cr.doId2do[avId]
avatar.forceToTruePosition()
base.localAvatar.gotoNode(avatar)
base.localAvatar.b_teleportGreeting(avId)
else:
friend = base.cr.identifyAvatar(avId)
if friend != None:
teleportDebug(requestStatus, 'friend not here, giving up')
base.localAvatar.setSystemMessage(avId, OTPLocalizer.WhisperTargetLeftVisit % (friend.getName(),))
friend.d_teleportGiveup(base.localAvatar.doId)
base.transitions.irisIn()
self.nextState = requestStatus.get('nextState', 'walk')
base.localAvatar.attachCamera()
base.localAvatar.startUpdateSmartCamera()
base.localAvatar.startPosHprBroadcast()
globalClock.tick()
base.localAvatar.b_setAnimState('TeleportIn', 1, callback=self.teleportInDone)
base.localAvatar.d_broadcastPositionNow()
base.localAvatar.b_setParent(ToontownGlobals.SPRender)
return
def teleportInDone(self):
if hasattr(self, 'fsm'):
teleportNotify.debug('teleportInDone: %s' % self.nextState)
self.fsm.request(self.nextState, [1])
def exitTeleportIn(self):
self.removeSetZoneCompleteCallback(self._tiToken)
self._tiToken = None
NametagGlobals.setMasterArrowsOn(1)
base.localAvatar.laffMeter.stop()
base.localAvatar.obscureMoveFurnitureButton(-1)
base.localAvatar.stopUpdateSmartCamera()
base.localAvatar.detachCamera()
base.localAvatar.stopPosHprBroadcast()
return
def requestTeleport(self, hoodId, zoneId, shardId, avId):
if avId > 0:
teleportNotify.debug('requestTeleport%s' % ((hoodId,
zoneId,
shardId,
avId),))
if localAvatar.hasActiveBoardingGroup():
if avId > 0:
teleportNotify.debug('requestTeleport: has active boarding group')
rejectText = TTLocalizer.BoardingCannotLeaveZone
localAvatar.elevatorNotifier.showMe(rejectText)
return
loaderId = ZoneUtil.getBranchLoaderName(zoneId)
whereId = ZoneUtil.getToonWhereName(zoneId)
if hoodId == ToontownGlobals.MyEstate:
loaderId = 'safeZoneLoader'
whereId = 'estate'
if hoodId == ToontownGlobals.PartyHood:
loaderId = 'safeZoneLoader'
whereId = 'party'
self.requestLeave({'loader': loaderId,
'where': whereId,
'how': 'teleportIn',
'hoodId': hoodId,
'zoneId': zoneId,
'shardId': shardId,
'avId': avId})
def enterQuest(self, npcToon):
base.localAvatar.b_setAnimState('neutral', 1)
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.laffMeter.start()
base.localAvatar.obscureMoveFurnitureButton(1)
def exitQuest(self):
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
base.localAvatar.laffMeter.stop()
base.localAvatar.obscureMoveFurnitureButton(-1)
def enterPurchase(self):
base.localAvatar.b_setAnimState('neutral', 1)
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.laffMeter.start()
base.localAvatar.obscureMoveFurnitureButton(1)
def exitPurchase(self):
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
base.localAvatar.laffMeter.stop()
base.localAvatar.obscureMoveFurnitureButton(-1)
def enterFishing(self):
base.localAvatar.b_setAnimState('neutral', 1)
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.laffMeter.start()
def exitFishing(self):
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
base.localAvatar.laffMeter.stop()
def enterBanking(self):
base.localAvatar.b_setAnimState('neutral', 1)
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.laffMeter.start()
base.localAvatar.obscureMoveFurnitureButton(1)
base.localAvatar.startSleepWatch(self.__handleFallingAsleepBanking)
self.enablePeriodTimer()
def __handleFallingAsleepBanking(self, arg):
if hasattr(self, 'fsm'):
messenger.send('bankAsleep')
self.fsm.request('walk')
base.localAvatar.forceGotoSleep()
def exitBanking(self):
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
base.localAvatar.laffMeter.stop()
base.localAvatar.obscureMoveFurnitureButton(-1)
base.localAvatar.stopSleepWatch()
self.disablePeriodTimer()
def enterPhone(self):
base.localAvatar.b_setAnimState('neutral', 1)
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.laffMeter.start()
base.localAvatar.obscureMoveFurnitureButton(1)
base.localAvatar.startSleepWatch(self.__handleFallingAsleepPhone)
self.enablePeriodTimer()
def __handleFallingAsleepPhone(self, arg):
if hasattr(self, 'fsm'):
self.fsm.request('walk')
messenger.send('phoneAsleep')
base.localAvatar.forceGotoSleep()
def exitPhone(self):
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
base.localAvatar.laffMeter.stop()
base.localAvatar.obscureMoveFurnitureButton(-1)
base.localAvatar.stopSleepWatch()
self.disablePeriodTimer()
def enterStopped(self):
base.localAvatar.b_setAnimState('neutral', 1)
Emote.globalEmote.disableBody(base.localAvatar, 'enterStopped')
self.accept('teleportQuery', self.handleTeleportQuery)
if base.localAvatar.isDisguised:
base.localAvatar.setTeleportAvailable(0)
else:
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.laffMeter.start()
base.localAvatar.obscureMoveFurnitureButton(1)
base.localAvatar.startSleepWatch(self.__handleFallingAsleepStopped)
self.enablePeriodTimer()
def __handleFallingAsleepStopped(self, arg):
if hasattr(self, 'fsm'):
self.fsm.request('walk')
base.localAvatar.forceGotoSleep()
messenger.send('stoppedAsleep')
def exitStopped(self):
Emote.globalEmote.releaseBody(base.localAvatar, 'exitStopped')
base.localAvatar.setTeleportAvailable(0)
self.ignore('teleportQuery')
base.localAvatar.laffMeter.stop()
base.localAvatar.obscureMoveFurnitureButton(-1)
base.localAvatar.stopSleepWatch()
self.disablePeriodTimer()
messenger.send('exitingStoppedState')
def enterPet(self):
base.localAvatar.b_setAnimState('neutral', 1)
Emote.globalEmote.disableBody(base.localAvatar, 'enterPet')
self.accept('teleportQuery', self.handleTeleportQuery)
base.localAvatar.setTeleportAvailable(1)
base.localAvatar.setTeleportAllowed(0)
base.localAvatar.laffMeter.start()
self.enterFLM()
def exitPet(self):
base.localAvatar.setTeleportAvailable(0)
base.localAvatar.setTeleportAllowed(1)
Emote.globalEmote.releaseBody(base.localAvatar, 'exitPet')
self.ignore('teleportQuery')
base.localAvatar.laffMeter.stop()
self.exitFLM()
def enterQuietZone(self, requestStatus):
self.quietZoneDoneEvent = uniqueName('quietZoneDone')
self.acceptOnce(self.quietZoneDoneEvent, self.handleQuietZoneDone)
self.quietZoneStateData = QuietZoneState.QuietZoneState(self.quietZoneDoneEvent)
self.quietZoneStateData.load()
self.quietZoneStateData.enter(requestStatus)
def exitQuietZone(self):
self.ignore(self.quietZoneDoneEvent)
del self.quietZoneDoneEvent
self.quietZoneStateData.exit()
self.quietZoneStateData.unload()
self.quietZoneStateData = None
return
def handleQuietZoneDone(self):
how = base.cr.handlerArgs['how']
self.fsm.request(how, [base.cr.handlerArgs])
|
ksmit799/Toontown-Source
|
toontown/hood/Place.py
|
Python
|
mit
| 37,078
|
<?php
namespace CentraleReferencementBundle\Repository;
/**
* PourquoiAdhererRepository
*
* This class was generated by the Doctrine ORM. Add your own custom
* repository methods below.
*/
class PourquoiAdhererRepository extends \Doctrine\ORM\EntityRepository
{
}
|
ViraxDev/centrale_referencement
|
src/CentraleReferencementBundle/Repository/PourquoiAdhererRepository.php
|
PHP
|
mit
| 271
|
require 'brick/mixin'
require 'colorize'
module Brick
module Models
class Service
include ::Brick::Mixin::Colors
@@waiting_pool = []
attr_accessor :client, :name, :links, :service_config_hash, :container, :volumes_from, :image, :image_name
def self.wait_for_deamon
@@waiting_pool.each{|thr|
thr.join
}
end
def initialize(name, config, client)
self.name = name
self.service_config_hash = config
self.client = client
#puts "client=#{client}"
determine_color
unless config["links"].nil?
if config["links"].instance_of?(String)
self.links= [config["links"]]
else
self.links= config["links"].dup
end
end
unless config["volumes_from"].nil?
if config["volumes_from"].instance_of?(String)
self.volumes_from= [config["volumes_from"]]
else
self.volumes_from= config["volumes_from"].dup
end
end
begin
self.container = ::Docker::Container.get(name)
rescue
self.container = nil
end
end
def update_volumes_from services
new_volumes_from_config = []
new_volumes_from = []
unless volumes_from.nil?
volumes_from.each {|vo|
#new_volumes_from << services[vo]
vo_parts = vo.split(':')
#only one part
if vo_parts.size == 1
new_vo = "#{services[vo_parts[0]].name}:rw"
else
new_vo= "#{services[vo_parts[0]].name}:#{vo_parts[1]}"
end
new_volumes_from<< services[vo_parts[0]]
new_volumes_from_config << new_vo
}
self.volumes_from = new_volumes_from
service_config_hash["volumes_from"] = new_volumes_from_config
end
end
def update_links services
new_links_config = []
new_links =[]
unless links.nil?
links.each{|link|
link_array=link.split(':')
#It's for getting the real service name
service_key = link_array[0]
alias_name = link_array[-1]
service_container= services[service_key]
new_links << service_container
new_links_config << "#{service_container.name}:#{alias_name}"
}
self.links=new_links
service_config_hash["links"] = new_links_config
end
end
def exec cmd_array, options ={}
if self.container.nil?
raise "no container #{name} running, so we can't execute "
end
self.container.exec(cmd_array, options){|stream, chunk| puts "#{color_generator(name)} | #{chunk}".chomp }
end
#equals to "docker run"
def run enable_link=true, recreate=true, detach_mode=false
if running? and (!recreate or can_be_skipped_this_time?)
Brick::CLI::logger.debug "the service #{name} is already running. exited."
unless detach_mode
attach
end
return
end
unless volumes_from.nil?
volumes_from.each{|vo| vo.run enable_link}
end
config_hash = @service_config_hash.dup
if enable_link and !links.nil?
links.each{|linked_service|
linked_service.run enable_link, recreate, detach_mode
unless detach_mode
linked_service.attach
else
puts "Service #{linked_service.name} has been started"
end
}
end
if !enable_link
config_hash.delete("links")
end
if recreate and !container.nil?
#if recreate is true, it will destory the old container, and create a new one
if running?
container.stop
end
container.delete(:force => true)
self.container=nil
skip_next_time
end
if container.nil?
self.container = client.run config_hash, name
else
container.start
end
unless detach_mode
attach
else
puts "Service #{name} has been started"
end
end
#Check if the container is running
def running?
is_running = false
if container.nil?
begin
self.container = ::Docker::Container.get(name)
rescue
self.container = nil
end
end
unless container.nil?
is_running = container.is_running?
end
is_running
end
def container_info
(client.get_container_by_id(container.id)).info rescue {}
end
def attach
thr=Thread.new{
puts "Attaching to service #{name}"
container.attach(:stdin => STDIN, :tty => true){|message|
if message.length > 0
puts "#{color_generator(name)} | #{message}".chomp
end
}
}
#thr.join
@@waiting_pool << thr
end
def can_be_built?
!service_config_hash["build"].nil?
end
def skip_next_time
@skip = true
end
def can_be_skipped_this_time?
@skip == true
end
def build name=nil, no_cache=false, project_dir=nil
if name.nil?
name = self.image_name
end
puts "Start building #{name}..."
if can_be_built?
self.image = client.build_from_dir({:image_name => name,
:no_cache => no_cache,
:project_dir=>project_dir,
:build_dir=>service_config_hash["build"]})
else
Brick::CLI::logger.debug "no build defintion for #{image_build},skip it"
end
self.image
end
def image_exist?
::Docker::Image.exist?(image_name)
end
def container_exist?
::Docker::Container.exist?(name)
end
#If it's using build tag, will create an actual image name for it.
#For example, if project name is test, service name is web, the image name should
#be test_web
def update_image_for_building_tag name
unless service_config_hash["build"].nil?
service_config_hash["image"]=name
end
self.image_name = service_config_hash["image"]
end
end
end
end
|
cheyang/docker_brick
|
lib/brick/models/service.rb
|
Ruby
|
mit
| 7,080
|
# Homepwner
A exercise of iOS development
|
ianzhengnan/Homepwner
|
README.md
|
Markdown
|
mit
| 42
|
<HTML><HEAD>
<TITLE>Review for Time to Kill, A (1996)</TITLE>
<LINK REL="STYLESHEET" TYPE="text/css" HREF="/ramr.css">
</HEAD>
<BODY BGCOLOR="#FFFFFF" TEXT="#000000">
<H1 ALIGN="CENTER" CLASS="title"><A HREF="/Title?0117913">Time to Kill, A (1996)</A></H1><H3 ALIGN=CENTER>reviewed by<BR><A HREF="/ReviewsBy?Mark+R.+Leeper">Mark R. Leeper</A></H3><HR WIDTH="40%" SIZE="4">
<PRE> A TIME TO KILL
A film review by Mark R. Leeper
Copyright 1996 Mark R. Leeper</PRE>
<PRE> Capsule: In a sweaty Mississippi town two
young white men rape and nearly murder a ten-year-
old black girl. The girl's father takes justice
into his own hands and murders the two men in the
town courthouse. The resulting trial and its
resulting racial tensions touch everybody in the
town. The film based on John Grisham's first novel
spreads its attentions over a large number of
characters, many played by familiar actors.
Economically, it develops only a few, but it gives
a many-sided look at a town in turmoil. Rating:
high +1 (-4 to +4)</PRE>
<P> John Grisham's first novel is also (reportedly) his most serious.
It makes his most interesting film adaptation to date. That is in
large part because it is a serious story, looking at racial tension
rather than being a throwaway thriller. It makes the most satisfying
of his films, if slightly over-polished and simplistic. Rather than
telling one complex story, it jumps around showing a broad collection
of characters, few of whom get much development but many of whom get
nice rounded stories that reach conclusions. None of the individual
subplots is very original or interesting, but the total is more than
the some of its parts. Like a narrative mural we get a large picture
made of many smaller stories of what happens during a trial and the
resulting clash of townspeople at both ends of the political spectrum.</P>
<P> The setting is Canton, Mississippi, with its mix of small town and
rural people. As the film opens we see two white men in their early
twenties looking for trouble and finding it by raping and very nearly
murdering a ten-year-old black girl. Unexpectedly, the girl lives and
within hours the two men are behind bars. But the girl's father, Carl
Lee Hailey (played by Samuel L. Jackson) is filled with rage and fear
of the very real possibility that the men could end up not being
punished for their crime. In a rage he hides himself in the town
courthouse and the next morning as the men are being walked through he
takes justice into his own hands and guns down the two men,
accidentally also crippling a deputy escorting the men. For his
defense he chooses a local white lawyer and acquaintance Jake Brigance
(Matthew McConaughey), to whom Hailey had hinted the day before that he
might be planning to murder the rapists. Brigance decides to use
defense of temporary insanity, though it is relatively obvious that the
killing was an angry act of revenge but not insanity. Through Brigance
we meet his daughter and his wife (Ashley Judd) who is reluctant to
have her husband take the emotionally-charged case. We also meet
Brigance's old law professor (Donald Sutherland), now disbarred and
enjoying a drunken retirement. Kevin Spacey plays an ambitious and
tricky prosecutor wanting to ride the case to bigger things, and
Patrick McGoohan plays the aptly-named Judge Noose. Most unlikely
seeming, is the arrival of a brilliant, attractive law student, Ellen
Roark (Sandra Bullock) anxious to bull her way onto the defense team
with an impressive arsenal of legal knowledge. But the trial also
beings a revival of the dormant Ku Klux Klan threatening everybody on
the defense team.</P>
<P> Director Joel Schumacher's strong suit has us usually been setting
and mood. This was certainly the case with his brooding Gothic medical
school in FLATLINERS and his oversized but under-thought BATMAN
FOREVER. His Mississippi town is less exaggerated, but little details
seem to be intentionally carried a bit too far. Housewife Ashley Judd
looks to be laminated in sweat, as if she was sprayed with Pam, but
only from the neck down and no other character is sweating nearly so
profusely. As the Klan walks into town a plate glass window reflects
them as three times their height--Schumacher's visual sense often plays
with size--and far more intimidating than they actually are. Peter
Menzies, Jr., gives the film's photography a somewhat more subdued feel
than previous Schumacher films, but the director's style is still
there.</P>
<P> A TIME TO KILL has been compared to Robert Mulligan's TO KILL A
MOCKINGBIRD and naturally it falls considerably short of that film.
But the two films are related only in subject matter. I would be more
likely to compare A TIME TO KILL to Spike Lee's DO THE RIGHT THING in
its breadth rather than depth view of the people affected by the trial.
This film is really not moving and perhaps not even greatly intelligent
in the way that TO KILL A MOCKINGBIRD was, but it gives a feel for
Southern politics and law better than other Grisham films and it tells
its story engrossingly. I give it a high +1 on the -4 to +4 scale.</P>
<PRE> Mark R. Leeper
<A HREF="mailto:mleeper@lucent.com">mleeper@lucent.com</A></PRE>
<HR><P CLASS=flush><SMALL>The review above was posted to the
<A HREF="news:rec.arts.movies.reviews">rec.arts.movies.reviews</A> newsgroup (<A HREF="news:de.rec.film.kritiken">de.rec.film.kritiken</A> for German reviews).<BR>
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.<BR>
Please direct comments/criticisms of the review to relevant newsgroups.<BR>
Broken URLs inthe reviews are the responsibility of the author.<BR>
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
</SMALL></P>
<P ALIGN=CENTER>Related links: <A HREF="/Reviews/">index of all rec.arts.movies.reviews reviews</A></P>
</P></BODY></HTML>
|
xianjunzhengbackup/code
|
data science/machine_learning_for_the_web/chapter_4/movie/6066.html
|
HTML
|
mit
| 6,400
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>V8 API Reference Guide for node.js v4.8.6 - v4.9.1: Member List</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">V8 API Reference Guide for node.js v4.8.6 - v4.9.1
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li><a href="examples.html"><span>Examples</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="classes.html"><span>Class Index</span></a></li>
<li><a href="inherits.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="namespacev8.html">v8</a></li><li class="navelem"><a class="el" href="classv8_1_1EscapableHandleScope.html">EscapableHandleScope</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">v8::EscapableHandleScope Member List</div> </div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="classv8_1_1EscapableHandleScope.html">v8::EscapableHandleScope</a>, including all inherited members.</p>
<table class="directory">
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>CreateHandle</b>(internal::Isolate *isolate, internal::Object *value) (defined in <a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a>)</td><td class="entry"><a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a></td><td class="entry"><span class="mlabel">protected</span><span class="mlabel">static</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>EscapableHandleScope</b>(Isolate *isolate) (defined in <a class="el" href="classv8_1_1EscapableHandleScope.html">v8::EscapableHandleScope</a>)</td><td class="entry"><a class="el" href="classv8_1_1EscapableHandleScope.html">v8::EscapableHandleScope</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="classv8_1_1EscapableHandleScope.html#afdf0d3850978f65d1a827f78b3a2b6fd">Escape</a>(Local< T > value)</td><td class="entry"><a class="el" href="classv8_1_1EscapableHandleScope.html">v8::EscapableHandleScope</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>GetIsolate</b>() const (defined in <a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a>)</td><td class="entry"><a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>HandleScope</b>(Isolate *isolate) (defined in <a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a>)</td><td class="entry"><a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>HandleScope</b>() (defined in <a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a>)</td><td class="entry"><a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">protected</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>Initialize</b>(Isolate *isolate) (defined in <a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a>)</td><td class="entry"><a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a></td><td class="entry"><span class="mlabel">protected</span></td></tr>
<tr><td class="entry"><a class="el" href="classv8_1_1HandleScope.html#abab7214c9b9388b02f575fd5270b7e2f">NumberOfHandles</a>(Isolate *isolate)</td><td class="entry"><a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a></td><td class="entry"><span class="mlabel">static</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>~EscapableHandleScope</b>() (defined in <a class="el" href="classv8_1_1EscapableHandleScope.html">v8::EscapableHandleScope</a>)</td><td class="entry"><a class="el" href="classv8_1_1EscapableHandleScope.html">v8::EscapableHandleScope</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>~HandleScope</b>() (defined in <a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a>)</td><td class="entry"><a class="el" href="classv8_1_1HandleScope.html">v8::HandleScope</a></td><td class="entry"></td></tr>
</table></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.11
</small></address>
</body>
</html>
|
v8-dox/v8-dox.github.io
|
9c3e246/html/classv8_1_1EscapableHandleScope-members.html
|
HTML
|
mit
| 7,746
|
/******************************************************************************
The MIT License (MIT)
Copyright (c) 2015 Dmitry Root <droot@deeptown.org>
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.
******************************************************************************/
#include <xdc/std.h>
#include <xdc/cfg/global.h>
#include <xdc/runtime/Error.h>
#include <xdc/runtime/System.h>
#include <ti/sysbios/BIOS.h>
#include <ti/sysbios/knl/Clock.h>
#include <ti/sysbios/knl/Task.h>
#include <ti/drivers/GPIO.h>
#define PART_TM4C1290NCPDT 1
#include <inc/hw_can.h>
#include <inc/hw_memmap.h>
#include <inc/hw_types.h>
#include <driverlib/can.h>
#include <driverlib/sysctl.h>
#include <driverlib/gpio.h>
#include <driverlib/pin_map.h>
#include "board.h"
extern "C"
int main()
{
/* Call board init functions */
Board_initGeneral();
Board_initGPIO();
Board_initEMAC();
SysCtlPeripheralEnable(SYSCTL_PERIPH_GPIOA);
GPIOPinConfigure(GPIO_PA0_CAN0RX);
GPIOPinConfigure(GPIO_PA1_CAN0TX);
GPIOPinTypeCAN(GPIO_PORTA_BASE, GPIO_PIN_0 | GPIO_PIN_1);
SysCtlPeripheralEnable(SYSCTL_PERIPH_CAN0);
CANInit(CAN0_BASE);
CANBitRateSet(CAN0_BASE, SysCtlClockGet(), 500000);
CANEnable(CAN0_BASE);
BIOS_start();
return 0;
}
|
dmitry-root/home-automation
|
firmware/ti/heater/main.cpp
|
C++
|
mit
| 2,216
|
require File.dirname(__FILE__) + '/../test_helper'
class DefaultControllerTest < ActionController::TestCase
def setup
@controller = DefaultController.new
@request = ActionController::TestRequest.new
@response = ActionController::TestResponse.new
end
context "get home page" do
setup do
get :index
end
should respond_with :success
should render_template :index # rendering the default home page
end
context "requests" do
setup do
setup_theme
get :index
end
should "not add more than one item to the view path" do
assert @controller.view_paths.length == 3
end
context "second request" do
setup do
clean_theme_view_path(@controller)
get :index
end
should "not add any more items to the viewpath" do
assert @controller.view_paths.length == 3
end
end
should "have blue in the view path" do
assert @controller.view_paths[0].to_s.include?('themes/blue/views'), "The blue theme should be first in the view paths but was #{@controller.view_paths[0]}"
end
end
context "multiple requests" do
setup do
clean_theme_locale
@default_locales_length = I18n.load_path.length
@default_locales_length.freeze
setup_theme
get :index
get :index
get :index
end
should "not add extra locales" do
assert_equal @default_locales_length + @theme.locales.length, I18n.load_path.length
end
end
context "use url to determine theme" do
setup do
DomainTheme.stubs(:use_domain_themes?).returns(true)
get :index
end
end
end
|
jbasdf/disguise
|
test/rails_test/test/functional/default_controller_test.rb
|
Ruby
|
mit
| 1,661
|
package apimanagement
// 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.
import (
"context"
"github.com/Azure/go-autorest/autorest"
"github.com/Azure/go-autorest/autorest/azure"
"github.com/Azure/go-autorest/autorest/validation"
"github.com/Azure/go-autorest/tracing"
"net/http"
)
// IssueClient is the apiManagement Client
type IssueClient struct {
BaseClient
}
// NewIssueClient creates an instance of the IssueClient client.
func NewIssueClient(subscriptionID string) IssueClient {
return NewIssueClientWithBaseURI(DefaultBaseURI, subscriptionID)
}
// NewIssueClientWithBaseURI creates an instance of the IssueClient client using a custom endpoint. Use this when
// interacting with an Azure cloud that uses a non-standard base URI (sovereign clouds, Azure stack).
func NewIssueClientWithBaseURI(baseURI string, subscriptionID string) IssueClient {
return IssueClient{NewWithBaseURI(baseURI, subscriptionID)}
}
// Get gets API Management issue details
// Parameters:
// resourceGroupName - the name of the resource group.
// serviceName - the name of the API Management service.
// issueID - issue identifier. Must be unique in the current API Management service instance.
func (client IssueClient) Get(ctx context.Context, resourceGroupName string, serviceName string, issueID string) (result IssueContract, err error) {
if tracing.IsEnabled() {
ctx = tracing.StartSpan(ctx, fqdn+"/IssueClient.Get")
defer func() {
sc := -1
if result.Response.Response != nil {
sc = result.Response.Response.StatusCode
}
tracing.EndSpan(ctx, sc, err)
}()
}
if err := validation.Validate([]validation.Validation{
{TargetValue: serviceName,
Constraints: []validation.Constraint{{Target: "serviceName", Name: validation.MaxLength, Rule: 50, Chain: nil},
{Target: "serviceName", Name: validation.MinLength, Rule: 1, Chain: nil},
{Target: "serviceName", Name: validation.Pattern, Rule: `^[a-zA-Z](?:[a-zA-Z0-9-]*[a-zA-Z0-9])?$`, Chain: nil}}},
{TargetValue: issueID,
Constraints: []validation.Constraint{{Target: "issueID", Name: validation.MaxLength, Rule: 256, Chain: nil},
{Target: "issueID", Name: validation.MinLength, Rule: 1, Chain: nil},
{Target: "issueID", Name: validation.Pattern, Rule: `^[^*#&+:<>?]+$`, Chain: nil}}}}); err != nil {
return result, validation.NewError("apimanagement.IssueClient", "Get", err.Error())
}
req, err := client.GetPreparer(ctx, resourceGroupName, serviceName, issueID)
if err != nil {
err = autorest.NewErrorWithError(err, "apimanagement.IssueClient", "Get", nil, "Failure preparing request")
return
}
resp, err := client.GetSender(req)
if err != nil {
result.Response = autorest.Response{Response: resp}
err = autorest.NewErrorWithError(err, "apimanagement.IssueClient", "Get", resp, "Failure sending request")
return
}
result, err = client.GetResponder(resp)
if err != nil {
err = autorest.NewErrorWithError(err, "apimanagement.IssueClient", "Get", resp, "Failure responding to request")
return
}
return
}
// GetPreparer prepares the Get request.
func (client IssueClient) GetPreparer(ctx context.Context, resourceGroupName string, serviceName string, issueID string) (*http.Request, error) {
pathParameters := map[string]interface{}{
"issueId": autorest.Encode("path", issueID),
"resourceGroupName": autorest.Encode("path", resourceGroupName),
"serviceName": autorest.Encode("path", serviceName),
"subscriptionId": autorest.Encode("path", client.SubscriptionID),
}
const APIVersion = "2019-12-01"
queryParameters := map[string]interface{}{
"api-version": APIVersion,
}
preparer := autorest.CreatePreparer(
autorest.AsGet(),
autorest.WithBaseURL(client.BaseURI),
autorest.WithPathParameters("/subscriptions/{subscriptionId}/resourceGroups/{resourceGroupName}/providers/Microsoft.ApiManagement/service/{serviceName}/issues/{issueId}", pathParameters),
autorest.WithQueryParameters(queryParameters))
return preparer.Prepare((&http.Request{}).WithContext(ctx))
}
// GetSender sends the Get request. The method will close the
// http.Response Body if it receives an error.
func (client IssueClient) GetSender(req *http.Request) (*http.Response, error) {
return client.Send(req, azure.DoRetryWithRegistration(client.Client))
}
// GetResponder handles the response to the Get request. The method always
// closes the http.Response Body.
func (client IssueClient) GetResponder(resp *http.Response) (result IssueContract, err error) {
err = autorest.Respond(
resp,
azure.WithErrorUnlessStatusCode(http.StatusOK),
autorest.ByUnmarshallingJSON(&result),
autorest.ByClosing())
result.Response = autorest.Response{Response: resp}
return
}
// ListByService lists a collection of issues in the specified service instance.
// Parameters:
// resourceGroupName - the name of the resource group.
// serviceName - the name of the API Management service.
// filter - | Field | Usage | Supported operators | Supported functions
// |</br>|-------------|-------------|-------------|-------------|</br>| name | filter | ge, le, eq, ne, gt, lt
// | substringof, contains, startswith, endswith | </br>| apiId | filter | ge, le, eq, ne, gt, lt |
// substringof, contains, startswith, endswith | </br>| title | filter | ge, le, eq, ne, gt, lt | substringof,
// contains, startswith, endswith | </br>| description | filter | ge, le, eq, ne, gt, lt | substringof,
// contains, startswith, endswith | </br>| authorName | filter | ge, le, eq, ne, gt, lt | substringof,
// contains, startswith, endswith | </br>| state | filter | eq | | </br>
// top - number of records to return.
// skip - number of records to skip.
func (client IssueClient) ListByService(ctx context.Context, resourceGroupName string, serviceName string, filter string, top *int32, skip *int32) (result IssueCollectionPage, err error) {
if tracing.IsEnabled() {
ctx = tracing.StartSpan(ctx, fqdn+"/IssueClient.ListByService")
defer func() {
sc := -1
if result.ic.Response.Response != nil {
sc = result.ic.Response.Response.StatusCode
}
tracing.EndSpan(ctx, sc, err)
}()
}
if err := validation.Validate([]validation.Validation{
{TargetValue: serviceName,
Constraints: []validation.Constraint{{Target: "serviceName", Name: validation.MaxLength, Rule: 50, Chain: nil},
{Target: "serviceName", Name: validation.MinLength, Rule: 1, Chain: nil},
{Target: "serviceName", Name: validation.Pattern, Rule: `^[a-zA-Z](?:[a-zA-Z0-9-]*[a-zA-Z0-9])?$`, Chain: nil}}},
{TargetValue: top,
Constraints: []validation.Constraint{{Target: "top", Name: validation.Null, Rule: false,
Chain: []validation.Constraint{{Target: "top", Name: validation.InclusiveMinimum, Rule: int64(1), Chain: nil}}}}},
{TargetValue: skip,
Constraints: []validation.Constraint{{Target: "skip", Name: validation.Null, Rule: false,
Chain: []validation.Constraint{{Target: "skip", Name: validation.InclusiveMinimum, Rule: int64(0), Chain: nil}}}}}}); err != nil {
return result, validation.NewError("apimanagement.IssueClient", "ListByService", err.Error())
}
result.fn = client.listByServiceNextResults
req, err := client.ListByServicePreparer(ctx, resourceGroupName, serviceName, filter, top, skip)
if err != nil {
err = autorest.NewErrorWithError(err, "apimanagement.IssueClient", "ListByService", nil, "Failure preparing request")
return
}
resp, err := client.ListByServiceSender(req)
if err != nil {
result.ic.Response = autorest.Response{Response: resp}
err = autorest.NewErrorWithError(err, "apimanagement.IssueClient", "ListByService", resp, "Failure sending request")
return
}
result.ic, err = client.ListByServiceResponder(resp)
if err != nil {
err = autorest.NewErrorWithError(err, "apimanagement.IssueClient", "ListByService", resp, "Failure responding to request")
return
}
if result.ic.hasNextLink() && result.ic.IsEmpty() {
err = result.NextWithContext(ctx)
return
}
return
}
// ListByServicePreparer prepares the ListByService request.
func (client IssueClient) ListByServicePreparer(ctx context.Context, resourceGroupName string, serviceName string, filter string, top *int32, skip *int32) (*http.Request, error) {
pathParameters := map[string]interface{}{
"resourceGroupName": autorest.Encode("path", resourceGroupName),
"serviceName": autorest.Encode("path", serviceName),
"subscriptionId": autorest.Encode("path", client.SubscriptionID),
}
const APIVersion = "2019-12-01"
queryParameters := map[string]interface{}{
"api-version": APIVersion,
}
if len(filter) > 0 {
queryParameters["$filter"] = autorest.Encode("query", filter)
}
if top != nil {
queryParameters["$top"] = autorest.Encode("query", *top)
}
if skip != nil {
queryParameters["$skip"] = autorest.Encode("query", *skip)
}
preparer := autorest.CreatePreparer(
autorest.AsGet(),
autorest.WithBaseURL(client.BaseURI),
autorest.WithPathParameters("/subscriptions/{subscriptionId}/resourceGroups/{resourceGroupName}/providers/Microsoft.ApiManagement/service/{serviceName}/issues", pathParameters),
autorest.WithQueryParameters(queryParameters))
return preparer.Prepare((&http.Request{}).WithContext(ctx))
}
// ListByServiceSender sends the ListByService request. The method will close the
// http.Response Body if it receives an error.
func (client IssueClient) ListByServiceSender(req *http.Request) (*http.Response, error) {
return client.Send(req, azure.DoRetryWithRegistration(client.Client))
}
// ListByServiceResponder handles the response to the ListByService request. The method always
// closes the http.Response Body.
func (client IssueClient) ListByServiceResponder(resp *http.Response) (result IssueCollection, err error) {
err = autorest.Respond(
resp,
azure.WithErrorUnlessStatusCode(http.StatusOK),
autorest.ByUnmarshallingJSON(&result),
autorest.ByClosing())
result.Response = autorest.Response{Response: resp}
return
}
// listByServiceNextResults retrieves the next set of results, if any.
func (client IssueClient) listByServiceNextResults(ctx context.Context, lastResults IssueCollection) (result IssueCollection, err error) {
req, err := lastResults.issueCollectionPreparer(ctx)
if err != nil {
return result, autorest.NewErrorWithError(err, "apimanagement.IssueClient", "listByServiceNextResults", nil, "Failure preparing next results request")
}
if req == nil {
return
}
resp, err := client.ListByServiceSender(req)
if err != nil {
result.Response = autorest.Response{Response: resp}
return result, autorest.NewErrorWithError(err, "apimanagement.IssueClient", "listByServiceNextResults", resp, "Failure sending next results request")
}
result, err = client.ListByServiceResponder(resp)
if err != nil {
err = autorest.NewErrorWithError(err, "apimanagement.IssueClient", "listByServiceNextResults", resp, "Failure responding to next results request")
}
return
}
// ListByServiceComplete enumerates all values, automatically crossing page boundaries as required.
func (client IssueClient) ListByServiceComplete(ctx context.Context, resourceGroupName string, serviceName string, filter string, top *int32, skip *int32) (result IssueCollectionIterator, err error) {
if tracing.IsEnabled() {
ctx = tracing.StartSpan(ctx, fqdn+"/IssueClient.ListByService")
defer func() {
sc := -1
if result.Response().Response.Response != nil {
sc = result.page.Response().Response.Response.StatusCode
}
tracing.EndSpan(ctx, sc, err)
}()
}
result.page, err = client.ListByService(ctx, resourceGroupName, serviceName, filter, top, skip)
return
}
|
Azure/azure-sdk-for-go
|
services/apimanagement/mgmt/2019-12-01/apimanagement/issue.go
|
GO
|
mit
| 11,883
|
/*===========================================================================
* Licensed Materials - Property of IBM
* "Restricted Materials of IBM"
*
* IBM SDK, Java(tm) Technology Edition, v8
* (C) Copyright IBM Corp. 1999, 1999. All Rights Reserved
*
* US Government Users Restricted Rights - Use, duplication or disclosure
* restricted by GSA ADP Schedule Contract with IBM Corp.
*===========================================================================
*/
/*
* Copyright (c) 1999, Oracle and/or its affiliates. All rights reserved.
* ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*/
package java.security.interfaces;
import java.math.BigInteger;
/**
* The interface to an RSA public or private key.
*
* @author Jan Luehe
*
* @see RSAPublicKey
* @see RSAPrivateKey
*
* @since 1.3
*/
public interface RSAKey {
/**
* Returns the modulus.
*
* @return the modulus
*/
public BigInteger getModulus();
}
|
flyzsd/java-code-snippets
|
ibm.jdk8/src/java/security/interfaces/RSAKey.java
|
Java
|
mit
| 1,040
|
namespace Chloe.Server.Models
{
public class ArticleCategory: BaseEntity
{
public ArticleCategory()
{
}
}
}
|
QuinntyneBrown/azure-search-getting-started
|
src/Chloe.Server.Models/ArticleCategory.cs
|
C#
|
mit
| 147
|
# Release History
This document describes substantial or breaking changes to the Event Data system.
## Changes
### [2019-01-10] Change to Twitter URLs
- [event-data-user-guide 1.2.2](https://github.com/CrossRef/event-data-user-guide/releases/tag/1.2.2)
- [event-data-agents 0.1.17](https://github.com/CrossRef/event-data-agents/releases/tag/0.1.17)
- [event-investigator 0.1.5](https://github.com/CrossRef/event-data-investigator/releases/tag/0.1.5)
New Twitter guidance means that for future Events we are unable to share Tweet URLs. Instead we use custom URIs to express Tweet IDs and author usernames. They still contain all the necessary information to identify the Twitter Content and retrieve the data from the Twitter APIs. Full documentation on the [Twitter Agent](/sources/twitter/) page.
### [2019-01-10] Update Release History page and copy editing
- [event-data-user-guide 1.2.1](https://github.com/crossref/event-data-user-guide/tree/1.2.1)
The Release History page now tracks substantial changes to the Event Data Service, not just changes to the documentation. From this point onward it also includes versions of software releases that correspond to changes.
The guide was also reviewed for wording.
## Older changes
Before this point changes only pertain to the documentation.
### [2018-09-21] Documentation review
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 1.2.0
### [2018-03-06] New Version 1 API, breaking changes.
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 1.1.0
#### [2017-05-06] Added Canonical URL information, Evidence Logs
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 1.0.1
### [2017-05-06] Beta
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 1.0.0
### [2017-03-09] Documentation review
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 0.7.0
Complete review of all documentation. Most of it overhauled. |
### [2017-02-22] Pre-Beta
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 0.6.1
Pre-beta adjustments. Reflects major refactor of services. |
### [2016-11-09] Query API syntax changes
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 0.5.1
Query Syntax adjusted from old filter syntax `a:b,c:d` to `a=b&c&d`.
### [2016-09-27] Updated Evidence Record information
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 0.5
### [2016-09-08] Complete rewrite using new concepts and components
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 0.4
### [2016-08-16] Remove Relations & Deposits, update new Query API
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 0.3
### [2016-04-19] Add 'Contributing to Event Data'
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 0.2
### [2016-04-18] Initial MVP release
- [event-data-user-guide](https://github.com/crossref/event-data-user-guide) 0.1
|
CrossRef/event-data-user-guide
|
docs/history.md
|
Markdown
|
mit
| 3,090
|
import React from 'react'
const columnTypeProptypes = React.PropTypes.oneOf([
'boolean',
'custom',
'text',
])
export default columnTypeProptypes
|
npoirey/16AGR
|
frontend/src/js/core/proptypes/table/columnTypeProptypes.js
|
JavaScript
|
mit
| 153
|
import test from 'ava';
import deep from 'deep-equal';
import fn from './';
const target = {
key1: 'value1',
key2: 1,
key3: [3, 'value3'],
key4: {
key41: 'value41',
key42: 'value42'
},
key5: [
'value51', 'value51', 'value51'
],
key6: {
key61: {
key611: [
'value6111', 'value6112'
]
}
},
key7: [
['value71', {key72: 'value72'}]
],
key8: [
[{key81: ['value81', 'value82']}]
],
key9: [
'key91'
],
key10: {
key101: [
'value1011', 'value1012', {key1013: 'value1013'}
]
}
};
const expected = [
'key1="value1"',
'key2=1',
'key3=[3,"value3"]',
'key4={"key41":"value41","key42":"value42"}',
'key5=["value51","value51","value51"]',
'key6={"key61":{"key611":["value6111","value6112"]}}',
'key7=[["value71",{"key72":"value72"}]]',
'key8=[[{"key81":["value81","value82"]}]]',
'key9=["key91"]',
'key10={"key101":["value1011","value1012",{"key1013":"value1013"}]}'
];
test('returns well-serialized string', t => {
const values = fn.pairify(target);
expected.forEach(function (v, i) {
t.is(values[i], v);
});
});
test('deserialized strings', t => {
for (const [key, v] of Object.entries(fn.parse(fn.pairify(target)))) {
t.true(deep(v, target[key]));
}
});
|
ragingwind/field-value
|
test.js
|
JavaScript
|
mit
| 1,214
|
<?php
/**
* @name Yinhoomail
* @desc 通过亿邻（Yinhoo.com）提供的邮件接口来发送邮件
* @author 阿发@YOKA
* @createtime 2009-8-12
* @updatetime
* 说明：
* 因为同是发送邮件功能，为了让大家使用习惯，及以后更改方便
* 大部分函数参数及用法参考并沿用了了Mail.class.php
*
* 使用方法：
*
* $ToAddress="alfa@yoka.com";
* $Subject="This is 测试";
* $HtmlCode = <<<HTMLCODE
* <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
* <html>
* <head>
* <meta http-equiv="Content-Type" content="text/html; charset=UTF8">
* <title>Insert title here</title>
* </head>
* <body>
* 测试<img src="http://images.yoka.com/pic/news/2009/0602/logo.gif" />
* <img src="http://images.yoka.com/pic/news/2009/0602/logo.gif">
* <a href="http://www.yoka.com">YOKA时尚</a>
* </body>
* </html>
* HTMLCODE;
*
* $SendMailObj = new YinHooMail();
* $sendmsg=$SendMailObj->smtp($ToAddress,$Subject,$HtmlCode);
*
*
* 发送格式能过XMLRPC方式通讯，因为我懒得自己写底层代码，直接从网上找了一个可以用的PHPXMLRPC
* 网址：http://phpxmlrpc.sourceforge.net/
* 版本：2.2.2 release
* Lib放在了_YEPF/CLASS/xmlrpc里面
* XMLRPC的BUG：
* xmlrpc原版中使用的是ISO-8859-1编码，我强行改成了UTF-8编码，否则发送的邮件为乱码
* 更改位置：xmlrpc.inc文件的第232行
* 232: /// $GLOBALS['xmlrpc_internalencoding']='ISO-8859-1';
* $GLOBALS['xmlrpc_internalencoding']='UTF-8';
*
* 亿邻给我们的配置信息：
* client_id : 10050
* user_id : 237
* password: asqweURJ5ioer8p52ksADWuiksdu2340
* ip: 123.127.90.2 , 119.161.129.213
* xmlRpcHost: http://ma2.elink-u.cn:9508/TriggerXmlRpcServlet/
* 最大并行发送量: 5
* 日最大发送量: 20000
*
**/
namespace ext;
if(!defined('YOKA')) exit('Illegal Request');
include (YEPF_PATH . '/ext/xmlrpc/xmlrpc.inc');
class YinHooMail implements \MailInterface
{
/**
* @name send
* @desc 发送邮件函数
* @param string $to 接收人email
* @param string $subject 邮件标题
* @param string $content 邮件内容
* @param string $error 错误编号
* @return mixed 是否成功
*/
/*
* 客户在亿邻智能邮件系统中的客户编号.
*/
private $YHClientID;
/*
* 调用者在亿邻智能邮件系统中的用户编号.
*/
private $YHUserID;
/*
* 客户调用亿邻邮件代理引擎时的密码
*/
private $YHPassword;
/*
* 待发送的邮件标题
*/
private $YHSubject;
/*
* 邮件发送名的姓名(名称),如 admin
*/
private $YHFromname;
/*
* 邮件发送地址.
*/
private $YHFromAddress;
/*
* 邮件回复时看到回复接收人姓名
*/
private $YHReplyName;
/*
* 邮件的回复地址.
*/
private $YHReplyAddress;
/*
* 邮件接收人.如果要发送给多个人是请采用”,”进行分割,最大不能超过 5 个
*/
private $YHToAddress;
/*
* 要发送的邮件格式. 0=HTML,1=Text,2=Multipart
*/
private $YHFormatID;
/*
* text 格式的邮件内容,如果是发送 html 格式的邮件,该字段值可以为空.
*/
private $YHTextContent;
/*
* html 格式的邮件内容,如果是发送 text 格式的邮件,该字段值可以为空.
*/
private $YHHtmlContent;
/*
* 邮件发送过程中经常会遇到临时拒绝(如灰名单重试),遇到这种
* 情况的时候.第一发送会发送失败, 但是根据对方邮件服务器的反馈等待一定常的时间(一
* 般需要 1 至 5 分钟)后采取一定的策略重复发送一次,可以发送成功. 该参数定义遇到临时
* 决绝的时候系统如何处理.
* 0=不做任何处理,直接返回第一发送的错误;
* 1=立即返回第一发送的错误信息,但是正常等待和重复发送第二次.发送结束后缓存发
* 送结果.供查询用.
* 2=按要求等待,然后发送第二次, 直到第二次发送结束后再返回结果.
*/
private $YHResendEmailhandleStyle;
/*
* 连接对方 smtp 服务器等待超时时长. 如果该值小于等于 0,则采用系统缺省值.
*/
private $YHConnectTimeout;
/*
* 对方 smtp 响应等待时长, 如果该值小于等于 0 则采用缺省值.
*/
private $YHSMTPTimeOut;
/*
* XMLRPC地址
*/
private $YHMAIL_XMLRPC;
/*
* HOST
*/
private $YHMAIL_HOST;
/*
* PORT
*/
private $YHMAIL_PORT;
public function __construct($ClientID,$UserID,$Password,$Fromname,$FromAddress,$ReplyName,$ReplyAddress,$FormatID,$ResendEmailhandleStyle,$ConnectTimeout,$SMTPTimeOut,$XMLRPC, $HOST, $PORT)
{
$this->YHClientID=$ClientID;
$this->YHUserID=$UserID;
$this->YHPassword=$Password;
/// $this->YHSubject=$Subject;
$this->YHFromname=$Fromname;
$this->YHFromAddress=$FromAddress;
$this->YHReplyName=$ReplyName;
$this->YHReplyAddress=$ReplyAddress;
/// $this->YHToAddress=$ToAddress;
$this->YHFormatID=$FormatID;
/// $this->YHTextContent=$TextContent;
/// $this->YHHtmlContent=$HtmlContent;
$this->YHResendEmailhandleStyle=$ResendEmailhandleStyle;
$this->YHConnectTimeout=$ConnectTimeout;
$this->YHSMTPTimeOut=$SMTPTimeOut;
$this->YHMAIL_XMLRPC=$XMLRPC;
$this->YHMAIL_HOST=$HOST;
$this->YHMAIL_PORT=$PORT;
}
public function send($to, $subject, $content, &$error = '')
{
$PARAClientID=new xmlrpcval($this->YHClientID,'string');
$PARAUserID=new xmlrpcval($this->YHUserID,'string');
$PARAPassword=new xmlrpcval($this->YHPassword,'string');
$PARASubject=new xmlrpcval($subject,'string');
$PARAFromname=new xmlrpcval($this->YHFromname,'string');
$PARAFromAddress=new xmlrpcval($this->YHFromAddress,'string');
$PARAReplyName=new xmlrpcval($this->YHReplyName,'string');
$PARAReplyAddress=new xmlrpcval($this->YHReplyAddress,'string');
$PARAToAddress=new xmlrpcval($to,'string');
$PARAFormatID=new xmlrpcval($this->YHFormatID,'string');
$PARATextContent=new xmlrpcval($content,'string');
$PARAHtmlContent=new xmlrpcval($content,'string');
$PARAResendEmailhandleStyle=new xmlrpcval($this->YHResendEmailhandleStyle,'string');
$PARAConnectTimeout=new xmlrpcval($this->YHConnectTimeout,'string');
$PARASMTPTimeOut=new xmlrpcval($this->YHSMTPTimeOut,'string');
$YHParameters=array(
$PARAClientID,
$PARAUserID,
$PARAPassword,
$PARASubject,
$PARAFromname,
$PARAFromAddress,
$PARAReplyName,
$PARAReplyAddress,
$PARAToAddress,
$PARAFormatID,
$PARATextContent,
$PARAHtmlContent,
$PARAResendEmailhandleStyle,
$PARAConnectTimeout,
$PARASMTPTimeOut,
);
$YHMsg=new xmlrpcmsg("TriggerHandler.sendMail", $YHParameters);
$YHXMLRPCClient=new xmlrpc_client($this->YHMAIL_XMLRPC, $this->YHMAIL_HOST, $this->YHMAIL_PORT);
/// alfa 设置调试等级
/// $YHXMLRPCClient->setDebug(2);
$YHXMLRPCReturn=$YHXMLRPCClient->send($YHMsg);
if(!$YHXMLRPCReturn->faultCode())
{
/*
* 亿邻返回的信息格式：
*
*
* <?xml version="1.0" encoding="GBK"?>
* <result>
* <unique-id>000000000W9C9ZPU</unique-id> /// 每封邮件的ID
* <result-flag>1</result-flag> /// 发送状态 1=成功,0=失败,2=暂停
* <error-type-id>-1</error-type-id> /// 错误代码
* <error-info></error-info> /// 错误信息
* <begin-time>2009-08-14 18:03:09.509</begin-time> /// 开始发送时间
* <finish-time>2009-08-14 18:03:15.9</finish-time> /// 结束时间
* <delay-time>0</delay-time></result> /// 暂停时间，只有前面的flag为2时，此值才有用
*
*
*/
$Tmpxml = simplexml_load_string($YHXMLRPCReturn->value()->scalarval());
foreach($Tmpxml as $key=>$value)
{
$TmpData[$key]=$value;
}
/*
* 失败返回错误信息，成功返回邮件ID
*/
$TmpResult=(int)$TmpData['result-flag'];
if( $TmpResult != 1)
{
$error=$TmpData['error-info'];
return false;
}
else
{
$YHMailID=$TmpData['unique-id'];
return $YHMailID;
}
}
else
{
$error = $YHXMLRPCReturn->faultCode() . $YHXMLRPCReturn->faultString();
return false;
}
}
}
?>
|
jimmydong/YEPF3
|
ext/YinHooMail.class.php
|
PHP
|
mit
| 8,354
|
const util = require('util');
/**
* The request was invalid for a specific reason.
*
* @param {*} message A message describing the issue.
*
* @constructor
*/
const InvalidRequest = function (message) {
Error.captureStackTrace(this, this);
this.message = message;
};
util.inherits(InvalidRequest, Error);
InvalidRequest.prototype.name = 'InvalidRequest';
module.exports = InvalidRequest;
|
SOHU-Co/kafka-node
|
lib/errors/InvalidRequestError.js
|
JavaScript
|
mit
| 400
|
# -*- coding: utf-8 -*-
# Generated by Django 1.10 on 2016-08-09 16:39
from __future__ import unicode_literals
from django.db import migrations, models
class Migration(migrations.Migration):
initial = True
dependencies = [
]
operations = [
migrations.CreateModel(
name='Tag',
fields=[
('id', models.AutoField(auto_created=True, primary_key=True, serialize=False, verbose_name='ID')),
('tag', models.CharField(max_length=100)),
('created', models.DateTimeField(editable=False)),
('modified', models.DateTimeField()),
],
),
]
|
internship2016/sovolo
|
app/tag/migrations/0001_initial.py
|
Python
|
mit
| 666
|
#!/bin/sh
./node_modules/.bin/babel src/ --out-dir .tmp/
./node_modules/.bin/browserify -r ./.tmp/sandy.js:Sandy > dist/sandy.js
|
parambirs/aui-demos
|
node_modules/@atlassian/aui/node_modules/sandy/build/build.sh
|
Shell
|
mit
| 129
|
CONTROLLERS = {}
BaseController = { }
local vnet = LibK.GLib.vnet
function BaseController:included( class )
function class.static.getInstance( class )
class.static.instance = class.static.instance or class:new( )
return class.static.instance
end
end
--Call for auto sending an error message to the specified view, if error outside of internal range(<0)
function BaseController:reportError( view, ply, strDesc, errid, err )
if errid < 1 then
self:startView( view, "displayError", ply, Format( "%s, Internal Error( Code %i )", strDesc, errid or -4000 ) )
else
self:startView( view, "displayError", ply, Format( "%s: %s", strDesc, err ) )
end
end
util.AddNetworkString( "LibK_StartView" )
function BaseController:startView( viewName, func, target, ... )
--Prepare the data
local vars = { ... }
--generate net tables for class instances that are passed as args
local netTable = generateNetTable( vars )
if not target or ( type( target ) != "Player" and not istable( target ) ) then
error( "Invalid arg #3 to startView, player/playerTable expected, got " .. type( target ), 2 )
end
if istable( target ) and #target == 0 then
return
end
local packet = vnet.CreatePacket( "LibK_StartView" )
packet:String( viewName )
packet:String( func )
packet:Table( netTable )
packet:AddTargets( target )
packet:Send( )
end
util.AddNetworkString( "LibK_Transaction" )
vnet.Watch( "LibK_Transaction", function( packet )
local len = packet.Size
local ply = packet.Source
local transactionId = packet:Int( )
local controller = packet:String( )
local action = packet:String( )
local view = packet:String( )
local args = packet:Table( )
local controllerClass = getClass(controller)
if not controllerClass then
error( "Got action request for invalid controller " .. controller .. " (" .. tostring(action) .. ")" )
end
local instance = controllerClass:getInstance( )
--Debug log
local argStrs = {}
for k, v in pairs( args ) do
table.insert( argStrs, tostring( v ) )
end
KLogf( 4, "%s@%s -> %s:%s( %s ) | Transaction %i len %i, Compressed: %s", ply:Nick( ), view, controller, action, table.concat( argStrs, " ," ), transactionId, len, packet.Compressed )
instance:canDoAction( ply, action )
:Then( function( )
local def = Deferred( )
if LibK.Debug then
local promise = instance[action]( instance, ply, unpack( args ) )
if not promise or not istable( promise ) then
def:Reject( "Internal Server Error 403" ) --bad gateway? hmmm w/e
ErrorNoHalt( "Invalid transaction " .. action .. ", doesn't return a promise" )
KLogf( 1, "LUA Error in Controller " .. controller .. " action " .. action .. ":\n" )
debug.Trace( )
else
--Forward promise to transaction
promise:Done( function( ... )
def:Resolve( ... )
end )
promise:Fail( function( ... )
def:Reject( ... )
end )
end
else
local promise = instance[action]( instance, ply, unpack( args ) )
if not promise or not istable ( promise ) then
def:Reject( "500 - Internal Server Error" )
ErrorNoHalt( "Invalid transaction " .. action .. ", doesn't return a promise, help!")
else
promise:Done ( function( ... )
def:Resolve( ... )
end )
promise:Fail( function ( ... )
def:Reject( ... )
end )
end
end
return def:Promise( )
end )
:Done( function( ... )
instance:startView( view, "transactionCompleted", ply, transactionId, true, ... )
end )
:Fail( function( ... )
instance:startView( view, "transactionCompleted", ply, transactionId, false, ... )
end )
end, { vnet.OPTION_WATCH_OVERRIDE } )
--Override for access controll
--returns a promise, resolved if user can do it, rejected with error if he cant
function BaseController:canDoAction( ply, action )
local def = Deferred( )
def:Reject( 1, "Access Denied" )
return def:Promise( )
end
util.AddNetworkString( "ControllerAction" )
vnet.Watch( "ControllerAction", function( packet )
local ply = packet.Source
local len = packet.Size
local controller = packet:String( )
local action = packet:String( )
local view = packet:String( )
local args = packet:Table( )
local controllerClass = getClass(controller)
if not controllerClass then
error( "Got action request for invalid controller " .. controller .. " (" .. tostring(action) .. ")" )
end
local instance = controllerClass:getInstance( )
--Debug log
local argStrs = {}
for k, v in pairs( args ) do
table.insert( argStrs, tostring( v ) )
end
KLogf( 4, "%s@%s -> %s:%s( %s ) len %i", ply:Nick( ), view, controller, action, table.concat( argStrs, " ," ), len )
instance:canDoAction( ply, action )
:Then( function( )
if LibK.Debug then
return instance[action]( instance, ply, unpack( args ) )
else
local succ, err = xpcall( instance[action], LibK.GLib.Error, instance, ply, unpack( args ) )
if not succ then
KLogf( 1, "LUA Error in Controller " .. controller .. " action " .. action .. ":\n" )
KLogf( 1, tostring( err ) )
return Promise.Reject( 1, "There was a Lua error. Please check the server console for details." )
end
return err
end
end )
:Fail( function( errid, err )
instance:startView( view, "displayError", ply, tostring(errid) .. ": " .. tostring(err), "Server Error" )
end )
end, { vnet.OPTION_WATCH_OVERRIDE } )
|
Kamshak/LibK
|
lua/libk/server/sv_libk_BaseController.lua
|
Lua
|
mit
| 5,295
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>RoboDog Voice Control: Member List</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">RoboDog Voice Control
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="classes.html"><span>Class Index</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">voiceController Member List</div> </div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="classvoiceController.html">voiceController</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="classvoiceController.html#af851fc9ef22db782ec0e03a159c88711">matchCommand</a>(const std::string &signal)</td><td class="entry"><a class="el" href="classvoiceController.html">voiceController</a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="classvoiceController.html#a400c690ab78be3dcb186aa22fcaacee4">seeCommandList</a>()</td><td class="entry"><a class="el" href="classvoiceController.html">voiceController</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="classvoiceController.html#a8bcf53c67777c9808bc54c10001da941">train</a>(const std::string &cmdname, const std::string &signal)</td><td class="entry"><a class="el" href="classvoiceController.html">voiceController</a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="classvoiceController.html#a8746e8b3c0efd2735b6b8a816fbacce4">voiceController</a>()</td><td class="entry"><a class="el" href="classvoiceController.html">voiceController</a></td><td class="entry"></td></tr>
</table></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by  <a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.11
</small></address>
</body>
</html>
|
rubenacevedo3/cpp-RoboDogVoiceController
|
doxygenfiles/html/classvoiceController-members.html
|
HTML
|
mit
| 5,021
|
<!DOCTYPE html>
<html lang="en">
<head>
<title>Time and Habits</title>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<!-- CSS Links-->
<link rel="stylesheet" type="text/css" href="https://cdnjs.cloudflare.com/ajax/libs/normalize/3.0.3/normalize.css">
<link rel="stylesheet" type="text/css" href="https://cdnjs.cloudflare.com/ajax/libs/skeleton/2.0.4/skeleton.css">
<link rel="stylesheet" type="text/css" href="https://anna-marie-vos.github.io/styles/main.css">
</head>
<body>
<div class="container">
<header class="LogoTitle row">
<div class="logo four columns">
<img src="file:///home/dev/workspace/anna-marie-vos.github.io/images/pic2.jpg" alt=" logo pic">
</div>
<div class="TitleCnnectProtfolio eight columns">
<h1 class="Title twelve columns">
Timebox
</h1>
<nav class="row">
<a class="click one-third column u-max-full-width" href="https://anna-marie-vos.github.io/index.html">Home</a>
</nav>
</div>
</header>
<article class="Blogs row">
<h2 class="MainButton four columns">
What did I find interesting?
</h2>
<div class="eight columns">
<p>
This quote really resonated with me "display you ability first. Prove it to yourself and then you'll believe it". I also liked the idea of the pomodorotechnique. I've never read-up or tried meditation before, but it is an interesting concept.
</p>
</div>
</article>
<article class="About row">
<h2 class="MainButton four columns">
What worked for me?
</h2>
<div class="eight columns">
<p>
Well to be fair, this weeks work was a bit of a blurr (days just seemed to fly by). I did group my time into brackets which helped, and helped to drown out all the other "life stuff". I have my own little motto: "If something bothers you, and you can do something about it, then do something about it. And if you can't do anything about it, then don't worry about it."
It works for most things.
</p>
</div>
</article>
<article class="Blogs row">
<h2 class="MainButton four columns">
With what will I experiment further?
</h2>
<div class="eight columns">
<p>
I'm definately going to experiment with the "tiny habits". And maybe some meditation?... maybe.
</p>
</div>
</article>
<footer class="">
<a class="click absright" href="#">Top</a>
</footer>
</div>
</body>
</html>
|
anna-marie-vos/anna-marie-vos.github.io
|
blog/c1-time-and-habits-blog.html
|
HTML
|
mit
| 2,759
|
---
layout: post
title: "Nine Pictures"
date: 2016-09-24 15:39:40
permalink: nine-pictures
preview: http://zihan.design/PUB/./public/database/zihan.design/assets/images/2016-09-24/2.jpg
---
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
|
nkgalar/nkgalar.github.io
|
_posts/2016-09-24-nine-pictures.md
|
Markdown
|
mit
| 1,178
|
# Vim Configuration
[](https://github.com/rxrc/vimrc/releases)
[](./LICENSE.txt)
**Depreciated in favor of nvimrc!**
I've migrated this configuration to Neovim: [rxrc/nvimrc].
[rxrc/nvimrc]: https://github.com/rxrc/nvimrc
**If you are creating a new config, use [makenew/nvimrc].**
If you still need to make a legacy Vim config,
the `minimal` branch remains a stable starting point.
[makenew/nvimrc]: https://github.com/makenew/nvimrc
My complete Vim configuration as a Vim plugin.
For an empty starting config that follows the same organization,
switch to the `minimal` branch.
Note that versioned released are cut from the `minimal` branch,
and changes between those releases are documented in the
[CHANGELOG](./CHANGELOG.md).
The `master` branch represents my current Vim environment,
and is intended to remain unversioned.
## Description
This configuration system works as a meta-plugin:
all desired Vim plugins are loaded from `plugins.vim` using [vim-plug].
Overall configuration then follows a normal plugin structure.
For documentation of the methodology behind my specific
Vim environment, including tips, usage, and a reference of custom mappings,
see `:help rxrc/vimrc` or view [vimrc.txt](./doc/vimrc.txt) directly.
[vim-plug]: https://github.com/junegunn/vim-plug
## Installation
### Required Packages
- The [fzf] binary (vim-plug is not configured to manage it here).
Additionally, [urxvt] is configured as the fzf launcher for Gvim.
- [The Silver Searcher], aka Ag.
- See [vim-fireplace] for the Clojure specific plugin dependences.
[fzf]: https://github.com/junegunn/fzf
[The Silver Searcher]: http://geoff.greer.fm/ag/
[urxvt]: http://software.schmorp.de/pkg/rxvt-unicode.html
[vim-fireplace]: https://github.com/tpope/vim-fireplace
### Required Fonts
This configuration uses [Inconsolata-g], and
vim-airline is set to use [Powerline fonts].
[Inconsolata-g]: https://github.com/powerline/fonts/tree/master/Inconsolata-g
[Powerline fonts]: https://github.com/powerline/fonts
### Automatic Install
You can install this via the command-line with either curl
```
$ curl -L https://git.io/vJAzK | sh
```
or wget
```
$ wget https://git.io/vJAzK -O - | sh
```
### Manual Install
1. Install [vim-plug].
2. Create `~/.vimrc` with
```vim
" rxrc/vimrc
" Disable powerline by default.
let g:powerline_loaded = 1
" Disable session autosave prompt.
let g:session_autosave = 'no'
" Skip initialization for vim-tiny or vim-small.
if !1 | finish | endif
call plug#begin($HOME . '/.vim/plugged')
if filereadable($HOME . '/.vim/plugged/vimrc/plugins.vim')
source $HOME/.vim/plugged/vimrc/plugins.vim
if $VIMRC_INSTALL == 'true'
PlugInstall
else
Plug 'rxrc/vimrc'
endif
else
Plug 'rxrc/vimrc', { 'on': [] }
PlugInstall
endif
call plug#end()
```
3. Run
```
$ vim -c qall!
$ VIMRC_INSTALL=true vim -c qall!
```
## Updating
Updating is handled via the normal [vim-plug commands].
Here is an example of a Zsh function that will provide a one-step update:
```zsh
# Upgrade vimrc.
function vimupg () {
if ! [[ -e $HOME/.vim/autoload/plug.vim ]]; then
echo 'vim-plug is not installed.'
return 1
fi
vim -c PlugUpgrade -c qall
vim -c PlugUpdate -c qall
vim -c PlugInstall -c qall
vim -c PlugClean! -c qall
}
```
[vim-plug commands]: https://github.com/junegunn/vim-plug#commands
## Customization
You can customize this configuration or manage your own in the same way.
1. Clone or fork this.
If you prefer a clean start, clone the `minimal` branch:
it has the same structure and development tools but with
a very minimal configuration.
Tagged releases are based on that branch.
2. Replace any instance of `rxrc/vimrc`
with the path to your repository's location.
If you do not host this on GitHub,
you may need to adjust the repository path appropriately.
3. Customize `package.json`.
4. Update `install.sh` on the `gh-pages` branch.
5. Update the urls for the install script in this README.
Here is an example of a command you can use to make replacements:
```
$ git ls-files -z | xargs -0 sed -i 's/rxrc\/vimrc/username\/vimrc/g'
```
## Development
You can use [Gulp] to switch to development mode
which will configure vim-plug to use the development
directory as the plugin path.
First, follow the normal install steps if you haven't already.
Then, install the development dependences via [npm] with
```
$ npm install
```
Enter development mode with
```
$ npm start
```
If you modify `plugins.vim`,
run `npm run dev` again to reconfigure the plugins.
Switch out of development mode with
```
$ npm stop
```
[Gulp]: http://gulpjs.com/
[npm]: https://www.npmjs.com/
## Contributing
Please submit and comment on bug reports and feature requests.
To submit a patch:
1. Fork it (https://github.com/rxrc/vimrc/fork).
2. Create your feature branch (`git checkout -b my-new-feature`).
3. Make changes.
4. Commit your changes (`git commit -am 'Add some feature'`).
5. Push to the branch (`git push origin my-new-feature`).
6. Create a new Pull Request.
## License
This Vim configuration is licensed under the MIT license.
## Warranty
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.
|
rxrc/vimrc
|
README.md
|
Markdown
|
mit
| 5,529
|
//
// BodyPartMessage.cs
//
// Author: Jeffrey Stedfast <jestedfa@microsoft.com>
//
// Copyright (c) 2013-2020 .NET Foundation and Contributors
//
// 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.
//
using System;
using System.Text;
namespace MailKit {
/// <summary>
/// A message/rfc822 body part.
/// </summary>
/// <remarks>
/// Represents a message/rfc822 body part.
/// </remarks>
public class BodyPartMessage : BodyPartBasic
{
/// <summary>
/// Initializes a new instance of the <see cref="MailKit.BodyPartMessage"/> class.
/// </summary>
/// <remarks>
/// Creates a new <see cref="BodyPartMessage"/>.
/// </remarks>
public BodyPartMessage ()
{
}
/// <summary>
/// Gets the envelope of the message, if available.
/// </summary>
/// <remarks>
/// Gets the envelope of the message, if available.
/// </remarks>
/// <value>The envelope.</value>
public Envelope Envelope {
get; set;
}
/// <summary>
/// Gets the body structure of the message.
/// </summary>
/// <remarks>
/// Gets the body structure of the message.
/// </remarks>
/// <value>The body structure.</value>
public BodyPart Body {
get; set;
}
/// <summary>
/// Gets the length of the message, in lines.
/// </summary>
/// <remarks>
/// Gets the length of the message, in lines.
/// </remarks>
/// <value>The number of lines.</value>
public uint Lines {
get; set;
}
/// <summary>
/// Dispatches to the specific visit method for this MIME body part.
/// </summary>
/// <remarks>
/// This default implementation for <see cref="MailKit.BodyPart"/> nodes
/// calls <see cref="MailKit.BodyPartVisitor.VisitBodyPart"/>. Override this
/// method to call into a more specific method on a derived visitor class
/// of the <see cref="MailKit.BodyPartVisitor"/> class. However, it should still
/// support unknown visitors by calling
/// <see cref="MailKit.BodyPartVisitor.VisitBodyPart"/>.
/// </remarks>
/// <param name="visitor">The visitor.</param>
/// <exception cref="System.ArgumentNullException">
/// <paramref name="visitor"/> is <c>null</c>.
/// </exception>
public override void Accept (BodyPartVisitor visitor)
{
if (visitor == null)
throw new ArgumentNullException (nameof (visitor));
visitor.VisitBodyPartMessage (this);
}
/// <summary>
/// Encodes the <see cref="BodyPart"/> into the <see cref="System.Text.StringBuilder"/>.
/// </summary>
/// <remarks>
/// Encodes the <see cref="BodyPart"/> into the <see cref="System.Text.StringBuilder"/>.
/// </remarks>
/// <param name="builder">The string builder.</param>
protected override void Encode (StringBuilder builder)
{
base.Encode (builder);
builder.Append (' ');
Encode (builder, Envelope);
builder.Append (' ');
Encode (builder, Body);
builder.Append (' ');
Encode (builder, Lines);
}
}
}
|
jamie-dainton/MailKit
|
MailKit/BodyPartMessage.cs
|
C#
|
mit
| 3,919
|
//
// RootPopViewController.h
// ChaoCiYuanXinFan
//
// Created by qianfeng on 15/8/26.
// Copyright (c) 2015年 lyning. All rights reserved.
//
#import <UIKit/UIKit.h>
typedef enum : NSUInteger{
ShortLength,
LongLength
} BgImageLength;
@interface RootPopViewController : UIViewController
- (void)addNav:(NSString *)title bgImage:(NSString *)imageName type:(BgImageLength)type rightBtn:(UIButton *)btn withLength:(CGFloat)length;
@end
|
lynnx4869/ChaoCiYuanXinFan
|
ChaoCiYuanXinFan/ChaoCiYuanXinFan/Utility/RootPopViewController.h
|
C
|
mit
| 452
|
//
// AppDelegate.h
// DoubleScreenMatchIt
//
// Created by yangqibin on 13-9-20.
// Copyright __MyCompanyName__ 2013年. All rights reserved.
//
#import <UIKit/UIKit.h>
#import "cocos2d.h"
@interface AppController : NSObject <UIApplicationDelegate, CCDirectorDelegate>
{
UIWindow *window_;
UINavigationController *navController_;
CCDirectorIOS *director_; // weak ref
}
@property (nonatomic, retain) UIWindow *window;
@property (readonly) UINavigationController *navController;
@property (readonly) CCDirectorIOS *director;
@end
|
pipi32167/DoubleScreenMatchIt
|
DoubleScreenMatchIt/DoubleScreenMatchIt/AppDelegate.h
|
C
|
mit
| 548
|
require.ensure([], function(require) {
require("./105.async.js");
require("./211.async.js");
require("./423.async.js");
require("./845.async.js");
});
module.exports = 846;
|
skeiter9/javascript-para-todo_demo
|
webapp/node_modules/webpack/benchmark/fixtures/846.async.js
|
JavaScript
|
mit
| 172
|
require 'oauth'
require 'json'
require 'mime/types'
require 'wrike/client'
module Wrike
VERSION = '0.1.0'
end
|
mscifo/wrike
|
lib/wrike.rb
|
Ruby
|
mit
| 114
|
// Copyright (c) 2012 The Bitcoin developers
// Copyright (c) 2012 Omegacoin Developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef BITCOIN_MRUSET_H
#define BITCOIN_MRUSET_H
#include <set>
#include <deque>
/** STL-like set container that only keeps the most recent N elements. */
template <typename T> class mruset
{
public:
typedef T key_type;
typedef T value_type;
typedef typename std::set<T>::iterator iterator;
typedef typename std::set<T>::const_iterator const_iterator;
typedef typename std::set<T>::size_type size_type;
protected:
std::set<T> set;
std::deque<T> queue;
size_type nMaxSize;
public:
mruset(size_type nMaxSizeIn = 0) { nMaxSize = nMaxSizeIn; }
iterator begin() const { return set.begin(); }
iterator end() const { return set.end(); }
size_type size() const { return set.size(); }
bool empty() const { return set.empty(); }
iterator find(const key_type& k) const { return set.find(k); }
size_type count(const key_type& k) const { return set.count(k); }
bool inline friend operator==(const mruset<T>& a, const mruset<T>& b) { return a.set == b.set; }
bool inline friend operator==(const mruset<T>& a, const std::set<T>& b) { return a.set == b; }
bool inline friend operator<(const mruset<T>& a, const mruset<T>& b) { return a.set < b.set; }
std::pair<iterator, bool> insert(const key_type& x)
{
std::pair<iterator, bool> ret = set.insert(x);
if (ret.second)
{
if (nMaxSize && queue.size() == nMaxSize)
{
set.erase(queue.front());
queue.pop_front();
}
queue.push_back(x);
}
return ret;
}
size_type max_size() const { return nMaxSize; }
size_type max_size(size_type s)
{
if (s)
while (queue.size() > s)
{
set.erase(queue.front());
queue.pop_front();
}
nMaxSize = s;
return nMaxSize;
}
};
#endif
|
omegacoinproject/omegacoin
|
src/mruset.h
|
C
|
mit
| 2,136
|
/*
* The MIT License
*
* Copyright (c) 2014-2014 Efthymios Sarmpanis http://esarbanis.github.io/roolr
*
* 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.
*/
package com.github.esarbanis.roolr;
import java.util.Map;
/**
* This type of {@link EvaluationContext} is the simplest possible.
* <p>
* It uses a {@link java.util.Map} to store the field/value pairs. The field is represented as a
* {@link String} using the JavaBeans notation.
* </p>
* @author <a href="mailto:e.sarbanis@gmail.com">Efthymios Sarmpanis</a>
*/
public class SimpleEvaluationContext implements EvaluationContext {
private final Map<String, Object> fieldValues;
/**
* Constructs an {@link EvaluationContext} out of the given
* {@link java.util.Map}
* @param fieldValues a map of field/value pairs
*/
public SimpleEvaluationContext(Map<String, Object> fieldValues) {
this.fieldValues = fieldValues;
}
/**
* {@inheritDoc}
*/
public Object getField(String fieldKey) {
return fieldValues.get(fieldKey);
}
}
|
esarbanis/roolr
|
src/main/java/com/github/esarbanis/roolr/SimpleEvaluationContext.java
|
Java
|
mit
| 2,050
|
/**
* @overview datejs
* @version 1.0.0-beta-2014-03-25
* @author Gregory Wild-Smith <gregory@wild-smith.com>
* @copyright 2014 Gregory Wild-Smith
* @license MIT
* @homepage https://github.com/abritinthebay/datejs
*/
/*
* DateJS Culture String File
* Country Code: es-HN
* Name: Spanish (Honduras)
* Format: "key" : "value"
* Key is the en-US term, Value is the Key in the current language.
*/
Date.CultureStrings = Date.CultureStrings || {};
Date.CultureStrings["es-HN"] = {
"name": "es-HN",
"englishName": "Spanish (Honduras)",
"nativeName": "Español (Honduras)",
"Sunday": "domingo",
"Monday": "lunes",
"Tuesday": "martes",
"Wednesday": "miércoles",
"Thursday": "jueves",
"Friday": "viernes",
"Saturday": "sábado",
"Sun": "dom",
"Mon": "lun",
"Tue": "mar",
"Wed": "mié",
"Thu": "jue",
"Fri": "vie",
"Sat": "sáb",
"Su": "do",
"Mo": "lu",
"Tu": "ma",
"We": "mi",
"Th": "ju",
"Fr": "vi",
"Sa": "sá",
"S_Sun_Initial": "d",
"M_Mon_Initial": "l",
"T_Tue_Initial": "m",
"W_Wed_Initial": "m",
"T_Thu_Initial": "j",
"F_Fri_Initial": "v",
"S_Sat_Initial": "s",
"January": "enero",
"February": "febrero",
"March": "marzo",
"April": "abril",
"May": "mayo",
"June": "junio",
"July": "julio",
"August": "agosto",
"September": "septiembre",
"October": "octubre",
"November": "noviembre",
"December": "diciembre",
"Jan_Abbr": "ene",
"Feb_Abbr": "feb",
"Mar_Abbr": "mar",
"Apr_Abbr": "abr",
"May_Abbr": "may",
"Jun_Abbr": "jun",
"Jul_Abbr": "jul",
"Aug_Abbr": "ago",
"Sep_Abbr": "sep",
"Oct_Abbr": "oct",
"Nov_Abbr": "nov",
"Dec_Abbr": "dic",
"AM": "a.m.",
"PM": "p.m.",
"firstDayOfWeek": 0,
"twoDigitYearMax": 2029,
"mdy": "dmy",
"M/d/yyyy": "dd/MM/yyyy",
"dddd, MMMM dd, yyyy": "dddd, dd' de 'MMMM' de 'yyyy",
"h:mm tt": "hh:mm tt",
"h:mm:ss tt": "hh:mm:ss tt",
"dddd, MMMM dd, yyyy h:mm:ss tt": "dddd, dd' de 'MMMM' de 'yyyy hh:mm:ss tt",
"yyyy-MM-ddTHH:mm:ss": "yyyy-MM-ddTHH:mm:ss",
"yyyy-MM-dd HH:mm:ssZ": "yyyy-MM-dd HH:mm:ssZ",
"ddd, dd MMM yyyy HH:mm:ss": "ddd, dd MMM yyyy HH:mm:ss",
"MMMM dd": "dd MMMM",
"MMMM, yyyy": "MMMM' de 'yyyy",
"/jan(uary)?/": "ene(ro)?",
"/feb(ruary)?/": "feb(rero)?",
"/mar(ch)?/": "mar(zo)?",
"/apr(il)?/": "abr(il)?",
"/may/": "may(o)?",
"/jun(e)?/": "jun(io)?",
"/jul(y)?/": "jul(io)?",
"/aug(ust)?/": "ago(sto)?",
"/sep(t(ember)?)?/": "sep(tiembre)?",
"/oct(ober)?/": "oct(ubre)?",
"/nov(ember)?/": "nov(iembre)?",
"/dec(ember)?/": "dic(iembre)?",
"/^su(n(day)?)?/": "^do(m(ingo)?)?",
"/^mo(n(day)?)?/": "^lu(n(es)?)?",
"/^tu(e(s(day)?)?)?/": "^ma(r(tes)?)?",
"/^we(d(nesday)?)?/": "^mi(é(rcoles)?)?",
"/^th(u(r(s(day)?)?)?)?/": "^ju(e(ves)?)?",
"/^fr(i(day)?)?/": "^vi(e(rnes)?)?",
"/^sa(t(urday)?)?/": "^sá(b(ado)?)?",
"/^next/": "^next",
"/^last|past|prev(ious)?/": "^last|past|prev(ious)?",
"/^(\\+|aft(er)?|from|hence)/": "^(\\+|aft(er)?|from|hence)",
"/^(\\-|bef(ore)?|ago)/": "^(\\-|bef(ore)?|ago)",
"/^yes(terday)?/": "^yes(terday)?",
"/^t(od(ay)?)?/": "^t(od(ay)?)?",
"/^tom(orrow)?/": "^tom(orrow)?",
"/^n(ow)?/": "^n(ow)?",
"/^ms|milli(second)?s?/": "^ms|milli(second)?s?",
"/^sec(ond)?s?/": "^sec(ond)?s?",
"/^mn|min(ute)?s?/": "^mn|min(ute)?s?",
"/^h(our)?s?/": "^h(our)?s?",
"/^w(eek)?s?/": "^w(eek)?s?",
"/^m(onth)?s?/": "^m(onth)?s?",
"/^d(ay)?s?/": "^d(ay)?s?",
"/^y(ear)?s?/": "^y(ear)?s?",
"/^(a|p)/": "^(a|p)",
"/^(a\\.?m?\\.?|p\\.?m?\\.?)/": "^(a\\.?m?\\.?|p\\.?m?\\.?)",
"/^((e(s|d)t|c(s|d)t|m(s|d)t|p(s|d)t)|((gmt)?\\s*(\\+|\\-)\\s*\\d\\d\\d\\d?)|gmt|utc)/": "^((e(s|d)t|c(s|d)t|m(s|d)t|p(s|d)t)|((gmt)?\\s*(\\+|\\-)\\s*\\d\\d\\d\\d?)|gmt|utc)",
"/^\\s*(st|nd|rd|th)/": "^\\s*(st|nd|rd|th)",
"/^\\s*(\\:|a(?!u|p)|p)/": "^\\s*(\\:|a(?!u|p)|p)",
"LINT": "LINT",
"TOT": "TOT",
"CHAST": "CHAST",
"NZST": "NZST",
"NFT": "NFT",
"SBT": "SBT",
"AEST": "AEST",
"ACST": "ACST",
"JST": "JST",
"CWST": "CWST",
"CT": "CT",
"ICT": "ICT",
"MMT": "MMT",
"BIOT": "BST",
"NPT": "NPT",
"IST": "IST",
"PKT": "PKT",
"AFT": "AFT",
"MSK": "MSK",
"IRST": "IRST",
"FET": "FET",
"EET": "EET",
"CET": "CET",
"UTC": "UTC",
"GMT": "GMT",
"CVT": "CVT",
"GST": "GST",
"BRT": "BRT",
"NST": "NST",
"AST": "AST",
"EST": "EST",
"CST": "CST",
"MST": "MST",
"PST": "PST",
"AKST": "AKST",
"MIT": "MIT",
"HST": "HST",
"SST": "SST",
"BIT": "BIT",
"CHADT": "CHADT",
"NZDT": "NZDT",
"AEDT": "AEDT",
"ACDT": "ACDT",
"AZST": "AZST",
"IRDT": "IRDT",
"EEST": "EEST",
"CEST": "CEST",
"BST": "BST",
"PMDT": "PMDT",
"ADT": "ADT",
"NDT": "NDT",
"EDT": "EDT",
"CDT": "CDT",
"MDT": "MDT",
"PDT": "PDT",
"AKDT": "AKDT",
"HADT": "HADT"
};
Date.CultureStrings.lang = "es-HN";
/**
* @overview datejs
* @version 1.0.0-beta-2014-03-25
* @author Gregory Wild-Smith <gregory@wild-smith.com>
* @copyright 2014 Gregory Wild-Smith
* @license MIT
* @homepage https://github.com/abritinthebay/datejs
*/(function () {
var $D = Date;
var lang = Date.CultureStrings ? Date.CultureStrings.lang : null;
var loggedKeys = {}; // for debug purposes.
var __ = function (key, language) {
var output, split, length, last;
var countryCode = (language) ? language : lang;
if (Date.CultureStrings && Date.CultureStrings[countryCode] && Date.CultureStrings[countryCode][key]) {
output = Date.CultureStrings[countryCode][key];
} else {
switch(key) {
case "name":
output = "en-US";
break;
case "englishName":
output = "English (United States)";
break;
case "nativeName":
output = "English (United States)";
break;
case "twoDigitYearMax":
output = 2049;
break;
case "firstDayOfWeek":
output = 0;
break;
default:
output = key;
split = key.split("_");
length = split.length;
if (length > 1 && key.charAt(0) !== "/") {
// if the key isn't a regex and it has a split.
last = split[(length - 1)].toLowerCase();
if (last === "initial" || last === "abbr") {
output = split[0];
}
}
}
}
if (key.charAt(0) === "/") {
// Assume it's a regex
if (Date.CultureStrings && Date.CultureStrings[countryCode] && Date.CultureStrings[countryCode][key]) {
output = new RegExp(Date.CultureStrings[countryCode][key], "i");
} else {
output = new RegExp(key.replace(new RegExp("/", "g"),""), "i");
}
}
loggedKeys[key] = key;
return output;
};
var loadI18nScript = function (code) {
// paatterned after jQuery's getScript.
var url = Date.Config.i18n + code + '.js';
var head = document.getElementsByTagName("head")[0] || document.documentElement;
var script = document.createElement("script");
script.src = url;
var completed = false;
var events = {
done: function (){} // dummy function
};
// Attach handlers for all browsers
script.onload = script.onreadystatechange = function() {
if ( !completed && (!this.readyState || this.readyState === "loaded" || this.readyState === "complete") ) {
done = true;
events.done();
head.removeChild(script);
}
};
setTimeout(function() {
head.insertBefore(script, head.firstChild);
}, 0); // allows return to execute first
return {
done: function (f) {
events.done = function() {
if (f) {
f();
}
};
}
};
};
var CultureInfo = function () {
var buildTimeZones = function (data) {
var zone;
for (zone in data.abbreviatedTimeZoneStandard) {
if (data.abbreviatedTimeZoneStandard.hasOwnProperty(zone)) {
data.timezones.push({ name: zone, offset: data.abbreviatedTimeZoneStandard[zone]});
}
}
for (zone in data.abbreviatedTimeZoneDST) {
if (data.abbreviatedTimeZoneDST.hasOwnProperty(zone)) {
data.timezones.push({ name: zone, offset: data.abbreviatedTimeZoneDST[zone], dst: true});
}
}
return data.timezones;
};
var info = {
name: __("name"),
englishName: __("englishName"),
nativeName: __("nativeName"),
/* Day Name Strings */
dayNames: [
__("Sunday"),
__("Monday"),
__("Tuesday"),
__("Wednesday"),
__("Thursday"),
__("Friday"),
__("Saturday")
],
abbreviatedDayNames: [
__("Sun"),
__("Mon"),
__("Tue"),
__("Wed"),
__("Thu"),
__("Fri"),
__("Sat")
],
shortestDayNames: [
__("Su"),
__("Mo"),
__("Tu"),
__("We"),
__("Th"),
__("Fr"),
__("Sa")
],
firstLetterDayNames: [
__("S_Sun_Initial"),
__("M_Mon_Initial"),
__("T_Tues_Initial"),
__("W_Wed_Initial"),
__("T_Thu_Initial"),
__("F_Fri_Initial"),
__("S_Sat_Initial")
],
/* Month Name Strings */
monthNames: [
__("January"),
__("February"),
__("March"),
__("April"),
__("May"),
__("June"),
__("July"),
__("August"),
__("September"),
__("October"),
__("November"),
__("December")
],
abbreviatedMonthNames: [
__("Jan_Abbr"),
__("Feb_Abbr"),
__("Mar_Abbr"),
__("Apr_Abbr"),
__("May_Abbr"),
__("Jun_Abbr"),
__("Jul_Abbr"),
__("Aug_Abbr"),
__("Sep_Abbr"),
__("Oct_Abbr"),
__("Nov_Abbr"),
__("Dec_Abbr")
],
/* AM/PM Designators */
amDesignator: __("AM"),
pmDesignator: __("PM"),
firstDayOfWeek: __("firstDayOfWeek"),
twoDigitYearMax: __("twoDigitYearMax"),
dateElementOrder: __("mdy"),
/* Standard date and time format patterns */
formatPatterns: {
shortDate: __("M/d/yyyy"),
longDate: __("dddd, MMMM dd, yyyy"),
shortTime: __("h:mm tt"),
longTime: __("h:mm:ss tt"),
fullDateTime: __("dddd, MMMM dd, yyyy h:mm:ss tt"),
sortableDateTime: __("yyyy-MM-ddTHH:mm:ss"),
universalSortableDateTime: __("yyyy-MM-dd HH:mm:ssZ"),
rfc1123: __("ddd, dd MMM yyyy HH:mm:ss"),
monthDay: __("MMMM dd"),
yearMonth: __("MMMM, yyyy")
},
regexPatterns: {
inTheMorning: __("/( in the )(morn(ing)?)\\b/"),
thisMorning: __("/(this )(morn(ing)?)\\b/"),
amThisMorning: __("/(\b\\d(am)? )(this )(morn(ing)?)/"),
inTheEvening: __("/( in the )(even(ing)?)\\b/"),
thisEvening: __("/(this )(even(ing)?)\\b/"),
pmThisEvening: __("/(\b\\d(pm)? )(this )(even(ing)?)/"),
jan: __("/jan(uary)?/"),
feb: __("/feb(ruary)?/"),
mar: __("/mar(ch)?/"),
apr: __("/apr(il)?/"),
may: __("/may/"),
jun: __("/jun(e)?/"),
jul: __("/jul(y)?/"),
aug: __("/aug(ust)?/"),
sep: __("/sep(t(ember)?)?/"),
oct: __("/oct(ober)?/"),
nov: __("/nov(ember)?/"),
dec: __("/dec(ember)?/"),
sun: __("/^su(n(day)?)?/"),
mon: __("/^mo(n(day)?)?/"),
tue: __("/^tu(e(s(day)?)?)?/"),
wed: __("/^we(d(nesday)?)?/"),
thu: __("/^th(u(r(s(day)?)?)?)?/"),
fri: __("/fr(i(day)?)?/"),
sat: __("/^sa(t(urday)?)?/"),
future: __("/^next/"),
past: __("/last|past|prev(ious)?/"),
add: __("/^(\\+|aft(er)?|from|hence)/"),
subtract: __("/^(\\-|bef(ore)?|ago)/"),
yesterday: __("/^yes(terday)?/"),
today: __("/^t(od(ay)?)?/"),
tomorrow: __("/^tom(orrow)?/"),
now: __("/^n(ow)?/"),
millisecond: __("/^ms|milli(second)?s?/"),
second: __("/^sec(ond)?s?/"),
minute: __("/^mn|min(ute)?s?/"),
hour: __("/^h(our)?s?/"),
week: __("/^w(eek)?s?/"),
month: __("/^m(onth)?s?/"),
day: __("/^d(ay)?s?/"),
year: __("/^y(ear)?s?/"),
shortMeridian: __("/^(a|p)/"),
longMeridian: __("/^(a\\.?m?\\.?|p\\.?m?\\.?)/"),
timezone: __("/^((e(s|d)t|c(s|d)t|m(s|d)t|p(s|d)t)|((gmt)?\\s*(\\+|\\-)\\s*\\d\\d\\d\\d?)|gmt|utc)/"),
ordinalSuffix: __("/^\\s*(st|nd|rd|th)/"),
timeContext: __("/^\\s*(\\:|a(?!u|p)|p)/")
},
timezones: [],
abbreviatedTimeZoneDST: {},
abbreviatedTimeZoneStandard: {}
};
info.abbreviatedTimeZoneDST[__("CHADT")] = "+1345";
info.abbreviatedTimeZoneDST[__("NZDT")] = "+1300";
info.abbreviatedTimeZoneDST[__("AEDT")] = "+1100";
info.abbreviatedTimeZoneDST[__("ACDT")] = "+1030";
info.abbreviatedTimeZoneDST[__("AZST")] = "+0500";
info.abbreviatedTimeZoneDST[__("IRDT")] = "+0430";
info.abbreviatedTimeZoneDST[__("EEST")] = "+0300";
info.abbreviatedTimeZoneDST[__("CEST")] = "+0200";
info.abbreviatedTimeZoneDST[__("BST")] = "+0100";
info.abbreviatedTimeZoneDST[__("PMDT")] = "-0200";
info.abbreviatedTimeZoneDST[__("ADT")] = "-0300";
info.abbreviatedTimeZoneDST[__("NDT")] = "-0230";
info.abbreviatedTimeZoneDST[__("EDT")] = "-0400";
info.abbreviatedTimeZoneDST[__("CDT")] = "-0500";
info.abbreviatedTimeZoneDST[__("MDT")] = "-0600";
info.abbreviatedTimeZoneDST[__("PDT")] = "-0700";
info.abbreviatedTimeZoneDST[__("AKDT")] = "-0800";
info.abbreviatedTimeZoneDST[__("HADT")] = "-0900";
info.abbreviatedTimeZoneStandard[__("LINT")] = "+1400";
info.abbreviatedTimeZoneStandard[__("TOT")] = "+1300";
info.abbreviatedTimeZoneStandard[__("CHAST")] = "+1245";
info.abbreviatedTimeZoneStandard[__("NZST")] = "+1200";
info.abbreviatedTimeZoneStandard[__("NFT")] = "+1130";
info.abbreviatedTimeZoneStandard[__("SBT")] = "+1100";
info.abbreviatedTimeZoneStandard[__("AEST")] = "+1000";
info.abbreviatedTimeZoneStandard[__("ACST")] = "+0930";
info.abbreviatedTimeZoneStandard[__("JST")] = "+0900";
info.abbreviatedTimeZoneStandard[__("CWST")] = "+0845";
info.abbreviatedTimeZoneStandard[__("CT")] = "+0800";
info.abbreviatedTimeZoneStandard[__("ICT")] = "+0700";
info.abbreviatedTimeZoneStandard[__("MMT")] = "+0630";
info.abbreviatedTimeZoneStandard[__("BST")] = "+0600";
info.abbreviatedTimeZoneStandard[__("NPT")] = "+0545";
info.abbreviatedTimeZoneStandard[__("IST")] = "+0530";
info.abbreviatedTimeZoneStandard[__("PKT")] = "+0500";
info.abbreviatedTimeZoneStandard[__("AFT")] = "+0430";
info.abbreviatedTimeZoneStandard[__("MSK")] = "+0400";
info.abbreviatedTimeZoneStandard[__("IRST")] = "+0330";
info.abbreviatedTimeZoneStandard[__("FET")] = "+0300";
info.abbreviatedTimeZoneStandard[__("EET")] = "+0200";
info.abbreviatedTimeZoneStandard[__("CET")] = "+0100";
info.abbreviatedTimeZoneStandard[__("GMT")] = "+0000";
info.abbreviatedTimeZoneStandard[__("UTC")] = "+0000";
info.abbreviatedTimeZoneStandard[__("CVT")] = "-0100";
info.abbreviatedTimeZoneStandard[__("GST")] = "-0200";
info.abbreviatedTimeZoneStandard[__("BRT")] = "-0300";
info.abbreviatedTimeZoneStandard[__("NST")] = "-0330";
info.abbreviatedTimeZoneStandard[__("AST")] = "-0400";
info.abbreviatedTimeZoneStandard[__("EST")] = "-0500";
info.abbreviatedTimeZoneStandard[__("CST")] = "-0600";
info.abbreviatedTimeZoneStandard[__("MST")] = "-0700";
info.abbreviatedTimeZoneStandard[__("PST")] = "-0800";
info.abbreviatedTimeZoneStandard[__("AKST")] = "-0900";
info.abbreviatedTimeZoneStandard[__("MIT")] = "-0930";
info.abbreviatedTimeZoneStandard[__("HST")] = "-1000";
info.abbreviatedTimeZoneStandard[__("SST")] = "-1100";
info.abbreviatedTimeZoneStandard[__("BIT")] = "-1200";
buildTimeZones(info);
return info;
};
$D.i18n = {
__: function (key, lang) {
return __(key, lang);
},
currentLanguage: function () {
return lang || "en-US";
},
setLanguage: function (code, force) {
if (force || code === "en-US" || (!!Date.CultureStrings && !!Date.CultureStrings[code])) {
lang = code;
Date.CultureStrings.lang = code;
Date.CultureInfo = CultureInfo();
} else {
if (!(!!Date.CultureStrings && !!Date.CultureStrings[code])) {
if (typeof exports !== 'undefined' && this.exports !== exports) {
// we're in a Node enviroment, load it using require
try {
require("../i18n/" + code + ".js");
lang = code;
Date.CultureStrings.lang = code;
Date.CultureInfo = CultureInfo();
} catch (e) {
// var str = "The language for '" + code + "' could not be loaded by Node. It likely does not exist.";
throw new Error("The DateJS IETF language tag '" + code + "' could not be loaded by Node. It likely does not exist.");
}
} else if (Date.Config && Date.Config.i18n) {
// we know the location of the files, so lets load them
loadI18nScript(code).done(function(){
lang = code;
Date.CultureStrings.lang = code;
Date.CultureInfo = CultureInfo();
});
} else {
Date.console.error("The DateJS IETF language tag '" + code + "' is not available and has not been loaded.");
}
}
}
},
getLoggedKeys: function () {
return loggedKeys;
},
updateCultureInfo: function () {
Date.CultureInfo = CultureInfo();
}
};
$D.i18n.updateCultureInfo(); // run automatically
}());
(function () {
var $D = Date,
$P = $D.prototype,
p = function (s, l) {
if (!l) {
l = 2;
}
return ("000" + s).slice(l * -1);
};
if (typeof window !== "undefined" && typeof window.console !== "undefined" && typeof window.console.log !== "undefined") {
$D.console = console; // used only to raise non-critical errors if available
} else {
// set mock so we don't give errors.
$D.console = {
log: function(){},
error: function(){}
};
}
$D.Config = {};
$D.initOverloads = function() {
/**
* Overload of Date.now. Allows an alternate call for Date.now where it returns the
* current Date as an object rather than just milliseconds since the Unix Epoch.
*
* Also provides an implementation of now() for browsers (IE<9) that don't have it.
*
* Backwards compatible so with work with either:
* Date.now() [returns ms]
* or
* Date.now(true) [returns Date]
*/
if (!$D.now) {
$D._now = function now() {
return new Date().getTime();
};
} else if (!$D._now) {
$D._now = $D.now;
}
$D.now = function (returnObj) {
if (returnObj) {
return $D.present();
} else {
return $D._now();
}
};
if ( !$P.toISOString ) {
$P.toISOString = function() {
return this.getUTCFullYear() +
"-" + p(this.getUTCMonth() + 1) +
"-" + p(this.getUTCDate()) +
"T" + p(this.getUTCHours()) +
":" + p(this.getUTCMinutes()) +
":" + p(this.getUTCSeconds()) +
"." + String( (this.getUTCMilliseconds()/1000).toFixed(3)).slice(2, 5) +
"Z";
};
}
// private
if ( $P._toString === undefined ){
$P._toString = $P.toString;
}
};
$D.initOverloads();
/**
* Resets the time of this Date object to 12:00 AM (00:00), which is the start of the day.
* @param {Boolean} .clone() this date instance before clearing Time
* @return {Date} this
*/
$P.clearTime = function () {
this.setHours(0);
this.setMinutes(0);
this.setSeconds(0);
this.setMilliseconds(0);
return this;
};
/**
* Resets the time of this Date object to the current time ('now').
* @return {Date} this
*/
$P.setTimeToNow = function () {
var n = new Date();
this.setHours(n.getHours());
this.setMinutes(n.getMinutes());
this.setSeconds(n.getSeconds());
this.setMilliseconds(n.getMilliseconds());
return this;
};
/**
* Gets a date that is set to the current date. The time is set to the start of the day (00:00 or 12:00 AM).
* @return {Date} The current date.
*/
$D.today = function () {
return new Date().clearTime();
};
/**
* Gets a date that is set to the current date and time (same as new Date, but chainable)
* @return {Date} The current date.
*/
$D.present = function () {
return new Date();
};
/**
* Compares the first date to the second date and returns an number indication of their relative values.
* @param {Date} First Date object to compare [Required].
* @param {Date} Second Date object to compare to [Required].
* @return {Number} -1 = date1 is lessthan date2. 0 = values are equal. 1 = date1 is greaterthan date2.
*/
$D.compare = function (date1, date2) {
if (isNaN(date1) || isNaN(date2)) {
throw new Error(date1 + " - " + date2);
} else if (date1 instanceof Date && date2 instanceof Date) {
return (date1 < date2) ? -1 : (date1 > date2) ? 1 : 0;
} else {
throw new TypeError(date1 + " - " + date2);
}
};
/**
* Compares the first Date object to the second Date object and returns true if they are equal.
* @param {Date} First Date object to compare [Required]
* @param {Date} Second Date object to compare to [Required]
* @return {Boolean} true if dates are equal. false if they are not equal.
*/
$D.equals = function (date1, date2) {
return (date1.compareTo(date2) === 0);
};
/**
* Gets the language appropriate day name when given the day number(0-6)
* eg - 0 == Sunday
* @return {String} The day name
*/
$D.getDayName = function (n) {
return Date.CultureInfo.dayNames[n];
};
/**
* Gets the day number (0-6) if given a CultureInfo specific string which is a valid dayName, abbreviatedDayName or shortestDayName (two char).
* @param {String} The name of the day (eg. "Monday, "Mon", "tuesday", "tue", "We", "we").
* @return {Number} The day number
*/
$D.getDayNumberFromName = function (name) {
var n = Date.CultureInfo.dayNames, m = Date.CultureInfo.abbreviatedDayNames, o = Date.CultureInfo.shortestDayNames, s = name.toLowerCase();
for (var i = 0; i < n.length; i++) {
if (n[i].toLowerCase() === s || m[i].toLowerCase() === s || o[i].toLowerCase() === s) {
return i;
}
}
return -1;
};
/**
* Gets the month number (0-11) if given a Culture Info specific string which is a valid monthName or abbreviatedMonthName.
* @param {String} The name of the month (eg. "February, "Feb", "october", "oct").
* @return {Number} The day number
*/
$D.getMonthNumberFromName = function (name) {
var n = Date.CultureInfo.monthNames, m = Date.CultureInfo.abbreviatedMonthNames, s = name.toLowerCase();
for (var i = 0; i < n.length; i++) {
if (n[i].toLowerCase() === s || m[i].toLowerCase() === s) {
return i;
}
}
return -1;
};
/**
* Gets the language appropriate month name when given the month number(0-11)
* eg - 0 == January
* @return {String} The month name
*/
$D.getMonthName = function (n) {
return Date.CultureInfo.monthNames[n];
};
/**
* Determines if the current date instance is within a LeapYear.
* @param {Number} The year.
* @return {Boolean} true if date is within a LeapYear, otherwise false.
*/
$D.isLeapYear = function (year) {
return ((year % 4 === 0 && year % 100 !== 0) || year % 400 === 0);
};
/**
* Gets the number of days in the month, given a year and month value. Automatically corrects for LeapYear.
* @param {Number} The year.
* @param {Number} The month (0-11).
* @return {Number} The number of days in the month.
*/
$D.getDaysInMonth = function (year, month) {
if (!month && $D.validateMonth(year)) {
month = year;
year = Date.today().getFullYear();
}
return [31, ($D.isLeapYear(year) ? 29 : 28), 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][month];
};
$D.getTimezoneAbbreviation = function (offset, dst) {
var p, n = (dst || false) ? Date.CultureInfo.abbreviatedTimeZoneDST : Date.CultureInfo.abbreviatedTimeZoneStandard;
for (p in n) {
if (n.hasOwnProperty(p)) {
if (n[p] === offset) {
return p;
}
}
}
return null;
};
$D.getTimezoneOffset = function (name, dst) {
var i, a =[], z = Date.CultureInfo.timezones;
if (!name) { name = (new Date()).getTimezone()}
for (i = 0; i < z.length; i++) {
if (z[i].name === name.toUpperCase()) {
a.push(i);
}
}
if (!z[a[0]]) {
return null;
}
if (a.length === 1 || !dst) {
return z[a[0]].offset;
} else {
for (i=0; i < a.length; i++) {
if (z[a[i]].dst) {
return z[a[i]].offset;
}
}
}
};
$D.getQuarter = function (d) {
d = d || new Date(); // If no date supplied, use today
var q = [1,2,3,4];
return q[Math.floor(d.getMonth() / 3)]; // ~~~ is a bitwise op. Faster than Math.floor
};
$D.getDaysLeftInQuarter = function (d) {
d = d || new Date();
var qEnd = new Date(d);
qEnd.setMonth(qEnd.getMonth() + 3 - qEnd.getMonth() % 3, 0);
return Math.floor((qEnd - d) / 8.64e7);
};
/**
* Returns a new Date object that is an exact date and time copy of the original instance.
* @return {Date} A new Date instance
*/
$P.clone = function () {
return new Date(this.getTime());
};
/**
* Compares this instance to a Date object and returns an number indication of their relative values.
* @param {Date} Date object to compare [Required]
* @return {Number} -1 = this is lessthan date. 0 = values are equal. 1 = this is greaterthan date.
*/
$P.compareTo = function (date) {
return Date.compare(this, date);
};
/**
* Compares this instance to another Date object and returns true if they are equal.
* @param {Date} Date object to compare. If no date to compare, new Date() [now] is used.
* @return {Boolean} true if dates are equal. false if they are not equal.
*/
$P.equals = function (date) {
return Date.equals(this, (date !== undefined ? date : new Date()));
};
/**
* Determines if this instance is between a range of two dates or equal to either the start or end dates.
* @param {Date} Start of range [Required]
* @param {Date} End of range [Required]
* @return {Boolean} true is this is between or equal to the start and end dates, else false
*/
$P.between = function (start, end) {
return this.getTime() >= start.getTime() && this.getTime() <= end.getTime();
};
/**
* Determines if this date occurs after the date to compare to.
* @param {Date} Date object to compare. If no date to compare, new Date() ("now") is used.
* @return {Boolean} true if this date instance is greater than the date to compare to (or "now"), otherwise false.
*/
$P.isAfter = function (date) {
return this.compareTo(date || new Date()) === 1;
};
/**
* Determines if this date occurs before the date to compare to.
* @param {Date} Date object to compare. If no date to compare, new Date() ("now") is used.
* @return {Boolean} true if this date instance is less than the date to compare to (or "now").
*/
$P.isBefore = function (date) {
return (this.compareTo(date || new Date()) === -1);
};
/**
* Determines if the current Date instance occurs today.
* @return {Boolean} true if this date instance is 'today', otherwise false.
*/
/**
* Determines if the current Date instance occurs on the same Date as the supplied 'date'.
* If no 'date' to compare to is provided, the current Date instance is compared to 'today'.
* @param {date} Date object to compare. If no date to compare, the current Date ("now") is used.
* @return {Boolean} true if this Date instance occurs on the same Day as the supplied 'date'.
*/
$P.isToday = $P.isSameDay = function (date) {
return this.clone().clearTime().equals((date || new Date()).clone().clearTime());
};
/**
* Adds the specified number of milliseconds to this instance.
* @param {Number} The number of milliseconds to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addMilliseconds = function (value) {
if (!value) { return this; }
this.setTime(this.getTime() + value * 1);
return this;
};
/**
* Adds the specified number of seconds to this instance.
* @param {Number} The number of seconds to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addSeconds = function (value) {
if (!value) { return this; }
return this.addMilliseconds(value * 1000);
};
/**
* Adds the specified number of seconds to this instance.
* @param {Number} The number of seconds to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addMinutes = function (value) {
if (!value) { return this; }
return this.addMilliseconds(value * 60000); /* 60*1000 */
};
/**
* Adds the specified number of hours to this instance.
* @param {Number} The number of hours to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addHours = function (value) {
if (!value) { return this; }
return this.addMilliseconds(value * 3600000); /* 60*60*1000 */
};
/**
* Adds the specified number of days to this instance.
* @param {Number} The number of days to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addDays = function (value) {
if (!value) { return this; }
this.setDate(this.getDate() + value * 1);
return this;
};
/**
* Adds the specified number of weekdays (ie - not sat or sun) to this instance.
* @param {Number} The number of days to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addWeekdays = function (value) {
if (!value) { return this; }
var day = this.getDay();
var weeks = (Math.ceil(Math.abs(value)/7));
if (day === 0 || day === 6) {
if (value > 0) {
this.next().monday();
this.addDays(-1);
}
}
if (value < 0) {
while (value < 0) {
this.addDays(-1);
day = this.getDay();
if (day !== 0 && day !== 6) {
value++;
}
}
return this;
} else if (value > 5 || (6-day) <= value) {
value = value + (weeks * 2);
}
return this.addDays(value);
};
/**
* Adds the specified number of weeks to this instance.
* @param {Number} The number of weeks to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addWeeks = function (value) {
if (!value) { return this; }
return this.addDays(value * 7);
};
/**
* Adds the specified number of months to this instance.
* @param {Number} The number of months to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addMonths = function (value) {
if (!value) { return this; }
var n = this.getDate();
this.setDate(1);
this.setMonth(this.getMonth() + value * 1);
this.setDate(Math.min(n, $D.getDaysInMonth(this.getFullYear(), this.getMonth())));
return this;
};
$P.addQuarters = function (value) {
if (!value) { return this; }
// note this will take you to the same point in the quarter as you are now.
// i.e. - if you are 15 days into the quarter you'll be 15 days into the resulting one.
// bonus: this allows adding fractional quarters
return this.addMonths(value * 3);
};
/**
* Adds the specified number of years to this instance.
* @param {Number} The number of years to add. The number can be positive or negative [Required]
* @return {Date} this
*/
$P.addYears = function (value) {
if (!value) { return this; }
return this.addMonths(value * 12);
};
/**
* Adds (or subtracts) to the value of the years, months, weeks, days, hours, minutes, seconds, milliseconds of the date instance using given configuration object. Positive and Negative values allowed.
* Example
<pre><code>
Date.today().add( { days: 1, months: 1 } )
new Date().add( { years: -1 } )
</code></pre>
* @param {Object} Configuration object containing attributes (months, days, etc.)
* @return {Date} this
*/
$P.add = function (config) {
if (typeof config === "number") {
this._orient = config;
return this;
}
var x = config;
if (x.day) {
// If we should be a different date than today (eg: for 'tomorrow -1d', etc).
// Should only effect parsing, not direct usage (eg, Finish and FinishExact)
if ((x.day - this.getDate()) !== 0) {
this.setDate(x.day);
}
}
if (x.milliseconds) {
this.addMilliseconds(x.milliseconds);
}
if (x.seconds) {
this.addSeconds(x.seconds);
}
if (x.minutes) {
this.addMinutes(x.minutes);
}
if (x.hours) {
this.addHours(x.hours);
}
if (x.weeks) {
this.addWeeks(x.weeks);
}
if (x.months) {
this.addMonths(x.months);
}
if (x.years) {
this.addYears(x.years);
}
if (x.days) {
this.addDays(x.days);
}
return this;
};
/**
* Get the week number. Week one (1) is the week which contains the first Thursday of the year. Monday is considered the first day of the week.
* The .getWeek() function does NOT convert the date to UTC. The local datetime is used.
* Please use .getISOWeek() to get the week of the UTC converted date.
* @return {Number} 1 to 53
*/
$P.getWeek = function (utc) {
// Create a copy of this date object
var self, target = new Date(this.valueOf());
if (utc) {
target.addMinutes(target.getTimezoneOffset());
self = target.clone();
} else {
self = this;
}
// ISO week date weeks start on monday
// so correct the day number
var dayNr = (self.getDay() + 6) % 7;
// ISO 8601 states that week 1 is the week
// with the first thursday of that year.
// Set the target date to the thursday in the target week
target.setDate(target.getDate() - dayNr + 3);
// Store the millisecond value of the target date
var firstThursday = target.valueOf();
// Set the target to the first thursday of the year
// First set the target to january first
target.setMonth(0, 1);
// Not a thursday? Correct the date to the next thursday
if (target.getDay() !== 4) {
target.setMonth(0, 1 + ((4 - target.getDay()) + 7) % 7);
}
// The weeknumber is the number of weeks between the
// first thursday of the year and the thursday in the target week
return 1 + Math.ceil((firstThursday - target) / 604800000); // 604800000 = 7 * 24 * 3600 * 1000
};
/**
* Get the ISO 8601 week number. Week one ("01") is the week which contains the first Thursday of the year. Monday is considered the first day of the week.
* The .getISOWeek() function does convert the date to it's UTC value. Please use .getWeek() to get the week of the local date.
* @return {String} "01" to "53"
*/
$P.getISOWeek = function () {
return p(this.getWeek(true));
};
/**
* Moves the date to Monday of the week set. Week one (1) is the week which contains the first Thursday of the year.
* @param {Number} A Number (1 to 53) that represents the week of the year.
* @return {Date} this
*/
$P.setWeek = function (n) {
if ((n - this.getWeek()) === 0) {
if (this.getDay() !== 1) {
return this.moveToDayOfWeek(1, (this.getDay() > 1 ? -1 : 1));
} else {
return this;
}
} else {
return this.moveToDayOfWeek(1, (this.getDay() > 1 ? -1 : 1)).addWeeks(n - this.getWeek());
}
};
$P.setQuarter = function (qtr) {
var month = Math.abs(((qtr-1) * 3) + 1);
return this.setMonth(month, 1);
};
$P.getQuarter = function () {
return Date.getQuarter(this);
};
$P.getDaysLeftInQuarter = function () {
return Date.getDaysLeftInQuarter(this);
};
// private
var validate = function (n, min, max, name) {
name = name ? name : "Object";
if (typeof n === "undefined") {
return false;
} else if (typeof n !== "number") {
throw new TypeError(n + " is not a Number.");
} else if (n < min || n > max) {
// As failing validation is *not* an exceptional circumstance
// lets not throw a RangeError Exception here.
// It's semantically correct but it's not sensible.
return false;
}
return true;
};
/**
* Validates the number is within an acceptable range for milliseconds [0-999].
* @param {Number} The number to check if within range.
* @return {Boolean} true if within range, otherwise false.
*/
$D.validateMillisecond = function (value) {
return validate(value, 0, 999, "millisecond");
};
/**
* Validates the number is within an acceptable range for seconds [0-59].
* @param {Number} The number to check if within range.
* @return {Boolean} true if within range, otherwise false.
*/
$D.validateSecond = function (value) {
return validate(value, 0, 59, "second");
};
/**
* Validates the number is within an acceptable range for minutes [0-59].
* @param {Number} The number to check if within range.
* @return {Boolean} true if within range, otherwise false.
*/
$D.validateMinute = function (value) {
return validate(value, 0, 59, "minute");
};
/**
* Validates the number is within an acceptable range for hours [0-23].
* @param {Number} The number to check if within range.
* @return {Boolean} true if within range, otherwise false.
*/
$D.validateHour = function (value) {
return validate(value, 0, 23, "hour");
};
/**
* Validates the number is within an acceptable range for the days in a month [0-MaxDaysInMonth].
* @param {Number} The number to check if within range.
* @return {Boolean} true if within range, otherwise false.
*/
$D.validateDay = function (value, year, month) {
return validate(value, 1, $D.getDaysInMonth(year, month), "day");
};
/**
* Validates the number is within an acceptable range for months [0-11].
* @param {Number} The number to check if within range.
* @return {Boolean} true if within range, otherwise false.
*/
$D.validateWeek = function (value) {
return validate(value, 0, 53, "week");
};
/**
* Validates the number is within an acceptable range for months [0-11].
* @param {Number} The number to check if within range.
* @return {Boolean} true if within range, otherwise false.
*/
$D.validateMonth = function (value) {
return validate(value, 0, 11, "month");
};
/**
* Validates the number is within an acceptable range for years.
* @param {Number} The number to check if within range.
* @return {Boolean} true if within range, otherwise false.
*/
$D.validateYear = function (value) {
/**
* Per ECMAScript spec the range of times supported by Date objects is
* exactly –100,000,000 days to 100,000,000 days measured relative to
* midnight at the beginning of 01 January, 1970 UTC.
* This gives a range of 8,640,000,000,000,000 milliseconds to either
* side of 01 January, 1970 UTC.
*
* Earliest possible date: Tue, 20 Apr 271,822 B.C. 00:00:00 UTC
* Latest possible date: Sat, 13 Sep 275,760 00:00:00 UTC
*/
return validate(value, -271822, 275760, "year");
};
/**
* Set the value of year, month, day, hour, minute, second, millisecond of date instance using given configuration object.
* Example
<pre><code>
Date.today().set( { day: 20, month: 1 } )
new Date().set( { millisecond: 0 } )
</code></pre>
*
* @param {Object} Configuration object containing attributes (month, day, etc.)
* @return {Date} this
*/
$P.set = function (config) {
if ($D.validateMillisecond(config.millisecond)) {
this.addMilliseconds(config.millisecond - this.getMilliseconds());
}
if ($D.validateSecond(config.second)) {
this.addSeconds(config.second - this.getSeconds());
}
if ($D.validateMinute(config.minute)) {
this.addMinutes(config.minute - this.getMinutes());
}
if ($D.validateHour(config.hour)) {
this.addHours(config.hour - this.getHours());
}
if ($D.validateMonth(config.month)) {
this.addMonths(config.month - this.getMonth());
}
if ($D.validateYear(config.year)) {
this.addYears(config.year - this.getFullYear());
}
/* day has to go last because you can't validate the day without first knowing the month */
if ($D.validateDay(config.day, this.getFullYear(), this.getMonth())) {
this.addDays(config.day - this.getDate());
}
if (config.timezone) {
this.setTimezone(config.timezone);
}
if (config.timezoneOffset) {
this.setTimezoneOffset(config.timezoneOffset);
}
if (config.week && $D.validateWeek(config.week)) {
this.setWeek(config.week);
}
return this;
};
/**
* Moves the date to the first day of the month.
* @return {Date} this
*/
$P.moveToFirstDayOfMonth = function () {
return this.set({ day: 1 });
};
/**
* Moves the date to the last day of the month.
* @return {Date} this
*/
$P.moveToLastDayOfMonth = function () {
return this.set({ day: $D.getDaysInMonth(this.getFullYear(), this.getMonth())});
};
/**
* Moves the date to the next n'th occurrence of the dayOfWeek starting from the beginning of the month. The number (-1) is a magic number and will return the last occurrence of the dayOfWeek in the month.
* @param {Number} The dayOfWeek to move to
* @param {Number} The n'th occurrence to move to. Use (-1) to return the last occurrence in the month
* @return {Date} this
*/
$P.moveToNthOccurrence = function (dayOfWeek, occurrence) {
if (dayOfWeek === "Weekday") {
if (occurrence > 0) {
this.moveToFirstDayOfMonth();
if (this.is().weekday()) {
occurrence -= 1;
}
} else if (occurrence < 0) {
this.moveToLastDayOfMonth();
if (this.is().weekday()) {
occurrence += 1;
}
} else {
return this;
}
return this.addWeekdays(occurrence);
}
var shift = 0;
if (occurrence > 0) {
shift = occurrence - 1;
}
else if (occurrence === -1) {
this.moveToLastDayOfMonth();
if (this.getDay() !== dayOfWeek) {
this.moveToDayOfWeek(dayOfWeek, -1);
}
return this;
}
return this.moveToFirstDayOfMonth().addDays(-1).moveToDayOfWeek(dayOfWeek, +1).addWeeks(shift);
};
/**
* Move to the next or last dayOfWeek based on the orient value.
* @param {Number} The dayOfWeek to move to
* @param {Number} Forward (+1) or Back (-1). Defaults to +1. [Optional]
* @return {Date} this
*/
$P.moveToDayOfWeek = function (dayOfWeek, orient) {
var diff = (dayOfWeek - this.getDay() + 7 * (orient || +1)) % 7;
return this.addDays((diff === 0) ? diff += 7 * (orient || +1) : diff);
};
/**
* Move to the next or last month based on the orient value.
* @param {Number} The month to move to. 0 = January, 11 = December
* @param {Number} Forward (+1) or Back (-1). Defaults to +1. [Optional]
* @return {Date} this
*/
$P.moveToMonth = function (month, orient) {
var diff = (month - this.getMonth() + 12 * (orient || +1)) % 12;
return this.addMonths((diff === 0) ? diff += 12 * (orient || +1) : diff);
};
/**
* Get the Ordinate of the current day ("th", "st", "rd").
* @return {String}
*/
$P.getOrdinate = function () {
var num = this.getDate();
return ord(num);
};
/**
* Get the Ordinal day (numeric day number) of the year, adjusted for leap year.
* @return {Number} 1 through 365 (366 in leap years)
*/
$P.getOrdinalNumber = function () {
return Math.ceil((this.clone().clearTime() - new Date(this.getFullYear(), 0, 1)) / 86400000) + 1;
};
/**
* Get the time zone abbreviation of the current date.
* @return {String} The abbreviated time zone name (e.g. "EST")
*/
$P.getTimezone = function () {
return $D.getTimezoneAbbreviation(this.getUTCOffset(), this.isDaylightSavingTime());
};
$P.setTimezoneOffset = function (offset) {
var here = this.getTimezoneOffset(), there = Number(offset) * -6 / 10;
return (there || there === 0) ? this.addMinutes(there - here) : this;
};
$P.setTimezone = function (offset) {
return this.setTimezoneOffset($D.getTimezoneOffset(offset));
};
/**
* Indicates whether Daylight Saving Time is observed in the current time zone.
* @return {Boolean} true|false
*/
$P.hasDaylightSavingTime = function () {
return (Date.today().set({month: 0, day: 1}).getTimezoneOffset() !== Date.today().set({month: 6, day: 1}).getTimezoneOffset());
};
/**
* Indicates whether this Date instance is within the Daylight Saving Time range for the current time zone.
* @return {Boolean} true|false
*/
$P.isDaylightSavingTime = function () {
return Date.today().set({month: 0, day: 1}).getTimezoneOffset() !== this.getTimezoneOffset();
};
/**
* Get the offset from UTC of the current date.
* @return {String} The 4-character offset string prefixed with + or - (e.g. "-0500")
*/
$P.getUTCOffset = function (offset) {
var n = (offset || this.getTimezoneOffset()) * -10 / 6, r;
if (n < 0) {
r = (n - 10000).toString();
return r.charAt(0) + r.substr(2);
} else {
r = (n + 10000).toString();
return "+" + r.substr(1);
}
};
/**
* Returns the number of milliseconds between this date and date.
* @param {Date} Defaults to now
* @return {Number} The diff in milliseconds
*/
$P.getElapsed = function (date) {
return (date || new Date()) - this;
};
/**
* Converts the value of the current Date object to its equivalent string representation.
* Format Specifiers
<pre>
CUSTOM DATE AND TIME FORMAT STRINGS
Format Description Example
------ --------------------------------------------------------------------------- -----------------------
s The seconds of the minute between 0-59. "0" to "59"
ss The seconds of the minute with leading zero if required. "00" to "59"
m The minute of the hour between 0-59. "0" or "59"
mm The minute of the hour with leading zero if required. "00" or "59"
h The hour of the day between 1-12. "1" to "12"
hh The hour of the day with leading zero if required. "01" to "12"
H The hour of the day between 0-23. "0" to "23"
HH The hour of the day with leading zero if required. "00" to "23"
d The day of the month between 1 and 31. "1" to "31"
dd The day of the month with leading zero if required. "01" to "31"
ddd Abbreviated day name. Date.CultureInfo.abbreviatedDayNames. "Mon" to "Sun"
dddd The full day name. Date.CultureInfo.dayNames. "Monday" to "Sunday"
M The month of the year between 1-12. "1" to "12"
MM The month of the year with leading zero if required. "01" to "12"
MMM Abbreviated month name. Date.CultureInfo.abbreviatedMonthNames. "Jan" to "Dec"
MMMM The full month name. Date.CultureInfo.monthNames. "January" to "December"
yy The year as a two-digit number. "99" or "08"
yyyy The full four digit year. "1999" or "2008"
t Displays the first character of the A.M./P.M. designator. "A" or "P"
Date.CultureInfo.amDesignator or Date.CultureInfo.pmDesignator
tt Displays the A.M./P.M. designator. "AM" or "PM"
Date.CultureInfo.amDesignator or Date.CultureInfo.pmDesignator
S The ordinal suffix ("st, "nd", "rd" or "th") of the current day. "st, "nd", "rd" or "th"
|| *Format* || *Description* || *Example* ||
|| d || The CultureInfo shortDate Format Pattern || "M/d/yyyy" ||
|| D || The CultureInfo longDate Format Pattern || "dddd, MMMM dd, yyyy" ||
|| F || The CultureInfo fullDateTime Format Pattern || "dddd, MMMM dd, yyyy h:mm:ss tt" ||
|| m || The CultureInfo monthDay Format Pattern || "MMMM dd" ||
|| r || The CultureInfo rfc1123 Format Pattern || "ddd, dd MMM yyyy HH:mm:ss GMT" ||
|| s || The CultureInfo sortableDateTime Format Pattern || "yyyy-MM-ddTHH:mm:ss" ||
|| t || The CultureInfo shortTime Format Pattern || "h:mm tt" ||
|| T || The CultureInfo longTime Format Pattern || "h:mm:ss tt" ||
|| u || The CultureInfo universalSortableDateTime Format Pattern || "yyyy-MM-dd HH:mm:ssZ" ||
|| y || The CultureInfo yearMonth Format Pattern || "MMMM, yyyy" ||
STANDARD DATE AND TIME FORMAT STRINGS
Format Description Example ("en-US")
------ --------------------------------------------------------------------------- -----------------------
d The CultureInfo shortDate Format Pattern "M/d/yyyy"
D The CultureInfo longDate Format Pattern "dddd, MMMM dd, yyyy"
F The CultureInfo fullDateTime Format Pattern "dddd, MMMM dd, yyyy h:mm:ss tt"
m The CultureInfo monthDay Format Pattern "MMMM dd"
r The CultureInfo rfc1123 Format Pattern "ddd, dd MMM yyyy HH:mm:ss GMT"
s The CultureInfo sortableDateTime Format Pattern "yyyy-MM-ddTHH:mm:ss"
t The CultureInfo shortTime Format Pattern "h:mm tt"
T The CultureInfo longTime Format Pattern "h:mm:ss tt"
u The CultureInfo universalSortableDateTime Format Pattern "yyyy-MM-dd HH:mm:ssZ"
y The CultureInfo yearMonth Format Pattern "MMMM, yyyy"
</pre>
* @param {String} A format string consisting of one or more format spcifiers [Optional].
* @return {String} A string representation of the current Date object.
*/
var ord = function (n) {
switch (n * 1) {
case 1:
case 21:
case 31:
return "st";
case 2:
case 22:
return "nd";
case 3:
case 23:
return "rd";
default:
return "th";
}
};
$P.toString = function (format, ignoreStandards) {
var x = this;
// Standard Date and Time Format Strings. Formats pulled from CultureInfo file and
// may vary by culture.
if (!ignoreStandards && format && format.length === 1) {
var y, c = Date.CultureInfo.formatPatterns;
x.t = x.toString;
switch (format) {
case "d":
return x.t(c.shortDate);
case "D":
return x.t(c.longDate);
case "F":
return x.t(c.fullDateTime);
case "m":
return x.t(c.monthDay);
case "r":
case "R":
y = x.clone().addMinutes(x.getTimezoneOffset());
return y.toString(c.rfc1123) + " GMT";
case "s":
return x.t(c.sortableDateTime);
case "t":
return x.t(c.shortTime);
case "T":
return x.t(c.longTime);
case "u":
y = x.clone().addMinutes(x.getTimezoneOffset());
return y.toString(c.universalSortableDateTime);
case "y":
return x.t(c.yearMonth);
}
}
return format ? format.replace(/((\\)?(dd?d?d?|MM?M?M?|yy?y?y?|hh?|HH?|mm?|ss?|tt?|S|q|Q|WW?W?W?)(?![^\[]*\]))/g,
function (m) {
if (m.charAt(0) === "\\") {
return m.replace("\\", "");
}
x.h = x.getHours;
switch (m) {
case "hh":
return p(x.h() < 13 ? (x.h() === 0 ? 12 : x.h()) : (x.h() - 12));
case "h":
return x.h() < 13 ? (x.h() === 0 ? 12 : x.h()) : (x.h() - 12);
case "HH":
return p(x.h());
case "H":
return x.h();
case "mm":
return p(x.getMinutes());
case "m":
return x.getMinutes();
case "ss":
return p(x.getSeconds());
case "s":
return x.getSeconds();
case "yyyy":
return p(x.getFullYear(), 4);
case "yy":
return p(x.getFullYear());
case "dddd":
return Date.CultureInfo.dayNames[x.getDay()];
case "ddd":
return Date.CultureInfo.abbreviatedDayNames[x.getDay()];
case "dd":
return p(x.getDate());
case "d":
return x.getDate();
case "MMMM":
return Date.CultureInfo.monthNames[x.getMonth()];
case "MMM":
return Date.CultureInfo.abbreviatedMonthNames[x.getMonth()];
case "MM":
return p((x.getMonth() + 1));
case "M":
return x.getMonth() + 1;
case "t":
return x.h() < 12 ? Date.CultureInfo.amDesignator.substring(0, 1) : Date.CultureInfo.pmDesignator.substring(0, 1);
case "tt":
return x.h() < 12 ? Date.CultureInfo.amDesignator : Date.CultureInfo.pmDesignator;
case "S":
return ord(x.getDate());
case "W":
return x.getWeek();
case "WW":
return x.getISOWeek();
case "Q":
return "Q" + x.getQuarter();
case "q":
return String(x.getQuarter());
default:
return m;
}
}).replace(/\[|\]/g, "") : this._toString();
};
}());
(function () {
"use strict";
Date.Parsing = {
Exception: function (s) {
this.message = "Parse error at '" + s.substring(0, 10) + " ...'";
}
};
var $P = Date.Parsing;
var dayOffsets = {
standard: [0,31,59,90,120,151,181,212,243,273,304,334],
leap: [0,31,60,91,121,152,182,213,244,274,305,335]
};
$P.isLeapYear = function(year) {
return ((year % 4 === 0) && (year % 100 !== 0)) || (year % 400 === 0);
};
$P.processTimeObject = function (obj) {
var d, jan4, date, offset, dayOffset;
d = new Date();
dayOffset = ($P.isLeapYear(obj.year)) ? dayOffsets.leap : dayOffsets.standard;
obj.hours = obj.hours ? obj.hours : 0;
obj.minutes = obj.minutes ? obj.minutes : 0;
obj.seconds = obj.seconds ? obj.seconds : 0;
obj.milliseconds = obj.milliseconds ? obj.milliseconds : 0;
if (!obj.year) {
obj.year = d.getFullYear();
}
if (!obj.month && (obj.week || obj.dayOfYear)) {
// work out the day of the year...
if (!obj.dayOfYear) {
obj.weekDay = (!obj.weekDay && obj.weekDay !== 0) ? 1 : obj.weekDay;
d = new Date(obj.year, 0, 4);
jan4 = d.getDay() === 0 ? 7 : d.getDay(); // JS is 0 indexed on Sunday.
offset = jan4+3;
obj.dayOfYear = ((obj.week * 7) + (obj.weekDay === 0 ? 7 : obj.weekDay))-offset;
}
for (var i=0;i <= dayOffset.length;i++) {
if (obj.dayOfYear < dayOffset[i] || i === dayOffset.length) {
obj.day = obj.day ? obj.day : (obj.dayOfYear - dayOffset[i-1]);
break;
} else {
obj.month = i;
}
}
} else {
obj.month = obj.month ? obj.month : 0;
obj.day = obj.day ? obj.day : 1;
obj.dayOfYear = dayOffset[obj.month] + obj.day;
}
date = new Date(obj.year, obj.month, obj.day, obj.hours, obj.minutes, obj.seconds, obj.milliseconds);
if (obj.zone) {
// adjust (and calculate) for timezone here
if (obj.zone.toUpperCase() === "Z" || (obj.zone_hours === 0 && obj.zone_minutes === 0)) {
// it's UTC/GML so work out the current timeszone offset
offset = -date.getTimezoneOffset();
} else {
offset = (obj.zone_hours*60) + (obj.zone_minutes ? obj.zone_minutes : 0);
if (obj.zone_sign === "+") {
offset *= -1;
}
offset -= date.getTimezoneOffset();
}
date.setMinutes(date.getMinutes()+offset);
}
return date;
};
$P.ISO = {
regex : /^([\+-]?\d{4}(?!\d{2}\b))((-?)((0[1-9]|1[0-2])(\3([12]\d|0[1-9]|3[01]))?|W([0-4]\d|5[0-3])(-?[1-7])?|(00[1-9]|0[1-9]\d|[12]\d{2}|3([0-5]\d|6[1-6])))([T\s]((([01]\d|2[0-4])((:?)[0-5]\d)?|24\:?00)([\.,]\d+(?!:))?)?(\17[0-5]\d([\.,]\d+)?)?\s?([zZ]|([\+-])([01]\d|2[0-3]):?([0-5]\d)?)?)?)?$/,
parse : function (s) {
var data = s.match(this.regex);
if (!data || !data.length) {
return null;
}
var time = {
year : data[1] ? Number(data[1]) : data[1],
month : data[5] ? (Number(data[5])-1) : data[5],
day : data[7] ? Number(data[7]) : data[7],
week : data[8] ? Number(data[8]) : data[8],
weekDay : data[9] ? (Math.abs(Number(data[9])) === 7 ? 0 : Math.abs(Number(data[9]))) : data[9], // 1-7, starts on Monday. Convert to JS's 0-6 index.
dayOfYear : data[10] ? Number(data[10]) : data[10],
hours : data[15] ? Number(data[15]) : data[15],
minutes : data[16] ? Number(data[16].replace(":","")) : data[16],
seconds : data[19] ? Math.floor(Number(data[19].replace(":","").replace(",","."))) : data[19],
milliseconds : data[20] ? (Number(data[20].replace(",","."))*1000) : data[20],
zone : data[21],
zone_sign : data[22],
zone_hours : (data[23] && typeof data[23] !== "undefined") ? Number(data[23]) : data[23],
zone_minutes : (data[24] && typeof data[23] !== "undefined") ? Number(data[24]) : data[24]
};
if (data[18]) {
data[18] = 60 * Number(data[18].replace(",", "."));
if (!time.minutes) {
time.minutes = data[18];
} else if (!time.seconds) {
time.seconds = data[18];
}
}
if (!time.year || (!time.year && (!time.month && !time.day) && (!time.week && !time.dayOfYear)) ) {
return null;
}
return $P.processTimeObject(time);
}
};
$P.Numeric = {
isNumeric: function (e){return!isNaN(parseFloat(e))&&isFinite(e)},
regex: /\b([0-1]?[0-9])([0-3]?[0-9])([0-2]?[0-9]?[0-9][0-9])\b/i,
parse: function (s) {
var data, i,
time = {},
order = Date.CultureInfo.dateElementOrder.split("");
if (!(this.isNumeric(s)) || // if it's non-numeric OR
(s[0] === "+" && s[0] === "-")) { // It's an arithmatic string (eg +/-1000)
return null;
}
if (s.length < 5) { // assume it's just a year.
time.year = s;
return $P.processTimeObject(time);
}
data = s.match(this.regex);
if (!data || !data.length) {
return null;
}
for (i=0; i < order.length; i++) {
switch(order[i]) {
case "d":
time.day = data[i+1];
break;
case "m":
time.month = (data[i+1]-1);
break;
case "y":
time.year = data[i+1];
break;
}
}
return $P.processTimeObject(time);
}
};
$P.Normalizer = {
parse: function (s) {
var $C = Date.CultureInfo;
var $R = Date.CultureInfo.regexPatterns;
var __ = Date.i18n.__;
s = s.replace($R.jan.source, "January");
s = s.replace($R.feb, "February");
s = s.replace($R.mar, "March");
s = s.replace($R.apr, "April");
s = s.replace($R.may, "May");
s = s.replace($R.jun, "June");
s = s.replace($R.jul, "July");
s = s.replace($R.aug, "August");
s = s.replace($R.sep, "September");
s = s.replace($R.oct, "October");
s = s.replace($R.nov, "November");
s = s.replace($R.dec, "December");
s = s.replace($R.tomorrow, Date.today().addDays(1).toString("d"));
s = s.replace($R.yesterday, Date.today().addDays(-1).toString("d"));
// s = s.replace(new RegExp($R.today.source + "\\b", "i"), Date.today().toString("d"));
s = s.replace(/\bat\b/gi, ""); // replace "at", eg: "tomorrow at 3pm"
s = s.replace(/\s{2,}/, " "); // repliace multiple spaces with one.
s = s.replace(new RegExp("(\\b\\d\\d?("+__("AM")+"|"+__("PM")+")? )("+$R.tomorrow.source.slice(1)+")", "i"), function(full, m1, m2, m3, m4) {
var t = Date.today().addDays(1).toString("d");
var s = t + " " + m1;
return s;
});
s = s.replace(new RegExp("(("+$R.past.source+')\\s('+$R.mon.source+'))'), Date.today().last().monday().toString("d"));
s = s.replace(new RegExp("(("+$R.past.source+')\\s('+$R.tue.source+'))'), Date.today().last().tuesday().toString("d"));
s = s.replace(new RegExp("(("+$R.past.source+')\\s('+$R.wed.source+'))'), Date.today().last().wednesday().toString("d"));
s = s.replace(new RegExp("(("+$R.past.source+')\\s('+$R.thu.source+'))'), Date.today().last().thursday().toString("d"));
s = s.replace(new RegExp("(("+$R.past.source+')\\s('+$R.fri.source+'))'), Date.today().last().friday().toString("d"));
s = s.replace(new RegExp("(("+$R.past.source+')\\s('+$R.sat.source+'))'), Date.today().last().saturday().toString("d"));
s = s.replace(new RegExp("(("+$R.past.source+')\\s('+$R.sun.source+'))'), Date.today().last().sunday().toString("d"));
// s = s.replace($R.thisMorning, "9am"))
s = s.replace($R.amThisMorning, function(str, am){return am;});
s = s.replace($R.inTheMorning, "am");
s = s.replace($R.thisMorning, "9am");
s = s.replace($R.amThisEvening, function(str, pm){return pm;});
s = s.replace($R.inTheEvening, "pm");
s = s.replace($R.thisEvening, "7pm");
try {
var n = s.split(/([\s\-\.\,\/\x27]+)/);
if (n.length === 3) {
if ($P.Numeric.isNumeric(n[0]) && $P.Numeric.isNumeric(n[2])) {
if (n[2].length >= 4) {
// ok, so we're dealing with x/year. But that's not a full date.
// This fixes wonky dateElementOrder parsing when set to dmy order.
if (Date.CultureInfo.dateElementOrder[0] === 'd') {
s = '1/' + n[0] + '/' + n[2]; // set to 1st of month and normalize the seperator
}
}
}
}
} catch (e) {
// continue...
}
return s;
}
};
}());
(function () {
var $P = Date.Parsing;
var _ = $P.Operators = {
//
// Tokenizers
//
rtoken: function (r) { // regex token
return function (s) {
var mx = s.match(r);
if (mx) {
return ([ mx[0], s.substring(mx[0].length) ]);
} else {
throw new $P.Exception(s);
}
};
},
token: function (s) { // whitespace-eating token
return function (s) {
return _.rtoken(new RegExp("^\s*" + s + "\s*"))(s);
// Removed .strip()
// return _.rtoken(new RegExp("^\s*" + s + "\s*"))(s).strip();
};
},
stoken: function (s) { // string token
return _.rtoken(new RegExp("^" + s));
},
//
// Atomic Operators
//
until: function (p) {
return function (s) {
var qx = [], rx = null;
while (s.length) {
try {
rx = p.call(this, s);
} catch (e) {
qx.push(rx[0]);
s = rx[1];
continue;
}
break;
}
return [ qx, s ];
};
},
many: function (p) {
return function (s) {
var rx = [], r = null;
while (s.length) {
try {
r = p.call(this, s);
} catch (e) {
return [ rx, s ];
}
rx.push(r[0]);
s = r[1];
}
return [ rx, s ];
};
},
// generator operators -- see below
optional: function (p) {
return function (s) {
var r = null;
try {
r = p.call(this, s);
} catch (e) {
return [ null, s ];
}
return [ r[0], r[1] ];
};
},
not: function (p) {
return function (s) {
try {
p.call(this, s);
} catch (e) {
return [null, s];
}
throw new $P.Exception(s);
};
},
ignore: function (p) {
return p ?
function (s) {
var r = null;
r = p.call(this, s);
return [null, r[1]];
} : null;
},
product: function () {
var px = arguments[0],
qx = Array.prototype.slice.call(arguments, 1), rx = [];
for (var i = 0 ; i < px.length ; i++) {
rx.push(_.each(px[i], qx));
}
return rx;
},
cache: function (rule) {
var cache = {}, r = null;
return function (s) {
try {
r = cache[s] = (cache[s] || rule.call(this, s));
} catch (e) {
r = cache[s] = e;
}
if (r instanceof $P.Exception) {
throw r;
} else {
return r;
}
};
},
// vector operators -- see below
any: function () {
var px = arguments;
return function (s) {
var r = null;
for (var i = 0; i < px.length; i++) {
if (px[i] == null) {
continue;
}
try {
r = (px[i].call(this, s));
} catch (e) {
r = null;
}
if (r) {
return r;
}
}
throw new $P.Exception(s);
};
},
each: function () {
var px = arguments;
return function (s) {
var rx = [], r = null;
for (var i = 0; i < px.length ; i++) {
if (px[i] == null) {
continue;
}
try {
r = (px[i].call(this, s));
} catch (e) {
throw new $P.Exception(s);
}
rx.push(r[0]);
s = r[1];
}
return [ rx, s];
};
},
all: function () {
var px = arguments, _ = _;
return _.each(_.optional(px));
},
// delimited operators
sequence: function (px, d, c) {
d = d || _.rtoken(/^\s*/);
c = c || null;
if (px.length == 1) {
return px[0];
}
return function (s) {
var r = null, q = null;
var rx = [];
for (var i = 0; i < px.length ; i++) {
try {
r = px[i].call(this, s);
} catch (e) {
break;
}
rx.push(r[0]);
try {
q = d.call(this, r[1]);
} catch (ex) {
q = null;
break;
}
s = q[1];
}
if (!r) {
throw new $P.Exception(s);
}
if (q) {
throw new $P.Exception(q[1]);
}
if (c) {
try {
r = c.call(this, r[1]);
} catch (ey) {
throw new $P.Exception(r[1]);
}
}
return [ rx, (r?r[1]:s) ];
};
},
//
// Composite Operators
//
between: function (d1, p, d2) {
d2 = d2 || d1;
var _fn = _.each(_.ignore(d1), p, _.ignore(d2));
return function (s) {
var rx = _fn.call(this, s);
return [[rx[0][0], r[0][2]], rx[1]];
};
},
list: function (p, d, c) {
d = d || _.rtoken(/^\s*/);
c = c || null;
return (p instanceof Array ?
_.each(_.product(p.slice(0, -1), _.ignore(d)), p.slice(-1), _.ignore(c)) :
_.each(_.many(_.each(p, _.ignore(d))), px, _.ignore(c)));
},
set: function (px, d, c) {
d = d || _.rtoken(/^\s*/);
c = c || null;
return function (s) {
// r is the current match, best the current 'best' match
// which means it parsed the most amount of input
var r = null, p = null, q = null, rx = null, best = [[], s], last = false;
// go through the rules in the given set
for (var i = 0; i < px.length ; i++) {
// last is a flag indicating whether this must be the last element
// if there is only 1 element, then it MUST be the last one
q = null;
p = null;
r = null;
last = (px.length == 1);
// first, we try simply to match the current pattern
// if not, try the next pattern
try {
r = px[i].call(this, s);
} catch (e) {
continue;
}
// since we are matching against a set of elements, the first
// thing to do is to add r[0] to matched elements
rx = [[r[0]], r[1]];
// if we matched and there is still input to parse and
// we don't already know this is the last element,
// we're going to next check for the delimiter ...
// if there's none, or if there's no input left to parse
// than this must be the last element after all ...
if (r[1].length > 0 && ! last) {
try {
q = d.call(this, r[1]);
} catch (ex) {
last = true;
}
} else {
last = true;
}
// if we parsed the delimiter and now there's no more input,
// that means we shouldn't have parsed the delimiter at all
// so don't update r and mark this as the last element ...
if (!last && q[1].length === 0) {
last = true;
}
// so, if this isn't the last element, we're going to see if
// we can get any more matches from the remaining (unmatched)
// elements ...
if (!last) {
// build a list of the remaining rules we can match against,
// i.e., all but the one we just matched against
var qx = [];
for (var j = 0; j < px.length ; j++) {
if (i != j) {
qx.push(px[j]);
}
}
// now invoke recursively set with the remaining input
// note that we don't include the closing delimiter ...
// we'll check for that ourselves at the end
p = _.set(qx, d).call(this, q[1]);
// if we got a non-empty set as a result ...
// (otw rx already contains everything we want to match)
if (p[0].length > 0) {
// update current result, which is stored in rx ...
// basically, pick up the remaining text from p[1]
// and concat the result from p[0] so that we don't
// get endless nesting ...
rx[0] = rx[0].concat(p[0]);
rx[1] = p[1];
}
}
// at this point, rx either contains the last matched element
// or the entire matched set that starts with this element.
// now we just check to see if this variation is better than
// our best so far, in terms of how much of the input is parsed
if (rx[1].length < best[1].length) {
best = rx;
}
// if we've parsed all the input, then we're finished
if (best[1].length === 0) {
break;
}
}
// so now we've either gone through all the patterns trying them
// as the initial match; or we found one that parsed the entire
// input string ...
// if best has no matches, just return empty set ...
if (best[0].length === 0) {
return best;
}
// if a closing delimiter is provided, then we have to check it also
if (c) {
// we try this even if there is no remaining input because the pattern
// may well be optional or match empty input ...
try {
q = c.call(this, best[1]);
} catch (ey) {
throw new $P.Exception(best[1]);
}
// it parsed ... be sure to update the best match remaining input
best[1] = q[1];
}
// if we're here, either there was no closing delimiter or we parsed it
// so now we have the best match; just return it!
return best;
};
},
forward: function (gr, fname) {
return function (s) {
return gr[fname].call(this, s);
};
},
//
// Translation Operators
//
replace: function (rule, repl) {
return function (s) {
var r = rule.call(this, s);
return [repl, r[1]];
};
},
process: function (rule, fn) {
return function (s) {
var r = rule.call(this, s);
return [fn.call(this, r[0]), r[1]];
};
},
min: function (min, rule) {
return function (s) {
var rx = rule.call(this, s);
if (rx[0].length < min) {
throw new $P.Exception(s);
}
return rx;
};
}
};
// Generator Operators And Vector Operators
// Generators are operators that have a signature of F(R) => R,
// taking a given rule and returning another rule, such as
// ignore, which parses a given rule and throws away the result.
// Vector operators are those that have a signature of F(R1,R2,...) => R,
// take a list of rules and returning a new rule, such as each.
// Generator operators are converted (via the following _generator
// function) into functions that can also take a list or array of rules
// and return an array of new rules as though the function had been
// called on each rule in turn (which is what actually happens).
// This allows generators to be used with vector operators more easily.
// Example:
// each(ignore(foo, bar)) instead of each(ignore(foo), ignore(bar))
// This also turns generators into vector operators, which allows
// constructs like:
// not(cache(foo, bar))
var _generator = function (op) {
function gen() {
var args = null, rx = [], px, i;
if (arguments.length > 1) {
args = Array.prototype.slice.call(arguments);
} else if (arguments[0] instanceof Array) {
args = arguments[0];
}
if (args) {
px = args.shift();
if (px.length > 0) {
args.unshift(px[i]);
rx.push(op.apply(null, args));
args.shift();
return rx;
}
} else {
return op.apply(null, arguments);
}
}
return gen;
};
var gx = "optional not ignore cache".split(/\s/);
for (var i = 0 ; i < gx.length ; i++) {
_[gx[i]] = _generator(_[gx[i]]);
}
var _vector = function (op) {
return function () {
if (arguments[0] instanceof Array) {
return op.apply(null, arguments[0]);
} else {
return op.apply(null, arguments);
}
};
};
var vx = "each any all".split(/\s/);
for (var j = 0 ; j < vx.length ; j++) {
_[vx[j]] = _vector(_[vx[j]]);
}
}());
(function () {
var $D = Date;
var flattenAndCompact = function (ax) {
var rx = [];
for (var i = 0; i < ax.length; i++) {
if (ax[i] instanceof Array) {
rx = rx.concat(flattenAndCompact(ax[i]));
} else {
if (ax[i]) {
rx.push(ax[i]);
}
}
}
return rx;
};
$D.Grammar = {};
$D.Translator = {
hour: function (s) {
return function () {
this.hour = Number(s);
};
},
minute: function (s) {
return function () {
this.minute = Number(s);
};
},
second: function (s) {
return function () {
this.second = Number(s);
};
},
/* for ss.s format */
secondAndMillisecond: function (s) {
return function () {
var mx = s.match(/^([0-5][0-9])\.([0-9]{1,3})/);
this.second = Number(mx[1]);
this.millisecond = Number(mx[2]);
};
},
meridian: function (s) {
return function () {
this.meridian = s.slice(0, 1).toLowerCase();
};
},
timezone: function (s) {
return function () {
var n = s.replace(/[^\d\+\-]/g, "");
if (n.length) {
this.timezoneOffset = Number(n);
} else {
this.timezone = s.toLowerCase();
}
};
},
day: function (x) {
var s = x[0];
return function () {
this.day = Number(s.match(/\d+/)[0]);
if (this.day < 1) {
throw "invalid day";
}
};
},
month: function (s) {
return function () {
this.month = (s.length === 3) ? "jan feb mar apr may jun jul aug sep oct nov dec".indexOf(s)/4 : Number(s) - 1;
if (this.month < 0) {
throw "invalid month";
}
};
},
year: function (s) {
return function () {
var n = Number(s);
this.year = ((s.length > 2) ? n :
(n + (((n + 2000) < Date.CultureInfo.twoDigitYearMax) ? 2000 : 1900)));
};
},
rday: function (s) {
return function () {
switch (s) {
case "yesterday":
this.days = -1;
break;
case "tomorrow":
this.days = 1;
break;
case "today":
this.days = 0;
break;
case "now":
this.days = 0;
this.now = true;
break;
}
};
},
finishExact: function (x) {
x = (x instanceof Array) ? x : [ x ];
for (var i = 0 ; i < x.length ; i++) {
if (x[i]) {
x[i].call(this);
}
}
var now = new Date();
if ((this.hour || this.minute) && (!this.month && !this.year && !this.day)) {
this.day = now.getDate();
}
if (!this.year) {
this.year = now.getFullYear();
}
if (!this.month && this.month !== 0) {
this.month = now.getMonth();
}
if (!this.day) {
this.day = 1;
}
if (!this.hour) {
this.hour = 0;
}
if (!this.minute) {
this.minute = 0;
}
if (!this.second) {
this.second = 0;
}
if (!this.millisecond) {
this.millisecond = 0;
}
if (this.meridian && (this.hour || this.hour === 0)) {
if (this.meridian == "a" && this.hour > 11 && Date.Config.strict24hr){
throw "Invalid hour and meridian combination";
} else if (this.meridian == "p" && this.hour < 12 && Date.Config.strict24hr){
throw "Invalid hour and meridian combination";
} else if (this.meridian == "p" && this.hour < 12) {
this.hour = this.hour + 12;
} else if (this.meridian == "a" && this.hour == 12) {
this.hour = 0;
}
}
if (this.day > $D.getDaysInMonth(this.year, this.month)) {
throw new RangeError(this.day + " is not a valid value for days.");
}
var r = new Date(this.year, this.month, this.day, this.hour, this.minute, this.second, this.millisecond);
if (this.year < 100) {
r.setFullYear(this.year); // means years less that 100 are process correctly. JS will parse it otherwise as 1900-1999.
}
if (this.timezone) {
r.set({ timezone: this.timezone });
} else if (this.timezoneOffset) {
r.set({ timezoneOffset: this.timezoneOffset });
}
return r;
},
finish: function (x) {
x = (x instanceof Array) ? flattenAndCompact(x) : [ x ];
if (x.length === 0) {
return null;
}
for (var i = 0 ; i < x.length ; i++) {
if (typeof x[i] == "function") {
x[i].call(this);
}
}
var today = $D.today();
if (this.now && !this.unit && !this.operator) {
return new Date();
} else if (this.now) {
today = new Date();
}
var expression = !!(this.days && this.days !== null || this.orient || this.operator);
var gap, mod, orient;
orient = ((this.orient == "past" || this.operator == "subtract") ? -1 : 1);
if(!this.now && "hour minute second".indexOf(this.unit) != -1) {
today.setTimeToNow();
}
if (this.month && this.unit == "week") {
this.value = this.month + 1;
delete this.month;
delete this.day;
}
if (this.month || this.month === 0) {
if ("year day hour minute second".indexOf(this.unit) != -1) {
if (!this.value) {
this.value = this.month + 1;
}
this.month = null;
expression = true;
}
}
if (!expression && this.weekday && !this.day && !this.days) {
var temp = Date[this.weekday]();
this.day = temp.getDate();
if (!this.month) {
this.month = temp.getMonth();
}
this.year = temp.getFullYear();
}
if (expression && this.weekday && this.unit != "month" && this.unit != "week") {
this.unit = "day";
gap = ($D.getDayNumberFromName(this.weekday) - today.getDay());
mod = 7;
this.days = gap ? ((gap + (orient * mod)) % mod) : (orient * mod);
}
if (this.month && this.unit == "day" && this.operator) {
if (!this.value) {
this.value = (this.month + 1);
}
this.month = null;
}
if (this.value != null && this.month != null && this.year != null) {
this.day = this.value * 1;
}
if (this.month && !this.day && this.value) {
today.set({ day: this.value * 1 });
if (!expression) {
this.day = this.value * 1;
}
}
if (!this.month && this.value && this.unit == "month" && !this.now) {
this.month = this.value;
expression = true;
}
if (expression && (this.month || this.month === 0) && this.unit != "year") {
this.unit = "month";
gap = (this.month - today.getMonth());
mod = 12;
this.months = gap ? ((gap + (orient * mod)) % mod) : (orient * mod);
this.month = null;
}
if (!this.unit) {
this.unit = "day";
}
if (!this.value && this.operator && this.operator !== null && this[this.unit + "s"] && this[this.unit + "s"] !== null) {
this[this.unit + "s"] = this[this.unit + "s"] + ((this.operator == "add") ? 1 : -1) + (this.value||0) * orient;
} else if (this[this.unit + "s"] == null || this.operator != null) {
if (!this.value) {
this.value = 1;
}
this[this.unit + "s"] = this.value * orient;
}
if (this.meridian && (this.hour || this.hour === 0)) {
if (this.meridian == "a" && this.hour > 11 && Date.Config.strict24hr){
throw "Invalid hour and meridian combination";
} else if (this.meridian == "p" && this.hour < 12 && Date.Config.strict24hr){
throw "Invalid hour and meridian combination";
} else if (this.meridian == "p" && this.hour < 12) {
this.hour = this.hour + 12;
} else if (this.meridian == "a" && this.hour == 12) {
this.hour = 0;
}
}
if (this.weekday && this.unit !== "week" && !this.day && !this.days) {
var temp = Date[this.weekday]();
this.day = temp.getDate();
if (temp.getMonth() !== today.getMonth()) {
this.month = temp.getMonth();
}
}
if ((this.month || this.month === 0) && !this.day) {
this.day = 1;
}
if (!this.orient && !this.operator && this.unit == "week" && this.value && !this.day && !this.month) {
return Date.today().setWeek(this.value);
}
if (this.unit == "week" && this.weeks && !this.day && !this.month) {
var weekday = (this.weekday) ? this.weekday : "today";
var d = Date[weekday]().addWeeks(this.weeks);
if (this.now) {
d.setTimeToNow();
}
return d;
}
if (expression && this.timezone && this.day && this.days) {
this.day = this.days;
}
return (expression) ? today.add(this) : today.set(this);
}
};
var _ = $D.Parsing.Operators, g = $D.Grammar, t = $D.Translator, _fn;
g.datePartDelimiter = _.rtoken(/^([\s\-\.\,\/\x27]+)/);
g.timePartDelimiter = _.stoken(":");
g.whiteSpace = _.rtoken(/^\s*/);
g.generalDelimiter = _.rtoken(/^(([\s\,]|at|@|on)+)/);
var _C = {};
g.ctoken = function (keys) {
var fn = _C[keys];
if (! fn) {
var c = Date.CultureInfo.regexPatterns;
var kx = keys.split(/\s+/), px = [];
for (var i = 0; i < kx.length ; i++) {
px.push(_.replace(_.rtoken(c[kx[i]]), kx[i]));
}
fn = _C[keys] = _.any.apply(null, px);
}
return fn;
};
g.ctoken2 = function (key) {
return _.rtoken(Date.CultureInfo.regexPatterns[key]);
};
// hour, minute, second, meridian, timezone
g.h = _.cache(_.process(_.rtoken(/^(0[0-9]|1[0-2]|[1-9])/), t.hour));
g.hh = _.cache(_.process(_.rtoken(/^(0[0-9]|1[0-2])/), t.hour));
g.H = _.cache(_.process(_.rtoken(/^([0-1][0-9]|2[0-3]|[0-9])/), t.hour));
g.HH = _.cache(_.process(_.rtoken(/^([0-1][0-9]|2[0-3])/), t.hour));
g.m = _.cache(_.process(_.rtoken(/^([0-5][0-9]|[0-9])/), t.minute));
g.mm = _.cache(_.process(_.rtoken(/^[0-5][0-9]/), t.minute));
g.s = _.cache(_.process(_.rtoken(/^([0-5][0-9]|[0-9])/), t.second));
g.ss = _.cache(_.process(_.rtoken(/^[0-5][0-9]/), t.second));
g["ss.s"] = _.cache(_.process(_.rtoken(/^[0-5][0-9]\.[0-9]{1,3}/), t.secondAndMillisecond));
g.hms = _.cache(_.sequence([g.H, g.m, g.s], g.timePartDelimiter));
// _.min(1, _.set([ g.H, g.m, g.s ], g._t));
g.t = _.cache(_.process(g.ctoken2("shortMeridian"), t.meridian));
g.tt = _.cache(_.process(g.ctoken2("longMeridian"), t.meridian));
g.z = _.cache(_.process(_.rtoken(/^((\+|\-)\s*\d\d\d\d)|((\+|\-)\d\d\:?\d\d)/), t.timezone));
g.zz = _.cache(_.process(_.rtoken(/^((\+|\-)\s*\d\d\d\d)|((\+|\-)\d\d\:?\d\d)/), t.timezone));
g.zzz = _.cache(_.process(g.ctoken2("timezone"), t.timezone));
g.timeSuffix = _.each(_.ignore(g.whiteSpace), _.set([ g.tt, g.zzz ]));
g.time = _.each(_.optional(_.ignore(_.stoken("T"))), g.hms, g.timeSuffix);
// days, months, years
g.d = _.cache(_.process(_.each(_.rtoken(/^([0-2]\d|3[0-1]|\d)/),
_.optional(g.ctoken2("ordinalSuffix"))), t.day));
g.dd = _.cache(_.process(_.each(_.rtoken(/^([0-2]\d|3[0-1])/),
_.optional(g.ctoken2("ordinalSuffix"))), t.day));
g.ddd = g.dddd = _.cache(_.process(g.ctoken("sun mon tue wed thu fri sat"),
function (s) {
return function () {
this.weekday = s;
};
}
));
g.M = _.cache(_.process(_.rtoken(/^(1[0-2]|0\d|\d)/), t.month));
g.MM = _.cache(_.process(_.rtoken(/^(1[0-2]|0\d)/), t.month));
g.MMM = g.MMMM = _.cache(_.process(g.ctoken("jan feb mar apr may jun jul aug sep oct nov dec"), t.month));
// g.MMM = g.MMMM = _.cache(_.process(g.ctoken(Date.CultureInfo.abbreviatedMonthNames.join(" ")), t.month));
g.y = _.cache(_.process(_.rtoken(/^(\d\d?)/), t.year));
g.yy = _.cache(_.process(_.rtoken(/^(\d\d)/), t.year));
g.yyy = _.cache(_.process(_.rtoken(/^(\d\d?\d?\d?)/), t.year));
g.yyyy = _.cache(_.process(_.rtoken(/^(\d\d\d\d)/), t.year));
// rolling these up into general purpose rules
_fn = function () {
return _.each(_.any.apply(null, arguments), _.not(g.ctoken2("timeContext")));
};
g.day = _fn(g.d, g.dd);
g.month = _fn(g.M, g.MMM);
g.year = _fn(g.yyyy, g.yy);
// relative date / time expressions
g.orientation = _.process(g.ctoken("past future"),
function (s) {
return function () {
this.orient = s;
};
}
);
g.operator = _.process(g.ctoken("add subtract"),
function (s) {
return function () {
this.operator = s;
};
}
);
g.rday = _.process(g.ctoken("yesterday tomorrow today now"), t.rday);
g.unit = _.process(g.ctoken("second minute hour day week month year"),
function (s) {
return function () {
this.unit = s;
};
}
);
g.value = _.process(_.rtoken(/^([-+]?\d+)?(st|nd|rd|th)?/),
function (s) {
return function () {
this.value = s.replace(/\D/g, "");
};
}
);
g.expression = _.set([ g.rday, g.operator, g.value, g.unit, g.orientation, g.ddd, g.MMM ]);
// pre-loaded rules for different date part order preferences
_fn = function () {
return _.set(arguments, g.datePartDelimiter);
};
g.mdy = _fn(g.ddd, g.month, g.day, g.year);
g.ymd = _fn(g.ddd, g.year, g.month, g.day);
g.dmy = _fn(g.ddd, g.day, g.month, g.year);
g.date = function (s) {
return ((g[Date.CultureInfo.dateElementOrder] || g.mdy).call(this, s));
};
// parsing date format specifiers - ex: "h:m:s tt"
// this little guy will generate a custom parser based
// on the format string, ex: g.format("h:m:s tt")
g.format = _.process(_.many(
_.any(
// translate format specifiers into grammar rules
_.process(
_.rtoken(/^(dd?d?d?(?!e)|MM?M?M?|yy?y?y?|hh?|HH?|mm?|ss?|tt?|zz?z?)/),
function (fmt) {
if (g[fmt]) {
return g[fmt];
} else {
throw $D.Parsing.Exception(fmt);
}
}
),
// translate separator tokens into token rules
_.process(_.rtoken(/^[^dMyhHmstz]+/), // all legal separators
function (s) {
return _.ignore(_.stoken(s));
}
)
)),
// construct the parser ...
function (rules) {
return _.process(_.each.apply(null, rules), t.finishExact);
}
);
var _F = {
//"M/d/yyyy": function (s) {
// var m = s.match(/^([0-2]\d|3[0-1]|\d)\/(1[0-2]|0\d|\d)\/(\d\d\d\d)/);
// if (m!=null) {
// var r = [ t.month.call(this,m[1]), t.day.call(this,m[2]), t.year.call(this,m[3]) ];
// r = t.finishExact.call(this,r);
// return [ r, "" ];
// } else {
// throw new Date.Parsing.Exception(s);
// }
//}
//"M/d/yyyy": function (s) { return [ new Date(Date._parse(s)), ""]; }
};
var _get = function (f) {
_F[f] = (_F[f] || g.format(f)[0]);
return _F[f];
};
g.allformats = function (fx) {
var rx = [];
if (fx instanceof Array) {
for (var i = 0; i < fx.length; i++) {
rx.push(_get(fx[i]));
}
} else {
rx.push(_get(fx));
}
return rx;
};
g.formats = function (fx) {
if (fx instanceof Array) {
var rx = [];
for (var i = 0 ; i < fx.length ; i++) {
rx.push(_get(fx[i]));
}
return _.any.apply(null, rx);
} else {
return _get(fx);
}
};
// check for these formats first
g._formats = g.formats([
"\"yyyy-MM-ddTHH:mm:ssZ\"",
"yyyy-MM-ddTHH:mm:ss.sz",
"yyyy-MM-ddTHH:mm:ssZ",
"yyyy-MM-ddTHH:mm:ssz",
"yyyy-MM-ddTHH:mm:ss",
"yyyy-MM-ddTHH:mmZ",
"yyyy-MM-ddTHH:mmz",
"yyyy-MM-ddTHH:mm",
"ddd, MMM dd, yyyy H:mm:ss tt",
"ddd MMM d yyyy HH:mm:ss zzz",
"MMddyyyy",
"ddMMyyyy",
"Mddyyyy",
"ddMyyyy",
"Mdyyyy",
"dMyyyy",
"yyyy",
"Mdyy",
"dMyy",
"d"
]);
// starting rule for general purpose grammar
g._start = _.process(_.set([ g.date, g.time, g.expression ],
g.generalDelimiter, g.whiteSpace), t.finish);
// real starting rule: tries selected formats first,
// then general purpose rule
g.start = function (s) {
try {
var r = g._formats.call({}, s);
if (r[1].length === 0) {
return r;
}
} catch (e) {}
return g._start.call({}, s);
};
/**
* @desc Converts the specified string value into its JavaScript Date equivalent using CultureInfo specific format information.
*
* Example
<pre><code>
///////////
// Dates //
///////////
// 15-Oct-2004
var d1 = Date.parse("10/15/2004");
// 15-Oct-2004
var d1 = Date.parse("15-Oct-2004");
// 15-Oct-2004
var d1 = Date.parse("2004.10.15");
//Fri Oct 15, 2004
var d1 = Date.parse("Fri Oct 15, 2004");
///////////
// Times //
///////////
// Today at 10 PM.
var d1 = Date.parse("10 PM");
// Today at 10:30 PM.
var d1 = Date.parse("10:30 P.M.");
// Today at 6 AM.
var d1 = Date.parse("06am");
/////////////////////
// Dates and Times //
/////////////////////
// 8-July-2004 @ 10:30 PM
var d1 = Date.parse("July 8th, 2004, 10:30 PM");
// 1-July-2004 @ 10:30 PM
var d1 = Date.parse("2004-07-01T22:30:00");
////////////////////
// Relative Dates //
////////////////////
// Returns today's date. The string "today" is culture specific.
var d1 = Date.parse("today");
// Returns yesterday's date. The string "yesterday" is culture specific.
var d1 = Date.parse("yesterday");
// Returns the date of the next thursday.
var d1 = Date.parse("Next thursday");
// Returns the date of the most previous monday.
var d1 = Date.parse("last monday");
// Returns today's day + one year.
var d1 = Date.parse("next year");
///////////////
// Date Math //
///////////////
// Today + 2 days
var d1 = Date.parse("t+2");
// Today + 2 days
var d1 = Date.parse("today + 2 days");
// Today + 3 months
var d1 = Date.parse("t+3m");
// Today - 1 year
var d1 = Date.parse("today - 1 year");
// Today - 1 year
var d1 = Date.parse("t-1y");
/////////////////////////////
// Partial Dates and Times //
/////////////////////////////
// July 15th of this year.
var d1 = Date.parse("July 15");
// 15th day of current day and year.
var d1 = Date.parse("15");
// July 1st of current year at 10pm.
var d1 = Date.parse("7/1 10pm");
</code></pre>
*
* @param {String} The string value to convert into a Date object [Required]
* @return {Date} A Date object or null if the string cannot be converted into a Date.
*/
function parse (s) {
var ords, d, t, r = null;
if (!s) {
return null;
}
if (s instanceof Date) {
return s.clone();
}
if (s.length >= 4 && s.charAt(0) !== "0" && s.charAt(0) !== "+"&& s.charAt(0) !== "-") { // ie: 2004 will pass, 0800 won't.
// Start with specific formats
d = $D.Parsing.ISO.parse(s) || $D.Parsing.Numeric.parse(s);
}
if (d instanceof Date && !isNaN(d.getTime())) {
return d;
} else {
// find ordinal dates (1st, 3rd, 8th, etc and remove them as they cause parsing issues)
ords = s.match(/\b(\d+)(?:st|nd|rd|th)\b/); // find ordinal matches
s = ((ords && ords.length === 2) ? s.replace(ords[0], ords[1]) : s);
s = $D.Parsing.Normalizer.parse(s);
try {
r = $D.Grammar.start.call({}, s.replace(/^\s*(\S*(\s+\S+)*)\s*$/, "$1"));
} catch (e) {
return null;
}
d = ((r[1].length === 0) ? r[0] : null);
if (d !== null) {
return d;
} else {
try {
// ok we haven't parsed it, last ditch attempt with the built-in parser.
t = Date._parse(s);
return (t || t === 0) ? new Date(t) : null;
} catch (e) {
return null;
}
}
}
}
if (!$D._parse) {
$D._parse = $D.parse;
}
$D.parse = parse;
Date.getParseFunction = function (fx) {
var fns = Date.Grammar.allformats(fx);
return function (s) {
var r = null;
for (var i = 0; i < fns.length; i++) {
try {
r = fns[i].call({}, s);
} catch (e) {
continue;
}
if (r[1].length === 0) {
return r[0];
}
}
return null;
};
};
/**
* Converts the specified string value into its JavaScript Date equivalent using the specified format {String} or formats {Array} and the CultureInfo specific format information.
* The format of the string value must match one of the supplied formats exactly.
*
* Example
<pre><code>
// 15-Oct-2004
var d1 = Date.parseExact("10/15/2004", "M/d/yyyy");
// 15-Oct-2004
var d1 = Date.parse("15-Oct-2004", "M-ddd-yyyy");
// 15-Oct-2004
var d1 = Date.parse("2004.10.15", "yyyy.MM.dd");
// Multiple formats
var d1 = Date.parseExact("10/15/2004", ["M/d/yyyy", "MMMM d, yyyy"]);
</code></pre>
*
* @param {String} The string value to convert into a Date object [Required].
* @param {Object} The expected format {String} or an array of expected formats {Array} of the date string [Required].
* @return {Date} A Date object or null if the string cannot be converted into a Date.
*/
$D.parseExact = function (s, fx) {
return $D.getParseFunction(fx)(s);
};
}());
/*************************************************************
* SugarPak - Domain Specific Language - Syntactical Sugar *
*************************************************************/
(function () {
var $D = Date, $P = $D.prototype, $N = Number.prototype;
// private
$P._orient = +1;
// private
$P._nth = null;
// private
$P._is = false;
// private
$P._same = false;
// private
$P._isSecond = false;
// private
$N._dateElement = "days";
/**
* Moves the date to the next instance of a date as specified by the subsequent date element function (eg. .day(), .month()), month name function (eg. .january(), .jan()) or day name function (eg. .friday(), fri()).
* Example
<pre><code>
Date.today().next().friday();
Date.today().next().fri();
Date.today().next().march();
Date.today().next().mar();
Date.today().next().week();
</code></pre>
*
* @return {Date} date
*/
$P.next = function () {
this._move = true;
this._orient = +1;
return this;
};
/**
* Creates a new Date (Date.today()) and moves the date to the next instance of the date as specified by the subsequent date element function (eg. .day(), .month()), month name function (eg. .january(), .jan()) or day name function (eg. .friday(), fri()).
* Example
<pre><code>
Date.next().friday();
Date.next().fri();
Date.next().march();
Date.next().mar();
Date.next().week();
</code></pre>
*
* @return {Date} date
*/
$D.next = function () {
return $D.today().next();
};
/**
* Moves the date to the previous instance of a date as specified by the subsequent date element function (eg. .day(), .month()), month name function (eg. .january(), .jan()) or day name function (eg. .friday(), fri()).
* Example
<pre><code>
Date.today().last().friday();
Date.today().last().fri();
Date.today().last().march();
Date.today().last().mar();
Date.today().last().week();
</code></pre>
*
* @return {Date} date
*/
$P.last = $P.prev = $P.previous = function () {
this._move = true;
this._orient = -1;
return this;
};
/**
* Creates a new Date (Date.today()) and moves the date to the previous instance of the date as specified by the subsequent date element function (eg. .day(), .month()), month name function (eg. .january(), .jan()) or day name function (eg. .friday(), fri()).
* Example
<pre><code>
Date.last().friday();
Date.last().fri();
Date.previous().march();
Date.prev().mar();
Date.last().week();
</code></pre>
*
* @return {Date} date
*/
$D.last = $D.prev = $D.previous = function () {
return $D.today().last();
};
/**
* Performs a equality check when followed by either a month name, day name or .weekday() function.
* Example
<pre><code>
Date.today().is().friday(); // true|false
Date.today().is().fri();
Date.today().is().march();
Date.today().is().mar();
</code></pre>
*
* @return {Boolean} true|false
*/
$P.is = function () {
this._is = true;
return this;
};
/**
* Determines if two date objects occur on/in exactly the same instance of the subsequent date part function.
* The function .same() must be followed by a date part function (example: .day(), .month(), .year(), etc).
*
* An optional Date can be passed in the date part function. If now date is passed as a parameter, 'Now' is used.
*
* The following example demonstrates how to determine if two dates fall on the exact same day.
*
* Example
<pre><code>
var d1 = Date.today(); // today at 00:00
var d2 = new Date(); // exactly now.
// Do they occur on the same day?
d1.same().day(d2); // true
// Do they occur on the same hour?
d1.same().hour(d2); // false, unless d2 hour is '00' (midnight).
// What if it's the same day, but one year apart?
var nextYear = Date.today().add(1).year();
d1.same().day(nextYear); // false, because the dates must occur on the exact same day.
</code></pre>
*
* Scenario: Determine if a given date occurs during some week period 2 months from now.
*
* Example
<pre><code>
var future = Date.today().add(2).months();
return someDate.same().week(future); // true|false;
</code></pre>
*
* @return {Boolean} true|false
*/
$P.same = function () {
this._same = true;
this._isSecond = false;
return this;
};
/**
* Determines if the current date/time occurs during Today. Must be preceded by the .is() function.
* Example
<pre><code>
someDate.is().today(); // true|false
new Date().is().today(); // true
Date.today().is().today();// true
Date.today().add(-1).day().is().today(); // false
</code></pre>
*
* @return {Boolean} true|false
*/
$P.today = function () {
return this.same().day();
};
/**
* Determines if the current date is a weekday. This function must be preceded by the .is() function.
* Example
<pre><code>
Date.today().is().weekday(); // true|false
</code></pre>
*
* @return {Boolean} true|false
*/
$P.weekday = function () {
if (this._nth) {
return df("Weekday").call(this);
}
if (this._move) {
return this.addWeekdays(this._orient);
}
if (this._is) {
this._is = false;
return (!this.is().sat() && !this.is().sun());
}
return false;
};
/**
* Determines if the current date is on the weekend. This function must be preceded by the .is() function.
* Example
<pre><code>
Date.today().is().weekend(); // true|false
</code></pre>
*
* @return {Boolean} true|false
*/
$P.weekend = function () {
if (this._is) {
this._is = false;
return (this.is().sat() || this.is().sun());
}
return false;
};
/**
* Sets the Time of the current Date instance. A string "6:15 pm" or config object {hour:18, minute:15} are accepted.
* Example
<pre><code>
// Set time to 6:15pm with a String
Date.today().at("6:15pm");
// Set time to 6:15pm with a config object
Date.today().at({hour:18, minute:15});
</code></pre>
*
* @return {Date} date
*/
$P.at = function (time) {
return (typeof time === "string") ? $D.parse(this.toString("d") + " " + time) : this.set(time);
};
/**
* Creates a new Date() and adds this (Number) to the date based on the preceding date element function (eg. second|minute|hour|day|month|year).
* Example
<pre><code>
// Undeclared Numbers must be wrapped with parentheses. Requirment of JavaScript.
(3).days().fromNow();
(6).months().fromNow();
// Declared Number variables do not require parentheses.
var n = 6;
n.months().fromNow();
</code></pre>
*
* @return {Date} A new Date instance
*/
$N.fromNow = $N.after = function (date) {
var c = {};
c[this._dateElement] = this;
return ((!date) ? new Date() : date.clone()).add(c);
};
/**
* Creates a new Date() and subtract this (Number) from the date based on the preceding date element function (eg. second|minute|hour|day|month|year).
* Example
<pre><code>
// Undeclared Numbers must be wrapped with parentheses. Requirment of JavaScript.
(3).days().ago();
(6).months().ago();
// Declared Number variables do not require parentheses.
var n = 6;
n.months().ago();
</code></pre>
*
* @return {Date} A new Date instance
*/
$N.ago = $N.before = function (date) {
var c = {},
s = (this._dateElement[this._dateElement.length-1] !== "s") ? this._dateElement + "s" : this._dateElement;
c[s] = this * -1;
return ((!date) ? new Date() : date.clone()).add(c);
};
// Do NOT modify the following string tokens. These tokens are used to build dynamic functions.
// All culture-specific strings can be found in the CultureInfo files.
var dx = ("sunday monday tuesday wednesday thursday friday saturday").split(/\s/),
mx = ("january february march april may june july august september october november december").split(/\s/),
px = ("Millisecond Second Minute Hour Day Week Month Year Quarter Weekday").split(/\s/),
pxf = ("Milliseconds Seconds Minutes Hours Date Week Month FullYear Quarter").split(/\s/),
nth = ("final first second third fourth fifth").split(/\s/),
de;
/**
* Returns an object literal of all the date parts.
* Example
<pre><code>
var o = new Date().toObject();
// { year: 2008, month: 4, week: 20, day: 13, hour: 18, minute: 9, second: 32, millisecond: 812 }
// The object properties can be referenced directly from the object.
alert(o.day); // alerts "13"
alert(o.year); // alerts "2008"
</code></pre>
*
* @return {Date} An object literal representing the original date object.
*/
$P.toObject = function () {
var o = {};
for (var i = 0; i < px.length; i++) {
if (this["get" + pxf[i]]) {
o[px[i].toLowerCase()] = this["get" + pxf[i]]();
}
}
return o;
};
/**
* Returns a date created from an object literal. Ignores the .week property if set in the config.
* Example
<pre><code>
var o = new Date().toObject();
return Date.fromObject(o); // will return the same date.
var o2 = {month: 1, day: 20, hour: 18}; // birthday party!
Date.fromObject(o2);
</code></pre>
*
* @return {Date} An object literal representing the original date object.
*/
$D.fromObject = function(config) {
config.week = null;
return Date.today().set(config);
};
// Create day name functions and abbreviated day name functions (eg. monday(), friday(), fri()).
var df = function (n) {
return function () {
if (this._is) {
this._is = false;
return this.getDay() === n;
}
if (this._move) { this._move = null; }
if (this._nth !== null) {
// If the .second() function was called earlier, remove the _orient
// from the date, and then continue.
// This is required because 'second' can be used in two different context.
//
// Example
//
// Date.today().add(1).second();
// Date.march().second().monday();
//
// Things get crazy with the following...
// Date.march().add(1).second().second().monday(); // but it works!!
//
if (this._isSecond) {
this.addSeconds(this._orient * -1);
}
// make sure we reset _isSecond
this._isSecond = false;
var ntemp = this._nth;
this._nth = null;
var temp = this.clone().moveToLastDayOfMonth();
this.moveToNthOccurrence(n, ntemp);
if (this > temp) {
throw new RangeError($D.getDayName(n) + " does not occur " + ntemp + " times in the month of " + $D.getMonthName(temp.getMonth()) + " " + temp.getFullYear() + ".");
}
return this;
}
return this.moveToDayOfWeek(n, this._orient);
};
};
var sdf = function (n) {
return function () {
var t = $D.today(), shift = n - t.getDay();
if (n === 0 && Date.CultureInfo.firstDayOfWeek === 1 && t.getDay() !== 0) {
shift = shift + 7;
}
return t.addDays(shift);
};
};
for (var i = 0; i < dx.length; i++) {
// Create constant static Day Name variables. Example: Date.MONDAY or Date.MON
$D[dx[i].toUpperCase()] = $D[dx[i].toUpperCase().substring(0, 3)] = i;
// Create Day Name functions. Example: Date.monday() or Date.mon()
$D[dx[i]] = $D[dx[i].substring(0, 3)] = sdf(i);
// Create Day Name instance functions. Example: Date.today().next().monday()
$P[dx[i]] = $P[dx[i].substring(0, 3)] = df(i);
}
// Create month name functions and abbreviated month name functions (eg. january(), march(), mar()).
var month_instance_functions = function (n) {
return function () {
if (this._is) {
this._is = false;
return this.getMonth() === n;
}
return this.moveToMonth(n, this._orient);
};
};
var month_static_functions = function (n) {
return function () {
return $D.today().set({ month: n, day: 1 });
};
};
for (var j = 0; j < mx.length; j++) {
// Create constant static Month Name variables. Example: Date.MARCH or Date.MAR
$D[mx[j].toUpperCase()] = $D[mx[j].toUpperCase().substring(0, 3)] = j;
// Create Month Name functions. Example: Date.march() or Date.mar()
$D[mx[j]] = $D[mx[j].substring(0, 3)] = month_static_functions(j);
// Create Month Name instance functions. Example: Date.today().next().march()
$P[mx[j]] = $P[mx[j].substring(0, 3)] = month_instance_functions(j);
}
// Create date element functions and plural date element functions used with Date (eg. day(), days(), months()).
var ef = function (j) {
return function () {
// if the .second() function was called earlier, the _orient
// has alread been added. Just return this and reset _isSecond.
if (this._isSecond) {
this._isSecond = false;
return this;
}
if (this._same) {
this._same = this._is = false;
var o1 = this.toObject(),
o2 = (arguments[0] || new Date()).toObject(),
v = "",
k = j.toLowerCase();
// the substr trick with -1 doesn't work in IE8 or less
k = (k[k.length-1] === "s") ? k.substring(0,k.length-1) : k;
for (var m = (px.length - 1); m > -1; m--) {
v = px[m].toLowerCase();
if (o1[v] !== o2[v]) {
return false;
}
if (k === v) {
break;
}
}
return true;
}
if (j.substring(j.length - 1) !== "s") {
j += "s";
}
if (this._move) { this._move = null; }
return this["add" + j](this._orient);
};
};
var nf = function (n) {
return function () {
this._dateElement = n;
return this;
};
};
for (var k = 0; k < px.length; k++) {
de = px[k].toLowerCase();
if(de !== "weekday") {
// Create date element functions and plural date element functions used with Date (eg. day(), days(), months()).
$P[de] = $P[de + "s"] = ef(px[k]);
// Create date element functions and plural date element functions used with Number (eg. day(), days(), months()).
$N[de] = $N[de + "s"] = nf(de + "s");
}
}
$P._ss = ef("Second");
var nthfn = function (n) {
return function (dayOfWeek) {
if (this._same) {
return this._ss(arguments[0]);
}
if (dayOfWeek || dayOfWeek === 0) {
return this.moveToNthOccurrence(dayOfWeek, n);
}
this._nth = n;
// if the operator is 'second' add the _orient, then deal with it later...
if (n === 2 && (dayOfWeek === undefined || dayOfWeek === null)) {
this._isSecond = true;
return this.addSeconds(this._orient);
}
return this;
};
};
for (var l = 0; l < nth.length; l++) {
$P[nth[l]] = (l === 0) ? nthfn(-1) : nthfn(l);
}
}());
(function () {
var $D = Date,
$P = $D.prototype,
// $C = $D.CultureInfo, // not used atm
$f = [],
p = function (s, l) {
if (!l) {
l = 2;
}
return ("000" + s).slice(l * -1);
};
/**
* Converts a PHP format string to Java/.NET format string.
* A PHP format string can be used with .$format or .format.
* A Java/.NET format string can be used with .toString().
* The .parseExact function will only accept a Java/.NET format string
*
* Example
<pre>
var f1 = "%m/%d/%y"
var f2 = Date.normalizeFormat(f1); // "MM/dd/yy"
new Date().format(f1); // "04/13/08"
new Date().$format(f1); // "04/13/08"
new Date().toString(f2); // "04/13/08"
var date = Date.parseExact("04/13/08", f2); // Sun Apr 13 2008
</pre>
* @param {String} A PHP format string consisting of one or more format spcifiers.
* @return {String} The PHP format converted to a Java/.NET format string.
*/
$D.normalizeFormat = function (format) {
// function does nothing atm
// $f = [];
// var t = new Date().$format(format);
// return $f.join("");
return format;
};
/**
* Format a local Unix timestamp according to locale settings
*
* Example
<pre>
Date.strftime("%m/%d/%y", new Date()); // "04/13/08"
Date.strftime("c", "2008-04-13T17:52:03Z"); // "04/13/08"
</pre>
* @param {String} A format string consisting of one or more format spcifiers [Optional].
* @param {Number} The number representing the number of seconds that have elapsed since January 1, 1970 (local time).
* @return {String} A string representation of the current Date object.
*/
$D.strftime = function (format, time) {
return new Date(time * 1000).$format(format);
};
/**
* Parse any textual datetime description into a Unix timestamp.
* A Unix timestamp is the number of seconds that have elapsed since January 1, 1970 (midnight UTC/GMT).
*
* Example
<pre>
Date.strtotime("04/13/08"); // 1208044800
Date.strtotime("1970-01-01T00:00:00Z"); // 0
</pre>
* @param {String} A format string consisting of one or more format spcifiers [Optional].
* @param {Object} A string or date object.
* @return {String} A string representation of the current Date object.
*/
$D.strtotime = function (time) {
var d = $D.parse(time);
d.addMinutes(d.getTimezoneOffset() * -1);
return Math.round($D.UTC(d.getUTCFullYear(), d.getUTCMonth(), d.getUTCDate(), d.getUTCHours(), d.getUTCMinutes(), d.getUTCSeconds(), d.getUTCMilliseconds()) / 1000);
};
/**
* Converts the value of the current Date object to its equivalent string representation using a PHP/Unix style of date format specifiers.
*
* The following descriptions are from http://www.php.net/strftime and http://www.php.net/manual/en/function.date.php.
* Copyright � 2001-2008 The PHP Group
*
* Format Specifiers
<pre>
Format Description Example
------ --------------------------------------------------------------------------- -----------------------
%a abbreviated weekday name according to the current localed "Mon" through "Sun"
%A full weekday name according to the current locale "Sunday" through "Saturday"
%b abbreviated month name according to the current locale "Jan" through "Dec"
%B full month name according to the current locale "January" through "December"
%c preferred date and time representation for the current locale "4/13/2008 12:33 PM"
%C century number (the year divided by 100 and truncated to an integer) "00" to "99"
%d day of the month as a decimal number "01" to "31"
%D same as %m/%d/%y "04/13/08"
%e day of the month as a decimal number, a single digit is preceded by a space "1" to "31"
%g like %G, but without the century "08"
%G The 4-digit year corresponding to the ISO week number (see %V). "2008"
This has the same format and value as %Y, except that if the ISO week number
belongs to the previous or next year, that year is used instead.
%h same as %b "Jan" through "Dec"
%H hour as a decimal number using a 24-hour clock "00" to "23"
%I hour as a decimal number using a 12-hour clock "01" to "12"
%j day of the year as a decimal number "001" to "366"
%m month as a decimal number "01" to "12"
%M minute as a decimal number "00" to "59"
%n newline character "\n"
%p either "am" or "pm" according to the given time value, or the "am" or "pm"
corresponding strings for the current locale
%r time in a.m. and p.m. notation "8:44 PM"
%R time in 24 hour notation "20:44"
%S second as a decimal number "00" to "59"
%t tab character "\t"
%T current time, equal to %H:%M:%S "12:49:11"
%u weekday as a decimal number ["1", "7"], with "1" representing Monday "1" to "7"
%U week number of the current year as a decimal number, starting with the "0" to ("52" or "53")
first Sunday as the first day of the first week
%V The ISO 8601:1988 week number of the current year as a decimal number, "00" to ("52" or "53")
range 01 to 53, where week 1 is the first week that has at least 4 days
in the current year, and with Monday as the first day of the week.
(Use %G or %g for the year component that corresponds to the week number
for the specified timestamp.)
%W week number of the current year as a decimal number, starting with the "00" to ("52" or "53")
first Monday as the first day of the first week
%w day of the week as a decimal, Sunday being "0" "0" to "6"
%x preferred date representation for the current locale without the time "4/13/2008"
%X preferred time representation for the current locale without the date "12:53:05"
%y year as a decimal number without a century "00" "99"
%Y year as a decimal number including the century "2008"
%Z time zone or name or abbreviation "UTC", "EST", "PST"
%z same as %Z
%% a literal "%" character "%"
d Day of the month, 2 digits with leading zeros "01" to "31"
D A textual representation of a day, three letters "Mon" through "Sun"
j Day of the month without leading zeros "1" to "31"
l A full textual representation of the day of the week (lowercase "L") "Sunday" through "Saturday"
N ISO-8601 numeric representation of the day of the week (added in PHP 5.1.0) "1" (for Monday) through "7" (for Sunday)
S English ordinal suffix for the day of the month, 2 characters "st", "nd", "rd" or "th". Works well with j
w Numeric representation of the day of the week "0" (for Sunday) through "6" (for Saturday)
z The day of the year (starting from "0") "0" through "365"
W ISO-8601 week number of year, weeks starting on Monday "00" to ("52" or "53")
F A full textual representation of a month, such as January or March "January" through "December"
m Numeric representation of a month, with leading zeros "01" through "12"
M A short textual representation of a month, three letters "Jan" through "Dec"
n Numeric representation of a month, without leading zeros "1" through "12"
t Number of days in the given month "28" through "31"
L Whether it's a leap year "1" if it is a leap year, "0" otherwise
o ISO-8601 year number. This has the same value as Y, except that if the "2008"
ISO week number (W) belongs to the previous or next year, that year
is used instead.
Y A full numeric representation of a year, 4 digits "2008"
y A two digit representation of a year "08"
a Lowercase Ante meridiem and Post meridiem "am" or "pm"
A Uppercase Ante meridiem and Post meridiem "AM" or "PM"
B Swatch Internet time "000" through "999"
g 12-hour format of an hour without leading zeros "1" through "12"
G 24-hour format of an hour without leading zeros "0" through "23"
h 12-hour format of an hour with leading zeros "01" through "12"
H 24-hour format of an hour with leading zeros "00" through "23"
i Minutes with leading zeros "00" to "59"
s Seconds, with leading zeros "00" through "59"
u Milliseconds "54321"
e Timezone identifier "UTC", "EST", "PST"
I Whether or not the date is in daylight saving time (uppercase i) "1" if Daylight Saving Time, "0" otherwise
O Difference to Greenwich time (GMT) in hours "+0200", "-0600"
P Difference to Greenwich time (GMT) with colon between hours and minutes "+02:00", "-06:00"
T Timezone abbreviation "UTC", "EST", "PST"
Z Timezone offset in seconds. The offset for timezones west of UTC is "-43200" through "50400"
always negative, and for those east of UTC is always positive.
c ISO 8601 date "2004-02-12T15:19:21+00:00"
r RFC 2822 formatted date "Thu, 21 Dec 2000 16:01:07 +0200"
U Seconds since the Unix Epoch (January 1 1970 00:00:00 GMT) "0"
</pre>
* @param {String} A format string consisting of one or more format spcifiers [Optional].
* @return {String} A string representation of the current Date object.
*/
$P.$format = function (format) {
var x = this, y,
t = function (v, overrideStandardFormats) {
$f.push(v);
return x.toString(v, overrideStandardFormats);
};
return format ? format.replace(/(%|\\)?.|%%/g,
function (m) {
if (m.charAt(0) === "\\" || m.substring(0, 2) === "%%") {
return m.replace("\\", "").replace("%%", "%");
}
switch (m) {
case "d":
case "%d":
return t("dd");
case "D":
case "%a":
return t("ddd");
case "j":
case "%e":
return t("d", true);
case "l":
case "%A":
return t("dddd");
case "N":
case "%u":
return x.getDay() + 1;
case "S":
return t("S");
case "w":
case "%w":
return x.getDay();
case "z":
return x.getOrdinalNumber();
case "%j":
return p(x.getOrdinalNumber(), 3);
case "%U":
var d1 = x.clone().set({month: 0, day: 1}).addDays(-1).moveToDayOfWeek(0),
d2 = x.clone().addDays(1).moveToDayOfWeek(0, -1);
return (d2 < d1) ? "00" : p((d2.getOrdinalNumber() - d1.getOrdinalNumber()) / 7 + 1);
case "W":
case "%V":
return x.getISOWeek();
case "%W":
return p(x.getWeek());
case "F":
case "%B":
return t("MMMM");
case "m":
case "%m":
return t("MM");
case "M":
case "%b":
case "%h":
return t("MMM");
case "n":
return t("M");
case "t":
return $D.getDaysInMonth(x.getFullYear(), x.getMonth());
case "L":
return ($D.isLeapYear(x.getFullYear())) ? 1 : 0;
case "o":
case "%G":
return x.setWeek(x.getISOWeek()).toString("yyyy");
case "%g":
return x.$format("%G").slice(-2);
case "Y":
case "%Y":
return t("yyyy");
case "y":
case "%y":
return t("yy");
case "a":
case "%p":
return t("tt").toLowerCase();
case "A":
return t("tt").toUpperCase();
case "g":
case "%I":
return t("h");
case "G":
return t("H");
case "h":
return t("hh");
case "H":
case "%H":
return t("HH");
case "i":
case "%M":
return t("mm");
case "s":
case "%S":
return t("ss");
case "u":
return p(x.getMilliseconds(), 3);
case "I":
return (x.isDaylightSavingTime()) ? 1 : 0;
case "O":
return x.getUTCOffset();
case "P":
y = x.getUTCOffset();
return y.substring(0, y.length - 2) + ":" + y.substring(y.length - 2);
case "e":
case "T":
case "%z":
case "%Z":
return x.getTimezone();
case "Z":
return x.getTimezoneOffset() * -60;
case "B":
var now = new Date();
return Math.floor(((now.getHours() * 3600) + (now.getMinutes() * 60) + now.getSeconds() + (now.getTimezoneOffset() + 60) * 60) / 86.4);
case "c":
return x.toISOString().replace(/\"/g, "");
case "U":
return $D.strtotime("now");
case "%c":
return t("d") + " " + t("t");
case "%C":
return Math.floor(x.getFullYear() / 100 + 1);
case "%D":
return t("MM/dd/yy");
case "%n":
return "\\n";
case "%t":
return "\\t";
case "%r":
return t("hh:mm tt");
case "%R":
return t("H:mm");
case "%T":
return t("H:mm:ss");
case "%x":
return t("d");
case "%X":
return t("t");
default:
$f.push(m);
return m;
}
}) : this._toString();
};
if (!$P.format) {
$P.format = $P.$format;
}
}());
/*
* TimeSpan(milliseconds);
* TimeSpan(days, hours, minutes, seconds);
* TimeSpan(days, hours, minutes, seconds, milliseconds);
*/
var TimeSpan = function (days, hours, minutes, seconds, milliseconds) {
var attrs = "days hours minutes seconds milliseconds".split(/\s+/);
var gFn = function (attr) {
return function () {
return this[attr];
};
};
var sFn = function (attr) {
return function (val) {
this[attr] = val;
return this;
};
};
for (var i = 0; i < attrs.length ; i++) {
var $a = attrs[i], $b = $a.slice(0, 1).toUpperCase() + $a.slice(1);
TimeSpan.prototype[$a] = 0;
TimeSpan.prototype["get" + $b] = gFn($a);
TimeSpan.prototype["set" + $b] = sFn($a);
}
if (arguments.length === 4) {
this.setDays(days);
this.setHours(hours);
this.setMinutes(minutes);
this.setSeconds(seconds);
} else if (arguments.length === 5) {
this.setDays(days);
this.setHours(hours);
this.setMinutes(minutes);
this.setSeconds(seconds);
this.setMilliseconds(milliseconds);
} else if (arguments.length === 1 && typeof days === "number") {
var orient = (days < 0) ? -1 : +1;
this.setMilliseconds(Math.abs(days));
this.setDays(Math.floor(this.getMilliseconds() / 86400000) * orient);
this.setMilliseconds(this.getMilliseconds() % 86400000);
this.setHours(Math.floor(this.getMilliseconds() / 3600000) * orient);
this.setMilliseconds(this.getMilliseconds() % 3600000);
this.setMinutes(Math.floor(this.getMilliseconds() / 60000) * orient);
this.setMilliseconds(this.getMilliseconds() % 60000);
this.setSeconds(Math.floor(this.getMilliseconds() / 1000) * orient);
this.setMilliseconds(this.getMilliseconds() % 1000);
this.setMilliseconds(this.getMilliseconds() * orient);
}
this.getTotalMilliseconds = function () {
return (this.getDays() * 86400000) +
(this.getHours() * 3600000) +
(this.getMinutes() * 60000) +
(this.getSeconds() * 1000);
};
this.compareTo = function (time) {
var t1 = new Date(1970, 1, 1, this.getHours(), this.getMinutes(), this.getSeconds()), t2;
if (time === null) {
t2 = new Date(1970, 1, 1, 0, 0, 0);
}
else {
t2 = new Date(1970, 1, 1, time.getHours(), time.getMinutes(), time.getSeconds());
}
return (t1 < t2) ? -1 : (t1 > t2) ? 1 : 0;
};
this.equals = function (time) {
return (this.compareTo(time) === 0);
};
this.add = function (time) {
return (time === null) ? this : this.addSeconds(time.getTotalMilliseconds() / 1000);
};
this.subtract = function (time) {
return (time === null) ? this : this.addSeconds(-time.getTotalMilliseconds() / 1000);
};
this.addDays = function (n) {
return new TimeSpan(this.getTotalMilliseconds() + (n * 86400000));
};
this.addHours = function (n) {
return new TimeSpan(this.getTotalMilliseconds() + (n * 3600000));
};
this.addMinutes = function (n) {
return new TimeSpan(this.getTotalMilliseconds() + (n * 60000));
};
this.addSeconds = function (n) {
return new TimeSpan(this.getTotalMilliseconds() + (n * 1000));
};
this.addMilliseconds = function (n) {
return new TimeSpan(this.getTotalMilliseconds() + n);
};
this.get12HourHour = function () {
return (this.getHours() > 12) ? this.getHours() - 12 : (this.getHours() === 0) ? 12 : this.getHours();
};
this.getDesignator = function () {
return (this.getHours() < 12) ? Date.CultureInfo.amDesignator : Date.CultureInfo.pmDesignator;
};
this.toString = function (format) {
this._toString = function () {
if (this.getDays() !== null && this.getDays() > 0) {
return this.getDays() + "." + this.getHours() + ":" + this.p(this.getMinutes()) + ":" + this.p(this.getSeconds());
} else {
return this.getHours() + ":" + this.p(this.getMinutes()) + ":" + this.p(this.getSeconds());
}
};
this.p = function (s) {
return (s.toString().length < 2) ? "0" + s : s;
};
var me = this;
return format ? format.replace(/dd?|HH?|hh?|mm?|ss?|tt?/g,
function (format) {
switch (format) {
case "d":
return me.getDays();
case "dd":
return me.p(me.getDays());
case "H":
return me.getHours();
case "HH":
return me.p(me.getHours());
case "h":
return me.get12HourHour();
case "hh":
return me.p(me.get12HourHour());
case "m":
return me.getMinutes();
case "mm":
return me.p(me.getMinutes());
case "s":
return me.getSeconds();
case "ss":
return me.p(me.getSeconds());
case "t":
return ((me.getHours() < 12) ? Date.CultureInfo.amDesignator : Date.CultureInfo.pmDesignator).substring(0, 1);
case "tt":
return (me.getHours() < 12) ? Date.CultureInfo.amDesignator : Date.CultureInfo.pmDesignator;
}
}
) : this._toString();
};
return this;
};
/**
* Gets the time of day for this date instances.
* @return {TimeSpan} TimeSpan
*/
Date.prototype.getTimeOfDay = function () {
return new TimeSpan(0, this.getHours(), this.getMinutes(), this.getSeconds(), this.getMilliseconds());
};
/*
* TimePeriod(startDate, endDate);
* TimePeriod(years, months, days, hours, minutes, seconds, milliseconds);
*/
var TimePeriod = function (years, months, days, hours, minutes, seconds, milliseconds) {
var attrs = "years months days hours minutes seconds milliseconds".split(/\s+/);
var gFn = function (attr) {
return function () {
return this[attr];
};
};
var sFn = function (attr) {
return function (val) {
this[attr] = val;
return this;
};
};
for (var i = 0; i < attrs.length ; i++) {
var $a = attrs[i], $b = $a.slice(0, 1).toUpperCase() + $a.slice(1);
TimePeriod.prototype[$a] = 0;
TimePeriod.prototype["get" + $b] = gFn($a);
TimePeriod.prototype["set" + $b] = sFn($a);
}
if (arguments.length === 7) {
this.years = years;
this.months = months;
this.setDays(days);
this.setHours(hours);
this.setMinutes(minutes);
this.setSeconds(seconds);
this.setMilliseconds(milliseconds);
} else if (arguments.length === 2 && arguments[0] instanceof Date && arguments[1] instanceof Date) {
// startDate and endDate as arguments
var d1 = years.clone();
var d2 = months.clone();
var temp = d1.clone();
var orient = (d1 > d2) ? -1 : +1;
this.years = d2.getFullYear() - d1.getFullYear();
temp.addYears(this.years);
if (orient === +1) {
if (temp > d2) {
if (this.years !== 0) {
this.years--;
}
}
} else {
if (temp < d2) {
if (this.years !== 0) {
this.years++;
}
}
}
d1.addYears(this.years);
if (orient === +1) {
while (d1 < d2 && d1.clone().addMonths(1) <= d2) {
d1.addMonths(1);
this.months++;
}
}
else {
while (d1 > d2 && d1.clone().addDays(-d1.getDaysInMonth()) > d2) {
d1.addMonths(-1);
this.months--;
}
}
var diff = d2 - d1;
if (diff !== 0) {
var ts = new TimeSpan(diff);
this.setDays(ts.getDays());
this.setHours(ts.getHours());
this.setMinutes(ts.getMinutes());
this.setSeconds(ts.getSeconds());
this.setMilliseconds(ts.getMilliseconds());
}
}
return this;
};
|
ubergrape/datejs
|
build/development/date-es-HN.js
|
JavaScript
|
mit
| 130,170
|
/*
* variables.h
*
* calc - a simple CLI calculator
* Copyright (c) 2017 Ammon Smith
*
* calc is available free of charge under the terms of the MIT
* License. You are free to redistribute and/or modify it under those
* terms. It is distributed in the hopes that it will be useful, but
* WITHOUT ANY WARRANTY. See the LICENSE file for more details.
*
*/
#ifndef _VARIABLES_H_
#define _VARIABLES_H_
#include "types.h"
int var_set(const struct str *var, double val);
int var_get(const struct str *var, double *val);
void var_list(void);
#endif /* _VARIABLES_H_ */
|
ammongit/c-utils
|
calc/variables.h
|
C
|
mit
| 578
|
<?php
/**
* Conn for Lookupd
* User: moyo
* Date: 31/03/2017
* Time: 4:53 PM
*/
namespace NSQClient\Connection;
use NSQClient\Access\Endpoint;
use NSQClient\Connection\Transport\HTTP;
use NSQClient\Exception\LookupTopicException;
use NSQClient\Logger\Logger;
class Lookupd
{
/**
* @var string
*/
private static $queryFormat = '/lookup?topic=%s';
/**
* @var array
*/
private static $caches = [];
/**
* @param Endpoint $endpoint
* @param $topic
* @return array
* @throws LookupTopicException
*/
public static function getNodes(Endpoint $endpoint, $topic)
{
if (isset(self::$caches[$endpoint->getUniqueID()][$topic])) {
return self::$caches[$endpoint->getUniqueID()][$topic];
}
$url = $endpoint->getLookupd() . sprintf(self::$queryFormat, $topic);
list($error, $result) = HTTP::get($url);
if ($error) {
list($netErrNo, $netErrMsg) = $error;
Logger::ins()->error('Lookupd request failed', ['no' => $netErrNo, 'msg' => $netErrMsg]);
throw new LookupTopicException($netErrMsg, $netErrNo);
} else {
Logger::ins()->debug('Lookupd results got', ['raw' => $result]);
return self::$caches[$endpoint->getUniqueID()][$topic] = self::parseResult($result, $topic);
}
}
/**
* @param $rawJson
* @param $scopeTopic
* @return array
*/
private static function parseResult($rawJson, $scopeTopic)
{
$result = json_decode($rawJson, true);
$nodes = [];
if (isset($result['producers'])) {
foreach ($result['producers'] as $producer) {
$nodes[] = [
'topic' => $scopeTopic,
'host' => $producer['broadcast_address'],
'ports' => [
'tcp' => $producer['tcp_port'],
'http' => $producer['http_port']
]
];
}
}
return $nodes;
}
}
|
moolex/nsqclient-php
|
src/Connection/Lookupd.php
|
PHP
|
mit
| 2,077
|
import * as React from 'react';
import MarkdownDocs from 'docs/src/modules/components/MarkdownDocs';
import {
demos,
docs,
requireDemo,
} from '!@material-ui/markdown/loader!docs/src/pages/components/menus/menus.md';
export default function Page() {
return <MarkdownDocs demos={demos} docs={docs} requireDemo={requireDemo} />;
}
|
mbrookes/material-ui
|
docs/pages/components/menus.js
|
JavaScript
|
mit
| 338
|
<?php
namespace PhpBench\Attributes;
use Attribute;
#[Attribute(Attribute::TARGET_CLASS | Attribute::TARGET_METHOD)]
final class Skip
{
}
|
phpbench/phpbench
|
lib/Attributes/Skip.php
|
PHP
|
mit
| 141
|
#if !NOT_UNITY3D
using System.IO;
using UnityEditor;
using UnityEngine;
using Zenject.Internal;
namespace Zenject.ReflectionBaking
{
public static class ReflectionBakingMenuItems
{
[MenuItem("Assets/Create/Zenject/Reflection Baking Settings", false, 100)]
public static void CreateReflectionBakingSettings()
{
var folderPath = ZenUnityEditorUtil.GetCurrentDirectoryAssetPathFromSelection();
var config = ScriptableObject.CreateInstance<ZenjectReflectionBakingSettings>();
ZenUnityEditorUtil.SaveScriptableObjectAsset(
Path.Combine(folderPath, "ZenjectReflectionBakingSettings.asset"), config);
}
}
}
#endif
|
modesttree/Zenject
|
UnityProject/Assets/Plugins/Zenject/OptionalExtras/ReflectionBaking/Unity/ReflectionBakingMenuItems.cs
|
C#
|
mit
| 707
|
[](http://badge.fury.io/rb/chi-authorization)
[](https://codeclimate.com/github/chi-rb/chi-authorization)
[](https://travis-ci.org/chi-rb/chi-authorization)
# Authorization
DSL to manage user permissions in Rails.
## Why
I want to:
- Use a DSL instead of a plain class.
- Limit authorizations to only controllers and their views.
## Install
Put this line in your Gemfile:
```ruby
gem 'chi-authorization'
```
Then bundle:
```
$ bundle
```
## Configuration
Generate the policies file:
```
bin/rails g chi:authorization:install
```
Set the user `helper_name` inisde the generated `intializers/authorization.rb`:
```ruby
Chi::Authorization.configure do |config|
config.helper_name = :current_user
end
```
## Usage
### Policies
Use `can` and `cannot` methods to define the policies inside the generated `config/authorization.rb`:
```ruby
Chi::Authorization.define do |current_user|
can :view, :any
can :manage, User, if: ->(user) {
user == current_user
}
scope unless: ->{ current_user.admin? } do
can :detroy, Product
end
end
```
### Controllers
Using `authorize!` method `Chi::Exceptions::AccessDenied` is raised if authorization fails:
```ruby
class UsersController < ApplicationController
def edit
@user = User.find(params[:id])
authorize! :edit, @user
end
end
```
If you don't want an exception to be raised use `can?` and `cannot?` instead:
```ruby
class UsersController < ApplicationController
def edit
@user = User.find(params[:id])
if can?(:edit, @user)
@user.update user_params
else
# handle access denied
end
end
end
```
### Views
The helpers `can?` and `cannot?` are available in the controller views too:
```erb
<% if can?(:detroy, @product) %>
<%= link_to @product, method: :delete %>
<% end %>
```
## Contributing
Any issue, pull request, comment of any kind is more than welcome!
## Credits
This gem is funded and maintained by [mmontossi](https://github.com/mmontossi).
With the sponsorship of:
[](https://www.occam.global)
## License
It is free software, and may be redistributed under the terms specified in the MIT-LICENSE file.
|
mmontossi/abilities
|
README.md
|
Markdown
|
mit
| 2,439
|
<?php
class Yamp_Layout_Block_Left extends Yamp_Layout_Block_Abstract
{
/**
* construct
*/
public function _construct()
{
$this->setTemplate("html/left.phtml");
}
}
|
eisbehr-/yamp-framework
|
core/Layout/Block/Left.php
|
PHP
|
mit
| 175
|
import {Component} from '@angular/core';
import {TodoService} from './todo-service';
@Component({
selector: 'todo-app',
template: `
<div>
<todo-input></todo-input>
<hr/>
<todo-list></todo-list>
</div>
`
})
export default class TodoApp { }
|
clbond/augury
|
example-apps/kitchen-sink-example/source/components/todo-app/todo-app.ts
|
TypeScript
|
mit
| 263
|
from django.core.urlresolvers import reverse
from django.test import TestCase
from django.utils import timezone
from .models import Course
from .models import Step
class CourseModelTests(TestCase):
def test_course_creation(self):
course = Course.objects.create(
title="Python Regular Expressions",
description="Learn to write regular expressions in Python"
)
now = timezone.now()
self.assertLess(course.created_at, now)
class StepModelTests(TestCase):
def setUp(self):
self.course = Course.objects.create(
title="Python testing",
description="Learn to write tests in python."
)
def test_step_creation(self):
step = Step.objects.create(
title="A Lovely step title",
description="Nice step description",
course=self.course
)
self.assertIn(step, self.course.step_set.all())
class CourseViewsTest(TestCase):
def setUp(self):
self.course = Course.objects.create(
title="Python testing",
description="Learn to write tests in Python."
)
self.course2 = Course.objects.create(
title="New Course",
description="A new course"
)
self.step = Step.objects.create(
title="Introduction to Doctests",
description="Learn to write tests in your Docstrings",
course=self.course
)
def test_course_list_view(self):
resp = self.client.get(reverse('courses:list'))
self.assertEqual(resp.status_code, 200)
self.assertIn(self.course, resp.context['courses'])
self.assertIn(self.course2, resp.context['courses'])
self.assertTemplateUsed(resp, 'courses/course_list.html')
self.assertContains(resp, self.course.title)
def test_course_detail_view(self):
resp = self.client.get(reverse('courses:course',
kwargs={'pk': self.course.pk}))
self.assertEqual(resp.status_code, 200)
self.assertEqual(self.course, resp.context['course'])
self.assertTemplateUsed(resp, 'courses/course_detail.html')
self.assertContains(resp, self.course.title)
def test_step_detail_view(self):
resp = self.client.get(reverse('courses:step',
kwargs={'course_pk': self.course.pk,
'step_pk': self.step.pk}))
self.assertEqual(resp.status_code, 200)
self.assertEqual(self.step, resp.context['step'])
self.assertTemplateUsed(resp, 'courses/step_detail.html')
self.assertContains(resp, self.course.title)
self.assertContains(resp, self.step.title)
|
lorimccurry/learning_site
|
courses/tests.py
|
Python
|
mit
| 2,724
|
<!DOCTYPE html>
<!--[if lt IE 9]><html class="no-js lt-ie9" lang="en" dir="ltr"><![endif]-->
<!--[if gt IE 8]><!-->
<html class="no-js" lang="en" dir="ltr">
<!--<![endif]-->
<!-- Usage: /eic/site/ccc-rec.nsf/tpl-eng/template-1col.html?Open&id=3 (optional: ?Open&page=filename.html&id=x) -->
<!-- Created: ; Product Code: 536; Server: stratnotes2.ic.gc.ca -->
<head>
<!-- Title begins / Début du titre -->
<title>
Pizza Pizza -
Complete profile - Canadian Company Capabilities - Industries and Business - Industry Canada
</title>
<!-- Title ends / Fin du titre -->
<!-- Meta-data begins / Début des métadonnées -->
<meta charset="utf-8" />
<meta name="dcterms.language" title="ISO639-2" content="eng" />
<meta name="dcterms.title" content="" />
<meta name="description" content="" />
<meta name="dcterms.description" content="" />
<meta name="dcterms.type" content="report, data set" />
<meta name="dcterms.subject" content="businesses, industry" />
<meta name="dcterms.subject" content="businesses, industry" />
<meta name="dcterms.issued" title="W3CDTF" content="" />
<meta name="dcterms.modified" title="W3CDTF" content="" />
<meta name="keywords" content="" />
<meta name="dcterms.creator" content="" />
<meta name="author" content="" />
<meta name="dcterms.created" title="W3CDTF" content="" />
<meta name="dcterms.publisher" content="" />
<meta name="dcterms.audience" title="icaudience" content="" />
<meta name="dcterms.spatial" title="ISO3166-1" content="" />
<meta name="dcterms.spatial" title="gcgeonames" content="" />
<meta name="dcterms.format" content="HTML" />
<meta name="dcterms.identifier" title="ICsiteProduct" content="536" />
<!-- EPI-11240 -->
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<!-- MCG-202 -->
<meta content="width=device-width,initial-scale=1" name="viewport">
<!-- EPI-11567 -->
<meta name = "format-detection" content = "telephone=no">
<!-- EPI-12603 -->
<meta name="robots" content="noarchive">
<!-- EPI-11190 - Webtrends -->
<script>
var startTime = new Date();
startTime = startTime.getTime();
</script>
<!--[if gte IE 9 | !IE ]><!-->
<link href="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/assets/favicon.ico" rel="icon" type="image/x-icon">
<link rel="stylesheet" href="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/css/wet-boew.min.css">
<!--<![endif]-->
<link rel="stylesheet" href="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/css/theme.min.css">
<!--[if lt IE 9]>
<link href="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/assets/favicon.ico" rel="shortcut icon" />
<link rel="stylesheet" href="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/css/ie8-wet-boew.min.css" />
<script src="https://ajax.googleapis.com/ajax/libs/jquery/1.11.1/jquery.min.js"></script>
<script src="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/js/ie8-wet-boew.min.js"></script>
<![endif]-->
<!--[if lte IE 9]>
<![endif]-->
<noscript><link rel="stylesheet" href="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/css/noscript.min.css" /></noscript>
<!-- Google Tag Manager DO NOT REMOVE OR MODIFY - NE PAS SUPPRIMER OU MODIFIER -->
<script>dataLayer1 = [];</script>
<!-- End Google Tag Manager -->
<!-- EPI-11235 -->
<link rel="stylesheet" href="/eic/home.nsf/css/add_WET_4-0_Canada_Apps.css">
<link href="//netdna.bootstrapcdn.com/font-awesome/4.0.3/css/font-awesome.css" rel="stylesheet">
<link href="/app/ccc/srch/css/print.css" media="print" rel="stylesheet" type="text/css" />
</head>
<body class="home" vocab="http://schema.org/" typeof="WebPage">
<!-- EPIC HEADER BEGIN -->
<!-- Google Tag Manager DO NOT REMOVE OR MODIFY - NE PAS SUPPRIMER OU MODIFIER -->
<noscript><iframe title="Google Tag Manager" src="//www.googletagmanager.com/ns.html?id=GTM-TLGQ9K" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>
<script>(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer1'?'&l='+l:'';j.async=true;j.src='//www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer1','GTM-TLGQ9K');</script>
<!-- End Google Tag Manager -->
<!-- EPI-12801 -->
<span typeof="Organization"><meta property="legalName" content="Department_of_Industry"></span>
<ul id="wb-tphp">
<li class="wb-slc">
<a class="wb-sl" href="#wb-cont">Skip to main content</a>
</li>
<li class="wb-slc visible-sm visible-md visible-lg">
<a class="wb-sl" href="#wb-info">Skip to "About this site"</a>
</li>
</ul>
<header role="banner">
<div id="wb-bnr" class="container">
<section id="wb-lng" class="visible-md visible-lg text-right">
<h2 class="wb-inv">Language selection</h2>
<div class="row">
<div class="col-md-12">
<ul class="list-inline mrgn-bttm-0">
<li><a href="nvgt.do?V_TOKEN=1492309877920&V_SEARCH.docsCount=3&V_DOCUMENT.docRank=35916&V_SEARCH.docsStart=35915&V_SEARCH.command=navigate&V_SEARCH.resultsJSP=/prfl.do&lang=fra&redirectUrl=/app/scr/imbs/ccc/rgstrtn/updt.sec?_flId?_flxKy=e1s1&estblmntNo=234567041301&profileId=61&_evId=bck&lang=eng&V_SEARCH.showStricts=false&prtl=1&_flId?_flId?_flxKy=e1s1" title="Français" lang="fr">Français</a></li>
</ul>
</div>
</div>
</section>
<div class="row">
<div class="brand col-xs-8 col-sm-9 col-md-6">
<a href="http://www.canada.ca/en/index.html"><object type="image/svg+xml" tabindex="-1" data="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/assets/sig-blk-en.svg"></object><span class="wb-inv"> Government of Canada</span></a>
</div>
<section class="wb-mb-links col-xs-4 col-sm-3 visible-sm visible-xs" id="wb-glb-mn">
<h2>Search and menus</h2>
<ul class="list-inline text-right chvrn">
<li><a href="#mb-pnl" title="Search and menus" aria-controls="mb-pnl" class="overlay-lnk" role="button"><span class="glyphicon glyphicon-search"><span class="glyphicon glyphicon-th-list"><span class="wb-inv">Search and menus</span></span></span></a></li>
</ul>
<div id="mb-pnl"></div>
</section>
<!-- Site Search Removed -->
</div>
</div>
<nav role="navigation" id="wb-sm" class="wb-menu visible-md visible-lg" data-trgt="mb-pnl" data-ajax-fetch="//cdn.canada.ca/gcweb-cdn-dev/sitemenu/sitemenu-en.html" typeof="SiteNavigationElement">
<h2 class="wb-inv">Topics menu</h2>
<div class="container nvbar">
<div class="row">
<ul class="list-inline menu">
<li><a href="https://www.canada.ca/en/services/jobs.html">Jobs</a></li>
<li><a href="http://www.cic.gc.ca/english/index.asp">Immigration</a></li>
<li><a href="https://travel.gc.ca/">Travel</a></li>
<li><a href="https://www.canada.ca/en/services/business.html">Business</a></li>
<li><a href="https://www.canada.ca/en/services/benefits.html">Benefits</a></li>
<li><a href="http://healthycanadians.gc.ca/index-eng.php">Health</a></li>
<li><a href="https://www.canada.ca/en/services/taxes.html">Taxes</a></li>
<li><a href="https://www.canada.ca/en/services.html">More services</a></li>
</ul>
</div>
</div>
</nav>
<!-- EPIC BODY BEGIN -->
<nav role="navigation" id="wb-bc" class="" property="breadcrumb">
<h2 class="wb-inv">You are here:</h2>
<div class="container">
<div class="row">
<ol class="breadcrumb">
<li><a href="/eic/site/icgc.nsf/eng/home" title="Home">Home</a></li>
<li><a href="/eic/site/icgc.nsf/eng/h_07063.html" title="Industries and Business">Industries and Business</a></li>
<li><a href="/eic/site/ccc-rec.nsf/tpl-eng/../eng/home" >Canadian Company Capabilities</a></li>
</ol>
</div>
</div>
</nav>
</header>
<main id="wb-cont" role="main" property="mainContentOfPage" class="container">
<!-- End Header -->
<!-- Begin Body -->
<!-- Begin Body Title -->
<!-- End Body Title -->
<!-- Begin Body Head -->
<!-- End Body Head -->
<!-- Begin Body Content -->
<br>
<!-- Complete Profile -->
<!-- Company Information above tabbed area-->
<input id="showMore" type="hidden" value='more'/>
<input id="showLess" type="hidden" value='less'/>
<h1 id="wb-cont">
Company profile - Canadian Company Capabilities
</h1>
<div class="profileInfo hidden-print">
<ul class="list-inline">
<li><a href="cccSrch.do?lang=eng&profileId=&prtl=1&key.hitsPerPage=25&searchPage=%252Fapp%252Fccc%252Fsrch%252FcccBscSrch.do%253Flang%253Deng%2526amp%253Bprtl%253D1%2526amp%253Btagid%253D&V_SEARCH.scopeCategory=CCC.Root&V_SEARCH.depth=1&V_SEARCH.showStricts=false&V_SEARCH.sortSpec=title+asc&rstBtn.x=" class="btn btn-link">New Search</a> |</li>
<li><form name="searchForm" method="post" action="/app/ccc/srch/bscSrch.do">
<input type="hidden" name="lang" value="eng" />
<input type="hidden" name="profileId" value="" />
<input type="hidden" name="prtl" value="1" />
<input type="hidden" name="searchPage" value="%2Fapp%2Fccc%2Fsrch%2FcccBscSrch.do%3Flang%3Deng%26amp%3Bprtl%3D1%26amp%3Btagid%3D" />
<input type="hidden" name="V_SEARCH.scopeCategory" value="CCC.Root" />
<input type="hidden" name="V_SEARCH.depth" value="1" />
<input type="hidden" name="V_SEARCH.showStricts" value="false" />
<input id="repeatSearchBtn" class="btn btn-link" type="submit" value="Return to search results" />
</form></li>
<li>| <a href="nvgt.do?V_SEARCH.docsStart=35914&V_DOCUMENT.docRank=35915&V_SEARCH.docsCount=3&lang=eng&prtl=1&sbPrtl=&profile=cmpltPrfl&V_TOKEN=1492309902684&V_SEARCH.command=navigate&V_SEARCH.resultsJSP=%2fprfl.do&estblmntNo=234567164754&profileId=&key.newSearchLabel=">Previous Company</a></li>
<li>| <a href="nvgt.do?V_SEARCH.docsStart=35916&V_DOCUMENT.docRank=35917&V_SEARCH.docsCount=3&lang=eng&prtl=1&sbPrtl=&profile=cmpltPrfl&V_TOKEN=1492309902684&V_SEARCH.command=navigate&V_SEARCH.resultsJSP=%2fprfl.do&estblmntNo=234567164739&profileId=&key.newSearchLabel=">Next Company</a></li>
</ul>
</div>
<details>
<summary>Third-Party Information Liability Disclaimer</summary>
<p>Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.</p>
</details>
<h2>
Pizza Pizza
</h2>
<div class="row">
<div class="col-md-5">
<h2 class="h5 mrgn-bttm-0">Legal/Operating Name:</h2>
<p>Pizza Pizza</p>
<div class="mrgn-tp-md"></div>
<p class="mrgn-bttm-0" ><a href="http://www.pizzapizza.ca"
target="_blank" title="Website URL">http://www.pizzapizza.ca</a></p>
<p><a href="mailto:feedback@pizzapizza.ca" title="feedback@pizzapizza.ca">feedback@pizzapizza.ca</a></p>
</div>
<div class="col-md-4 mrgn-sm-sm">
<h2 class="h5 mrgn-bttm-0">Mailing Address:</h2>
<address class="mrgn-bttm-md">
6975 Meadowvale Town Centre Cir <br/>
MISSISSAUGA,
Ontario<br/>
L5N 2W7
<br/>
</address>
<h2 class="h5 mrgn-bttm-0">Location Address:</h2>
<address class="mrgn-bttm-md">
6975 Meadowvale Town Centre Cir <br/>
MISSISSAUGA,
Ontario<br/>
L5N 2W7
<br/>
</address>
<p class="mrgn-bttm-0"><abbr title="Telephone">Tel.</abbr>:
(416) 967-1111
</p>
<p class="mrgn-bttm-lg"><abbr title="Facsimile">Fax</abbr>:
</p>
</div>
<div class="col-md-3 mrgn-tp-md">
</div>
</div>
<div class="row mrgn-tp-md mrgn-bttm-md">
<div class="col-md-12">
<h2 class="wb-inv">Company Profile</h2>
<br> Pizza Pizza at 6975 MEADOWVALE TOWN CENTRE CIRCLE is located South of Derry Rd on Winston Churchill Blvd.. Pizza Pizza is Canada's number one destination for Hot and Fresh pizza. We offer Old-School, Gourmet and International Pizza recipes as well as wings, pasta, salads and sandwiches. Our growing menu and restaurant locations make us the best choice for people who don't want to sacrifice taste for quality and balanced food options. Since 1967, Pizza Pizza has been guided by a vision to provide the “best food, made especially for you” with a focus on quality ingredients, customer service, continuous innovation and community involvement. In 2013, Foodservice and Hospitality Magazine named Pizza Pizza Limited Company of the Year.<br>
</div>
</div>
<!-- <div class="wb-tabs ignore-session update-hash wb-eqht-off print-active"> -->
<div class="wb-tabs ignore-session">
<div class="tabpanels">
<details id="details-panel1">
<summary>
Full profile
</summary>
<!-- Tab 1 -->
<h2 class="wb-invisible">
Full profile
</h2>
<!-- Contact Information -->
<h3 class="page-header">
Contact information
</h3>
<section class="container-fluid">
<div class="row mrgn-tp-lg">
<div class="col-md-3">
<strong>
General
Inquiries
</strong></div>
</div>
<div class="row mrgn-lft-md">
<div class="col-md-5">
<strong>
Telephone:
</strong>
</div>
<div class="col-md-7">
(416) 967-1111
</div>
</div>
<div class="row mrgn-lft-md">
<div class="col-md-5">
<strong>
Email:
</strong>
</div>
<div class="col-md-7">
directories@pizzapizza.ca
</div>
</div>
</section>
<p class="mrgn-tp-lg text-right small hidden-print">
<a href="#wb-cont">top of page</a>
</p>
<!-- Company Description -->
<h3 class="page-header">
Company description
</h3>
<section class="container-fluid">
<div class="row">
<div class="col-md-5">
<strong>
Exporting:
</strong>
</div>
<div class="col-md-7">
No
</div>
</div>
<div class="row">
<div class="col-md-5">
<strong>
Alternate Industries (NAICS):
</strong>
</div>
<div class="col-md-7">
722210 - Limited-Service Eating Places<br>
</div>
</div>
<div class="row">
<div class="col-md-5">
<strong>
Primary Business Activity:
</strong>
</div>
<div class="col-md-7">
Retail
</div>
</div>
</section>
<!-- Products / Services / Licensing -->
<h3 class="page-header">
Product / Service / Licensing
</h3>
<section class="container-fluid">
<div class="row mrgn-bttm-md">
<div class="col-md-3">
<strong>
Product Name:
</strong>
</div>
<div class="col-md-9">
pizza<br>
</div>
</div>
</section>
<p class="mrgn-tp-lg text-right small hidden-print">
<a href="#wb-cont">top of page</a>
</p>
<!-- Technology Profile -->
<!-- Market Profile -->
<!-- Sector Information -->
<details class="mrgn-tp-md mrgn-bttm-md">
<summary>
Third-Party Information Liability Disclaimer
</summary>
<p>
Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.
</p>
</details>
</details>
<details id="details-panel2">
<summary>
Contacts
</summary>
<h2 class="wb-invisible">
Contact information
</h2>
<!-- Contact Information -->
<section class="container-fluid">
<div class="row mrgn-tp-lg">
<div class="col-md-3">
<strong>
General
Inquiries
</strong></div>
</div>
<div class="row mrgn-lft-md">
<div class="col-md-5">
<strong>
Telephone:
</strong>
</div>
<div class="col-md-7">
(416) 967-1111
</div>
</div>
<div class="row mrgn-lft-md">
<div class="col-md-5">
<strong>
Email:
</strong>
</div>
<div class="col-md-7">
directories@pizzapizza.ca
</div>
</div>
</section>
</details>
<details id="details-panel3">
<summary>
Description
</summary>
<h2 class="wb-invisible">
Company description
</h2>
<section class="container-fluid">
<div class="row">
<div class="col-md-5">
<strong>
Exporting:
</strong>
</div>
<div class="col-md-7">
No
</div>
</div>
<div class="row">
<div class="col-md-5">
<strong>
Alternate Industries (NAICS):
</strong>
</div>
<div class="col-md-7">
722210 - Limited-Service Eating Places<br>
</div>
</div>
<div class="row">
<div class="col-md-5">
<strong>
Primary Business Activity:
</strong>
</div>
<div class="col-md-7">
Retail
</div>
</div>
</section>
</details>
<details id="details-panel4">
<summary>
Products, services and licensing
</summary>
<h2 class="wb-invisible">
Product / Service / Licensing
</h2>
<section class="container-fluid">
<div class="row mrgn-bttm-md">
<div class="col-md-3">
<strong>
Product Name:
</strong>
</div>
<div class="col-md-9">
pizza<br>
</div>
</div>
</section>
</details>
</div>
</div>
<div class="row">
<div class="col-md-12 text-right">
Last Update Date 2016-11-09
</div>
</div>
<!--
- Artifact ID: CBW - IMBS - CCC Search WAR
- Group ID: ca.gc.ic.strategis.imbs.ccc.search
- Version: 3.26
- Built-By: bamboo
- Build Timestamp: 2017-03-02T21:29:28Z
-->
<!-- End Body Content -->
<!-- Begin Body Foot -->
<!-- End Body Foot -->
<!-- END MAIN TABLE -->
<!-- End body -->
<!-- Begin footer -->
<div class="row pagedetails">
<div class="col-sm-5 col-xs-12 datemod">
<dl id="wb-dtmd">
<dt class=" hidden-print">Date Modified:</dt>
<dd class=" hidden-print">
<span><time>2017-03-02</time></span>
</dd>
</dl>
</div>
<div class="clear visible-xs"></div>
<div class="col-sm-4 col-xs-6">
</div>
<div class="col-sm-3 col-xs-6 text-right">
</div>
<div class="clear visible-xs"></div>
</div>
</main>
<footer role="contentinfo" id="wb-info">
<nav role="navigation" class="container wb-navcurr">
<h2 class="wb-inv">About government</h2>
<!-- EPIC FOOTER BEGIN -->
<!-- EPI-11638 Contact us -->
<ul class="list-unstyled colcount-sm-2 colcount-md-3">
<li><a href="http://www.ic.gc.ca/eic/site/icgc.nsf/eng/h_07026.html#pageid=E048-H00000&from=Industries">Contact us</a></li>
<li><a href="https://www.canada.ca/en/government/dept.html">Departments and agencies</a></li>
<li><a href="https://www.canada.ca/en/government/publicservice.html">Public service and military</a></li>
<li><a href="https://www.canada.ca/en/news.html">News</a></li>
<li><a href="https://www.canada.ca/en/government/system/laws.html">Treaties, laws and regulations</a></li>
<li><a href="https://www.canada.ca/en/transparency/reporting.html">Government-wide reporting</a></li>
<li><a href="http://pm.gc.ca/eng">Prime Minister</a></li>
<li><a href="https://www.canada.ca/en/government/system.html">How government works</a></li>
<li><a href="http://open.canada.ca/en/">Open government</a></li>
</ul>
</nav>
<div class="brand">
<div class="container">
<div class="row">
<nav class="col-md-10 ftr-urlt-lnk">
<h2 class="wb-inv">About this site</h2>
<ul>
<li><a href="https://www.canada.ca/en/social.html">Social media</a></li>
<li><a href="https://www.canada.ca/en/mobile.html">Mobile applications</a></li>
<li><a href="http://www1.canada.ca/en/newsite.html">About Canada.ca</a></li>
<li><a href="http://www.ic.gc.ca/eic/site/icgc.nsf/eng/h_07033.html">Terms and conditions</a></li>
<li><a href="http://www.ic.gc.ca/eic/site/icgc.nsf/eng/h_07033.html#p1">Privacy</a></li>
</ul>
</nav>
<div class="col-xs-6 visible-sm visible-xs tofpg">
<a href="#wb-cont">Top of Page <span class="glyphicon glyphicon-chevron-up"></span></a>
</div>
<div class="col-xs-6 col-md-2 text-right">
<object type="image/svg+xml" tabindex="-1" role="img" data="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/assets/wmms-blk.svg" aria-label="Symbol of the Government of Canada"></object>
</div>
</div>
</div>
</div>
</footer>
<!--[if gte IE 9 | !IE ]><!-->
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>
<script src="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/js/wet-boew.min.js"></script>
<!--<![endif]-->
<!--[if lt IE 9]>
<script src="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/js/ie8-wet-boew2.min.js"></script>
<![endif]-->
<script src="/utils/scripts/_WET_4-0/apps/themes-dist/gcweb/js/theme.min.js"></script>
<!-- EPI-10519 -->
<span class="wb-sessto"
data-wb-sessto='{"inactivity": 1800000, "reactionTime": 180000, "sessionalive": 1800000, "logouturl": "/app/ccc/srch/cccSrch.do?lang=eng&prtl=1"}'></span>
<script src="/eic/home.nsf/js/jQuery.externalOpensInNewWindow.js"></script>
<!-- EPI-11190 - Webtrends -->
<script src="/eic/home.nsf/js/webtrends.js"></script>
<script>var endTime = new Date();</script>
<noscript>
<div><img alt="" id="DCSIMG" width="1" height="1" src="//wt-sdc.ic.gc.ca/dcs6v67hwe0ei7wsv8g9fv50d_3k6i/njs.gif?dcsuri=/nojavascript&WT.js=No&WT.tv=9.4.0&dcssip=www.ic.gc.ca"/></div>
</noscript>
<!-- /Webtrends -->
<!-- JS deps -->
<script src="/eic/home.nsf/js/jquery.imagesloaded.js"></script>
<!-- EPI-11262 - Util JS -->
<script src="/eic/home.nsf/js/_WET_4-0_utils_canada.min.js"></script>
<!-- EPI-11383 -->
<script src="/eic/home.nsf/js/jQuery.icValidationErrors.js"></script>
<span style="display:none;" id='app-info' data-project-groupid='' data-project-artifactid='' data-project-version='' data-project-build-timestamp='' data-issue-tracking='' data-scm-sha1='' data-scm-sha1-abbrev='' data-scm-branch='' data-scm-commit-date=''></span>
</body></html>
<!-- End Footer -->
<!--
- Artifact ID: CBW - IMBS - CCC Search WAR
- Group ID: ca.gc.ic.strategis.imbs.ccc.search
- Version: 3.26
- Built-By: bamboo
- Build Timestamp: 2017-03-02T21:29:28Z
-->
|
GoC-Spending/data-corporations
|
html/234567165089.html
|
HTML
|
mit
| 31,034
|
'use strict';
import View from './index';
import * as React from 'react';
import * as ReactDOM from 'react-dom';
import * as ReactTestUtils from 'react-addons-test-utils';
describe('Button test', function () {
it('Should render button tag', function () {
const view: React.Component<any, {}> = ReactTestUtils.renderIntoDocument(
<View>Test text</View>
);
const elements: Array<Element> = ReactTestUtils.scryRenderedDOMComponentsWithClass(view, 'button__text');
expect(elements.length).toBe(1);
expect(elements[0].innerHTML).toBe('Test text');
});
it('Should render button type', function () {
const view: React.Component<any, {}> = ReactTestUtils.renderIntoDocument(
<View type="red"/>
);
const elements: Array<Element> = ReactTestUtils.scryRenderedDOMComponentsWithClass(view, 'button_red');
expect(elements.length).toBe(1);
});
it('Should emit onClick', function () {
let onClick: jasmine.Spy = jasmine.createSpy('onClick');
const view: React.Component<any, {}> = ReactTestUtils.renderIntoDocument(
<View onClick={onClick} />
);
const elements: Array<Element> = ReactTestUtils.scryRenderedDOMComponentsWithClass(view, 'button');
ReactTestUtils.Simulate.click(elements[0]);
expect(onClick).toHaveBeenCalled();
});
});
|
Connormiha/todo-list
|
src/ts/components/common/Button/index.test.tsx
|
TypeScript
|
mit
| 1,403
|
/*
==============================================
CSS3 ANIMATION CHEAT SHEET
==============================================
Made by Justin Aguilar
www.justinaguilar.com/animations/
Questions, comments, concerns, love letters:
justin@justinaguilar.com
==============================================
*/
/*
==============================================
slideDown
==============================================
*/
.slideDown{
animation-name: slideDown;
-webkit-animation-name: slideDown;
animation-duration: 1s;
-webkit-animation-duration: 1s;
animation-timing-function: ease;
-webkit-animation-timing-function: ease;
visibility: visible !important;
}
@keyframes slideDown {
0% {
transform: translateY(-100%);
}
50%{
transform: translateY(8%);
}
65%{
transform: translateY(-4%);
}
80%{
transform: translateY(4%);
}
95%{
transform: translateY(-2%);
}
100% {
transform: translateY(0%);
}
}
@-webkit-keyframes slideDown {
0% {
-webkit-transform: translateY(-100%);
}
50%{
-webkit-transform: translateY(8%);
}
65%{
-webkit-transform: translateY(-4%);
}
80%{
-webkit-transform: translateY(4%);
}
95%{
-webkit-transform: translateY(-2%);
}
100% {
-webkit-transform: translateY(0%);
}
}
/*
==============================================
slideUp
==============================================
*/
.slideUp{
animation-name: slideUp;
-webkit-animation-name: slideUp;
animation-duration: 0s;
-webkit-animation-duration: 0s;
animation-timing-function: ease;
-webkit-animation-timing-function: ease;
visibility: visible !important;
}
@media screen and (min-width: 1200px) {
.slideUp{
animation-duration:1s;
-webkit-animation-duration: 1s;
}
}
@keyframes slideUp {
0% {
transform: translateY(15%);
}
50%{
transform: translateY(-1%);
}
65%{
transform: translateY(0.5%);
}
80%{
transform: translateY(-0.5%);
}
95%{
transform: translateY(0.25%);
}
100% {
transform: translateY(0%);
}
to {
transform: translateY(0%);
}
}
@-webkit-keyframes slideUp {
0% {
-webkit-transform: translateY(30%);
}
50%{
-webkit-transform: translateY(-1%);
}
65%{
-webkit-transform: translateY(0.5%);
}
80%{
-webkit-transform: translateY(-0.5%);
}
95%{
-webkit-transform: translateY(0.25%);
}
100% {
-webkit-transform: translateY(0%);
}
to {
transform: translateY(0%);
}
}
/*
==============================================
slideLeft
==============================================
*/
.slideLeft{
animation-name: slideLeft;
-webkit-animation-name: slideLeft;
animation-duration: 1s;
-webkit-animation-duration: 1s;
animation-timing-function: ease-in-out;
-webkit-animation-timing-function: ease-in-out;
visibility: visible !important;
}
@keyframes slideLeft {
0% {
transform: translateX(150%);
}
50%{
transform: translateX(-8%);
}
65%{
transform: translateX(4%);
}
80%{
transform: translateX(-4%);
}
95%{
transform: translateX(2%);
}
100% {
transform: translateX(0%);
}
}
@-webkit-keyframes slideLeft {
0% {
-webkit-transform: translateX(150%);
}
50%{
-webkit-transform: translateX(-8%);
}
65%{
-webkit-transform: translateX(4%);
}
80%{
-webkit-transform: translateX(-4%);
}
95%{
-webkit-transform: translateX(2%);
}
100% {
-webkit-transform: translateX(0%);
}
}
/*
==============================================
slideRight
==============================================
*/
.slideRight{
animation-name: slideRight;
-webkit-animation-name: slideRight;
animation-duration: 1s;
-webkit-animation-duration: 1s;
animation-timing-function: ease-in-out;
-webkit-animation-timing-function: ease-in-out;
visibility: visible !important;
animation-delay:1s;
}
@keyframes slideRight {
0% {
transform: translateX(-150%);
}
50%{
transform: translateX(8%);
}
65%{
transform: translateX(-4%);
}
80%{
transform: translateX(4%);
}
95%{
transform: translateX(-2%);
}
100% {
transform: translateX(0%);
}
}
@-webkit-keyframes slideRight {
0% {
-webkit-transform: translateX(-150%);
}
50%{
-webkit-transform: translateX(8%);
}
65%{
-webkit-transform: translateX(-4%);
}
80%{
-webkit-transform: translateX(4%);
}
95%{
-webkit-transform: translateX(-2%);
}
100% {
-webkit-transform: translateX(0%);
}
}
/*
==============================================
slideExpandUp
==============================================
*/
.slideExpandUp{
animation-name: slideExpandUp;
-webkit-animation-name: slideExpandUp;
animation-duration: 1.6s;
-webkit-animation-duration: 1.6s;
animation-timing-function: ease-out;
-webkit-animation-timing-function: ease -out;
visibility: visible !important;
}
@keyframes slideExpandUp {
0% {
transform: translateY(100%) scaleX(0.5);
}
30%{
transform: translateY(-8%) scaleX(0.5);
}
40%{
transform: translateY(2%) scaleX(0.5);
}
50%{
transform: translateY(0%) scaleX(1.1);
}
60%{
transform: translateY(0%) scaleX(0.9);
}
70% {
transform: translateY(0%) scaleX(1.05);
}
80%{
transform: translateY(0%) scaleX(0.95);
}
90% {
transform: translateY(0%) scaleX(1.02);
}
100%{
transform: translateY(0%) scaleX(1);
}
}
@-webkit-keyframes slideExpandUp {
0% {
-webkit-transform: translateY(100%) scaleX(0.5);
}
30%{
-webkit-transform: translateY(-8%) scaleX(0.5);
}
40%{
-webkit-transform: translateY(2%) scaleX(0.5);
}
50%{
-webkit-transform: translateY(0%) scaleX(1.1);
}
60%{
-webkit-transform: translateY(0%) scaleX(0.9);
}
70% {
-webkit-transform: translateY(0%) scaleX(1.05);
}
80%{
-webkit-transform: translateY(0%) scaleX(0.95);
}
90% {
-webkit-transform: translateY(0%) scaleX(1.02);
}
100%{
-webkit-transform: translateY(0%) scaleX(1);
}
}
/*
==============================================
expandUp
==============================================
*/
.expandUp{
animation-name: expandUp;
-webkit-animation-name: expandUp;
animation-duration: 0.7s;
-webkit-animation-duration: 0.7s;
animation-timing-function: ease;
-webkit-animation-timing-function: ease;
visibility: visible !important;
}
@keyframes expandUp {
0% {
transform: translateY(100%) scale(0.6) scaleY(0.5);
}
60%{
transform: translateY(-7%) scaleY(1.12);
}
75%{
transform: translateY(3%);
}
100% {
transform: translateY(0%) scale(1) scaleY(1);
}
}
@-webkit-keyframes expandUp {
0% {
-webkit-transform: translateY(100%) scale(0.6) scaleY(0.5);
}
60%{
-webkit-transform: translateY(-7%) scaleY(1.12);
}
75%{
-webkit-transform: translateY(3%);
}
100% {
-webkit-transform: translateY(0%) scale(1) scaleY(1);
}
}
/*
==============================================
fadeIn
==============================================
*/
.fadeIn{
animation-name: fadeIn;
-webkit-animation-name: fadeIn;
animation-duration: 1.5s;
-webkit-animation-duration: 1.5s;
animation-timing-function: ease-in-out;
-webkit-animation-timing-function: ease-in-out;
visibility: visible !important;
}
@keyframes fadeIn {
0% {
transform: scale(0);
opacity: 0.0;
}
60% {
transform: scale(1.1);
}
80% {
transform: scale(0.9);
opacity: 1;
}
100% {
transform: scale(1);
opacity: 1;
}
}
@-webkit-keyframes fadeIn {
0% {
-webkit-transform: scale(0);
opacity: 0.0;
}
60% {
-webkit-transform: scale(1.1);
}
80% {
-webkit-transform: scale(0.9);
opacity: 1;
}
100% {
-webkit-transform: scale(1);
opacity: 1;
}
}
/*
==============================================
expandOpen
==============================================
*/
.expandOpen{
animation-name: expandOpen;
-webkit-animation-name: expandOpen;
animation-duration: 1.2s;
-webkit-animation-duration: 1.2s;
animation-timing-function: ease-out;
-webkit-animation-timing-function: ease-out;
visibility: visible !important;
}
@keyframes expandOpen {
0% {
transform: scale(1.8);
}
50% {
transform: scale(0.95);
}
80% {
transform: scale(1.05);
}
90% {
transform: scale(0.98);
}
100% {
transform: scale(1);
}
}
@-webkit-keyframes expandOpen {
0% {
-webkit-transform: scale(1.8);
}
50% {
-webkit-transform: scale(0.95);
}
80% {
-webkit-transform: scale(1.05);
}
90% {
-webkit-transform: scale(0.98);
}
100% {
-webkit-transform: scale(1);
}
}
/*
==============================================
bigEntrance
==============================================
*/
.bigEntrance{
animation-name: bigEntrance;
-webkit-animation-name: bigEntrance;
animation-duration: 1.6s;
-webkit-animation-duration: 1.6s;
animation-timing-function: ease-out;
-webkit-animation-timing-function: ease-out;
visibility: visible !important;
}
@keyframes bigEntrance {
0% {
transform: scale(0.3) rotate(6deg) translateX(-30%) translateY(30%);
opacity: 0.2;
}
30% {
transform: scale(1.03) rotate(-2deg) translateX(2%) translateY(-2%);
opacity: 1;
}
45% {
transform: scale(0.98) rotate(1deg) translateX(0%) translateY(0%);
opacity: 1;
}
60% {
transform: scale(1.01) rotate(-1deg) translateX(0%) translateY(0%);
opacity: 1;
}
75% {
transform: scale(0.99) rotate(1deg) translateX(0%) translateY(0%);
opacity: 1;
}
90% {
transform: scale(1.01) rotate(0deg) translateX(0%) translateY(0%);
opacity: 1;
}
100% {
transform: scale(1) rotate(0deg) translateX(0%) translateY(0%);
opacity: 1;
}
}
@-webkit-keyframes bigEntrance {
0% {
-webkit-transform: scale(0.3) rotate(6deg) translateX(-30%) translateY(30%);
opacity: 0.2;
}
30% {
-webkit-transform: scale(1.03) rotate(-2deg) translateX(2%) translateY(-2%);
opacity: 1;
}
45% {
-webkit-transform: scale(0.98) rotate(1deg) translateX(0%) translateY(0%);
opacity: 1;
}
60% {
-webkit-transform: scale(1.01) rotate(-1deg) translateX(0%) translateY(0%);
opacity: 1;
}
75% {
-webkit-transform: scale(0.99) rotate(1deg) translateX(0%) translateY(0%);
opacity: 1;
}
90% {
-webkit-transform: scale(1.01) rotate(0deg) translateX(0%) translateY(0%);
opacity: 1;
}
100% {
-webkit-transform: scale(1) rotate(0deg) translateX(0%) translateY(0%);
opacity: 1;
}
}
/*
==============================================
hatch
==============================================
*/
.hatch{
animation-name: hatch;
-webkit-animation-name: hatch;
animation-duration: 2s;
-webkit-animation-duration: 2s;
animation-timing-function: ease-in-out;
-webkit-animation-timing-function: ease-in-out;
transform-origin: 50% 100%;
-ms-transform-origin: 50% 100%;
-webkit-transform-origin: 50% 100%;
visibility: visible !important;
}
@keyframes hatch {
0% {
transform: rotate(0deg) scaleY(0.6);
}
20% {
transform: rotate(-2deg) scaleY(1.05);
}
35% {
transform: rotate(2deg) scaleY(1);
}
50% {
transform: rotate(-2deg);
}
65% {
transform: rotate(1deg);
}
80% {
transform: rotate(-1deg);
}
100% {
transform: rotate(0deg);
}
}
@-webkit-keyframes hatch {
0% {
-webkit-transform: rotate(0deg) scaleY(0.6);
}
20% {
-webkit-transform: rotate(-2deg) scaleY(1.05);
}
35% {
-webkit-transform: rotate(2deg) scaleY(1);
}
50% {
-webkit-transform: rotate(-2deg);
}
65% {
-webkit-transform: rotate(1deg);
}
80% {
-webkit-transform: rotate(-1deg);
}
100% {
-webkit-transform: rotate(0deg);
}
}
/*
==============================================
bounce
==============================================
*/
.bounce{
animation-name: bounce;
-webkit-animation-name: bounce;
animation-duration: 1.6s;
-webkit-animation-duration: 1.6s;
animation-timing-function: ease;
-webkit-animation-timing-function: ease;
transform-origin: 50% 100%;
-ms-transform-origin: 50% 100%;
-webkit-transform-origin: 50% 100%;
}
@keyframes bounce {
0% {
transform: translateY(0%) scaleY(0.6);
}
60%{
transform: translateY(-100%) scaleY(1.1);
}
70%{
transform: translateY(0%) scaleY(0.95) scaleX(1.05);
}
80%{
transform: translateY(0%) scaleY(1.05) scaleX(1);
}
90%{
transform: translateY(0%) scaleY(0.95) scaleX(1);
}
100%{
transform: translateY(0%) scaleY(1) scaleX(1);
}
}
@-webkit-keyframes bounce {
0% {
-webkit-transform: translateY(0%) scaleY(0.6);
}
60%{
-webkit-transform: translateY(-100%) scaleY(1.1);
}
70%{
-webkit-transform: translateY(0%) scaleY(0.95) scaleX(1.05);
}
80%{
-webkit-transform: translateY(0%) scaleY(1.05) scaleX(1);
}
90%{
-webkit-transform: translateY(0%) scaleY(0.95) scaleX(1);
}
100%{
-webkit-transform: translateY(0%) scaleY(1) scaleX(1);
}
}
/*
==============================================
pulse
==============================================
*/
.pulse{
animation-name: pulse;
-webkit-animation-name: pulse;
animation-duration: 2.0s;
-webkit-animation-duration: 2.0s;
animation-iteration-count: infinite;
-webkit-animation-iteration-count: infinite;
}
@keyframes pulse {
0% {
transform: scale(1);
opacity: 1;
}
50% {
transform: scale(0.95);
opacity: 1;
}
100% {
transform: scale(1);
opacity: 1;
}
}
@-webkit-keyframes pulse {
0% {
-webkit-transform: scale(1);
opacity: 0.7;
}
50% {
-webkit-transform: scale(0.95);
opacity: 1;
}
100% {
-webkit-transform: scale(1);
opacity: 0.7;
}
}
/*
==============================================
floating
==============================================
*/
.floating{
animation-name: floating;
-webkit-animation-name: floating;
animation-duration: 1.5s;
-webkit-animation-duration: 1.5s;
animation-iteration-count: infinite;
-webkit-animation-iteration-count: infinite;
}
@keyframes floating {
0% {
transform: translateY(0%);
}
50% {
transform: translateY(8%);
}
100% {
transform: translateY(0%);
}
}
@-webkit-keyframes floating {
0% {
-webkit-transform: translateY(0%);
}
50% {
-webkit-transform: translateY(8%);
}
100% {
-webkit-transform: translateY(0%);
}
}
/*
==============================================
tossing
==============================================
*/
.tossing{
animation-name: tossing;
-webkit-animation-name: tossing;
animation-duration: 2.5s;
-webkit-animation-duration: 2.5s;
animation-iteration-count: infinite;
-webkit-animation-iteration-count: infinite;
}
@keyframes tossing {
0% {
transform: rotate(-4deg);
}
50% {
transform: rotate(4deg);
}
100% {
transform: rotate(-4deg);
}
}
@-webkit-keyframes tossing {
0% {
-webkit-transform: rotate(-4deg);
}
50% {
-webkit-transform: rotate(4deg);
}
100% {
-webkit-transform: rotate(-4deg);
}
}
/*
==============================================
pullUp
==============================================
*/
.pullUp{
animation-name: pullUp;
-webkit-animation-name: pullUp;
animation-duration: 1.1s;
-webkit-animation-duration: 1.1s;
animation-timing-function: ease-out;
-webkit-animation-timing-function: ease-out;
transform-origin: 50% 100%;
-ms-transform-origin: 50% 100%;
-webkit-transform-origin: 50% 100%;
}
@keyframes pullUp {
0% {
transform: scaleY(0.1);
}
40% {
transform: scaleY(1.02);
}
60% {
transform: scaleY(0.98);
}
80% {
transform: scaleY(1.01);
}
100% {
transform: scaleY(0.98);
}
80% {
transform: scaleY(1.01);
}
100% {
transform: scaleY(1);
}
}
@-webkit-keyframes pullUp {
0% {
-webkit-transform: scaleY(0.1);
}
40% {
-webkit-transform: scaleY(1.02);
}
60% {
-webkit-transform: scaleY(0.98);
}
80% {
-webkit-transform: scaleY(1.01);
}
100% {
-webkit-transform: scaleY(0.98);
}
80% {
-webkit-transform: scaleY(1.01);
}
100% {
-webkit-transform: scaleY(1);
}
}
/*
==============================================
pullDown
==============================================
*/
.pullDown{
animation-name: pullDown;
-webkit-animation-name: pullDown;
animation-duration: 1.1s;
-webkit-animation-duration: 1.1s;
animation-timing-function: ease-out;
-webkit-animation-timing-function: ease-out;
transform-origin: 50% 0%;
-ms-transform-origin: 50% 0%;
-webkit-transform-origin: 50% 0%;
}
@keyframes pullDown {
0% {
transform: scaleY(0.1);
}
40% {
transform: scaleY(1.02);
}
60% {
transform: scaleY(0.98);
}
80% {
transform: scaleY(1.01);
}
100% {
transform: scaleY(0.98);
}
80% {
transform: scaleY(1.01);
}
100% {
transform: scaleY(1);
}
}
@-webkit-keyframes pullDown {
0% {
-webkit-transform: scaleY(0.1);
}
40% {
-webkit-transform: scaleY(1.02);
}
60% {
-webkit-transform: scaleY(0.98);
}
80% {
-webkit-transform: scaleY(1.01);
}
100% {
-webkit-transform: scaleY(0.98);
}
80% {
-webkit-transform: scaleY(1.01);
}
100% {
-webkit-transform: scaleY(1);
}
}
/*
==============================================
stretchLeft
==============================================
*/
.stretchLeft{
animation-name: stretchLeft;
-webkit-animation-name: stretchLeft;
animation-duration: 1.5s;
-webkit-animation-duration: 1.5s;
animation-timing-function: ease-out;
-webkit-animation-timing-function: ease-out;
transform-origin: 100% 0%;
-ms-transform-origin: 100% 0%;
-webkit-transform-origin: 100% 0%;
}
@keyframes stretchLeft {
0% {
transform: scaleX(0.3);
}
40% {
transform: scaleX(1.02);
}
60% {
transform: scaleX(0.98);
}
80% {
transform: scaleX(1.01);
}
100% {
transform: scaleX(0.98);
}
80% {
transform: scaleX(1.01);
}
100% {
transform: scaleX(1);
}
}
@-webkit-keyframes stretchLeft {
0% {
-webkit-transform: scaleX(0.3);
}
40% {
-webkit-transform: scaleX(1.02);
}
60% {
-webkit-transform: scaleX(0.98);
}
80% {
-webkit-transform: scaleX(1.01);
}
100% {
-webkit-transform: scaleX(0.98);
}
80% {
-webkit-transform: scaleX(1.01);
}
100% {
-webkit-transform: scaleX(1);
}
}
/*
==============================================
stretchRight
==============================================
*/
.stretchRight{
animation-name: stretchRight;
-webkit-animation-name: stretchRight;
animation-duration: 1.5s;
-webkit-animation-duration: 1.5s;
animation-timing-function: ease-out;
-webkit-animation-timing-function: ease-out;
transform-origin: 0% 0%;
-ms-transform-origin: 0% 0%;
-webkit-transform-origin: 0% 0%;
}
@keyframes stretchRight {
0% {
transform: scaleX(0.3);
}
40% {
transform: scaleX(1.02);
}
60% {
transform: scaleX(0.98);
}
80% {
transform: scaleX(1.01);
}
100% {
transform: scaleX(0.98);
}
80% {
transform: scaleX(1.01);
}
100% {
transform: scaleX(1);
}
}
@-webkit-keyframes stretchRight {
0% {
-webkit-transform: scaleX(0.3);
}
40% {
-webkit-transform: scaleX(1.02);
}
60% {
-webkit-transform: scaleX(0.98);
}
80% {
-webkit-transform: scaleX(1.01);
}
100% {
-webkit-transform: scaleX(0.98);
}
80% {
-webkit-transform: scaleX(1.01);
}
100% {
-webkit-transform: scaleX(1);
}
}
|
N4SJAMK/N4SJAMK.github.io
|
css/animations.css
|
CSS
|
mit
| 19,027
|
// Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Copyright (c) 2011-2013 The Peercoin developers
// Copyright (c) 2013-2014 The heat developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef BITCOIN_MAIN_H
#define BITCOIN_MAIN_H
#include "bignum.h"
#include "net.h"
#include "script.h"
#include <math.h> /* pow */
#ifdef WIN32
#include <io.h> /* for _commit */
#endif
#include <list>
//the size of the block to hash, from the nVersion to the nNonce
#define HASH_PBLOCK_SIZE(pblock) UEND(pblock->nNonce) - UBEGIN(pblock->nVersion)
#define HASH_BLOCK_SIZE(block) UEND(block.nNonce) - UBEGIN(block.nVersion)
class CWallet;
class CBlock;
class CBlockIndex;
class CKeyItem;
class CReserveKey;
class COutPoint;
class CWalletTx;
class CTransaction;
class CTxOut;
class CAddress;
class CInv;
class CRequestTracker;
class CNode;
static const unsigned int MAX_BLOCK_SIZE = 1000000;
static const unsigned int MAX_BLOCK_SIZE_GEN = MAX_BLOCK_SIZE / 2;
static const unsigned int MAX_BLOCK_SIGOPS = MAX_BLOCK_SIZE / 50;
static const unsigned int MAX_ORPHAN_TRANSACTIONS = MAX_BLOCK_SIZE / 100;
static const int64 MIN_TX_FEE = CENT;
static const int64 MIN_RELAY_TX_FEE = CENT;
static const int64 MAX_MONEY = 250000000 * COIN;
static const int64 MAX_MINT_PROOF_OF_WORK = 50 * COIN;
static const int64 MAX_MINT_PROOF_OF_BURN = 250 * COIN;
static const int64 MIN_TXOUT_AMOUNT = MIN_TX_FEE;
// Default for -maxorphanblocks, maximum number of orphan blocks kept in memory
static const unsigned int DEFAULT_MAX_ORPHAN_BLOCKS = 750;
inline bool MoneyRange(int64 nValue) { return (nValue >= 0 && nValue <= MAX_MONEY); }
static const int COINBASE_MATURITY_SLM = 500;
// Threshold for nLockTime: below this value it is interpreted as block number, otherwise as UNIX timestamp.
static const int LOCKTIME_THRESHOLD = 500000000; // Tue Nov 5 00:53:20 1985 UTC
static const int STAKE_TARGET_SPACING = 90; // 90 second block spacing
static const int POB_TARGET_SPACING = 3; // 3 PoW block spacing target between each PoB block
static const int STAKE_MIN_AGE = 60 * 60 * 24 * 7; // minimum age for coin age
static const int STAKE_MAX_AGE = 60 * 60 * 24 * 90; // stake age of full weight
#ifdef USE_UPNP
static const int fHaveUPnP = true;
#else
static const int fHaveUPnP = false;
#endif
static const uint256 hashGenesisBlockOfficial("0x00000bd56d128da991c71ca6cf19d0b4f96f6f7ae89518694330719129452cd6");
static const uint256 hashGenesisBlockTestNet("0x000002cff911ad912e8a8b7d5b416f1f7380b9a311777e3078f5de5b8f438047");
static const int64 nMaxClockDrift = 2 * 60 * 60; // two hours
extern CScript COINBASE_FLAGS;
extern CCriticalSection cs_main;
extern std::map<uint256, CBlockIndex*> mapBlockIndex;
extern std::set<std::pair<COutPoint, unsigned int> > setStakeSeen;
extern std::set<std::pair<uint256, uint256> > setBurnSeen;
extern uint256 hashGenesisBlock;
extern unsigned int nStakeMinAge;
extern int nCoinbaseMaturity;
extern CBlockIndex* pindexGenesisBlock;
extern int nBestHeight;
extern CBigNum bnBestChainTrust;
extern CBigNum bnBestInvalidTrust;
extern uint256 hashBestChain;
extern CBlockIndex* pindexBest;
extern unsigned int nTransactionsUpdated;
extern uint64 nLastBlockTx;
extern uint64 nLastBlockSize;
extern int64 nLastCoinStakeSearchInterval;
extern const std::string strMessageMagic;
extern double dHashesPerSec;
extern int64 nHPSTimerStart;
extern int64 nTimeBestReceived;
extern CCriticalSection cs_setpwalletRegistered;
extern std::set<CWallet*> setpwalletRegistered;
extern std::map<uint256, CBlock*> mapOrphanBlocks;
// Settings
extern int64 nTransactionFee;
//////////////////////////////////////////////////////////////////////////////
/* Proof Of Burn */
//////////////////////////////////////////////////////////////////////////////
//Burn addresses
const CBitcoinAddress burnOfficialAddress("SfSLMCoinMainNetworkBurnAddr1DeTK5");
const CBitcoinAddress burnTestnetAddress("mmSLiMCoinTestnetBurnAddress1XU5fu");
#define BURN_CONSTANT .01 * CENT
//The hash of a burnt tx doubles smoothly over the course of 350000.0 blocks,
// do not change this without changing BURN_DECAY_RATE (keep floating point)
#define BURN_HASH_DOUBLE 350000.0
//The growth rate of the hash (2 ** (1 / BURN_HASH_DOUBLE)) rounded up,
// do not change this without changing BURN_HASH_DOUBLE
#define BURN_DECAY_RATE 1.00000198
//a burn tx requires atleast x >= 6 confirmations between it and the best block, BURN_MIN_CONFIMS must be > 0
#define BURN_MIN_CONFIRMS 6
#define BURN_HARDER_TARGET 0.5 //make the burn target 0.5 times the intermediate calculated target
//keeps things safe
#if BURN_MIN_CONFIRMS < 1
#error BURN_MIN_CONFIRMS must be greater than or equal to 1
#endif
////////////////////////////////
//PATCHES
////////////////////////////////
//Rounds down the burn hash for all hashes after (or equalling) timestamp 1402314985, not really needed though
// has became a legacy thing due to the burn_hash_intermediate
extern const u32int BURN_ROUND_DOWN;
//at blocks with timestamps greater or equaling 1403247483, when checking burn hash equality in
// CBlock::CheckProofOfBurn, uses the intermediate hash
inline bool use_burn_hash_intermediate(u32int nTime)
{
const u32int BURN_INTERMEDIATE_TIME = 1403247483; //Fri, 20 Jun 2014 06:58:03 GMT
return nTime >= BURN_INTERMEDIATE_TIME ? true : false;
}
//Adjusts the trust values for PoW and PoB blocks
extern const uint64 CHAINCHECKS_SWITCH_TIME;
//Adjusts PoB and PoS targets
extern const uint64 POB_POS_TARGET_SWITCH_TIME;
////////////////////////////////
//PATCHES
////////////////////////////////
void heatAfterBurner(CWallet *pwallet);
bool HashBurnData(uint256 burnBlockHash, uint256 hashPrevBlock, uint256 burnTxHash,
s32int burnBlkHeight, int64 burnValue, uint256 &smallestHashRet, bool fRetIntermediate);
bool GetBurnHash(uint256 hashPrevBlock, s32int burnBlkHeight, s32int burnCTx,
s32int burnCTxOut, uint256 &smallestHashRet, bool fRetIntermediate);
bool GetAllTxClassesByIndex(s32int blkHeight, s32int txDepth, s32int txOutDepth,
CBlock &blockRet, CTransaction &txRet, CTxOut &txOutRet);
//Scans all of the hashes of this transaction and returns the smallest one
bool ScanBurnHashes(const CWalletTx &burnWTx, uint256 &smallestHashRet);
//Applies ScanBurnHashes to all of the burnt hashes stored in the setBurnHashes
void HashAllBurntTx(uint256 &smallestHashRet, CWalletTx &smallestWTxRet);
inline double calculate_burn_multiplier(int64 burnValue, s32int nPoWBlocksBetween)
{
return (BURN_CONSTANT / burnValue) * pow(2, (nPoWBlocksBetween - BURN_MIN_CONFIRMS) / BURN_HASH_DOUBLE);
}
//Given a number of burnt coins and their depth in the chain, returns the number of effectivly burnt coins
inline int64 BurnCalcEffectiveCoins(int64 nCoins, s32int depthInChain)
{
return nCoins / pow(BURN_DECAY_RATE, depthInChain);
}
inline void GetBurnAddress(CBitcoinAddress &addressRet)
{
addressRet = fTestNet ? burnTestnetAddress : burnOfficialAddress;
return;
}
//the burn address, when created, the constuctor automatically assigns its value
class CBurnAddress : public CBitcoinAddress
{
public:
CBurnAddress()
{
GetBurnAddress(*this);
}
};
//if any == true, then compare address with both testnet and realnet burn addresses
// else compare only with the address that corresponds to which network the client is connected to
inline bool IsBurnAddress(const CBitcoinAddress &address, bool any=false)
{
if(any)
return address == burnTestnetAddress || address == burnOfficialAddress;
else{
CBurnAddress burnAddress;
return address == burnAddress;
}
}
//makes a uint256 number into its compact form and returns it as a uint256 again
inline const uint256 becomeCompact(const uint256 &num)
{
//+ 1 at the end so that hashes that are originally above target, when
// made compact, will still not make the limit,
//ex: hash 0x000000221312312 -> 0x00000022131000...01 //still does not make the target
// target 0x000000221310000...000
return CBigNum().SetCompact(CBigNum(num).GetCompact()).getuint256() + 1;
}
//////////////////////////////////////////////////////////////////////////////
/* Proof Of Burn */
//////////////////////////////////////////////////////////////////////////////
class CReserveKey;
class CTxDB;
class CTxIndex;
void RegisterWallet(CWallet* pwalletIn);
void UnregisterWallet(CWallet* pwalletIn);
void SyncWithWallets(const CTransaction& tx, const CBlock* pblock=NULL, bool fUpdate=false, bool fConnect=true);
bool ProcessBlock(CNode* pfrom, CBlock* pblock);
bool CheckDiskSpace(uint64 nAdditionalBytes=0);
FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode="rb");
FILE* AppendBlockFile(unsigned int& nFileRet);
bool LoadBlockIndex(bool fAllowNew=true);
void PrintBlockTree();
bool ProcessMessages(CNode* pfrom);
bool SendMessages(CNode* pto, bool fSendTrickle);
void Generateheats(bool fGenerate, CWallet* pwallet);
CBlock *CreateNewBlock(CWallet* pwallet, bool fProofOfStake=false,
const CWalletTx *burnWalletTx=NULL, CReserveKey *resKey=NULL);
void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce);
void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1);
bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey);
bool CheckProofOfWork(uint256 hash, u32int nBits);
bool CheckProofOfBurnHash(uint256 hash, u32int nBurnBits);
int64 GetProofOfWorkReward(u32int nBits, bool fProofOfBurn=false);
int64 GetProofOfStakeReward(int64 nCoinAge, u32int nTime);
unsigned int ComputeMinWork(unsigned int nBase, int64 nTime);
int GetNumBlocksOfPeers();
bool IsInitialBlockDownload();
std::string GetWarnings(std::string strFor);
bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock);
uint256 WantedByOrphan(const CBlock* pblockOrphan);
const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake);
void heatMiner(CWallet *pwallet, bool fProofOfStake);
CBlockIndex *pindexByHeight(s32int nHeight);
//Returns the number of proof of work blocks between (not including) the
// blocks with heights startHeight and endHeight
s32int nPoWBlocksBetween(s32int startHeight, s32int endHeight);
bool GetWalletFile(CWallet* pwallet, std::string &strWalletFileOut);
/** Position on disk for a particular transaction. */
class CDiskTxPos
{
public:
unsigned int nFile;
unsigned int nBlockPos;
unsigned int nTxPos;
CDiskTxPos()
{
SetNull();
}
CDiskTxPos(unsigned int nFileIn, unsigned int nBlockPosIn, unsigned int nTxPosIn)
{
nFile = nFileIn;
nBlockPos = nBlockPosIn;
nTxPos = nTxPosIn;
}
IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
void SetNull() { nFile = -1; nBlockPos = 0; nTxPos = 0; }
bool IsNull() const { return (nFile == -1); }
friend bool operator==(const CDiskTxPos& a, const CDiskTxPos& b)
{
return (a.nFile == b.nFile &&
a.nBlockPos == b.nBlockPos &&
a.nTxPos == b.nTxPos);
}
friend bool operator!=(const CDiskTxPos& a, const CDiskTxPos& b)
{
return !(a == b);
}
std::string ToString() const
{
if (IsNull())
return "null";
else
return strprintf("(nFile=%d, nBlockPos=%d, nTxPos=%d)", nFile, nBlockPos, nTxPos);
}
void print() const
{
printf("%s", ToString().c_str());
}
};
/** An inpoint - a combination of a transaction and an index n into its vin */
class CInPoint
{
public:
CTransaction* ptx;
unsigned int n;
CInPoint() { SetNull(); }
CInPoint(CTransaction* ptxIn, unsigned int nIn) { ptx = ptxIn; n = nIn; }
void SetNull() { ptx = NULL; n = -1; }
bool IsNull() const { return (ptx == NULL && n == -1); }
};
/** An outpoint - a combination of a transaction hash and an index n into its vout */
class COutPoint
{
public:
uint256 hash;
unsigned int n;
COutPoint() { SetNull(); }
COutPoint(uint256 hashIn, unsigned int nIn) { hash = hashIn; n = nIn; }
IMPLEMENT_SERIALIZE( READWRITE(FLATDATA(*this)); )
void SetNull() { hash = 0; n = -1; }
bool IsNull() const { return (hash == 0 && n == -1); }
friend bool operator<(const COutPoint& a, const COutPoint& b)
{
return (a.hash < b.hash || (a.hash == b.hash && a.n < b.n));
}
friend bool operator==(const COutPoint& a, const COutPoint& b)
{
return (a.hash == b.hash && a.n == b.n);
}
friend bool operator!=(const COutPoint& a, const COutPoint& b)
{
return !(a == b);
}
std::string ToString() const
{
//~ return strprintf("COutPoint(%s, %d)", hash.ToString().substr(0,10).c_str(), n);
return strprintf("COutPoint(%s, %d)", hash.ToString().c_str(), n);
}
void print() const
{
printf("%s\n", ToString().c_str());
}
};
/** An input of a transaction. It contains the location of the previous
* transaction's output that it claims and a signature that matches the
* output's public key.
*/
class CTxIn
{
public:
COutPoint prevout;
CScript scriptSig;
unsigned int nSequence;
CTxIn()
{
nSequence = std::numeric_limits<unsigned int>::max();
}
explicit CTxIn(COutPoint prevoutIn, CScript scriptSigIn=CScript(),
unsigned int nSequenceIn=std::numeric_limits<unsigned int>::max())
{
prevout = prevoutIn;
scriptSig = scriptSigIn;
nSequence = nSequenceIn;
}
CTxIn(uint256 hashPrevTx, unsigned int nOut, CScript scriptSigIn=CScript(),
unsigned int nSequenceIn=std::numeric_limits<unsigned int>::max())
{
prevout = COutPoint(hashPrevTx, nOut);
scriptSig = scriptSigIn;
nSequence = nSequenceIn;
}
IMPLEMENT_SERIALIZE
(
READWRITE(prevout);
READWRITE(scriptSig);
READWRITE(nSequence);
)
bool IsFinal() const
{
return (nSequence == std::numeric_limits<unsigned int>::max());
}
friend bool operator==(const CTxIn& a, const CTxIn& b)
{
return (a.prevout == b.prevout &&
a.scriptSig == b.scriptSig &&
a.nSequence == b.nSequence);
}
friend bool operator!=(const CTxIn& a, const CTxIn& b)
{
return !(a == b);
}
std::string ToStringShort() const
{
return strprintf(" %s %d", prevout.hash.ToString().c_str(), prevout.n);
}
std::string ToString() const
{
std::string str;
str += "CTxIn(";
str += prevout.ToString();
if (prevout.IsNull())
str += strprintf(", coinbase %s", HexStr(scriptSig).c_str());
else
str += strprintf(", scriptSig=%s", scriptSig.ToString().substr(0,24).c_str());
if (nSequence != std::numeric_limits<unsigned int>::max())
str += strprintf(", nSequence=%u", nSequence);
str += ")";
return str;
}
void print() const
{
printf("%s\n", ToString().c_str());
}
};
/** An output of a transaction. It contains the public key that the next input
* must be able to sign with to claim it.
*/
class CTxOut
{
public:
int64 nValue;
CScript scriptPubKey;
CTxOut()
{
SetNull();
}
CTxOut(int64 nValueIn, CScript scriptPubKeyIn)
{
nValue = nValueIn;
scriptPubKey = scriptPubKeyIn;
}
IMPLEMENT_SERIALIZE
(
READWRITE(nValue);
READWRITE(scriptPubKey);
)
void SetNull()
{
nValue = -1;
scriptPubKey.clear();
}
bool IsNull() const
{
return (nValue == -1);
}
void SetEmpty()
{
nValue = 0;
scriptPubKey.clear();
}
bool IsEmpty() const
{
return (nValue == 0 && scriptPubKey.empty());
}
uint256 GetHash() const
{
return SerializeHash(*this);
}
friend bool operator==(const CTxOut& a, const CTxOut& b)
{
return (a.nValue == b.nValue &&
a.scriptPubKey == b.scriptPubKey);
}
friend bool operator!=(const CTxOut& a, const CTxOut& b)
{
return !(a == b);
}
std::string ToStringShort() const
{
return strprintf(" out %s %s", FormatMoney(nValue).c_str(), scriptPubKey.ToString(true).c_str());
}
std::string ToString() const
{
if (IsEmpty()) return "CTxOut(empty)";
if (scriptPubKey.size() < 6)
return "CTxOut(error)";
return strprintf("CTxOut(nValue=%s, scriptPubKey=%s)", FormatMoney(nValue).c_str(), scriptPubKey.ToString().c_str());
}
void print() const
{
printf("%s\n", ToString().c_str());
}
};
enum GetMinFee_mode
{
GMF_BLOCK,
GMF_RELAY,
GMF_SEND,
};
typedef std::map<uint256, std::pair<CTxIndex, CTransaction> > MapPrevTx;
/** The basic transaction that is broadcasted on the network and contained in
* blocks. A transaction can contain multiple inputs and outputs.
*/
class CTransaction
{
public:
int nVersion;
unsigned int nTime;
std::vector<CTxIn> vin;
std::vector<CTxOut> vout;
unsigned int nLockTime;
// Denial-of-service detection:
mutable int nDoS;
bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
CTransaction()
{
SetNull();
}
IMPLEMENT_SERIALIZE
(
READWRITE(this->nVersion);
nVersion = this->nVersion;
READWRITE(nTime);
READWRITE(vin);
READWRITE(vout);
READWRITE(nLockTime);
)
void SetNull()
{
nVersion = 1;
nTime = GetAdjustedTime();
vin.clear();
vout.clear();
nLockTime = 0;
nDoS = 0; // Denial-of-service prevention
}
bool IsNull() const
{
return (vin.empty() && vout.empty());
}
uint256 GetHash() const
{
return SerializeHash(*this);
}
bool IsFinal(int nBlockHeight=0, int64 nBlockTime=0) const
{
// Time based nLockTime implemented in 0.1.6
if(!nLockTime)
return true;
if(!nBlockHeight)
nBlockHeight = nBestHeight;
if(!nBlockTime)
nBlockTime = GetAdjustedTime();
if((int64)nLockTime < ((int64)nLockTime < LOCKTIME_THRESHOLD ? (int64)nBlockHeight : nBlockTime))
return true;
BOOST_FOREACH(const CTxIn& txin, vin)
if(!txin.IsFinal())
return false;
return true;
}
bool IsNewerThan(const CTransaction& old) const
{
if (vin.size() != old.vin.size())
return false;
for (unsigned int i = 0; i < vin.size(); i++)
if (vin[i].prevout != old.vin[i].prevout)
return false;
bool fNewer = false;
unsigned int nLowest = std::numeric_limits<unsigned int>::max();
for (unsigned int i = 0; i < vin.size(); i++)
{
if (vin[i].nSequence != old.vin[i].nSequence)
{
if (vin[i].nSequence <= nLowest)
{
fNewer = false;
nLowest = vin[i].nSequence;
}
if (old.vin[i].nSequence < nLowest)
{
fNewer = true;
nLowest = old.vin[i].nSequence;
}
}
}
return fNewer;
}
bool IsCoinBase() const
{
return (vin.size() == 1 && vin[0].prevout.IsNull() && vout.size() >= 1);
}
bool IsCoinStake() const
{
// heat: the coin stake transaction is marked with the first output empty
return (vin.size() > 0 && (!vin[0].prevout.IsNull()) && vout.size() >= 2 && vout[0].IsEmpty());
}
/** Check for standard transaction types
@return True if all outputs (scriptPubKeys) use only standard transaction forms
*/
bool IsStandard() const;
/** Check for standard transaction types
@param[in] mapInputs Map of previous transactions that have outputs we're spending
@return True if all inputs (scriptSigs) use only standard transaction forms
@see CTransaction::FetchInputs
*/
bool AreInputsStandard(const MapPrevTx& mapInputs) const;
/** Count ECDSA signature operations the old-fashioned (pre-0.6) way
@return number of sigops this transaction's outputs will produce when spent
@see CTransaction::FetchInputs
*/
unsigned int GetLegacySigOpCount() const;
/** Count ECDSA signature operations in pay-to-script-hash inputs.
@param[in] mapInputs Map of previous transactions that have outputs we're spending
@return maximum number of sigops required to validate this transaction's inputs
@see CTransaction::FetchInputs
*/
unsigned int GetP2SHSigOpCount(const MapPrevTx& mapInputs) const;
/** Amount of bitcoins spent by this transaction.
@return sum of all outputs (note: does not include fees)
*/
int64 GetValueOut() const
{
int64 nValueOut = 0;
BOOST_FOREACH(const CTxOut& txout, vout)
{
nValueOut += txout.nValue;
if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))
throw std::runtime_error("CTransaction::GetValueOut() : value out of range");
}
return nValueOut;
}
//Returns the pubKet of the first txIn of this tx
bool GetSendersPubKey(CScript &scriptPubKeyRet, bool fOurPubKey=false) const;
//return the index of a burn transaction in vout, -1 if not found
s32int GetBurnOutTxIndex() const
{
//find the burnt transaction
CBurnAddress burnAddress;
u32int i;
for(i = 0; i < vout.size(); i++)
{
CBitcoinAddress address;
if(!ExtractAddress(vout[i].scriptPubKey, address))
continue;
if(address == burnAddress)
break;
}
//if i hit the end for the for loop, it means it found nothing so return -1
return i == vout.size() ? -1 : i;
}
bool IsBurnTx() const
{
return GetBurnOutTxIndex() == -1 ? false : true;
}
//if (return value).IsNull() == true, then some error occured
CTxOut GetBurnOutTx() const
{
s32int burnTxOutIndex = GetBurnOutTxIndex();
if(burnTxOutIndex == -1)
return CTxOut(); //error
return vout[burnTxOutIndex];
}
//return the number of effective burnt coins of a burnTx
int64 EffectiveBurntCoinsLeft(s32int BurnBlkHeight, s32int LastBlkHeight = -1) const
{
if(LastBlkHeight < 0)
LastBlkHeight = nBestHeight;
const CTxOut burnOutTx = GetBurnOutTx();
//This is not a burnTx if burnOutTx is null
if(burnOutTx.IsNull())
return 0;
const s32int between = nPoWBlocksBetween(BurnBlkHeight, LastBlkHeight);
//This burn Tx is still immature
if(between < BURN_MIN_CONFIRMS)
return 0;
return BurnCalcEffectiveCoins(burnOutTx.nValue, between);
}
/** Amount of bitcoins coming in to this transaction
Note that lightweight clients may not know anything besides the hash of previous transactions,
so may not be able to calculate this.
@param[in] mapInputs Map of previous transactions that have outputs we're spending
@return Sum of value of all inputs (scriptSigs)
@see CTransaction::FetchInputs
*/
int64 GetValueIn(const MapPrevTx& mapInputs) const;
static bool AllowFree(double dPriority)
{
// Large (in bytes) low-priority (new, small-coin) transactions
// need a fee.
return dPriority > COIN * 960 / 250; //960 blocks per day
}
int64 GetMinFee(unsigned int nBlockSize=1, bool fAllowFree=false, enum GetMinFee_mode mode=GMF_BLOCK) const
{
// Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);
unsigned int nNewBlockSize = nBlockSize + nBytes;
int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
if (fAllowFree)
{
if (nBlockSize == 1)
{
// Transactions under 10K are free
// (about 4500bc if made of 50bc inputs)
if (nBytes < 10000)
nMinFee = 0;
}
else
{
// Free transaction area
if (nNewBlockSize < 27000)
nMinFee = 0;
}
}
// To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
if (nMinFee < nBaseFee)
{
BOOST_FOREACH(const CTxOut& txout, vout)
if (txout.nValue < CENT)
nMinFee = nBaseFee;
}
// Raise the price as the block approaches full
if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
{
if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
return MAX_MONEY;
nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
}
if (!MoneyRange(nMinFee))
nMinFee = MAX_MONEY;
return nMinFee;
}
bool ReadFromDisk(CDiskTxPos pos, FILE** pfileRet=NULL)
{
CAutoFile filein = CAutoFile(OpenBlockFile(pos.nFile, 0, pfileRet ? "rb+" : "rb"), SER_DISK, CLIENT_VERSION);
if (!filein)
return error("CTransaction::ReadFromDisk() : OpenBlockFile failed");
// Read transaction
if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
return error("CTransaction::ReadFromDisk() : fseek failed");
try {
filein >> *this;
}
catch (std::exception &e) {
return error("%s() : deserialize or I/O error", __PRETTY_FUNCTION__);
}
// Return file pointer
if (pfileRet)
{
if (fseek(filein, pos.nTxPos, SEEK_SET) != 0)
return error("CTransaction::ReadFromDisk() : second fseek failed");
*pfileRet = filein.release();
}
return true;
}
friend bool operator==(const CTransaction& a, const CTransaction& b)
{
return (a.nVersion == b.nVersion &&
a.nTime == b.nTime &&
a.vin == b.vin &&
a.vout == b.vout &&
a.nLockTime == b.nLockTime);
}
friend bool operator!=(const CTransaction& a, const CTransaction& b)
{
return !(a == b);
}
std::string ToStringShort() const
{
std::string str;
str += strprintf("%s %s", GetHash().ToString().c_str(), IsCoinBase()? "base" : (IsCoinStake()? "stake" : "user"));
return str;
}
std::string ToString() const
{
std::string str;
str += IsCoinBase()? "Coinbase" : (IsCoinStake()? "Coinstake" : "CTransaction");
str += strprintf("(hash=%s, nTime=%d, ver=%d, vin.size=%d, vout.size=%d, nLockTime=%d)\n",
GetHash().ToString().substr(0,10).c_str(),
nTime,
nVersion,
vin.size(),
vout.size(),
nLockTime);
for (unsigned int i = 0; i < vin.size(); i++)
str += " " + vin[i].ToString() + "\n";
for (unsigned int i = 0; i < vout.size(); i++)
str += " " + vout[i].ToString() + "\n";
return str;
}
void print() const
{
printf("%s", ToString().c_str());
}
bool ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet);
bool ReadFromDisk(CTxDB& txdb, COutPoint prevout);
bool ReadFromDisk(COutPoint prevout);
bool DisconnectInputs(CTxDB& txdb);
/** Fetch from memory and/or disk. inputsRet keys are transaction hashes.
@param[in] txdb Transaction database
@param[in] mapTestPool List of pending changes to the transaction index database
@param[in] fBlock True if being called to add a new best-block to the chain
@param[in] fMiner True if being called by CreateNewBlock
@param[out] inputsRet Pointers to this transaction's inputs
@param[out] fInvalid returns true if transaction is invalid
@return Returns true if all inputs are in txdb or mapTestPool
*/
bool FetchInputs(CTxDB& txdb, const std::map<uint256, CTxIndex>& mapTestPool,
bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid);
/** Sanity check previous transactions, then, if all checks succeed,
mark them as spent by this transaction.
@param[in] inputs Previous transactions (from FetchInputs)
@param[out] mapTestPool Keeps track of inputs that need to be updated on disk
@param[in] posThisTx Position of this transaction on disk
@param[in] pindexBlock
@param[in] fBlock true if called from ConnectBlock
@param[in] fMiner true if called from CreateNewBlock
@param[in] fStrictPayToScriptHash true if fully validating p2sh transactions
@return Returns true if all checks succeed
*/
bool ConnectInputs(CTxDB& txdb, MapPrevTx inputs,
std::map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash=true);
bool ClientConnectInputs();
bool CheckTransaction() const;
bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true, bool* pfMissingInputs=NULL);
bool GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const; // heat: get transaction coin age
protected:
const CTxOut& GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const;
};
/** A transaction with a merkle branch linking it to the block chain. */
class CMerkleTx : public CTransaction
{
public:
uint256 hashBlock;
std::vector<uint256> vMerkleBranch;
int nIndex;
// memory only
mutable bool fMerkleVerified;
CMerkleTx()
{
Init();
}
CMerkleTx(const CTransaction& txIn) : CTransaction(txIn)
{
Init();
}
void Init()
{
hashBlock = 0;
nIndex = -1;
fMerkleVerified = false;
}
IMPLEMENT_SERIALIZE
(
nSerSize += SerReadWrite(s, *(CTransaction*)this, nType, nVersion, ser_action);
nVersion = this->nVersion;
READWRITE(hashBlock);
READWRITE(vMerkleBranch);
READWRITE(nIndex);
)
int SetMerkleBranch(const CBlock* pblock=NULL);
int GetDepthInMainChain(CBlockIndex* &pindexRet) const;
int GetDepthInMainChain() const { CBlockIndex *pindexRet; return GetDepthInMainChain(pindexRet); }
bool IsInMainChain() const { return GetDepthInMainChain() > 0; }
int GetBlocksToMaturity() const;
bool AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs=true);
bool AcceptToMemoryPool();
bool IsBurnTxMature() const;
s32int GetBurnDepthInMainChain() const;
};
/** A txdb record that contains the disk location of a transaction and the
* locations of transactions that spend its outputs. vSpent is really only
* used as a flag, but having the location is very helpful for debugging.
*/
class CTxIndex
{
public:
CDiskTxPos pos;
std::vector<CDiskTxPos> vSpent;
CTxIndex()
{
SetNull();
}
CTxIndex(const CDiskTxPos& posIn, unsigned int nOutputs)
{
pos = posIn;
vSpent.resize(nOutputs);
}
IMPLEMENT_SERIALIZE
(
if (!(nType & SER_GETHASH))
READWRITE(nVersion);
READWRITE(pos);
READWRITE(vSpent);
)
void SetNull()
{
pos.SetNull();
vSpent.clear();
}
bool IsNull()
{
return pos.IsNull();
}
friend bool operator==(const CTxIndex& a, const CTxIndex& b)
{
return (a.pos == b.pos &&
a.vSpent == b.vSpent);
}
friend bool operator!=(const CTxIndex& a, const CTxIndex& b)
{
return !(a == b);
}
int GetDepthInMainChain() const;
};
/** Nodes collect new transactions into a block, hash them into a hash tree,
* and scan through nonce values to make the block's hash satisfy proof-of-work
* requirements. When they solve the proof-of-work, they broadcast the block
* to everyone and the block is added to the block chain. The first transaction
* in the block is a special one that creates a new coin owned by the creator
* of the block.
*
* Blocks are appended to blk0001.dat files on disk. Their location on disk
* is indexed by CBlockIndex objects in memory.
*/
class CBlock
{
public:
// header
int nVersion;
uint256 hashPrevBlock;
uint256 hashMerkleRoot;
unsigned int nTime;
unsigned int nBits;
unsigned int nNonce;
// Proof-of-Burn switch, indexes, and values
bool fProofOfBurn;
uint256 hashBurnBlock;//in case there was a fork, used to check if the burn coords point to the block intended
uint256 burnHash; //used for DoS detection
s32int burnBlkHeight; //the height the block containing the burn tx is found
s32int burnCTx; //the index in vtx of the burn tx
s32int burnCTxOut; //the index in the burn tx's vout to the burnt coins output
int64 nEffectiveBurnCoins;
u32int nBurnBits;
// network and disk
std::vector<CTransaction> vtx;
// heat: block signature - signed by coin base txout[0]'s owner
std::vector<unsigned char> vchBlockSig;
// memory only
mutable std::vector<uint256> vMerkleTree;
// Denial-of-service detection:
mutable int nDoS;
bool DoS(int nDoSIn, bool fIn) const { nDoS += nDoSIn; return fIn; }
CBlock()
{
SetNull();
}
IMPLEMENT_SERIALIZE
(
//The block header
READWRITE(this->nVersion);
nVersion = this->nVersion;
READWRITE(hashPrevBlock);
READWRITE(hashMerkleRoot);
READWRITE(nTime);
READWRITE(nBits);
READWRITE(nNonce);
//PoB data
READWRITE(fProofOfBurn);
READWRITE(hashBurnBlock);
READWRITE(burnHash);
READWRITE(burnBlkHeight);
READWRITE(burnCTx);
READWRITE(burnCTxOut);
READWRITE(nEffectiveBurnCoins);
READWRITE(nBurnBits);
// ConnectBlock depends on vtx following header to generate CDiskTxPos
if(!(nType & (SER_GETHASH | SER_BLOCKHEADERONLY)))
{
READWRITE(vtx);
READWRITE(vchBlockSig);
}else if(fRead)
{
const_cast<CBlock*>(this)->vtx.clear();
const_cast<CBlock*>(this)->vchBlockSig.clear();
}
)
void SetNull()
{
nVersion = 1;
hashPrevBlock = 0;
hashMerkleRoot = 0;
nTime = 0;
nBits = 0;
nNonce = 0;
//proof-of-burn defaults
fProofOfBurn = false;
hashBurnBlock = 0;
burnHash = 0;
burnBlkHeight = burnCTx = burnCTxOut = -1; //set indexes to negative
nEffectiveBurnCoins = 0;
nBurnBits = 0;
vtx.clear();
vchBlockSig.clear();
vMerkleTree.clear();
nDoS = 0;
}
bool IsNull() const
{
return (!nBits);
}
uint256 GetHash() const
{
return DcryptHash(BEGIN(nVersion), END(nNonce));
}
//PoB
uint256 GetBurnHash(bool fRetIntermediate) const
{
if(!IsProofOfBurn())
return ~uint256(0);
uint256 hashRet;
if(!::GetBurnHash(hashPrevBlock, burnBlkHeight, burnCTx, burnCTxOut, hashRet, fRetIntermediate))
return ~uint256(0);
return hashRet;
}
//check this block's coinbase public key signature with that of the given transaction index
bool BurnCheckPubKeys(s32int blkHeight, s32int txDepth, s32int txOutDepth) const
{
CBlock indexBlock;
CTransaction indexTx;
CTxOut indexTxOut;
if(!GetAllTxClassesByIndex(blkHeight, txDepth, txOutDepth, indexBlock, indexTx, indexTxOut))
return false;
CScript indexTxScript;
if(!indexTx.GetSendersPubKey(indexTxScript))
return false;
//compare the block's coinbase's script with the burn transaction's sender's script
return vtx[0].vout[0].scriptPubKey.comparePubKeySignature(indexTxScript);
}
bool CheckBurnEffectiveCoins(int64 *calcEffCoinsRet = NULL) const;
bool CheckProofOfBurn() const;
//PoB
int64 GetBlockTime() const
{
return (int64)nTime;
}
void UpdateTime(const CBlockIndex* pindexPrev);
// heat: entropy bit for stake modifier if chosen by modifier
unsigned int GetStakeEntropyBit() const
{
uint160 hashSig = Hash160(vchBlockSig);
if(fDebug && GetBoolArg("-printstakemodifier"))
printf("GetStakeEntropyBit: hashSig=%s", hashSig.ToString().c_str());
hashSig >>= 159; // take the first bit of the hash
if(fDebug && GetBoolArg("-printstakemodifier"))
printf(" entropybit=%d\n", hashSig.Get64());
return hashSig.Get64();
}
// heat: three types of block: proof-of-work, proof-of-stake, or proof-of-burn
bool IsProofOfStake() const
{
return (vtx.size() > 1 && vtx[1].IsCoinStake());
}
bool IsProofOfBurn() const
{
return fProofOfBurn && burnBlkHeight >= 0 && burnCTx >= 0 && burnCTxOut >= 0;
}
bool IsProofOfWork() const
{
return !IsProofOfBurn() && !IsProofOfStake();
}
std::pair<COutPoint, unsigned int> GetProofOfStake() const
{
return IsProofOfStake() ? std::make_pair(vtx[1].vin[0].prevout, vtx[1].nTime) :
std::make_pair(COutPoint(), (unsigned int)0);
}
std::pair<uint256, uint256> GetProofOfBurn() const
{
return std::make_pair(burnHash, hashPrevBlock);
}
// heat: get max transaction timestamp
int64 GetMaxTransactionTime() const
{
int64 maxTransactionTime = 0;
BOOST_FOREACH(const CTransaction& tx, vtx)
maxTransactionTime = std::max(maxTransactionTime, (int64)tx.nTime);
return maxTransactionTime;
}
uint256 BuildMerkleTree() const
{
vMerkleTree.clear();
BOOST_FOREACH(const CTransaction& tx, vtx)
vMerkleTree.push_back(tx.GetHash());
int j = 0;
for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
{
for (int i = 0; i < nSize; i += 2)
{
int i2 = std::min(i+1, nSize-1);
vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),
BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));
}
j += nSize;
}
return (vMerkleTree.empty() ? 0 : vMerkleTree.back());
}
std::vector<uint256> GetMerkleBranch(int nIndex) const
{
if (vMerkleTree.empty())
BuildMerkleTree();
std::vector<uint256> vMerkleBranch;
int j = 0;
for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
{
int i = std::min(nIndex^1, nSize-1);
vMerkleBranch.push_back(vMerkleTree[j+i]);
nIndex >>= 1;
j += nSize;
}
return vMerkleBranch;
}
static uint256 CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)
{
if (nIndex == -1)
return 0;
BOOST_FOREACH(const uint256& otherside, vMerkleBranch)
{
if (nIndex & 1)
hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));
else
hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));
nIndex >>= 1;
}
return hash;
}
bool WriteToDisk(unsigned int& nFileRet, unsigned int& nBlockPosRet)
{
// Open history file to append
CAutoFile fileout = CAutoFile(AppendBlockFile(nFileRet), SER_DISK, CLIENT_VERSION);
if(!fileout)
return error("CBlock::WriteToDisk() : AppendBlockFile failed");
// Write index header
unsigned char pchMessageStart[4];
GetMessageStart(pchMessageStart, true);
unsigned int nSize = fileout.GetSerializeSize(*this);
fileout << FLATDATA(pchMessageStart) << nSize;
// Write block
long fileOutPos = ftell(fileout);
if(fileOutPos < 0)
return error("CBlock::WriteToDisk() : ftell failed");
nBlockPosRet = fileOutPos;
fileout << *this;
// Flush stdio buffers and commit to disk before returning
fflush(fileout);
if(!IsInitialBlockDownload() || (nBestHeight+1) % 500 == 0)
{
#ifdef WIN32
_commit(_fileno(fileout));
#else
fsync(fileno(fileout));
#endif
}
return true;
}
bool ReadFromDisk(unsigned int nFile, unsigned int nBlockPos, bool fReadTransactions=true, bool fCheckValidity=true)
{
SetNull();
// Open history file to read
CAutoFile filein = CAutoFile(OpenBlockFile(nFile, nBlockPos, "rb"), SER_DISK, CLIENT_VERSION);
if (!filein)
return error("CBlock::ReadFromDisk() : OpenBlockFile failed");
if(!fReadTransactions)
filein.nType |= SER_BLOCKHEADERONLY;
// Read block
try {
filein >> *this;
}
catch (std::exception &e) {
return error("%s() : deserialize or I/O error", __PRETTY_FUNCTION__);
}
// Check the header
if(fReadTransactions && fCheckValidity && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
return error("CBlock::ReadFromDisk() : errors in block header");
return true;
}
void print(const uint256 &blockHash) const
{
printf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%d, vchBlockSig=%s)\n",
blockHash.ToString().substr(0,20).c_str(),
nVersion,
hashPrevBlock.ToString().substr(0,20).c_str(),
hashMerkleRoot.ToString().substr(0,10).c_str(),
nTime, nBits, nNonce,
vtx.size(),
HexStr(vchBlockSig.begin(), vchBlockSig.end()).c_str());
printf("CBlock General PoB(nBurnBits=%08x nEffectiveBurnCoins=%"PRI64u" (formatted %s))\n",
nBurnBits, nEffectiveBurnCoins, FormatMoney(nEffectiveBurnCoins).c_str());
if(IsProofOfBurn())
printf("CBlock Specific PoB(fProofOfBurn %s, burnBlkHeight %d, burnCTx %d, burnCTxOut %d)\n",
fProofOfBurn ? "true" : "false", burnBlkHeight, burnCTx, burnCTxOut);
for (unsigned int i = 0; i < vtx.size(); i++)
{
printf(" ");
vtx[i].print();
}
printf(" vMerkleTree: ");
for (unsigned int i = 0; i < vMerkleTree.size(); i++)
printf("%s ", vMerkleTree[i].ToString().substr(0,10).c_str());
printf("\n");
}
void print() const
{
print(GetHash());
}
bool DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex);
bool ConnectBlock(CTxDB& txdb, CBlockIndex* pindex);
bool ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions=true, bool fCheckValidity=true);
bool SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew);
bool AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos);
bool CheckBlock() const;
bool AcceptBlock();
bool GetCoinAge(uint64& nCoinAge) const; // heat: calculate total coin age spent in block
bool SignBlock(const CKeyStore& keystore);
bool CheckBlockSignature() const;
private:
bool SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew);
};
/** The block chain is a tree shaped structure starting with the
* genesis block at the root, with each block potentially having multiple
* candidates to be the next block. pprev and pnext link a path through the
* main/longest chain. A blockindex may have multiple pprev pointing back
* to it, but pnext will only point forward to the longest branch, or will
* be null if the block is not part of the longest chain.
*/
class CBlockIndex
{
public:
const uint256* phashBlock;
CBlockIndex* pprev;
CBlockIndex* pnext;
unsigned int nFile;
unsigned int nBlockPos;
CBigNum bnChainTrust; // heat: trust score of block chain
int nHeight;
int64 nMint;
int64 nMoneySupply;
unsigned int nFlags; // heat: block index flags
enum
{
BLOCK_PROOF_OF_STAKE = (1 << 0), // is proof-of-stake block
BLOCK_STAKE_ENTROPY = (1 << 1), // entropy bit for stake modifier
BLOCK_STAKE_MODIFIER = (1 << 2), // regenerated stake modifier
};
uint64 nStakeModifier; // hash modifier for proof-of-stake
unsigned int nStakeModifierChecksum; // checksum of index; in-memeory only
// proof-of-stake specific fields
COutPoint prevoutStake;
unsigned int nStakeTime;
uint256 hashProofOfStake;
// block header
int nVersion;
uint256 hashMerkleRoot;
u32int nTime;
u32int nBits;
u32int nNonce;
// Proof-of-Burn switch, indexes, and values
bool fProofOfBurn;
uint256 burnHash; //the recorded burn hash used for DoS detection
s32int burnBlkHeight;
s32int burnCTx;
s32int burnCTxOut;
int64 nEffectiveBurnCoins;
u32int nBurnBits;
CBlockIndex()
{
phashBlock = NULL;
pprev = NULL;
pnext = NULL;
nFile = 0;
nBlockPos = 0;
nHeight = 0;
bnChainTrust = 0;
nMint = 0;
nMoneySupply = 0;
nFlags = 0;
nStakeModifier = 0;
nStakeModifierChecksum = 0;
hashProofOfStake = 0;
prevoutStake.SetNull();
nStakeTime = 0;
nVersion = 0;
hashMerkleRoot = 0;
nTime = 0;
nBits = 0;
nNonce = 0;
//PoB
fProofOfBurn = false;
burnHash = 0;
burnBlkHeight = -1;
burnCTx = -1;
burnCTxOut = -1;
nEffectiveBurnCoins = 0;
nBurnBits = 0;
}
CBlockIndex(unsigned int nFileIn, unsigned int nBlockPosIn, CBlock &block)
{
phashBlock = NULL;
pprev = NULL;
pnext = NULL;
nFile = nFileIn;
nBlockPos = nBlockPosIn;
nHeight = 0;
bnChainTrust = 0;
nMint = 0;
nMoneySupply = 0;
nFlags = 0;
nStakeModifier = 0;
nStakeModifierChecksum = 0;
hashProofOfStake = 0;
if(block.IsProofOfStake())
{
SetProofOfStake();
prevoutStake = block.vtx[1].vin[0].prevout;
nStakeTime = block.vtx[1].nTime;
}else{
prevoutStake.SetNull();
nStakeTime = 0;
}
nVersion = block.nVersion;
hashMerkleRoot = block.hashMerkleRoot;
nTime = block.nTime;
nBits = block.nBits;
nNonce = block.nNonce;
//PoB
fProofOfBurn = block.fProofOfBurn;
burnHash = block.burnHash;
burnBlkHeight = block.burnBlkHeight;
burnCTx = block.burnCTx;
burnCTxOut = block.burnCTxOut;
nEffectiveBurnCoins = block.nEffectiveBurnCoins;
nBurnBits = block.nBurnBits;
}
CBlock GetBlockHeader() const
{
CBlock block;
block.nVersion = nVersion;
if(pprev)
block.hashPrevBlock = pprev->GetBlockHash();
block.hashMerkleRoot = hashMerkleRoot;
block.nTime = nTime;
block.nBits = nBits;
block.nNonce = nNonce;
return block;
}
uint256 GetBlockHash() const
{
return *phashBlock;
}
int64 GetBlockTime() const
{
return (int64)nTime;
}
CBigNum GetBlockTrust() const;
bool IsInMainChain() const
{
return (pnext || this == pindexBest);
}
bool CheckIndex() const
{
/*printf("%5d ------------------------------- %d %d %d %d %d %d %d\n",
nHeight, IsProofOfWork(), IsProofOfBurn(), IsProofOfStake(),
fProofOfBurn, burnBlkHeight, burnCTx, burnCTxOut);*/
//The burn and stake data will be checked after all block indexes have been loaded
if(IsProofOfWork())
return CheckProofOfWork(GetBlockHash(), nBits);
else if(IsProofOfBurn() || IsProofOfStake())
return true;
else
return false;
}
bool EraseBlockFromDisk()
{
// Open history file
CAutoFile fileout = CAutoFile(OpenBlockFile(nFile, nBlockPos, "rb+"), SER_DISK, CLIENT_VERSION);
if (!fileout)
return false;
// Overwrite with empty null block
CBlock block;
block.SetNull();
fileout << block;
return true;
}
enum { nMedianTimeSpan=11 };
int64 GetMedianTimePast() const
{
int64 pmedian[nMedianTimeSpan];
int64* pbegin = &pmedian[nMedianTimeSpan];
int64* pend = &pmedian[nMedianTimeSpan];
const CBlockIndex* pindex = this;
for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
*(--pbegin) = pindex->GetBlockTime();
std::sort(pbegin, pend);
return pbegin[(pend - pbegin)/2];
}
int64 GetMedianTime() const
{
const CBlockIndex* pindex = this;
for (int i = 0; i < nMedianTimeSpan/2; i++)
{
if (!pindex->pnext)
return GetBlockTime();
pindex = pindex->pnext;
}
return pindex->GetMedianTimePast();
}
bool IsProofOfBurn() const
{
return fProofOfBurn && burnBlkHeight >= 0 && burnCTx >= 0 && burnCTxOut >= 0;
}
bool IsProofOfWork() const
{
return !(nFlags & BLOCK_PROOF_OF_STAKE) && !IsProofOfBurn();
}
bool IsProofOfStake() const
{
return (nFlags & BLOCK_PROOF_OF_STAKE);
}
void SetProofOfStake()
{
nFlags |= BLOCK_PROOF_OF_STAKE;
}
unsigned int GetStakeEntropyBit() const
{
return ((nFlags & BLOCK_STAKE_ENTROPY) >> 1);
}
bool SetStakeEntropyBit(unsigned int nEntropyBit)
{
if (nEntropyBit > 1)
return false;
nFlags |= (nEntropyBit? BLOCK_STAKE_ENTROPY : 0);
return true;
}
bool GeneratedStakeModifier() const
{
return (nFlags & BLOCK_STAKE_MODIFIER);
}
void SetStakeModifier(uint64 nModifier, bool fGeneratedStakeModifier)
{
nStakeModifier = nModifier;
if (fGeneratedStakeModifier)
nFlags |= BLOCK_STAKE_MODIFIER;
}
std::pair<COutPoint, u32int> GetProofOfStake() const
{
return std::make_pair(prevoutStake, nStakeTime);
}
std::pair<uint256, uint256> GetProofOfBurn() const
{
return std::make_pair(burnHash, pprev->GetBlockHash());
}
std::string ToString() const
{
return strprintf("CBlockIndex(nprev=%08x, pnext=%08x, nFile=%d, nBlockPos=%-6d nHeight=%d, nMint=%s, nMoneySupply=%s, nFlags=(%s)(%d)(%s), nStakeModifier=%016"PRI64x", nStakeModifierChecksum=%08x, hashProofOfStake=%s, prevoutStake=(%s), nStakeTime=%d merkle=%s, hashBlock=%s, nBurnBits=%08x nEffectiveBurnCoins=%"PRI64u" (formatted %s))",
pprev, pnext, nFile, nBlockPos, nHeight,
FormatMoney(nMint).c_str(), FormatMoney(nMoneySupply).c_str(),
GeneratedStakeModifier() ? "MOD" : "-", GetStakeEntropyBit(), IsProofOfStake()? "PoS" : "PoW",
nStakeModifier, nStakeModifierChecksum,
hashProofOfStake.ToString().c_str(),
prevoutStake.ToString().c_str(), nStakeTime,
hashMerkleRoot.ToString().substr(0,10).c_str(),
GetBlockHash().ToString().substr(0,20).c_str(),
nBurnBits, nEffectiveBurnCoins, FormatMoney(nEffectiveBurnCoins).c_str());
}
void print() const
{
printf("%s\n", ToString().c_str());
}
};
/** Used to marshal pointers into hashes for db storage. */
class CDiskBlockIndex : public CBlockIndex
{
private:
uint256 blockHash;
public:
uint256 hashPrev;
uint256 hashNext;
CDiskBlockIndex()
{
hashPrev = 0;
hashNext = 0;
blockHash = 0;
}
explicit CDiskBlockIndex(CBlockIndex* pindex) : CBlockIndex(*pindex)
{
hashPrev = (pprev ? pprev->GetBlockHash() : 0);
hashNext = (pnext ? pnext->GetBlockHash() : 0);
}
IMPLEMENT_SERIALIZE
(
if (!(nType & SER_GETHASH))
READWRITE(nVersion);
READWRITE(hashNext);
READWRITE(nFile);
READWRITE(nBlockPos);
READWRITE(nHeight);
READWRITE(nMint);
READWRITE(nMoneySupply);
READWRITE(nFlags);
READWRITE(nStakeModifier);
if(IsProofOfStake())
{
READWRITE(prevoutStake);
READWRITE(nStakeTime);
READWRITE(hashProofOfStake);
}else if(fRead)
{
const_cast<CDiskBlockIndex*>(this)->prevoutStake.SetNull();
const_cast<CDiskBlockIndex*>(this)->nStakeTime = 0;
const_cast<CDiskBlockIndex*>(this)->hashProofOfStake = 0;
}
// block header
READWRITE(this->nVersion);
READWRITE(hashPrev);
READWRITE(hashMerkleRoot);
READWRITE(nTime);
READWRITE(nBits);
READWRITE(nNonce);
// PoB
READWRITE(fProofOfBurn);
READWRITE(burnHash);
READWRITE(burnBlkHeight);
READWRITE(burnCTx);
READWRITE(burnCTxOut);
READWRITE(nEffectiveBurnCoins);
READWRITE(nBurnBits);
//cached hash of the block
READWRITE(blockHash);
)
uint256 GetBlockHash() const
{
if(fUseFastIndex && (nTime < GetAdjustedTime() - 24 * 60 * 60) && blockHash != 0)
return blockHash;
CBlock block;
block.nVersion = nVersion;
block.hashPrevBlock = hashPrev;
block.hashMerkleRoot = hashMerkleRoot;
block.nTime = nTime;
block.nBits = nBits;
block.nNonce = nNonce;
//assign the cached value to be written a value
const_cast<CDiskBlockIndex*>(this)->blockHash = block.GetHash();
return blockHash;
}
std::string ToString() const
{
std::string str = "CDiskBlockIndex(";
str += CBlockIndex::ToString();
str += strprintf("\n hashBlock=%s, hashPrev=%s, hashNext=%s)",
GetBlockHash().ToString().c_str(),
hashPrev.ToString().substr(0,20).c_str(),
hashNext.ToString().substr(0,20).c_str());
return str;
}
void print() const
{
printf("%s\n", ToString().c_str());
}
};
/** Describes a place in the block chain to another node such that if the
* other node doesn't have the same branch, it can find a recent common trunk.
* The further back it is, the further before the fork it may be.
*/
class CBlockLocator
{
protected:
std::vector<uint256> vHave;
public:
CBlockLocator()
{
}
explicit CBlockLocator(const CBlockIndex* pindex)
{
Set(pindex);
}
explicit CBlockLocator(uint256 hashBlock)
{
std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
if (mi != mapBlockIndex.end())
Set((*mi).second);
}
CBlockLocator(const std::vector<uint256>& vHaveIn)
{
vHave = vHaveIn;
}
IMPLEMENT_SERIALIZE
(
if (!(nType & SER_GETHASH))
READWRITE(nVersion);
READWRITE(vHave);
)
void SetNull()
{
vHave.clear();
}
bool IsNull()
{
return vHave.empty();
}
void Set(const CBlockIndex* pindex)
{
vHave.clear();
int nStep = 1;
while (pindex)
{
vHave.push_back(pindex->GetBlockHash());
// Exponentially larger steps back
for (int i = 0; pindex && i < nStep; i++)
pindex = pindex->pprev;
if (vHave.size() > 10)
nStep *= 2;
}
vHave.push_back(hashGenesisBlock);
}
int GetDistanceBack()
{
// Retrace how far back it was in the sender's branch
int nDistance = 0;
int nStep = 1;
BOOST_FOREACH(const uint256& hash, vHave)
{
std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
if (mi != mapBlockIndex.end())
{
CBlockIndex* pindex = (*mi).second;
if (pindex->IsInMainChain())
return nDistance;
}
nDistance += nStep;
if (nDistance > 10)
nStep *= 2;
}
return nDistance;
}
CBlockIndex* GetBlockIndex()
{
// Find the first block the caller has in the main chain
BOOST_FOREACH(const uint256& hash, vHave)
{
std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
if (mi != mapBlockIndex.end())
{
CBlockIndex* pindex = (*mi).second;
if (pindex->IsInMainChain())
return pindex;
}
}
return pindexGenesisBlock;
}
uint256 GetBlockHash()
{
// Find the first block the caller has in the main chain
BOOST_FOREACH(const uint256& hash, vHave)
{
std::map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hash);
if (mi != mapBlockIndex.end())
{
CBlockIndex* pindex = (*mi).second;
if (pindex->IsInMainChain())
return hash;
}
}
return hashGenesisBlock;
}
int GetHeight()
{
CBlockIndex* pindex = GetBlockIndex();
if (!pindex)
return 0;
return pindex->nHeight;
}
};
/** Alerts are for notifying old versions if they become too obsolete and
* need to upgrade. The message is displayed in the status bar.
* Alert messages are broadcast as a vector of signed data. Unserializing may
* not read the entire buffer if the alert is for a newer version, but older
* versions can still relay the original data.
*/
class CUnsignedAlert
{
public:
int nVersion;
int64 nRelayUntil; // when newer nodes stop relaying to newer nodes
int64 nExpiration;
int nID;
int nCancel;
std::set<int> setCancel;
int nMinVer; // lowest version inclusive
int nMaxVer; // highest version inclusive
std::set<std::string> setSubVer; // empty matches all
int nPriority;
// Actions
std::string strComment;
std::string strStatusBar;
std::string strReserved;
IMPLEMENT_SERIALIZE
(
READWRITE(this->nVersion);
nVersion = this->nVersion;
READWRITE(nRelayUntil);
READWRITE(nExpiration);
READWRITE(nID);
READWRITE(nCancel);
READWRITE(setCancel);
READWRITE(nMinVer);
READWRITE(nMaxVer);
READWRITE(setSubVer);
READWRITE(nPriority);
READWRITE(strComment);
READWRITE(strStatusBar);
READWRITE(strReserved);
)
void SetNull()
{
nVersion = 1;
nRelayUntil = 0;
nExpiration = 0;
nID = 0;
nCancel = 0;
setCancel.clear();
nMinVer = 0;
nMaxVer = 0;
setSubVer.clear();
nPriority = 0;
strComment.clear();
strStatusBar.clear();
strReserved.clear();
}
std::string ToString() const
{
std::string strSetCancel;
BOOST_FOREACH(int n, setCancel)
strSetCancel += strprintf("%d ", n);
std::string strSetSubVer;
BOOST_FOREACH(std::string str, setSubVer)
strSetSubVer += "\"" + str + "\" ";
return strprintf(
"CAlert(\n"
" nVersion = %d\n"
" nRelayUntil = %"PRI64d"\n"
" nExpiration = %"PRI64d"\n"
" nID = %d\n"
" nCancel = %d\n"
" setCancel = %s\n"
" nMinVer = %d\n"
" nMaxVer = %d\n"
" setSubVer = %s\n"
" nPriority = %d\n"
" strComment = \"%s\"\n"
" strStatusBar = \"%s\"\n"
")\n",
nVersion,
nRelayUntil,
nExpiration,
nID,
nCancel,
strSetCancel.c_str(),
nMinVer,
nMaxVer,
strSetSubVer.c_str(),
nPriority,
strComment.c_str(),
strStatusBar.c_str());
}
void print() const
{
printf("%s", ToString().c_str());
}
};
/** An alert is a combination of a serialized CUnsignedAlert and a signature. */
class CAlert : public CUnsignedAlert
{
public:
std::vector<unsigned char> vchMsg;
std::vector<unsigned char> vchSig;
CAlert()
{
SetNull();
}
IMPLEMENT_SERIALIZE
(
READWRITE(vchMsg);
READWRITE(vchSig);
)
void SetNull()
{
CUnsignedAlert::SetNull();
vchMsg.clear();
vchSig.clear();
}
bool IsNull() const
{
return (nExpiration == 0);
}
uint256 GetHash() const
{
return SerializeHash(*this);
}
bool IsInEffect() const
{
return (GetAdjustedTime() < nExpiration);
}
bool Cancels(const CAlert& alert) const
{
if (!IsInEffect())
return false; // this was a no-op before 31403
return (alert.nID <= nCancel || setCancel.count(alert.nID));
}
bool AppliesTo(int nVersion, std::string strSubVerIn) const
{
// TODO: rework for client-version-embedded-in-strSubVer ?
return (IsInEffect() &&
nMinVer <= nVersion && nVersion <= nMaxVer &&
(setSubVer.empty() || setSubVer.count(strSubVerIn)));
}
bool AppliesToMe() const
{
return AppliesTo(PROTOCOL_VERSION, FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, std::vector<std::string>()));
}
bool RelayTo(CNode* pnode) const
{
if (!IsInEffect())
return false;
// returns true if wasn't already contained in the set
if (pnode->setKnown.insert(GetHash()).second)
{
if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||
AppliesToMe() ||
GetAdjustedTime() < nRelayUntil)
{
pnode->PushMessage("alert", *this);
return true;
}
}
return false;
}
bool CheckSignature()
{
CKey key;
if (!key.SetPubKey(ParseHex("04a0a849dd49b113d3179a332dd77715c43be4d0076e2f19e66de23dd707e56630f792f298dfd209bf042bb3561f4af6983f3d81e439737ab0bf7f898fecd21aab")))
return error("CAlert::CheckSignature() : SetPubKey failed");
if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))
return error("CAlert::CheckSignature() : verify signature failed");
// Now unserialize the data
CDataStream sMsg(vchMsg, SER_NETWORK, PROTOCOL_VERSION);
sMsg >> *(CUnsignedAlert*)this;
return true;
}
bool ProcessAlert();
};
class CTxMemPool
{
public:
mutable CCriticalSection cs;
std::map<uint256, CTransaction> mapTx;
std::map<COutPoint, CInPoint> mapNextTx;
bool accept(CTxDB& txdb, CTransaction &tx,
bool fCheckInputs, bool* pfMissingInputs);
bool addUnchecked(CTransaction &tx);
bool remove(CTransaction &tx);
unsigned long size()
{
LOCK(cs);
return mapTx.size();
}
bool exists(uint256 hash)
{
return (mapTx.count(hash) != 0);
}
CTransaction& lookup(uint256 hash)
{
return mapTx[hash];
}
};
extern CTxMemPool mempool;
#endif
|
smith7800/heat
|
src/main.h
|
C
|
mit
| 60,308
|
// Copyright (c) Microsoft Corporation.
// All rights reserved.
//
// This code is licensed under the MIT License.
//
// 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.
#import "ADALAuthenticationError.h"
#import "ADALErrorCodes.h"
#import "ADALTokenCacheItem.h"
#define AUTH_ERROR(_CODE, _DETAILS, _CORRELATION) \
ADALAuthenticationError* adError = \
[ADALAuthenticationError errorFromAuthenticationError:_CODE \
protocolCode:nil \
errorDetails:_DETAILS \
correlationId:_CORRELATION]; \
if (error) { *error = adError; }
#define AUTH_ERROR_RETURN_IF_NIL(_VAL, _CODE, _DETAILS, _CORRELATION) \
if (_VAL == nil) { \
AUTH_ERROR(_CODE, _DETAILS, _CORRELATION); \
return nil; \
}
#define ARG_RETURN_IF_NIL(_ARG, _CORRELATION) \
if (_ARG == nil) { \
AUTH_ERROR(AD_ERROR_DEVELOPER_INVALID_ARGUMENT, @#_ARG " should not be nil.", _CORRELATION); \
return nil; \
}
#define AUTH_ERROR_UNDERLYING(_CODE, _DETAILS, _UNDERLYING, _CORRELATION) \
ADALAuthenticationError* adError = \
[ADALAuthenticationError errorFromAuthenticationError:_CODE \
protocolCode:nil \
errorDetails:_DETAILS \
userInfo:@{ NSUnderlyingErrorKey : _UNDERLYING } \
correlationId:_CORRELATION]; \
if (error) { *error = adError; }
@interface ADALAuthenticationError (Internal)
/*! Generates an error for invalid method argument. */
+ (ADALAuthenticationError*)errorFromArgument:(id)argument
argumentName:(NSString *)argumentName
correlationId:(NSUUID *)correlationId;
/*! Generates an error object from an internally encountered error condition. Preserves the error
code and domain of the original error and adds the custom details in the "errorDetails" property. */
+ (ADALAuthenticationError*)errorFromNSError:(NSError *)error
errorDetails:(NSString *)errorDetails
correlationId:(NSUUID *)correlationId;
+ (ADALAuthenticationError *)errorWithDomain:(NSString *)domain
code:(NSInteger)code
protocolErrorCode:(NSString *)protocolCode
errorDetails:(NSString *)errorDetails
correlationId:(NSUUID *)correlationId;
+ (ADALAuthenticationError *)errorWithDomain:(NSString *)domain
code:(NSInteger)code
protocolErrorCode:(NSString *)protocolCode
errorDetails:(NSString *)errorDetails
correlationId:(NSUUID *)correlationId
userInfo:(NSDictionary *)userInfo;
/*! Genearates an error from the code and details of an authentication error */
+ (ADALAuthenticationError*)errorFromAuthenticationError:(NSInteger)code
protocolCode:(NSString *)protocolCode
errorDetails:(NSString *)errorDetails
correlationId:(NSUUID *)correlationId;
+ (ADALAuthenticationError*)errorFromAuthenticationError:(NSInteger)code
protocolCode:(NSString *)protocolCode
errorDetails:(NSString *)errorDetails
userInfo:(NSDictionary *)userInfo
correlationId:(NSUUID *)correlationId;
+ (ADALAuthenticationError*)errorQuietWithAuthenticationError:(NSInteger)code
protocolCode:(NSString*)protocolCode
errorDetails:(NSString*)errorDetails;
/*! Generates an error when an unexpected internal library conditions occurs. */
+ (ADALAuthenticationError*)unexpectedInternalError:(NSString *)errorDetails
correlationId:(NSUUID *)correlationId;
+ (ADALAuthenticationError*)invalidArgumentError:(NSString *)details
correlationId:(NSUUID *)correlationId;
/*! Generates an error from cancel operations. E.g. the user pressed "Cancel" button
on the authorization UI page. */
+ (ADALAuthenticationError*)errorFromCancellation:(NSUUID *)correlationId;
/*! Generates an error for the case that server redirects authentication process to a non-https url */
+ (ADALAuthenticationError*)errorFromNonHttpsRedirect:(NSUUID *)correlationId;
+ (ADALAuthenticationError *)keychainErrorFromOperation:(NSString *)operation
status:(OSStatus)status
correlationId:(NSUUID *)correlationId;
+ (ADALAuthenticationError *)errorFromHTTPErrorCode:(NSInteger)code
body:(NSString *)body
headers:(NSDictionary *)headers
correlationId:(NSUUID *)correlationId;
+ (ADALAuthenticationError *)OAuthServerError:(NSString *)protocolCode
description:(NSString *)description
code:(NSInteger)code
correlationId:(NSUUID *)correlationId;
+ (ADALAuthenticationError *)OAuthServerError:(NSString *)protocolCode
description:(NSString *)description
code:(NSInteger)code
correlationId:(NSUUID *)correlationId
userInfo:(NSDictionary *)userInfo;
+ (ADALAuthenticationError *)errorFromExistingError:(ADALAuthenticationError *)error
correlationID:(NSUUID *)correlationId
additionalUserInfo:(NSDictionary *)userInfo;
#if AD_BROKER
/*! Adds a alternate token to an existing ADAuthentication error's userInfo dictionary */
+ (ADALAuthenticationError *)errorFromExistingProtectionPolicyRequiredError:(ADALAuthenticationError *)error
correlationID:(NSUUID *)correlationId
token:(ADALTokenCacheItem*)token;
#endif
/*
Returns string representation of ADALErrorCode or error code number as string, if mapping for that error is missing
*/
+ (NSString*)stringForADALErrorCode:(ADALErrorCode)code;
@end
|
AzureAD/azure-activedirectory-library-for-objc
|
ADAL/src/ADALAuthenticationError+Internal.h
|
C
|
mit
| 7,777
|
typeSearchIndex = [{"p":"main","l":"CheckingSSN"}]
|
tliang1/Java-Practice
|
Practice/Intro-To-Java-8th-Ed-Daniel-Y.-Liang/Chapter-9/Chapter09P01/doc/type-search-index.js
|
JavaScript
|
mit
| 50
|
use hlist::*;
pub trait TmPre<A> {
type Out;
}
impl<A> TmPre<A> for HN {
type Out = A;
}
impl<
HTm,
HTy,
TTm,
TTy,
> TmPre<HC<HTy, TTy>> for HC<HTm, TTm> where
TTm: TmPre<TTy>
{
type Out = <TTm as TmPre<TTy>>::Out;
}
pub trait TmExt<A> {
type Out; // FIXME: + Prepend<Self::Ext, Out = Self>;
type Ext;
}
impl<M> TmExt<HN> for M {
type Out = HN;
type Ext = M;
}
impl<
HTm,
HTy,
RecExt,
RecOut,
TTm,
TTy,
> TmExt<HC<HTy, TTy>> for HC<HTm, TTm> where
TTm: TmExt<TTy, Out = RecOut, Ext = RecExt>,
{
type Out = HC<HTm, RecOut>;
type Ext = RecExt;
}
#[cfg(test)]
mod test {
use hlist::*;
use ty::*;
#[test]
fn tm_ext() {
let x0 = Witness::<<HC<TT, HC<FF, HN>> as TmExt<HC<(), HN>>>::Out>;
let x1 = Witness::<HC<TT, HN>>;
x0 == x1;
let x2 = Witness::<<HC<TT, HC<FF, HN>> as TmExt<HC<(), HN>>>::Ext>;
let x3 = Witness::<HC<FF, HN>>;
x2 == x3;
}
}
|
epsilonz/shoggoth.rs
|
src/ty/hlist.rs
|
Rust
|
mit
| 1,005
|
var React = require("react");
var HttpServices = require("../services/HttpServices");
var update = require("react-addons-update");
module.exports = React.createClass({
getInitialState: function() {
return {
contentEditable: false
}
},
onDoubleClick: function() {
if (this.props.editable && !this.state.contentEditable) {
this.setState({
contentEditable: true
}, function() {
setTimeout(function() {
this.refs.contentEditable.focus();
}.bind(this), 500);
}.bind(this));
}
},
setHtml: function() {
return {__html: this.props.content};
},
save: function() {
this.setState({
contentEditable: false
});
var newValue = this.refs.editableField.innerHTML;
var updatedApi = update(this.props.api, {$apply: function(api) {
api[this.props.path][this.props.fileName] = newValue;
return api;
}.bind(this)});
HttpServices.post("/cheesetoastie/" + this.props.path, {field: this.props.fieldName, value: newValue}, function(err, res) {
if (err) {
console.error(err);
}
});
this.props.onApiUpdate(updatedApi);
},
render: function() {
var classes = "";
var buttons = null;
if (this.props.className) {
classes += this.props.className;
}
if (this.state.contentEditable) {
classes += " content-editable";
buttons = (
<div className="content-editable-buttons">
<div className="content-editable-button-save" onClick={this.save}>Save</div>
</div>
)
}
return (
<div className={classes} onDoubleClick={this.onDoubleClick}>
<div contentEditable={this.state.contentEditable} ref="editableField" dangerouslySetInnerHTML={this.setHtml()}></div>
{buttons}
</div>
)
}
});
|
chenjic215/search-doctor
|
node_modules/cheese-toastie/docs/react-components/docs/ContentEditable.js
|
JavaScript
|
mit
| 1,833
|
<?php echo Asset::css('product.css'); ?>
<div class="pay-panel">
<?php if(isset($status) && $status):?>
<div class="panel-head">
<h2 class="title-chg"><span class="icon icon-succeed"></span>恭喜您, 支付成功！</h2>
<div style="padding: 40px;text-align: center">
商品信息请在<a style="text-decoration: none" href="<?php echo Uri::create('u/orders'); ?>">【乐淘记录】</a>查看
</div>
</div>
<?php else: ?>
<div class="panel-head">
<h2 class="title-chg"><span class="icon icon-error"></span>抱歉, 支付失败！</h2>
<div style="padding: 40px;text-align: center">
失败原因：<?php echo $reason;?>
</div>
</div>
<?php endif;?>
<a class="btn btn-red btn-atc" href="<?php echo Uri::base(); ?>">继续乐淘</a>
</div>
|
lextel/evolution
|
fuel/app/views/payment/return.php
|
PHP
|
mit
| 1,011
|
// This code contains NVIDIA Confidential Information and is disclosed to you
// under a form of NVIDIA software license agreement provided separately to you.
//
// Notice
// NVIDIA Corporation and its licensors retain all intellectual property and
// proprietary rights in and to this software and related documentation and
// any modifications thereto. Any use, reproduction, disclosure, or
// distribution of this software and related documentation without an express
// license agreement from NVIDIA Corporation is strictly prohibited.
//
// ALL NVIDIA DESIGN SPECIFICATIONS, CODE ARE PROVIDED "AS IS.". NVIDIA MAKES
// NO WARRANTIES, EXPRESSED, IMPLIED, STATUTORY, OR OTHERWISE WITH RESPECT TO
// THE MATERIALS, AND EXPRESSLY DISCLAIMS ALL IMPLIED WARRANTIES OF NONINFRINGEMENT,
// MERCHANTABILITY, AND FITNESS FOR A PARTICULAR PURPOSE.
//
// Information and code furnished is believed to be accurate and reliable.
// However, NVIDIA Corporation assumes no responsibility for the consequences of use of such
// information or for any infringement of patents or other rights of third parties that may
// result from its use. No license is granted by implication or otherwise under any patent
// or patent rights of NVIDIA Corporation. Details are subject to change without notice.
// This code supersedes and replaces all information previously supplied.
// NVIDIA Corporation products are not authorized for use as critical
// components in life support devices or systems without express written approval of
// NVIDIA Corporation.
//
// Copyright (c) 2008-2017 NVIDIA Corporation. All rights reserved.
// Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved.
// Copyright (c) 2001-2004 NovodeX AG. All rights reserved.
#ifndef PX_PVD_DELAY_LOAD_HOOK
#define PX_PVD_DELAY_LOAD_HOOK
#include "../../foundation/PxPreprocessor.h"
#include "../../foundation/windows/PxWindowsFoundationDelayLoadHook.h"
//#include "../foundation/PxWindowsFoundationDelayLoadHook.h"
#include "../PxPvd.h"
/** \addtogroup pvd
@{
*/
#if !PX_DOXYGEN
namespace physx
{
#endif
/**
\brief Sets delay load hook instance for Foundation dll.
\param[in] hook Delay load hook.
@see PxFoundationDelayLoadHook
*/
PX_C_EXPORT PX_PVDSDK_API void PX_CALL_CONV PxPvdSetFoundationDelayLoadHook(const physx::PxFoundationDelayLoadHook* hook);
#if !PX_DOXYGEN
} // namespace physx
#endif
/** @} */
#endif
|
PatatesIDracs/3DGameEngine
|
3DEngine/Source/PhysX/Include/pvd/windows/PxWindowsPvdDelayLoadHook.h
|
C
|
mit
| 2,397
|
using System;
using System.Collections.Generic;
using System.Linq;
using System.Web;
namespace CloudCompare.Web.FluentSecurity.Policy
{
internal class LazySecurityPolicy<TSecurityPolicy> : ILazySecurityPolicy where TSecurityPolicy : ISecurityPolicy
{
public Type PolicyType
{
get { return typeof(TSecurityPolicy); }
}
public ISecurityPolicy Load()
{
var externalServiceLocator = SecurityConfiguration.Current.ExternalServiceLocator;
if (externalServiceLocator != null)
{
var securityPolicy = externalServiceLocator.Resolve(PolicyType) as ISecurityPolicy;
if (securityPolicy != null) return securityPolicy;
}
return PolicyType.HasEmptyConstructor()
? (ISecurityPolicy)Activator.CreateInstance<TSecurityPolicy>()
: null;
}
public PolicyResult Enforce(ISecurityContext context)
{
var securityPolicy = Load();
if (securityPolicy == null)
throw new InvalidOperationException(
String.Format("A policy of type {0} could not be loaded! Make sure the policy has an empty constructor or is registered in your IoC-container.", PolicyType.FullName)
);
return securityPolicy.Enforce(context);
}
}
}
|
protechdm/CloudCompare
|
CloudCompare.Web/FluentSecurity/Policy/LazySecurityPolicy.cs
|
C#
|
mit
| 1,444
|
# resume
个人简历
|
TiFF-Y/TIFF-Y.github.io
|
README.md
|
Markdown
|
mit
| 22
|
#!/bin/bash
#Usage ./run_testsolver.sh [problem] [nsims] [reps] [verbosity] [min_time] [max_time] [other_flags] [algorithm]
problem=$1
nsims=$2
reps=$3
verbosity=$4
min_time=$5
max_time=$6
other_flags=$7
algorithm=$8
echo "../testsolver.out $problem --heuristic=hmin --precompute-h --n=$nsims --reps=$reps --v=$verbosity --algorithm=$algorithm --min_time=$min_time --max_time=$max_time $other_flags"
../testsolver.out $problem \
--heuristic=hmin --precompute-h \
--n=$nsims --reps=$reps --v=$verbosity \
--algorithm=$algorithm \
--min_time=$min_time --max_time=$max_time $other_flags
|
luisenp/mdp-lib
|
scripts/run_testsolver.sh
|
Shell
|
mit
| 594
|
---
layout: page
title: Costa Family Reunion
date: 2016-05-24
author: Philip Vincent
tags: weekly links, java
status: published
summary: Nullam interdum porta molestie. Fusce at maximus diam. Quisque eu.
banner: images/banner/leisure-02.jpg
booking:
startDate: 04/04/2019
endDate: 04/06/2019
ctyhocn: MMIOKHX
groupCode: CFR
published: true
---
Sed augue arcu, aliquet imperdiet tristique quis, tincidunt vitae elit. In malesuada enim ex, vel sollicitudin neque convallis non. Ut odio lectus, fringilla eu tortor hendrerit, efficitur porta orci. Duis ornare sollicitudin elit in tincidunt. Aenean tincidunt semper urna in congue. Morbi elementum augue velit. Nulla tincidunt nunc non arcu gravida, nec cursus nunc feugiat. Maecenas tempor purus eleifend ullamcorper commodo. Curabitur vel felis enim.
* Ut eget ipsum ut elit dignissim posuere
* Cras sodales ipsum eu massa luctus tristique
* Duis dignissim dui quis purus molestie iaculis
* Etiam porttitor felis ut orci consequat, ac laoreet dolor aliquet.
Donec felis purus, malesuada volutpat nisi eu, scelerisque ullamcorper dolor. Vestibulum a suscipit augue. Nulla in dolor pharetra, vestibulum diam id, rutrum lacus. Donec vitae libero rhoncus, rutrum lacus quis, tempus elit. Sed varius dolor mi, malesuada lobortis urna ornare et. Quisque malesuada nibh et euismod pellentesque. Curabitur eu mi vel turpis lobortis dictum. Nulla lobortis porttitor mauris mattis semper. Proin sit amet elit ullamcorper, volutpat leo sit amet, vestibulum turpis. Sed rhoncus aliquam ex, a blandit mi venenatis vel. Nunc erat urna, viverra nec ex sit amet, tincidunt lobortis libero. Vestibulum placerat libero diam, eu luctus sapien tincidunt cursus.
Sed feugiat lorem et enim rhoncus sagittis. Quisque faucibus odio at elit pellentesque eleifend. Suspendisse nisl orci, porttitor vitae ante in, lacinia vehicula turpis. Praesent a iaculis dolor, ac lobortis eros. Mauris viverra lorem et congue ultricies. Suspendisse sit amet eleifend eros, vitae maximus ipsum. Sed et risus in lacus dapibus cursus id in est. Donec fermentum turpis a facilisis hendrerit. Donec non est commodo, sodales dolor at, tincidunt sem. Pellentesque vestibulum scelerisque nunc ut pretium. Integer porta, turpis non hendrerit fringilla, diam ante semper leo, malesuada mollis nibh libero vitae leo.
|
KlishGroup/prose-pogs
|
pogs/M/MMIOKHX/CFR/index.md
|
Markdown
|
mit
| 2,326
|
Locations = new Mongo.Collection("locations");
Locations.allow({
insert: function(userId) {
return !!userId;
}
});
Meteor.methods({
addLocation: function(placeId) {
Locations.insert({place_id: placeId});
}
});
|
andriyl/raplanet
|
lib/collections/locations.js
|
JavaScript
|
mit
| 243
|
Rails Bootstrap
================
[](https://heroku.com/deploy)
This application was generated with the [rails_apps_composer](https://github.com/RailsApps/rails_apps_composer) gem
provided by the [RailsApps Project](http://railsapps.github.io/).
Rails Composer is open source and supported by subscribers. Please join RailsApps to support development of Rails Composer.
Problems? Issues?
-----------
Need help? Ask on Stack Overflow with the tag 'railsapps.'
Your application contains diagnostics in the README file. Please provide a copy of the README file when reporting any issues.
If the application doesn't work as expected, please [report an issue](https://github.com/RailsApps/rails_apps_composer/issues)
and include the diagnostics.
Ruby on Rails
-------------
This application requires:
- Ruby 2.1.6
- Rails 4.2.4
Learn more about [Installing Rails](http://railsapps.github.io/installing-rails.html).
Getting Started
---------------
Documentation and Support
-------------------------
Issues
-------------
Similar Projects
----------------
Contributing
------------
Credits
-------
License
-------
=======
# UberCodingChalEmail
An Email Service with a submission form sending an email from one address to another. There will be a backup provider if the main email service fails.
```javascript
Enter your email:
Enter receipient\'s email:
```
|
1UnboundedSentience/UberCodingChalEmail
|
README.md
|
Markdown
|
mit
| 1,438
|
import DS from 'ember-data';
/* global moment */
var Pairing = DS.Model.extend({
startDate: DS.attr('date'),
endDate: DS.attr('date'),
users: DS.hasMany('user', {async: true}),
logs: DS.hasMany('log', {async: true}),
isEnded: function(){
return +this.get('endDate') <= +moment().toDate();
}.property('endDate'),
pairingDates: function(){
return moment( this.get('startDate') ).format('MMMM DD, YYYY') + ' - ' +
moment( this.get('endDate') ).format('MMMM DD, YYYY');
}.property('startDate', 'endDate'),
buddies: function(){
if (this.get('users.isFulfilled') && this.get('users.length') > 0){
var length = this.get('users.length') - 1;
return this.get('users').map(function(user, i) {
return {
name: user.get('name'),
id: user.get('id')
};
});
}
}.property('users.length')
});
export default Pairing;
|
alicht/buddybuddy
|
ember/app/models/pairing.js
|
JavaScript
|
mit
| 906
|
/*
* The MIT License (MIT)
*
* Copyright (c) Gabriel Harris-Rouquette
*
* 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.
*/
package com.afterkraft.kraftrpg.api.effect.property;
import com.afterkraft.kraftrpg.api.effect.EffectProperty;
/**
* A utility interface to deal with effects that implement {@link java.util.concurrent.Delayed} It
* should be noted that the API provides the following to implement Timed: <ul> <li>{@link
* ExpiringProperty}</li> <li>{@link PeriodicProperty}</li> </ul> and from the default
* implementations: <ul> <li>{@link ExpiringProperty}</li> <li>{@link PeriodicProperty}</li> </ul>
*
* @param <T> The type of {@link TimedProperty}
*/
public interface TimedProperty<T extends TimedProperty<T>> extends EffectProperty<T> {
}
|
AfterKraft/KraftRPG-API
|
src/main/java/com/afterkraft/kraftrpg/api/effect/property/TimedProperty.java
|
Java
|
mit
| 1,789
|
/**
* React Static Boilerplate
* https://github.com/kriasoft/react-static-boilerplate
*
* Copyright © 2015-present Kriasoft, LLC. All rights reserved.
*
* This source code is licensed under the MIT license found in the
* LICENSE.txt file in the root directory of this source tree.
*/
import React from 'react';
import Layout from '../../components/Layout';
// import DataPicker from '../../components/DataPicker/DataPicker.js';
import DatePicker from 'material-ui/DatePicker';
import s from './styles.css';
import { title, html } from './index.md';
class AboutPage extends React.Component {
componentDidMount() {
document.title = title;
}
render() {
return (
<Layout className={s.content}>
<h1>{title}</h1>
<div
// eslint-disable-next-line react/no-danger
dangerouslySetInnerHTML={{ __html: html }}
/>
</Layout>
);
}
}
export default AboutPage;
|
SergeyGuns/test-site
|
src/about/about.js
|
JavaScript
|
mit
| 937
|
var crypto = require('crypto');
/**
* 加密算法（md5 → 加盐 → md5）
* 依赖: crypto
* @param string 源字符串
* @param salt 盐
* @returns {string}
*/
function communism(string, salt) {
var str = md5Hash(string);
str = salt + str;
str = md5Hash(str);
return str;
}
/**
* md5 hash散列
* @param string 源字符串
* @return string 32位小写16进制表示的md5散列的字符串
*/
function md5Hash(string) {
var md5 = crypto.createHash('md5');
md5.update(string);
var str = md5.digest('hex');
return str;
}
/**
* 生成盐
* @param length 盐的长度,推荐使用32位
* @returns {string}
*/
function setSalt(length) {
var salt = '';
var chars = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'];
var length = length;
if (length > 256) {
length = 256;
}
for (var i = 0; i < length; i++) {
salt += chars[Math.floor(Math.random() * chars.length)];
}
return salt;
}
module.exports = {
communism: communism,
md5Hash: md5Hash,
setSalt: setSalt
};
|
mecoepcoo/innocent-blog
|
lib/hash.js
|
JavaScript
|
mit
| 1,286
|
<?php
/*
* @author M2E Pro Developers Team
* @copyright M2E LTD
* @license Commercial use is forbidden
*/
class Ess_M2ePro_Block_Adminhtml_Amazon_Template_Description_Category_Chooser_Tabs_Recent
extends Mage_Adminhtml_Block_Widget
{
protected $_selectedCategory = array();
//########################################
public function __construct()
{
parent::__construct();
// Initialization block
// ---------------------------------------
$this->setId('amazonTemplateDescriptionCategoryChooserRecent');
// ---------------------------------------
// Set template
// ---------------------------------------
$this->setTemplate('M2ePro/amazon/template/description/category/chooser/tabs/recent.phtml');
// ---------------------------------------
}
//########################################
public function getCategories()
{
return Mage::helper('M2ePro/Component_Amazon_Category')->getRecent(
$this->getRequest()->getPost('marketplace_id'),
array('product_data_nick' => $this->getRequest()->getPost('product_data_nick'),
'browsenode_id' => $this->getRequest()->getPost('browsenode_id'),
'path' => $this->getRequest()->getPost('category_path'))
);
}
//########################################
}
|
portchris/NaturalRemedyCompany
|
src/app/code/community/Ess/M2ePro/Block/Adminhtml/Amazon/Template/Description/Category/Chooser/Tabs/Recent.php
|
PHP
|
mit
| 1,419
|
###############################################################################
# Makefile for the project cdcio-2313
###############################################################################
## General Flags
PROJECT = cdcio-2313
MCU = attiny2313
TARGET = cdcio-2313.elf
CC = avr-gcc
## Options common to compile, link and assembly rules
COMMON = -mmcu=$(MCU)
## Compile options common for all C compilation units.
CFLAGS = $(COMMON)
CFLAGS += -Wall -gdwarf-2 -std=gnu99 -DF_CPU=12000000UL -Os -funsigned-char -funsigned-bitfields -fpack-struct -fshort-enums
CFLAGS += -MD -MP -MT $(*F).o -MF dep/$(@F).d
## Assembly specific flags
ASMFLAGS = $(COMMON)
ASMFLAGS += $(CFLAGS)
ASMFLAGS += -x assembler-with-cpp -Wa,-gdwarf2
## Linker flags
LDFLAGS = $(COMMON)
LDFLAGS +=
## Intel Hex file production flags
HEX_FLASH_FLAGS = -R .eeprom -R .fuse -R .lock -R .signature
HEX_EEPROM_FLAGS = -j .eeprom
HEX_EEPROM_FLAGS += --set-section-flags=.eeprom="alloc,load"
HEX_EEPROM_FLAGS += --change-section-lma .eeprom=0 --no-change-warnings
## Include Directories
INCLUDES = -I".." -I"../../usbdrv"
## Objects that must be built in order to link
OBJECTS = main.o usbdrvasm.o oddebug.o usbdrv.o
## Objects explicitly added by the user
LINKONLYOBJECTS =
## Build
all: $(TARGET) cdcio-2313.hex cdcio-2313.eep cdcio-2313.lss size
## Compile
usbdrvasm.o: ../../usbdrv/usbdrvasm.S
$(CC) $(INCLUDES) $(ASMFLAGS) -c $<
main.o: ../main.c
$(CC) $(INCLUDES) $(CFLAGS) -c $<
oddebug.o: ../../usbdrv/oddebug.c
$(CC) $(INCLUDES) $(CFLAGS) -c $<
usbdrv.o: ../../usbdrv/usbdrv.c
$(CC) $(INCLUDES) $(CFLAGS) -c $<
##Link
$(TARGET): $(OBJECTS)
$(CC) $(LDFLAGS) $(OBJECTS) $(LINKONLYOBJECTS) $(LIBDIRS) $(LIBS) -o $(TARGET)
%.hex: $(TARGET)
avr-objcopy -O ihex $(HEX_FLASH_FLAGS) $< $@
%.eep: $(TARGET)
-avr-objcopy $(HEX_EEPROM_FLAGS) -O ihex $< $@ || exit 0
%.lss: $(TARGET)
avr-objdump -h -S $< > $@
size: ${TARGET}
@echo
@avr-size -C --mcu=${MCU} ${TARGET}
## Clean target
.PHONY: clean
clean:
-rm -rf $(OBJECTS) cdcio-2313.elf dep/* cdcio-2313.hex cdcio-2313.eep cdcio-2313.lss
## Other dependencies
-include $(shell mkdir dep 2>/dev/null) $(wildcard dep/*)
|
ANamelessBand/pulse
|
hardware/cdcio.2009-07-15/tiny2313/default/Makefile
|
Makefile
|
mit
| 2,184
|
//------------------------------------------------------------------------------
// <auto-generated>
// This code was generated by a tool.
// Runtime Version:4.0.30319.42000
//
// Changes to this file may cause incorrect behavior and will be lost if
// the code is regenerated.
// </auto-generated>
//------------------------------------------------------------------------------
namespace NRTyler.CodeLibrary.WPF.Properties
{
[global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]
[global::System.CodeDom.Compiler.GeneratedCodeAttribute("Microsoft.VisualStudio.Editors.SettingsDesigner.SettingsSingleFileGenerator", "11.0.0.0")]
internal sealed partial class Settings : global::System.Configuration.ApplicationSettingsBase
{
private static Settings defaultInstance = ((Settings)(global::System.Configuration.ApplicationSettingsBase.Synchronized(new Settings())));
public static Settings Default
{
get
{
return defaultInstance;
}
}
}
}
|
FiiZzioN/NRTyler.CodeLibrary
|
NRTyler.CodeLibrary.WPF/Properties/Settings.Designer.cs
|
C#
|
mit
| 1,080
|
<p>Llibre: Bryan Tracy. Metas. Empresa Activa.</p>
<blockquote>
<p>L’habilitat per fixar-se metes és la clau per alcançar l’èxit.</p>
</blockquote>
<h3 id="sumari">Sumari</h3>
<p><a href="#0-index">00. Índex</a></p>
<p><a href="#1-allibera-el-teu-potencial">01. Allibera el teu potencial</a></p>
<p><a href="#2-pren-el-control-de-la-teua-vida">02. Pren el control de la teua vida</a></p>
<p><a href="#3-cree-el-seu-propi-futur">03. Cree el seu propi futur</a></p>
<p><a href="#4-aclareix-els-teus-valors">04. Aclareix els teus valors</a></p>
<p><a href="#5-definisca-les-seues-verdaderes-metes">05. Defineix les teues mentes</a></p>
<p><a href="#6-decidisca-quin-és-el-seu-primer-propòsit-clar">06. Decideix quin els el seu propòsit clar</a></p>
<p><a href="#7-analitza-les-teues-conviccions">07. Analitza les teues conviccions</a></p>
<p><a href="#8-comence-pel-principi">08. Comence pel principi</a></p>
<p><a href="#9-medeixca-els-seus-progresos">09. Medeix els teus progresos</a></p>
<p><a href="#10-elimine-els-obstacles">10. Elimina els obstacles</a></p>
<p><a href="#11-esdevingas-en-un-expert">11. Esdevin-te un expert</a></p>
<p><a href="#12-associat-amb-les-persones-adients">12. Associa’t amb les persones adients</a></p>
<p><a href="#13-elabora-un-pla-dacció">13. Elabora un pla d’acció</a></p>
<p><a href="#14-administre-bé-el-seu-temps">14. Administra bé el teu temps</a></p>
<p><a href="#15-revise-les-seues-metes-a-diari">15. Revisa les teues metes a diari</a></p>
<p><a href="#16-visualitze-les-seues-metes-continuament">16. Visualitza les teues metes continuament</a></p>
<p><a href="#17-active-la-seua-ment-superconscient">17. Activa la teua ment superconscient</a></p>
<p><a href="#18-romanga-flexible-en-tot-moment">18. Roman flexible en tot moment</a></p>
<p><a href="#19-alliberte-la-seua-creativitat-innata">19. Allibera la teua creativitat innnata</a></p>
<p><a href="#20-faça-un-poc-cosa-cada-dia">20. Faça un poc cada dia</a></p>
<p><a href="#21-persevere-fins-a-triomfar">21. Persevere fins a triomfar</a></p>
<p><a href="#22-conclusió-actue-hui">22. Conclusió: Actue hui</a></p>
<p>Quan no tenim metes som persones <strong>reactives</strong>. Quan ens fixem metes hi ha moltes probabilitas de que les alcancem.</p>
<p>Característiques SMART:</p>
<ul>
<li>S - Específica: Les mestes parteixen dels desitjos però ha de ser clara, concreta i ha d’estar per escrit.</li>
<li>M - Mesurable: La meta ha d’esser mesurable.</li>
<li>A - Alcançable: S’ha de poder aconseguir.</li>
<li>R - Realitzable: Ha de poder ser realitzada.</li>
<li>T - Time: Amb un temps definit, ha de ser quantificable.</li>
</ul>
<h3 id="00-index">00. Index</h3>
<ol>
<li><strong>Defineix la meta de forma concreta</strong>. La nostra energia i passió moldeja el nostre entorn. Els triomfadors es dediquen a pensar en què volen i com ho van a aconseguir.</li>
<li><strong>Pren el control</strong> de la teua vida. Fes-te responsable de les teues accions.</li>
<li><strong>Crea el teu propi futur</strong>. Tots els líders tenen tenen una visió. Saben on van i què han de fer per arribar-hi. Això s’anomena orientació al futur. Crea una idealització, pensa com va ser la teua vida d’ací a 5 anys. Idealitza. «Fake it until you make it», «Fake it ‘til you make it» (falseja-ho fins que ho aconsegueixes).</li>
<li><strong>Aclara els teus valors</strong>. Els valors determinen les conviccions, les teues conviccions determinen la teua personalitat, la teua personalitat determina la teua actitud, la teua actitud determina els teus actes. Circle concènctrid de dins a fora: valors → conviccions → personalitat → actitud → actes.</li>
<li><strong>Defineix les teues verdaderes metes</strong>. Les teues mestes són personals, cal que penses en tu primer. Si no defineixes metes personals no va a funcionar, cal que siguen teues. Per fer-ho cal definir primer els somnis per traduir-los a accions realitzables. Després de definir els somnis dal definir les metes.</li>
<li><strong>Defineix el teu propòsit clar</strong>, la meta que té més importància, la meta que et va a ajudar més que les altres a alcançar totes les teues metes. Cal que siga clar, especific, quantificable i realitzable, has tenir una probabilitat d’èxit. Quan el tingues clar comença a parlar d’ell perquè necessites construir les condicions necessàries per alcançar-ho.</li>
<li><strong>Analitza les teues conviccions</strong>. Les conviccions es converteixen en realitat. Tenim les nostres pròpies lleis. Quan ens sentim malament cal mirar-se a l’espill i forçar el cos.</li>
<li><strong>Comença pel principi</strong>. Analitza el punt de partida.</li>
<li><strong>Medeix els teus progressos</strong>. Defineix les estacions per on vas a passar. No canvies la meta, canvia el plaç per alcançar-la.</li>
<li><strong>Elimina els obstacles</strong>. Els triomfadors pensen orientats a les solucions la major part del temps, no als obstacles. Cal centrar-se en les solucions i després analitzar com ha succeit. També, a l’hora de resoldre problemes cal determinar d’on venen, regla 80-20. El 80% de les restriccions estan dins de nosaltres mateixos. Solem nosaltres els que ens posem obstacles per arribar a l’èxit. Tu éts l’embut per on passa tot, tu ets el major obstacle. Cal eliminar els obstacles automatitzant processos i fen-te responsable de les teues accions. Cal elinimar els bloquejos mentals.</li>
<li><strong>Converteix-te en expert en el teu camp</strong>. La caracerística principal dels triomfadors és que, en algun moment s’han compromés en ser els millors. A partir d’ahí es varen apartar dels demés i rendint molt més que els demés. Tot es pot aprendre. Si no estàs arribant on arriben els altres és perquè no tens els coneixements que tenen els altres, però pots arribar a tenir-los. Sent expert et vas a diferenciar. Una vegada ho sigues cal mostrar als altres que ho eres.</li>
<li><strong>Associa’t amb les persones adequades</strong>. Cultivar les relaciona acertades amb les persones adequades. Aquest va a estar un factor determinant. Quant més encertada siga aquesta elecció més ràpid es progressa cap a les metes. Tenir persones que et puguen orientar.</li>
<li><strong>Elabora un pla d’acció</strong>. Cada minut que dediques a la planificació son 10 minuts que t’estalviaràs en l’acció. L’èxit depén de la teua capacitat per ser flexible, per acceptar els canvis. Presta atenció a això en el que vares encertar i això el que no vares encertar. Lean Start Up.</li>
<li><strong>Administra bé el teu temps</strong>. La sensació de control depén de com gestiones el teu temps. Gestionar les tasques és bàsic per controlar el teu temps. El més bàsic és fer una llista organitzada per ordre de prioritats. Defineix 3 metes, revisa i avalua-les. Administra el teu temps mitjançant disciplina, control. Atén les urgències, però analitza perquè ha succeït, però ràpidament torna a les teues metes.</li>
<li><strong>Analitza les teues tasques per tal que siguen les millors</strong>. Aprén de les teues accions. Assigna el temps correctamente basat en l’analisi. Escriu cada dia de 10 a 15 tasques, cada dia, les tasques que siguen importants. Cada dia 10 a 15 noves metes. En un temps identificaràs les més importants. Cal escriure-les sense copiar la llista anterior. A mesura que escrius els metes van a ser més concretes i es van a repetir.</li>
<li><strong>Visualitza les teues metes continuament</strong>. Això farà que penses diàriament en les teues metes. Així obliques la teua ment a pensar constantment en les teues metes, et concentres en les teues metes. Així emprendràs les accions de cada dia orientades a que les teues metes es facen realitat.</li>
<li><strong>Activa la teua ment superconscient</strong>. La ment superconscient explica la serendipia, la virtud de trobar-se amb coses extraordinàries. El que passa és que filtrem els estímuls, comencem a filtrar i a veure relacions perquè en som conscients d’això. Quan organitzes les metes de forma clara comences a veure senyals. Això té una lògica, quan no et fixes metes no tens filtres per fixar-te. La meta agusa els teus sentits.</li>
<li><strong>Roman flexible en tot moment</strong>. Incorpora tres frases «estava equivocat», «he comés un error», «he canviat d’opinió». D’aquesta manera asumeixes la flexibilitat. Des del moment que admiteixes l’error totes les energies es van a concentrar en eixir d’ell.</li>
<li><strong>Allibera la teua creativitat innata</strong>. Si no la utilitzem la perdem. Cal crear noves formes d’optimitzar.</li>
<li><strong>Fes alguna cosa tots els dies</strong>. Cal trocejar les metes en xicotetes accions.</li>
<li><strong>Persevera fins a triomfar</strong>. Segueix lluitant sense cansar-te, cal no rendir-se, cal no desesperar-se. Venç la por. Coratge. Quan l’has vences la por una vegada saps que pot tornar a vencer-la.</li>
</ol>
<h3 id="1-allibera-el-teu-potencial">1. Allibera el teu potencial.</h3>
<blockquote>
<p>L’èxit es fonamenta en les metes; la resta són paraules.</p>
</blockquote>
<p>Tots els triomfadors estan intensament orientats cap a una meta. Saben el que volen i es concentren resoltament en assolir-ho, un dia rere altre.</p>
<p>La nostra habilitat per fixar-nos metes és la clau mestra per assolir l’èxit.</p>
<p>Amb les metes, volem com una fetxa, directes i sense errades fins al nostre objectiu.</p>
<p>No importa d’on venim, el que importa és saber on anem.</p>
<p>Les metes clares augmenten la seua confiança, desenvolupen la seua competència i potencien el seu nivell de motivació.</p>
<p><em>La meta és el combustible que alimenta el forn dels assoliments</em>. Tom Hopkins.</p>
<p>Tot comença amb un <strong>desig</strong>.</p>
<blockquote>
<p>El converteixes en el que penses la major part del temps.</p>
</blockquote>
<p>Els triomfadors, la major par del temps, penen en <strong>el que volen</strong> i <strong>com aconseguir-ho</strong>.</p>
<p>A la natura no l’importa el tamany de les seues metes.</p>
<p>Si et fixes metes xicotetes, el mecanisme de consecució assolirà metes xicotetes. Si et fixes metes grans, assoliràs metes grans.</p>
<p>El <strong>tamany</strong>, l’<strong>alcanç</strong> i el <strong>detall</strong> de les metes en les quals elegisques pensar la major part del temps, és algo que sols tu pots decidir.</p>
<p>Per què no ens fixem metes?</p>
<ol>
<li>Pensem que les metes no són importants</li>
<li>No sabem com fer-ho</li>
<li>Tenim por a fracasar</li>
<li>Tenim por a que ens deixen de banda</li>
</ol>
<p>Percentatges:</p>
<ul>
<li>3% tenen metes i plans escrits.</li>
<li>13% tenen metes però no escrites.</li>
<li>84% no tenen metes.</li>
</ul>
<p>Les persones amb metes escrites acabaren guanyant 10 vegades més que el 97 dels graduats.</p>
<p>La diferència entre els grups és la claredat de les metes que s’havien fixat.</p>
<p>La felicitat exigeix metes.</p>
<p>Les <strong>metes</strong> ens donen la sensació de <strong>sentit</strong> i <strong>propòsit</strong> en la vida. Victor Frankl.</p>
<p>Els grans beneficis de la fixació de metes és que eixes metes ens permeten <strong>controlar la direcció del canvi</strong> en les nostres vides.</p>
<blockquote>
<p>La <strong>claredat</strong> ho és tot.</p>
</blockquote>
<p>Cultiva un <strong>desig ardent</strong>.</p>
<h3 id="2-pren-el-control-de-la-teua-vida">2. Pren el control de la teua vida</h3>
<blockquote>
<p>Quan acceptem la plena responsabilitat de la nostra vida, donem un pas de gigant que ens porta de la infantesa a l’edat adulta.</p>
</blockquote>
<p>Els pitjors enemics de l’èxit i la felicitat són les <strong>emocions negatives</strong> de tot tipus. Les emocions negatives ens subjecte, ens esgoten i ens lleven l’alegria de viure.</p>
<p>Emocions negatives:</p>
<ul>
<li>Por</li>
<li>Autocompasió</li>
<li>Enveja</li>
<li>Cels</li>
<li>Sentiments d’inferioritat</li>
<li>Ira</li>
</ul>
<p>Estan causades per quatre factors:</p>
<ol>
<li><strong>Justificació</strong>. Deixa de justificar-te. Si no pots justificar la teua negativitat no pots estar furiós. Quan no ens justifiquem apareix la calma i la claritat per concentrar-se en els següents passos.</li>
<li><strong>Racionalització</strong>. Negar-se a razionalitzar i donar excuses. No donar una <em>explicació socialment acceptable a un fet que, en cas contrari, seria socialemnt inaceptable</em>. La justificació i la racionalització ens situen en el paper de víctima i la cerca d’algú que té la culpa.</li>
<li><strong>Elevar-se per damunt de l’opinió dels demés</strong>. Si els demés opinen negativament sobre nosaltres apareix la ira, la incomoditat i la vergonya, la depresió, l’autocompació i la desesperació.</li>
<li><strong>Reconeix que ningú més és responsable</strong>. No culpes a ningú.</li>
</ol>
<blockquote>
<p>No podem dir <strong>soc respnsable</strong> i sentir-nos furiosos.</p>
</blockquote>
<p>Quan <strong>alliberes les emocions negatives</strong>, asumint la responsabilitat, podràs començar a fixar i assolir metes en tos els aspectes de la teua vida.</p>
<p><strong>Ningú pot fer que et sentes inferior sense el teu consentiment</strong>. Eleanor Roosevelt.</p>
<p><strong>Mai guarde rencor a ningú; mentre tu et quedes guardant-los rencor, ells se’n van per ahí de festa</strong>. Buddy Hackett.</p>
<p>No dones excuses. Si comets una errada disgues <strong>ho senc</strong>.</p>
<p>Per a mantenir una <strong>mentalitat positiva</strong>, negat a criticar, queixar-te o condemnar els demés per res. En condemnar els demés aparèixen sentiments negatius i nosaltres som qui sofrim.</p>
<p><strong>Les emocions positives ens donen poder, les negatives, ens el lleven</strong>. Gary Zukav.</p>
<p>Consideres un treballador autònom, controlant cada part de la seua vida personal i professional. Tu tens el control.</p>
<p>Elabora la teua pròpia estragègia.</p>
<p>Converteix-te en un <strong>valor en alça</strong>.</p>
<p>No plores pel passat, pensa en les teues metes.</p>
<p>Pren el control intern, <strong>locus control</strong>. Hi ha una <strong>relació directa</strong> entre la <strong>quantitat de responsabilitat que acceptem</strong> i la <strong>quantitat de control que sentim</strong>.</p>
<p>Tres aspectes:</p>
<ul>
<li>Responsabilitat</li>
<li>Control</li>
<li>Felicitat</li>
</ul>
<p>A major <strong>responsabilitat</strong>, major <strong>control</strong>, a major <strong>control</strong>, major <strong>felicitat</strong>.</p>
<h3 id="3-cree-el-seu-propi-futur">3. Cree el seu propi futur</h3>
<p>L’única qualitat que tots els líders tenen en comú és la <strong>visió</strong>.</p>
<p>Si <em>ens convertim en el que pensem la major part del temps</em>, els líders pensen en el <strong>futur</strong>.</p>
<p>Una <strong>perspectiva</strong> a llarg termini és el principial determinant de l’èxit personal i econòmic en la vida. Edward Banfield.</p>
<p>Banfield va definir la <strong>perspectiva a llarg termini</strong> com <strong>la capacitat de pensar en un futur d’ací a diversos anys, mentre es prenen decisions en el present</strong>.</p>
<p>Hem de començar practicant la <strong>idealització</strong>. Creem una fantasia pròpia a cinc anys. Pense com seria la seua vida perfecta d’ací a cinc anys.</p>
<blockquote>
<p>El major obstacle en la fixació de metes son les <strong>conviccions autolimitants</strong>.</p>
</blockquote>
<p>Cal no conformar-se amb metes menors.</p>
<p><em>Sobreestimem enormement el que podem aconseguir en un any, però subestimem enormement el que podem aconseguir en cinc anys</em>. Peter Drucker.</p>
<p>La principal diferència entre els que consegueixen resultats superiors i els que no els aconsegueixen és la <strong>orientació a l’acció</strong>.</p>
<p>Dissenye el seu <strong>calendari perfecte</strong>.</p>
<p><em>Quan no hi ha visió, el poble es relaxa</em>. Proverbis 29,18.</p>
<blockquote>
<p>La felicitat és la realització progressiva d’un ideal valuós.</p>
</blockquote>
<p>Prenga la resolució de <strong>pensar en el seu futur</strong> la major part del temps.</p>
<p>Quan més clar tinga el seu futur a llarg termini, més ràpidament atraurà a la seua vida persones i circumstàncies que l’ajudaran a fer realitat aquest futur.</p>
<h3 id="4-aclareix-els-teus-valors">4. Aclareix els teus valors</h3>
<p>Una de les característiques més importnats dels líders i de les persones de més èxit en qualsevol camp, és que <strong>saben qui són</strong>, <strong>en què creuen</strong> i <strong>què defenen</strong>.</p>
<p>La vida es viu de dins a fora. El nucli de la nostra persona són <strong>els nostres valors</strong>.</p>
<p>A més <strong>claredat</strong> en els nostres <strong>valors interiors</strong>, més precisos i efectiu són els nostres <strong>actes exteriors</strong>.</p>
<p>Nivells de personalitat:</p>
<ol>
<li>Els seus <strong>valors</strong> determinen les seues <strong>conviccions</strong>.</li>
<li>Les seues <strong>conviccions</strong> determinen les seues <strong>expectatives</strong>.</li>
<li>Les seues <strong>expectatives</strong> determinen la seua <strong>actitud</strong>.</li>
<li>La seua <strong>actitud</strong> determina els seus <strong>actes</strong>.</li>
</ol>
<p>Elements:</p>
<ol>
<li>Valors</li>
<li>Conviccions</li>
<li>Expectatives</li>
<li>Actituds</li>
<li>Actes</li>
</ol>
<p>Segons l’interior així és l’exterior.</p>
<p>Les nostres metes han de ser congruents amb els nostres valors, així s’alcança la felicitat. Per això, aclarir els nostres valors sol ser el primer pas per aconseguir grans coses i rendir al màxim.</p>
<p>Després cal organitzar el nostre entorn al voltant d’aquests valors.</p>
<p>Qualsevol intent de viure de manera que contradiga els valors que hi ha en el seu interior, li causarà estrés, negativitat, infelicitat, pesimisme i, inclús ira i frustració.</p>
<p>Confie la seua intuició.</p>
<p>Les persones comencen a fer-se grans quan escolten la seua veu interna i confien, total i absolutament, en que un poder superior els guia en el camí.</p>
<p>Vigile la seua conducta.</p>
<p>Demostrem els nostres <strong>valors</strong> sobretot quan estem sota <strong>presió</strong>.</p>
<p>Un dels exercicis per clarificar els valors que tenim és exposar els nostres valors per ordre de prioritat.</p>
<blockquote>
<p>Disgueu-me què li dóna a algú la seua màxima sensació d’importància i jo li diré quina és tota la seua filosifia de vida. Dale Carnegie.</p>
</blockquote>
<p>Determine el que desitja el seu cor.</p>
<p>El seu passat no és el seu futur.</p>
<blockquote>
<p>No importa d’on ve; l’únic que importa realment és on va.</p>
</blockquote>
<p>En el moment en el qual comencem a caminar, parlar i a actuar de forma coherent amb els nostres més alts ideals, la nostra pròpia imatge millora i ens sentim més satisfets amb nosaltres mateixos i amb el món.</p>
<blockquote>
<p>El nostre objectiu ha de ser crear una forma deliberada i sistemàtica les circumstàncies que eleven la nostra autoestima en tot el que fem.</p>
</blockquote>
<p>Sàpiga en què creu.</p>
<blockquote>
<p>Pense sols en el que creu.</p>
</blockquote>
<p>Siga fidel a sí mateixa.</p>
<p>El valor més important és <strong>la integritat</strong>. La integritat no és tant un valor en sí mateix com el valor que garantitza tots els demés.</p>
<p>Siga <strong>leal</strong> amb sí mateixa i amb els demés.</p>
<p>Accepte la total responsabilitat de la vida i tot el que succeix.</p>
<p>Faça una imatge ideal del seu propi futur perfecte i aclarisca els seus valors, estarà llest per començar a fixar-se unes metes clares i específiques en tots els aspectes de la seua vida.</p>
<h3 id="5-definisca-les-seues-verdaderes-metes">5. Definisca les seues verdaderes metes</h3>
<p>La meua paraula favorita en la fixació de metes i en l’èxit en general és la <strong>claredat</strong>.</p>
<blockquote>
<p>Hi ha una relació directa entre el nivell de claredat que tenim sobre qui somi què volem i pràcticament tot el que aconseguim en la vida.</p>
</blockquote>
<p>En aquest capítol comencarem a cristalitzar les nostres <strong>visions</strong> i <strong>valoracions</strong> en <strong>metes</strong> i <strong>objectius</strong> concrets en els què treballar cada dia.</p>
<p>Fes que les teues metes siguen <strong>personals</strong>.</p>
<p>Cal començar per u mateix. La fixació de metes, per a que el procés siga efectiu, deu d’ésser absolutament egoísta respecte al que <em>realment</em> vol per a vosté mateix.</p>
<p>La gran pregunta és: <strong>¿Què vull, de veritat, fer amb la meua vida?</strong> Recordem que no es pot alcançar una diana que no es veu.</p>
<p>Al principi semblen fantasies, però la nostra tasca és <strong>concretar-les</strong>.</p>
<p>Cal començar per metes generals, després definirem metes específiques.</p>
<p>Identifique les seues <strong>principals preocupacions</strong>.</p>
<p>Després caldrà identificar les <strong>principals solucions</strong> per a cadascú d’aquests problemes.</p>
<p>En 1142, William de Ockham, va proposar un mètode per a resoldre problemes <strong>la navalla d’Ockham</strong>.</p>
<blockquote>
<p><em>La solució acertada a qualsevol problemes sol ser la més senzilla i directa, la que exigeix el menor nombre de passos</em>.</p>
</blockquote>
<p>Cal no complicar les metes.</p>
<p>L’<strong>objectiu</strong> serà simplificar la solució i anar directament a la meta.</p>
<blockquote>
<p>Descobrisca el <strong>20%</strong> de <strong>feina</strong> que li dóna el <strong>80%</strong> dels <strong>resultats</strong>.</p>
</blockquote>
<p>Si ens plantejem que morirem prompte, <strong>allò que primer ens vinga a la ment reflexarà els nostres autèntics valors</strong>. La nostra resposta inclourà a les persones més importants de la nostra vida.</p>
<p>Fes una llista de somnis, 100 metes.</p>
<p>La <strong>raó</strong> primordial de que seguim en situacions que no son millors per a nosaltres és la <strong>por al canvi</strong>.</p>
<blockquote>
<p>Fes el que més t’agrada fer.</p>
</blockquote>
<p>Abraham Maslow parla d’<strong>experiències cumbre</strong>, moments u ocasions en que un individu es sent més feliç, més eufòric i ple d’entusiasme. Un dels principals fins en la vida és gaudir de tantes experiències cumbre com siga possible. Això s’aconsegueix fent memòria i identificant quins varen ser els moments d’experiència més alts en el pasat i imaginat com podriem repetir-los en el present i en el futur.</p>
<p>Deixe la seua petjada.</p>
<blockquote>
<p>Quan tinga absolutament clar què és el que vol, podrà pensar en les seues metes la major part del temps. Quan més pense amb elles, mér ràpidament es materialitzaran en la seua vida.</p>
</blockquote>
<h3 id="6-decidisca-quin-és-el-seu-primer-propòsit-clar">6. Decidisca quin és el seu primer propòsit clar</h3>
<blockquote>
<p>Hi ha una qualitati que es deu poseïr per a guanyar i és la <strong>claredat de propòsit</strong>; saber què es vol i desitjar ardentment posseïr-lo. Napoleon Hill.</p>
</blockquote>
<p>Donat que ens convertirm en allò que pensem la major part del temps, <strong>tenir un objectiu</strong> definit ens proporciona un <strong>punt d’enfoc</strong> per a tots els moments en que estem desperts.</p>
<p>Quan més pense en el seu propòsit i com alcançar-lo, més activarà la <strong>Llei de l’atracció</strong> en la seua vida. Començarà a atraure persones, oportunitats, idees i recursos que li ajudaran a avançar amb major rapidesa cap a la seua meta i que acostaran eixa meta amb major rapidesa cap a vosté.</p>
<p>Per la <strong>Llei de la Correspondència</strong>, el seu món exterior d’<strong>experiències</strong> es correspondrà i armonitzarà amb un món interior de <strong>metes</strong>. Quan tinga un propòsit clar en el què pense, parle i treballe tot el temps, el seu món exterior el reflectirà, com si fora un espill.</p>
<p>A més, un <strong>propòsit clar activa la seua ment subconscient en el seu benefici</strong>. Qualsevol idea, plan o meta que pot definir amb claredat en la seua ment conscient començarà, de forma immediata, a ser portada a la realitat per la seua <strong>ment subconscient</strong>, i, per la seua <strong>ment supraconscient</strong>.</p>
<p>Cada persona té en el cervell un òrgan especial anomenat <strong>còrtex reticular</strong>. Aquesta part del cervell, amb forma de dit, funciona de mode similar a la centralita telefònica d’un edifici d’oficines. El <strong>còrtex reticular</strong> conté el nostre <strong>sistema d’activiació reticular</strong>. Quan li enviem un missatge relatiu a la nostra meta, es posa en marxa i fa que siguem intensament conscients i estiguem alerta a les persones, la informació i les oportunitats del nostre entorn que ens ajudaran a assolir eixa meta.</p>
<blockquote>
<p>S’ha dit que l’atenció és la clau de la vida. Allí on va la nostra atenció, també va la nostra vida. Quan decidim quin és el nostre proòsit més important, augmenta el nostre nivell d’atenció i la nostra sensibilitat davant qualsevol cosa que puga ajudar-nos a aconseguir aquesta meta amb major rapidesa.</p>
</blockquote>
<p>El seu primer propòsit clar pot definir-se com la meta que tinga la màxima importància per a vosté en eixe moment.</p>
<p>Característiques del nostre primer propòsit clar:</p>
<ol>
<li>Deu ser alguna cosa que vullga, deveres, <em>personalment</em>. Un propòsit que l’<strong>entusiar-me</strong>.</li>
<li>Deu ser <strong>clar</strong> i <strong>específic</strong>.</li>
<li>Deu ser <strong>mesurable</strong> i <strong>quantificable</strong>.</li>
<li>Deu ser <strong>creible</strong> i <strong>realitzable</strong>.</li>
<li>Ha de tenir unes <strong>probabilitats d’èxit raonables</strong>, potser del <strong>50%</strong> per començar. Si mai ho ha aconseguit fixe’s una meta important amb el 80-90% de possibilitat d’èxit, al menys al principi.</li>
<li>Ha d’estar en <strong>armonia</strong> amb les seues altres metes.</li>
</ol>
<p>Cal fer-se aquestes preguntes:</p>
<ol>
<li>Quina cosa fabulosa s’atreviria a somilar, si sabers que no pot fracasar?</li>
<li>Quina és la meua meta?</li>
<li>Com assolir-la?</li>
<li>Quan de temps estem disposats a treballar per assolir-la?</li>
</ol>
<p>Si estem disposats a fer tot el que siga necessari per assolir la meta que ens proposem ho hi haurà pràcticament res que puga impedir-nos-ho.</p>
<p>Exercici de les 10 metes:</p>
<ol>
<li>Anotar 10 metes en un paper.</li>
<li>Pensar quina de les 10 metes, si puguera alcançar-la d’immediat, tindria el màxim efecte positiu en la meua vida?</li>
<li>Eixa meta és el seu propòsit clar més important, ja que influirà en la consecució de la majoria de les seues altres metes.</li>
<li>Siga quina siga la meta cal anotar-la en un paper, portar-la amb nosaltres i pensar en ella.</li>
<li>Comence hui mateix a treballar-la.</li>
</ol>
<h3 id="7-analitza-les-teues-conviccions">7. Analitza les teues conviccions</h3>
<blockquote>
<p>L’única cosa que separa a un hom del que vol en la vida és, amb freqüència, simplemnt la voluntat per intentar-ho i la fe per a creure que és possible. Richard M. Devos.</p>
</blockquote>
<p>Potser la més important de totes les lleis mentals és la <strong>Llei de la Convicció</strong>.</p>
<p>Aquesta llei diu que <strong>qualsevol cosa que es crega amb convicció es converteix amb realitat</strong>.</p>
<blockquote>
<p>No creguem el que veiem, veiem allò el el que ja creiem.</p>
</blockquote>
<p>Contemplem el món a través d’un cristall de creències, actituds, prejudicis i idees preconcebudes.</p>
<blockquote>
<p>No som el que creiem que som, però el que creiem, això som.</p>
</blockquote>
<p>Es diu de l’home <em>com pensa amb el seu cor, així és</em>, Proverbis (23,7). Actuem exteriorment basant-nos en les nostres creències i conviccions més profundes sobre nosaltres mateixos.</p>
<p><em>Facaç amb vosaltres segons la vostra fe</em>, Mateu (9.27). El que creiem de veritat es converteix en la nostra realitat i determina el que succeix.</p>
<p>Tot el que fem o aconseguim a la vida, cada pensament, sentiment o acte, està controlat i determinat pel concepte que tenim de nosaltres mateixa.</p>
<blockquote>
<p>El seu concepte de sí mateix precedeix i prediu els seus nivells d’actuació i eficàcia en tot el que faça.</p>
</blockquote>
<p>El <strong>concepte de sí mateix</strong> és el programa mestre del seu ordinador mental.</p>
<blockquote>
<p>El concepte de nosaltres mateixos està format per la suma total de tot el que creiem, sentim i opinem de nosaltres mateixos i del nostre món.</p>
</blockquote>
<p>Per això, <strong>sempre actuem de manera coherent</strong> amb eixe concepte de nosaltres mateixos, tant si aquest és positiu com si és negatiu.</p>
<p>El que <strong>creguem sobre nosaltres mateixa</strong> és en gran manera <strong>subconscient</strong>. Amb freqüència, aquestes opinicions no es basen en fets. Són el resultat d’informacions que hem anat absorvint al llarg de la vida i de la forma en quen hem anat processant eixa informació.</p>
<p>Les nostres creències han estat moldejades i formades en la primera infancia, pels nostres amics i coneguts, per les nostres lectures i educació.</p>
<p>Les pitjors creencies de totes són les <strong>creències autolimitadores</strong>.</p>
<p>Louise Hay diu que <strong>l’arrel de la majoria dels problemes</strong> de la vida està en la sensació de que <strong>no som suficientment bons</strong>.</p>
<p>Alfred Adler diu que tenir <strong>sentiments d’inferioritat</strong> és l’herència natural de l’home occidental, uns sentiments que comencen en la infància i, amb freqüència, continuen al llarg de la vida adulta.</p>
<p>Quasi totes les creències limitants són falses.</p>
<p>Les persones són soles més llestes o millors en diferents camps, en diferents moments.</p>
<p>Segons Howard Gardner, Universistat de Hardvard, artífex del concepte d’<strong>intel·ligències múltiples</strong>, poseïm, al menys, deu intel·ligències diferents, en qualsevol de les quals podriem ésser un geni.</p>
<p>Per desgràcia, tant en l’escola com en la universitat, sols ens medeixen en doues intel·ligències: la verbal i la matemàtica.</p>
<blockquote>
<p>Les seues conviccions són adquirides, no innates.</p>
</blockquote>
<p>Selecciona les conviccions que vols.</p>
<p>Si estàs absolutament convençut de que estàs destitat a triomfar, caminaràs, parlaràs i actuaràs com si tot el que et passa en la vida formara part d’un gran pla destinat a fer que tinga èxit. En realitat, així és com pensen els que ocupen els llocs més alts, en tots els camps.</p>
<blockquote>
<p>Busca el que siga bo</p>
</blockquote>
<p>Els triomfadors busquen el que és bo en qualsevol situació. Saben que sempre està ahí. No importa quants reveses i contratemps experiementen, sempre donen per suposat que conseguiran alguna cosa bona de tot el que els passa. Estan convençuts de que qualsevol revés forma part d’un gran pla que els fa avançar, inexorablement, cap al gran èxit que és inevitable per a ells.</p>
<p>Si les teues conviccions són suficientment positives, buscaràs la <strong>liçó valuosa</strong>, en lloc de qualsevol contratemps o dificultat.</p>
<blockquote>
<p>Dins de cada dificultat i de cada obstacle hi ha la llavor d’un avantatge o benefici igual o superior.</p>
</blockquote>
<p>La <strong>Llei de la Reversivitat</strong> diu: És més probable que t’obliques a <strong>actuar</strong> per a <strong>sentir</strong> d’una forma determinada que t’obligues a <strong>sentir</strong> per a <strong>actuar</strong> d’eixa forma.</p>
<blockquote>
<p>Cal actuar <strong>com si ja fórem</strong> la persona que desitgem ser, amb les qualitat i talents que desitgem tenir. Els teus actes generaran els sentiments que els acompanyen.</p>
</blockquote>
<p>Es tracta d’<strong>actuar</strong> primer per a <strong>sentir-se</strong> de la manera que volem, degut a la <strong>Llei de la Reversibilitat</strong>.</p>
<p>Si vol ser com un dels deu primers del seu sector, vístet com ells. Organitza els teus hàbits de treball com ells. Identifica les persones d’èxit i usa’ls com a models.</p>
<p>Cal <strong>fingir-lo fins que siga realitat</strong>.</p>
<p>Has de concentrar-te en crear, dins de tu, un convenciment coherent amb l’èxit que vols tenir en el teu món. Això s’aconsegueix qüestionant les <strong>creències autolimitadores, rebutjant-les i actuant com si no existiren</strong>.</p>
<p>El seu fi és reprogramar la seua ment subconscient per a l’èxit, creant l’<strong>equivalent mental</strong> d’eixe èxit en tot el que faces o digues.</p>
<blockquote>
<p>Cal actuar com si tinguerem la secreta garantia de l’èxit i sols nosatres ho saberem.</p>
</blockquote>
<h3 id="8-comence-pel-principi">8. Comence pel principi</h3>
<blockquote>
<p>El seu problema és salvar la distància entre on està ara i les metes que vol assolir. Earl Nightingale.</p>
</blockquote>
<p>Imagine que es disposara a travessar un país d’un extrem a l’altre. El primer pas que honaria seria elegir el seu destí i després agafar un mapa per a determinar quin és la millor manera d’arribar allí. La vida és algo paregut.</p>
<p>Una vegada hem decidit quins són els nostres <strong>valors</strong>, <strong>visió</strong>, <strong>misió</strong>, <strong>propòsit</strong> i <strong>metes</strong>, el següent pas és <strong>analitzar el punt de partida</strong>.</p>
<p>Practique el <strong>Principi de Realitat</strong>, Jack Welch, presidente executiu de General Electric durant molts anys el va definir com la <strong>capacitat de veure el món tal tom és, no com desitjariem que fora</strong>.</p>
<p>Quan més ajustats i precisos siguen els càlculs que faça respecte als seus ingresos, o en qualsevol altre camp, millor i més ràpid millorarà en cada un d’ells.</p>
<p>Calcule quan guanya per hora al mes. Negat a no fer res que no rendisca el promedi desitjat per hora.</p>
<p>Si has establert una meta a llarg termini, el següent pas és determinar exactament quin és el teu patrimoni actual, en termininis econòmics. El teu patrimoni és el que obtindries si vingueres tot el que tens.</p>
<p>Elabore plans econòmics a llarg termini i dividisca el nombre d’anys que pensa dedicar a assolir aquesta meta. Quan té que estalviar, invertir i acumular cada any per ser independent econòmicament.</p>
<p>La meta ha d’ésser realista.</p>
<p>Pensa partint de zero. Comença a planificar el teu futur a llarg termini. Sabent el que sé, hi ha alguna cosa que no tornaria a fer, si començara de nou?</p>
<p>És difícil, sinó impossible, que faça progressos en la vida si permet que li frenen decisions preses en el passat.</p>
<p><strong>Avalue cada aspecte de la seua vida</strong>, tant <strong>personal</strong> com <strong>professional</strong>.</p>
<blockquote>
<p>Estiga disposat a fer els canvis necessaris.</p>
</blockquote>
<p>Les circumstàncies canvien constantment, el 70% de les decisions que prenem acabaran siguent errònies.</p>
<p>Esbrine quins circumstàncies li estan frenant.</p>
<blockquote>
<p>Determine el seu nivell de coneixements i aptituds</p>
</blockquote>
<p>En quim camp, en quina habilitat és òptim amb el que fa?</p>
<blockquote>
<p>Identifique els seus punts febles.</p>
</blockquote>
<p>Els fets no menteixen. Harold Geneen.</p>
<blockquote>
<p>Estiga preparat per a reinventar-se</p>
</blockquote>
<p>Examine el seu mercat i el dels seus competidirs. Al reinventar-se dóne un pas enrere i pense avanç de començar, hui, la seua carrera des del principi, sabent el que sap.</p>
<p>Imagine que el seu treball i el seu sector desaparegueren de la nit al matí. Imagite que havera d’elegir una professió de nou. Què faria diferent del que està fent?</p>
<blockquote>
<p>El seu actiu econòmic més valuós és la seua capacitat d’aprenentatge, la seua habilitat per aplicar el seu talent i els seus coneixements al mercat.</p>
</blockquote>
<p>La seua <strong>capacitat d’aprenentatge</strong> pot augmentar el seu valor si continua invertint en ella i desenvolupant-la.</p>
<p>Veute a tu mateix com un <strong>conjunt de recursos</strong>, capaç de fer moltes coses diferents. Tens una amplia varietat d’aptituds, habilitats, coneixements, talent, educació i experiència. Hi ha molts treballs i tasques que poden fer o aprendre a fer, extremadament bé. No permetes quedar tancat en un curs d’acció donat, en especial si no estàs content amb le camí que segueix la teua vida laboral hui.</p>
<p>Fes-te <strong>preguntes despiadades</strong>:</p>
<ol>
<li>A on estem ara?</li>
<li>A on ens agradaria estar en el futur?</li>
<li>Com hem arribat fins ací? Què hem fet bé? Què fariem d’altra manera?</li>
<li>Què fem ara per arribar on volem anar? Basant-nos en la nostra experiència, què hauriem de fer per arribar?</li>
</ol>
<blockquote>
<p>Elabore el seu pla estratègic</p>
</blockquote>
<ul>
<li>Un treball ben començat, ja està a mitges acabat.</li>
<li>Un diagnòstic encertat és la meitat de la curació.</li>
</ul>
<h3 id="9-medeixca-els-seus-progresos">9. Medeixca els seus progresos</h3>
<blockquote>
<p>No hi ha ningun camí massa llarg per a qui avança amb parsimònia i sense apresuraments indeguts; no hi ha honors llunyans per a qui es prepara per a ells amb paciència. Jean de la Bruyère</p>
</blockquote>
<p>La nostra <strong>ment conscient</strong> és l’<strong>oficina principal</strong> de la nostra vida. El seu objectiu és <strong>tractar la informació que ens rodeja, identificar-la, analitzar-la, comparar-la amb altres informacions i, després, decidir quines mesures prendre</strong>.</p>
<p>Però és la nostra <strong>ment subconscient</strong> la que conté el gran poder que ens permet assolir un èxit molt més gran del què hem assolit mai.</p>
<p>La nostra <strong>ment subsconscient</strong> funciona de forma òptima quan conta amb <strong>metes clares, tasques específiques, medicions deliberades i plaços d’acompliment</strong>. Quantes més metes programe en el seu ordinador subconscient, millor funcionarà i més coses assolirà en un període de temps més curt.</p>
<p>Les tres claus del <strong>rendiment òptim</strong>:</p>
<ol>
<li><strong>Compromís</strong>, amb el compromís en una data apartem les excuses, actua com un accelerador subconscient.</li>
<li><strong>Completar</strong> les tasques.</li>
<li><strong>Tancament</strong>.</li>
</ol>
<p>Crea la <strong>sensació de triomf</strong> completant tasques al 100%. L’<strong>acció incompleta</strong> és una font important d’estrés i ansietat.</p>
<p>Sempre que seleccionem una meta, medició o activitat important per a nosaltres, en la nostra vida quotidiana, i comencem a observar-la o perstar-li atenció, els nostres resultats milloren.</p>
<p>Cal crear marcadors, indicadors per en tasques claus per avançar en les nostres metes. D’aquesta forma activem el nostre <strong>sistema forçós subconscient</strong>. Aquest sistema ens motivarà i empentarà, a un nivell inconscient, a començar més prompte, treballar més, quedar-nos fins a més tard i aconseguir fer la tasca.</p>
<p>Cal fixar-se <strong>dates límit</strong>. Si arriba aquesta data i no hem acabat la tasca, <strong>cal tornar a fixar-se una data límit</strong>.</p>
<p><strong>Desglosa les metes</strong> en xicotets passos.</p>
<p><strong>Identifica la tasca més valuosa</strong>.</p>
<p><strong>Perfeccionament continu</strong>, llig una hora al dia sobre temes del teu camp.</p>
<p><strong>Millore la seua forma física</strong>.</p>
<p><strong>Estalvie</strong> els penics i els dòlars s’estalviaran sols.</p>
<p>Siga una persona culta, llisca quince minuts cada dia els clàssics.</p>
<blockquote>
<p>Allò que no es pot mesurar no es pot gestionar.</p>
</blockquote>
<h3 id="10-elimine-els-obstacles">10. Elimine els obstacles</h3>
<blockquote>
<p>Qui està interessat en l’èxit ha de aprendre a veure el fracàs com a una part saludable e inevitable del camí per arribar al cim.</p>
</blockquote>
<p>La majoria dels triomfadors <strong>fracasen amb major freqûència</strong> que qui no ho és. Els primers proven més coses, cauen, s’alcen i tornen a provar, una i altra vegada, fins que, finalment, guanyen. Els no triomfadors proven unes quantes coses, si es que proven alguna, però molt prompte abandonen i tornen al que feien abans.</p>
<p>El <strong>fracàs temporal</strong> precedeix sempre a l’èxit.</p>
<p>El fracàs és una nova oportunitat per a començar d’un nou mode més intel·ligent.</p>
<blockquote>
<p>Una vegada hem definit les nostres mestes cal identificar els obstacles.</p>
</blockquote>
<p>Pensa en <strong>termes de solucions</strong>. Ens convertim en allò que pensem la major part del temps. En el camp dels problemes i dificultats, els triomfadors tenen una forma particular de pensar <strong>orientada a les solucions</strong>.</p>
<blockquote>
<p>Els <strong>triomfadors pensen en solucions</strong> la major part del temps. Els que <strong>no tenen èxit</strong> pensen els <strong>problemes</strong> i les <strong>dificultats</strong>.</p>
</blockquote>
<p>Les persones orientades a les solucions busquen, sense descans, maneres de superar, rodejar o saltar per damunt dels obstacles que els impedeixen el pas.</p>
<blockquote>
<p>Resoldre problemes és una tècnica, es pot aprendre.</p>
</blockquote>
<p>Tenim la capacitat de resoldre qualsevol problema i superar qualsevol obstacle si desitgem assolir aquesta meta amb força suficient.</p>
<p>En l’assoliment de qualsevol meta sempre hi ha un coll d’ampolla que cal identificar i concentrar tota la nostra energia en superar aquesta restricció clau.</p>
<p>Solem ser nosaltres el principal impediment que determina la rapidesa amb la qual assolirem qualsevol meta que ens fixem.</p>
<p>Als triomfadors els interesa més <strong>què és el que és encertat</strong> que <strong>qui té la raó</strong>. El que els interesa més la veritat de la situació i el que poden fer per resoldre el problema, que protegir el seu ego.</p>
<p>Mira en el teu interior i identifica el que et frena. Fes-te preguntes despiadades, sigues totalment sincer.</p>
<blockquote>
<p>Els principals obstacles vers les metes solen ser mentals.</p>
</blockquote>
<p>Dos obstacles principals per assolir l’èxit:</p>
<ol>
<li>La por</li>
<li>El dubte</li>
</ol>
<blockquote>
<p>Les emocions negatives poden desaprendre’s.</p>
</blockquote>
<p>Has vist alguna vegada un nadó negatiu?</p>
<p>Els dos primers antídots per superar el <strong>dubte</strong> i la <strong>por</strong> són:</p>
<ol>
<li>El valor</li>
<li>La confiança</li>
</ol>
<blockquote>
<p>Quan majors siguen el <strong>valor</strong> i la <strong>confiança</strong> menor serà la <strong>por</strong> i el <strong>dubte</strong>, i menys efecte tindran aquestes emocions negatives en la seua <strong>actuació</strong> i <strong>conducta</strong>.</p>
</blockquote>
<p>Les claus per desenvolupar <strong>valor</strong> i <strong>confiança</strong> són:</p>
<ol>
<li>El coneixement</li>
<li>La destresa</li>
</ol>
<p>La majoria de pors i dubten sorgeixen de la ignorància i dels sentiments d’ineptitud d’algun tipus.</p>
<blockquote>
<p>Quan més <strong>aprengues</strong> el que necessites saber per assolir les teues metes, menor por tindràs i més valor i confiança sentiràs.</p>
</blockquote>
<p>Les persones que sofreixen <strong>impotència apresa</strong> senten que són incapaces d’assolir les seues metes o millorar la seua vida. Martin Seligman.</p>
<p><em>Tant si creu que ho pot fer com si creu que no ho pot fer, és cert en els dos casos</em>. Henry Ford.</p>
<p><strong>Desaprendre la impotència</strong>.</p>
<p>La manera de <strong>desaprendre la impotència apresa</strong> és posar-se metes xicotetes. <strong>Fer plans</strong> i <strong>treballar en ells cada dia</strong> igual que es desenvolupa la musculatura amb l’exercici.</p>
<p>Quan tinga <strong>més confiança</strong> en vosté mateixa i en les seues habilitats, pot fixar-se <strong>metes més grans</strong>. Amb el temps, els seus <strong>dubtes</strong> i <strong>temors</strong> es debilitaran i el seu <strong>valor</strong> i <strong>confiança</strong> creurà i arribarà a ser les forces dominants en el seu pensament. No passarà molt de temps abans que siga <strong>imparable</strong>.</p>
<p>El segon obstacle a superar és la trampa de la <strong>zona cómoda</strong>. Aquest és un obstacle important en l’ambició, el desig, la determinació i els assoliments.</p>
<p><strong>Fixe’s metes ambicioses i estimulants</strong>. Aquesta és la manera d’eixir de la zona còmoda. Després desglo-se-les en <strong>tasques específiques</strong>, establisca <strong>plaços</strong> i <strong>treballe cada dia</strong> per assolir-les.</p>
<p><strong>Organitze els obstacles per prioritats</strong>.</p>
<blockquote>
<p>Qualsevol que siga el problema, definixca’l de maneres diferents abans d’intentar resoldre’l. Guarde’s de qualsevol problema per al qual hi haja una única solució. Ian Mitroff.</p>
</blockquote>
<p>Després de definir el problema caldrà preguntar-se, quina altra cosa podria ser el problema.</p>
<p><strong>Definisca un obstacle com una meta</strong>.</p>
<p>Fixe’s dates finals i medicions per a cada pas.</p>
<p>Cal fer l’exercici d’identificar el que t’està frenant i després establir una meta clara, per escrit, per eliminar definitivament els obstacles i obtenir novament el control de la seua vida.</p>
<p><strong>Esforçat per assolir la precisió</strong>.</p>
<p>Si li preocupa haver definit un problema amb precisió, discuteix-lo amb algú que conegues i amb qui confies. Deixa el teu ego de banda. Accepta la possibilitat de tenir errades i debilitats fonamentals que t’impedeixen avançar.</p>
<p><strong>Quan el problema o els obstacles estiguen clars</strong>, començaran a arribar-li idees, oportunitats i respostes des de diverses fonts.</p>
<p><strong>Quasi tots els problemes es poden solucionar</strong>.</p>
<p>Quasi tots els problemes tenen solució. Si no la tenen <strong>olvida’l</strong>.</p>
<h3 id="11-esdevingas-en-un-expert">11. Esdevinga’s en un expert</h3>
<blockquote>
<p>L’home singular és simplement un home corrent que pensa i somia amb l’èxit i en camps més fructífers.</p>
</blockquote>
<p>Un cartell de reclutament de l’exèrcit nordamericà en una de les seues metes diu <strong>sigues tot el que pugues ser</strong>.</p>
<p>El mercat sols paga una remuneració excel·lent per uns resultats excel·lents.</p>
<p>En el nostre sistema econòmic, els seus ingressos vindran determinats per tres factors:</p>
<ol>
<li>El que fa.</li>
<li>Com ho fa de bé.</li>
<li>Com siga de difícil substituir-lo.</li>
</ol>
<p>Una característica dels triomfadors, és que, en un moment donat de la seua vida professional varen decidir <strong>comprometre’s amb l’excel·lència</strong>. Varen decidir ser els millors, pagar el preu, fer qualsevol sacrifici i invertir qualsevol qualtitat de temps que fora necessària per arribar a ser molt bons en el camp que havien elegit.</p>
<p>Com a resultat d’aquesta decisió, es varen apartar de la masa, de qui tenia un rendiment medi i ascendiren en la categoria d’ingressos on hui guanyen tres, quatre, cinc i deu vegades més que els seus companys què no varen assumir aquest compromís.</p>
<p><strong>Regla 80/20</strong>.</p>
<blockquote>
<p>Ningú és millor ni més llest que vosté.</p>
</blockquote>
<p>Els coneixements poden aprendre’s. Els que ho fan millor en algun camp varen aprendre els coneixements essencials, combinats amb altres, abans que vosté. Si no està assolint el que altres assolixen, això significa, simplement, que encara no ha aprés els coneixements necessaris.</p>
<blockquote>
<p>Podem aprendre qualsevol cosa que necessitem per a assolir qualsevol meta que ens fixem.</p>
</blockquote>
<p><strong>Per assolir alguna cosa que mai no ha assolit abans, ha d’arribar a ser algú que mai ha segut abans</strong>. Les Brown.</p>
<p><strong>Per a tenir més, primer has de ser més</strong>. Johann Wolfrang von Goethe.</p>
<p>Quan hages decidit estar entre els millors en el seu camp, l’única pregunta és: <strong>Com ho aconseguisc?</strong></p>
<p>Com em menge un elefant? A mossos. Cal desglosar les metes.</p>
<p>En començar a millorar decididament els nostres coneixements i destreces a fin d’arribar a estar entre un dels millors del nostre camp professional, és com si participàrem en una carrera i forem els únics que correguerem de veritat. Molt prompte avancem al pelotó i ens col·loquem em primera posició. Entretant, la majoria dels nostres competidors es limiten a passetjar, fent únicament el que necessiten per a conservar els seus llocs de treball. La idea de comprometre’s amb l’excel·lència no se’ls ha ocorregut.</p>
<blockquote>
<p>Identifique els conexiements que necessita.</p>
</blockquote>
<p>Projecte’s en tres o quatre anys i imagine que està entre els millors del seu sector. Què hauria d’haver passat? Què hauria d’haver aprés?</p>
<p>És quasi inevitable que la seua trajectòria professional canvie continuament, segons creixca i madure. Deu mirar constament cap avant i pensar en els coneixement i aptituds que necessitarà per a guanyar els diners que vol guanyar en els anys que venen.</p>
<blockquote>
<p>Identifique les àrees claus de resultats.</p>
</blockquote>
<p>Cal establir un anàlis com aquest, per exemple per dedicar-se a vendre serien aquest punts:</p>
<ol>
<li>Fer prospecció.</li>
<li>Establir la comunicacció.</li>
<li>Identificar les necessitats.</li>
<li>Presentar solucions.</li>
<li>Respondre a les objeccions.</li>
<li>Tancar la venda.</li>
<li>Aconseguir que els clients satisfets recomanen la comanda.</li>
</ol>
<p>Caldria puntuar-se entre 1 i 10 punts. Necessitarà assolir una puntuació de 7 per estar entre els 20% superior en el seu camp.</p>
<p><strong>Qualsevol que siga la nota final, ha de seleccionar el punt més feble, i treballar en ell per a arribar a ser igual o millor que els demés. El seu punt més feble estableix el seu nivell i com de ràpid i de lluny arribarà en la seua professió</strong>.</p>
<blockquote>
<p>Quina habilitat, si la desenvolupa i la practica d’una manera excel·lent, tindria el màxim efecte positiu en la seua trajectòria professional? Aquesta qualitat ha de convertir-se en el centre del desenvolupament personal i professional.</p>
</blockquote>
<p>Les persones amb èxit tenen una nota de huit, nou o deu en una <strong>àrea clau de resultats</strong>. <strong>Aquesta deu ser la seua META</strong>.</p>
<p>Set idees claus que determinen el seu èxit o el seu fracàs en el treball:</p>
<ol>
<li>Planificació</li>
<li>Organització</li>
<li>Dotació personal</li>
<li>Delegació</li>
<li>Supervisió</li>
<li>Medició</li>
<li>Presentació d’informes</li>
</ol>
<p>Tots els dirigens d’èxit són excel·lents en una d’aquestes àrees. Una debilitat greu en alguna d’aquestes àrees pot ser fatal per tal de triomfar en el treball.</p>
<p>Tenim una tendència natural a valorar-nos molt alt, per això és útil que altres ens valoren.</p>
<p>En quan determines en què vas a ser excel·lent, cal posar-se a treballar.</p>
<blockquote>
<p>La gent no canvia.</p>
</blockquote>
<p>Naixem amb certes aptituds, habilitats, tendències, forces, debilitats i talents. Tots emergeixen al principi de la vida i solen cristalitzar en l’adolescència. No canvien molt al llarg de la vida.</p>
<blockquote>
<p>Uns dels passos més importants que donarà en la seua vida professional és identificar en què és realment bo o en què pot arribar a ser-ho i després posar tot el cor en assolir l’exel·lència en aquesta àrea.</p>
</blockquote>
<p><strong>El millor per muntar a cavall és deixar-se portar pel cavall</strong>. Mary Parker Follet. La millor manera de cultivar-se és seguint les nostres aptitus i interessos naturals.</p>
<p><strong>Nodrisca la seua natura</strong>. Jim Cathcart.</p>
<p><strong>Tot el món té talent, però la destresa exigeix treball</strong>. Michael Jordan.</p>
<p><strong>La clau de l’èxit en EEUU és esbrinar el que de veritat ens entusiarma fer i, després, trobar el medi de guanyar-nos la vida fent-ho</strong>. Napoleon Hill.</p>
<p>Huit medis d’i<strong>identificar</strong> les característiques que ens fan especials:</p>
<ol>
<li>Què ens <strong>entusiarma</strong>.</li>
<li>Què <strong>fem bé</strong>.</li>
<li>Què has rebut majors <strong>elogis</strong>.</li>
<li>Quines coses varen resultar <strong>fàcils d’aprendre</strong> i de <strong>fer</strong>.</li>
<li>Què manté la nostra <strong>atenció</strong>.</li>
<li>Què ens <strong>entusiasma</strong>.</li>
<li>Allò que mentre ho fa <strong>el temps es para</strong>.</li>
<li>Què <strong>admirem</strong> i <strong>respectem</strong> de les persones que són bones amb això.</li>
</ol>
<blockquote>
<p>Els seus dons naturals són innates i fàcils de desenvolupar.</p>
</blockquote>
<p>Moltes habilitats són complementàries, depenen d’altres. Això significa que deu tenir una aptitud donada, a un cert nivell, per a poder usar les seues aptituds a un nivell més alt.</p>
<p>De vegades cal desenvolupar aptituds que no li agraden ni li fan gaudir per assolir l’excel·lència en el camp elegit.</p>
<p>Evita la trampa del que rendeix poc: <strong>la veritat és que no sóc bo en eixe camp</strong>.</p>
<p>La <strong>pràctica no porta a la perfecció</strong>, és la <strong>pràctica imperfecta</strong> el que, porta finalment, a la perfecció. Sempre que comence alguna cosa no ho farà bé al principi. Es sentirà torpe, però aquest és el preu que paguem per assolir l’excel·lència. Cal pagar el preu de l’èxit, el qual sol comportar un dur treball necessari per ascendir més alt.</p>
<p>Estiga preparat per invertir dos o tres anys per ser el millor en un camp crític.</p>
<p>Factor per progressar:</p>
<ol>
<li><strong>Llegir</strong> sobre el tema.</li>
<li><strong>Escoltar</strong> sobre el tema.</li>
<li><strong>Assistir</strong> a seminaris.</li>
<li><strong>Practicar</strong> sempre que puga.</li>
</ol>
<h3 id="12-associat-amb-les-persones-adients">12. Associa’t amb les persones adients</h3>
<blockquote>
<p>La seua actitud davant la vida, la seua valoració de sí mateix, el seu càlcul del que val estan colorejats, en gran mesura, pel seu entorn. Tota la seua vida professional es veurà modificada, moldejada i modelada pel que li rodeja, pel caràcter de les persones amb qui està en contacte cada dia. Orison Sweet Marden.</p>
</blockquote>
<p>La nostra capacitat per a cultivar les <strong>relacions encertades</strong> amb les persones adequades en totes les etapes de la nostra vida, personal i professional, serà el determinant crític del nostre èxit i els nostre assoliment tindrà un efecte extraordinari en la rapidesa amb que assolim les nostre metes.</p>
<p>Quan <strong>més persones conega</strong> i li coneguen de <strong>forma positiva</strong>, més èxit tindrà en qualsevol cosa que intente. Una única persona, en el moment i lloc oportuns, pot obrir-li una porta que li canvie la vida i li estalvie molt de treball.</p>
<p>Una part clau de la fixació de metes és que <strong>idetifique</strong> persones, grups i organitzacions per assolir les metes.</p>
<p>Hi ha tres categories de persones de les quals necessitarà ajuda i cooperació:</p>
<ol>
<li>Persones del seu <strong>cercle professional</strong>.</li>
<li>Persones del seu <strong>cercle familiar</strong> i <strong>amistats</strong>.</li>
<li>Persones <strong>fora del cercle</strong> professional i familiar.</li>
</ol>
<p><strong>Identifique</strong> aquestes persones.</p>
<p>En el cercle laboral, el seu cap és el client més important, és el que tindrà més impacte.</p>
<p>Una de les millors estratègies és <strong>fer una llista</strong> de tot el que li han contractat per fer. Per què estic en nòmina?</p>
<p>Porte-li la llista al seu <strong>cap</strong> i pregunte-li què és el més important per a ell. Després faça-li ordenar les coses per ordre d’importància. A partir d’aquest moment disciplíne’s entorn a aquesta llista. Assegure’s que sempre que veja al seu cap està treballant en la prioritat que li ha marcat.</p>
<p>Dues qualitats per la seua promoció:</p>
<ol>
<li>Capacitat per establir prioritats.</li>
<li>Capacitat per executar el treball amb promtitud.</li>
</ol>
<p>Si fem un bon treball en una tasca sense importància, això podria fer malbé la seua carrera. Assegure’s de que el que està fent té màxima prioritat per al seu cap. Després dedíque’s a fer-ho ràpidament.</p>
<p>Els <strong>seus companys</strong> són també els seus clients. Pregun-te’ls-hi si hi ha alguna cosa que puga fer que els ajude a fer millor les seues tasques.</p>
<p>Si ajudem primer, per la <strong>llei de la reciprocitat</strong> ens tendiran a ajudar per tornar-nos aquest favor.</p>
<p>Tots els esforços sincers que faça li retornaran d’alguna manera.</p>
<blockquote>
<p>Les persones més populars de qualsevol organitzación són les que estan sempre disposades a tirar una mà.</p>
</blockquote>
<p>Quan més agrade i recolze a qui està junt a vosté més li pagaran i més ràpidament el promocionaran.</p>
<p>Busque maneres de ser un <strong>recurs valuós</strong> per a qui li rodeja i ells buscaran, automàticament, maneres d’ajudar-li i respaldar-li quan vosté ho necessite.</p>
<p>La qualitat de <strong>jugar bé en equip</strong> va ser la qualitat més important, identificable des de fora, que va trobar un estudi de la universitat d’Stanford, per a obtenir un ascens ràpid.</p>
<p>El 20% de les persones d’un grup fan el 80% de la totalitat del treball.</p>
<p>Per ser un bon jugador d’un equip:</p>
<ul>
<li><strong>Acodisca</strong> a totes les reunions preparat.</li>
<li>Assente’s davant de la persona que dirigeix la reunió, amb <strong>contacte visual directe</strong>.</li>
<li>Parle amb <strong>promptitud</strong> i faça <strong>preguntes</strong>.</li>
<li>Oferisca’s <strong>voluntari</strong> per les missions que sorgeisquen.</li>
<li>Quan s’oferisca a <strong>fer</strong> alguna cosa, faça-ho <strong>bé</strong> i <strong>ràpidament</strong>, per tal que quede clar <strong>qui és la persona a qui acodir</strong> en l’empresa.</li>
</ul>
<p>L’habilitat més important és la <strong>fiabilitat</strong>.</p>
<p>Si es poden fiar del treball que faça, com a resultat, li oferiran les tasques més importants junt amb l’autoritat i remuneració que les acompanyen. La idea és crear un camp d’energia positiu i atractiu en torn a la fama de <strong>ser la persona de la qual tots es poden fiar</strong>.</p>
<p>Prenga’s temps per parlar amb els seu subordinats. Conéga’ls i veja si els pot ajudar. Siga amable i cortés amb ells. Elogie’ls i agraisca els seus esforços. Es sorprendrà del resultat.</p>
<p><strong>Invertisca en teixir relacions</strong>.</p>
<p><strong>Construisca una xarxa professional</strong>. Oferisca’s per a portar a terme missions. Encara que siga un treball no remunerat, aquestes activitats li oferiran l’oportunita de treballar amb persones claus i actuar davant d’elles.</p>
<blockquote>
<p>Quan més done de sí mateix sense esperar res a canvi, més tornarà a vosté les fonts més inesperades.</p>
</blockquote>
<p>Un estudi de Harvard portat a terme per David McClelland va descobrir que les persones amb qui ens associem habitualment era determinant per assolir l’èxit o el fracàs, més que qualsevol altre factor.</p>
<blockquote>
<p>Si vol volar amb les àguiles, no pot seguir escarbant el terra amb els galls d’indi.</p>
</blockquote>
<p><strong>Relacione’s amb les persones adients</strong>.</p>
<p>L’elecció del grup de referència orientat a una meta pot fer més que qualsevol cosa per avançar en la seua carrera.</p>
<p>Les persones en les quals s’associe tindrà major efecte que qualsevol altre factor.</p>
<p>No hi ha res de mal en equivocar-se, però és <strong>imperdonable romandre en l’error</strong>.</p>
<blockquote>
<p>Ningún èxit en la vida pública pot compensar el fracàs en casa. Benjamin Disraeli.</p>
</blockquote>
<p>Els problemes domèstics afectaran al seu treball, distrauran l’atenció i esgotaran la seua energia.</p>
<p>Mantinga en equilibri la seua vida familiar explicant la possible situació extrema per al qual passa. Propose compensar-los més endavant.</p>
<p><strong>Faça’s expert en relacions</strong>.</p>
<p>Tracte sempre a tot el món amb amabilitat, cortesia i comprensió.</p>
<p>L’estrategia més senzilla és: <strong>tractar als demés com si foren el client del milió de dólars</strong>. Tracte’ls com si foren capaços de comprar-li productes o serveis per valor d’un milió de dólars.</p>
<p><strong>Si ha de ser descortés, siga-ho amb els extranys, però guarde els modals professionals per a la seua familia</strong>. Emmet Fox.</p>
<blockquote>
<p>Tots els dies, de totes les maneres possibles, cerque formes d’<strong>alleugerar la càrrega de les altres perones</strong> i <strong>ajude-les a fer el seu treball millor</strong>, a <strong>viure amb menys problemes</strong>. Així acumularà una enorme reserva de sentiments positius cap a vosté, que li retornaran beneficis any rere any.</p>
</blockquote>
<h3 id="13-elabora-un-pla-dacció">13. Elabora un pla d’acció</h3>
<blockquote>
<p>La dedicació caractaritza a tots els triomfadors. <br />
El geni és l’art de prendre’s infinites molèsties… <br />
Tots els grans assoliments s’han caracteritzat <br />
per la cura més extrema, una minuciositat infinita, <br />
portada a terme fins al més mínim detall. <br /></p>
<p><small>Elbert Hubbardd</small></p>
</blockquote>
<p>La seua capacitat per a <strong>fixar-se metes</strong> i <strong>fer plans</strong> per assolir-les és la tècnica mestra de l’èxit. Cap habilitat li ajudarà millor a fer realitat el seu potencial per assolir tot el que és capaç d’assolir.</p>
<p>Tots els grans assoliments són <strong>treballs multitasca</strong>. Consisteixen en una sèrie de passos que han de donar-se en un ordre concret a fi d’aconseguir un resultat d’alguna envergadura.</p>
<p>El <strong>propòsit de la planificació</strong> és <em>permetre-li convertir el seu principal pròsit en un projecte multitasca planificat</em>, amb <strong>passos específics</strong>, un <em>principi</em>, una <em>part mitjana</em> i un <em>final</em>, amb <em>terminis</em> i <em>subterminis</em> clars. Quan més practique millor arribarà a ser.</p>
<p>Característiques del pla:</p>
<ol>
<li>Visió basada en els seus valors. Saps el què vols, saps per què ho vols.</li>
<li>Priorització de les metes. Selecció d’un propòsit clar.</li>
<li>Creació de medicions. Terminis i subterminis.</li>
<li>Identificació d’obstacles, dificultats i restriccions.</li>
<li>Identificació dels coneixements i habilitats essencials que necessitarà per a assolir la seua meta.</li>
<li>Organització d’aquestes competències per ordre de prioritat.</li>
<li>Identificació de les persones, grups i organitzacions l’ajuda de les quals necessitarà. Formulació dels passos específics per tal de que el puguen ajudar.</li>
</ol>
<blockquote>
<p>Context: Normandia.
Els plans no varen servir de res, però la planificació va estar indispensable. Dwight D. Eisenhower</p>
</blockquote>
<p>La <strong>identificació dels punts claus</strong> és la base de l’èxit, encara que no es torne a llegir aquesta planificació.</p>
<blockquote>
<p>En una empresa incipient, cal tirar per la borda tots els supostos cada tres setmanes. Scott McNealy (Sun Microsystems).</p>
</blockquote>
<p><strong>Tots els grans triomfadors treballen a partir d’escrits</strong>. Cada minut en la planificació estalvia deu minuts en l’execució.</p>
<p><strong>Fracasar en planificar és planificar per a fracasar</strong>.</p>
<blockquote>
<p><strong>P</strong>roper <strong>P</strong>rior <strong>P</strong>lanning <strong>P</strong>revents <strong>P</strong>oor <strong>P</strong>erformance.
<strong>P</strong>lanificació <strong>P</strong>revia <strong>P</strong>ertinent, <strong>P</strong>revé <strong>P</strong>obre <strong>P</strong>roductivitat.</p>
</blockquote>
<p>Avantatges de la planificació:</p>
<ol>
<li>Ens obliga a organitzlar les nostres idees i qüestions claus.</li>
<li>Ens permet planificar els nostres moviments amb molta cura.</li>
<li>Ens permet identificar errades.</li>
<li>Ens permet detectar punts febles.</li>
<li>Ens permet identificar punts forts i possibles oportunitats.</li>
<li>Ens permet concentrar els nostres recursos.</li>
<li>Ens estalvia setmanes i mesos de confusió, errades i pèrdues d’energia.</li>
</ol>
<p>La planificació és una tècnica i una disciplina:</p>
<ul>
<li>Faça una llista.</li>
<li>Determine la prioritat.</li>
<li>Organitze la seqüència.</li>
<li>Identifique el factor limitant.</li>
<li>Dóne per sentat que, al principi, fracasarà</li>
<li>Pregunte’s al principi què és el que funciona.</li>
<li>Sempre que el pla no funcione torne a començar.</li>
<li>Centre’s en la solució.</li>
<li>Reflexe el que pensa en un paper.</li>
<li>El model de planificació és un projecte: anote dies, setmanes, mesos que necessitarà.</li>
<li>Quan més clara tinga la llista més fàcil serà arribar.</li>
<li>Amb un full de planificació es pot veure amb claredat els passos que condueixen a la meta.</li>
<li>Reunisca al seu equip.</li>
<li>Hi ha un temps per a l’optimisme i un temps per al realisme. Siga sincer amb sí mateix.</li>
<li>Identifique els colls d’ampolla.</li>
<li>Tinga sermpre un pla alternatiu.</li>
</ul>
<p><strong>Planificar és la clau de l’èxit</strong>.</p>
<h3 id="14-administre-bé-el-seu-temps">14. Administre bé el seu temps</h3>
<p>Per a poder assolir les seues metes i arribar a ser tot el que és capç de ser, ha de controlar el temps.</p>
<p>Els psicòlegs solen estar d’acord en que la <strong>sensació de control</strong> és la clau dels sentiments de <strong>felicitat</strong>, <strong>confiança</strong>, <strong>poder</strong> i <strong>benestar personal</strong>.</p>
<blockquote>
<p>La sensació de control sols és possible quan practiquem unes tècniques de gestió del temps excel·lents.</p>
</blockquote>
<p>El punt de partida de l’administració del temps és <strong>determinar les nostres metes</strong> i després <strong>organitzar-les per ordre de prioritat</strong> i <strong>valor</strong>.</p>
<p>És important que conega en qualsevol moment què és el més important per a vosté.</p>
<p>Podem fer una classificació d’activitats:</p>
<ul>
<li>Activitats A: Activitats que el fan avançar cap la seua meta.</li>
<li>Activitats B: Activitats que no el fan avançar cap a cap meta important per a vosté.</li>
</ul>
<blockquote>
<p>Si actuem amb intel·ligència som intel·ligents, independentment dels títols guanyats.</p>
</blockquote>
<p>Definim <strong>actuar amb intel·ligència</strong> com <strong>qualsevol cosa coherent amb les metes que ens fixem</strong>.</p>
<ul>
<li>Determine les seues metes a llarg termini.</li>
<li>Comence amb una llista.</li>
</ul>
<blockquote>
<p>No es pot administrar el temps, sols ens podem administrar a nosaltres mateixos.</p>
</blockquote>
<p>L’administració del temps exigeix <strong>autodisciplina</strong>, <strong>autocontrol</strong> i <strong>autodomini</strong>.</p>
<p>Ha de planificar la seua vida amb llistes de <strong>metes</strong> i <strong>projectes</strong>:</p>
<ul>
<li>A llarg termini.</li>
<li>A mig termini.</li>
<li>A curt termini.</li>
</ul>
<p>Ha de <strong>planificar cada mes</strong> per avançat amb una llista de coses que vol portar a terme al llarg d’aquest mes.</p>
<p>Ha de fer una llista de cada treball multitasca que vullga realitzar i, després, organitzar aquesta llista per <strong>ordre de prioritats</strong> i per <strong>seqüències</strong>.</p>
<p>Comence a planificar <strong>cada setmana</strong> per avançat. Faça-ho preferentment el <strong>diumenge</strong>.</p>
<p>Planifique cada nit el <strong>dia següent</strong>, així, la ment subconscient treballa en la llista tota la nit. Al despertar tindrem, amb freqüència idees i ocurrències que ens ajudaran a posar en pràctica els punts de la nostra llista.</p>
<blockquote>
<p>Al posar els seus plans per escrit, activa la <strong>Llei de l’Atracció</strong> i comença a traure a la seua vida a les persones, les oportunitats i els recursos que necessita per a completar les seues tasques de la millora manera possible.</p>
</blockquote>
<p>Separe el que és <strong>urgent</strong> del que és <strong>important</strong>.</p>
<p>Les <strong>tasques importants</strong> són les que poden aportar <strong>el màxim al seu futur a llarg termini</strong>.</p>
<p>Exemples de tasques importants:</p>
<ul>
<li>Planificar</li>
<li>Organitzar</li>
<li>Estudiar</li>
<li>Investigar</li>
<li>Fixar-se prioritats</li>
</ul>
<p>Les <strong>tasques urgents</strong> venen determinades per presions i exigències externes.</p>
<p>Estemples de tasques urgents:</p>
<ul>
<li>Un telèfon que sona.</li>
<li>Un company que vol xarrar.</li>
</ul>
<p>La gran diferència entre les <strong>tasques urgents</strong> i les <strong>tasques importants</strong> és que les <strong>tasques urgents</strong> NO PRODUEIXEN RESULTATS, tot i que es donen en el entorn de treball.</p>
<p>Les <strong>tasques importants</strong> són les que poden aportar el màxim benefici al seu futur a llarg plaç.</p>
<p>La paraula més important per a determinar el valor d’una tasca o activitat donaes és <strong>conseqüències</strong>.</p>
<blockquote>
<p>Una tasca és valuosa quan el fet de fer-la o no fer-la té conseqüències importants.</p>
</blockquote>
<p>Quan majors siguen les conseqüències més important serà.</p>
<p>El seu <strong>objectiu</strong> en l’<strong>administració personal</strong> és <strong>dedicar més temps a fer les tasques més importants</strong>, que puguen tenir les majors <strong>conseqüències</strong> possibles en la seua vida i en el seu treball.</p>
<p>Regla 80/20.</p>
<p>Quan haja preparat la lista de tasques per al dia següent, <strong>revise-la</strong> i aplique la <strong>regla 80/20 abans de començar</strong>.</p>
<p>Si té una llista de 10 tasques 2 seran més valuoses que les altres 8 juntes.</p>
<p>Dues tasques de cada 10 tindran el 80% de les conseqüències.</p>
<p>Practique la <strong>posposició creativa</strong>, caldrà posposar el 80% de les tasques que aporten poc a les seues metes i resultats desitjats.</p>
<blockquote>
<p>Concentre el seu temps i atenció en complentar eixa tasca, la qual pot representar el canvi més important.</p>
</blockquote>
<p>Practique el mètode <code class="language-plaintext highlighter-rouge">ABCDE</code>.</p>
<p><strong>Categories</strong>:</p>
<ul>
<li><strong>A</strong>: Molt important.</li>
<li><strong>B</strong>: Caldria fer.</li>
<li><strong>C</strong>: Estaria bé fer, però no tindrà conseqüències.</li>
<li><strong>D</strong>: Podem delegar-ho.</li>
<li><strong>E</strong>: Es pot eliminar directament.</li>
</ul>
<p>La <strong>regla</strong> és aquesta: <strong>No faça mai la tasca B quan li queda per fer la tasca A</strong>. No faça mai la tasca C quan li queda per fer la B.</p>
<p><strong>Prioritats</strong>:</p>
<ul>
<li><strong>A1</strong>: Màxima prioritat.</li>
<li><strong>A2</strong>: Prioritat següent nivell de prioritat.</li>
<li><strong>A3</strong>: Següent nivell de prioritat.</li>
</ul>
<p><strong>Llei de l’Alternativa Excluida</strong>: Fer una cosa significa deixar de fer altra.</p>
<blockquote>
<p>Elegisca la tasca més valuosa.</p>
</blockquote>
<p>La principal diferència entre els triomfadors i els que no tenen èxit és que <strong>els triomfadors sempre treballen en tasques amb un alt valor</strong>.</p>
<blockquote>
<p>Sempre es pot elegir el que anem a fer, a la llarga, allò que elegisques determinarà tot el que et succeïsca.</p>
</blockquote>
<p><strong>Faça cada tasca de forma exclussiva</strong>: concentració exclussiva, sense desviacions ni distraccions.</p>
<blockquote>
<p>El meu èxit es deu més a la meua capacitat per a treballar continuament que qualsevol altra qualitat. Thomas Edison.</p>
</blockquote>
<p><strong>Cree trams de temps</strong>: 30, 60 ó 90 minuts de treball sense interrupcions.</p>
<p>Els treballs importants, els que tenen conseqüències importants, exigeixen tams de temps i energia concentrats exclussivament en ells.</p>
<blockquote>
<p>Tots els grans assoliments de la humanitat han estat precedits d’un període ampli, amb freqüència de molts anys, d’esforços concentrats. Earl Nightingale.</p>
</blockquote>
<p><strong>No es desvie del camí</strong>. Cada dia, abans de començar i segons transcòrrega la jornada hi ha cinc preguntes que ha de fer-se i respondre, una darrere de l’altra:</p>
<ol>
<li><strong>No et desvies del camí</strong>: Per què estic en nòminai? Per què me paguen?</li>
<li><strong>Concentra’t en les activitats d’alt valor</strong>: Quines són els activitats de més alt valor?</li>
<li><strong>Treballe en les seues àrees claus de resultats</strong>: Quines són les meues àrrees clau? Eixes tasques determinen, en gran mesura, el seu èxit o fracàs en el treball. La seua destresa més feble és la que estableix l’alçada a la qual usar les seues altres habilitats.</li>
<li><strong>Marque la diferència</strong>: Què puc fer jo, i sols jo que, si ho faig bé, respresentarà una diferència real per a la meua empresa?</li>
<li><strong>La pregunta més important</strong>: Quin és l’<strong>ús del temps</strong> més valuós, just en aquest moment. Discipline’s en aquest aspecte i assolirà l’èxit.</li>
</ol>
<blockquote>
<p>La clau de la productivitat i d’un rendiment alt és aquesta: <strong>dedíque’s a millorar</strong> i <strong>millorar</strong> en aquelles poques tasques que fa i que donen compte de la major part dels seus <strong>resultats</strong>.</p>
</blockquote>
<p><em>El més important no ha d’estar mai a mercé del que menys importa</em>. Goethe.</p>
<p>La millor paraula en la gestió del temps és <strong>NO</strong>.</p>
<blockquote>
<p>Cultive bons hàbits i faça que el dominen.</p>
</blockquote>
<p>Cada vegada que complente una tasca important, experimentarà un <strong>estallit d’euforia</strong>, entusiasme i una accentuada autoestima. Es sentirà ple d’energia i de força. Se sentirà feliç, prenent el control de la seua vida.</p>
<h3 id="15-revise-les-seues-metes-a-diari">15. Revise les seues metes a diari</h3>
<blockquote>
<p>Ens convertirm en allò que pensem la major part del temps.</p>
</blockquote>
<p>Pot convertir-se en qualsevol cosa que puga mantenir en la seua ment de forma continuada. Joan Boyle.</p>
<p>Aquesta és la clau.</p>
<p>Per a que el <strong>pensament positiu</strong> no degenere en <strong>desitjos</strong> i <strong>esperances</strong> positives cal convertir-lo en <strong>coneixement positiu</strong>.</p>
<blockquote>
<p>En el més profund del seu ser, ha de saber i creure, de forma absoluta, que va a tenir èxit i assolir una meta donada. Ha d’actuar, absolutament, sense cap dubte. Ha d’estar resolt i decidit, tan convençut del seu èxit final, que res pot detenir-lo.</p>
</blockquote>
<p><strong>Programe la seua ment subconscient</strong>.</p>
<p>Una de les lleis mentals més importants és: <strong>Qualsevol cosa que grabe profundament en el seu subconscient, acabarà, amb el temps, per expressar-se en el seu món extern</strong>.</p>
<p><strong>Fixació</strong> de metes sistemàtica, en lloc d’<strong>aleatòria</strong>.</p>
<p><strong>Cal escriure les metes cada dia, tots els dies</strong>.</p>
<p>Cal anotar 10 ó 15 metes diàriament, sense consultar la llista del dia anterior. Faça-ho cada dia. Amb el temps descobrirà que escriu les mateixes paraules cada dia, però les seues definicions seran més clares i concretes. Després de 30 dies canviaran paraules i l’ordre però seran les mateixes metes.</p>
<p>La seua vida canviarà. Començarà a atraure recursos persones que li ajudaran al assolir les seues metes. Tot començarà a canviar ràpidament, de forma positiva.</p>
<p>La redacció de metes ha de tenir 3 característiques:</p>
<ol>
<li>Ha de fer-ho de forma <strong>personalitzada</strong>. <code class="language-plaintext highlighter-rouge">Jo</code>.</li>
<li>De forma <strong>positiva</strong>. <code class="language-plaintext highlighter-rouge">Deixaré de fumar</code>.</li>
<li>En <strong>present</strong>. <code class="language-plaintext highlighter-rouge">Guanye 50.000 $</code>.</li>
</ol>
<p><strong>Active la seua ment subconscient</strong> mitjançant declaracions positives en temps present.</p>
<p>Per a augmentar el poder de les seues metes diàriament, pose una <strong>data límit</strong>.</p>
<p><strong>Confie en el procediment</strong>.</p>
<p>No importa saber com va a arribar a les metes, el que importa és escriure-les cada dia, amb <strong>absoluta fe</strong>, sabent que cada vegada que les anota, les grava més profundament en la seua ment subsconscient. En un moment donat començarà a creure, amb la convicció més absoluta, que la seua meta és assolible.</p>
<p>Després d’escriure les metes en el seu subconscient començarà a fer que les seues paraules i actes encaixen en una pauta coherent amb les seues metes.</p>
<p>La seua ment subconscient començarà a atraure a la seua vida a aquelles persones i circumstàncies que puguen ajudar-li a assolir-les.</p>
<p>Mètode:</p>
<ol>
<li>Planejar el dia per avançat.</li>
<li>Posar-se a treballar.</li>
<li>Concentrar-se, de forma exclussiva, en la meura tasca més important del dia fins que estiga acabada per complet.</li>
</ol>
<p>Porte les metes, sempre damunt, en un quadern.</p>
<p>Quan llisca les metes imagine que ja s’haja realitzat.</p>
<p>Ha d’imaginar-se realment donant eixos passos.</p>
<p>És ideal revisar les seues metes escrites, al menys, dues vegades al dia.</p>
<p>El moment ideal és al principi del matí i a última hora del dia.</p>
<p>Quan tornem a escriure i revisar les metes per la nit, programem en la nostra ment subconscient eixes metes, així, el cervell pot treballar durant tota la nit amb elles.</p>
<p>En llegir aquestes metes al dia següent, preparem el cervell a un nivell òptim per tal que les tinga en compte.</p>
<p>Passarem de <strong>pensar</strong> de forma positiva a <strong>saber</strong> de forma positiva. A desenvolupar de forma positiva i assolible que puguem assolir les metes i que sols és qüestió de temps que les conseguim.</p>
<p>A més de pensar en cada meta cal pensar <strong>3 coses que podriem fer</strong> per tal d’assolir aquesta meta.</p>
<h3 id="16-visualitze-les-seues-metes-continuament">16. Visualitze les seues metes continuament</h3>
<p>Acaricie les seues visions i somnis, perquè són fills de la seua ànima, l’esbós dels seus assoliments finals. Napoleon Hill</p>
<p>Posseïm i disposem de poders mentals pràcticament il·limitats. Moltes persones no són conscients d’aquest poders, i no els apliquen a la consecució de les seues metes. Eixa és la raó de que sols assolisquen resultats mediòcres.</p>
<p>En el moment que comence a aprofitar i donar rienda solta al poder de la seua <strong>ment subconscient</strong> i <strong>supraconscient</strong>, conseguirà, amb freqüència, més en un any o dos el que la majoria de gent consegueix en tota la seua vida.</p>
<p>La seua <strong>capacitat per a visualitzar</strong> és la facultat més poderosa que poseeix. Totes les millores de la seua vida comencen amb una millora de les seues imagens mentals.</p>
<p><strong>Canvie les imates mentals</strong> en el seu <strong>interior</strong> i el seu <strong>exterior</strong> canviarà per adequar-se a eixes imatges.</p>
<p>La <strong>visualització activa</strong> de la <strong>Llei de l’Canvie les imates mentals</strong> en el seu <strong>interior</strong> i el seu <strong>exterior</strong> canviarà per adequar-se a eixes imatges.</p>
<p>La <strong>visualització activa</strong> de la <strong>Llei de l’Atracció</strong>, porta a la seua vida <strong>persones</strong>, <strong>circumstàncies</strong> i <strong>recursos</strong> necessaris per a assolir les seues metes. <strong>Atracció</strong>, què porta a la seua vida <strong>persones</strong>, <strong>circumstàncies</strong> i <strong>recursos</strong> necessaris per a assolir les seues mentes.</p>
<p>La <strong>visualització</strong> de la <strong>Llei de la Correspondència</strong> diu: <strong>Segons l’interior, així l’exterior</strong>.</p>
<p>Ho voràs quan ho cregues. Wayne Dyer.</p>
<p>La imaginació és més important que els fets. Albert Einstein.</p>
<p>El que la ment de l’home pot concebir i creure, també ho pot aconseguir. Napoleon Hill.</p>
<p>La característica més comú de tots els líders a tots els nivells, a través del temps, és la <strong>visió</strong>.</p>
<p>Les persones sense èxit també visualitzen, però en detriment propi. Visualitzen les seues experiències de fracàs.</p>
<p>Alimente la seua ment amb imatges estimulants.</p>
<p>Faças amb el control de les seues imatges mentals.</p>
<p>La seua <strong>meta</strong> ha de fer-ser amb el <strong>control total</strong> del <strong>procés de visualització</strong> i assegurar-se de que la seua ment i les seues imatges mentals es concentre continuament en el <strong>que vol</strong> i en <strong>qui vol ser</strong>.</p>
<p>Eres el que pots ser.</p>
<p>Piero Ferucci explica com podem cultivar qualsevol qualitat que desitgem pensant en ella constantment i imaginant que ja la tenim.</p>
<p>Llisca sobre la qualitat desitjada, aprenga sobre ella, i, especialment, imagine practicant-la sermpre que siga necessari.</p>
<p>Aristòtil va escriure que <strong>la millor manera de cultivar una virtut</strong> que ens manca és <strong>imaginar que la tenim</strong> i <strong>actuar</strong>, en tots els sentits com si la <strong>tinguerem</strong>, sempre que siga necessari.</p>
<p>Canvie les seues imatges mentals.</p>
<p>Al <strong>canviar</strong> les nostres <strong>imatges mentals</strong>, canvien el nostre mode de <strong>pensar</strong>, <strong>sentir</strong> i <strong>actuar</strong>. Canviem el nostre <strong>rendiment</strong> i els nostres <strong>resultats</strong>.</p>
<p>Actue a nivell òptim.</p>
<p>Relaxese profundament i veja el resultat desitjat.</p>
<p>Les 4 parts de la visualització:</p>
<ol>
<li><strong>Freqüència</strong>: Nombre de vegades que visualitza una meta donada com ja aconseguida. A major freqüència més ràpidament aconseguirem la meta.</li>
<li><strong>Duració</strong>: Quantitat de temps que podem mantenir que eixa imatge es mostre en la nostra ment cada vegada que la evoquem.</li>
<li><strong>Claredat</strong>: A major nitidesa més ràpidament es farà realitat.</li>
<li><strong>Intensitat</strong>: A major quantitat d’emoció que concentrem en la nostra emoció. És la part més important.</li>
</ol>
<p>La natura és neutral, aquest elements ens poden ajudar o perjudicar.</p>
<p>El procés d’imaginar i visualitzar les metes de forma negativa, amb por i agoixa fa que es faça realitat també.</p>
<p><em>Perquè si de alguna cosa tinc por, em passa i em succeix el que tinc por</em>. Job 3.25.</p>
<p>Això ens adverteix de les desgracies d’una visualització negativa.</p>
<p><strong>La paciència és essencial</strong>.</p>
<p><strong>Si ho té absolutament clar, a la llarga ho aconseguirà</strong>.</p>
<p>Un dels <strong>millors moments per a visualitzar</strong> és a <strong>última hora de la nit</strong> i al <strong>principi del matí</strong>.</p>
<p>Quan visualitza les seues metes com si les haguera aconseguit abans d’anar-se a dormir, la seua ment subconscient les accepta a un nivell més profund. A continuació adapta les seues paraules i actes durant el dia per a que faça i diga cada vegada més eixes coses que faran realitat les seues metes.</p>
<p>Visualitzar metes clares al principi del matí farà que s’acomplisquen amb major probabilitat.</p>
<blockquote>
<p>Convertisca la seua vida en un procés continu de visualització positiva, imaginant i visionant constantment les seues metes ideals i el seu futur perfecte.</p>
</blockquote>
<p>Dedique temps de forma regular per a crear imatges mentals de vosté mateix. Després desenvolupe una absoluta fe en aquestes imatges que es materialitzaran precisament quan estiga preparat.</p>
<h3 id="17-active-la-seua-ment-superconscient">17. Active la seua ment superconscient</h3>
<blockquote>
<p>La ment subjectiva està, totalment sota el control de la ment objectiva. Amb una fidelitat extrema, porta a les últimes conseqüències qualsevol cosa que la ment subjectiva imprismisca en ella. Thomas Troward.</p>
</blockquote>
<p>Amb la ment <strong>superconscient ens convertim en el que pensem la major part del temps</strong>.</p>
<ul>
<li>Qualsevol cosa que pugam mantenir de forma continuada podem obtenir-la.</li>
<li>Llei de l’Atracció.</li>
<li>Llei de la Correspondència.</li>
<li>Importància de tenir absoluta claredat en determinar exactament què volem ser, tenir i fer.</li>
</ul>
<p>Antigament el secret de la ment supraconscient estava custodiat per místics i sabis. Ha estat en els últims 100 anys que el secret de la ment supraconscient ha estat més accessible.</p>
<p>Tres ments en una. Sigmund Freud va basar el seu treball en tres elements de percepció diferents<sup id="fnref:1" role="doc-noteref"><a href="#fn:1" class="footnote" rel="footnote">1</a></sup>:</p>
<ul>
<li><strong>Ego</strong>: Instància psíquica actuante, mediadora entre el Ello i el Superego. Intenta condicilar les exigències normatives i punitives del Superyo, així com les demandes insconscient del Superego..</li>
<li><strong>Ello</strong>: insconcient, pulsions i desitjos.</li>
<li><strong>Superego</strong>: Instància moral enjuiciadora de l’activitat de de l’Ego. Internalització de les regles, normes i prohibicions parentals.</li>
</ul>
<p><img src="https://es.wikipedia.org/wiki/Ello,_yo_y_supery%C3%B3#/media/File:Structural-Iceberg-es.svg" alt="Wikipedia" /></p>
<p>L’<strong>Ego</strong> es drescrivia com <strong>sóc jo</strong>, la part de la ment que està alerta i desperta, que s’ocupa del món extern, que analitza, descideix i actua. L’anomenem <strong>conscient</strong>.</p>
<p>L’<strong>Ello</strong>, segons Freud, és la part <strong>inconscient</strong>. És el vast magatzem de records i sentiments on estan guardats tots els nostres pensaments, decisions i experiències anteriors i actua de forma automàtica, tant per a fer funcionar el nostre cos físic com per a que els nostres pensaments i sentiments siguen sent coherents amb les nostres experiències passades.</p>
<p>El <strong>Superego</strong> de Freud, Ralph Waldo Emersone el va anomenar <strong>oversould</strong>, <em>superesperit</em>. Alfred Adler, alumne de Freud, el va anomenar <strong>inconscient col·lectiu</strong>. Carl Jung, el qual es va apartar de Freud, el va anomenar <strong>Supra Conscient</strong>. Napoleon Hill es referia a ell com <strong>Intel·ligència Infinita</strong>, i deia que, pràctiament, tots els màxims triomfadors l’usaben continuament en el seu treball i li assignava el mèrit dels més importants descobriments i assoliments.</p>
<p>El psicòleg italià Roberto Assagioli i algres parlen de <strong>Ment Superconscient</strong> o de la <strong>Ment de Déu</strong>.</p>
<p>Amb independència de com l’anomenem, <strong>és un gran poder universal al qual podem accedir en qualsevol moment per assolir quasevol menta que vullguem assolir de veritat, sempre que la desitgem intensament i durant un temps i una força suficient</strong>.</p>
<p>Llei de l’Activitat Superconscient: <strong>Qualsevol pensament, pla, meta o idea mantés de forma continuada en la ment conscient deu, inevitablement, ser portat a la realitat per la ment superconscient</strong>.</p>
<p>Qualsevol pensament por ser portat a la pràctica si es desitga amb intensitat i consistència en el temps. Les limitacions les posem nosaltres mateixos, amb la nostra imaginació.</p>
<blockquote>
<p>La ment superconscient funciona de forma òptima quan el nostre estat mental és tranquil i confiat.</p>
</blockquote>
<p>Sempre que practiquem la relaxació en soletat, soltant totalment les preocupacons i romanent asseguts en el silènci o en comunió amb la natura, la nostra ment superconscient comença a funcionar.</p>
<p>Sempre que <strong>estem en silenci</strong> i escoltem la nostra veu interior, comencem a sentir el murmull de la nostra ment superconscient. De vegades, la nostra percepció ens parla tant alt en el silenci que la idea o intuició que aporta ens canviarà la vida per complet.</p>
<p>Com activar la ment superconscient.</p>
<blockquote>
<p>La <strong>ment superconscient</strong> s’estimula mitjançant unes metes específiques, clares i escrites, desitjades intensament, visualitzades regularment i cap a les que treballem conscientment.</p>
</blockquote>
<p>Sempre que ens relaxem i visualitzem i plentem d’emoció un resultat específic que desitgem amb gran intensitat, estimulem la nostra ment superconscient amb gran intensitat, estimulem la nostra ment superconscient per a que ens proporciones idees i energia per a assolir la nostra menta.</p>
<p>De vegades, una inspiració superconscient l’aportarà tanta força i l’apassionarà en tal mesura que no podrà dormir ni pensar en res més. En eixe cas, deu sentar-se i anotar cada idea i cada detall que se li ocòrrega. Amb freqüència, al fer-ho alliberarà la seua ment i podrà tornar a dormir.</p>
<p>Serendipitat i sincronisme.</p>
<p>La <strong>ment superconscient</strong> explica dos fenòmens que experimentem de forma regular al llarg de la vida:</p>
<ul>
<li><strong>Serendipitat</strong>: Virtut de fer troballes afortunades segons avancem en la vida. Sempre que tinga una meta clara, que visualitza de forma continua i per a aconseguir la qual treballa cada dia, en la seua vida sorgiran experiències i aconteciments inesperats, cada un dels quals sembla ajudar-li a alcançar les seues metes amb major rapidesa. Amb freqüència tindrà un fracàs temporal que resultarà ser exactament el que necessitava que passara en aquell moment.</li>
<li><strong>Sincronisme</strong>: Successos connectats, amb sentit. Es basa en el sentit que donem a les nostres experiències.</li>
</ul>
<p>Quan més use la <strong>ment superconscient</strong> amb més freqüència gaudirà d’aquestes dos experiències meravelloses.</p>
<p>Busque el que siga bo.</p>
<p>El més interessant és que si cerquem alguna cosa bona en qualsevol situació, sembla ser que sempre ho trobem.</p>
<p>Si creu, tranquila i sosegadament, en la màgia de la <strong>serendipitat</strong>, sin importar el que succeïsca, tindrà repetides experiències <strong>serendípiques</strong> que li ajudaran a assolir les seues <strong>autèntiques metes</strong> en la vida.</p>
<p>Semblaria, que el <strong>sincronisme</strong> seria la Llei de Causa i Efecte, però difereix amb aquesta perquè, aquesta, diu que <strong>tot ocorre per una raó específica i que es pot trobar la causa per a tot efecte</strong>.</p>
<p>Amb el <strong>sincronisme</strong>, la única relació entre dos aconteciments simultanis és el <strong>sentit que li donem, basant-nos en les metes que tingam en diferents camps de la nostra vida</strong>.</p>
<p>Dues maneres d’estimular la seua ment superconscient:</p>
<ol>
<li><strong>Concentrar-nos i treballar amb gran intensitat</strong> per assolir la nostra meta. Posar tot el cor en això, parlar, escriure, tornar a escriure i revisar-ho dia a dia, sense excepció. Fer tot el que se’ns acuda pot portar-nos a assolir aquesta nostra meta.</li>
<li><strong>Relaxar-nos completament</strong> i ocupar els nostres pensaments en altra cosa. Quan més <strong>no ho intentem</strong>, més ràpidament treballarà la nostra ment per a nosaltres.</li>
</ol>
<p>Potser els dos processos ha de fer-se de manera seqüencial.</p>
<p>Una idea o solució superconscient té tres qualitats:</p>
<ol>
<li>Satisfarà tots els aspectes del problema o li proporcionarà tot el que necessita per assolir la seua meta.</li>
<li>Una inspiració superconscient apareixerà de forma natural, fàcil i adequada al asituació.</li>
<li>Li donarà un esclat de felicitat i entusiasme, inclús un apassionament.</li>
</ol>
<p>Sempre que reba una solució superconscient anirà acompanyada de l’energia, l’entusiame i la motivació que necessita per actuar en aquell moment. Serà irresistible el desig de posar solució en aquell moment.</p>
<p>Cal convertir en un hàbit el fet d’<strong>escoltar la nostra veu interior</strong>.</p>
<blockquote>
<p>Quan convertirm en un hàbit escoltar la nostra intuició i confiar en la nostra veu interior, és probable que mai tornem a comentre una errada. En connectar la seua ment superconscient, comença a armonitzar tota la seua vida amb aquest gran poder. Assolirà una meta rere l’altra. Avançarà caca colp més ràpidament en tot el que faça. Sentirà com si estiguera connectat a algun tipus de força còsmica com a font d’energia.</p>
</blockquote>
<h3 id="18-romanga-flexible-en-tot-moment">18. Romanga flexible en tot moment</h3>
<p><strong>Quan, finalment he decidit que mereix la pena aconseguir un resultat donat, seguisc avant i faig una prova rere una altra fins que ho aconseguisc</strong>. Thomas Edison.</p>
<p>Està en la natura de les coses que, algunes persones tinguen més èxit i felicitat que altres.</p>
<p>Un estudi va concloure que, la qualitat més important, en un temps de ràpids canvis, en obtenir èxit és la <strong>flexibilitat</strong>.</p>
<p>El tret oposat a la <strong>flexibilitat</strong> és la <strong>rigidesa</strong>, el <strong>pensament mecànic</strong>.</p>
<p>El que és oposat a abordar la vida amb una ment oberta és <strong>reaccionar de forma automàtica i previsible</strong> a una situació donada.</p>
<p>Hui, el canvi, no sols és <strong>ràpid</strong> sino que també és <strong>discontinu</strong>.</p>
<p>El que cal preguntar-se és: <strong>Funciona?</strong>; <strong>Assolisc el resultat esperat?</strong> Basant-me en la situació actual, <strong>és la millor conducta?</strong></p>
<p>Factors que impulsa al canvi:</p>
<ol>
<li>L’explosió de la <strong>informació</strong> i els <strong>coneixements</strong> en tots els camps de la nostra vida.</li>
<li>Ràpid creixement i l’accelerada evolució de les noves tecnologies.</li>
<li>La presió de la competència no té fi, cal ser flexible.</li>
</ol>
<p>És absolutament essencial mantenir-se al dia en el seu camp. Llisca.</p>
<p>De vegades el màxim perill per a l’èxit a llarg termini potser l’<strong>èxit a cur termini</strong>.</p>
<p><strong>Partisca de zero en tot, de forma regular</strong>.</p>
<p>Pregunte’s continuament: <strong>Hi ha alguna cosa que faig hui i que, sabent el que sé, no faria de nou, si tinguera que començar de nou?</strong>.</p>
<p>No deixe que el seu <strong>ego</strong> nuvole el bon judici i sentit comú.</p>
<p>Intereses <strong>pel que és encertat</strong> més que <strong>per qui té la raó</strong>.</p>
<p>Deu estar obert a que <strong>la majoria de decisions resulten errònees amb el temps</strong>.</p>
<p>Prepare’s per a ser flexible.</p>
<p>3 Afirmacions màgiques:</p>
<ol>
<li>Estava equivocat. Quan veja que està equivocat, el més intel·ligent és admetre-ho ràpidament.</li>
<li>He comés un error. Admitisca que no és perfecte.</li>
<li>He canviat d’opinió. Adapte’s a la nova informació amb rapidesa.</li>
</ol>
<p>Plantege’s si la meta continua tenint sentit.</p>
<p>Siga flexible amb les seues relacions.</p>
<p><strong>Dins de cada revés u obstacle descanca la llavor d’una oportunitat o benefici iguals o majors</strong>. Napoleon Hill</p>
<p>En quasi tots els casos, assolirà els seus majors èxits en un camp molt diferent del que va planejar inicialment. La clau és mantenir-se flexible.</p>
<blockquote>
<p>Siga clar en la seua meta, però flexible respecte al sistema d’assolir-la.</p>
</blockquote>
<p>Prenga la resolució de mantenir-se flexible i obert, sin importar el que succeisca. Recorde que quasi sempre hi ha un medi millor per realitzar qualsevol tasca o assolir qualsevol meta.</p>
<p>El seu objectiu ha de ser romandre alerta i conscient de quin podria ser, descobir-lo i, després, actuar en aquesta nova direcció amb la major rapidesa possible.</p>
<h3 id="19-alliberte-la-seua-creativitat-innata">19. Alliberte la seua creativitat innata</h3>
<blockquote>
<p>Faça que cada pensament, cada dada que li vinga a la ment li rendisca benefici. Faça que treballe i produïsca per a vosté. Pense en les coses no com són, sino com poden arribar a ser. No es limite a somirar. Cree! Robert Collier.</p>
</blockquote>
<p>Fem servir al voltant de l’1 al 2% de la nostra capacitat cerebal per al 100% del nostra funcionament en la vida i en el treball. La resta és <strong>capacitat de reserva</strong> que rarament s’aprofita o s’usa per ningua raó.</p>
<p>No és necessari fer un miracle per a aconseguir resultats espectaculars a la vida. Sols ha d’usar un poc més de la seua capacitat cerebral actual de la que usa hui. Aquesta millora en la seua capacitat pensant pot canviar-li la vida profundament.</p>
<p>La creativatat és com un múscul, si no s’usa es perd.</p>
<p>Les idees són la nova font de riquesa. Contene les claus necessàries per resoldre tots els problemes. Són els útils més importants per assolir qualsevolmenta.</p>
<p>Tota riquesa procedeix d’<strong>afegir valor</strong>, de produir més, millor, més barat, més ràpid i més fàcilment que els demés. L’única cosa que necessita per a fer fortuna és una bona idea que li servisca per a afegir valor.</p>
<p>Quan tenim les <strong>metes clares</strong>, <strong>escrites</strong>, <strong>tornades a escriure</strong>, <strong>visualitzades</strong> i <strong>emocionades</strong>, fem que la nostra <strong>ment</strong>, <strong>subconscient</strong> i <strong>supraconscient</strong>, genere una corrent continua d’idees vàlides per a l aconsecució de metes.</p>
<p>Practique la <strong>tormenta mental</strong>.</p>
<p>La bona forma física i la bona forma mental són molt similars. El la bona forma física exigeix treball igual que la bona forma mental.</p>
<p>La <strong>tormenta mental</strong> consisteix en plantejar-se problemes per a ser resolts. Tots podem resoldre qualsevol problema, superar qualsevol obstacle.</p>
<p>Per fer-ho cal anotar de forma clara la pregunta i buscar solucions amb les tres P:</p>
<ol>
<li>Personal</li>
<li>Positiva</li>
<li>En present</li>
</ol>
<p>Caldrà posar la pregunta la principi del paper i donar 20 respostes.</p>
<p>El millor moment del dia és al principi del matí.</p>
<p>Ha d’actuar amb paciència i determinació; la inspiració arribarà.</p>
<p>Concentre’s en la solució.</p>
<p>Els triomfadors responen amb eficacia. Els triomfadors respiren profundament, es relaxen i pensen amb claredat. Miren el que hi ha de bo en cada situació. Busquen l’elecció valuosa. Sobretot, es concentren en la solució, en el que es pot fer, en lloc de en el que ha succeït i amb qui és el culpable.</p>
<p>Aborde cada problema amb eficàcia:</p>
<ol>
<li>Definisca el problema amb claredat.</li>
<li>Pregunte’s quines són les causes.</li>
<li>Pregunte’s quines són les possibles solucions.</li>
<li>Pregunte’s què deu aconseguir aquesta solució.</li>
<li>Assigne un responsable específic o assumisca vosté mateixa la responsabilitat de la posta en pràctica de la solució.</li>
</ol>
<p>La clau de la victòria i l’èxit està en la <strong>organització</strong>.</p>
<p>A l’estudiar batalles i guerres ens adonem que ha estat possible guanyar aquestes situacions amb menor personal que d’altres. En tots aquests casos, la força numèricament inferior ha estat molt millor organitzada, era més metòdica i més disciplinada en el seu pla d’atac i execució que la més nombrosa i desorganitzada.</p>
<p>De igual manera, amb un sistema o recepta per a resoldre problemes, pot superar en motl a altres persones molt intel·ligents i instruïdes que es llancen a solucionar problemes sense mètode ni sistema.</p>
<p>Dues tècniques:</p>
<ol>
<li>Tormenta d’idees</li>
<li>Plantejament sistemàtic</li>
</ol>
<p>Un dels exercicis més creatius és <strong>planificar l’escenari</strong>. Pensar en les possibilitats de joc que tenim.</p>
<p>Planteja’t dues preguntes en planificar l’escenari:</p>
<ol>
<li>Quines són les tres pitjors coses que podrien succeir.</li>
<li>Quines són les tres coses millors que podrien succeir.</li>
</ol>
<p>Desenvolupe les seues opcions.</p>
<blockquote>
<p>Soles som tan lliures com ho siguen les nostres alternatives ben desenvolupades.</p>
</blockquote>
<p>Si la seua meta és ser feliç, tenir èxit i ser lliure, deu poder <strong>elegir</strong>. En cada situació, deu poder donar més d’un <strong>únic</strong> pas. No deu permetre’s, mai, quedar acorralat, amb una única via d’eixida oberta.</p>
<p>Elabore un plan B per a cada aspecte important de la seua vida professional i personal.</p>
<p>Afegisca valor constantment.</p>
<h3 id="20-faça-un-poc-cosa-cada-dia">20. Faça un poc cosa cada dia</h3>
<blockquote>
<p>L’èxit es deriva de treballar en firme, cada dia en tasques que tinc entre mans. Johnny Carson</p>
</blockquote>
<p>Uno dels factors que han descovert els estudis que s’han fet a les persones que han tingut èxit en la vida és que <strong>estaven orientats a l’acció</strong>.</p>
<blockquote>
<p>Les persones d’èxit estan intensament orientades a l’acció.</p>
</blockquote>
<p>Comencen un poc més aviat, acaben més tard. Estan en moviment constant.</p>
<p>Les persones que no tenen èxit comencen en l’últim moment possible i se’n van en quan poden. Són molt exigents en quan al dret de cada minut de les paues per al café, les hores de l’esmorzar, les baixes per enfermetat i les vacances.</p>
<p><strong>Llei de la Compensació</strong></p>
<p>En un famós assaig <strong>Compensation</strong> de Ralph Waldo Emerson va escriure que, <strong>en la vida, sempre seràs recompensat en proporció directa al valor de la teua aportació</strong>. Si vols augmentar la teua recompensa, has d’augmentar la <strong>qualitat</strong> i la <strong>quantitat</strong> dels teus resultats. Si vols traure més, has de posar més.</p>
<p>Napolen Hill va escrirue que la <strong>qualitat clau dels triomfadors</strong>, homes i dones, la majoria dels quals havia començat des de baix del tot, era que, en un moment prompte de la seua vida, varen cultivar l’hàbit de fer <strong>una milla extra</strong>. Varen descobrir que <strong>mai hi ha embussos de tràfic a la milla extra</strong>.</p>
<p>Responsabilitat i compromís:</p>
<ol>
<li><strong>Responsabilitat</strong>: Quan s’adapte al seu trebal i el domine, vaja a veure al seu cap i díga-li que vol més <strong>responsabilitat</strong>, que és està decidit a aportar el màxim possible.</li>
<li><strong>Compromís</strong>: Quan li donen l’oportunitat que ha demanat lliure-la amb la major brevetat possible.</li>
</ol>
<blockquote>
<p>El teu èxit en la vida estarà en proporció directa al que faces després de fer el que s’espera que faces.</p>
</blockquote>
<p>Convertix-te en eixa persona a la qual tothom acodeix quan vol que alguna cosa es faça ràpid i bé.</p>
<p>Iniciar la marxa requereix molta energia, però una vegada iniciada, ja no en requereix tanta.</p>
<p><strong>Planifique el se temps amb molta cura</strong>.</p>
<p>Estudis realitzats sobre això diuen que sembla haber <strong>una relació directa entre planificació estricta del temps i ingressos alts</strong>.</p>
<p><strong>Cada minut compta</strong>.</p>
<p>Els millors treballen <strong>enfocats</strong> sempre amb la <strong>mateixa intensitat</strong>.</p>
<p><strong>Un tempo ràpid és esencial per a l’èxit</strong>. Alan Lakein.</p>
<p><strong>Els triomfadors sempre se senten atrets per l’acció</strong>. Tom Peters.</p>
<blockquote>
<p>La clau per a aconseguir fer més és seleccionar la tasca més important i després començar-la amb la sensació d’urgència. Aquesta és la autèntica clau de l’exit i dels grans assoliments.</p>
</blockquote>
<h3 id="21-persevere-fins-a-triomfar">21. Persevere fins a triomfar</h3>
<blockquote>
<p>Poques coses són imposibles amb diligència i habilitat; les grans obres no foren realitzades amb força, sino amb perseverància. Samuel Johnson</p>
</blockquote>
<p>El determinant crític del seu èxit és la seua capacitat de decidir què vol, començar a fer-ho i després perseverar a través de tots els obstacles fins alcançar les teues metes.</p>
<p>L’altra cara de la <strong>perseverància</strong> és el <strong>coratge</strong>.</p>
<p>Potser el major repte de la vida al qual s’enfrentarà és <strong>la conquesta de la por</strong>, i el cultiu de l’<strong>hàbit del coratge</strong>.</p>
<p>Quan cultive l’<strong>hàbit del coratge</strong> i d’una <strong>autoconfianza inquebrantable</strong>, s’obrirà davant de vosté tot un món de possibilitats.</p>
<p>Pot <strong>aprendre</strong> qualsevol cosa que necessite.</p>
<blockquote>
<p>Espera problemes, com a part inevitable de la vida i, quan arriben, mantín el cap alt. Míra’ls a la cara i digues: Seré més gran que tu. Aquesta és la classe d’actitud que porta a la victòria. Alan Landers.</p>
</blockquote>
<p>El punt de partida per a <strong>superar la por</strong> i <strong>cultivar el coratge</strong> és, en primer lloc, mirar què <strong>factors ens predisposen a témer</strong> alguna cosa.</p>
<p>L’<strong>arrel de la por</strong> està en l’exposició durant la infantesa, a les crítiques, generalment destructives, del pare, la mare o tots dos. Això fa experimentar dos tipus de por:</p>
<ol>
<li>La <strong>por a fracàs</strong>: ens fa pensar “no puc, no puc, no puc…”.</li>
<li>La <strong>por al rebuig</strong>: ens fa pensar “he de, he de, he de…, però no puc”.</li>
</ol>
<p>A causa d’aquests temors ens obsessionem amb la por, ens tornem hipersensitius i ens <strong>paralitzem</strong>.</p>
<blockquote>
<p>La <strong>por</strong> i la <strong>ignorància</strong> van de la mà.</p>
</blockquote>
<p>El contrari també és cert: més <strong>informació</strong> i <strong>experiència</strong> en un camp concret ens donen més valor i confiança en aquest camp.</p>
<p>La <strong>fatiga</strong> ens converteix a tots en <strong>covards</strong>.</p>
<p>El <strong>descans</strong> i la <strong>relaxació</strong> augmenten el <strong>coratge</strong> i la <strong>seguretat</strong> tant com qualsevol altre factor.</p>
<p><strong>Tots</strong> tenim por.</p>
<blockquote>
<p>El valor és la resistència a la por, el domini de la por… no l’absència de la por. Mark Twain.</p>
</blockquote>
<p>Una persona <strong>valenta</strong> és la que avança encara que tinga por.</p>
<p>Quan evitem el que tenim, els nostres temors creixen fins que comencen a controlar tots els aspectes de la nostra vida. A mesura que augmenten, la nostra autoestima, autoconfiança i el nostre autorespecte disminueixen.</p>
<blockquote>
<p>Si no fas això que tems, la por controlarà la teua vida. Glenn Ford.</p>
</blockquote>
<p>Analitze les seues pors.</p>
<p>Fixe prioritats a les seues pors.</p>
<p>Respecte a la por predominant escriga les respostes a aquestes preguntes:</p>
<ol>
<li>Com em frena aquest temor a la meua vida?</li>
<li>Com m’ajuda aquest temor o com m’ha ajudat en el passat?</li>
<li>Què guanyaria eliminant la por?</li>
</ol>
<p>En <strong>identificar objectivament</strong> el nostre major temor, podem <strong>començar a eliminar-lo</strong>.</p>
<p>La pràctica converteix alguna cosa en permanent.</p>
<p>Qualsevol cosa que practique una i altra vegada es converteix en un nou hàbit.</p>
<p>Es cultiva el valor actuant valentment en totes les ocasions en que es requereix valor.</p>
<p>Algunes activitats per augmentar el valor:</p>
<ol>
<li>Començar, llançar-se, tenir fe.</li>
<li>La qualitat clau és la voluntat de <strong>fer</strong> alguna cosa en compte de sols parlar d’això.</li>
</ol>
<p><strong>Principi del corredor</strong> (Rondstadt): A mesura que les persones avancen cap a les seues metes, com si corregueren per un corredor, s’obrien portes que no havien vist què no s’obririen si no haveren estat en moviement.</p>
<p>El <strong>futur</strong> és de qui <strong>s’arrisca</strong>, no dels que busquen seguretat.</p>
<p>Quan més seguretat busquem, menys en tenim.</p>
<p>Quan més busquem les oportunitats, més probable és que assolim la seguretat que desitgem.</p>
<blockquote>
<p>Sempre que senta temor o ansietat i necessite reforçar el seu coratge per a perseverar davant dels obstacles i revesos, trasllades la seua atenció a les seues metes. Cree una imatge mental clara de la persona que li agradaria ser i actue de la manera que li agradaria actuar.</p>
</blockquote>
<p>Allò en el que pensem en excés creix, així que tinga cura.</p>
<p>El domini de la por i el cultiu de coratge són requisits esencials per a una vida feliç i exitosa.</p>
<p>Quan es comprometa en el cultiu del valor, arribarà, amb el temps, al punt en que els seus temors ja no tenen un paper important en la presa de decisions.</p>
<p>Es fixarà metes importants, apasionants, que el posaran a prova, i contarà amb al confiança d’assolir-les.</p>
<p>Podrà enfrontar-se a cada situació amb calma i seguretat en sí mateix. <strong>La clau és el coratge</strong>.</p>
<p>Aprenga dels mestres.</p>
<p><strong>Actuar ho és tot</strong>.</p>
<p>Els millors consells sols li ajudaran si es <strong>motiva a actuar de forma perseverant i continuada, en direcció a les seues metes, fins a triomfar</strong>.</p>
<p>L’<strong>autodisciplina</strong> és la cualidad fonamental.</p>
<p>L’<strong>autodisciplina</strong> significa que <strong>té la capacitat, en el seu interior, basant-se en la seua força de caràcter i voluntat, de fer el que ha de fer i en el moment en el que ha de fer-ho, tant si té ganes com si no en té</strong>.</p>
<p>El <strong>caràcter</strong> és la <strong>capacitat per portar a terme una resolució, una vegada que s’ha desvanit l’entusiasme amb la qual es va aprendre</strong>.</p>
<p>El més esencial és si pot disciplinar-se o no a pagar el preu una i altra vegada, fins que, finalment, assolisca el seu objectiu.</p>
<ul>
<li>Necessita autodisciplina per a <strong>fixar-se</strong> unes <strong>metes</strong> i per a <strong>fer plan</strong>s per assolir-les.</li>
<li>Necessita autodisciplina per a <strong>usar bé el seu temps</strong> i per a <strong>concentrar-se en la tasca més important</strong> en cada moment.</li>
<li>Necessita autodisciplina per a <strong>invertir en vosté tots els dies</strong>, a fi de fortalir-se personal i professionalment i aprender el que siga necessari per assolir l’èxit.</li>
<li>Necessita autodisciplina per a <strong>posposar la gratificació</strong> i estalviar diners i organitzar les seues finances de tal manera que puga assolir la independència econòmia en el curs de la seua vida laboral.</li>
<li>Necessita autodisciplina per a <strong>seguir pensant en les seues metes i somnis</strong> i apartar dubtes i temors.</li>
<li>Necessita autodisciplina per a <strong>reaccionar de forma positiva i constructiva fron a qualsevol dificultat</strong>.</li>
</ul>
<blockquote>
<p>La perseverància és la disciplina en l’acció.</p>
</blockquote>
<p>La <strong>perseverància</strong> és l’autència mesura de cada pesona. Medeix la confiança en nosaltres mateixos i la nostra capacitat per triomfar.</p>
<p>Mai et rendisques. Churchill.</p>
<blockquote>
<p>Seguisca avant. Res en el món pot substituir la perseverància. El tanlent, no pot; res no és més comú que homens fracasats amb talent. El geni tampoc; el geni no recompensat és quasi proverbial. L’educació, sola, tampoc; el món està ple de marginats instruïts. Sols la <strong>perseverància</strong> i la <strong>determinació</strong> són omnipotents. Calvin Coolidge.</p>
</blockquote>
<p>La <strong>perseverància</strong> és el seguell distintiu de l’èxit.</p>
<p>Dues qualitats essencials <strong>Orison Swett Marden</strong>:</p>
<ul>
<li>Posat mans a l’obra.</li>
<li>Segueix mans a l’obra.</li>
</ul>
<blockquote>
<p>No existeix el fracàs per a qui es dona compte del seu poder, per a qui no sap que està vençut; no hi ha fracàs per a l’obstinació; la voluntat inconquistable. No hi ha fracàs per a l’home que s’alça cada vegada que cau, que rebota com una pilota de goma, que persisteix quan tots els demés abandonen, que segueix avant quan tots els demés tornen arrere.</p>
</blockquote>
<p>Tots entropecem amb dificultats a cada pas del camí. La diferència entre els que consegueixen grans resultats i els que no ho fan és, simplement, que els primers utilitzen l’adversitat i la lluita per a crèixer, mentre que els segons permeten que les dificultats i l’adversitat els abrumen i els deixen desanimats i abatuts.</p>
<p><strong>La nostra major glòria no està en no caure mai, sino en alçar-nos cada vegada que caiguem</strong>. Confucio.</p>
<ul>
<li>James J. Corbett.</li>
<li>Elbert Hubbard.</li>
<li>Vince Lombardi.</li>
</ul>
<p>La <strong>perseverància</strong> és el <strong>seu major actiu</strong>.</p>
<blockquote>
<p>L’èxit sembla estar connectat a l’acció. Els triomfadors es mantenen en marxa. Comenten errades, però no abandonen.</p>
</blockquote>
<h3 id="22-conclusió-actue-hui">22. Conclusió. Actue hui</h3>
<ol>
<li>Allibere el seu potencial.</li>
<li>Prenga el control de la seua vida, no done excuses</li>
<li>Cree el seu propi futur.</li>
<li>Aclarisca els seus valors.</li>
<li>Definisca les seues verdaderes metes, la claredat és esencial.</li>
<li>Decidisca quin és el seu propòsit clar.</li>
<li>Analitze les seues conviccions.</li>
<li>Comence pel principi.</li>
<li>Medisca el seu progrés.</li>
<li>Elimine obstacles.</li>
<li>Arribe a ser un expert en el seu camp.</li>
<li>Associes amb les persones adequades.</li>
<li>Elabore un pla d’acció.</li>
<li>Gestione bé el temps.</li>
<li>Revise les metes del seu diari.</li>
<li>Visualitze les seues metes continuament.</li>
<li>Active la seua ment superconscient.</li>
<li>Romanga flexible en tot moment.</li>
<li>Allibere la seua creativitat innata.</li>
<li>Faça alguna cosa cada dia.</li>
<li>Persevere fins a assolir-ho, decisca per avançat que mai, mai es endirà.</li>
</ol>
<hr />
<p><small>– Brian Tracy. 2003. Metes. Empresa activa.</small></p>
<iframe style="border: none" src="//html5-player.libsyn.com/embed/episode/id/4848366/height/90/width/800/theme/custom/autonext/no/thumbnail/yes/autoplay/no/preload/no/no_addthis/no/direction/backward/render-playlist/no/custom-color/ffbb00/" height="90" width="800" scrolling="no" allowfullscreen="" webkitallowfullscreen="" mozallowfullscreen="" oallowfullscreen="" msallowfullscreen=""></iframe>
<div class="footnotes" role="doc-endnotes">
<ol>
<li id="fn:1" role="doc-endnote">
<p><a href="https://es.wikipedia.org/wiki/Ello,_yo_y_supery%C3%B3">Wikipedia</a> <a href="#fnref:1" class="reversefootnote" role="doc-backlink">↩</a></p>
</li>
</ol>
</div>
|
inclusa/inclusa.github.io
|
_productivity/_site/2017-02-26-47-metes.html
|
HTML
|
mit
| 118,200
|
/**
*
*/
package jmeter;
/**
* @author ricardo
*
*/
public class SeleniumTest {
/**
*
*/
public SeleniumTest() {
}
/**
* @param args
*/
public static void main(String[] args) {
}
/*
* package br.com.zenvia.test;
import java.io.IOException;
import java.lang.reflect.Method;
import java.util.Properties;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
import org.openqa.selenium.chrome.ChromeDriver;
import org.springframework.beans.factory.config.AutowireCapableBeanFactory;
import org.springframework.context.support.ClassPathXmlApplicationContext;
import br.com.zenvia.abtracts.AbstractTest;
public class JMeterTestCase {
@SuppressWarnings("unchecked")
@Test
public void test() throws Exception {
Class<AbstractTest> clazz = (Class<AbstractTest>) Class.forName(System.getProperty("testcase.class"));
for (Method method : clazz.getMethods()) {
if (method.isAnnotationPresent(Test.class)) {
try {
executeMethod(clazz,method);
} catch (Exception e) {
//TODO log error
}
}
}
}
private void executeMethod(Class<AbstractTest> clazz, Method testMethod) throws Exception {
AbstractTest testCase = (AbstractTest) clazz.newInstance();
try {
loadProperties(testCase);
testCase.setDriver(new ChromeDriver());
testCase.setUpClass();
for (Method method : testCase.getClass().getMethods()) {
if (method.isAnnotationPresent(Before.class)) {
method.invoke(testCase);
}
}
testMethod.invoke(testCase);
for (Method method : testCase.getClass().getMethods()) {
if (method.isAnnotationPresent(After.class)) {
method.invoke(testCase);
}
}
testCase.tearDownClass();
}
finally {
if (testCase!=null) {
testCase.getDriver().quit();
}
}
}
private void loadProperties(AbstractTest testCase) throws IOException {
Properties properties = new Properties();
String environmentName = System.getProperty("spring.profiles.active");
properties.load(Thread.currentThread().getContextClassLoader().getResourceAsStream(environmentName.toLowerCase()+".properties"));
testCase.setSystemURL(properties.getProperty("system.url"));
testCase.setTemplate(properties.getProperty("template"));
testCase.setFrom(properties.getProperty("from"));
testCase.setTo(properties.getProperty("to"));
testCase.setGroup(properties.getProperty("group"));
testCase.setGreeting(properties.getProperty("greeting"));
testCase.setSupportUsername(properties.getProperty("support.username"));
testCase.setSupportPassword(properties.getProperty("support.password"));
testCase.setConnectPosAccount(properties.getProperty("connect.account.pos"));
testCase.setConnectPreAccount(properties.getProperty("connect.account.pre"));
testCase.setEngagePosAccount(properties.getProperty("engage.account.pos"));
testCase.setEngageWithouMarketingConfig(properties.getProperty("engage.account.sem"));
testCase.setComunikaAccount(properties.getProperty("comunika.account"));
testCase.setPurebrosAccount(properties.getProperty("purebros.account"));
testCase.setSeconds(Long.parseLong(properties.getProperty("callback.sec")));
testCase.setWindowsPath(properties.getProperty("windows.path"));
testCase.setUnixPath(properties.getProperty("unix.path"));
testCase.setOiGetMO(properties.getProperty("oi.get.mo"));
testCase.setStopMessage(properties.getProperty("system.stop_message"));
}
public JMeterTestCase() {
super();
}
private void loadSpring() {
ClassPathXmlApplicationContext ctx = new ClassPathXmlApplicationContext("applicationContext.xml");
ctx.getAutowireCapableBeanFactory().autowireBeanProperties(this,
AutowireCapableBeanFactory.AUTOWIRE_BY_NAME, true);
}
public JMeterTestCase(String test) {
this();
}
}
*/
}
|
ricardobaumann/jmeter_web_app_test
|
src/main/java/jmeter/SeleniumTest.java
|
Java
|
mit
| 3,941
|
# Be sure to restart your server when you modify this file.
# Version of your assets, change this if you want to expire all your assets.
Rails.application.config.assets.version = '1.0'
# Precompile additional assets.
# application.js, application.css, and all non-JS/CSS in app/assets folder are already added.
Rails.application.config.assets.precompile += %w( unauthorized.css )
|
rcsole/iron-alumni
|
config/initializers/assets.rb
|
Ruby
|
mit
| 382
|
---
layout: note
reader-title: 使用 asciinema 制作命令行回放
title: asciinema-demo
category: demo
date: 2015-07-30
draft: true
---
实例，展示 ls 的用法。
<script type="text/javascript" src="https://asciinema.org/a/19596.js" id="asciicast-19596" async></script>
|
pimgeek/pimgeek.github.io
|
_jksrc/_notes/asciinema-demo.md
|
Markdown
|
mit
| 281
|
# py2mysql.py
### Dependency
---
* mysql.connector [PyPi](https://pypi.python.org/pypi/mysql-connector)
### Constructor
---
```python
#
# desc : constructor
# inpt :
# |- host : host IP or URI
# |- port : mysql port
# |- user : service user
# |- pwd : login password
# |- dbname : default database name
#
def __init__(self, host, port, user, pwd, dbname):
```
### API
---
```python
#
# desc : get conection status
# inpt : none
# retn : { "state" : [success|failure|warning], "info" : "message", "data" : []}
#
def checkConnectionValid()
#
# desc : execute sql command
# inpt :
# |- sqlCmd : "SELECT first_name, hire_date FROM employees WHERE hire_date BETWEEN %s AND %s"
# |- parameterInSeq (tuple) : (datetime.date(1999, 1, 1), datetime.date(1999, 12, 31))
# |- isQueryFlag : {True|False}
# |- asdict (return as dictionary) : {True|False}
#
def execsql(sqlCmd, parameterInSeq, isQueryFlag, asdict=True)
```
### Example
---
```python
# desc : connect to the mysql server
py2my = py2mysql("127.0.0.1", "3306", "user", "password", "database_name")
print py2my.checkConnectionValid()
# desc : query data
queryData = py2my.execsql("select * from table where year = %s limit 10;", (2000,), True, True)
dictRes(queryData)
# desc : insert data
insertData = py2my.execsql("insert into table (year, week, value) values (%s, %s, %s);", (2000, 1, 'value'), False, False)
print insertData
# desc : update data
updateData = py2my.execsql("update table set value = %s where year = %s and week = %s;", ('new_value', 2000, 1), False, False)
print updateData
# desc : delete data
deleteData = py2my.execsql("delete from table where year = %s and week = %s;", (2000, 1), False, False)
print deleteData
```
|
jiankaiwang/seed
|
python/py2mysqlpy.md
|
Markdown
|
mit
| 1,727
|
const _ = require('lodash');
const fs = require('fs');
module.exports = (path, validationFailures) => {
let jsonRaw;
let json;
try {
jsonRaw = fs.readFileSync(path);
}
catch (err) {
if (err.code === 'ENOENT') {
validationFailures.push(`Cannot find "${path}"`);
}
else {
throw err;
}
}
if (!_.isUndefined(jsonRaw)) {
try {
json = JSON.parse(jsonRaw);
}
catch (err) {
validationFailures.push(`Cannot read "${path}" as JSON: ${err}`);
}
}
return json;
};
|
fluxsauce/dashing-reporter
|
lib/loadJson.js
|
JavaScript
|
mit
| 533
|
#!/usr/bin/ruby -wKU
# -*- coding: utf-8 -*-
require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
require 'nkf'
describe "Kana" do
it "オプション'n'によって '０'を'0'に変換できること" do
Kana.kana('０','n').should == '0'
end
it "オプション'r'によって 'ａ'を'a'に変換できること" do
Kana.kana('ａ','r').should == 'a'
end
it "オプション'r'によって 'Ａ'を'A'に変換できること" do
Kana.kana('Ａ','r').should == 'A'
end
it "'a'を変換しないこと" do
Kana.kana('a','r').should == 'a'
end
it "オプション'k'によって'ア'を'ｱ'に変換できること" do
Kana.kana('ア','k',:utf8).should == 'ｱ'
end
it "'０ａＡアa'を'0aAｱa'に変換できること" do
Kana.kana('０ａＡアa','nrk',:utf8).should == '0aAｱa'
end
it "EUC-JPの'０ａＡアa'をEUC-JPの'0aAｱa'に変換できること" do
if RUBY_VERSION >= '1.9.1'
Kana.kana('０ａＡアa'.encode(Encoding::EUC_JP),'nrk').should == '0aAｱa'.encode(Encoding::EUC_JP)
else
Kana.kana(NKF.nkf('-m0xWe', '０ａＡアa'),'nrk').should == NKF.nkf('-m0xWe', '0aAｱa')
end
end
it "オプション's'によって全角スペースを半角スペースに変換できること" do
Kana.kana(' ', 's').should == ' '
end
it "オプション'a'によって全角英数字を半角英数字に変換できること" do
Kana.kana('Ａｂｃ ｘｙＺ ０12３','a',:utf8).should == 'Abc xyZ 0123'
end
it "オプション'k'によって全角カタカナを半角カタカナに変換できること" do
Kana.kana('アーヲ','k',:utf8).should == 'ｱｰｦ'
end
it "オプション'h'によって全角ひらがなを半角カタカナに変換できること" do
Kana.kana('あぁん','h',:utf8).should == 'ｱｧﾝ'
end
it "mb_convert_kana(a)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'a').split(//).zip(File.read('spec/data/a.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(A)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'A').split(//).zip(File.read('spec/data/l-a.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(c)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'c').split(//).zip(File.read('spec/data/c.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(C)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'C').split(//).zip(File.read('spec/data/l-c.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(h)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'h').split(//).zip(File.read('spec/data/h.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(H)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'H').split(//).zip(File.read('spec/data/l-h.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(HV)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'HV').split(//).zip(File.read('spec/data/l-hv.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(k)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'k').split(//).zip(File.read('spec/data/k.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(K)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'K').split(//).zip(File.read('spec/data/l-k.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(KV)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'KV').split(//).zip(File.read('spec/data/l-kv.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(ask)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'ask').split(//).zip(File.read('spec/data/ask.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(ASK)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'ASK').split(//).zip(File.read('spec/data/l-ask.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(ASKV)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'ASKV').split(//).zip(File.read('spec/data/l-askv.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(rns)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'rns').split(//).zip(File.read('spec/data/rns.txt').split(//)).each do |got,except|
got.should == except
end
end
it "mb_convert_kana(RNS)と同じ変換をすること" do
$KCODE = 'u' if RUBY_VERSION < '1.9.1'
raw = File.read('spec/data/raw.txt')
Kana.kana(raw, 'RNS').split(//).zip(File.read('spec/data/l-rns.txt').split(//)).each do |got,except|
got.should == except
end
end
end
describe "String" do
describe "kana" do
it "'０'を'0'に変換できること" do
'０'.kana('n').should == '0'
end
end
end
|
miyucy/kana
|
spec/kana_spec.rb
|
Ruby
|
mit
| 6,351
|
/**
* Created by archheretic on 04.04.17.
*/
require("./artifacts/src/root.android.js");
|
Archheretic/ParkingLotTrackerMobileApp
|
index.android.js
|
JavaScript
|
mit
| 90
|
<!DOCTYPE html>
<!--[if IE]><![endif]-->
<html>
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1">
<title>Silo Error Code Monitoring | Microsoft Orleans Documentation </title>
<meta name="viewport" content="width=device-width">
<meta name="title" content="Silo Error Code Monitoring | Microsoft Orleans Documentation ">
<meta name="generator" content="docfx 2">
<link rel="shortcut icon" href="../../../favicon.ico">
<link rel="stylesheet" href="../../../styles/docfx.vendor.css">
<link rel="stylesheet" href="../../../styles/docfx.css">
<link rel="stylesheet" href="../../../styles/main.css">
<meta property="docfx:navrel" content="../../../toc.html">
<meta property="docfx:tocrel" content="../../toc.html">
<meta property="docfx:rel" content="../../../">
</head>
<body data-spy="scroll" data-target="#affix" data-offset="120">
<div id="wrapper">
<header>
<nav id="autocollapse" class="navbar navbar-inverse ng-scope" role="navigation">
<div class="container">
<div class="navbar-header">
<button type="button" class="navbar-toggle" data-toggle="collapse" data-target="#navbar">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a class="navbar-brand" href="../../../index.html">
<img id="logo" class="svg" src="../../../images/logo-light-padded.svg" alt="">
</a>
</div>
<div class="collapse navbar-collapse" id="navbar">
<form class="navbar-form navbar-right" role="search" id="search">
<div class="form-group">
<input type="text" class="form-control" id="search-query" placeholder="Search" autocomplete="off">
</div>
</form>
</div>
</div>
</nav>
<div class="subnav navbar navbar-default">
<div class="container hide-when-search" id="breadcrumb">
<ul class="breadcrumb">
<li></li>
</ul>
</div>
</div>
</header>
<div class="container body-content">
<div id="search-results">
<div class="search-list">Search Results for <span></span></div>
<div class="sr-items">
<p><i class="glyphicon glyphicon-refresh index-loading"></i></p>
</div>
<ul id="pagination" data-first="First" data-prev="Previous" data-next="Next" data-last="Last"></ul>
</div>
</div>
<div role="main" class="container body-content hide-when-search">
<div class="sidenav hide-when-search">
<a class="btn toc-toggle collapse" data-toggle="collapse" href="#sidetoggle" aria-expanded="false" aria-controls="sidetoggle">Show / Hide Table of Contents</a>
<div class="sidetoggle collapse" id="sidetoggle">
<div id="sidetoc"></div>
</div>
</div>
<div class="article row grid-right">
<div class="col-md-10">
<article class="content wrap" id="_content" data-uid="">
<h1 id="silo-error-code-monitoring">Silo Error Code Monitoring</h1>
<table>
<thead>
<tr>
<th>Group</th>
<th>Log Type</th>
<th>Log Code Values</th>
<th>Threshold</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>Azure Problems</td>
<td>Warning or Error</td>
<td>100800 - 100899</td>
<td>Any Error or Warning</td>
<td>Transient problems reading or writing to Azure table store will be logged as Warning. Transient read errors will automatically be retried. A final Error log message means there is a real problem connecting to Azure table storage.</td>
</tr>
<tr>
<td>Membership Connectivity Problems</td>
<td>Warning or Error</td>
<td>100600 - 100699</td>
<td>Any Error or Warning</td>
<td>Warning logs are an early indication of network connectivity problems and/or silo restart / migration. Ping timeouts and silo-dead votes will show up as Warning messages. Silo detecting it was voted dead will show as Error message.</td>
</tr>
<tr>
<td>Grain call timeouts</td>
<td>Warning</td>
<td>100157</td>
<td>Multiple Warnings logged in short space of time</td>
<td>Grain-call timeout problems are generally caused by temporary network connectivity issues or silo restart / reboot problems. The system should recover after a short time (depending on Liveness config settings) at which point Timeouts should clear. Ideally, monitoring for just the bulk log code 600157 variety of these warnings should be sufficient.</td>
</tr>
<tr>
<td>Silo Restart / Migration</td>
<td>Warning</td>
<td>100601 or 100602</td>
<td>Any Warning</td>
<td>Warning printed when silo detects it was restarted on same machine {100602) or migrated to different machine (100601)</td>
</tr>
<tr>
<td>Network Socket Problems</td>
<td>Warning or Error</td>
<td>101000 to 101999, 100307,100015, 100016</td>
<td>Any Error or Warning</td>
<td>Socket disconnects are logged as Warning messages. Problems opening sockets or during message transmission are logged as Errors.</td>
</tr>
<tr>
<td>Grain problems</td>
<td>Warning or Error</td>
<td>101534</td>
<td>Any Error or Warning</td>
<td>Detection of “stuck” requests for non-reentrant grains . The error code is reported every time a request takes longer than 5x request timeout time to execute.</td>
</tr>
</tbody>
</table>
</article>
</div>
<div class="hidden-sm col-md-2" role="complementary">
<div class="sideaffix">
<div class="contribution">
<ul class="nav">
<li>
<a href="https://github.com/dotnet/orleans-docs/blob/master/src/docs/host/monitoring/silo_error_code_monitoring.md/#L1" class="contribution-link">Improve this Doc</a>
</li>
</ul>
</div>
<nav class="bs-docs-sidebar hidden-print hidden-xs hidden-sm affix" id="affix">
<h5>In This Article</h5>
<div></div>
</nav>
</div>
</div>
</div>
</div>
<footer>
<div class="grad-bottom"></div>
<div class="footer">
<div class="container">
<span class="pull-right">
<a href="#top">Back to top</a>
</span>
<span>Generated by <strong>DocFX</strong></span>
</div>
</div>
</footer>
</div>
<script type="text/javascript" src="../../../styles/docfx.vendor.js"></script>
<script type="text/javascript" src="../../../styles/docfx.js"></script>
<script type="text/javascript" src="../../../styles/main.js"></script>
</body>
</html>
|
ReubenBond/reubenbond.github.io
|
drafts/test/docs/host/monitoring/silo_error_code_monitoring.html
|
HTML
|
mit
| 6,938
|
package kpc.common.utils;
import java.util.Arrays;
public class ArgsParserTest {
public void testParse()
throws Exception {
System.out.println(Arrays.toString(ArgsParser.parse("\"Hello World\" \"Test World\"")));
}
}
|
BBoldt/KPComputers
|
src/test/java/kpc/common/utils/ArgsParserTest.java
|
Java
|
mit
| 239
|
module AlexaRuby
# Response for Amazon Alexa service request
class Response
# Initialize new response
#
# @param request_type [Symbol] AlexaRuby::Request type
# @param version [String] Amazon Alexa SDK version
def initialize(request_type, version = '1.0')
@req_type = request_type
@resp = {
version: version,
sessionAttributes: {},
response: { shouldEndSession: true }
}
end
# Add one session attribute
#
# @param key [String] atrribute key
# @param value [String] attribute value
# @param rewrite [Boolean] rewrite if key already exists?
# @raise [ArgumentError] if session key is already added and
# rewrite is set to false
def add_session_attribute(key, value, rewrite = false)
session_attribute(key, value, rewrite)
end
# Add pack of session attributes and overwrite all existing ones
#
# @param attributes [Hash] pack of session attributes
# @raise [ArgumentError] if given paramter is not a Hash object
def add_session_attributes(attributes)
unless attributes.is_a? Hash
raise ArgumentError, 'Attributes must be a Hash'
end
session_attributes(attributes, false)
end
# Add pack of session attributes to existing ones
#
# @param attributes [Hash] pack of session attributes
# @raise [ArgumentError] if given paramter is not a Hash object
def merge_session_attributes(attributes)
unless attributes.is_a? Hash
raise ArgumentError, 'Attributes must be a Hash'
end
session_attributes(attributes, true)
end
# Add card to response object
#
# @param params [Hash] card parameters:
# type [String] card type, can be "Simple", "Standard" or "LinkAccount"
# title [String] card title
# content [String] card content (line breaks must be already included)
# small_image_url [String] an URL for small card image
# large_image_url [String] an URL for large card image
# @raise [ArgumentError] if card is not allowed
def add_card(params = {})
card_exception unless %i[launch intent].include? @req_type
card = Card.new(params)
@resp[:response][:card] = card.obj
end
# Add AudioPlayer directive
#
# @param directive [String] audio player directive type,
# can be :start or :stop
# @param params [Hash] optional request parameters:
# url [String] streaming URL
# token [String] streaming service token
# offset [Integer] playback offset
# replace_all [Boolean] true if stream must replace all previous
def add_audio_player_directive(directive, params = {})
@resp[:response][:directives] = [
case directive.to_sym
when :start
AudioPlayer.new.play(params)
when :stop
AudioPlayer.new.stop
when :clear
AudioPlayer.new.clear_queue(params[:clear_behavior])
end
]
end
# Return JSON version of current response state
#
# @return [JSON] response object
def json
Oj.to_json(@resp)
end
# Tell something to Alexa user and close conversation.
# Method will only add a given speech to response object
#
# @param speech [Sring] output speech
# @param reprompt_speech [String] output speech if user remains idle
# @param ssml [Boolean] is it an SSML speech or not
def tell(speech, reprompt_speech = nil, ssml = false)
obj = { outputSpeech: build_speech(speech, ssml) }
if reprompt_speech
obj[:reprompt] = { outputSpeech: build_speech(reprompt_speech, ssml) }
end
@resp[:response].merge!(obj)
end
# Tell something to Alexa user and close conversation.
# Method will add given sppech to response object and
# immediately return its JSON implementation
#
# @param speech [Sring] output speech
# @param reprompt_speech [String] output speech if user remains idle
# @param ssml [Boolean] is it an SSML speech or not
# @return [JSON] ready to use response object
def tell!(speech, reprompt_speech = nil, ssml = false)
obj = { outputSpeech: build_speech(speech, ssml) }
if reprompt_speech
obj[:reprompt] = { outputSpeech: build_speech(reprompt_speech, ssml) }
end
@resp[:response].merge!(obj)
json
end
# Ask something from user and wait for further information.
# Method will only add given sppech to response object and
# set "shouldEndSession" parameter to false
#
# @param speech [Sring] output speech
# @param reprompt_speech [String] output speech if user remains idle
# @param ssml [Boolean] is it an SSML speech or not
def ask(speech, reprompt_speech = nil, ssml = false)
@resp[:response][:shouldEndSession] = false
tell(speech, reprompt_speech, ssml)
end
# Ask something from user and wait for further information.
# Method will only add given sppech to response object,
# set "shouldEndSession" parameter to false and
# immediately return response JSON implementation
#
# @param speech [Sring] output speech
# @param reprompt_speech [String] output speech if user remains idle
# @param ssml [Boolean] is it an SSML speech or not
# @return [JSON] ready to use response object
def ask!(speech, reprompt_speech = nil, ssml = false)
@resp[:response][:shouldEndSession] = false
tell!(speech, reprompt_speech, ssml)
end
private
# Add one session attribute
#
# @param key [String] atrribute key
# @param value [String] attribute value
# @param rewrite [Boolean] rewrite if key already exists?
# @raise [ArgumentError] if session key is already added and
# rewrite is set to false
def session_attribute(key, value, rewrite = false)
unless rewrite
if @resp[:sessionAttributes].key?(key)
raise ArgumentError, 'Duplicate session attributes not allowed'
end
end
@resp[:sessionAttributes][key] = value
end
# Add pack of session attributes.
# By default all existing session attributes would be overwritten
#
# @param attributes [Hash] pack of session attributes
# @param merge [Boolean] merge attributes with existing ones?
def session_attributes(attributes, merge)
rewrite = true
unless merge
@resp[:sessionAttributes] = {}
rewrite = false
end
attributes.each { |k, v| session_attribute(k, v, rewrite) }
end
# Build speech object
#
# @param speech [Sring] output speech
# @param ssml [Boolean] is it an SSML speech or not
# @return [Hash] speech object
def build_speech(speech, ssml)
obj = { type: ssml ? 'SSML' : 'PlainText' }
ssml ? obj[:ssml] = fix_ssml(speech) : obj[:text] = speech
obj
end
# Forced fix of SSML speech - manually check and fix open and close tags
#
# @param text [String] SSML response speech
# @return [String] fixed SSML speech
def fix_ssml(text)
open_tag = text.strip[0..6]
close_tag = text.strip[-8..1]
text = open_tag == '<speak>' ? text : "<speak>#{text}"
close_tag == '</speak>' ? text : "#{text}</speak>"
end
# Raise card exception
#
# @raise [ArgumentError] if card is not allowed
def card_exception
raise ArgumentError, 'Card can only be included in response ' \
'to a "LaunchRequest" or "IntentRequest"'
end
end
end
|
mulev/alexa-ruby
|
lib/alexa_ruby/response/response.rb
|
Ruby
|
mit
| 7,547
|
# encoding: UTF-8
# Some monkeypatches to the `Integer` class.
class Integer
# Convert this number to a given `base`.
# @param (see Bases::Number#to_base)
# @return [String]
# @see Bases::Number#to_base
def to_base(base, opts = {})
Bases.val(self).to_base(base, opts)
end
# Convert this number in binary form.
# @return [String]
# @see Bases::Number#to_binary
def to_binary
to_base(2)
end
# Convert this number in hexadecimal form.
# @return [String]
# @see Bases::Number#to_hex
def to_hex
to_base(16)
end
end
|
whatyouhide/bases
|
lib/bases/monkeypatches/integer.rb
|
Ruby
|
mit
| 557
|
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace _03.Animals
{
public class Dog
{
public string Name { get; set; }
public int Age { get; set; }
public int NumberOfLegs { get; set; }
public static void ProduceSound()
{
Console.WriteLine("I'm a Distinguishedog, and I will now produce a distinguished sound! Bau Bau.");
}
}
}
|
vankatalp360/Programming-Fundamentals-2017
|
Objects and Simple Classes - More Exercises/03. Animals/Dog.cs
|
C#
|
mit
| 486
|
---
layout: post
unique_id: visitors
title: Visitors
categories: []
locations:
---
YESTERDAY:
* interview! yay $$
* korean fried chicken!
* board game night at friend's place
* betrayal at house in the hill
* also tsuro!
* re-wrote mobile app data queue at 1 am
* simplified a ton of promise chaining :P
TODAY:
* final onboarding interview! yay
* soup for lunch (too much fried chicken yesterday)
* went to SF to work out of a garage
* went for a run
* made two batches of dumplings!
* picked up friend from airport
LEARNINGS:
* gotta freeze the dumplings before boiling them to make sure they stay together!
|
wko27/blog
|
_daily/2017-09-29-Visitors.md
|
Markdown
|
mit
| 619
|
package model;
public class InputInfo {
private String compiler_version;
private String language;
private String code_text;
private String compiler_option;
public String getCompiler_version() {
return compiler_version;
}
public void setCompiler_version(String compiler_version) {
this.compiler_version = compiler_version;
}
public String getLanguage() {
return language;
}
public void setLanguage(String language) {
this.language = language;
}
public String getCode_text() {
return code_text;
}
public void setCode_text(String code_text) {
this.code_text = code_text;
}
public String getCompiler_option() {
return compiler_option;
}
public void setCompiler_option(String compiler_option) {
this.compiler_option = compiler_option;
}
}
|
GainSury/eClang
|
src/model/InputInfo.java
|
Java
|
mit
| 884
|
<!DOCTYPE html>
<html class="no-js " lang="zh">
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1" />
<meta name="keywords" content="jQuery,API,中文,jquery api,1.11,map(callback)"/>
<meta name="description" content="jQuery API 1.12.0 中文手册最新版，在线地址：http://jquery.cuishifeng.cn"/>
<meta name="robots" content="all">
<meta name="renderer" content="webkit">
<meta name="author" content="Shifone -http://jquery.cuishifeng.cn"/>
<meta name="viewport" content="width=device-width, initial-scale=1">
<title>map(callback) | jQuery API 3.1.0 中文文档 | jQuery API 在线手册</title>
<link rel="shortcut icon" href="images/favicon.ico">
<link rel="stylesheet" href="css/common.css?v=20151229">
</head>
<body >
<!--[if lt IE 9]>
<div class="browser-happy">
<div class="content">
<p>作为前端开发人员，还有这么low的浏览器，再不更新会遭鄙视的～～</p>
<a href="http://browsehappy.com/">立即更新</a>
</div>
</div>
<![endif]-->
<div class="main-container" >
<div id="main-wraper" class="main-wraper">
<div id="tips-con" style="display: block;" data-key="content-bkc">
<div id="tips-body" class="tips-body">推荐办理招商信用卡，新户开卡礼，积分享美食，更可获得4G可通话平板一台~<a href="http://www.cuishifeng.cn/go/card" target="_blank">click here</a></div>
</div>
<header class="top-nav">
<a href="index.html" class="pc" title="">首页</a> > <span class="sub-title">筛选</span> > map(callback)
<a class="source" href="source.html">源码下载</a>
</header>
<div id="content" >
<h2><span>返回值:jQuery</span>map(callback)</h2>
<h3>概述</h3>
<div class="desc">
<p>将一组元素转换成其他数组（不论是否是元素数组）</p>
<div class="longdesc">
<p>你可以用这个函数来建立一个列表，不论是值、属性还是CSS样式，或者其他特别形式。这都可以用'$.map()'来方便的建立。</p>
</div>
</div>
<h3>参数</h3>
<div class="parameter">
<h4><strong>callback</strong><span>Function</span><em>V1.2</em></h4>
<p>给每个元素执行的函数</p>
</div>
<div class="example">
<h3>示例</h3>
<span id="f_ad2"></span>
<h4>描述:</h4>
<p>把form中的每个input元素的值建立一个列表。</p>
<h5>HTML 代码:</h5>
<pre><code><p><b>Values: </b></p>
<form>
<input type="text" name="name" value="John"/>
<input type="text" name="password" value="password"/>
<input type="text" name="url" value="http://ejohn.org/"/>
</form></code></pre>
<h5>jQuery 代码:</h5>
<pre><code>$("p").append( $("input").map(function(){
return $(this).val();
}).get().join(", ") );</code></pre>
<h5>结果:</h5>
<pre><code>[ <p>John, password, http://ejohn.org/</p> ]</code></pre>
</div>
</div>
<div class="navigation clearfix">
<span class="alignleft">上一篇：<a href="is.html">is(expr|obj|ele|fn)</a></span>
<span class="alignright">下一篇：<a href="has.html">has(expr|ele)</a></span>
</div>
<div class="donate-con">
<div class="donate-btn">捐助</div>
<div class="donate-body">
<div class="donate-tips">本站为非盈利网站，所有的捐赠收入将用于支付带宽、服务器费用，您的支持将是本站撑下去的最大动力！</div>
<div class="donate-img"> <a href="source.html"><img src="images/qr_code.png" height="350" width="350" alt=""></a> </div>
</div>
</div>
</div><!-- main-wraper end -->
<footer id="footer-con" class="footer" style="display:none;" >
<p id="footer">Copyright © <a href="http://www.cuishifeng.cn" target="_blank">Shifone</a> 2012 - 2016 All rights reserved. </p>
</footer>
</div><!-- main -container end -->
<aside class="left-panel left-panel-hide" id="left-panel">
<div class="auto-query-con" >
<input type="text" name="query" id="autoquery" placeholder="请输入关键字"/>
</div>
<nav class="navigation">
<ul id="main-menu" class="main-menu">
<li class="">
<a class="menu-title" id="dashboard-menu" href="index.html">
<i class="fa fa-home"></i><span class="nav-label">Dashboard</span>
</a>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">核心</span>
</a>
<ul class="sub-menu">
<li><a href="jQuery_selector_context.html">jQuery([sel,[context]])</a></li>
<li><a href="jQuery_html_ownerDocument.html">jQuery(html,[ownerDoc])</a><sup>1.8*</sup></li>
<li><a href="jQuery_callback.html">jQuery(callback)</a></li>
<li><a href="jQuery.holdReady.html">jQuery.holdReady(hold)</a><sup>1.6+</sup></li>
<li><a href="each.html">each(callback)</a></li>
<li><a href="size.html">size()</a></li>
<li><a href="length.html">length</a></li>
<li><a href="selector.html">selector</a></li>
<li><a href="context.html">context</a></li>
<li><a href="get.html">get([index])</a></li>
<li><a href="index_1.html">index([selector|element])</a></li>
<li><a href="data.html">data([key],[value])</a></li>
<li><a href="removeData.html">removeData([name|list])</a><sup>1.7*</sup></li>
<li><a href="jQuery.data.html"><del>$.data(ele,[key],[val])</del></a><sup>1.8-</sup></li>
<li><a href="queue.html" title="queue(element,[queueName])">queue(e,[q])</a></li>
<li><a href="dequeue.html" title="dequeue([queueName])">dequeue([queueName])</a></li>
<li><a href="clearQueue.html" title="clearQueue([queueName])">clearQueue([queueName])</a></li>
<li><a href="jQuery.fn.extend.html">jQuery.fn.extend(object)</a></li>
<li><a href="jQuery.extend_object.html">jQuery.extend(object)</a></li>
<li><a href="jQuery.noConflict.html" title="jQuery.noConflict([extreme])">jQuery.noConflict([ex])</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">选择器</span>
</a>
<ul class="sub-menu">
<li><a href="id.html">#id</a></li>
<li><a href="element.html">element</a></li>
<li><a href="class.html">.class</a></li>
<li><a href="all.html">*</a></li>
<li><a href="multiple.html">selector1,selector2,selectorN</a></li>
<li><a href="descendant.html">ancestor descendant</a></li>
<li><a href="child.html">parent > child</a></li>
<li><a href="next_1.html">prev + next</a></li>
<li><a href="siblings_1.html">prev ~ siblings</a></li>
<li><a href="first_1.html">:first</a></li>
<li><a href="not_1.html">:not(selector)</a></li>
<li><a href="even.html">:even</a></li>
<li><a href="odd.html">:odd</a></li>
<li><a href="eq_1.html">:eq(index)</a></li>
<li><a href="gt.html">:gt(index)</a></li>
<li><a href="lang.html">:lang</a><sup>1.9+</sup></li>
<li><a href="last_1.html">:last</a></li>
<li><a href="lt.html">:lt(index)</a></li>
<li><a href="header.html">:header</a></li>
<li><a href="animated.html">:animated</a></li>
<li><a href="focus_1.html">:focus</a><sup>1.6+</sup></li>
<li><a href="root.html">:root</a><sup>1.9+</sup></li>
<li><a href="target.html">:target</a><sup>1.9+</sup></li>
<li><a href="contains.html">:contains(text)</a></li>
<li><a href="empty_1.html">:empty</a></li>
<li><a href="has_1.html">:has(selector)</a></li>
<li><a href="parent_1.html">:parent</a></li>
<li><a href="hidden_1.html">:hidden</a></li>
<li><a href="visible.html">:visible</a></li>
<li><a href="attributeHas.html">[attribute]</a></li>
<li><a href="attributeEquals.html">[attribute=value]</a></li>
<li><a href="attributeNotEqual.html">[attribute!=value]</a></li>
<li><a href="attributeStartsWith.html">[attribute^=value]</a></li>
<li><a href="attributeEndsWith.html">[attribute$=value]</a></li>
<li><a href="attributeContains.html">[attribute*=value]</a></li>
<li><a href="attributeMultiple.html">[attrSel1][attrSel2][attrSelN]</a></li>
<li><a href="firstChild.html">:first-child</a></li>
<li><a href="firstOfType.html">:first-of-type</a><sup>1.9+</sup></li>
<li><a href="lastChild.html">:last-child</a></li>
<li><a href="lastOfType.html">:last-of-type</a><sup>1.9+</sup></li>
<li><a href="nthChild.html">:nth-child</a></li>
<li><a href="nthLastChild.html">:nth-last-child</a><sup>1.9+</sup></li>
<li><a href="nthLastOfType.html">:nth-last-of-type</a><sup>1.9+</sup></li>
<li><a href="nthOfType.html">:nth-of-type</a><sup>1.9+</sup></li>
<li><a href="onlyChild.html">:only-child</a></li>
<li><a href="onlyOfType.html">:only-of-type</a><sup>1.9+</sup></li>
<li><a href="input.html">:input</a></li>
<li><a href="text_1.html">:text</a></li>
<li><a href="password.html">:password</a></li>
<li><a href="radio.html">:radio</a></li>
<li><a href="checkbox.html">:checkbox</a></li>
<li><a href="submit_1.html">:submit</a></li>
<li><a href="image.html">:image</a></li>
<li><a href="reset.html">:reset</a></li>
<li><a href="button.html">:button</a></li>
<li><a href="file_1.html">:file</a></li>
<li><a href="enabled_1.html">:enabled</a></li>
<li><a href="disabled_1.html">:disabled</a></li>
<li><a href="checked_1.html">:checked</a></li>
<li><a href="selected_1.html">:selected</a></li>
<li><a href="jQuery.escapeSelector.html">$.escapeSelector(selector)</a><sup>3.0+</sup></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">Ajax</span>
</a>
<ul class="sub-menu">
<li><a href="jQuery.Ajax.html">$.ajax(url,[settings])</a></li>
<li><a href="load.html">load(url,[data],[callback])</a></li>
<li><a href="jQuery.get.html">$.get(url,[data],[fn],[type])</a></li>
<li><a href="jQuery.getJSON.html">$.getJSON(url,[data],[fn])</a></li>
<li><a href="jQuery.getScript.html">$.getScript(url,[callback])</a></li>
<li><a href="jQuery.post.html">$.post(url,[data],[fn],[type])</a></li>
<li><a href="ajaxComplete.html">ajaxComplete(callback)</a></li>
<li><a href="ajaxError.html">ajaxError(callback)</a></li>
<li><a href="ajaxSend.html">ajaxSend(callback)</a></li>
<li><a href="ajaxStart.html">ajaxStart(callback)</a></li>
<li><a href="ajaxStop.html">ajaxStop(callback)</a></li>
<li><a href="ajaxSuccess.html">ajaxSuccess(callback)</a></li>
<li><a href="jQuery.ajaxPrefilter.html">$.ajaxPrefilter([type],fn)</a></li>
<li><a href="jQuery.ajaxSetup.html">$.ajaxSetup([options])</a></li>
<li><a href="serialize.html">serialize()</a></li>
<li><a href="serializearray.html">serializearray()</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">属性</span>
</a>
<ul class="sub-menu">
<li><a href="attr.html" title="attr(name|properties|key,value|fn)">attr(name|pro|key,val|fn)</a></li>
<li><a href="removeAttr.html">removeAttr(name)</a></li>
<li><a href="prop.html" title="prop(name|properties|key,value|fn)">prop(n|p|k,v|f)</a><sup>1.6+</sup></li>
<li><a href="removeProp.html">removeProp(name)</a><sup>1.6+</sup></li>
<li><a href="addClass.html">addClass(class|fn)</a></li>
<li><a href="removeClass.html">removeClass([class|fn])</a></li>
<li><a href="toggleClass.html">toggleClass(class|fn[,sw])</a></li>
<li><a href="html.html">html([val|fn])</a></li>
<li><a href="text.html">text([val|fn])</a></li>
<li><a href="val.html">val([val|fn|arr])</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">CSS</span>
</a>
<ul class="sub-menu">
<li><a href="css.html" title="css(name|properties|[,value|fn])">css(name|pro|[,val|fn])</a><sup>1.9*</sup></li>
<li><a href="jQuery.cssHooks.html">jQuery.cssHooks</a></li>
<li><a href="offset.html">offset([coordinates])</a></li>
<li><a href="position.html">position()</a></li>
<li><a href="scrollTop.html">scrollTop([val])</a></li>
<li><a href="scrollLeft.html">scrollLeft([val])</a></li>
<li><a href="height.html">heigh([val|fn])</a></li>
<li><a href="width.html">width([val|fn])</a></li>
<li><a href="innerHeight.html">innerHeight()</a></li>
<li><a href="innerWidth.html">innerWidth()</a></li>
<li><a href="outerHeight.html">outerHeight([soptions])</a></li>
<li><a href="outerWidth.html">outerWidth([options])</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">文档处理</span>
</a>
<ul class="sub-menu">
<li><a href="append.html">append(content|fn)</a></li>
<li><a href="appendTo.html">appendTo(content)</a></li>
<li><a href="prepend.html">prepend(content|fn)</a></li>
<li><a href="prependTo.html">prependTo(content)</a></li>
<li><a href="after.html">after(content|fn)</a></li>
<li><a href="before.html">before(content|fn)</a></li>
<li><a href="insertAfter.html">insertAfter(content)</a></li>
<li><a href="insertBefore.html">insertBefore(content)</a></li>
<li><a href="wrap.html" title="wrap(html|element|fn)">wrap(html|ele|fn)</a></li>
<li><a href="unwrap.html">unwrap()</a></li>
<li><a href="wrapAll.html" title="wrapall(html|element)">wrapall(html|ele)</a></li>
<li><a href="wrapInner.html" title="wrapInner(html|element|fn)">wrapInner(html|ele|fn)</a></li>
<li><a href="replaceWith.html">replaceWith(content|fn)</a></li>
<li><a href="replaceAll.html">replaceAll(selector)</a></li>
<li><a href="empty.html">empty()</a></li>
<li><a href="remove.html">remove([expr])</a></li>
<li><a href="detach.html">detach([expr])</a></li>
<li><a href="clone.html">clone([Even[,deepEven]])</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">筛选</span>
</a>
<ul class="sub-menu">
<li><a href="eq.html">eq(index|-index)</a></li>
<li><a href="first.html">first()</a></li>
<li><a href="last.html">last()</a></li>
<li><a href="hasClass.html">hasClass(class)</a></li>
<li><a href="filter.html" title="filter(expr|object|element|fn)">filter(expr|obj|ele|fn)</a></li>
<li><a href="is.html" title="is(expr|object|element|fn)">is(expr|obj|ele|fn)</a><sup>1.6*</sup></li>
<li><a href="map.html">map(callback)</a></li>
<li><a href="has.html" title="has(expr|element)">has(expr|ele)</a></li>
<li><a href="not.html" title="not(expr|element|fn)">not(expr|ele|fn)</a></li>
<li><a href="slice.html" title="slice(start,[end])">slice(start,[end])</a></li>
<li><a href="children.html">children([expr])</a></li>
<li><a href="closest.html" title="closest(expr,[context]|object|element)">closest(e|o|e)</a><sup>1.7*</sup></li>
<li><a href="find.html" title="find(expr|object|element)">find(e|o|e)</a><sup>1.6*</sup></li>
<li><a href="next.html">next([expr])</a></li>
<li><a href="nextAll.html">nextAll([expr])</a></li>
<li><a href="nextUntil.html" title="nextUntil([expr|element][,filter])">nextUntil([e|e][,f])</a><sup>1.6*</sup></li>
<li><a href="offsetParent.html">offsetParent()</a></li>
<li><a href="parent.html">parent([expr])</a></li>
<li><a href="parents.html">parents([expr])</a></li>
<li><a href="parentsUntil.html" title="parentsUntil([expr|element][,filter])">parentsUntil([e|e][,f])</a><sup>1.6*</sup></li>
<li><a href="prev.html">prev([expr])</a></li>
<li><a href="prevAll.html">prevall([expr])</a></li>
<li><a href="prevUntil.html" title="prevUntil([expr|element][,filter])">prevUntil([e|e][,f])</a><sup>1.6*</sup></li>
<li><a href="siblings.html">siblings([expr])</a></li>
<li><a href="add.html" title="add(expr|element|html|object[,context])">add(e|e|h|o[,c])</a></li>
<li><a href="andSelf.html">andSelf()</a></li>
<li><a href="addBack.html">addBack()</a><sup>1.9+</sup></li>
<li><a href="contents.html">contents()</a></li>
<li><a href="end.html">end()</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">事件</span>
</a>
<ul class="sub-menu">
<li><a href="ready.html">ready(fn)</a></li>
<li><a href="on.html" title="on(events,[selector],[data],fn)">on(eve,[sel],[data],fn)</a><sup>1.7+</sup></li>
<li><a href="off.html" title="off(events,[selector],[data],fn)">off(eve,[sel],[fn])</a><sup>1.7+</sup></li>
<li><a href="bind.html"><del>bind(type,[data],fn)</del></a><sup>3.0-</sup></li>
<li><a href="one.html">one(type,[data],fn)</a></li>
<li><a href="trigger.html">trigger(type,[data])</a></li>
<li><a href="triggerHandler.html">triggerHandler(type, [data])</a></li>
<li><a href="unbind.html" title="unbind(type,[data|fn])"><del>unbind(t,[d|f])</del></a><sup>3.0-</sup></li>
<li><a href="live.html"><del>live(type,[data],fn)</del></a><sup>1.7-</sup></li>
<li><a href="die.html"><del>die(type,[fn])</del></a><sup>1.7-</sup></li>
<li><a href="delegate.html" title="delegate(selector,[type],[data],fn)"><del>delegate(s,[t],[d],fn)</del></a><sup>3.0-</sup></li>
<li><a href="undelegate.html" title="undelegate([selector,[type],fn])"><del>undelegate([s,[t],fn])</del></a><sup>3.0-</sup></li>
<li><a href="hover.html">hover([over,]out)</a></li>
<li><a href="toggle.html">toggle(fn, fn2, [fn3, fn4, ...])</a></li>
<li><a href="blur.html">blur([[data],fn])</a></li>
<li><a href="change.html">change([[data],fn])</a></li>
<li><a href="click.html">click([[data],fn])</a></li>
<li><a href="dblclick_1.html">dblclick([[data],fn])</a></li>
<li><a href="error.html">error([[data],fn])</a></li>
<li><a href="focus.html">focus([[data],fn])</a></li>
<li><a href="focusin.html">focusin([data],fn)</a></li>
<li><a href="focusout.html">focusout([data],fn)</a></li>
<li><a href="keydown.html">keydown([[data],fn])</a></li>
<li><a href="keypress.html">keypress([[data],fn])</a></li>
<li><a href="keyup.html">keyup([[data],fn])</a></li>
<li><a href="mousedown.html">mousedown([[data],fn])</a></li>
<li><a href="mouseenter.html">mouseenter([[data],fn])</a></li>
<li><a href="mouseleave.html">mouseleave([[data],fn])</a></li>
<li><a href="mousemove.html">mousemove([[data],fn])</a></li>
<li><a href="mouseout.html">mouseout([[data],fn])</a></li>
<li><a href="mouseover.html">mouseover([[data],fn])</a></li>
<li><a href="mouseup.html">mouseup([[data],fn])</a></li>
<li><a href="resize.html">resize([[data],fn])</a></li>
<li><a href="scroll.html">scroll([[data],fn])</a></li>
<li><a href="select.html">select([[data],fn])</a></li>
<li><a href="submit.html">submit([[data],fn])</a></li>
<li><a href="unload.html">unload([[data],fn])</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">效果</span>
</a>
<ul class="sub-menu">
<li><a href="show.html" title="show([speed,[easing],[fn]])">show([s,[e],[fn]])</a></li>
<li><a href="hide.html" title="hide([speed,[easing],[fn]])">hide([s,[e],[fn]])</a></li>
<li><a href="toggle.html" title="toggle([speed],[easing],[fn])">toggle([s],[e],[fn])</a></li>
<li><a href="slideDown.html" title="slideDown([speed],[easing],[fn])">slideDown([s],[e],[fn])</a></li>
<li><a href="slideUp.html" title="slideUp([speed,[easing],[fn]])">slideUp([s,[e],[fn]])</a></li>
<li><a href="slideToggle.html" title="slideToggle([speed],[easing],[fn])">slideToggle([s],[e],[fn])</a></li>
<li><a href="fadeIn.html" title="fadeIn([speed],[easing],[fn])">fadeIn([s],[e],[fn])</a></li>
<li><a href="fadeOut.html" title="fadeOut([speed],[easing],[fn])">fadeOut([s],[e],[fn])</a></li>
<li><a href="fadeTo.html" title="fadeTo([[speed],opacity,[easing],[fn]])">fadeTo([[s],o,[e],[fn]])</a></li>
<li><a href="fadeToggle.html" title="fadeToggle([speed,[easing],[fn]])">fadeToggle([s,[e],[fn]])</a></li>
<li><a href="animate.html" title="animate(params,[speed],[easing],[fn])">animate(p,[s],[e],[fn])</a><sup>1.8*</sup></li>
<li><a href="stop.html" title="stop([clearQueue],[jumpToEnd])">stop([c],[j])</a><sup>1.7*</sup></li>
<li><a href="delay.html" title="delay(duration,[queueName])">delay(d,[q])</a></li>
<li><a href="finish.html" title="finish([queue])">finish([queue])</a><sup>1.9+</sup></li>
<li><a href="jQuery.fx.off.html">jQuery.fx.off</a></li>
<li><a href="jQuery.fx.interval.html">jQuery.fx.interval</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">工具</span>
</a>
<ul class="sub-menu">
<li><a href="jQuery.support.html">$.support</a></li>
<li><a href="jQuery.browser.html"><del>$.browser</del></a><sup>1.9-</sup></li>
<li><a href="jQuery.browser.version.html">$.browser.version</a></li>
<li><a href="jQuery.boxModel.html"><del>$.boxModel</del></a></li>
<li><a href="jQuery.each.html">$.each(object,[callback])</a></li>
<li><a href="jQuery.extend.html">$.extend([d],tgt,obj1,[objN])</a></li>
<li><a href="jQuery.grep.html">$.grep(array,fn,[invert])</a></li>
<li><a href="jQuery.sub.html"><del>$.sub()</del></a><sup>1.9-</sup></li>
<li><a href="jQuery.when.html">$.when(deferreds)</a></li>
<li><a href="jQuery.makeArray.html">$.makeArray(obj)</a></li>
<li><a href="jQuery.map.html">$.map(arr|obj,callback)</a><sup>1.6*</sup></li>
<li><a href="jQuery.inArray.html">$.inArray(val,arr,[from])</a></li>
<li><a href="jQuery.toArray.html">$.toArray()</a></li>
<li><a href="jQuery.merge.html">$.merge(first,second)</a></li>
<li><a href="jQuery.unique.html"><del>$.unique(array)</del></a><sup>3.0-</sup></li>
<li><a href="jQuery.uniqueSort.html">$.uniqueSort(array)</a><sup>3.0+</sup></li>
<li><a href="jQuery.parseJSON.html"><del>$.parseJSON(json)</del></a><sup>3.0-</sup></li>
<li><a href="jQuery.parseXML.html">$.parseXML(data)</a></li>
<li><a href="jQuery.noop.html">$.noop</a></li>
<li><a href="jQuery.proxy.html">$.proxy(function,context)</a></li>
<li><a href="jQuery.contains.html" title="$.contains(container,contained)">$.contains(c,c)</a></li>
<li><a href="jQuery.type.html">$.type(obj)</a></li>
<li><a href="jQuery.isArray.html">$.isArray(obj)</a></li>
<li><a href="jQuery.isFunction.html">$.isFunction(obj)</a></li>
<li><a href="jQuery.isEmptyObject.html">$.isEmptyObject(obj)</a></li>
<li><a href="jQuery.isPlainObject.html">$.isPlainObject(obj)</a></li>
<li><a href="jQuery.isWindow.html">$.isWindow(obj)</a></li>
<li><a href="jQuery.isNumeric.html">$.isNumeric(value)</a><sup>1.7+</sup></li>
<li><a href="jQuery.trim.html">$.trim(str)</a></li>
<li><a href="jQuery.param.html">$.param(obj,[traditional])</a></li>
<li><a href="jQuery.error.html">$.error(message)</a></li>
<li><a href="jquery.html">$.fn.jquery</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">事件对象</span>
</a>
<ul class="sub-menu">
<li><a href="event.currentTarget.html">eve.currentTarget</a></li>
<li><a href="event.data.html">eve.data</a></li>
<li><a href="event.delegateTarget.html">eve.delegateTarget</a><sup>1.7+</sup></li>
<li><a href="event.isDefaultPrevented.html">eve.isDefaultPrevented()</a></li>
<li><a href="event.isImmediatePropagationStopped.html" title="event.isImmediatePropagationStopped">eve.isImmediatePropag...()</a></li>
<li><a href="event.isPropagationStopped.html">eve.isPropagationStopped()</a></li>
<li><a href="event.namespace.html">eve.namespace</a></li>
<li><a href="event.pageX.html">eve.pageX</a></li>
<li><a href="event.pageY.html">eve.pageY</a></li>
<li><a href="event.preventDefault.html">eve.preventDefault()</a></li>
<li><a href="event.relatedTarget.html">eve.relatedTarget</a></li>
<li><a href="event.result.html">eve.result</a></li>
<li><a href="event.stopImmediatePropagation.html" title="event.stopImmediatePropagation">eve.stopImmediatePro...()</a></li>
<li><a href="event.stopPropagation.html">eve.stopPropagation()</a></li>
<li><a href="event.target.html">eve.target</a></li>
<li><a href="event.timeStamp.html">eve.timeStamp</a></li>
<li><a href="event.type.html">eve.type</a></li>
<li><a href="event.which.html">eve.which</a></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">延迟对象</span>
</a>
<ul class="sub-menu">
<li><a href="deferred.done.html" title="deferred.done(doneCallbacks[,doneCallbacks])">def.done(d,[d])</a></li>
<li><a href="deferred.fail.html">def.fail(failCallbacks)</a></li>
<li><a href="deferred.isRejected.html"><del>def.isRejected()</del></a><sup>1.7-</sup></li>
<li><a href="deferred.isResolved.html"><del>def.isResolved()</del></a><sup>1.7-</sup></li>
<li><a href="deferred.reject.html">def.reject(args)</a></li>
<li><a href="deferred.rejectWith.html" title="deferred.rejectWith(context,[args])">def.rejectWith(c,[a])</a></li>
<li><a href="deferred.resolve.html">def.resolve(args)</a></li>
<li><a href="deferred.resolveWith.html" title="deferred.resolveWith(context,[args])">def.resolveWith(c,[a])</a></li>
<li><a href="deferred.then.html" title="deferred.then(doneCallbacks,failCallbacks[, progressCallbacks])">def.then(d[,f][,p])</a><sup>1.8*</sup></li>
<li><a href="deferred.promise.html" title="deferred.promise([type],[target])">def.promise([ty],[ta])</a><sup>1.6+</sup></li>
<li><a href="deferred.pipe.html" title="deferred.pipe([doneFilter],[failFilter],[progressFilter])"><del>def.pipe([d],[f],[p])</del></a><sup>1.8-</sup></li>
<li><a href="deferred.always.html" title="deferred.always(alwaysCallbacks,[alwaysCallbacks])">def.always(al,[al])</a><sup>1.6+</sup></li>
<li><a href="deferred.notify.html">def.notify(args)</a><sup>1.7+</sup></li>
<li><a href="deferred.notifyWith.html" title="deferred.notifyWith(context,[args])">def.notifyWith(c,[a])</a><sup>1.7+</sup></li>
<li><a href="deferred.progress.html" title="deferred.progress(progressCallbacks)">def.progress(proCal)</a><sup>1.7+</sup></li>
<li><a href="deferred.state.html">def.state()</a><sup>1.7+</sup></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">回调函数</span>
</a>
<ul class="sub-menu">
<li><a href="callbacks.add.html">cal.add(callbacks)</a><sup>1.7+</sup></li>
<li><a href="callbacks.disable.html">cal.disable()</a><sup>1.7+</sup></li>
<li><a href="callbacks.empty.html">cal.empty()</a><sup>1.7+</sup></li>
<li><a href="callbacks.fire.html">cal.fire(arguments)</a><sup>1.7+</sup></li>
<li><a href="callbacks.fired.html">cal.fired()</a><sup>1.7+</sup></li>
<li><a href="callbacks.fireWith.html" title="callbacks.fireWith([context] [, args])">cal.fireWith([c] [,a])</a><sup>1.7+</sup></li>
<li><a href="callbacks.has.html">cal.has(callback)</a><sup>1.7+</sup></li>
<li><a href="callbacks.lock.html">cal.lock()</a><sup>1.7+</sup></li>
<li><a href="callbacks.locked.html">cal.locked()</a><sup>1.7+</sup></li>
<li><a href="callbacks.remove.html">cal.remove(callbacks)</a><sup>1.7+</sup></li>
<li><a href="jQuery.callbacks.html">$.callbacks(flags)</a><sup>1.7+</sup></li>
</ul>
</li>
<li class="has-submenu">
<a class="menu-title" href="javascript:void(0);">
<i class="fa fa-leaf"></i> <span class="nav-label">其它</span>
</a>
<ul class="sub-menu">
<li><a href="regexp.html">正则表达式</a></li>
<li><a href="html5.html">HTML5速查表</a></li>
<li><a href="http://www.cuishifeng.cn/go/card">信用卡优惠</a></li>
<li><a href="source.html">源码下载</a></li>
</ul>
</li>
</ul>
</nav>
</aside> <!-- left aside end -->
<script src="js/jquery-2.1.4.min.js?v=20160719"></script>
<script src="js/jquery.autocomplete.min.js?v=20160719"></script>
<script src="js/jquery.mousewheel.min.js?v=20160719"></script>
<script src="js/jquery.mCustomScrollbar.min.js?v=20160719"></script>
<script src="js/shifone.min.js?v=20160719"></script>
<div class="tongji">
<script>
var _hmt = _hmt || [];
(function() {
var hm = document.createElement("script");
hm.src = "//hm.baidu.com/hm.js?bbcf1c00c855ede39d5ad2eac08d2ab7";
var s = document.getElementsByTagName("script")[0];
s.parentNode.insertBefore(hm, s);
})();
</script>
</div>
</body>
</html>
|
shifonecui/shifonecui.github.com
|
map.html
|
HTML
|
mit
| 38,775
|
<?php
/**
* This file is part of the PropelBundle package.
* For the full copyright and license information, please view the LICENSE
* file that was distributed with this source code.
*
* @license MIT License
*/
namespace Propel\PropelBundle\Tests\DataFixtures\Loader;
use Propel\PropelBundle\Tests\DataFixtures\TestCase;
use Propel\PropelBundle\DataFixtures\Loader\YamlDataLoader;
/**
* @author William Durand <william.durand1@gmail.com>
* @author Toni Uebernickel <tuebernickel@gmail.com>
*/
class YamlDataLoaderTest extends TestCase
{
public function testYamlLoadOneToMany()
{
$fixtures = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookAuthor:
BookAuthor_1:
id: '1'
name: 'A famous one'
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\Book:
Book_1:
id: '1'
name: 'An important one'
author_id: BookAuthor_1
YAML;
$filename = $this->getTempFile($fixtures);
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader');
$loader->load(array($filename), 'default');
$books = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookPeer::doSelect(new \Criteria(), $this->con);
$this->assertCount(1, $books);
$book = $books[0];
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookAuthor', $book->getBookAuthor());
}
public function testYamlLoadManyToMany()
{
$schema = <<<XML
<database name="default" package="vendor.bundles.Propel.PropelBundle.Tests.Fixtures.DataFixtures.Loader" namespace="Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader" defaultIdMethod="native">
<table name="table_book" phpName="YamlManyToManyBook">
<column name="id" type="integer" primaryKey="true" />
<column name="name" type="varchar" size="255" />
</table>
<table name="table_author" phpName="YamlManyToManyAuthor">
<column name="id" type="integer" primaryKey="true" />
<column name="name" type="varchar" size="255" />
</table>
<table name="table_book_author" phpName="YamlManyToManyBookAuthor" isCrossRef="true">
<column name="book_id" type="integer" required="true" primaryKey="true" />
<column name="author_id" type="integer" required="true" primaryKey="true" />
<foreign-key foreignTable="table_book" phpName="Book" onDelete="CASCADE" onUpdate="CASCADE">
<reference local="book_id" foreign="id" />
</foreign-key>
<foreign-key foreignTable="table_author" phpName="Author" onDelete="CASCADE" onUpdate="CASCADE">
<reference local="author_id" foreign="id" />
</foreign-key>
</table>
</database>
XML;
$fixtures = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyBook:
Book_1:
id: 1
name: 'An important one'
Book_2:
id: 2
name: 'Les misérables'
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyAuthor:
Author_1:
id: 1
name: 'A famous one'
Author_2:
id: 2
name: 'Victor Hugo'
table_book_authors: [ Book_2 ]
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyBookAuthor:
BookAuthor_1:
book_id: Book_1
author_id: Author_1
YAML;
$filename = $this->getTempFile($fixtures);
$builder = new \PropelQuickBuilder();
$builder->setSchema($schema);
$con = $builder->build();
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader');
$loader->load(array($filename), 'default');
$books = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyBookPeer::doSelect(new \Criteria(), $con);
$this->assertCount(2, $books);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyBook', $books[0]);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyBook', $books[1]);
$authors = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyAuthorPeer::doSelect(new \Criteria(), $con);
$this->assertCount(2, $authors);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyAuthor', $authors[0]);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyAuthor', $authors[1]);
$bookAuthors = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyBookAuthorPeer::doSelect(new \Criteria(), $con);
$this->assertCount(2, $bookAuthors);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyBookAuthor', $bookAuthors[0]);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyBookAuthor', $bookAuthors[1]);
$this->assertEquals('Victor Hugo', $authors[1]->getName());
$this->assertTrue($authors[1]->getBooks()->contains($books[1]));
$this->assertEquals('Les misérables', $authors[1]->getBooks()->get(0)->getName());
}
public function testYamlLoadManyToManyMultipleFiles()
{
$schema = <<<XML
<database name="default" package="vendor.bundles.Propel.PropelBundle.Tests.Fixtures.DataFixtures.Loader" namespace="Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader" defaultIdMethod="native">
<table name="table_book_multiple" phpName="YamlManyToManyMultipleFilesBook">
<column name="id" type="integer" primaryKey="true" />
<column name="name" type="varchar" size="255" />
</table>
<table name="table_author_multiple" phpName="YamlManyToManyMultipleFilesAuthor">
<column name="id" type="integer" primaryKey="true" />
<column name="name" type="varchar" size="255" />
</table>
<table name="table_book_author_multiple" phpName="YamlManyToManyMultipleFilesBookAuthor" isCrossRef="true">
<column name="book_id" type="integer" required="true" primaryKey="true" />
<column name="author_id" type="integer" required="true" primaryKey="true" />
<foreign-key foreignTable="table_book_multiple" phpName="Book" onDelete="CASCADE" onUpdate="CASCADE">
<reference local="book_id" foreign="id" />
</foreign-key>
<foreign-key foreignTable="table_author_multiple" phpName="Author" onDelete="CASCADE" onUpdate="CASCADE">
<reference local="author_id" foreign="id" />
</foreign-key>
</table>
</database>
XML;
$fixtures1 = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBook:
Book_2:
id: 2
name: 'Les misérables'
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesAuthor:
Author_1:
id: 1
name: 'A famous one'
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBookAuthor:
BookAuthor_1:
book_id: Book_1
author_id: Author_1
YAML;
$fixtures2 = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBook:
Book_1:
id: 1
name: 'An important one'
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesAuthor:
Author_2:
id: 2
name: 'Victor Hugo'
table_book_author_multiples: [ Book_2 ]
YAML;
$filename1 = $this->getTempFile($fixtures1);
$filename2 = $this->getTempFile($fixtures2);
$builder = new \PropelQuickBuilder();
$builder->setSchema($schema);
$con = $builder->build();
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader');
$loader->load(array($filename1, $filename2), 'default');
$books = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBookPeer::doSelect(new \Criteria(), $con);
$this->assertCount(2, $books);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBook', $books[0]);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBook', $books[1]);
$authors = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesAuthorPeer::doSelect(new \Criteria(), $con);
$this->assertCount(2, $authors);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesAuthor', $authors[0]);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesAuthor', $authors[1]);
$bookAuthors = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBookAuthorPeer::doSelect(new \Criteria(), $con);
$this->assertCount(2, $bookAuthors);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBookAuthor', $bookAuthors[0]);
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlManyToManyMultipleFilesBookAuthor', $bookAuthors[1]);
$this->assertEquals('Victor Hugo', $authors[1]->getName());
$this->assertTrue($authors[1]->getBooks()->contains($books[1]));
$this->assertEquals('Les misérables', $authors[1]->getBooks()->get(0)->getName());
}
public function testLoadSelfReferencing()
{
$fixtures = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookAuthor:
BookAuthor_1:
id: '1'
name: 'to be announced'
BookAuthor_2:
id: BookAuthor_1
name: 'A famous one'
YAML;
$filename = $this->getTempFile($fixtures);
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader');
$loader->load(array($filename), 'default');
$books = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookPeer::doSelect(new \Criteria(), $this->con);
$this->assertCount(0, $books);
$authors = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookAuthorPeer::doSelect(new \Criteria(), $this->con);
$this->assertCount(1, $authors);
$author = $authors[0];
$this->assertEquals('A famous one', $author->getName());
}
public function testLoaderWithPhp()
{
$fixtures = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookAuthor:
BookAuthor_1:
id: '1'
name: <?php echo "to be announced"; ?>
YAML;
$filename = $this->getTempFile($fixtures);
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader');
$loader->load(array($filename), 'default');
$books = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookPeer::doSelect(new \Criteria(), $this->con);
$this->assertCount(0, $books);
$authors = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookAuthorPeer::doSelect(new \Criteria(), $this->con);
$this->assertCount(1, $authors);
$author = $authors[0];
$this->assertEquals('to be announced', $author->getName());
}
public function testLoadWithoutFaker()
{
$fixtures = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookAuthor:
BookAuthor_1:
id: '1'
name: <?php echo \$faker('word'); ?>
YAML;
$filename = $this->getTempFile($fixtures);
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader');
$loader->load(array($filename), 'default');
$books = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookPeer::doSelect(new \Criteria(), $this->con);
$this->assertCount(0, $books);
$authors = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookAuthorPeer::doSelect(new \Criteria(), $this->con);
$this->assertCount(1, $authors);
$author = $authors[0];
$this->assertEquals('word', $author->getName());
}
public function testLoadWithFaker()
{
if (!class_exists('Faker\Factory')) {
$this->markTestSkipped('Faker is mandatory');
}
$fixtures = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\Book:
Book_1:
id: '1'
name: <?php \$faker('word'); ?>
description: <?php \$faker('sentence'); ?>
YAML;
$filename = $this->getTempFile($fixtures);
$container = $this->getContainer();
$container->set('faker.generator', \Faker\Factory::create());
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader', $container);
$loader->load(array($filename), 'default');
$books = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\BookPeer::doSelect(new \Criteria(), $this->con);
$this->assertCount(1, $books);
$book = $books[0];
$this->assertNotNull($book->getName());
$this->assertNotEquals('null', strtolower($book->getName()));
$this->assertRegexp('#[a-z]+#', $book->getName());
$this->assertNotNull($book->getDescription());
$this->assertNotEquals('null', strtolower($book->getDescription()));
$this->assertRegexp('#[\w ]+#', $book->getDescription());
}
public function testLoadWithInheritedRelationship()
{
$schema = <<<XML
<database name="default" package="vendor.bundles.Propel.PropelBundle.Tests.Fixtures.DataFixtures.Loader" namespace="Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader" defaultIdMethod="native">
<table name="table_book_inherited_relationship" phpName="YamlInheritedRelationshipBook">
<column name="id" type="integer" primaryKey="true" autoIncrement="true" />
<column name="name" type="varchar" size="255" />
<column name="author_id" type="integer" required="true" />
<foreign-key foreignTable="table_author_inherited_relationship" phpName="Author">
<reference local="author_id" foreign="id" />
</foreign-key>
</table>
<table name="table_author_inherited_relationship" phpName="YamlInheritedRelationshipAuthor">
<column name="id" type="integer" primaryKey="true" autoIncrement="true" />
<column name="name" type="varchar" size="255" />
</table>
<table name="table_nobelized_author_inherited_relationship" phpName="YamlInheritedRelationshipNobelizedAuthor">
<column name="nobel_year" type="integer" />
<behavior name="concrete_inheritance">
<parameter name="extends" value="table_author_inherited_relationship" />
</behavior>
</table>
</database>
XML;
$fixtures = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlInheritedRelationshipNobelizedAuthor:
NobelizedAuthor_1:
nobel_year: 2012
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlInheritedRelationshipBook:
Book_1:
name: 'Supplice du santal'
author_id: NobelizedAuthor_1
YAML;
$filename = $this->getTempFile($fixtures);
$builder = new \PropelQuickBuilder();
$builder->setSchema($schema);
$con = $builder->build();
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader');
$loader->load(array($filename), 'default');
$books = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlInheritedRelationshipBookPeer::doSelect(new \Criteria(), $con);
$this->assertCount(1, $books);
$book = $books[0];
$author = $book->getAuthor();
$this->assertInstanceOf('Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlInheritedRelationshipAuthor', $author);
}
public function testLoadArrayToObjectType()
{
$schema = <<<XML
<database name="default" package="vendor.bundles.Propel.PropelBundle.Tests.Fixtures.DataFixtures.Loader" namespace="Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader" defaultIdMethod="native">
<table name="table_book_with_object" phpName="YamlBookWithObject">
<column name="id" type="integer" primaryKey="true" />
<column name="name" type="varchar" size="255" />
<column name="options" type="object" />
</table>
</database>
XML;
$fixtures = <<<YAML
Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlBookWithObject:
book1:
name: my book
options: {opt1: 2012, opt2: 140, inner: {subOpt: 123}}
YAML;
$filename = $this->getTempFile($fixtures);
$builder = new \PropelQuickBuilder();
$builder->setSchema($schema);
$con = $builder->build();
$loader = new YamlDataLoader(__DIR__.'/../../Fixtures/DataFixtures/Loader');
$loader->load(array($filename), 'default');
$book = \Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlBookWithObjectQuery::create(null, $con)->findOne();
$this->assertInstanceOf('\Propel\PropelBundle\Tests\Fixtures\DataFixtures\Loader\YamlBookWithObject', $book);
$this->assertEquals(array('opt1' => 2012, 'opt2' => 140, 'inner' => array('subOpt' => 123)), $book->getOptions());
}
}
|
phpchap/mainhostel
|
vendor/propel/propel-bundle/Propel/PropelBundle/Tests/DataFixtures/Loader/YamlDataLoaderTest.php
|
PHP
|
mit
| 17,260
|
# -*- coding: utf-8 -*-
from __future__ import unicode_literals
from django.db import models, migrations
import django.core.validators
class Migration(migrations.Migration):
dependencies = [
('django_graph', '0001_initial'),
('cyborg_identity', '0001_initial'),
]
operations = [
migrations.CreateModel(
name='IsContactEmailAddress',
fields=[
('relationship_ptr', models.OneToOneField(parent_link=True, auto_created=True, primary_key=True, serialize=False, to='django_graph.Relationship')),
('valid_from', models.DateTimeField(null=True, blank=True)),
('valid_to', models.DateTimeField(null=True, blank=True)),
],
options={
'abstract': False,
},
bases=('django_graph.relationship', models.Model),
),
migrations.CreateModel(
name='IsContactPhoneNumber',
fields=[
('relationship_ptr', models.OneToOneField(parent_link=True, auto_created=True, primary_key=True, serialize=False, to='django_graph.Relationship')),
('valid_from', models.DateTimeField(null=True, blank=True)),
('valid_to', models.DateTimeField(null=True, blank=True)),
('phone_number_type', models.CharField(blank=True, max_length=30, null=True, choices=[(b'HOME', b'Home'), (b'MOBILE', b'Mobile'), (b'WORK', b'Work'), (b'SCHOOL', b'School'), (b'OTHER', b'Other')])),
],
options={
'abstract': False,
},
bases=('django_graph.relationship', models.Model),
),
migrations.CreateModel(
name='PhoneNumber',
fields=[
('node_ptr', models.OneToOneField(parent_link=True, auto_created=True, primary_key=True, serialize=False, to='django_graph.Node')),
('us_phone_number', models.CharField(unique=True, max_length=10, validators=[django.core.validators.RegexValidator(regex=b'[0-9]{10}')])),
],
options={
'abstract': False,
},
bases=('django_graph.node',),
),
]
|
shawnhermans/cyborg-identity-manager
|
cyborg_identity/migrations/0002_iscontactemailaddress_iscontactphonenumber_phonenumber.py
|
Python
|
mit
| 2,204
|
// import React from 'react';
// import { shallow } from 'enzyme';
// import About from '../index';
describe('<About />', () => {
it('Expect to have unit tests specified', () => {
expect(true).toEqual(true);
});
});
|
mhoffman/CatAppBrowser
|
app/components/About/tests/index.test.js
|
JavaScript
|
mit
| 226
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><HTML>
<HEAD>
<TITLE></TITLE>
</HEAD>
<BODY>
<A name=1></a><hr>
<A name=2></a><hr>
<A name=3></a><hr>
<A name=4></a><hr>
<A name=5></a>717 17th Street, Suite 2000<br>
Denver, CO 80202<br>
303-534-3223 Fax 303-534-1822<br>
Report<br>
of<br>
Sub-Surface<br>
Directional<br>
Survey<br>
XTO<br>
Company<br>
HANSON 11X-12A<br>
Well Name<br>
DUNN / ND<br>
Location<br>
12/17/2014<br>
Date<br>
6803615<br>
Job Number<br>
Denver<br>
Office<br>
<hr>
<A name=6></a>717 17th Street, Suite 2000<br>
Denver, CO 80202<br>
303-534-3223 Fax 303-534-1822<br>
Survey Certification Sheet<br>
XTO<br>
6803615<br>
12/17/14<br>
Company<br>
Job Number<br>
Date<br>
SEC.12-T144N-R96W<br>
HANSON 11X-12A<br>
DUNN / ND<br>
Lease<br>
Well Name<br>
County & State<br>
Surveyed from a<br>
measured depth of:<br>
2262<br>
feet to<br>
20622<br>
feet<br>
Type of Survey:<br>
MWD<br>
Directional Surveyor:<br>
ERIK NEVA<br>
The data and calculations for this survey have been checked by me and conform to the standards and procedures<br>
set forth by Baker Hughes INTEQ. This report represents a true and correct Directional Survey of this well based<br>
on the original data obtained at the well site. Wellbore Coordinates are calculated using minimum curvature.<br>
JAMIE INGMIRE<br>
Certification Number:<br>
12443<br>
WELL PLANNER<br>
Certification Date:<br>
1/16/15<br>
<hr>
<A name=7></a>ft0051=h<br>
XTO ENERGY<br>
cin1<br>
lea<br>
Location:<br>
NORTH DAKOTA<br>
Slot:<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Sc<br>
Field:<br>
DUNN COUNTY<br>
Well:<br>
HANSON 11X-12A<br>
Facility:<br>
SEC.12-T144N-R96W<br>
Wellbore:<br>
HANSON 11X-12A PWB<br>
Plot reference wellpath is HANSON 11X-12A PWP (REV-B.0)<br>
True vertical depths are referenced to NABORS 109 (24'KB) (RKB)<br>
Grid System: NAD83 / Lambert North Dakota SP, Southern Zone (3302), US feet<br>
Measured depths are referenced to NABORS 109 (24'KB) (RKB)<br>
North Reference: True north<br>
NABORS 109 (24'KB) (RKB) to Mean Sea Level: 2334 feet<br>
Scale: True distance<br>
TIED ONTO SURFACE SURVEYS : 0.48° Inc, 2234.00ft MD, 2233.97ft TVD, -2.11ft VS<br>
Mean Sea Level to Mud line (At Slot: SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)): 0 feet<br>
Depths are in feet<br>
9.625in Casing Surface : 0.70° Inc, 2252.00ft MD, 2251.97ft TVD, -1.97ft VS<br>
Coordinates are in feet referenced to Slot<br>
Created by: ingmjamr on 1/16/2015<br>
FIRST BHI MWD SURVEY : 0.83° Inc, 2262.00ft MD, 2261.97ft TVD, -1.88ft VS<br>
Easting (ft)<br>
Scale 1 inch = 2500<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
SEC<br>
TIED ONTO SURFACE SURVEYS : 2233.97ft TVD, 2.07ft N, 0.54ft E<br>
.<br>
9.625in Casing Surface : 2251.97ft TVD, 1.93ft N, 0.65ft E<br>
12-T<br>
FIRST BHI MWD SURVEY : 2261.97ft TVD, 1.83ft N, 0.75ft E<br>
144<br>
7in Casing Intermediate : 10775.78ft TVD, 463.37ft S, 539.66ft W<br>
N-R<br>
96W<br>
(ft)<br>
th<br>
SEC<br>
pe<br>
.12<br>
D<br>
/13<br>
l<br>
-T<br>
a<br>
144N-R<br>
rtic<br>
9<br>
e<br>
6W<br>
N<br>
V<br>
H<br>
o<br>
AR<br>
r<br>
e<br>
t<br>
D<br>
h<br>
ru<br>
LIN<br>
in<br>
T<br>
ES<br>
g<br>
(20<br>
(<br>
0<br>
f<br>
'F<br>
t<br>
N<br>
)<br>
L/FSL<br>
&<br>
500'FEL<br>
/FW<br>
L)<br>
BGGM (1945.0 to 2016.0) Dip: 72.49° Field: 56030.1 nT<br>
Magnetic North is 7.84 degrees East of True North (at 10/30/2014)<br>
To correct azimuth from Magnetic to True add 7.84 degrees<br>
SEC<br>
.13-T<br>
144N-R<br>
LAST BHI MWD SURVEY : 10734.15ft TVD, 9950.64ft S, 762.79ft W<br>
96W<br>
PROJECTION TO BIT : 10730.97ft TVD, 10030.49ft S, 766.56ft W<br>
HANSON 11X-12A BHL REV-1 (250'FSL & 550'FWL, SEC.13)<br>
7in Casing Intermediate : 87.55° Inc, 11093.00ft MD, 10775.78ft TVD, 502.96ft VS<br>
HANSON 11X-12A BHL REV-1 (250'FSL & 550'FWL, SEC.13)<br>
4.00°/100ft<br>
LAST BHI MWD SURVEY : 92.28° Inc, 20622.00ft MD, 10734.15ft TVD, 9979.83ft VS<br>
PROJECTION TO BIT : 92.28° Inc, 20702.00ft MD, 10730.97ft TVD, 10059.74ft VS<br>
Vertical Section (ft)<br>
Scale 1 inch = 1500 ft<br>
Azimuth 184.35° with reference 0.00 N, 0.00 E<br>
<hr>
<A name=8></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 1 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
REPORT SETUP INFORMATION<br>
Projection System<br>
NAD83 / Lambert North Dakota SP, Southern Zone<br>
Software System<br>
WellArchitect® 4.0.0<br>
(3302), US feet<br>
North Reference<br>
True<br>
User<br>
Ingmjamr<br>
Scale<br>
0.999971<br>
Report Generated<br>
1/16/2015 at 1:52:04 PM<br>
Convergence at slot n/a<br>
Database/Source file Denver/HANSON_11X-12A_AWB.xml<br>
WELLPATH LOCATION<br>
Local coordinates<br>
Grid coordinates<br>
Geographic coordinates<br>
North[ft]<br>
East[ft]<br>
Easting[US ft]<br>
Northing[US ft]<br>
Latitude<br>
Longitude<br>
Slot Location<br>
0.00<br>
0.00<br>
1399480.31<br>
608700.68<br>
47°18'46.600"N<br>
102°47'39.170"W<br>
Facility Reference Pt<br>
1399480.31<br>
608700.68<br>
47°18'46.600"N<br>
102°47'39.170"W<br>
Field Reference Pt<br>
1374104.20<br>
720526.84<br>
47°37'02.270"N<br>
102°54'37.060"W<br>
WELLPATH DATUM<br>
NABORS 109 (24'KB) (RKB) to Facility<br>
Calculation method<br>
Minimum curvature<br>
2334.00ft<br>
Vertical Datum<br>
NABORS 109 (24'KB) (RKB) to Mean Sea<br>
Horizontal Reference Pt<br>
Slot<br>
2334.00ft<br>
Level<br>
NABORS 109 (24'KB) (RKB) to Mud Line at<br>
Vertical Reference Pt<br>
NABORS 109 (24'KB) (RKB)<br>
Slot (SLOT#01 HANSON 11X-12A (284'FNL 2334.00ft<br>
& 1296'FWL, SEC.12))<br>
MD Reference Pt<br>
NABORS 109 (24'KB) (RKB)<br>
Section Origin<br>
N 0.00, E 0.00 ft<br>
Field Vertical Reference<br>
Mean Sea Level<br>
Section Azimuth<br>
184.35°<br>
<hr>
<A name=9></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 2 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination Azimuth<br>
TVD<br>
Vert Sect North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
2234.00<br>
0.480 144.510 2233.97<br>
-2.11<br>
2.07<br>
0.54<br>
47°18'46.620"N<br>
102°47'39.162"W<br>
0.35 TIED ONTO SURFACE SURVEYS<br>
2262.00<br>
0.830 136.280 2261.97<br>
-1.88<br>
1.83<br>
0.75<br>
47°18'46.618"N<br>
102°47'39.159"W<br>
1.29 FIRST BHI MWD SURVEY<br>
2325.00<br>
0.720 142.540 2324.96<br>
-1.28<br>
1.19<br>
1.30<br>
47°18'46.612"N<br>
102°47'39.151"W<br>
0.22<br>
2421.00<br>
1.230 251.570 2420.95<br>
-0.44<br>
0.38<br>
0.69<br>
47°18'46.604"N<br>
102°47'39.160"W<br>
1.68<br>
2516.00<br>
1.260 246.820 2515.93<br>
0.44 -0.35<br>
-1.24<br>
47°18'46.597"N<br>
102°47'39.188"W<br>
0.11<br>
2612.00<br>
2.050 278.810 2611.89<br>
0.80 -0.50<br>
-3.90<br>
47°18'46.595"N<br>
102°47'39.227"W<br>
1.24<br>
2705.00<br>
2.350 289.580 2704.82<br>
0.17<br>
0.39<br>
-7.34<br>
47°18'46.604"N<br>
102°47'39.277"W<br>
0.55<br>
2800.00<br>
2.470 294.730 2799.74<br>
-1.06<br>
1.90 -11.04<br>
47°18'46.619"N<br>
102°47'39.330"W<br>
0.26<br>
2895.00<br>
1.740 266.640 2894.68<br>
-1.58<br>
2.67 -14.34<br>
47°18'46.626"N<br>
102°47'39.378"W<br>
1.31<br>
3023.00<br>
2.200 263.440 3022.60<br>
-0.85<br>
2.28 -18.72<br>
47°18'46.622"N<br>
102°47'39.442"W<br>
0.37<br>
3055.00<br>
2.290 262.870 3054.58<br>
-0.61<br>
2.13 -19.96<br>
47°18'46.621"N<br>
102°47'39.460"W<br>
0.29<br>
3118.00<br>
2.350 264.000 3117.52<br>
-0.13<br>
1.84 -22.50<br>
47°18'46.618"N<br>
102°47'39.496"W<br>
0.12<br>
3181.00<br>
2.270 265.430 3180.47<br>
0.30<br>
1.60 -25.02<br>
47°18'46.616"N<br>
102°47'39.533"W<br>
0.16<br>
3213.00<br>
2.180 264.960 3212.45<br>
0.50<br>
1.50 -26.26<br>
47°18'46.615"N<br>
102°47'39.551"W<br>
0.29<br>
3276.00<br>
2.120 269.040 3275.40<br>
0.80<br>
1.37 -28.62<br>
47°18'46.614"N<br>
102°47'39.585"W<br>
0.26<br>
3371.00<br>
2.060 274.550 3370.34<br>
0.96<br>
1.48 -32.08<br>
47°18'46.615"N<br>
102°47'39.636"W<br>
0.22<br>
3464.00<br>
1.890 281.130 3463.29<br>
0.77<br>
1.91 -35.25<br>
47°18'46.619"N<br>
102°47'39.682"W<br>
0.30<br>
3560.00<br>
1.930 287.920 3559.23<br>
0.20<br>
2.71 -38.34<br>
47°18'46.627"N<br>
102°47'39.726"W<br>
0.24<br>
3654.00<br>
1.870 258.610 3653.18<br>
0.25<br>
2.90 -41.35<br>
47°18'46.629"N<br>
102°47'39.770"W<br>
1.02<br>
3750.00<br>
1.740 253.930 3749.14<br>
1.18<br>
2.18 -44.29<br>
47°18'46.622"N<br>
102°47'39.813"W<br>
0.20<br>
3846.00<br>
1.640 252.070 3845.09<br>
2.21<br>
1.36 -47.00<br>
47°18'46.613"N<br>
102°47'39.852"W<br>
0.12<br>
3941.00<br>
1.480 250.870 3940.06<br>
3.22<br>
0.54 -49.45<br>
47°18'46.605"N<br>
102°47'39.888"W<br>
0.17<br>
4036.00<br>
2.330 270.720 4035.01<br>
3.83<br>
0.16 -52.54<br>
47°18'46.602"N<br>
102°47'39.932"W<br>
1.12<br>
4132.00<br>
2.070 274.590 4130.94<br>
3.94<br>
0.32 -56.22<br>
47°18'46.603"N<br>
102°47'39.986"W<br>
0.31<br>
4227.00<br>
1.770 272.800 4225.88<br>
3.98<br>
0.53 -59.39<br>
47°18'46.605"N<br>
102°47'40.032"W<br>
0.32<br>
4322.00<br>
1.630 271.490 4320.84<br>
4.08<br>
0.64 -62.21<br>
47°18'46.606"N<br>
102°47'40.073"W<br>
0.15<br>
4416.00<br>
2.750 271.290 4414.77<br>
4.27<br>
0.72 -65.80<br>
47°18'46.607"N<br>
102°47'40.125"W<br>
1.19<br>
4512.00<br>
2.810 271.370 4510.66<br>
4.51<br>
0.83 -70.46<br>
47°18'46.608"N<br>
102°47'40.192"W<br>
0.06<br>
4606.00<br>
2.390 273.140 4604.56<br>
4.68<br>
0.99 -74.72<br>
47°18'46.610"N<br>
102°47'40.254"W<br>
0.45<br>
4701.00<br>
1.990 275.760 4699.49<br>
4.68<br>
1.27 -78.34<br>
47°18'46.613"N<br>
102°47'40.307"W<br>
0.43<br>
<hr>
<A name=10></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 3 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
4797.00<br>
2.070<br>
279.240<br>
4795.43<br>
4.49<br>
1.71<br>
-81.70<br>
47°18'46.617"N<br>
102°47'40.356"W<br>
0.15<br>
4892.00<br>
1.540<br>
278.700<br>
4890.38<br>
4.25<br>
2.18<br>
-84.66<br>
47°18'46.622"N<br>
102°47'40.399"W<br>
0.56<br>
4988.00<br>
1.690<br>
246.280<br>
4986.35<br>
4.81<br>
1.81<br>
-87.23<br>
47°18'46.618"N<br>
102°47'40.436"W<br>
0.95<br>
5083.00<br>
1.450<br>
255.630<br>
5081.31<br>
5.86<br>
0.95<br>
-89.68<br>
47°18'46.609"N<br>
102°47'40.471"W<br>
0.37<br>
5178.00<br>
1.990<br>
263.250<br>
5176.27<br>
6.56<br>
0.45<br>
-92.48<br>
47°18'46.604"N<br>
102°47'40.512"W<br>
0.62<br>
5273.00<br>
1.880<br>
260.540<br>
5271.21<br>
7.25<br>
0.00<br>
-95.66<br>
47°18'46.600"N<br>
102°47'40.558"W<br>
0.15<br>
5369.00<br>
2.220<br>
277.680<br>
5367.15<br>
7.52<br>
-0.01<br>
-99.05<br>
47°18'46.600"N<br>
102°47'40.607"W<br>
0.73<br>
5464.00<br>
2.420<br>
286.430<br>
5462.08<br>
6.99<br>
0.81<br>
-102.80<br>
47°18'46.608"N<br>
102°47'40.662"W<br>
0.43<br>
5559.00<br>
2.000<br>
297.360<br>
5557.01<br>
5.92<br>
2.14<br>
-106.20<br>
47°18'46.621"N<br>
102°47'40.711"W<br>
0.62<br>
5655.00<br>
2.230<br>
283.850<br>
5652.94<br>
4.96<br>
3.35<br>
-109.50<br>
47°18'46.633"N<br>
102°47'40.759"W<br>
0.57<br>
5749.00<br>
2.260<br>
285.080<br>
5746.87<br>
4.31<br>
4.27<br>
-113.06<br>
47°18'46.642"N<br>
102°47'40.811"W<br>
0.06<br>
5845.00<br>
2.230<br>
262.910<br>
5842.80<br>
4.33<br>
4.53<br>
-116.74<br>
47°18'46.645"N<br>
102°47'40.864"W<br>
0.90<br>
5940.00<br>
2.000<br>
262.030<br>
5937.73<br>
5.05<br>
4.08<br>
-120.22<br>
47°18'46.640"N<br>
102°47'40.915"W<br>
0.24<br>
6036.00<br>
2.120<br>
269.320<br>
6033.67<br>
5.57<br>
3.82<br>
-123.65<br>
47°18'46.638"N<br>
102°47'40.964"W<br>
0.30<br>
6130.00<br>
1.820<br>
277.200<br>
6127.61<br>
5.64<br>
3.99<br>
-126.87<br>
47°18'46.639"N<br>
102°47'41.011"W<br>
0.43<br>
6226.00<br>
2.110<br>
270.010<br>
6223.56<br>
5.70<br>
4.18<br>
-130.15<br>
47°18'46.641"N<br>
102°47'41.059"W<br>
0.40<br>
6321.00<br>
1.710<br>
283.840<br>
6318.51<br>
5.60<br>
4.52<br>
-133.28<br>
47°18'46.645"N<br>
102°47'41.104"W<br>
0.64<br>
6416.00<br>
2.100<br>
257.510<br>
6413.45<br>
5.87<br>
4.48<br>
-136.35<br>
47°18'46.644"N<br>
102°47'41.149"W<br>
1.00<br>
6511.00<br>
2.080<br>
262.770<br>
6508.39<br>
6.72<br>
3.89<br>
-139.76<br>
47°18'46.638"N<br>
102°47'41.198"W<br>
0.20<br>
6607.00<br>
1.810<br>
268.390<br>
6604.34<br>
7.23<br>
3.63<br>
-143.01<br>
47°18'46.636"N<br>
102°47'41.245"W<br>
0.34<br>
6703.00<br>
1.800<br>
274.190<br>
6700.29<br>
7.39<br>
3.70<br>
-146.03<br>
47°18'46.636"N<br>
102°47'41.289"W<br>
0.19<br>
6798.00<br>
1.860<br>
260.510<br>
6795.24<br>
7.76<br>
3.55<br>
-149.03<br>
47°18'46.635"N<br>
102°47'41.333"W<br>
0.46<br>
6893.00<br>
1.780<br>
269.830<br>
6890.19<br>
8.25<br>
3.29<br>
-152.03<br>
47°18'46.632"N<br>
102°47'41.376"W<br>
0.32<br>
6988.00<br>
1.670<br>
276.850<br>
6985.15<br>
8.30<br>
3.45<br>
-154.88<br>
47°18'46.634"N<br>
102°47'41.418"W<br>
0.25<br>
7083.00<br>
1.470<br>
283.230<br>
7080.11<br>
8.06<br>
3.90<br>
-157.44<br>
47°18'46.638"N<br>
102°47'41.455"W<br>
0.28<br>
7178.00<br>
2.200<br>
257.260<br>
7175.07<br>
8.40<br>
3.77<br>
-160.41<br>
47°18'46.637"N<br>
102°47'41.498"W<br>
1.15<br>
7274.00<br>
2.400<br>
262.070<br>
7270.99<br>
9.37<br>
3.09<br>
-164.19<br>
47°18'46.630"N<br>
102°47'41.553"W<br>
0.29<br>
7370.00<br>
1.970<br>
259.470<br>
7366.92<br>
10.22<br>
2.51<br>
-167.81<br>
47°18'46.625"N<br>
102°47'41.605"W<br>
0.46<br>
7465.00<br>
2.110<br>
267.200<br>
7461.86<br>
10.86<br>
2.13<br>
-171.16<br>
47°18'46.621"N<br>
102°47'41.654"W<br>
0.32<br>
7561.00<br>
2.050<br>
271.030<br>
7557.80<br>
11.18<br>
2.07<br>
-174.64<br>
47°18'46.620"N<br>
102°47'41.704"W<br>
0.16<br>
<hr>
<A name=11></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 4 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
7655.00<br>
1.740<br>
271.980<br>
7651.74<br>
11.34<br>
2.15<br>
-177.75<br>
47°18'46.621"N<br>
102°47'41.750"W<br>
0.33<br>
7749.00<br>
2.340<br>
277.800<br>
7745.68<br>
11.28<br>
2.46<br>
-181.08<br>
47°18'46.624"N<br>
102°47'41.798"W<br>
0.67<br>
7844.00<br>
3.170<br>
276.560<br>
7840.57<br>
11.06<br>
3.02<br>
-185.61<br>
47°18'46.630"N<br>
102°47'41.864"W<br>
0.88<br>
7938.00<br>
2.560<br>
266.720<br>
7934.46<br>
11.24<br>
3.20<br>
-190.28<br>
47°18'46.632"N<br>
102°47'41.931"W<br>
0.83<br>
8033.00<br>
2.610<br>
265.440<br>
8029.36<br>
11.86<br>
2.91<br>
-194.56<br>
47°18'46.629"N<br>
102°47'41.993"W<br>
0.08<br>
8128.00<br>
2.260<br>
253.060<br>
8124.27<br>
12.87<br>
2.19<br>
-198.51<br>
47°18'46.622"N<br>
102°47'42.051"W<br>
0.66<br>
8222.00<br>
1.810<br>
248.730<br>
8218.22<br>
14.19<br>
1.11<br>
-201.66<br>
47°18'46.611"N<br>
102°47'42.097"W<br>
0.51<br>
8317.00<br>
1.590<br>
284.160<br>
8313.18<br>
14.61<br>
0.89<br>
-204.34<br>
47°18'46.609"N<br>
102°47'42.135"W<br>
1.11<br>
8412.00<br>
2.150<br>
298.850<br>
8408.13<br>
13.65<br>
2.07<br>
-207.18<br>
47°18'46.620"N<br>
102°47'42.177"W<br>
0.77<br>
8507.00<br>
2.500<br>
282.720<br>
8503.05<br>
12.61<br>
3.39<br>
-210.76<br>
47°18'46.633"N<br>
102°47'42.229"W<br>
0.78<br>
8599.00<br>
2.350<br>
265.480<br>
8594.97<br>
12.61<br>
3.68<br>
-214.60<br>
47°18'46.636"N<br>
102°47'42.284"W<br>
0.81<br>
8691.00<br>
1.860<br>
222.990<br>
8686.91<br>
14.06<br>
2.44<br>
-217.50<br>
47°18'46.624"N<br>
102°47'42.326"W<br>
1.73<br>
8783.00<br>
2.560<br>
254.630<br>
8778.84<br>
15.92<br>
0.80<br>
-220.50<br>
47°18'46.608"N<br>
102°47'42.370"W<br>
1.50<br>
8875.00<br>
3.300<br>
272.740<br>
8870.73<br>
16.69<br>
0.39<br>
-225.12<br>
47°18'46.604"N<br>
102°47'42.437"W<br>
1.28<br>
8967.00<br>
2.810<br>
277.740<br>
8962.59<br>
16.63<br>
0.82<br>
-230.00<br>
47°18'46.608"N<br>
102°47'42.508"W<br>
0.61<br>
9057.00<br>
1.600<br>
295.920<br>
9052.53<br>
16.04<br>
1.66<br>
-233.32<br>
47°18'46.616"N<br>
102°47'42.556"W<br>
1.54<br>
9149.00<br>
1.390<br>
296.570<br>
9144.50<br>
15.14<br>
2.72<br>
-235.47<br>
47°18'46.627"N<br>
102°47'42.587"W<br>
0.23<br>
9241.00<br>
1.160<br>
251.970<br>
9236.48<br>
15.08<br>
2.93<br>
-237.35<br>
47°18'46.629"N<br>
102°47'42.615"W<br>
1.08<br>
9332.00<br>
2.170<br>
245.280<br>
9327.44<br>
16.27<br>
1.93<br>
-239.80<br>
47°18'46.619"N<br>
102°47'42.650"W<br>
1.13<br>
9425.00<br>
2.810<br>
247.100<br>
9420.35<br>
18.16<br>
0.30<br>
-243.50<br>
47°18'46.603"N<br>
102°47'42.704"W<br>
0.69<br>
9517.00<br>
2.800<br>
256.540<br>
9512.24<br>
19.88<br>
-1.10<br>
-247.76<br>
47°18'46.589"N<br>
102°47'42.766"W<br>
0.50<br>
9609.00<br>
1.780<br>
272.450<br>
9604.16<br>
20.62<br>
-1.56<br>
-251.37<br>
47°18'46.585"N<br>
102°47'42.818"W<br>
1.30<br>
9701.00<br>
1.360<br>
315.040<br>
9696.13<br>
19.95<br>
-0.72<br>
-253.57<br>
47°18'46.593"N<br>
102°47'42.850"W<br>
1.31<br>
9793.00<br>
1.720<br>
296.470<br>
9788.10<br>
18.72<br>
0.66<br>
-255.58<br>
47°18'46.607"N<br>
102°47'42.879"W<br>
0.66<br>
9885.00<br>
2.770<br>
282.080<br>
9880.03<br>
17.90<br>
1.74<br>
-258.99<br>
47°18'46.617"N<br>
102°47'42.928"W<br>
1.29<br>
9977.00<br>
1.360<br>
277.170<br>
9971.97<br>
17.55<br>
2.35<br>
-262.24<br>
47°18'46.623"N<br>
102°47'42.976"W<br>
1.54<br>
10072.00<br>
1.220<br>
245.360<br>
10066.94<br>
17.99<br>
2.06<br>
-264.28<br>
47°18'46.620"N<br>
102°47'43.005"W<br>
0.76<br>
10167.00<br>
2.120<br>
246.540<br>
10161.90<br>
19.30<br>
0.94<br>
-266.81<br>
47°18'46.609"N<br>
102°47'43.042"W<br>
0.95<br>
10262.00<br>
2.920<br>
257.660<br>
10256.81<br>
20.81<br>
-0.27<br>
-270.79<br>
47°18'46.597"N<br>
102°47'43.100"W<br>
0.98<br>
10294.00<br>
2.750<br>
257.210<br>
10288.77<br>
21.27<br>
-0.62<br>
-272.33<br>
47°18'46.594"N<br>
102°47'43.122"W<br>
0.54<br>
<hr>
<A name=12></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 5 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
10326.00<br>
4.370<br>
227.930<br>
10320.71<br>
22.38<br>
-1.60<br>
-273.99<br>
47°18'46.584"N<br>
102°47'43.146"W<br>
7.46<br>
10357.00<br>
8.270<br>
219.370<br>
10351.52<br>
25.06<br>
-4.12<br>
-276.28<br>
47°18'46.559"N<br>
102°47'43.179"W<br>
12.91<br>
10389.00<br>
12.480<br>
217.930<br>
10382.99<br>
29.83<br>
-8.63<br>
-279.87<br>
47°18'46.515"N<br>
102°47'43.231"W<br>
13.18<br>
10421.00<br>
16.800<br>
215.410<br>
10413.94<br>
36.68<br>
-15.13<br>
-284.67<br>
47°18'46.451"N<br>
102°47'43.301"W<br>
13.64<br>
10452.00<br>
21.040<br>
212.650<br>
10443.26<br>
45.42<br>
-23.47<br>
-290.27<br>
47°18'46.368"N<br>
102°47'43.383"W<br>
13.98<br>
10484.00<br>
24.950<br>
211.740<br>
10472.71<br>
56.47<br>
-34.05<br>
-296.93<br>
47°18'46.264"N<br>
102°47'43.479"W<br>
12.27<br>
10516.00<br>
28.540<br>
210.300<br>
10501.28<br>
69.34<br>
-46.39<br>
-304.34<br>
47°18'46.142"N<br>
102°47'43.587"W<br>
11.40<br>
10547.00<br>
32.100<br>
208.990<br>
10528.04<br>
83.49<br>
-60.00<br>
-312.07<br>
47°18'46.008"N<br>
102°47'43.699"W<br>
11.68<br>
10579.00<br>
36.170<br>
208.940<br>
10554.52<br>
99.81<br>
-75.70<br>
-320.76<br>
47°18'45.853"N<br>
102°47'43.825"W<br>
12.72<br>
10611.00<br>
39.800<br>
208.640<br>
10579.74<br>
117.74<br>
-92.96<br>
-330.24<br>
47°18'45.682"N<br>
102°47'43.963"W<br>
11.36<br>
10642.00<br>
43.580<br>
207.490<br>
10602.88<br>
136.62<br>
-111.16<br>
-339.93<br>
47°18'45.503"N<br>
102°47'44.103"W<br>
12.44<br>
10674.00<br>
47.130<br>
206.490<br>
10625.37<br>
157.63<br>
-131.44<br>
-350.26<br>
47°18'45.303"N<br>
102°47'44.253"W<br>
11.31<br>
10706.00<br>
50.870<br>
207.550<br>
10646.36<br>
179.91<br>
-152.95<br>
-361.23<br>
47°18'45.090"N<br>
102°47'44.412"W<br>
11.95<br>
10738.00<br>
54.920<br>
208.390<br>
10665.66<br>
203.28<br>
-175.48<br>
-373.21<br>
47°18'44.868"N<br>
102°47'44.586"W<br>
12.83<br>
10769.00<br>
59.020<br>
210.130<br>
10682.55<br>
226.84<br>
-198.15<br>
-385.91<br>
47°18'44.644"N<br>
102°47'44.770"W<br>
14.04<br>
10801.00<br>
61.880<br>
210.720<br>
10698.33<br>
251.84<br>
-222.15<br>
-400.01<br>
47°18'44.407"N<br>
102°47'44.975"W<br>
9.08<br>
10832.00<br>
63.810<br>
210.160<br>
10712.48<br>
276.62<br>
-245.93<br>
-413.98<br>
47°18'44.173"N<br>
102°47'45.178"W<br>
6.43<br>
10864.00<br>
65.930<br>
210.260<br>
10726.07<br>
302.68<br>
-270.96<br>
-428.56<br>
47°18'43.926"N<br>
102°47'45.389"W<br>
6.63<br>
10896.00<br>
70.230<br>
209.580<br>
10738.01<br>
329.46<br>
-296.69<br>
-443.36<br>
47°18'43.672"N<br>
102°47'45.604"W<br>
13.58<br>
10927.00<br>
72.700<br>
210.220<br>
10747.87<br>
355.97<br>
-322.16<br>
-458.01<br>
47°18'43.420"N<br>
102°47'45.817"W<br>
8.20<br>
10959.00<br>
75.370<br>
210.510<br>
10756.67<br>
383.62<br>
-348.71<br>
-473.56<br>
47°18'43.158"N<br>
102°47'46.042"W<br>
8.39<br>
10991.00<br>
78.610<br>
210.560<br>
10763.87<br>
411.59<br>
-375.56<br>
-489.40<br>
47°18'42.893"N<br>
102°47'46.272"W<br>
10.13<br>
11023.00<br>
81.310<br>
210.260<br>
10769.45<br>
439.90<br>
-402.73<br>
-505.35<br>
47°18'42.625"N<br>
102°47'46.504"W<br>
8.49<br>
11054.00<br>
84.330<br>
209.590<br>
10773.32<br>
467.64<br>
-429.38<br>
-520.69<br>
47°18'42.362"N<br>
102°47'46.726"W<br>
9.98<br>
11076.00<br>
87.040<br>
208.950<br>
10774.98<br>
487.53<br>
-448.52<br>
-531.42<br>
47°18'42.173"N<br>
102°47'46.882"W<br>
12.66<br>
11119.00<br>
88.330<br>
209.310<br>
10776.72<br>
526.54<br>
-486.05<br>
-552.33<br>
47°18'41.803"N<br>
102°47'47.185"W<br>
3.11<br>
11150.00<br>
89.780<br>
208.780<br>
10777.23<br>
554.70<br>
-513.14<br>
-567.38<br>
47°18'41.535"N<br>
102°47'47.404"W<br>
4.98<br>
11181.00<br>
91.380<br>
208.560<br>
10776.91<br>
582.95<br>
-540.34<br>
-582.25<br>
47°18'41.267"N<br>
102°47'47.620"W<br>
5.21<br>
11212.00<br>
90.370<br>
207.380<br>
10776.44<br>
611.34<br>
-567.72<br>
-596.79<br>
47°18'40.997"N<br>
102°47'47.830"W<br>
5.01<br>
11242.00<br>
90.030<br>
205.760<br>
10776.33<br>
639.12<br>
-594.55<br>
-610.21<br>
47°18'40.732"N<br>
102°47'48.025"W<br>
5.52<br>
<hr>
<A name=13></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 6 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
11273.00<br>
89.540<br>
204.400<br>
10776.45<br>
668.11<br>
-622.62<br>
-623.35<br>
47°18'40.455"N<br>
102°47'48.216"W<br>
4.66<br>
11304.00<br>
89.320<br>
203.220<br>
10776.76<br>
697.34<br>
-650.98<br>
-635.86<br>
47°18'40.175"N<br>
102°47'48.397"W<br>
3.87<br>
11335.00<br>
88.860<br>
201.940<br>
10777.25<br>
726.77<br>
-679.60<br>
-647.76<br>
47°18'39.892"N<br>
102°47'48.570"W<br>
4.39<br>
11366.00<br>
88.800<br>
200.590<br>
10777.88<br>
756.43<br>
-708.49<br>
-659.00<br>
47°18'39.607"N<br>
102°47'48.733"W<br>
4.36<br>
11397.00<br>
88.680<br>
200.070<br>
10778.57<br>
786.22<br>
-737.55<br>
-669.77<br>
47°18'39.321"N<br>
102°47'48.889"W<br>
1.72<br>
11428.00<br>
90.650<br>
199.690<br>
10778.75<br>
816.09<br>
-766.70<br>
-680.31<br>
47°18'39.033"N<br>
102°47'49.042"W<br>
6.47<br>
11459.00<br>
91.110<br>
198.510<br>
10778.27<br>
846.06<br>
-795.99<br>
-690.45<br>
47°18'38.744"N<br>
102°47'49.190"W<br>
4.09<br>
11490.00<br>
91.670<br>
197.170<br>
10777.52<br>
876.20<br>
-825.49<br>
-699.95<br>
47°18'38.453"N<br>
102°47'49.327"W<br>
4.68<br>
11521.00<br>
91.110<br>
195.840<br>
10776.77<br>
906.49<br>
-855.20<br>
-708.75<br>
47°18'38.159"N<br>
102°47'49.455"W<br>
4.65<br>
11551.00<br>
91.020<br>
194.150<br>
10776.21<br>
935.97<br>
-884.17<br>
-716.51<br>
47°18'37.873"N<br>
102°47'49.568"W<br>
5.64<br>
11582.00<br>
89.790<br>
192.010<br>
10775.99<br>
966.61<br>
-914.37<br>
-723.53<br>
47°18'37.575"N<br>
102°47'49.669"W<br>
7.96<br>
11613.00<br>
89.910<br>
190.530<br>
10776.07<br>
997.38<br>
-944.77<br>
-729.59<br>
47°18'37.275"N<br>
102°47'49.757"W<br>
4.79<br>
11644.00<br>
90.460<br>
189.060<br>
10775.97<br>
1028.24<br>
-975.31<br>
-734.86<br>
47°18'36.974"N<br>
102°47'49.834"W<br>
5.06<br>
11675.00<br>
91.200<br>
187.230<br>
10775.52<br>
1059.17<br>
-1006.00<br>
-739.25<br>
47°18'36.671"N<br>
102°47'49.898"W<br>
6.37<br>
11705.00<br>
91.390<br>
185.720<br>
10774.84<br>
1089.14<br>
-1035.80<br>
-742.63<br>
47°18'36.377"N<br>
102°47'49.947"W<br>
5.07<br>
11736.00<br>
91.140<br>
184.590<br>
10774.16<br>
1120.13<br>
-1066.66<br>
-745.42<br>
47°18'36.072"N<br>
102°47'49.987"W<br>
3.73<br>
11765.00<br>
91.080<br>
183.210<br>
10773.60<br>
1149.12<br>
-1095.59<br>
-747.39<br>
47°18'35.787"N<br>
102°47'50.016"W<br>
4.76<br>
11796.00<br>
90.930<br>
181.400<br>
10773.05<br>
1180.09<br>
-1126.56<br>
-748.64<br>
47°18'35.481"N<br>
102°47'50.034"W<br>
5.86<br>
11827.00<br>
90.920<br>
180.500<br>
10772.55<br>
1211.03<br>
-1157.55<br>
-749.15<br>
47°18'35.175"N<br>
102°47'50.041"W<br>
2.90<br>
11858.00<br>
91.230<br>
180.940<br>
10771.97<br>
1241.97<br>
-1188.54<br>
-749.54<br>
47°18'34.869"N<br>
102°47'50.047"W<br>
1.74<br>
11889.00<br>
90.250<br>
180.510<br>
10771.57<br>
1272.90<br>
-1219.54<br>
-749.93<br>
47°18'34.563"N<br>
102°47'50.052"W<br>
3.45<br>
11949.00<br>
88.800<br>
180.070<br>
10772.07<br>
1332.75<br>
-1279.53<br>
-750.23<br>
47°18'33.971"N<br>
102°47'50.057"W<br>
2.53<br>
12041.00<br>
89.880<br>
179.950<br>
10773.13<br>
1424.48<br>
-1371.52<br>
-750.25<br>
47°18'33.063"N<br>
102°47'50.057"W<br>
1.18<br>
12134.00<br>
90.460<br>
179.630<br>
10772.85<br>
1517.18<br>
-1464.52<br>
-749.91<br>
47°18'32.145"N<br>
102°47'50.052"W<br>
0.71<br>
12195.00<br>
90.400<br>
179.200<br>
10772.40<br>
1577.95<br>
-1525.52<br>
-749.29<br>
47°18'31.543"N<br>
102°47'50.043"W<br>
0.71<br>
12226.00<br>
90.250<br>
179.620<br>
10772.22<br>
1608.84<br>
-1556.52<br>
-748.97<br>
47°18'31.238"N<br>
102°47'50.038"W<br>
1.44<br>
12257.00<br>
89.820<br>
179.560<br>
10772.20<br>
1639.73<br>
-1587.51<br>
-748.75<br>
47°18'30.932"N<br>
102°47'50.035"W<br>
1.40<br>
12318.00<br>
89.940<br>
179.110<br>
10772.33<br>
1700.50<br>
-1648.51<br>
-748.04<br>
47°18'30.330"N<br>
102°47'50.025"W<br>
0.76<br>
12350.00<br>
91.610<br>
179.660<br>
10771.90<br>
1732.37<br>
-1680.50<br>
-747.69<br>
47°18'30.014"N<br>
102°47'50.020"W<br>
5.49<br>
12414.00<br>
91.170<br>
178.660<br>
10770.34<br>
1796.09<br>
-1744.48<br>
-746.76<br>
47°18'29.382"N<br>
102°47'50.006"W<br>
1.71<br>
<hr>
<A name=14></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 7 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
12445.00<br>
90.520<br>
179.980<br>
10769.89<br>
1826.97<br>
-1775.47<br>
-746.39<br>
47°18'29.077"N<br>
102°47'50.001"W<br>
4.75<br>
12508.00<br>
90.460<br>
180.010<br>
10769.35<br>
1889.78<br>
-1838.47<br>
-746.38<br>
47°18'28.455"N<br>
102°47'50.001"W<br>
0.11<br>
12603.00<br>
89.940<br>
179.510<br>
10769.02<br>
1984.48<br>
-1933.47<br>
-745.99<br>
47°18'27.517"N<br>
102°47'49.995"W<br>
0.76<br>
12698.00<br>
89.450<br>
179.340<br>
10769.52<br>
2079.12<br>
-2028.46<br>
-745.03<br>
47°18'26.580"N<br>
102°47'49.981"W<br>
0.55<br>
12760.00<br>
89.850<br>
179.390<br>
10769.90<br>
2140.89<br>
-2090.45<br>
-744.34<br>
47°18'25.968"N<br>
102°47'49.971"W<br>
0.65<br>
12792.00<br>
90.870<br>
180.450<br>
10769.70<br>
2172.79<br>
-2122.45<br>
-744.30<br>
47°18'25.652"N<br>
102°47'49.970"W<br>
4.60<br>
12856.00<br>
91.450<br>
180.770<br>
10768.40<br>
2236.64<br>
-2186.44<br>
-744.98<br>
47°18'25.020"N<br>
102°47'49.980"W<br>
1.03<br>
12888.00<br>
90.770<br>
181.070<br>
10767.78<br>
2268.58<br>
-2218.43<br>
-745.50<br>
47°18'24.705"N<br>
102°47'49.988"W<br>
2.32<br>
12951.00<br>
89.420<br>
180.260<br>
10767.68<br>
2331.45<br>
-2281.42<br>
-746.23<br>
47°18'24.083"N<br>
102°47'49.998"W<br>
2.50<br>
12982.00<br>
89.810<br>
179.990<br>
10767.89<br>
2362.36<br>
-2312.42<br>
-746.29<br>
47°18'23.777"N<br>
102°47'49.999"W<br>
1.53<br>
13045.00<br>
90.560<br>
180.910<br>
10767.68<br>
2425.21<br>
-2375.42<br>
-746.79<br>
47°18'23.155"N<br>
102°47'50.006"W<br>
1.88<br>
13077.00<br>
89.070<br>
180.370<br>
10767.79<br>
2457.15<br>
-2407.41<br>
-747.15<br>
47°18'22.839"N<br>
102°47'50.011"W<br>
4.95<br>
13171.00<br>
90.150<br>
180.070<br>
10768.43<br>
2550.90<br>
-2501.41<br>
-747.51<br>
47°18'21.912"N<br>
102°47'50.017"W<br>
1.19<br>
13203.00<br>
90.060<br>
179.060<br>
10768.37<br>
2582.79<br>
-2533.41<br>
-747.26<br>
47°18'21.596"N<br>
102°47'50.013"W<br>
3.17<br>
13266.00<br>
90.470<br>
180.070<br>
10768.08<br>
2645.56<br>
-2596.40<br>
-746.79<br>
47°18'20.974"N<br>
102°47'50.006"W<br>
1.73<br>
13298.00<br>
91.510<br>
180.650<br>
10767.52<br>
2677.48<br>
-2628.40<br>
-746.99<br>
47°18'20.658"N<br>
102°47'50.009"W<br>
3.72<br>
13361.00<br>
91.410<br>
180.420<br>
10765.92<br>
2740.32<br>
-2691.37<br>
-747.57<br>
47°18'20.037"N<br>
102°47'50.017"W<br>
0.40<br>
13424.00<br>
89.780<br>
180.310<br>
10765.26<br>
2803.16<br>
-2754.37<br>
-747.98<br>
47°18'19.415"N<br>
102°47'50.023"W<br>
2.59<br>
13456.00<br>
89.910<br>
180.270<br>
10765.35<br>
2835.08<br>
-2786.37<br>
-748.14<br>
47°18'19.099"N<br>
102°47'50.026"W<br>
0.43<br>
13551.00<br>
90.550<br>
180.370<br>
10764.97<br>
2929.85<br>
-2881.36<br>
-748.67<br>
47°18'18.162"N<br>
102°47'50.033"W<br>
0.68<br>
13583.00<br>
90.830<br>
180.180<br>
10764.58<br>
2961.76<br>
-2913.36<br>
-748.82<br>
47°18'17.846"N<br>
102°47'50.035"W<br>
1.06<br>
13646.00<br>
89.410<br>
180.090<br>
10764.45<br>
3024.59<br>
-2976.36<br>
-748.97<br>
47°18'17.224"N<br>
102°47'50.038"W<br>
2.26<br>
13741.00<br>
90.000<br>
179.660<br>
10764.94<br>
3119.30<br>
-3071.36<br>
-748.76<br>
47°18'16.287"N<br>
102°47'50.035"W<br>
0.77<br>
13773.00<br>
90.430<br>
179.320<br>
10764.82<br>
3151.18<br>
-3103.36<br>
-748.48<br>
47°18'15.971"N<br>
102°47'50.030"W<br>
1.71<br>
13836.00<br>
89.630<br>
178.210<br>
10764.79<br>
3213.88<br>
-3166.34<br>
-747.12<br>
47°18'15.349"N<br>
102°47'50.011"W<br>
2.17<br>
13867.00<br>
90.090<br>
179.030<br>
10764.86<br>
3244.73<br>
-3197.33<br>
-746.37<br>
47°18'15.043"N<br>
102°47'50.000"W<br>
3.03<br>
13930.00<br>
90.680<br>
179.370<br>
10764.44<br>
3307.47<br>
-3260.32<br>
-745.49<br>
47°18'14.422"N<br>
102°47'49.987"W<br>
1.08<br>
13962.00<br>
91.110<br>
181.030<br>
10763.94<br>
3339.38<br>
-3292.32<br>
-745.61<br>
47°18'14.106"N<br>
102°47'49.989"W<br>
5.36<br>
14025.00<br>
91.420<br>
181.340<br>
10762.55<br>
3402.27<br>
-3355.29<br>
-746.91<br>
47°18'13.484"N<br>
102°47'50.007"W<br>
0.70<br>
14120.00<br>
91.420<br>
181.380<br>
10760.20<br>
3497.11<br>
-3450.23<br>
-749.16<br>
47°18'12.547"N<br>
102°47'50.040"W<br>
0.04<br>
<hr>
<A name=15></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 8 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
14152.00<br>
90.180<br>
181.070<br>
10759.75<br>
3529.06<br>
-3482.22<br>
-749.85<br>
47°18'12.231"N<br>
102°47'50.050"W<br>
3.99<br>
14215.00<br>
90.340<br>
180.710<br>
10759.46<br>
3591.95<br>
-3545.21<br>
-750.83<br>
47°18'11.610"N<br>
102°47'50.064"W<br>
0.63<br>
14310.00<br>
89.880<br>
180.620<br>
10759.28<br>
3686.75<br>
-3640.21<br>
-751.93<br>
47°18'10.672"N<br>
102°47'50.080"W<br>
0.49<br>
14342.00<br>
89.420<br>
180.330<br>
10759.48<br>
3718.68<br>
-3672.20<br>
-752.19<br>
47°18'10.356"N<br>
102°47'50.084"W<br>
1.70<br>
14404.00<br>
89.350<br>
180.040<br>
10760.14<br>
3780.51<br>
-3734.20<br>
-752.39<br>
47°18'09.744"N<br>
102°47'50.087"W<br>
0.48<br>
14498.00<br>
92.460<br>
180.080<br>
10758.66<br>
3874.22<br>
-3828.18<br>
-752.49<br>
47°18'08.817"N<br>
102°47'50.088"W<br>
3.31<br>
14593.00<br>
90.310<br>
180.860<br>
10756.36<br>
3968.97<br>
-3923.14<br>
-753.27<br>
47°18'07.880"N<br>
102°47'50.099"W<br>
2.41<br>
14625.00<br>
89.850<br>
180.990<br>
10756.32<br>
4000.91<br>
-3955.13<br>
-753.79<br>
47°18'07.564"N<br>
102°47'50.107"W<br>
1.49<br>
14688.00<br>
90.150<br>
180.090<br>
10756.32<br>
4063.77<br>
-4018.13<br>
-754.38<br>
47°18'06.942"N<br>
102°47'50.115"W<br>
1.51<br>
14720.00<br>
90.490<br>
180.840<br>
10756.14<br>
4095.70<br>
-4050.13<br>
-754.64<br>
47°18'06.626"N<br>
102°47'50.119"W<br>
2.57<br>
14783.00<br>
90.250<br>
178.880<br>
10755.73<br>
4158.50<br>
-4113.12<br>
-754.49<br>
47°18'06.005"N<br>
102°47'50.117"W<br>
3.13<br>
14814.00<br>
89.230<br>
180.390<br>
10755.87<br>
4189.39<br>
-4144.12<br>
-754.29<br>
47°18'05.699"N<br>
102°47'50.114"W<br>
5.88<br>
14878.00<br>
89.480<br>
179.950<br>
10756.59<br>
4253.22<br>
-4208.12<br>
-754.48<br>
47°18'05.067"N<br>
102°47'50.117"W<br>
0.79<br>
14909.00<br>
90.490<br>
180.200<br>
10756.60<br>
4284.13<br>
-4239.12<br>
-754.52<br>
47°18'04.761"N<br>
102°47'50.117"W<br>
3.36<br>
14973.00<br>
90.900<br>
179.700<br>
10755.82<br>
4347.94<br>
-4303.11<br>
-754.46<br>
47°18'04.129"N<br>
102°47'50.117"W<br>
1.01<br>
15004.00<br>
89.970<br>
179.450<br>
10755.59<br>
4378.83<br>
-4334.11<br>
-754.23<br>
47°18'03.824"N<br>
102°47'50.113"W<br>
3.11<br>
15068.00<br>
88.610<br>
179.910<br>
10756.38<br>
4442.61<br>
-4398.10<br>
-753.88<br>
47°18'03.192"N<br>
102°47'50.108"W<br>
2.24<br>
15162.00<br>
90.650<br>
179.510<br>
10756.99<br>
4536.30<br>
-4492.09<br>
-753.40<br>
47°18'02.264"N<br>
102°47'50.101"W<br>
2.21<br>
15194.00<br>
91.470<br>
180.000<br>
10756.40<br>
4568.19<br>
-4524.09<br>
-753.26<br>
47°18'01.949"N<br>
102°47'50.099"W<br>
2.99<br>
15257.00<br>
90.860<br>
179.180<br>
10755.12<br>
4630.96<br>
-4587.07<br>
-752.81<br>
47°18'01.327"N<br>
102°47'50.092"W<br>
1.62<br>
15352.00<br>
90.800<br>
180.080<br>
10753.74<br>
4725.62<br>
-4682.06<br>
-752.20<br>
47°18'00.389"N<br>
102°47'50.083"W<br>
0.95<br>
15384.00<br>
90.520<br>
180.340<br>
10753.37<br>
4757.54<br>
-4714.06<br>
-752.32<br>
47°18'00.074"N<br>
102°47'50.085"W<br>
1.19<br>
15447.00<br>
89.540<br>
180.600<br>
10753.34<br>
4820.39<br>
-4777.05<br>
-752.83<br>
47°17'59.452"N<br>
102°47'50.093"W<br>
1.61<br>
15542.00<br>
90.740<br>
180.270<br>
10753.11<br>
4915.17<br>
-4872.05<br>
-753.56<br>
47°17'58.514"N<br>
102°47'50.103"W<br>
1.31<br>
15606.00<br>
90.520<br>
181.080<br>
10752.40<br>
4979.03<br>
-4936.04<br>
-754.31<br>
47°17'57.883"N<br>
102°47'50.114"W<br>
1.31<br>
15637.00<br>
90.150<br>
181.160<br>
10752.22<br>
5009.98<br>
-4967.03<br>
-754.92<br>
47°17'57.577"N<br>
102°47'50.123"W<br>
1.22<br>
15700.00<br>
88.700<br>
181.240<br>
10752.85<br>
5072.88<br>
-5030.02<br>
-756.23<br>
47°17'56.955"N<br>
102°47'50.142"W<br>
2.31<br>
15732.00<br>
88.770<br>
180.750<br>
10753.56<br>
5104.82<br>
-5062.00<br>
-756.79<br>
47°17'56.639"N<br>
102°47'50.150"W<br>
1.55<br>
15827.00<br>
89.010<br>
180.670<br>
10755.40<br>
5199.61<br>
-5156.98<br>
-757.97<br>
47°17'55.702"N<br>
102°47'50.167"W<br>
0.27<br>
15922.00<br>
91.050<br>
180.550<br>
10755.35<br>
5294.40<br>
-5251.97<br>
-758.98<br>
47°17'54.765"N<br>
102°47'50.181"W<br>
2.15<br>
<hr>
<A name=16></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 9 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
16017.00<br>
91.080<br>
180.450<br>
10753.58<br>
5389.17<br>
-5346.95<br>
-759.81<br>
47°17'53.827"N<br>
102°47'50.193"W<br>
0.11<br>
16080.00<br>
90.770<br>
180.190<br>
10752.57<br>
5452.01<br>
-5409.94<br>
-760.16<br>
47°17'53.205"N<br>
102°47'50.199"W<br>
0.64<br>
16112.00<br>
90.620<br>
179.790<br>
10752.18<br>
5483.91<br>
-5441.94<br>
-760.15<br>
47°17'52.890"N<br>
102°47'50.198"W<br>
1.33<br>
16176.00<br>
90.090<br>
180.050<br>
10751.78<br>
5547.72<br>
-5505.93<br>
-760.06<br>
47°17'52.258"N<br>
102°47'50.197"W<br>
0.92<br>
16207.00<br>
90.220<br>
180.370<br>
10751.70<br>
5578.64<br>
-5536.93<br>
-760.18<br>
47°17'51.952"N<br>
102°47'50.199"W<br>
1.11<br>
16270.00<br>
90.500<br>
180.410<br>
10751.30<br>
5641.49<br>
-5599.93<br>
-760.61<br>
47°17'51.330"N<br>
102°47'50.205"W<br>
0.45<br>
16302.00<br>
90.520<br>
179.970<br>
10751.02<br>
5673.40<br>
-5631.93<br>
-760.71<br>
47°17'51.014"N<br>
102°47'50.206"W<br>
1.38<br>
16333.00<br>
89.820<br>
180.230<br>
10750.93<br>
5704.32<br>
-5662.93<br>
-760.77<br>
47°17'50.708"N<br>
102°47'50.207"W<br>
2.41<br>
16397.00<br>
89.510<br>
180.330<br>
10751.30<br>
5768.15<br>
-5726.93<br>
-761.08<br>
47°17'50.077"N<br>
102°47'50.212"W<br>
0.51<br>
16428.00<br>
89.350<br>
180.270<br>
10751.61<br>
5799.08<br>
-5757.92<br>
-761.24<br>
47°17'49.771"N<br>
102°47'50.214"W<br>
0.55<br>
16492.00<br>
89.540<br>
180.320<br>
10752.23<br>
5862.91<br>
-5821.92<br>
-761.57<br>
47°17'49.139"N<br>
102°47'50.219"W<br>
0.31<br>
16524.00<br>
90.830<br>
179.160<br>
10752.13<br>
5894.81<br>
-5853.92<br>
-761.43<br>
47°17'48.823"N<br>
102°47'50.217"W<br>
5.42<br>
16588.00<br>
91.390<br>
179.150<br>
10750.89<br>
5958.53<br>
-5917.90<br>
-760.48<br>
47°17'48.192"N<br>
102°47'50.203"W<br>
0.88<br>
16619.00<br>
91.290<br>
178.890<br>
10750.16<br>
5989.39<br>
-5948.89<br>
-759.95<br>
47°17'47.886"N<br>
102°47'50.195"W<br>
0.90<br>
16683.00<br>
89.910<br>
179.080<br>
10749.49<br>
6053.10<br>
-6012.87<br>
-758.82<br>
47°17'47.255"N<br>
102°47'50.179"W<br>
2.18<br>
16778.00<br>
89.910<br>
179.660<br>
10749.64<br>
6147.75<br>
-6107.87<br>
-757.77<br>
47°17'46.317"N<br>
102°47'50.164"W<br>
0.61<br>
16873.00<br>
91.080<br>
179.810<br>
10748.82<br>
6242.43<br>
-6202.86<br>
-757.34<br>
47°17'45.380"N<br>
102°47'50.157"W<br>
1.24<br>
16905.00<br>
90.920<br>
179.570<br>
10748.26<br>
6274.32<br>
-6234.85<br>
-757.16<br>
47°17'45.064"N<br>
102°47'50.155"W<br>
0.90<br>
16968.00<br>
90.220<br>
180.320<br>
10747.63<br>
6337.13<br>
-6297.85<br>
-757.10<br>
47°17'44.442"N<br>
102°47'50.154"W<br>
1.63<br>
17063.00<br>
89.260<br>
180.400<br>
10748.07<br>
6431.90<br>
-6392.85<br>
-757.70<br>
47°17'43.504"N<br>
102°47'50.162"W<br>
1.01<br>
17095.00<br>
89.480<br>
180.900<br>
10748.42<br>
6463.83<br>
-6424.84<br>
-758.06<br>
47°17'43.189"N<br>
102°47'50.168"W<br>
1.71<br>
17158.00<br>
88.850<br>
180.610<br>
10749.34<br>
6526.70<br>
-6487.83<br>
-758.89<br>
47°17'42.567"N<br>
102°47'50.180"W<br>
1.10<br>
17253.00<br>
89.970<br>
180.200<br>
10750.31<br>
6621.47<br>
-6582.82<br>
-759.56<br>
47°17'41.629"N<br>
102°47'50.189"W<br>
1.26<br>
17284.00<br>
90.830<br>
180.740<br>
10750.10<br>
6652.40<br>
-6613.82<br>
-759.82<br>
47°17'41.323"N<br>
102°47'50.193"W<br>
3.28<br>
17347.00<br>
91.230<br>
181.090<br>
10748.96<br>
6715.27<br>
-6676.80<br>
-760.82<br>
47°17'40.702"N<br>
102°47'50.207"W<br>
0.84<br>
17442.00<br>
90.490<br>
180.230<br>
10747.54<br>
6810.06<br>
-6771.78<br>
-761.92<br>
47°17'39.764"N<br>
102°47'50.223"W<br>
1.19<br>
17506.00<br>
89.660<br>
179.880<br>
10747.45<br>
6873.88<br>
-6835.78<br>
-761.98<br>
47°17'39.133"N<br>
102°47'50.224"W<br>
1.41<br>
17537.00<br>
89.690<br>
179.900<br>
10747.63<br>
6904.79<br>
-6866.78<br>
-761.92<br>
47°17'38.827"N<br>
102°47'50.223"W<br>
0.12<br>
17632.00<br>
90.950<br>
179.890<br>
10747.10<br>
6999.50<br>
-6961.78<br>
-761.74<br>
47°17'37.889"N<br>
102°47'50.221"W<br>
1.33<br>
17727.00<br>
91.630<br>
179.970<br>
10744.96<br>
7094.19<br>
-7056.75<br>
-761.63<br>
47°17'36.952"N<br>
102°47'50.219"W<br>
0.72<br>
<hr>
<A name=17></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 10 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
17791.00<br>
90.920<br>
180.130<br>
10743.54<br>
7157.99<br>
-7120.73<br>
-761.68<br>
47°17'36.320"N<br>
102°47'50.220"W<br>
1.14<br>
17822.00<br>
90.980<br>
180.380<br>
10743.02<br>
7188.91<br>
-7151.73<br>
-761.82<br>
47°17'36.014"N<br>
102°47'50.222"W<br>
0.83<br>
17917.00<br>
89.440<br>
179.700<br>
10742.68<br>
7283.64<br>
-7246.73<br>
-761.89<br>
47°17'35.077"N<br>
102°47'50.223"W<br>
1.77<br>
17949.00<br>
89.970<br>
179.850<br>
10742.84<br>
7315.54<br>
-7278.73<br>
-761.76<br>
47°17'34.761"N<br>
102°47'50.221"W<br>
1.72<br>
18011.00<br>
90.430<br>
178.550<br>
10742.62<br>
7377.28<br>
-7340.72<br>
-760.90<br>
47°17'34.149"N<br>
102°47'50.208"W<br>
2.22<br>
18107.00<br>
88.800<br>
178.640<br>
10743.27<br>
7472.79<br>
-7436.68<br>
-758.54<br>
47°17'33.202"N<br>
102°47'50.174"W<br>
1.70<br>
18202.00<br>
88.770<br>
178.130<br>
10745.28<br>
7567.26<br>
-7531.62<br>
-755.87<br>
47°17'32.265"N<br>
102°47'50.135"W<br>
0.54<br>
18233.00<br>
89.600<br>
177.980<br>
10745.72<br>
7598.07<br>
-7562.60<br>
-754.82<br>
47°17'31.959"N<br>
102°47'50.120"W<br>
2.72<br>
18296.00<br>
90.870<br>
177.770<br>
10745.47<br>
7660.66<br>
-7625.56<br>
-752.48<br>
47°17'31.338"N<br>
102°47'50.086"W<br>
2.04<br>
18328.00<br>
89.970<br>
178.020<br>
10745.23<br>
7692.46<br>
-7657.53<br>
-751.30<br>
47°17'31.022"N<br>
102°47'50.069"W<br>
2.92<br>
18392.00<br>
89.690<br>
177.420<br>
10745.42<br>
7756.03<br>
-7721.48<br>
-748.76<br>
47°17'30.391"N<br>
102°47'50.032"W<br>
1.03<br>
18455.00<br>
91.110<br>
177.710<br>
10744.98<br>
7818.59<br>
-7784.42<br>
-746.08<br>
47°17'29.770"N<br>
102°47'49.993"W<br>
2.30<br>
18550.00<br>
89.850<br>
178.240<br>
10744.19<br>
7912.99<br>
-7879.36<br>
-742.72<br>
47°17'28.833"N<br>
102°47'49.944"W<br>
1.44<br>
18582.00<br>
90.680<br>
178.380<br>
10744.04<br>
7944.82<br>
-7911.34<br>
-741.78<br>
47°17'28.517"N<br>
102°47'49.931"W<br>
2.63<br>
18614.00<br>
90.920<br>
178.340<br>
10743.59<br>
7976.64<br>
-7943.33<br>
-740.87<br>
47°17'28.202"N<br>
102°47'49.917"W<br>
0.76<br>
18677.00<br>
89.350<br>
179.100<br>
10743.44<br>
8039.33<br>
-8006.31<br>
-739.46<br>
47°17'27.580"N<br>
102°47'49.897"W<br>
2.77<br>
18708.00<br>
89.540<br>
180.150<br>
10743.74<br>
8070.22<br>
-8037.31<br>
-739.26<br>
47°17'27.274"N<br>
102°47'49.894"W<br>
3.44<br>
18771.00<br>
91.390<br>
181.060<br>
10743.23<br>
8133.08<br>
-8100.30<br>
-739.92<br>
47°17'26.652"N<br>
102°47'49.903"W<br>
3.27<br>
18803.00<br>
90.400<br>
180.790<br>
10742.73<br>
8165.02<br>
-8132.29<br>
-740.44<br>
47°17'26.337"N<br>
102°47'49.911"W<br>
3.21<br>
18867.00<br>
88.500<br>
181.000<br>
10743.35<br>
8228.90<br>
-8196.28<br>
-741.44<br>
47°17'25.705"N<br>
102°47'49.925"W<br>
2.99<br>
18899.00<br>
88.280<br>
181.750<br>
10744.24<br>
8260.85<br>
-8228.25<br>
-742.20<br>
47°17'25.389"N<br>
102°47'49.936"W<br>
2.44<br>
18962.00<br>
88.400<br>
181.640<br>
10746.07<br>
8323.75<br>
-8291.20<br>
-744.07<br>
47°17'24.768"N<br>
102°47'49.963"W<br>
0.26<br>
19058.00<br>
89.820<br>
181.120<br>
10747.56<br>
8419.61<br>
-8387.16<br>
-746.38<br>
47°17'23.821"N<br>
102°47'49.997"W<br>
1.58<br>
19090.00<br>
90.740<br>
180.650<br>
10747.40<br>
8451.55<br>
-8419.15<br>
-746.87<br>
47°17'23.505"N<br>
102°47'50.004"W<br>
3.23<br>
19153.00<br>
90.770<br>
180.670<br>
10746.57<br>
8514.41<br>
-8482.14<br>
-747.60<br>
47°17'22.884"N<br>
102°47'50.015"W<br>
0.06<br>
19248.00<br>
89.290<br>
179.980<br>
10746.52<br>
8609.18<br>
-8577.14<br>
-748.14<br>
47°17'21.946"N<br>
102°47'50.022"W<br>
1.72<br>
19342.00<br>
90.740<br>
180.280<br>
10746.50<br>
8702.92<br>
-8671.14<br>
-748.35<br>
47°17'21.018"N<br>
102°47'50.025"W<br>
1.58<br>
19438.00<br>
88.520<br>
179.680<br>
10747.12<br>
8798.63<br>
-8767.13<br>
-748.32<br>
47°17'20.071"N<br>
102°47'50.025"W<br>
2.40<br>
19533.00<br>
90.310<br>
179.300<br>
10748.09<br>
8893.28<br>
-8862.11<br>
-747.47<br>
47°17'19.133"N<br>
102°47'50.013"W<br>
1.93<br>
19564.00<br>
90.280<br>
179.290<br>
10747.93<br>
8924.16<br>
-8893.11<br>
-747.09<br>
47°17'18.827"N<br>
102°47'50.007"W<br>
0.10<br>
<hr>
<A name=18></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 11 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH DATA (288 stations)<br>
MD<br>
Inclination Azimuth<br>
TVD<br>
Vert Sect<br>
North<br>
East<br>
Latitude<br>
Longitude<br>
DLS<br>
Comments<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[°/100ft]<br>
19659.00<br>
90.520 180.190 10747.27<br>
9018.85<br>
-8988.11 -746.66<br>
47°17'17.890"N<br>
102°47'50.001"W<br>
0.98<br>
19754.00<br>
91.510 179.990 10745.58<br>
9113.57<br>
-9083.09 -746.81<br>
47°17'16.952"N<br>
102°47'50.003"W<br>
1.06<br>
19817.00<br>
91.510 180.110 10743.92<br>
9176.37<br>
-9146.07 -746.86<br>
47°17'16.331"N<br>
102°47'50.004"W<br>
0.19<br>
19849.00<br>
91.880 179.530 10742.98<br>
9208.26<br>
-9178.05 -746.76<br>
47°17'16.015"N<br>
102°47'50.002"W<br>
2.15<br>
19912.00<br>
91.230 180.500 10741.27<br>
9271.05<br>
-9241.03 -746.78<br>
47°17'15.394"N<br>
102°47'50.002"W<br>
1.85<br>
19944.00<br>
89.480 180.400 10741.07<br>
9302.98<br>
-9273.03 -747.03<br>
47°17'15.078"N<br>
102°47'50.006"W<br>
5.48<br>
20007.00<br>
89.820 181.600 10741.45<br>
9365.87<br>
-9336.02 -748.13<br>
47°17'14.456"N<br>
102°47'50.022"W<br>
1.98<br>
20102.00<br>
89.540 181.300 10741.98<br>
9460.74<br>
-9430.98 -750.53<br>
47°17'13.519"N<br>
102°47'50.057"W<br>
0.43<br>
20133.00<br>
89.780 181.340 10742.17<br>
9491.70<br>
-9461.97 -751.25<br>
47°17'13.213"N<br>
102°47'50.067"W<br>
0.78<br>
20197.00<br>
88.860 181.230 10742.93<br>
9555.60<br>
-9525.95 -752.68<br>
47°17'12.581"N<br>
102°47'50.088"W<br>
1.45<br>
20292.00<br>
90.340 180.450 10743.59<br>
9650.42<br>
-9620.94 -754.08<br>
47°17'11.644"N<br>
102°47'50.108"W<br>
1.76<br>
20324.00<br>
90.610 181.310 10743.33<br>
9682.36<br>
-9652.93 -754.57<br>
47°17'11.328"N<br>
102°47'50.115"W<br>
2.82<br>
20355.00<br>
89.660 181.240 10743.25<br>
9713.31<br>
-9683.92 -755.26<br>
47°17'11.022"N<br>
102°47'50.125"W<br>
3.07<br>
20418.00<br>
92.340 181.280 10742.15<br>
9776.21<br>
-9746.89 -756.64<br>
47°17'10.401"N<br>
102°47'50.145"W<br>
4.25<br>
20513.00<br>
92.190 181.770 10738.40<br>
9871.02<br>
-9841.79 -759.17<br>
47°17'09.464"N<br>
102°47'50.182"W<br>
0.54<br>
20576.00<br>
92.240 181.640 10735.96<br>
9933.90<br>
-9904.71 -761.04<br>
47°17'08.843"N<br>
102°47'50.209"W<br>
0.22<br>
20622.00<br>
92.280 182.710 10734.15<br>
9979.83<br>
-9950.64 -762.79<br>
47°17'08.390"N<br>
102°47'50.234"W<br>
2.33 LAST BHI MWD SURVEY<br>
20702.00<br>
92.280 182.710 10730.97 10059.74 -10030.49 -766.56<br>
47°17'07.602"N<br>
102°47'50.289"W<br>
0.00 PROJECTION TO BIT<br>
HOLE & CASING SECTIONS - </span><span class="ft9">Ref Wellbore: HANSON 11X-12A AWB<br>
Ref Wellpath: HANSON 11X-12A AWP<br>
String/Diameter<br>
Start MD<br>
End MD<br>
Interval<br>
Start TVD<br>
End TVD<br>
Start N/S<br>
Start E/W<br>
End N/S<br>
End E/W<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
9.625in Casing Surface<br>
24.00<br>
2252.00<br>
2228.00<br>
24.00<br>
2251.97<br>
0.00<br>
0.00<br>
1.93<br>
0.65<br>
8.75in Open Hole<br>
2252.00<br>
11126.00<br>
8874.00<br>
2251.97<br>
10776.90<br>
1.93<br>
0.65<br>
-492.15<br>
-555.75<br>
7in Casing Intermediate<br>
24.00<br>
11093.00<br>
11069.00<br>
24.00<br>
10775.78<br>
0.00<br>
0.00<br>
-463.37<br>
-539.66<br>
6in Open Hole<br>
11126.00<br>
20702.00<br>
9576.00<br>
10776.90<br>
10730.97<br>
-492.15<br>
-555.75<br>
-10030.49<br>
-766.56<br>
<hr>
<A name=19></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 12 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
TARGETS<br>
Name<br>
MD<br>
TVD<br>
North<br>
East<br>
Grid East<br>
Grid North<br>
Latitude<br>
Longitude<br>
Shape<br>
[ft]<br>
[ft]<br>
[ft]<br>
[ft]<br>
[US ft]<br>
[US ft]<br>
0.00<br>
0.00<br>
0.00<br>
1399480.31<br>
608700.68<br>
47°18'46.600"N<br>
102°47'39.170"W polygon<br>
SEC.12-T144N-R96W<br>
0.00<br>
0.00<br>
0.00<br>
1399480.31<br>
608700.68<br>
47°18'46.600"N<br>
102°47'39.170"W polygon<br>
SEC.13-T144N-R96W<br>
SEC.12/13-T144N-R96W<br>
10773.00<br>
0.00<br>
0.00<br>
1399480.31<br>
608700.68<br>
47°18'46.600"N<br>
102°47'39.170"W polygon<br>
HARDLINES (200'FNL/FSL &<br>
500'FEL/FWL)<br>
HANSON 11X-12A BHL ON PLAT<br>
10773.00 -10030.67 -759.75<br>
1398428.01<br>
598696.79<br>
47°17'07.600"N<br>
102°47'50.190"W<br>
point<br>
(250'FSL & 550'FWL, SEC.13)<br>
HANSON 11X-12A BHL REV-1<br>
10773.00 -10031.00 -763.00<br>
1398424.75<br>
598696.55<br>
47°17'07.597"N<br>
102°47'50.237"W<br>
point<br>
(250'FSL & 550'FWL, SEC.13)<br>
WELLPATH COMPOSITION - </span><span class="ft7">Ref Wellbore: HANSON 11X-12A AWB<br>
Ref Wellpath: HANSON 11X-12A AWP<br>
Start MD End MD<br>
Positional Uncertainty Model<br>
Log Name/Comment<br>
Wellbore<br>
[ft]<br>
[ft]<br>
24.00<br>
2234.00 ISCWSA MWD, Rev. 0 (Standard) SURFACE SURVEYS PROVIDED BY XTO <148-2234><br>
HANSON 11X-12A AWB<br>
2234.00 11076.00 NaviTrak (MagCorr)<br>
BHI MWD/NAVITRAK (MAGCORR) 8.75" HOLE <2262-11076><br>
HANSON 11X-12A AWB<br>
11076.00 20622.00 NaviTrak (MagCorr)<br>
BHI MWD/NAVITRAK (MAGCORR) 6" HOLE <11119-20622><br>
HANSON 11X-12A AWB<br>
20622.00 20702.00 Blind Drilling (std)<br>
Projection to bit<br>
HANSON 11X-12A AWB<br>
<hr>
<A name=20></a>Actual Wellpath Report<br>
HANSON 11X-12A AWP<br>
Page 13 of 13<br>
REFERENCE WELLPATH IDENTIFICATION<br>
Operator XTO ENERGY<br>
Slot<br>
SLOT#01 HANSON 11X-12A (284'FNL & 1296'FWL, SEC.12)<br>
Area<br>
NORTH DAKOTA<br>
Well<br>
HANSON 11X-12A<br>
Field<br>
DUNN COUNTY<br>
Wellbore HANSON 11X-12A AWB<br>
Facility SEC.12-T144N-R96W<br>
WELLPATH COMMENTS<br>
MD<br>
Inclination<br>
Azimuth<br>
TVD<br>
Comment<br>
[ft]<br>
[°]<br>
[°]<br>
[ft]<br>
2234.00<br>
0.480<br>
144.510<br>
2233.97 TIED ONTO SURFACE SURVEYS<br>
2262.00<br>
0.830<br>
136.280<br>
2261.97 FIRST BHI MWD SURVEY<br>
20622.00<br>
92.280<br>
182.710<br>
10734.15 LAST BHI MWD SURVEY<br>
20702.00<br>
92.280<br>
182.710<br>
10730.97 PROJECTION TO BIT<br>
<hr>
<A name=21></a>XTO Energy, Inc.<br>
Hanson 11X-12A<br>
284' FNL & 1,296' FWL<br>
NW NW Section 12, T144N, R96W<br>
Murphy Creek Field / Middle Bakken<br>
Dunn County, North Dakota<br>
BOTTOM HOLE LOCATION:<br>
10,030.53' south & 766.48' west of surface location or approx.<br>
249.05' FSL & 529.52' FWL, SW SW Section 13, T144N, R96W<br>
Prepared for:<br>
Prepared by:<br>
Charles Musekamp<br>
Miles Anson, Ben Linton<br>
XTO Energy, Inc.<br>
1415 E Blackwood Ln, Spokane WA 99223<br>
9127 South Jamaica Street<br>
(509) 209-3014<br>
Englewood, CO 80112<br>
<A href="mailto:AnsonGeophysical@gmail.com">AnsonGeophysical@gmail.com</a><br>
<hr>
<A name=22></a><hr>
<A name=23></a>Well Information<br>
OPERATOR:<br>
XTO Energy, Inc.<br>
ADDRESS:<br>
9127 South Jamaica Street<br>
Englewood, CO 80112<br>
WELL NAME:<br>
Hanson 11X-12A<br>
API #:<br>
33-025-02647<br>
WELL FILE #:<br>
29156<br>
SURFACE LOCATION:<br>
284' FNL & 1,296' FWL<br>
NW NW Section 12, T144N, R96W<br>
FIELD/ OBJECTIVE:<br>
Murphy Creek Field / Middle Bakken<br>
COUNTY, STATE<br>
Dunn County, North Dakota<br>
BASIN:<br>
Williston<br>
WELL TYPE:<br>
Middle Bakken Horizontal<br>
ELEVATION:<br>
GL: 2,310'<br>
KB: 2,334'<br>
SPUD/ RE-ENTRY DATE:<br>
October 13, 2014<br>
BOTTOM HOLE LOCATION:<br>
10,030.53' south & 766.48' west of surface location or approx.<br>
249.05' FSL & 529.52' FWL, SW SW Section 13, T144N, R96W<br>
CLOSURE COORDINATES:<br>
Closure Azimuth: 184.37°<br>
Closure Distance: 10,059.77'<br>
TOTAL DEPTH / DATE:<br>
20,702' on December 16, 2014<br>
100% within target interval<br>
TOTAL DRILLING DAYS:<br>
22 days<br>
CONTRACTOR:<br>
Nabors #109<br>
PUMPS:<br>
Continental Emsco F-1000 (stroke length - 10")<br>
<hr>
<A name=24></a>TOOLPUSHERS:<br>
Will Spears, Robert Ramsey<br>
FIELD SUPERVISORS:<br>
Dallas Lawrey, Darren Yoder<br>
CHEMICAL COMPANY:<br>
Badlands Drilling Fluids; Fluid Control<br>
MUD ENGINEER:<br>
Regan Taylor, Jeff Paulson<br>
MUD TYPE:<br>
Fresh water in surface hole<br>
Diesel invert in vertical and curve; Salt water in lateral<br>
MUD LOSSES:<br>
Invert Mud: 153 bbls, Salt Water: 0 bbls<br>
PROSPECT GEOLOGIST:<br>
Charles Musekamp<br>
WELLSITE GEOLOGISTS:<br>
Miles Anson, Ben Linton<br>
GEOSTEERING SYSTEM:<br>
Anson Digital Wellsite Geological System<br>
ROCK SAMPLING:<br>
30' from 9,000' - 20,702'<br>
SAMPLE EXAMINATION:<br>
Binocular microscope & fluoroscope<br>
SAMPLE CUTS:<br>
Trichloroethylene (Carbo-Sol)<br>
GAS DETECTION:<br>
Noram total gas with chromatograph<br>
ELECTRIC LOGS:<br>
n/a<br>
DRILL STEM TESTS:<br>
n/a<br>
DIRECTIONAL DRILLERS:<br>
Baker Hughes<br>
Shawn Todd, Robert Walsch<br>
MWD:<br>
Baker Hughes<br>
Erik Neva, Dustin Winterscheidt<br>
CASING:<br>
Surface: 9 5/8" 36# J-55 set to 2,254'<br>
Intermediate: 7" 29# & 32# HCP-110 set to 11,093'<br>
SAFETY/ H</span><span class="ft2">2</span><span class="ft0">S MONITORING:<br>
Total Safety<br>
<hr>
<A name=25></a>KEY OFFSET WELLS:<br>
XTO Energy, Inc.<br>
Hanson 11X-12E<br>
SE SW Sec. 12, T144N, R96W<br>
Dunn County, ND<br>
Marathon<br>
Kovaloff 1<br>
SE SW Sec. 13, T144N, R96W<br>
Dunn County, ND<br>
<hr>
<A name=26></a>Time Vs Depth<br>
XTO Energy, Inc.<br>
Hanson 11X-12A<br>
0'<br>
Spud -- October 13, 2014<br>
1,000'<br>
TOOH bit #1 @ 2,159' for surface casing: 9 " set to 2,254'; Skid away 10/15/14<br>
2,000'<br>
Skid Back 12/23/13; TIH bit #2 for vertical<br>
3,000'<br>
TOOH bit #2 @ 3,144' for MWD; TIH bit #2RR for vertical<br>
4,000'<br>
5,000'<br>
6,000'<br>
7,000'<br>
TOOH bit #2RR @ 7,610' for Low ROP; TIH bit #3 for vertical<br>
8,000'<br>
9,000'<br>
h(ft)<br>
10,000'<br>
dDept<br>
TOOH bit #3 @ 10,323' for curve<br>
tools; TIH bit #4 for curve<br>
sure<br>
11,000'<br>
ea<br>
Intermediate Casing:<br>
TOOH bit #4 @ 11,126' for<br>
M<br>
7" set to 11,093'<br>
casing, TIH bit #5 for lateral<br>
12,000'<br>
TOOH bit #5 @ 11,753' for motor<br>
failure, TIH bit #5RR for lateral<br>
13,000'<br>
14,000'<br>
15,000'<br>
16,000'<br>
17,000'<br>
18,000'<br>
19,000'<br>
20,000'<br>
TD of 20,702' - December 16, 2014<br>
0<br>
1<br>
2<br>
3<br>
4<br>
5<br>
6<br>
7<br>
8<br>
9<br>
10<br>
11<br>
12<br>
13<br>
14<br>
15<br>
16<br>
17<br>
18<br>
19<br>
20<br>
21<br>
22<br>
23<br>
Days from spud<br>
<hr>
<A name=27></a>DAILY DRILLING SUMMARY<br>
WOB<br>
WOB<br>
Date<br>
Depth (0600<br>
24 Hr<br>
(Klbs)<br>
(Klbs)<br>
RPM RPM<br>
Day<br>
2014<br>
Hrs)<br>
Footage Bit #<br>
RT<br>
MM<br>
(RT) (MM)<br>
PP SPM 1 SPM 2 GPM<br>
24 Hr Activity<br>
Formation<br>
0<br>
10/13<br>
105'<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
Surface<br>
Move rig from Hanson11X-12E, strap collars and<br>
1<br>
10/14<br>
828'<br>
723<br>
1<br>
15<br>
-<br>
110<br>
-<br>
650<br>
-<br>
-<br>
255 prespud meeting, drill 100'-828'.<br>
Surface<br>
2<br>
10/15<br>
2,259'<br>
1431<br>
1<br>
20<br>
-<br>
80<br>
-<br>
650<br>
-<br>
-<br>
525 Drill from 828'-2,259', CBU, wiper trip.<br>
Surface<br>
Wiper trip, CBU, trip out, lay down BHA, ran 9 5/8<br>
casing, set casing at 2,254', CBU, PJSM and rig up<br>
3<br>
10/16<br>
2,259'<br>
0<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
Nabors cementing, cement surface casing.<br>
Surface<br>
Skid rig from Hanson 11X-12E to Hanson 11X-12A,<br>
nipple up BOP's stab BOP's on well head, put on<br>
orbit valve, flow line, working with crane on installing<br>
4<br>
11/28<br>
2,259'<br>
0<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
flowline to pits, working on choke line.<br>
Surface<br>
Nipple up BOP's. Center rig over hole. Nipple up<br>
flow line, choke lines, orbit valve, drilling choke.<br>
Change bolt on rotating head. Attach accumulator<br>
lines to suit cases. 30' and 90' mouseholes. Pre job<br>
safety meeting. Test BOP's. Install wear bushing.<br>
Pick up BHA. Trip in hole. Tag cement at 2,194'.<br>
Warm up mud motor. Drilling from 2,194' to 2,269'.<br>
5<br>
11/29<br>
2,859'<br>
600<br>
2<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
FIT test. Drill from 2,269' to 2,859'.<br>
Surface<br>
Drill from 2,859' to 3,049'. Trouble shoot MWD.<br>
Drill from 3,049' to 3,144'. Trouble shoot MWD.<br>
Pump dry job. TOOH. Lay down BHA. Pick up BHA.<br>
TIH to 2,387'. Test motor and MWD. TIH. Trouble<br>
shoot MWD. Drill from 3,144' to 3,337'. Service rig.<br>
6<br>
11/30<br>
4,985'<br>
2126<br>
2<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
Drill from 3,337' to 4,985'.<br>
Greenhorn<br>
Drill from 4,485' to 6,477'. Service rig. Drill from<br>
7<br>
12/1<br>
7,109'<br>
2124<br>
2RR<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
6,477' to 7,109'.<br>
Spearfish<br>
Drill from 7,109' to 7,408'. Drill from 7,408' to<br>
8<br>
12/2<br>
7,607'<br>
498<br>
2RR<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
7,607'.<br>
Opeche<br>
Drill from 7,607' to 7,610'. Spot pill TOOH. Lay<br>
down BHA. Pick up BHA. TIH to 2,288'. Test tool.<br>
TIH. Drill from 7,610' to 7,629'. Service rig. Drill<br>
9<br>
12/3<br>
8,060'<br>
453<br>
3<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
from 7,629' to 8,060'.<br>
Minnelusa<br>
<hr>
<A name=28></a>DAILY DRILLING SUMMARY<br>
WOB<br>
WOB<br>
Date<br>
Depth (0600<br>
24 Hr<br>
(Klbs)<br>
(Klbs)<br>
RPM RPM<br>
Day<br>
2014<br>
Hrs)<br>
Footage Bit #<br>
RT<br>
MM<br>
(RT) (MM)<br>
PP SPM 1 SPM 2 GPM<br>
24 Hr Activity<br>
Formation<br>
Rotary drilling from 8,060' to 8,592'. Service top<br>
drive. Held spill drill. Rotary drilling from 8,592' to<br>
10<br>
12/4<br>
8,966'<br>
906<br>
3<br>
25<br>
8<br>
50<br>
191<br>
2500<br>
83<br>
83<br>
579 8,964'.<br>
Charles<br>
Rotary drilling from 8,956' to 9,166'. Circulate and<br>
condition around salts. Service top drive. Adjusted<br>
Mission<br>
11<br>
12/5<br>
9,606'<br>
640<br>
3<br>
30<br>
8<br>
55<br>
191<br>
2500<br>
83<br>
83<br>
579 rig for level. Rotary drilling from 9,166' to 9,606'.<br>
Canyon<br>
Rotary drilling from 9,606' to 10,035'. Service top<br>
drive. Rotary drilling from 10,035' to 10,323'.<br>
12<br>
12/6<br>
10,323'<br>
717<br>
3<br>
33<br>
10<br>
55<br>
191<br>
2500<br>
83<br>
83<br>
579 Circulate and condition. Send pill. Trip out of hole.<br>
Lodgepole<br>
Trip out of hole for curve tools. Lay down BHA.<br>
Pick up BHA. Trip in hole. Circulate and condition.<br>
Test tool at 2,324'. Trip in hole. Test tool at 5,176'<br>
and 8,034'. Service rig. Slide drill building curve<br>
13<br>
12/7<br>
10,707'<br>
384<br>
4<br>
6<br>
20<br>
15<br>
160<br>
2800<br>
79<br>
79<br>
550 from 10,323' to 10,707'.<br>
Lodgepole<br>
Slide drilling from 10,707' to 11,126'. Service rig.<br>
Middle<br>
14<br>
12/8<br>
11,126'<br>
419<br>
4<br>
6<br>
20<br>
15<br>
160<br>
2800<br>
79<br>
79<br>
550 Circulate and condition. Trip out of hole.<br>
Bakken<br>
Trip out of hole. Circulate and condition. Trip out of<br>
hole. Flow check. Lay down pipe. Service rig. Lay<br>
down pipe. Lay down BHA. Run casing. Circulate<br>
Middle<br>
15<br>
12/9<br>
11,126'<br>
0<br>
4<br>
6<br>
20<br>
15<br>
160<br>
2800<br>
79<br>
79<br>
550 and condition. Rig up cement. Cement casing.<br>
Bakken<br>
Cement casing. Pressure test. Rig down<br>
cementers. Install wear bushing. Install shaker<br>
screens and fill pits with salt water. Cut drilling line.<br>
Pick up BHA. Service rig. Pick up drill pipe.<br>
Circulate and condition, warm motor and test MWD.<br>
Pick up drill pipe. Install rotating rubber. Pick up<br>
Middle<br>
16<br>
12/10<br>
11,126'<br>
0<br>
4<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
drill pipe. Service top drive.<br>
Bakken<br>
Drill cement float and shoe. Drilling from 11,126' to<br>
11,146'. FIT test 2060 PSI for 13.5 MW. Drilling<br>
from 11,146' to 11,596'. Service top drive. Drilling<br>
Middle<br>
17<br>
12/11<br>
11,753'<br>
627<br>
5<br>
10<br>
20<br>
50<br>
280<br>
2500<br>
-<br>
80<br>
280 from 11,596' to 11,753'. Spot pill. Trip out of hole.<br>
Bakken<br>
Trip in hole. Circulate and condition. Warm and test<br>
tool at 2,972'. Trip in hole to 8,653'. Service top<br>
drive. Trip in hole. Drill from 11,753' to 12,026'.<br>
Middle<br>
18<br>
12/12<br>
12,963'<br>
1210<br>
5RR<br>
5<br>
25<br>
50<br>
280<br>
2500<br>
-<br>
80<br>
280 Drill from 12,026' to 12,963'.<br>
Bakken<br>
<hr>
<A name=29></a>DAILY DRILLING SUMMARY<br>
WOB<br>
WOB<br>
Date<br>
Depth (0600<br>
24 Hr<br>
(Klbs)<br>
(Klbs)<br>
RPM RPM<br>
Day<br>
2014<br>
Hrs)<br>
Footage Bit #<br>
RT<br>
MM<br>
(RT) (MM)<br>
PP SPM 1 SPM 2 GPM<br>
24 Hr Activity<br>
Formation<br>
Drill from 12,963' to 13,974'. Service rig. Drill from<br>
Middle<br>
19<br>
12/13<br>
15,048'<br>
2085<br>
5RR<br>
20<br>
15<br>
55<br>
280<br>
3000<br>
-<br>
80<br>
280 13,974' to 15,048'.<br>
Bakken<br>
Drill from 15,048' to 16,124'. Service rig. Drill from<br>
16,124' to 16,472'. Lay down 2 joints bad pipe with<br>
wash pipe and replace with new. Drill from 16,472'<br>
Middle<br>
20<br>
12/14<br>
17,139'<br>
2091<br>
5RR<br>
11<br>
12<br>
56<br>
275<br>
3100<br>
80<br>
-<br>
275 to 17,139'.<br>
Bakken<br>
Drill form 17,139' to 17,613'. Change rotating<br>
head/rubber. Drill from 17,613' to 18,102'. Service<br>
Middle<br>
21<br>
12/15<br>
18,974'<br>
1835<br>
5RR<br>
25<br>
20<br>
55<br>
279<br>
3400<br>
80<br>
-<br>
279 rig. Drill from 18,102' to 18,974'.<br>
Bakken<br>
Drill from 18,874' to 20,603'. Condition and<br>
Middle<br>
22<br>
12/16<br>
20,603'<br>
1629<br>
5RR<br>
20<br>
20<br>
55<br>
279<br>
3350<br>
80<br>
-<br>
279 circulate.<br>
Bakken<br>
Service rig, rotary drill from 20,603' to 20,702',<br>
circulate and condition, shut in casing test, circulate<br>
and condition bottoms up, TOOH, TIH, service rig,<br>
circulate and condition bottoms up, spot pill, TOOH,<br>
Middle<br>
23<br>
12/17<br>
20,702'<br>
99<br>
5RR<br>
20<br>
20<br>
55<br>
279<br>
3350<br>
80<br>
-<br>
280 spot pill, TOOH.<br>
Bakken<br>
<hr>
<A name=30></a>DAILY MUD SUMMARY<br>
Gels<br>
Date<br>
Mud<br>
Mud VIS<br>
PV YP (lbs/<br>
Cake<br>
Cor.<br>
Excess<br>
LGS/<br>
(lbs/<br>
600/<br>
NAP/ H</span><span class="ft1">2</span><span class="ft0">0<br>
Oil/ H</span><span class="ft1">2</span><span class="ft0">0<br>
Cl</span><span class="ft1">-<br>
Salinity Electric Gain/ Loss<br>
2014<br>
Depth<br>
WT (sec/<br>
(API/<br>
Solids<br>
Alk pH<br>
Lime<br>
HGS<br>
(ppg) qt) (cP) 100 ft</span><span class="ft1">2</span><span class="ft0">)<br>
300<br>
(ratio)<br>
(%)<br>
(ppm)<br>
Stability<br>
(bbls)<br>
100 ft</span><span class="ft1">2</span><span class="ft0">)<br>
HTHP)<br>
(%)<br>
(lb/bbl) (mg/L)<br>
(%)<br>
10/14<br>
828'<br>
8.5<br>
29<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
10/15 2,259'<br>
8.80<br>
27<br>
-<br>
1<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
8.5<br>
-<br>
2.1K<br>
-<br>
-<br>
-<br>
-<br>
10/16 2,259'<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
11/28 2,259'<br>
9.90<br>
105<br>
22<br>
16<br>
14/19<br>
60/38<br>
78.9/21.1<br>
2<br>
10.0<br>
69/18.5<br>
1.8<br>
-<br>
2.3<br>
42K<br>
2.4/7.5 264,320<br>
735<br>
-<br>
11/29 3,145'<br>
9.70<br>
73<br>
20<br>
9<br>
8/13<br>
49/29<br>
77.4/22.6<br>
2<br>
8.8<br>
68.5/20<br>
1.5<br>
-<br>
1.9<br>
44K<br>
2.3/6.7 264,320<br>
644<br>
-<br>
11/30 5,625'<br>
9.85<br>
68<br>
20<br>
10<br>
9/14<br>
50/30<br>
79.4/20.6<br>
2<br>
10.1<br>
69.5/18<br>
1.6<br>
-<br>
2.1<br>
41K<br>
2.9/7.2 264,320<br>
661<br>
-<br>
12/01 7,224'<br>
9.85<br>
53<br>
19<br>
8<br>
8/14<br>
46/27<br>
82.2/17.8<br>
2<br>
13.0<br>
71.5/15.5 2.1<br>
-<br>
2.7<br>
36K<br>
3.8/7.1 264,320<br>
734<br>
-<br>
12/02 7,610'<br>
9.95<br>
59<br>
18<br>
8<br>
8/14<br>
44/26<br>
82.8/17.2<br>
2<br>
11.0<br>
72.0/15.0 1.9<br>
-<br>
2.5<br>
35K<br>
3.3/7.9 264,320<br>
792<br>
-<br>
12/03 7,958'<br>
9.80<br>
58<br>
21<br>
13<br>
13/18<br>
55/34<br>
79.3/20.7<br>
2<br>
13.0<br>
69.0/18.0 2.3<br>
-<br>
3.0<br>
42K<br>
3.4/7.2 264,320<br>
862<br>
/-11<br>
12/04 9,058' 10.10<br>
52<br>
18<br>
9<br>
9/14<br>
45/27<br>
84.9/15.1<br>
2<br>
14.0<br>
73.0/13.0 2.1<br>
-<br>
2.7<br>
32K<br>
3.9/8.3 264,320<br>
928<br>
/-37<br>
12/05 9,775' 10.10<br>
58<br>
22<br>
12<br>
12/16<br>
56/34<br>
82.6/17.4<br>
2<br>
14.0<br>
71.0/15.0 2.4<br>
-<br>
3.1<br>
36K<br>
3.9/8.1 264,320<br>
813<br>
/-40<br>
12/06 10,323' 10.30<br>
76<br>
25<br>
14<br>
13/18<br>
64/39<br>
80.7/19.3<br>
2<br>
12.4<br>
69.0/16.5 2.3<br>
-<br>
3.0<br>
35K<br>
3.7/8.6 264,320<br>
844<br>
/-80<br>
12/07 10,847' 10.60<br>
59<br>
26<br>
15<br>
14/19<br>
67/41<br>
80.4/19.6<br>
2<br>
13.9<br>
67.5/19.6 2.3<br>
-<br>
3.0<br>
34K<br>
4.0/9.9 253,502<br>
747<br>
/-21<br>
12/08<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
Change mud from diesel invert to salt water<br>
12/09 11,126'<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
12/10 11,126'<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
12/11 11,753' 10.00<br>
27<br>
1<br>
1<br>
1/1<br>
3/2<br>
-<br>
-<br>
10.0<br>
0.2/89.8<br>
-<br>
8<br>
0<br>
185K 0.2/0.0<br>
-<br>
-<br>
-<br>
12/12 13,253' 10.00<br>
27<br>
1<br>
1<br>
1/1<br>
3/3<br>
-<br>
-<br>
10.1<br>
0.3/89.2<br>
-<br>
9<br>
1.0<br>
186K 0.2/1.0<br>
-<br>
-<br>
-<br>
12/13 15,428' 10.00<br>
27<br>
1<br>
1<br>
1/1<br>
3/3<br>
-<br>
-<br>
10.0<br>
0.5/89.5<br>
-<br>
8.5<br>
2.0<br>
189K 0.1/0.0<br>
-<br>
-<br>
-<br>
12/14 17,509' 10.00<br>
27<br>
1<br>
1<br>
1/1<br>
3/2<br>
-<br>
-<br>
10.0<br>
0.5/89.5<br>
-<br>
8<br>
0<br>
187K 0.1/0.0<br>
-<br>
-<br>
-<br>
12/15 18,974' 10.00<br>
27<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
-<br>
12/16 20,544' 10.00<br>
27<br>
1<br>
1<br>
1/1<br>
3/2<br>
-<br>
-<br>
10.00<br>
0.5/89<br>
-<br>
8<br>
0<br>
189K<br>
0/0.1<br>
-<br>
-<br>
-<br>
<hr>
<A name=31></a>BOTTOM HOLE ASSEMBLY RECORD<br>
Bit Data<br>
Motor Data<br>
Reason for<br>
Bit # Size (in.)<br>
Type<br>
Make<br>
Model<br>
Depth In<br>
Depth Out Footage Hours<br>
hrs<br>
Vert. Dev.<br>
Make<br>
Model<br>
Bend Rev/Gal<br>
Removal<br>
1<br>
13 1/2<br>
Tri-cone<br>
Smith<br>
EP 685400<br>
100'<br>
2,259'<br>
2,159'<br>
28.5<br>
28.5<br>
Surface<br>
-<br>
-<br>
-<br>
-<br>
TD surface<br>
2<br>
8 3/4<br>
PDC<br>
Hughes<br>
T506X<br>
2,259'<br>
3,144'<br>
885'<br>
8.4<br>
36.9<br>
Vertical<br>
Cougar<br>
-<br>
1.50°<br>
0.29<br>
MWD Issues<br>
2RR<br>
8 3/4<br>
PDC<br>
Hughes<br>
T506X<br>
3,144'<br>
7,610'<br>
4,466'<br>
60.2<br>
97.1<br>
Vertical<br>
Archer<br>
-<br>
1.50°<br>
0.29<br>
Low ROP<br>
3<br>
8 3/4<br>
PDC<br>
Smith<br>
MSDi6516<br>
7,610'<br>
10,323'<br>
2,713'<br>
74.72<br>
171.82<br>
Vertical<br>
Cougar<br>
-<br>
1.50°<br>
0.29<br>
TD Vertical<br>
4<br>
8 3/4<br>
PDC<br>
Security<br>
MMD54M<br>
10,323'<br>
11,126'<br>
803'<br>
20.95<br>
192.77<br>
Curve<br>
BHI<br>
M1X-P-FLX 2.40°<br>
0.58<br>
TD Curve<br>
5<br>
6<br>
PDC<br>
Security<br>
MMD64D<br>
11,126'<br>
11,753'<br>
627'<br>
11.68<br>
204.45<br>
Lateral<br>
BHI<br>
XLP<br>
1.50°<br>
1.03<br>
Motor Failure<br>
5RR<br>
6<br>
PDC<br>
Security<br>
MMD64D<br>
11,753'<br>
20,702'<br>
8,949'<br>
69.8<br>
274.25<br>
Lateral<br>
BHI<br>
XLP<br>
1.50°<br>
1.03<br>
TD well<br>
<hr>
<A name=32></a>FORMATION TOPS & STRUCTURAL RELATIONSHIPS<br>
Subject Well:<br>
Offset Wells:<br>
Operator:<br>
XTO Energy, Inc.<br>
Well Name:<br>
Hanson 11X-12A<br>
Location:<br>
284' FNL & 1,296' FWL<br>
NW NW Section 12, T144N, R96W<br>
Elevation:<br>
GL: 2,310'<br>
Sub: 24'<br>
KB: 2,334'<br>
Formation/<br>
Prog.<br>
Prog.<br>
Driller's<br>
Driller's<br>
Datum<br>
Interval<br>
Thickness<br>
Dip To<br>
Dip To<br>
Dip To<br>
Zone<br>
Top<br>
Datum<br>
Depth Top<br>
Depth Top<br>
(MSL)<br>
Thickness<br>
to Target<br>
Prog.<br>
Hanson 11X- Kovaloff 1<br>
(MSL)<br>
(MD)<br>
(TVD)<br>
12E<br>
Base Last Salt<br>
9,153'<br>
-6,819'<br>
9,156'<br>
9,152'<br>
-6,818'<br>
66'<br>
1,622'<br>
1'<br>
1'<br>
-52'<br>
Ratcliffe<br>
9,219'<br>
-6,885'<br>
9,222'<br>
9,218'<br>
-6,884'<br>
116'<br>
1,556'<br>
1'<br>
1'<br>
-53'<br>
Mission Canyon<br>
9,335'<br>
-7,001'<br>
9,339'<br>
9,334'<br>
-7,000'<br>
536'<br>
1,440'<br>
1'<br>
2'<br>
-52'<br>
Lodgepole<br>
9,870'<br>
-7,536'<br>
9,875'<br>
9,870'<br>
-7,536'<br>
851'<br>
904'<br>
0'<br>
0'<br>
-61'<br>
False Bakken<br>
10,720'<br>
-8,386'<br>
10,852'<br>
10,721'<br>
-8,387'<br>
21'<br>
53'<br>
-1'<br>
-1'<br>
-59'<br>
Upper Bakken Shale<br>
10,741'<br>
-8,407'<br>
10,908'<br>
10,742'<br>
-8,408'<br>
16'<br>
32'<br>
-1'<br>
-1'<br>
-61'<br>
Middle Bakken<br>
10,755'<br>
-8,421'<br>
10,965'<br>
10,758'<br>
-8,424'<br>
16'<br>
16'<br>
-3'<br>
-2'<br>
-62'<br>
Middle Bakken Target<br>
10,774'<br>
-8,440'<br>
-<br>
10,774'<br>
-8,440'<br>
-<br>
0'<br>
0'<br>
1'<br>
-58'<br>
<hr>
<A name=33></a>Offsets<br>
Operator:<br>
XTO Energy, Inc.<br>
Marathon<br>
Well Name:<br>
Hanson 11X-12E<br>
Kovaloff 1<br>
Location:<br>
SE SW Sec. 12, T144N, R96W<br>
SE SW Sec. 13, T144N, R96W<br>
Dunn County, ND<br>
Dunn County, ND<br>
60 ft. E and 9' S of subject well<br>
1.17 mi. SW of subject well<br>
Elevation:<br>
KB: 2,334'<br>
KB: 2,456'<br>
Formation/<br>
E-Log<br>
Datum<br>
Interval<br>
Thickness<br>
E-Log<br>
Datum<br>
Interval<br>
Thickness<br>
Zone<br>
Top<br>
(MSL)<br>
Thickness<br>
to Target<br>
Top<br>
(MSL)<br>
Thickness<br>
to Target<br>
Base Last Salt<br>
9,153'<br>
-6,819'<br>
66'<br>
1,622'<br>
9,222'<br>
-6,766'<br>
65'<br>
1,616'<br>
Ratcliffe<br>
9,219'<br>
-6,885'<br>
117'<br>
1,556'<br>
9,287'<br>
-6,831'<br>
117'<br>
1,551'<br>
Mission Canyon<br>
9,336'<br>
-7,002'<br>
534'<br>
1,439'<br>
9,404'<br>
-6,948'<br>
527'<br>
1,434'<br>
Lodgepole<br>
9,870'<br>
-7,536'<br>
850'<br>
905'<br>
9,931'<br>
-7,475'<br>
853'<br>
907'<br>
False Bakken<br>
10,720'<br>
-8,386'<br>
21'<br>
55'<br>
10,784'<br>
-8,328'<br>
19'<br>
54'<br>
Upper Bakken Shale<br>
10,741'<br>
-8,407'<br>
15'<br>
34'<br>
10,803'<br>
-8,347'<br>
15'<br>
35'<br>
Middle Bakken<br>
10,756'<br>
-8,422'<br>
19'<br>
19'<br>
10,818'<br>
-8,362'<br>
20'<br>
20'<br>
Middle Bakken Target<br>
10,775'<br>
-8,441'<br>
-<br>
0'<br>
10,838'<br>
-8,382'<br>
-<br>
0'<br>
<hr>
<A name=34></a>Interval Thickness Chart<br>
XTO Energy, Inc.<br>
Hanson 11X-12A<br>
900'<br>
800'<br>
700'<br>
600'<br>
(ft)ss<br>
kne<br>
500'<br>
400'<br>
valThic<br>
Inter<br>
300'<br>
200'<br>
100'<br>
0'<br>
Base Last Salt<br>
Ratcliffe<br>
Mission Canyon<br>
Lodgepole<br>
False Bakken<br>
Upper Bakken Shale<br>
Hanson 11X-12A<br>
66'<br>
116'<br>
536'<br>
851'<br>
21'<br>
16'<br>
Hanson 11X-12E<br>
66'<br>
117'<br>
534'<br>
850'<br>
21'<br>
15'<br>
Kovaloff 1<br>
65'<br>
117'<br>
527'<br>
853'<br>
19'<br>
15'<br>
<hr>
<A name=35></a>Isopach Chart<br>
XTO Energy, Inc.<br>
Hanson 11X-12A<br>
1,800'<br>
1,600'<br>
1,400'<br>
1,200'<br>
t(ft)<br>
rge<br>
1,000'<br>
tatoss </span><span class="ft1">800'<br>
kne<br>
600'<br>
Thic<br>
400'<br>
200'<br>
0'<br>
Upper Bakken<br>
Base Last Salt<br>
Ratcliffe<br>
Mission Canyon<br>
Lodgepole<br>
False Bakken<br>
Middle Bakken<br>
Shale<br>
Hanson 11X-12A<br>
1,622'<br>
1,556'<br>
1,440'<br>
904'<br>
53'<br>
32'<br>
16'<br>
Hanson 11X-12E<br>
1,622'<br>
1,556'<br>
1,439'<br>
905'<br>
55'<br>
34'<br>
19'<br>
Kovaloff 1<br>
1,616'<br>
1,551'<br>
1,434'<br>
907'<br>
54'<br>
35'<br>
20'<br>
<hr>
<A name=36></a>XTO Energy, Inc.<br>
Hanson 11X-12A<br>
NW NW Sec. 12, T144N, R96W<br>
Curve Plot<br>
Dunn County, ND<br>
10300<br>
300<br>
280<br>
10350<br>
260<br>
10400<br>
240<br>
220<br>
10450<br>
200<br>
180<br>
10500<br>
)PI<br>
160<br>
A<br>
(ft)<br>
a(<br>
10550<br>
m<br>
TVD<br>
140<br>
Gam<br>
120<br>
10600<br>
100<br>
10650<br>
80<br>
60<br>
10700<br>
40<br>
10750<br>
20<br>
0<br>
10300 10350 10400 10450 10500 10550 10600 10650 10700 10750 10800 10850 10900 10950 11000 11050 11100 11150 11200<br>
Measured Depth (ft)<br>
Curve Plan<br>
Well Path<br>
False Bakken<br>
Upper Bakken Shale<br>
Middle Bakken<br>
Lower Bakken Shale<br>
Top of target<br>
Base of target<br>
Gamma<br>
<hr>
<A name=37></a>XTO Energy, Inc.<br>
GL: 2,368'<br>
Hanson 11X-12A<br>
KB: 2,393'<br>
NW NW Sec. 12, T144N, R96W<br>
Dunn County, ND<br>
N<br>
Dip Profile<br>
S<br>
10710<br>
Gross apparent dip: 0.24°<br>
240<br>
0.42°<br>
10720<br>
220<br>
0.10°<br>
0.34°<br>
10730<br>
200<br>
0.23°<br>
0.16°<br>
0.34°<br>
180<br>
10740<br>
0.25°<br>
160<br>
10750<br>
0.29°<br>
140<br>
(API)<br>
(ft)<br>
10760<br>
a<br>
120<br>
TVD<br>
amm<br>
10770<br>
100<br>
G<br>
80<br>
10780<br>
60<br>
10790<br>
40<br>
10800<br>
20<br>
10810<br>
0<br>
10900<br>
11400<br>
11900<br>
12400<br>
12900<br>
13400<br>
13900<br>
14400<br>
14900<br>
15400<br>
15900<br>
16400<br>
16900<br>
17400<br>
17900<br>
18400<br>
18900<br>
19400<br>
19900<br>
20400<br>
Measured Depth (ft)<br>
Base of UBS<br>
Top of Target<br>
Base of Target<br>
Top of LBS<br>
Wellbore<br>
Gamma<br>
<hr>
<A name=38></a>FORMATION MARKERS & DIP ESTIMATES<br>
Hanson 11X-12A<br>
Dip Change Points<br>
MD<br>
TVD<br>
TVD diff. MD diff.<br>
Dip<br>
Dipping<br>
Type of<br>
up/down Marker<br>
Marker<br>
Base Upper Bakken Shale<br>
10,965'<br>
10,758.00<br>
Gamma<br>
11,100'<br>
10,758.00<br>
0.00<br>
135.00<br>
0.00<br>
Flat<br>
Gamma<br>
12,900'<br>
10,749.00<br>
-9.00<br>
1800.00<br>
0.29<br>
Up<br>
Gamma<br>
14,000'<br>
10,744.21<br>
-4.79<br>
1100.00<br>
0.25<br>
Up<br>
Gamma<br>
14,500'<br>
10,741.20<br>
-3.01<br>
500.00<br>
0.34<br>
Up<br>
Gamma<br>
16,000'<br>
10,737.00<br>
-4.20<br>
1500.00<br>
0.16<br>
Up<br>
Gamma<br>
17,500'<br>
10,731.00<br>
-6.00<br>
1500.00<br>
0.23<br>
Up<br>
Gamma<br>
18,000'<br>
10,728.00<br>
-3.00<br>
500.00<br>
0.34<br>
Up<br>
Gamma<br>
19,750'<br>
10,725.00<br>
-3.00<br>
1750.00<br>
0.10<br>
Up<br>
Gamma<br>
20,702'<br>
10,718.00<br>
-7.00<br>
952.00<br>
0.42<br>
Up<br>
Gamma<br>
Gross Dip<br>
Initial Pronghorn Contact<br>
10,965'<br>
10,758.00<br>
Gamma<br>
Projected Final PH Contact<br>
20,702'<br>
10,718.00<br>
-40.00<br>
9737.00<br>
0.24<br>
Up<br>
Projection<br>
<hr>
<A name=39></a>XTO Energy, Inc.<br>
GL: 2,368'<br>
Hanson 11X-12A<br>
KB: 2,393'<br>
NW NW Sec. 12, T144N, R96W<br>
Dunn County, ND<br>
N<br>
Profile<br>
S<br>
10710<br>
4000<br>
10720<br>
3500<br>
Circulating through gas<br>
buster @ 15,450' MD<br>
10730<br>
3000<br>
0x1<br>
10740<br>
Ray<br>
2500<br>
a<br>
10750<br>
amm<br>
(ft)<br>
10760<br>
2000<br>
,G00<br>
TVD<br>
x1<br>
10770<br>
P<br>
1500<br>
,RO<br>
10780<br>
as<br>
1000<br>
G<br>
10790<br>
Total<br>
500<br>
10800<br>
10810<br>
0<br>
10900<br>
11400<br>
11900<br>
12400<br>
12900<br>
13400<br>
13900<br>
14400<br>
14900<br>
15400<br>
15900<br>
16400<br>
16900<br>
17400<br>
17900<br>
18400<br>
18900<br>
19400<br>
19900<br>
20400<br>
Measured Depth (ft)<br>
Wellbore<br>
Base of UBS<br>
Top of Target<br>
Base of Target<br>
Top of LBS<br>
GR x 10<br>
TG<br>
ROP x 100<br>
<hr>
<A name=40></a>RECTANGULAR COORDINATES<br>
XTO Energy, Inc.<br>
Hanson 11X-12A<br>
500<br>
0<br>
Surface: 284' FNL & 1,296' FWL<br>
NW NW Sec. 12, T144N, R96W<br>
-500<br>
Dunn County, ND<br>
-1000<br>
-1500<br>
-2000<br>
12<br>
-2500<br>
-3000<br>
-3500<br>
-4000<br>
-4500<br>
Note: 1,280 acre standup spacing unit<br>
S/N<br>
with 200' N/S & 500' E/W setbacks<br>
-5000<br>
-5500<br>
-6000<br>
-6500<br>
Bottom Hole Location:<br>
10,030.53' S & 766.48' W of<br>
-7000<br>
surface location or approx.<br>
249.05' FSL & 529.52' FWL<br>
-7500<br>
13<br>
SW SW Sec. 13, T144N, R96W<br>
-8000<br>
-8500<br>
Projected well path<br>
-9000<br>
Section Line<br>
-9500<br>
Hardline<br>
Wel Path<br>
-10000<br>
-10500<br>
-20<br>
-15<br>
-10<br>
-50<br>
0<br>
50<br>
10<br>
15<br>
20<br>
25<br>
30<br>
35<br>
40<br>
45<br>
50<br>
55<br>
60<br>
65<br>
70<br>
75<br>
80<br>
85<br>
90<br>
0<br>
0<br>
00<br>
00<br>
00<br>
00<br>
00<br>
00<br>
00<br>
00<br>
00<br>
0<br>
00<br>
00<br>
00<br>
00<br>
00<br>
00<br>
00<br>
0<br>
00<br>
00<br>
0<br>
0<br>
W/E<br>
<hr>
<A name=41></a>Well Evaluation<br>
Hanson 11X-12A [NW NW Section 12, T144N-R96W] is located approximately 6 miles south<br>
west of Killdeer in Dunn County, North Dakota. The Hanson 11X-12A is a double-section<br>
horizontal Middle Bakken well within the Williston Basin consisting of one lateral drilled to the<br>
south. It expands the existing Murphy Creek Field. The curve would be kicked off in the Lodgepole<br>
and landed within the Middle Bakken Formation. Directional drilling and geo-steering techniques<br>
would then be used to maintain maximum exposure to the target zone.<br>
GEOLOGY<br>
Lithology<br>
Lithologic descriptions and sample analysis began in the Charles Formation in order to log the<br>
Base Last Salt for curve landing purposes.<br>
The Middle Bakken Formation was logged at 10,758' TVD (-8,424' MSL). It consists primarily<br>
of silty sandstone. Samples show trace to rare amounts of spotty to even brown oil staining. The<br>
Middle Bakken was the target reservoir for the lateral portion of the well.<br>
Gas Monitoring<br>
Drilling fluid was circulated through the gas buster starting from 15,450' MD until TD.<br>
Background gas fluctuated between 60u-1,700u and produced intermittent flares ranging from 1'-<br>
20' high. The entire ideal target zone was observed to contain moderate gas concentrations and<br>
consistent oil staining. The highest gas value recorded was a show at 16,521' MD of 3,235u<br>
correlating with the top half of the target zone (Figure 1).<br>
<hr>
<A name=42></a>Figure 1. </span><span class="ft3">Profile of the Hanson 11X-12A well with background gas in the range of 60-1,700 units. (Miles Anson, Anson Geophysical well site<br>
geologist)<br>
Curve Landing<br>
Data including rate of penetration (ROP), torque, Measurement-while-drilling (MWD), and<br>
lagged samples were used to determine marker and formation tops during the vertical hole.<br>
During both the vertical and curve, tops were compared to our primary offset wells, in order to<br>
ensure a successful landing in the target zone. The true vertical depth (TVD) of our initial<br>
landing target (10,773' TVD) was calculated by assuming comparable formation thicknesses<br>
from the Base Last Salt to the landing target gamma signature. Directional successfully landed<br>
the curve at 10,776' TVD.<br>
Geosteering<br>
The ideal target zone was defined as a 10' interval of silty sandstone, the top of which was initially<br>
set at 10,771' TVD, 13' below the base of the Upper Bakken Shale (Figure 2). Offset wells<br>
indicated that the Middle Bakken would be up-dipping approximately 0.37° from entry of the<br>
formation to TD. The final gross overall change in TVD from entry of the Middle Bakken<br>
Formation to the end of the lateral was estimated at -40' over 9,737' (0.24° up, Figure 2). The<br>
bottom-hole location is estimated to be 10,030.53' south & 766.48' west of surface location or<br>
<hr>
<A name=43></a>approximately 249.05' FSL & 529.52' FWL, SW SW Section 13, T144N, R96W. Geo-steering<br>
techniques exposed 100% of uncased borehole to the 10' Middle Bakken ideal target. The well<br>
reached a TD of 20,702' on December 16, 2014.<br>
Figure 2. Cross-sectional interpretation of the Hanson 11X-12A well showing high gamma associated with the silty<br>
intervals and lower gamma within the cleaner sandstone intervals. (Miles Anson, Anson Geophysical well site<br>
geologist)<br>
SUMMARY<br>
1)<br>
The XTO Energy, Inc. Hanson 11X-12A was spud on October 13, 2014 and reached TD in<br>
22 days on December 16, 2014.<br>
2)<br>
Samples from the Middle Bakken target consisted of primarily of silty sandstone, with fair<br>
intergranular porosity. Oil shows in samples were visible as spotted trace to rare brown<br>
oil stain yielding encouraging fluorescent cuts.<br>
3)<br>
Moderate gas shows were present throughout the well; most significant was a gas show of<br>
3,235u at 16,521' MD while drilling the lateral.<br>
<hr>
<A name=44></a>4)<br>
The Hanson 11X-12A awaits completion operations to maximize its production potential.<br>
Respectfully submitted,<br>
Miles Anson<br>
Anson Geophysical Consulting<br>
December 30, 2014<br>
<hr>
<A name=45></a>LITHOLOGY<br>
Rig crews caught 30' sample intervals from 9,000' to 20,702' (TD). Formation tops and lithological markers have<br>
been inserted into the sample descriptions below for reference. Sample descriptions begin in the Mississippian<br>
Charles Formation. Samples were examined wet and dry under a binocular microscope. Sample fluorescence cuts<br>
are masked by invert mud through intermediate casing. Quantifiers in order of abundance are trace, rare,<br>
occasional, common and abundant.<br>
Vertical Log Descriptions:<br>
MD / TVD (MSL Datum)<br>
Drilling in the Charles Formation [Mississippian Madison Group]<br>
9000-9030 ANHYDRITE: milky white to off white, microcrystalline, soft, massive, earthy texture<br>
9030-9060 DOLOMITE: mudstone, tan to light brown, occasional off white to light gray, very fine crystalline, firm,<br>
crystalline texture, no visible porosity, occasional intercrystalline porosity, no visible oil stain<br>
9060-9090 SALT: transparent to clear, crystalline, hard, subhedral to euhedral, crystalline texture<br>
9090-9120 SALT: transparent to clear, crystalline, hard, subhedral to euhedral, crystalline texture<br>
9120-9150 SALT: transparent to clear, crystalline, hard, subhedral to euhedral, crystalline texture<br>
Base Last Salt [Mississippian Madison Group]<br>
9,156' MD / 9,152' TVD (-6,818')<br>
9150-9180 DOLOMITE: mudstone, tan to light brown, common medium gray, occasional off white, very fine<br>
crystalline, firm, crystalline texture, no visible porosity, occasional intercrystalline porosity, no visible oil stain;<br>
common ANHYDRITE: milky white to off white, microcrystalline, soft, massive, earthy texture<br>
9180-9210 ANHYDRITE: milky white to off white, microcrystalline, soft, massive, earthy texture<br>
Ratcliffe [Mississippian Madison Group]<br>
9,222 MD / 9,218' TVD (-6,884')<br>
9210-9240 DOLOMITE LIMESTONE: mudstone, light gray brown, trace medium gray, microcrystalline, friable to<br>
firm, dense, earthy texture, no visible porosity, no visible oil stain; common ANHYDRITE: milky white to off<br>
white, trace light brown, microcrystalline, soft, massive, amorphous, no visible porosity<br>
9240-9270 DOLOMITE LIMESTONE: mudstone, light gray brown, trace medium gray, microcrystalline, friable to<br>
firm, dense, earthy texture, no visible porosity, no visible oil stain; common ANHYDRITE: milky white to off<br>
white, trace light brown, microcrystalline, soft, massive, amorphous, no visible porosity<br>
9270-9300 DOLOMITE LIMESTONE: mudstone, tan to light brown, common medium gray to brown,<br>
microcrystalline, friable, dense, earthy texture, no visible porosity, no visible oil stain<br>
9300-9330 DOLOMITE LIMESTONE: mudstone, tan to light brown, common medium gray to brown,<br>
microcrystalline, friable, dense, earthy texture, no visible porosity, no visible oil stain<br>
Mission Canyon [Mississippian Madison Group]<br>
9,339' MD / 9,334' TVD (-7,000')<br>
9330-9360 DOLOMITE LIMESTONE: mudstone, tan to light brown, common medium gray to brown,<br>
microcrystalline, friable, dense, earthy texture, no visible porosity, no visible oil stain<br>
9360-9390 LIMESTONE: mudstone to wackestone, tan to light brown, common medium to dark gray,<br>
microcrystalline, firm, laminated, earthy texture, no visible porosity, no oil stain; common ANHYDRITE: milky<br>
<hr>
<A name=46></a>white to off white, microcrystalline, soft, massive, amorphous, no visible porosity<br>
9390-9420 ANHYDRITE: milky white to off white, microcrystalline, soft, massive, amorphous, no visible porosity;<br>
common LIMESTONE: mudstone to wackestone, tan to light brown, common medium to dark gray,<br>
microcrystalline, firm, laminated, earthy texture, no visible porosity, no oil stain<br>
9420-9450 LIMESTONE: mudstone to wackestone, tan to light brown, common medium to dark gray,<br>
microcrystalline, firm, laminated, earthy texture, no visible porosity, no oil stain; common ANHYDRITE: milky<br>
white to off white, microcrystalline, soft, massive, amorphous, no visible porosity<br>
9450-9480 LIMESTONE: mudstone to wackestone, tan to light brown, common medium to dark gray,<br>
microcrystalline, firm, laminated, earthy texture, no visible porosity, no oil stain<br>
9480-9510 LIMESTONE: mudstone to wackestone, tan to light brown, common medium to dark gray,<br>
microcrystalline, firm, laminated, earthy texture, no visible porosity, no oil stain<br>
9510-9540 DOLOMITE: mudstone to wackestone, tan to light brown, common medium to dark gray,<br>
microcrystalline, firm, laminated, earthy texture, no visible porosity, no oil stain<br>
9540-9570 DOLOMITE: mudstone to wackestone, tan to light brown, common medium to dark gray,<br>
microcrystalline, firm, laminated, earthy texture, no visible porosity, no oil stain<br>
9570-9600 LIMESTONE: mudstone, tan to light brown, occasional medium gray, microcrystalline, firm, laminated,<br>
earthy texture, no visible porosity, no oil stain<br>
9600-9630 DOLOMITE: wackestone, tan to light brown, occasional medium gray, trace off white, microcrystalline,<br>
firm, laminated, earthy texture, no visible porosity, no oil stain<br>
9630-9660 LIMESTONE: mudstone, tan to light brown, common medium to dark gray, microcrystalline, firm,<br>
laminated, earthy texture, no visible porosity, no oil stain<br>
9660-9690 DOLOMITE: wackestone, brown to tan, common off white, microcrystalline, friable, dense, earthy<br>
texture, no visible porosity, no visible oil stain<br>
9690-9720 LIMESTONE: mudstone, tan to light brown, common medium gray to brown, trace off white,<br>
microcrystalline, friable, dense, earthy texture, no visible porosity, no visible oil stain<br>
9720-9750 DOLOMITE LIMESTONE: mudstone, tan to light brown, occasional off white, microcrystalline,<br>
friable, dense, earthy texture, no visible porosity, no visible oil stain<br>
9750-9780 DOLOMITE: mudstone to wackestone, off white to tan, common off white, microcrystalline, friable,<br>
dense, earthy texture, no visible porosity, no visible oil stain<br>
9780-9810 LIMESTONE: mudstone, tan to light brown, occasional light gray, microcrystalline, friable, dense,<br>
earthy texture, no visible porosity, no visible oil stain<br>
9810-9840 LIMESTONE: mudstone, tan to light brown, occasional off white, microcrystalline, friable, dense,<br>
earthy texture, no visible porosity, no visible oil stain<br>
9840-9870 LIMESTONE: mudstone, tan to light brown, occasional off white, microcrystalline, friable, dense,<br>
earthy texture, no visible porosity, no visible oil stain<br>
<hr>
<A name=47></a>Lodgepole [Mississippian Madison Group]<br>
9,875' MD / 9,870' TVD (-7,536')<br>
9870-9900 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, trace light brown,<br>
microcrystalline, friable, dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
9900-9930 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, trace light brown,<br>
microcrystalline, friable, dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
9930-9960 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, trace light brown,<br>
microcrystalline, friable, dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
9960-9990 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, trace light brown,<br>
microcrystalline, friable, dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
9990-10020 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10020-10050 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10050-10080 ARG LIMESTONE: mudstone, medium to dark gray, common light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10080-10110 ARG LIMESTONE: mudstone, dark gray, occasional light gray, microcrystalline, friable, dense,<br>
earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10110-10140 ARG LIMESTONE: mudstone, dark gray, trace light gray, microcrystalline, friable, dense, earthy<br>
texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10140-10170 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10170-10200 ARG LIMESTONE: mudstone, medium to dark gray, trace light gray, microcrystalline, friable, dense,<br>
earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10200-10230 ARG LIMESTONE: mudstone, dark gray, trace light gray, microcrystalline, friable, dense, earthy<br>
texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10230-10260 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10260-10290 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10290-10320 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10320-10350 ARG LIMESTONE: mudstone, dark gray, trace light to medium gray, microcrystalline, friable, dense,<br>
earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10350-10380 ARG LIMESTONE: mudstone, gray to medium gray, occasional light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
<hr>
<A name=48></a>10380-10410 ARG LIMESTONE: mudstone, dark gray, occasional light to medium gray, microcrystalline, friable,<br>
dense, earthy texture, rare disseminated pyrite, no visible porosity, no visible oil stain<br>
10410-10440 ARG LIMESTONE: mudstone, dark gray, occasional light to medium gray, microcrystalline, friable,<br>
dense, earthy texture, rare disseminated pyrite, no visible porosity, no visible oil stain<br>
10440-10470 ARG LIMESTONE: mudstone, medium to dark gray, occasional light gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10470-10500 ARG LIMESTONE: mudstone, medium to dark gray, trace light gray, microcrystalline, friable, dense,<br>
earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10500-10530 ARG LIMESTONE: mudstone, medium gray, common light gray to gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10530-10560 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10560-10590 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10590-10620 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10620-10650 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10650-10680 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10680-10710 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10710-10740 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10740-10770 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10770-10800 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
10800-10830 ARG LIMESTONE: mudstone, medium gray, common light to dark gray, microcrystalline, friable,<br>
dense, earthy texture, trace disseminated pyrite, no visible porosity, no visible oil stain<br>
False Bakken<br>
10,852' MD / 10,721' TVD (-8,387')<br>
10830-10860 SHALE: dark brown, blocky to sub blocky, firm, earthy texture, petroliferous, carbonaceous,<br>
occasional nodular and disseminated pyrite, no visible porosity, trace spotty light brown oil stain<br>
10860-10890 LIMESTONE: mudstone, light gray to off white, microcrystalline, friable, dense, earthy texture, trace<br>
disseminated pyrite, possible fracture porosity, trace spotty light brown oil stain; common SHALE: dark brown,<br>
blocky to sub blocky, firm, earthy texture, petroliferous, carbonaceous, occasional nodular and disseminated pyrite,<br>
<hr>
<A name=49></a>no visible porosity, trace spotty light brown oil stain<br>
Upper Bakken Shale<br>
10,908' MD / 10,742' TVD (-8,408')<br>
10890-10920 SHALE: black to dark brown, blocky to sub blocky, firm, earthy texture, petroliferous, carbonaceous,<br>
common nodular and disseminated pyrite, no visible porosity, trace spotty light brown oil stain<br>
10920-10950 SHALE: black to dark brown, blocky to sub blocky, firm, earthy texture, petroliferous, carbonaceous,<br>
common nodular and disseminated pyrite, no visible porosity, trace spotty light brown oil stain<br>
Middle Bakken<br>
10,965' MD / 10,758' TVD (-8,424')<br>
10950-10980 SILTY SANDSTONE: cream to tan, fine grain, friable, subrounded to subangular, moderately sorted,<br>
dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace spotty light brown oil stain;<br>
occasional SILTSTONE: light to medium gray, friable, sub blocky, dolomite cement, moderately cemented, no<br>
visible porosity, trace spotty light brown oil stain<br>
10980-11010 SILTY SANDSTONE: medium gray, occasional tan, fine grain, friable, subrounded to subangular,<br>
moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace spotty light<br>
brown oil stain<br>
11010-11040 SILTY SANDSTONE: medium gray, occasional tan, fine grain, friable, subrounded to subangular,<br>
moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace spotty light<br>
brown oil stain<br>
11040-11070 SILTY SANDSTONE: medium gray, occasional tan, fine grain, friable, subrounded to subangular,<br>
moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace spotty light<br>
brown oil stain<br>
11070-11100 SILTY SANDSTONE: medium gray, occasional tan, fine grain, friable, subrounded to subangular,<br>
moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace spotty light<br>
brown oil stain<br>
11100-11130 SILTY SANDSTONE: medium gray, occasional tan, fine grain, friable, subrounded to subangular,<br>
moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace spotty light<br>
brown oil stain<br>
11130-11160 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11160-11190 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11190-11220 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11220-11250 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
11250-11280 SILTY SANDSTONE: tan to off white, rare light to medium gray, very fine grain, friable, subrounded<br>
to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace<br>
<hr>
<A name=50></a>spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11280-11310 SILTY SANDSTONE: tan to off white, rare light to medium gray, very fine grain, friable, subrounded<br>
to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace<br>
spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11310-11340 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, fast pale yellow streaming cut fluorescence<br>
11340-11370 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, fast pale yellow streaming cut fluorescence<br>
11370-11400 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11400-11430 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11430-11460 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast yellow streaming cut fluorescence<br>
11460-11490 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11490-11520 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11520-11550 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, fast pale yellow streaming cut fluorescence<br>
11550-11580 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
11580-11610 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11610-11640 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11640-11670 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11670-11700 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=51></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11700-11730 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11730-11760 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, fast pale yellow streaming cut fluorescence<br>
11760-11790 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11790-11820 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11820-11850 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
11850-11880 SILTY SANDSTONE: tan to off white, rare light to medium gray, very fine grain, friable, subrounded<br>
to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace<br>
spotty light brown oil stain, fast pale yellow streaming cut fluorescence<br>
11880-11910 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
11910-11940 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
11940-11970 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
11970-12000 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12000-12030 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12030-12060 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12060-12090 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12090-12120 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=52></a>porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12120-12150 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12150-12180 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12180-12210 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12210-12240 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12240-12270 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12270-12300 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12300-12330 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12330-12360 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
12360-12390 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12390-12420 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12420-12450 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12450-12480 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12480-12510 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12510-12540 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=53></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12540-12570 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12570-12600 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12600-12630 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12630-12660 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12660-12690 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12690-12720 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12720-12750 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12750-12780 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12780-12810 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12810-12840 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12840-12870 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12870-12900 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12900-12930 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12930-12960 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=54></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12960-12990 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
12990-13020 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow blooming cut fluorescence<br>
13020-13050 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow blooming cut fluorescence<br>
13050-13080 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13080-13110 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13110-13140 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13140-13170 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow blooming cut fluorescence<br>
13170-13200 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow blooming cut fluorescence<br>
13200-13230 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow blooming cut fluorescence<br>
13230-13260 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13260-13290 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13290-13320 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13320-13350 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow blooming cut fluorescence<br>
13350-13380 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=55></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13380-13410 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13410-13440 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13440-13470 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13470-13500 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13500-13530 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, fast pale yellow diff cut fluorescence<br>
13530-13560 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13560-13590 SILTY SANDSTONE: tan to off white, rare light to medium gray, very fine grain, friable, subrounded<br>
to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace<br>
spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13590-13620 SILTY SANDSTONE: tan to off white, rare light to medium gray, very fine grain, friable, subrounded<br>
to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace<br>
spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13620-13650 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13650-13680 SILTY SANDSTONE: tan to off white, rare light to medium gray, very fine grain, friable, subrounded<br>
to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular porosity, trace<br>
spotty light brown oil stain, fast pale yellow blooming cut fluorescence<br>
13680-13710 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow diff cut fluorescence<br>
13710-13740 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow diff cut fluorescence<br>
13740-13770 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow diff cut fluorescence<br>
13770-13800 SILTY SANDSTONE: tan to off white, trace light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=56></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13800-13830 SILTY SANDSTONE: tan to off white, occasional light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow diff cut fluorescence<br>
13830-13860 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13860-13890 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13890-13920 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13920-13950 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13950-13980 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
13980-14010 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14010-14040 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14040-14070 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14070-14100 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14100-14130 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14130-14160 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14160-14190 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14190-14220 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=57></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14220-14250 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14250-14280 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14280-14310 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14310-14340 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14340-14370 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14370-14400 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14400-14430 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14430-14460 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14460-14490 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14490-14520 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14520-14550 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14550-14580 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14580-14610 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14610-14640 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=58></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14640-14670 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
14670-14700 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14700-14730 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14730-14760 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14760-14790 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14790-14820 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14820-14850 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14850-14880 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14880-14910 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14910-14940 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14940-14970 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
14970-15000 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15000-15030 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15030-15060 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=59></a>porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15060-15090 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15090-15120 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15120-15150 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15150-15180 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15180-15210 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15210-15240 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15240-15270 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15270-15300 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15300-15330 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15330-15360 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15360-15390 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15390-15420 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15420-15450 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15450-15480 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=60></a>porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15480-15510 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15510-15540 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15540-15570 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15570-15600 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15600-15630 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15630-15660 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15660-15690 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15690-15720 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15720-15750 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15750-15780 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15780-15810 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15810-15840 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15840-15870 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15870-15900 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=61></a>porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15900-15930 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15930-15960 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15960-15990 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
15990-16020 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16020-16050 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16050-16080 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16080-16110 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16110-16140 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16140-16170 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16170-16200 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16200-16230 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16230-16260 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16260-16290 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16290-16320 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=62></a>porosity, trace spotty light brown oil stain, moderately to fast pale yellow streaming cut fluorescence<br>
16320-16350 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16350-16380 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16380-16410 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16410-16440 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16440-16470 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16470-16500 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16500-16530 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16530-16560 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16560-16590 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16590-16620 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16620-16650 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16650-16680 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16680-16710 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16710-16740 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=63></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16740-16770 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16770-16800 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16800-16830 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16830-16860 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16860-16890 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16890-16920 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16920-16950 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16950-16980 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
16980-17010 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17010-17040 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17040-17070 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17070-17100 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17100-17130 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17130-17160 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=64></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17160-17190 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17190-17220 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17220-17250 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17250-17280 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17280-17310 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17310-17340 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17340-17370 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17370-17400 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17400-17430 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17430-17460 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17460-17490 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17490-17520 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17520-17550 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17550-17580 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=65></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17580-17610 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17610-17640 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17640-17670 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17670-17700 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17700-17730 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17730-17760 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17760-17790 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17790-17820 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17820-17850 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17850-17880 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17880-17910 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17910-17940 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17940-17970 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
17970-18000 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=66></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18000-18030 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18030-18060 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18060-18090 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18090-18120 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18120-18150 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18150-18180 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18180-18210 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18210-18240 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18240-18270 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18270-18300 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18300-18330 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18330-18360 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18360-18390 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18390-18420 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=67></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18420-18450 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18450-18480 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18480-18510 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18510-18540 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18540-18570 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18570-18600 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18600-18630 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18630-18660 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18660-18660 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18690-18720 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18720-18750 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18750-18780 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18780-18810 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18810-18840 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=68></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18840-18870 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18870-18900 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18900-18930 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18930-18960 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18960-18990 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
18990-19020 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19020-19050 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19050-19080 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19080-19110 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19110-19140 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19140-19170 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19170-19200 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19200-19230 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19230-19260 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=69></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19260-19290 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19290-19320 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19320-19350 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19350-19380 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19380-19410 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19410-19440 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19440-19470 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19470-19500 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19500-19530 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19530-19560 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19560-19590 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19590-19620 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19620-19650 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19650-19680 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=70></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19680-19710 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19710-19740 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19740-19770 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19770-19800 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19800-19830 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19830-19860 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19860-19890 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19890-19920 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19920-19950 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19950-19980 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
19980-20010 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20010-20040 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20040-20070 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20070-20100 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=71></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20100-20130 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20130-20160 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20160-20190 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20190-20220 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20220-20250 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20250-20280 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20280-20310 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20310-20340 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20340-20370 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20370-20400 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20400-20430 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20430-20460 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20460-20490 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20490-20520 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
<hr>
<A name=72></a>porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20520-20550 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20550-20580 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20580-20610 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20610-20640 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20640-20670 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
20670-20702 SILTY SANDSTONE: tan to off white, common light to medium gray, very fine grain, friable,<br>
subrounded to subangular, moderately sorted, dolomite cement, trace disseminated pyrite, possible intergranular<br>
porosity, trace spotty light brown oil stain, moderately pale yellow streaming cut fluorescence<br>
<hr>
<A name=73></a><hr>
<A name=74></a><hr>
<A name=75></a>29156<br>
Notify NDIC inspector Nicole Nelson at 701-290-1527 with spud and TD info.<br>
X<br>
8/14/14<br>
Nathaniel Erbele<br>
Petroleum Resource Specialist<br>
<hr>
<A name=76></a>August 14, 2014<br>
Lisa Moore<br>
Permitting Analyst<br>
XTO ENERGY INC.<br>
P.O. Box 6501<br>
Englewood, CO 80155<br>
RE:<br>
HORIZONTAL WELL<br>
HANSON 11X-12A<br>
NWNW Section 12-144N-96W<br>
Dunn County<br>
Well File # 29156<br>
Dear Lisa :<br>
Pursuant to Commission Order No. 24151, approval to drill the above captioned well is hereby given. The<br>
approval is granted on the condition that all portions of the well bore not isolated by cement, be no closer than<br>
the </span><span class="ft5">200' setback </span><span class="ft4">from the north & south boundaries and </span><span class="ft5">500' setback </span><span class="ft4">from the east & west boundaries within the<br>
1280 acre spacing unit consisting of Sections 12 & 13-T144N-R96W.<br>
PERMIT STIPULATIONS: Effective June 1, 2014, a covered leak-proof container (with placard) for<br>
filter sock disposal must be maintained on the well site beginning when the well is spud, and must<br>
remain on-site during clean-out, completion, and flow-back whenever filtration operations are<br>
conducted. XTO ENERGY INC. must take into consideration NDAC 43-02-03-28 (Safety Regulation)<br>
when contemplating simultaneous operations on the above captioned location. Pursuant to NDAC 43-<br>
02-03-28 (Safety Regulation) "No boiler, portable electric lighting generator, or treater shall be placed<br>
nearer than 150 feet to any producing well or oil tank." XTO ENERGY INC must contact NDIC Field<br>
Inspector Nicole Nelson at 701-290-1527 prior to location construction.<br>
Drilling pit<br>
NDAC 43-02-03-19.4 states that "a pit may be utilized to bury drill cuttings and solids generated during well<br>
drilling and completion operations, providing the pit can be constructed, used and reclaimed in a manner that will<br>
prevent pollution of the land surface and freshwaters. Reserve and circulation of mud system through earthen pits<br>
are prohibited. All pits shall be inspected by an authorized representative of the director prior to lining and use.<br>
Drill cuttings and solids must be stabilized in a manner approved by the director prior to placement in a cuttings<br>
pit."<br>
Form 1 Changes & Hard Lines<br>
Any changes, shortening of casing point or lengthening at Total Depth must have prior approval by the NDIC.<br>
The proposed directional plan is at a legal location. Based on the azimuth of the proposed lateral the maximum<br>
legal coordinates from the well head are: 10077' south and 796' west.<br>
<hr>
<A name=77></a>Location Construction Commencement (Three Day Waiting Period)<br>
Operators shall not commence operations on a drill site until the 3rd business day following publication of the<br>
approved drilling permit on the NDIC - OGD Daily Activity Report. If circumstances require operations to<br>
commence before the 3rd business day following publication on the Daily Activity Report, the waiting period may<br>
be waived by the Director. Application for a waiver must be by sworn affidavit providing the information<br>
necessary to evaluate the extenuating circumstances, the factors of NDAC 43-02-03-16.2 (1), (a)-(f), and any other<br>
information that would allow the Director to conclude that in the event another owner seeks revocation of the<br>
drilling permit, the applicant should retain the permit.<br>
Permit Fee & Notification<br>
Payment was received in the amount of $100 via credit card. It is requested that notification be given<br>
immediately upon the spudding of the well. This information should be relayed to the Oil & Gas Division,<br>
Bismarck, via telephone. The following information must be included: Well name, legal location, permit number,<br>
drilling contractor, company representative, date and time of spudding. Office hours are 8:00 a.m. to 12:00 p.m.<br>
and 1:00 p.m. to 5:00 p.m. Central Time. Our telephone number is (701) 328-8020, leave a message if after hours<br>
or on the weekend.<br>
Survey Requirements for Horizontal, Horizontal Re-entry, and Directional Wells<br>
NDAC Section 43-02-03-25 (Deviation Tests and Directional Surveys) states in part (that) the survey<br>
contractor shall file a certified copy of all surveys with the director free of charge within thirty days of completion.<br>
Surveys must be submitted as one electronic copy, or in a form approved by the director. However, the director<br>
may require the directional survey to be filed immediately after completion if the survey is needed to conduct the<br>
operation of the director's office in a timely manner. Certified surveys must be submitted via email in one adobe<br>
document, with a certification cover page to </span><span class="ft2">certsurvey@nd.gov</span><span class="ft1">.<br>
Survey points shall be of such frequency to accurately determine the entire location of the well bore.<br>
Specifically, the Horizontal and Directional well survey frequency is 100 feet in the vertical, 30 feet in the curve<br>
(or when sliding) and 90 feet in the lateral.<br>
Confidential status<br>
Your request for confidential status of all information furnished to the Director, or his representatives, is<br>
hereby granted. Such information, except production runs, shall remain confidential for six months commencing<br>
on the date the well is spud.<br>
Confidential status notwithstanding, the Director and his representatives shall have access to all well<br>
records wherever located. Your company personnel, or any person performing work for your company shall<br>
permit the Director and his representatives to come upon any lease, property, well, or drilling rig operated or<br>
controlled by them, complying with all safety rules, and to inspect the records and operation of such wells and to<br>
have access at all times to any and all records of wells. The Commission's field personnel periodically inspect<br>
producing and drilling wells. Any information regarding such wells shall be made available to them at any time<br>
upon request. The information so obtained by the field personnel shall be maintained in strict confidence and<br>
shall be available only to the Commission and its staff.<br>
Surface casing cement<br>
Tail cement utilized on surface casing must have a minimum compressive strength of 500 psi within 12<br>
hours, and tail cement utilized on production casing must have a minimum compressive strength of 500 psi<br>
before drilling the plug or initiating tests.<br>
Logs </span><span class="ft3">NDAC Section 43-02-03-31 requires the running of (1) a suite of open hole logs from which formation tops and<br>
porosity zones can be determined, (2) a Gamma Ray Log run from total depth to ground level elevation of the well bore, and<br>
(3) a log from which the presence and quality of cement can be determined (Standard CBL or Ultrasonic cement evaluation<br>
log) in every well in which production or intermediate casing has been set, this log must be run prior to completing the well.<br>
All logs run must be submitted free of charge, as one digital TIFF (tagged image file format) copy and one digital LAS (log<br>
ASCII) formatted copy. Digital logs may be submitted on a standard CD, DVD, or attached to an email sent to<br>
digitallogs@nd.gov </span><span class="ft1">Thank you for your cooperation.<br>
Sincerely,<br>
Nathaniel Erbele<br>
Petroleum Resource Specialist<br>
<hr>
<A name=78></a>APPLICATION FOR PERMIT TO DRILL HORIZONTAL WELL - FORM 1H<br>
INDUSTRIAL COMMISSION OF NORTH DAKOTA<br>
OIL AND GAS DIVISION<br>
600 EAST BOULEVARD DEPT 405<br>
BISMARCK, ND 58505-0840<br>
SFN 54269 (08-2005)<br>
PLEASE READ INSTRUCTIONS BEFORE FILLING OUT FORM.<br>
PLEASE SUBMIT THE ORIGINAL AND ONE COPY.<br>
Type of Work<br>
Type of Well<br>
Approximate Date Work Will Start<br>
Confidential Status<br>
New Location<br>
Oil & Gas<br>
10 / 22 / 2014<br>
Yes<br>
Operator<br>
Telephone Number<br>
XTO ENERGY INC.<br>
303-397-3600<br>
Address<br>
City<br>
State<br>
Zip Code<br>
P.O. Box 6501<br>
Englewood<br>
CO<br>
80155<br>
Notice has been provided to the owner of any<br>
This well is not located within five hundred<br>
permanently occupied dwelling within 1,320 feet.<br>
feet of an occupied dwelling.<br>
WELL INFORMATION </span><span class="ft1">(If more than one lateral proposed, enter data for additional laterals on page 2)<br>
Well Name<br>
Well Number<br>
HANSON<br>
11X-12A<br>
Surface Footages<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
284 </span><span class="ft0">FL<br>
N<br>
1296 </span><span class="ft0">F </span><span class="ft6">W </span><span class="ft0">L<br>
NWNW<br>
12<br>
144 </span><span class="ft3">N<br>
96<br>
W<br>
Dunn<br>
Longstring Casing Point Footages<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
700 </span><span class="ft0">F </span><span class="ft6">N </span><span class="ft0">L<br>
782 </span><span class="ft0">F </span><span class="ft6">W </span><span class="ft0">L<br>
NWNW<br>
12<br>
144 </span><span class="ft3">N<br>
96<br>
W<br>
Dunn<br>
Longstring Casing Point Coordinates From Well Head<br>
Azimuth<br>
Longstring Total Depth<br>
416 S </span><span class="ft0">From WH<br>
514 W </span><span class="ft0">From WH<br>
210 </span><span class="ft3">º<br>
11070 </span><span class="ft0">Feet MD<br>
10773 </span><span class="ft0">Feet TVD<br>
Bottom Hole Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
246 </span><span class="ft0">F </span><span class="ft6">S<br>
LF<br>
533<br>
W </span><span class="ft0">L<br>
SWSW<br>
13<br>
144 </span><span class="ft3">N<br>
96<br>
W<br>
Dunn<br>
Bottom Hole Coordinates From Well Head<br>
KOP Lateral 1<br>
Azimuth Lateral 1<br>
Estimated Total Depth Lateral 1<br>
10031 S </span><span class="ft0">From WH<br>
763 W </span><span class="ft0">From WH<br>
10337 </span><span class="ft0">Feet MD<br>
180 </span><span class="ft3">º<br>
20733 </span><span class="ft0">Feet MD<br>
10773 </span><span class="ft0">Feet TVD<br>
Latitude of Well Head<br>
Longitude of Well Head<br>
NAD Reference<br>
Description of<br>
(Subject to NDIC Approval)<br>
47 </span><span class="ft3">°<br>
18 </span><span class="ft3">'<br>
46.60 </span><span class="ft3">"<br>
-102 </span><span class="ft3">°'<br>
47<br>
39.17 </span><span class="ft3">" </span><span class="ft6">NAD83<br>
Spacing Unit:<br>
Sections 12 & 13-T144N-R96W<br>
Ground Elevation<br>
Acres in Spacing/Drilling Unit<br>
Spacing/Drilling Unit Setback Requirement<br>
Industrial Commission Order<br>
2310 </span><span class="ft0">Feet Above S.L.<br>
1280<br>
200 </span><span class="ft8">Feet N/S<br>
500<br>
Feet<br>
Feet E/W<br>
24151<br>
North Line of Spacing/Drilling Unit<br>
South Line of Spacing/Drilling Unit<br>
East Line of Spacing/Drilling Unit<br>
West Line of Spacing/Drilling Unit<br>
5265 </span><span class="ft0">Feet<br>
5275 </span><span class="ft0">Feet<br>
10556 </span><span class="ft0">Feet<br>
10563 </span><span class="ft0">Feet<br>
Objective Horizons<br>
Pierre Shale Top<br>
Bakken<br>
2084<br>
Proposed<br>
Size<br>
Weight<br>
Depth<br>
Cement Volume<br>
NOTE: Surface hole must be drilled with fresh water<br>
Surface Casing<br>
9 </span><span class="ft3">- </span><span class="ft6">5/8<br>
" </span><span class="ft6">36 </span><span class="ft0">Lb./Ft. </span><span class="ft6">2200 </span><span class="ft0">Feet </span><span class="ft6">647 </span><span class="ft0">Sacks and surface casing must be cemented back to surface.<br>
Proposed<br>
Size<br>
Weight(s)<br>
Longstring Total Depth<br>
Cement Volume<br>
Cement Top<br>
Top Dakota Sand<br>
Longstring Casing<br>
7 </span><span class="ft3">-<br>
"<br>
29.32<br>
Lb./Ft.<br>
11070 </span><span class="ft0">Feet MD<br>
10773 </span><span class="ft0">Feet TVD<br>
919<br>
Sacks<br>
4700 </span><span class="ft0">Feet<br>
5495<br>
Feet<br>
Base of Last<br>
Last<br>
Salt (If<br>
Charles </span><span class="ft0">Applicable)<br>
Salt (If Applicable)<br>
NOTE: Intermediate or longstring casing string must be cemented above the top Dakota Group Sand.<br>
9156 </span><span class="ft0">Feet<br>
Proposed Logs<br>
MWD/GR, Mud Log, CBL/GR<br>
Drilling Mud Type (Vertical Hole - Below Surface Casing)<br>
Drilling Mud Type (Lateral)<br>
Invert<br>
Brine<br>
Survey Type in Vertical Portion of Well<br>
Survey Frequency: Build Section<br>
Survey Frequency: Lateral<br>
Survey Contractor<br>
MWD </span><span class="ft0">Every 100 Feet<br>
30 </span><span class="ft0">Feet<br>
90 </span><span class="ft0">Feet<br>
Intek<br>
NOTE: A Gamma Ray log must be run to ground surface and a CBL must be run on intermediate or longstring casing string if set.<br>
Surveys are required at least every 30 feet in the build section and every 90 feet in the lateral section of a horizontal well. Measurement<br>
inaccuracies are not considered when determining compliance with the spacing/drilling unit boundary setback requirement except in the<br>
following scenarios: 1) When the angle between the well bore and the respective boundary is 10 degrees or less; or 2) If Industry standard<br>
methods and equipment are not utilized. Consult the applicable field order for exceptions.<br>
If measurement inaccuracies are required to be considered, a 2° MWD measurement inaccuracy will be applied to the horizontal portion of the well<br>
bore. This measurement inaccuracy is applied to the well bore from KOP to TD.<br>
REQUIRED ATTACHMENTS: Certified surveyor's plat, horizontal section plat, estimated geological tops, proposed mud/cementing plan,<br>
directional plot/plan, $100 fee.<br>
See Page 2 for Comments section and signature block.<br>
<hr>
<A name=79></a>Page 2<br>
SFN 54269 (08-2005)<br>
COMMENTS, ADDITIONAL INFORMATION, AND/OR LIST OF ATTACHMENTS<br>
An open hole logging waiver is attached. XTO Energy Inc. does not typically run a frac string. Cuttings will be hauled to one of the<br>
approved disposal sites listed on the enclosed attachment.<br>
Lateral 2<br>
KOP Lateral 2<br>
Azimuth Lateral 2<br>
Estimated Total Depth Lateral 2<br>
KOP Coordinates From Well Head<br>
Feet MD<br>
º<br>
Feet MD<br>
Feet TVD<br>
From WH<br>
From WH<br>
Formation Entry Point Coordinates From Well Head<br>
Bottom Hole Coordinates From Well Head<br>
From WH<br>
From WH<br>
From WH<br>
From WH<br>
KOP Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
FL<br>
FL<br>
N<br>
W<br>
Bottom Hole Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
FL<br>
F<br>
L<br>
N<br>
W<br>
Lateral 3<br>
KOP Lateral 3<br>
Azimuth Lateral 3<br>
Estimated Total Depth Lateral 3<br>
KOP Coordinates From Well Head<br>
Feet MD<br>
º<br>
Feet MD<br>
Feet TVD<br>
From WH<br>
From WH<br>
Formation Entry Point Coordinates From Well Head<br>
Bottom Hole Coordinates From Well Head<br>
From WH<br>
From WH<br>
From WH<br>
From WH<br>
KOP Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
F<br>
L<br>
FL<br>
N<br>
W<br>
Bottom Hole Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
F<br>
L<br>
FL<br>
N<br>
W<br>
Lateral 4<br>
KOP Lateral 4<br>
Azimuth Lateral 4<br>
Estimated Total Depth Lateral 4<br>
KOP Coordinates From Well Head<br>
Feet MD<br>
º<br>
Feet MD<br>
Feet TVD<br>
From WH<br>
From WH<br>
Formation Entry Point Coordinates From Well Head<br>
Bottom Hole Coordinates From Well Head<br>
From WH<br>
From WH<br>
From WH<br>
From WH<br>
KOP Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
FL<br>
FL<br>
N<br>
W<br>
Bottom Hole Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
FL<br>
FL<br>
N<br>
W<br>
Lateral 5<br>
KOP Lateral 5<br>
Azimuth Lateral 5<br>
Estimated Total Depth Lateral 5<br>
KOP Coordinates From Well Head<br>
Feet MD<br>
º<br>
Feet MD<br>
Feet TVD<br>
From WH<br>
From WH<br>
Formation Entry Point Coordinates From Well Head<br>
Bottom Hole Coordinates From Well Head<br>
From WH<br>
From WH<br>
From WH<br>
From WH<br>
KOP Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
FL<br>
FL<br>
NW<br>
Bottom Hole Footages From Nearest Section Line<br>
Qtr-Qtr<br>
Section<br>
Township<br>
Range<br>
County<br>
FL<br>
FL<br>
N<br>
W<br>
Date<br>
I hereby swear or affirm the information provided is true, complete and correct as determined from all available records.<br>
8 / 7 / 2014<br>
Signature<br>
Printed Name<br>
Title<br>
ePermit<br>
Lisa Moore<br>
Permitting Analyst<br>
Email Address(es)<br>
FOR STATE USE ONLY<br>
FOR STATE USE ONLY<br>
Permit and File Number<br>
API Number<br>
Date Approved<br>
29156<br>
33 - </span><span class="ft5">025 </span><span class="ft0">- </span><span class="ft5">02647<br>
8 / 14 / 2014<br>
Field<br>
By<br>
MURPHY CREEK<br>
Nathaniel Erbele<br>
Pool<br>
Permit Type<br>
Title<br>
BAKKEN<br>
DEVELOPMENT<br>
Petroleum Resource Specialist<br>
<hr>
<A name=80></a>April 9, 2014<br>
RE:<br>
Filter Socks and Other Filter Media<br>
Leakproof Container Required<br>
Oil and Gas Wells<br>
Dear Operator,<br>
North Dakota Administrative Code Section 43-02-03-19.2 states in part that all waste material associated with<br>
exploration or production of oil and gas must be properly disposed of in an authorized facility in accord with all<br>
applicable local, state, and federal laws and regulations.<br>
Filtration systems are commonly used during oil and gas operations in North Dakota. The Commission is very<br>
concerned about the proper disposal of used filters (including filter socks) used by the oil and gas industry.<br>
Effective June 1, 2014, a container must be maintained on each well drilled in North Dakota beginning when the<br>
well is spud and must remain on-site during clean-out, completion, and flow-back whenever filtration operations<br>
are conducted. The on-site container must be used to store filters until they can be properly disposed of in an<br>
authorized facility. Such containers must be:<br>
leakproof to prevent any fluids from escaping the container<br>
covered to prevent precipitation from entering the container<br>
placard to indicate only filters are to be placed in the container<br>
If the operator will not utilize a filtration system, a waiver to the container requirement will be considered, but<br>
only upon the operator submitting a Sundry Notice (Form 4) justifying their request.<br>
As previously stated in our March 13, 2014 letter, North Dakota Administrative Code Section 33-20-02.1-01<br>
states in part that every person who transports solid waste (which includes oil and gas exploration and production<br>
wastes) is required to have a valid permit issued by the North Dakota Department of Health, Division of Waste<br>
Management. Please contact the Division of Waste Management at (701) 328-5166 with any questions on the<br>
solid waste program. Note oil and gas exploration and production wastes include produced water, drilling mud,<br>
invert mud, tank bottom sediment, pipe scale, filters, and fly ash.<br>
Thank you for your cooperation.<br>
Sincerely,<br>
Bruce E. Hicks<br>
Assistant Director<br>
<hr>
<A name=81></a><hr>
<A name=82></a><hr>
<A name=83></a><hr>
<A name=84></a><hr>
<A name=85></a><hr>
<A name=86></a><hr>
<A name=87></a><hr>
<A name=88></a><hr>
<A name=89></a><hr>
<A name=90></a><hr>
<A name=91></a><hr>
<A name=92></a><hr>
<A name=93></a><hr>
<A name=94></a><hr>
<A name=95></a><hr>
<A name=96></a><hr>
<A name=97></a><hr>
<A name=98></a><hr>
<A name=99></a><hr>
<A name=100></a><hr>
<A name=101></a><hr>
<A name=102></a><hr>
<A name=103></a><hr>
<A name=104></a><hr>
<A name=105></a><hr>
<A name=106></a><hr>
<A name=107></a><hr>
<A name=108></a><hr>
<A name=109></a><hr>
<A name=110></a><hr>
<A name=111></a>List of Authorized Solid Waste Disposal Facilities<br>
All Non-Hazardous<br>
[Type a quote from the document or the<br>
Drill Cuttings from the<br>
well pad will be<br>
disposed of at one of the following approved facilities.<br>
Facility Name<br>
Address<br>
County<br>
State<br>
Chimney Butte Environmental, LLC<br>
1217 Hwy 85, SW<br>
Fairfield<br>
ND<br>
Dishon Disposal<br>
15242 39</span><span class="ft5">th </span><span class="ft4">Lane, NW<br>
Williston<br>
ND<br>
Indian Hills Waste Disposal<br>
14070 43</span><span class="ft5">rd </span><span class="ft4">Street, NW<br>
Williston<br>
ND<br>
Prairie Disposal (owned by R360<br>
10210 52</span><span class="ft5">nd </span><span class="ft4">Street, NW<br>
Tioga<br>
ND<br>
Environmental Solutions)<br>
Renewable Resources Incinerator<br>
106581 1</span><span class="ft5">st</span><span class="ft4">, NW<br>
Killdeer<br>
ND<br>
Secure Energy Services 13 Mile Landfill<br>
13809 66</span><span class="ft5">th </span><span class="ft4">Street, NW<br>
Williston<br>
ND<br>
Trevita Blue Buttes Landfill<br>
2953 108</span><span class="ft5">th </span><span class="ft4">Avenue<br>
Keene<br>
ND<br>
Williston Landfill<br>
5176 134</span><span class="ft5">th </span><span class="ft4">Avenue, NW<br>
Williston<br>
ND<br>
Nuverra Environmental<br>
13195 26</span><span class="ft5">th </span><span class="ft4">Street, NW<br>
Arnegard<br>
ND<br>
Page 1 of 1<br>
8/7/2014<br>
<hr>
<A name=112></a><hr>
<A name=113></a><hr>
<A name="outline"></a><h1>Document Outline</h1>
<ul><li>Certified Surveys
<li>Geo Rpt
<li>Form 4
<ul><li>4-intent-tubing waiver request
<li>4-OH logging waiver request
<li>4-OH logging waiver request
<li>4 - Susp of Drlg
</ul><li>Form 1
</ul><hr>
</BODY>
</HTML>
|
datamade/elpc_bakken
|
html/pdf/W29156.pdfs.html
|
HTML
|
mit
| 227,463
|
// ------------------------------------------------------
// SwarmOps - Numeric and heuristic optimization for Java
// Copyright (C) 2003-2011 Magnus Erik Hvass Pedersen.
// Please see the file license.txt for license details.
// SwarmOps on the internet: http://www.Hvass-Labs.org/
// ------------------------------------------------------
package sso.pso.random;
/**
* Base-class for a Random Number Generator (RNG) with the methods required by
* SwarmOps. It is rumored that earlier Java versions had faulty implementations
* of java.util.Random which is the reason some of the methods (e.g.
* nextGaussian() and nextInt(n)) have been re-implemented here, to ensure
* correctness regardless of what Java version is being used.
*/
public abstract class Random {
/**
* Construct the object.
*/
public Random() {
super();
}
/**
* Name of the RNG.
*/
public abstract String getName();
/**
* Draw a uniform random number in the exclusive range (0,1). It is
* important that it does not return the end-point value one which would
* cause incorrect output of nextIndex(n).
*/
public abstract double nextUniform();
/**
* Draw a uniform random number in the exclusive range (lower, upper).
*/
public double nextUniform(double lower, double upper) {
return nextUniform() * (upper - lower) + lower;
}
/**
* Draw a random integer from the set {0, .., n-1} with uniform probability.
*/
public int nextIndex(int n) {
// The default implementation uses nextUniform() to generate an integer.
// This is because many PRNGs must use division instead of modulo
// arithmetics due to the lower-order bits having little randomness.
// Assume nextUniform() cannot generate an exact value of one,
// otherwise this must have been taken into account to ensure
// uniform probability of choosing the different indices.
assert n >= 1;
double indexD = nextUniform(0, n);
assert indexD > 0 && indexD < n;
// Truncate.
int index = (int) indexD;
assert index >= 0 && index <= n - 1;
return index;
}
/**
* Draw two distinct integers from the set {0, .., n-1} with equal
* probability.
*/
public int[] nextIndex2(int n) {
assert n >= 2;
int r1, r2;
r1 = nextIndex(n);
r2 = nextIndex(n - 1);
int i1 = r1;
int i2 = (r1 + r2 + 1) % n;
assert i1 != i2;
return new int[] { i1, i2 };
}
/**
* Draw a random boolean with equal probability of true and false.
*/
public boolean nextBoolean() {
return nextBoolean(0.5);
}
/**
* Draw a random boolean with probability p of true and (1-p) of false.
*/
public boolean nextBoolean(double p) {
return nextUniform() < p;
}
/**
* Next Gaussian random number.
*/
private double gaussian;
/**
* Does gaussian hold a value?
*/
private boolean gaussianReady = false;
/**
* Draw a Gaussian (or normally) distributed random number, with designated
* mean and deviation.
*
* @param mean
* mean of the normal distribution, e.g. 0.
* @param deviation
* deviation of the normal distribution, e.g. 1.
* @return
*/
public double nextGaussian(double mean, double deviation) {
return deviation * nextGaussian() + mean;
}
/**
* Draw a Gaussian (or normally) distributed random number, with mean 0 and
* deviation 1.
*/
public double nextGaussian() {
double value;
if (gaussianReady) {
value = gaussian;
gaussianReady = false;
} else {
// Pick two uniform numbers in the unit-radius 2-dim ball.
Disk disk = new Disk(this);
// Use notation from Numeric Recipes book
double v1 = disk.x;
double v2 = disk.y;
double rsq = disk.sumSquares;
double fac = Math.sqrt(-2.0 * Math.log(rsq) / rsq);
// Now make the Box-Muller transformation to get two normal
// deviates.
// Return one and save the other for next time.
gaussian = v1 * fac;
gaussianReady = true;
value = v2 * fac;
}
return value;
}
}
|
gto76/sphere-swarm-optimization
|
src/sso/pso/random/Random.java
|
Java
|
mit
| 4,104
|
import $ from "jquery"
import Template from "hb-template"
import _ from "lodash"
const renderNavigation = (customerDetails) => {
const navigation = Template.Navigation(customerDetails)
$('#customer-details').append(navigation)
}
const createPostalAddress = (medium) => {
return medium.street1 + ', ' + medium.city + ', ' + medium.stateOrProvince + ', ' + medium.country + ', ' + medium.postcode
}
const getMediums = (mediums) => {
return _.map(mediums, (medium) => {
if (medium.type === 'Email') {
return _.assignIn(medium, {data: medium.medium.emailAddress})
} else if (medium.type === 'PostalAddress') {
return _.assignIn(medium, {data: createPostalAddress(medium.medium)})
} else if (medium.type === 'TelephoneNumber') {
return _.assignIn(medium, {data: medium.medium.number})
}
})
}
const renderFeatureContainer = (customerDetails) => {
$('#customer-contact a').click(() => {
$('#customer-contact a').addClass('selected')
const mediums = getMediums(customerDetails.contact.contactMedium)
const featureContainer = Template.FeatureContainer({mediums})
$('#customer-details').append(featureContainer)
})
}
const renderCustomerDetails = (container, customerDetails) => {
$('#search-result').after('<div id="customer-details"></div>')
renderNavigation(customerDetails)
renderFeatureContainer(customerDetails)
}
export {renderCustomerDetails}
|
avinandi/demo-project-poc
|
app/js/customerDetails.js
|
JavaScript
|
mit
| 1,416
|
---
layout: post
title: "A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence"
author: "J. McKarthy, M.L. Minsky, N. Rochester, C.E. Shannon"
category: classic_papers
description: "We propose that a 2 month, 10 man study of artificial intelligence be carried
out during the summer of 1956 at Dartmouth College in Hanover, New Hampshire.
The study is to proceed on the basis of the conjecture that every aspect
of learning or any other feature of intelligence can in principle be so
precisely described that a machine can be made to simulate it. An attempt
will be made to find how to make machines use language, form abstractions and
concepts, solve kinds of problems now reserved for humans, and improve
themselves. We think that a significant advance can be made in one or more of
these problems if a carefully selected group of scientists work on it together
for a summer."
published: 1955-08-31
twitter_image: https://miro.medium.com/max/930/0*3jGv1es40NHPcTE3.jpg
tag: Computer Science
notes: "In 1955, four computer scientists wrote the following proposal for a
[workshop](https://en.wikipedia.org/wiki/Dartmouth_workshop) to lay groundwork
for Artificial Intelligence. This workshop is considered to be the founding
event of AI as a field. Ideas from this proposal remain highly relevant to the
day. I added side notes with my thoughts and the connections I could trace to the more modern AI ideas."
---
We propose that a 2 month, 10 man study of artificial intelligence be carried
out during the summer of 1956 at Dartmouth College in Hanover, New Hampshire.
<mark>The study is to proceed on the basis of the conjecture that every aspect
of learning or any other feature of intelligence can in principle be so
precisely described that a machine can be made to simulate it.</mark> An attempt
will be made to find how to make machines use language, form abstractions and
concepts, solve kinds of problems now reserved for humans, and improve
themselves. We think that a significant advance can be made in one or more of
these problems if a carefully selected group of scientists work on it together
for a summer.
The following are some aspects of the artificial intelligence problem:
### 1. Automatic Computers
If a machine can do a job, then an automatic calculator can be programmed to
simulate the machine. The speeds and memory capacities of present computers may
be insufficient to simulate many of the higher functions of the human brain, but
<mark>the major obstacle is not lack of machine capacity, but our inability to write
programs taking full advantage of what we have.</mark>
### 2. How Can a Computer be Programmed to Use a Language
It may be speculated that a large part of human thought consists of manipulating
words according to rules of reasoning and
rules of conjecture.
<label for="mn-1" class="margin-toggle">⊕</label><input type="checkbox" id="mn-1" class="margin-toggle"/>
<span class="marginnote">
S: An interesting conjecture. Sounds very similar to this line from
[magic number seven paper](https://chsasank.github.io/classic_papers/magic-number-seven.html):
"Our language is tremendously useful for repackaging material into a few chunks rich
in information."
</span>
From this point of view, forming a generalization consists of admitting a new word and some
rules whereby sentences containing it imply and are implied by others. This idea
has never been very precisely formulated nor have examples been worked out.
### 3. Neuron Nets
<label for="mn-2" class="margin-toggle">⊕</label><input type="checkbox" id="mn-2" class="margin-toggle"/>
<span class="marginnote">
S: Interesting how neural nets were considered important even during the
foundation of AI. Thanks to deep learning, this research direction is quite
mature now.
</span>
How can a set of (hypothetical) neurons be arranged so as to form concepts.
Considerable theoretical and experimental work has been done on this problem by
Uttley, Rashevsky and his group, Farley and Clark, Pitts and McCulloch, Minsky,
Rochester and Holland, and others. Partial results have been obtained but the
problem needs more theoretical work.
### 4. Theory of the Size of a Calculation
If we are given a well-defined problem (one for which it is possible to test
mechanically whether or not a proposed answer is a valid answer) one way of
solving it is to try all possible answers in order.
<label for="mn-3" class="margin-toggle">⊕</label><input type="checkbox" id="mn-3" class="margin-toggle"/>
<span class="marginnote">
S: Is this the P/NP Problem? I wonder if the partial results obtained by
Shannon and McCarthy are basically "The Theory of Automata" they're editing together.
</span>
This method is inefficient, and to exclude it one must have some criterion for
efficiency of calculation. Some consideration will show that to get a measure of
the efficiency of a calculation it is necessary to have on hand a method of
measuring the complexity of calculating devices which in turn can be done if one
has a theory of the complexity of functions. Some partial results on this
problem have been obtained by Shannon, and also by McCarthy.
### 5. Self-Improvement
Probably a truly intelligent machine will carry out activities which may best be
described as self-improvement.
<label for="mn-4" class="margin-toggle">⊕</label><input type="checkbox" id="mn-4" class="margin-toggle"/>
<span class="marginnote">
S: Is this the Back Propagation? What were the proposed schemes?
</span>
Some schemes for doing this have been proposed and are worth further study. It
seems likely that this question can be studied abstractly as well.
### 6. Abstractions
<label for="mn-5" class="margin-toggle">⊕</label><input type="checkbox" id="mn-5" class="margin-toggle"/>
<span class="marginnote">
S: The concept of layers and deepness of deep learning essentially implements
the abstraction! Again, this idea of abstraction is called as 'recoding' in
[magic number seven paper](https://chsasank.github.io/classic_papers/magic-number-seven.html).
It is interesting that the convolutions implement this recoding/abstraction in a
sparse way hypothesized by this paper.
</span>
A number of types of “abstraction” can be distinctly defined and several others
less distinctly. A direct attempt to classify these and to describe machine
methods of forming abstractions from sensory and other data would seem
worthwhile.
### 7. Randomness and Creativity
A fairly attractive and yet clearly incomplete conjecture is that the difference
between creative thinking and unimaginative competent thinking lies in the
injection of a some randomness.
<label for="mn-6" class="margin-toggle">⊕</label><input type="checkbox" id="mn-6" class="margin-toggle"/>
<span class="marginnote">
S: Is this the idea implemented by GANs? The intuition is the trained CNN while
randomness is the underlying embedding. As for human cognition, what exactly is intuition?
</span>
The randomness must be guided by intuition to be efficient. In other words, the
educated guess or the hunch include controlled randomness in otherwise orderly
thinking.
In addition to the above collectively formulated problems for study, we have
asked the individuals taking part to describe what they will work on. Statements
by the four originators of the project are attached.
We propose to organize the work of the group as follows.
Potential participants will be sent copies of this proposal and asked if they
would like to work on the artificial intelligence problem in the group and if so
what they would like to work on. The invitations will be made by the organizing
committee on the basis of its estimate of the individual’s potential
contribution to the work of the group. The members will circulate their previous
work and their ideas for the problems to be attacked during the months preceding
the working period of the group.
During the meeting there will be regular research seminars and opportunity for
the members to work individually and in informal small groups.
The originators of this proposal are:
<label for="mn-7" class="margin-toggle">⊕</label><input type="checkbox" id="mn-7" class="margin-toggle"/>
<span class="marginnote">
S: From the top of paper: "We think that a significant advance can be made in one or more of these
problems if a carefully selected group of scientists work on it together for a summer.".
Shannon was the theory guy and the eldest of all. Rochester was the engineer guy.
Minsky and McCarthy were freshly minted Princeton PhDs. Minsky was the neuro guy
while the McCarthy was the linguist guy.
</span>
1. **C. E. Shannon**, Mathematician, Bell Telephone Laboratories. Shannon
developed the statistical theory of information, the application of
propositional calculus to switching circuits, and has results on the
efficient synthesis of switching circuits, the design of machines that learn,
cryptography, and the theory of Turing machines. He and J. McCarthy are
co-editing an Annals of Mathematics Study on “The Theory of Automata” .
2. **M. L. Minsky**, Harvard Junior Fellow in Mathematics and Neurology. Minsky
has built a machine for simulating learning by nerve nets and has written a
Princeton PhD thesis in mathematics entitled, “Neural Nets and the Brain
Model Problem” which includes results in learning theory and the theory of
random neural nets.
3. **N. Rochester**, Manager of Information Research, IBM Corporation,
Poughkeepsie, New York. Rochester was concerned with the development of radar
for seven years and computing machinery for seven years. He and another
engineer were jointly responsible for the design of the IBM Type 701 which is
a large scale automatic computer in wide use today. He worked out some of the
automatic programming techniques which are in wide use today and has been
concerned with problems of how to get machines to do tasks which previously
could be done only by people. He has also worked on simulation of nerve nets
with particular emphasis on using computers to test theories in
neurophysiology.
4. **J. McCarthy**, Assistant Professor of Mathematics, Dartmouth College.
McCarthy has worked on a number of questions connected with the mathematical
nature of the thought process including the theory of Turing machines, the
speed of computers, the relation of a brain model to its environment, and the
use of languages by machines. Some results of this work are included in the
forthcoming “Annals Study” edited by Shannon and McCarthy. McCarthy’s other
work has been in the field of differential equations.
The Rockefeller Foundation is being asked to provide financial support for the
project on the following basis:
1. Salaries of $1200 for each faculty level participant who is not being
supported by his own organization. It is expected, for example, that the
participants from Bell Laboratories and IBM Corporation will be supported by
these organizations while those from Dartmouth and Harvard will require
foundation support.
2. Salaries of $700 for up to two graduate students.
3. Railway fare for participants coming from a distance.
4. Rent for people who are simultaneously renting elsewhere.
5. Secretarial expenses of `$650`, `$500` for a secretary and `$150` for duplicating
expenses.
6. Organization expenses of $200. (Includes expense of reproducing preliminary
work by participants and travel necessary for organization purposes.)
7. Expenses for two or three people visiting for a short time.
**Estimated Expenses**:
|6 salaries of 1200 | $7200|
|2 salaries of 700 | 1400|
|8 traveling and rent expenses averaging 300 | 2400 |
|Secretarial and organizational expense |850|
|Additional traveling expenses |600|
|Contingencies |550|
| | $13,500|
## Proposal for Research by C. E. Shannon
<label for="mn-8" class="margin-toggle">⊕</label><input type="checkbox" id="mn-8" class="margin-toggle"/>
<span class="marginnote">
S: Shannon has always been the theory guy: Information theory, computation theory etc.
Ideas mentioned here are beyond my puny mind.
</span>
I would like to devote my research to one or both of the topics listed below.
While I hope to do so, it is possible that because of personal considerations I
may not be able to attend for the entire two months. I, nevertheless, intend to
be there for whatever time is possible,
1) Application of information theory concepts to computing machines and brain
models. A basic problem in information theory is that of transmitting
information reliably over a noisy channel. An analogous problem in computing
machines is that of reliable computing using unreliable elements. This
problem has been studies by von Neumann for Sheffer stroke elements and by
Shannon and Moore for relays; but there are still many open questions. The
problem for several elements, the development of concepts similar to channel
capacity, the sharper analysis of upper and lower bounds on the required
redundancy, etc. are among the important issues. Another question deals with
the theory of information networks where information flows in many closed
loops (as contrasted with the simple one-way channel usually considered in
communication theory). Questions of delay become very important in the
closed loop case, and a whole new approach seems necessary. This would
probably involve concepts such as partial entropies when a part of the past
history of a message ensemble is known.
2) The matched environment - brain model approach to automata. In general a
machine or animal can only adapt to or operate in a limited class of
environments. Even the complex human brain first adapts to the simpler
aspects of its environment, and gradually builds up to the more complex
features. I propose to study the synthesis of brain models by the parallel
development of a series of matched (theoretical) environments and
corresponding brain models which adapt to them. The emphasis here is on
clarifying the environmental model, and representing it as a mathematical
structure. Often in discussing mechanized intelligence, we think of machines
performing the most advanced human thought activities-proving theorems,
writing music, or playing chess. I am proposing here to start at the simple
and when the environment is neither hostile (merely indifferent) nor
complex, and to work up through a series of easy stages in the direction of
these advanced activities.
## Proposal for Research by M. L. Minsky
It is not difficult to design a machine which exhibits the following type of
learning. The machine is provided with input and output channels and an internal
means of providing varied output responses to inputs in such a way that the
machine may be “trained” by a “trial and error” process to acquire one of a
range of input-output functions. Such <mark>a machine, when placed in an
appropriate environment and given a criterior of “success” or “failure” can be
trained to exhibit “goal-seeking” behavior. Unless the machine is provided with,
or is able to develop, a way of abstracting sensory material, it can progress
through a complicated environment only through painfully slow steps, and in
general will not reach a high level of behavior.</mark>
<label for="mn-9" class="margin-toggle">⊕</label><input type="checkbox" id="mn-9" class="margin-toggle"/>
<span class="marginnote">
S: Ideas mentioned here are backprop and layers!
</span>
Now let the criterion of success be not merely the appearance of a desired
activity pattern at the output channel of the machine, but rather the
performance of a given manipulation in a given environment. Then in certain ways
the motor situation appears to be a dual of the sensory situation, and progress
can be reasonably fast only if the machine is equally capable of assembling an
ensemble of “motor abstractions” relating its output activity to changes in the
environment.
<label for="mn-10" class="margin-toggle">⊕</label><input type="checkbox" id="mn-10" class="margin-toggle"/>
<span class="marginnote">
S: May be I should read a Minsky's paper or two to understand what he means
by motor and sensory abstractions. I now see the value of references thanks
to the lack of references here!
</span>
Such “motor abstractions” can be valuable only if they relate to changes in the
environment which can be detected by the machine as changes in the sensory
situation, i.e., if they are related, through the structure of the environrnent,
to the sensory abstractions that the machine is using.
I have been studying such systems for some time and feel that if a machine can
be designed in which the sensory and motor abstractions, as they are formed, can
be made to satisfy certain relations, a high order of behavior may result. These
relations involve pairing, motor abstractions with sensory abstractions in such
a way as to produce new sensory situations representing the changes in the
environment that might be expected if the corresponding motor act actually took
place.
<label for="mn-11" class="margin-toggle">⊕</label><input type="checkbox" id="mn-11" class="margin-toggle"/>
<span class="marginnote">
S: It kinda sounds like sensory and motor abstractions are forward and
backward passes of backprop respectively. Very interesting.
</span>
The important result that would be looked for would be that the machine would
tend to build up within itself an abstract model of the environment in which it
is placed. If it were given a problem, it could first explore solutions within
the internal abstract model of the environment and then attempt external
experiments. Because of this preliminary internal study, these external
experiments would appear to be rather clever, and the behavior would have to be
regarded as rather“imaginative”
A very tentative proposal of how this might be done is described in my
dissertation and I intend to do further work in this direction. I hope that by
summer 1956 I will have a model of such a machine fairly close to the stage of
programming in a computer.
## Proposal for Research by N. Rochester
### Originality in Machine Performance
In writing a program for an automatic calculator, one ordinarily provides the
machine with a set of rules to cover each contingency which may arise and
confront the machine. One expects the machine to follow this set of rules
slavishly and to exhibit no originality or common sense. Furthermore one is
annoyed only at himself when the machine gets confused because the rules he has
provided for the machine are slightly contradictory. Finally, in writing
programs for machines, one sometimes must go at problems in a very laborious
manner whereas, if the machine had just a little intuition or could make
reasonable guesses, the solution of the problem could be quite direct. This
paper describes a conjecture as to how to make a machine behave in a somewhat
more sophisticated manner in the general area suggested above. The paper
discusses a problem on which I have been working sporadically for about five
years and which I wish to pursue further in the Artificial Intelligence Project
next summer.
### The Process of Invention or Discovery
Living in the environment of our culture provides us with procedures for solving
many problems. Just how these procedures work is not yet clear but I shall
discuss this aspect of the problem in terms of a model suggested by Craik[1]. <mark>He
suggests that mental action consists basically of constructing little engines
inside the brain which can simulate and thus predict abstractions relating to
environment. </mark>Thus the solution of a problem which one already understands is
done as follows:
<label for="mn-12" class="margin-toggle">⊕</label><input type="checkbox" id="mn-12" class="margin-toggle"/>
<span class="marginnote">
S: Another description of backprop. I feel that the step 2 is the gradient computation.
</span>
1. The environment provides data from which certain abstractions are formed.
2. The abstractions together with certain internal habits or drives provide:
1. A definition of a problem in terms of desired condition to be achieved in
the future, a goal.
2. A suggested action to solve the problem.
3. Stimulation to arouse in the brain the engine which corresponds to this
situation.
3. Then the engine operates to predict what this environmental situation and the
proposed reaction will lead to.
4. If the prediction corresponds to the goal the individual proceeds to act as
indicated.
The prediction will correspond to the goal if living in the environment of his
culture has provided the individual with the solution to the problem. Regarding
the individual as a stored program calculator, the program contains rules to
cover this particular contingency.
For a more complex situation the rules might be more complicated. The rules
might call for testing each of a set of possible actions to determine which
provided the solution. A still more complex set of rules might provide for
uncertainty about the environment, as for example in playing tic tac toe one
must not only consider his next move but the various possible moves of the
environment (his opponent).
Now consider a problem for which no individual in the culture has a solution and
which has resisted efforts at solution. This might be a typical current unsolved
scientific problem. The individual might try to solve it and find that every
reasonable action led to failure. In other words the stored program contains
rules for the solution of this problem but the rules are slightly wrong.
<mark>In order to solve this problem the individual will have to do something which is
unreasonable or unexpected as judged by the heritage of wisdom accumulated by
the culture.
</mark><label for="mn-13" class="margin-toggle">⊕</label><input type="checkbox" id="mn-13" class="margin-toggle"/>
<span class="marginnote">
S: Is this paragraph hinting at gradient descent?
Something radical but not completely random sounds like gradient.
It also sounds like GAN!
</span>
He could get such behavior by trying different things at random but
such an approach would usually be too inefficient. There are usually too many
possible courses of action of which only a tiny fraction are acceptable. The
individual needs a hunch, something unexpected but not altogether reasonable.
Some problems, often those which are fairly new and have not resisted much
effort, need just a little randomness. Others, often those which have long
resisted solution, need a really bizarre deviation from traditional methods. A
problem whose solution requires originality could yield to a method of solution
which involved randomness.
In terms of Craik’s[1] S model, the engine which should simulate the environment
at first fails to simulate correctly. Therefore, it is necessary to try various
modifications of the engine until one is found that makes it do what is needed.
Instead of describing the problem in terms of an individual in his culture it
could have been described in terms of the learning of an immature individual.
When the individual is presented with a problem outside the scope of his
experience he must surmount it in a similar manner.
So far the nearest practical approach using this method in machine solution of
problems is an extension of the Monte Carlo method. In the usual problem which
is appropriate for Monte Carlo there is a situation which is grossly
misunderstood and which has too many possible factors and one is unable to
decide which factors to ignore in working out analytical solution. So the
mathematician has the machine making a few thousand random experiments. The
results of these experiments provide a rough guess as to what the answer may be.
The extension of the Monte Carlo Method is to use these results as a guide to
determine what to neglect in order to simplify the problem enough to obtain an
approximate analytical solution.
<label for="mn-14" class="margin-toggle">⊕</label><input type="checkbox" id="mn-14" class="margin-toggle"/>
<span class="marginnote">
S: Interesting view of randomness during training/learning/discovery. It feels
like this para is alluding to effectiveness of stochastic gradient descent
as opposed to exact gradient descent in training models.
</span>
It might be asked why the method should include randomness. Why shouldn’t the
method be to try each possibility in the order of the probability that the
present state of knowledge would predict for its success? For the scientist
surrounded by the environment provided by his culture, it may be that one
scientist alone would be unlikely to solve the problem in his life so the
efforts of many are needed. <mark>If they use randomness they could all work at once
on it without complete duplication of effort. If they used system they would
require impossibly detailed communication.</mark> For the individual maturing in
competition with other individuals the requirements of mixed strategy (using
game theory terminology) favor randomness. For the machine, randomness will
probably be needed to overcome the shortsightedness and prejudices of the
programmer. While the necessity for randomness has clearly not been proven,
there is much evidence in its favor.
### The Machine With Randomness
In order to write a program to make an automatic calculator use originality it
will not do to introduce randomness without using foresight. If, for example, one
wrote a program so that once in every 10,000 steps the calculator generated a
random number and executed it as an instruction the result would probably be
chaos. Then after a certain amount of chaos the machine would probably try
something forbidden or execute a stop instruction and the experiment would be
over.
<label for="mn-15" class="margin-toggle">⊕</label><input type="checkbox" id="mn-15" class="margin-toggle"/>
<span class="marginnote">
S: Rochester is the 'engineer' guy who seemed to have cared about implementation.
May be that's why he was part of the Dartmouth group in the first place?
</span>
Two approaches, however, appear to be reasonable. One of these is to find how
the brain manages to do this sort of thing and copy it. The other is to take
some class of real problems which require originality in their solution and
attempt to find a way to write a program to solve them on an automatic
calculator. Either of these approaches would probably eventually succeed.
However, it is not clear which would be quicker nor how many years or
generations it would take. Most of my effort along these lines has so far been
on the former approach because I felt that it would be best to master all
relevant scientific knowledge in order to work on such a hard problem, and I
already was quite aware of the current state of calculators and the art of
programming them.
The control mechanism of the brain is clearly very different from the control
mechanism in today’s calculators. One symptom of the difference is the manner of
failure. A failure of a calculator characteristically produces something quite
unreasonable. An error in memory or in data transmission is as likely to be in
the most significant digit as in the least. An error in control can do nearly
anything. It might execute the wrong instruction or operate a wrong input-output
unit. <mark>On the other hand human errors in speech are apt to result in statements
which almost make sense (consider someone who is almost asleep, slightly drunk,
or slightly feverish). Perhaps the mechanism of the brain is such that a slight
error in reasoning introduces randomness in just the right way.</mark>
<label for="mn-16" class="margin-toggle">⊕</label><input type="checkbox" id="mn-16" class="margin-toggle"/>
<span class="marginnote">
S: 'Imaginative Process' sounds awful lot like GANs. Random 'errors' in GANs create
reasonable hallucinations.
</span>
Perhaps the mechanism that controls serial order in behavior[2] guides the
random factor so as to improve the efficiency of imaginative processes over pure
randomness.
Some work has been done on simulating neuron nets on our automatic calculator.
One purpose was to see if it would be thereby possible to introduce randomness
in an appropriate fashion. It seems to have turned out that there are too many
unknown links between the activity of neurons and problem solving for this
approach to work quite yet. The results have cast some light on the behavior of
nets and neurons, but have not yielded a way to solve problems requiring
originality.
An important aspect of this work has been an effort to make the machine form and
manipulate concepts, abstractions, generalizations, and names. An attempt was
made to test a theory[3] of how the brain does it. The first set of experiments
occasioned a revision of certain details of the theory. The second set of
experiments is now in progress. By next summer this work will be finished and a
final report will have been written.
My program is to try next to write a program to solve problems which are members
of some limited class of problems that require originality in their solution. It
is too early to predict just what stage I will be in next summer, or just; how I
will then define the immediate problem. However, the underlying problem which is
described in this paper is what I intend to pursue. <mark>In a single sentence the
problem is: how can I make a machine which will exhibit originality in its
solution of problems?</mark>
**References**
1. K.J.W. Craik, The Nature of Explanation, Cambridge University Press, 1943
(reprinted 1952), p. 92.
2. K.S. Lashley, “The Problem of Serial Order in Behavior”, in Cerebral
Mechanism in Behavior, the Hixon Symposium, edited by L.A. Jeffress, John
Wiley & Sons, New York, pp. 112- 146, 1951.
3. D. O. Hebb, The Organization of Behavior, John Wiley & Sons, New York, 1949
## Proposal for Research by John McCarthy
<label for="mn-17" class="margin-toggle">⊕</label><input type="checkbox" id="mn-17" class="margin-toggle"/>
<span class="marginnote">
S: McCarthy is more of a grammar and linguist guy. Cognitive scientists and linguists
have always been close friends. No wonder he developed Lisp in the pursuit of AI.
</span>
During next year and during the Summer Research Project on Artificial
Intelligence, I propose to study the relation of language to intelligence. <mark>It
seems clear that the direct application of trial and error methods to the
relation between sensory data and motor activity will not lead to any very
complicated behavior. Rather it is necessary for the trial and error methods to
be applied at a higher level of abstraction. The human mind apparently uses
language as its means of handling complicated phenomena.</mark> The trial and error
processes at a higher level frequently take the form of formulating conjectures
and testing them. The English language has a number of properties which every
formal language described so far lacks.
1. Arguments in English supplemented by informal mathematics can be concise.
2. English is universal in the sense that it can set up any other language
within English and then use that language where it is appropriate.
3. The user of English can refer to himself in it and formulate statements
regarding his progress in solving the problem he is working on.
4. In addition to rules of proof, English if completely formulated would have
rules of conjecture.
The logical languages so far formulated have either been instruction lists to
make computers carry out calculations specified in advance or else formalization
of parts of mathematics. The latter have been constructed so as:
1. to be easily described in informal mathematics,
2. to allow translation of statements from informal mathematics into the
language,
3. to make is easy to argue about whether proofs of (???)
No attempt has been made to make proofs in the artificial languages as short as
informal proofs. <mark>It therefore seems to be desirable to attempt to construct an
artificial language which a computer can be programmed to use on problems
requiring conjecture and self-reference.</mark>
<label for="mn-18" class="margin-toggle">⊕</label><input type="checkbox" id="mn-18" class="margin-toggle"/>
<span class="marginnote">
S: McCarthy seems to want to create a high level programming language. Eventually so high
you can describe a feeling of 'self' in it. May be that's the reason why Lisp a recursive and
'functional' programming language? It now seems obvious now: Of course,
'[self](https://en.wikipedia.org/wiki/Self)' is a recursive concept.
</span>
It should correspond to English in the
sense that short English statements about the given subject matter should have
short correspondents in the language and so should short arguments or
conjectural arguments.
<mark>I hope to try to formulate a language having these
properties and in addition to contain the notions of physical object, event,
etc.,</mark>
<label for="mn-19" class="margin-toggle">⊕</label><input type="checkbox" id="mn-19" class="margin-toggle"/>
<span class="marginnote">
S: This sounds like object oriented programming.
</span>
with the hope that using this language it will be possible to program a
machine to learn to play games well and do other tasks .
## People Interested in the Artificial Intelligence Problem
The purpose of the list is to let those on it know who is interested in
receiving documents on the problem. The people on the list will receive copies
of the report of the Dartmouth Summer Project on Artificial Intelligence.
The list consists of people who participated in or visited the Dartmouth Summer
Research Project on Artificial Intelligence, or who are known to be interested
in the subject. It is being sent to the people on the list and to a few others.
For the present purpose the artificial intelligence problem is taken to be that
of making a machine behave in ways that would be called intelligent if a human
were so behaving.
A revised list will be issued soon, so that anyone else interested in getting on
the list or anyone who wishes to change his address on it should write to:
```
John McCarthy
Department of Mathematics
Dartmouth College
Hanover, NH
```
The list consists of:
<label for="mn-20" class="margin-toggle">⊕</label><input type="checkbox" id="mn-20" class="margin-toggle"/>
<span class="marginnote">
S: Not your random list of people. Some of the most influential thinkers are listed here.
</span>
* Adelson, Marvin, Hughes Aircraft Company, Airport Station, Los Angeles, CA
* Backus, John, IBM Corporation, 590 Madison Avenue, New York, NY
* Bigelow, J. H., Institute for Advanced Studies, Princeton, NJ
* Duda, W. L., IBM Research Laboratory, Poughkeepsie, NY
* Fano, R. M., R. L. E., MIT, Cambridge, MA
* Galanter, E. H., University of Pennsylvania, Philadelphia, PA
* Glashow, Harvey A., 1102 Olivia Street, Ann Arbor, MI.
* Hagelbarger, D., Bell Telephone Laboratories, Murray Hill, NJ
* Ashby, W. R., Barnwood House, Gloucester, England
* Bernstein, Alex, IBM Corporation, 590 Madison Avenue, New York, NY
* Elias, Peter, R. L. E., MIT, Cambridge, MA
* Davies, Paul M., 1317 C. 18th Street, Los Angeles, CA.
* Farley, B. G., 324 Park Avenue, Arlington, MA.
* Gelernter, Herbert, IBM Research,Poughkeepsie, N
* Goertzal, Herbert, 330 West 11th Street, New York, New York
* Miller, George A., Memorial Hall, Harvard University, Cambridge, MA.,
* Harmon, Leon D., Bell Telephone Laboratories, Murray Hill, NJ
* Holt, Anatol, 7358 Rural Lane, Philadelphia, PA
* Luce, R. D., 427 West 117th Street, New York, NY
* McCarthy, John, Dartmouth College, Hanover, NH
* Melzak, Z. A., Mathematics Department, University of Michigan, Ann Arbor, MI
* More, TrenchardmDepartment of Electrical Engineering, MIT, Cambridge, MA
* Newell, Allen, Department of Industrial Administration, Carnegie Institute of Technology, Pittsburgh, PA
* Rochester, Nathaniel, Engineering Research Laboratory, IBM Corporation, Poughkeepsie, NY
* Rosenblith, Walter, R.LE., M.LT., Cambridge, MA.
* Sayre, David, IBM Corporation, 590 Madison Avenue, New York, NY
* Shapley, L., Rand Corporation, 1700 Main Street, Santa Monica, CA
* Selfridge, O. G., Lincoln Laboratory, M.1.T., Lexington, MA
* Holland, John H., E. R. I., University of Michigan, Ann Arbor, MI
* Kautz, William H., Stanford Research Institute, Menlo Park, CA
* MacKay, Donald, Department of Physics, University of London, London, WC2, England
* McCulloch, Warren S., R.L.E., M.I.T., Cambridge, MA
* Minsky, M. L., 112 Newbury Street, Boston, MA
* Nash, John, Institute for Advanced Studies, Princeton, NJ
* Robinson, Abraham, Department of Mathematics, University of Toronto, Toronto, Ontario, Canada
* Rogers, Hartley, Jr., Department of Mathematics, MIT, Cambridge, MA.
* Rothstein, Jerome, 21 East Bergen Place, Red Bank, NJ
* Schorr-Kon, J.J., C-380 Lincoln Laboratory, MIT, Lexington, MA
* Schutzenberger, M.P., R.L.E., M.I.T., Cambridge, MA
* Shannon, C. E., R.LE., MLT., Cambridge, MA
* Shapiro, Norman, Rand Corporation, 1700 Main Street, Santa Monica, CA
* Solomonoff, Raymond J., Technical Research Group, 17 Union Square West, New York, NY
* Webster, Frederick, 62 Coolidge Avenue, Cambridge, MA
* Kemeny, John G., Dartmouth College, Hanover, NH
* Simon, Herbert A., Department of Industrial Administration, Carnegie Technology, Pittsburgh, PA
* Steele, J. E., Capt. USAF, Area B., Box 8698, Wright-Patterson AFB, Ohio
* Moore, E. F., Bell Telephone Laboratory, Murray Hill, NJ
|
chsasank/chsasank.github.io
|
_posts/classic_papers/2020-10-22-darthmouth-artifical-intelligence-summer-resarch-proposal.md
|
Markdown
|
mit
| 37,736
|
<!doctype html>
<html class="fixed sidebar-left-collapsed">
<head>
<?php
$title = "U-Dashboard";
include 'partials/head.php';
?>
<style type="text/css">
<?php
foreach ($types as $type){
$color = dechex(hexdec($type['color']) + 60);
echo('body .btn-info:hover.'.$type['name'].'{');
echo('background-color: #'.$color.';');
echo('border-color: #'.$color.' !important;}');
echo('body .btn-info.'.$type['name'].'{');
echo('background-color: '.$type['color'].';');
echo('border-color: '.$type['color'].' !important;}');
}
?>
</style>
</head>
<body>
<section class="body">
<?php include 'partials/header_tmpl.php'; ?>
<div class="inner-wrapper">
<!-- start: sidebar -->
<aside id="sidebar-left" class="sidebar-left">
<div class="sidebar-header">
<div class="sidebar-title">
Navegación
</div>
<div class="sidebar-toggle hidden-xs" data-toggle-class="sidebar-left-collapsed" data-target="html" data-fire-event="sidebar-left-toggle">
<i class="fa fa-bars" aria-label="Toggle sidebar"></i>
</div>
</div>
<div class="nano">
<div class="nano-content">
<nav id="menu" class="nav-main" role="navigation">
<ul class="nav nav-main">
<li>
<a href="<?php echo base_url();?>inicio">
<i class="fa fa-home" aria-hidden="true"></i>
<span>U-Dashboard</span>
</a>
</li>
<?php
$first = true;
foreach ($types as $type){
echo ('<li> <a href="'.base_url().'inicio?sector='.$type['name'].'">');
echo ('<span class="pull-right label label-primary"></span>');
if ($first){
echo ('<i class="fa fa-university" aria-hidden="true"></i>');
$first = false;
}
else{
echo ('<i class="el-icon-group" aria-hidden="true"></i>');
}
echo ('<span>'.ucwords($type['name']).'</span></a></li>');
}
?>
</ul>
</nav>
</div>
</div>
</aside>
<!-- end: sidebar -->
<section role="main" class="content-body">
<header class="page-header">
<h2>U-Dashboard</h2>
<div class="right-wrapper pull-right">
<ol class="breadcrumbs">
<li>
<a href="<?php echo base_url();?>inicio">
<i class="fa fa-home"></i>
</a>
</li>
<li><span><?php echo($name);?></span></li>
</ol>
<label> </label>
</div>
</header>
<?php
$dept_id=1;
if($name == "Soporte"){
$dept_id=0;
}
?>
<?php echo form_open('dashboard');
echo ('<div class="pane panel-transparent">');
echo ('<header class="panel-heading">');
echo ('<h2 class="panel-title"><button type="submit" name="direccion" value='.$dept_id.' class="mb-xs mt-xs mr-xs btn btn-primary btn-lg btn-block"> DCC </button></h2>');
echo('</header>');
echo('<div class="panel-body">');
echo('<input type="hidden" name="user" id="user" value="'.$user.'">');
$counter = 0;
foreach ($areaunit as $au){
$kind = false;
$color = false;
foreach ($types as $type){
if ($type['id']==$au['area']->getType()){
$kind = $type['name'];
$color = $type['color'];
}
}
if ($counter % 2 == 0 && $counter!=0)
echo ('</div>');
if ($counter % 2 == 0)
echo ('<div class ="row">');
echo ('<div class="col-md-6">');
echo ('<section class="panel panel-info">');
echo ('<header class="panel-heading" style="background-color: '.$color.'">');
echo ('<h2 class="panel-title"><button type="submit" name="direccion" value='.$au['area']->getId().' class="mb-xs mt-xs mr-xs btn btn-info btn-lg btn-block '.$kind.'">'.ucwords($au['area']->getName()).'</button></h2>');
echo ('</header>');
echo ('<div class="panel-body">');
echo ('<div class="btn-group-vertical col-md-12">');
foreach ($au['unidades'] as $unidad){
echo('<button type="submit" name="direccion" class="btn btn-default" value='.$unidad->getId().'>'.ucwords($unidad->getName()).'</button>');
}
echo form_close();
echo ('</div></div></section></div>');
$counter++;
}
?>
</div>
</div>
<!-- end: page -->
</section>
</div>
</section>
<?php include 'partials/footer.php'; ?>
<script type="text/javascript">
function changePage(){
window.location.href = "<?php echo base_url();?>dashboard";
}
</script>
</body>
</html>
|
CamilaAlvarez/IndicadoresDCC
|
application/views/index.php
|
PHP
|
mit
| 5,084
|
#include "app.h"
#include <QtWidgets/QApplication>
#include <QLibraryInfo>
int main(int argc, char *argv[])
{
QApplication a(argc, argv);
App w;
w.show();
return a.exec();
}
|
patemckin/HestonOptions
|
OptCalc/App/main.cpp
|
C++
|
mit
| 181
|
<!doctype html>
<html lang="en-gb">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<meta name="robots" content="noindex, nofollow">
<!--[if lt IE 9]>
<script src="https://cdnjs.cloudflare.com/ajax/libs/html5shiv/3.7.3/html5shiv-printshiv.min.js"></script>
<![endif]-->
<title>Bilbo The Lifeguard Dog: a true story of friendship and heroism, by Steven Jamieson – Suffolk Libraries</title>
<meta name="twitter:card" content="summary_large_image">
<meta name="twitter:site" content="@suffolklibrary">
<meta name="twitter:title" content="<cite>Bilbo The Lifeguard Dog: a true story of friendship and heroism</cite>, by Steven Jamieson">
<meta name="twitter:description" content="Bury St Edmunds Library staff member Natasha Catchpole recommends Bilbo The Lifeguard Dog: a true story of friendship and heroism, by Steven Jamieson.">
<meta name="twitter:image" content="/images/featured/featured-bilbo-lifeguard-dog.jpg">
<meta name="twitter:image:alt" content="Bilbo The Lifeguard Dog">
<link rel="stylesheet" href="/css/style.css">
<link rel="preload" as="font" type="font/woff2" href="/fonts/source-sans-pro-v11-latin-regular.woff2">
<link rel="preload" as="font" type="font/woff2" href="/fonts/source-sans-pro-v11-latin-italic.woff2">
<link rel="preload" as="font" type="font/woff2" href="/fonts/source-sans-pro-v11-latin-700.woff2">
</head>
<body class="custom-sans-serif lh-copy dark-gray bg-moon-gray">
<ul class="clip">
<li><a href="#content">Skip to content</a></li>
<li><a href="#footer-nav">Skip to navigation menu</a></li>
</ul>
<div class="bg-black white pa2 ph3-ns">
<div class="custom-max-width">
<p class="f6 ma0 custom-lh-title"><span role='image' aria-label='Debit card' class='pr1'>💳</span> You can now pay online. <a href="
https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/MSGTRN/OPAC/LOGINB?RDT=/SpydusCitizenPay/default.aspx
" class="underline lightest-blue">
Pay charges now →
</a></p>
</div>
</div>
<header id="site-header" class="custom-lh-title">
<div class="bg-white dark-gray ph2 ph3-ns pt2 pt3-ns">
<div class="custom-max-width flex">
<div class="w-30">
<a href="/"><img src="/images/logos/sl.svg" class="v-btm w3 w4-ns" alt="Suffolk Libraries"></a>
</div>
<div class="w-70 flex justify-end items-center">
<div><a href="/support-us/" class="dib blue pv1 pv2-ns f7 f6-ns pr2">Donate</a></div>
<div><a href="/help/joining-the-library/" class="dib custom-icon custom-icon-card blue pv1 pv2-ns f7 f6-ns">Join</a></div>
<div><a href="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/MSGTRN/OPAC/LOGINB" class="dib custom-icon custom-icon-lock blue pv1 pv2-ns ml2 f7 f6-ns">Login</a></div>
<div><a href="/search-form/" class="dib custom-icon custom-icon-search blue ml2 pv1 pv2-ns f7 f6-ns">Search</a></div>
</div>
</div>
</div>
<div class="custom-bg-corporate white ph2 ph3-ns bb b--white">
<div class="custom-max-width">
<ul class="ma0 pa0 list f6">
<li class="dib mr2 mr3-l"><a href="/" class="white underline db pv2">Home</a></li>
<li class="dib mr2 mr3-l"><a href="/elibrary/" class="white underline db pv2">eLibrary</a></li>
<li class="dib mr2 mr3-l"><a href="/events-activities/online-and-streamed-events/" class="white underline db pv2">Online events</a></li>
<li class="dib mr2 mr3-l"><a href="/help/" class="white underline db pv2">Help</a></li>
<li class="dib mr2 mr3-l"><a href="/contact/" class="white underline db pv2">Contact</a></li>
<!-- <li class="dib mr2 mr3-l"><a href="/about/" class="white underline db pv2">About</a></li>
<li class="dib"><a class="white underline db pv2" href="/support-us/">Donate</a></li> -->
</ul>
</div>
</div>
</header>
<div class="pv2 pv3-ns cf custom-max-width
">
<main id="content" role="main">
<div class="custom-g-l4">
<article>
<div class="bg-white pa2 pa5-ns pv4-ns cf mb2 border-box b--light-gray
">
<div class="pa2 ph3-ns bg-white ba b--light-gray custom-underline f6">
<a class="blue underline" href="/">Home</a>
→ <a class="blue underline" href="/new-suggestions/">New suggestions</a>
→ <a class="blue underline" href="/new-suggestions/reviews/">Reviews</a>
→ <a class="blue underline" href="/new-suggestions/reviews/staff-picks/">Staff picks</a>
→ <cite>Bilbo The Lifeguard Dog: a true story of friendship and heroism</cite>, by Steven Jamieson
</div>
<header class="mt3">
<h1 itemprop="name headline"class="custom-lh-title f2 pa0 ma0 mb3
}"><cite>Bilbo The Lifeguard Dog: a true story of friendship and heroism</cite>, by Steven Jamieson</h1>
<p class="f6 mid-gray">
Written by <span itemprop="author" itemscope itemtype="http://schema.org/Person"><span itemprop="name">Natasha Catchpole</span></span> · Published Dec 12, 2016
</p>
</header>
<div itemprop="articleBody"class="lh-copy custom-hyphens custom-prose
custom-underline custom-visited">
<p>Every day until Christmas Eve, a member of Suffolk Libraries staff will reveal a book, CD or DVD they will be giving as a Christmas present, and why. Today, Natasha Catchpole from Bury St Edmunds Library recommends <a href=" https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=1984505"><cite>Bilbo The Lifeguard Dog: a true story of friendship and heroism</cite></a>, by Steven Jamieson.</p>
<p><img src="/images/featured/featured-bilbo-lifeguard-dog.jpg" alt="Bilbo The Lifeguard Dog" /></p>
<p>This is a heart warming tale of an extraordinary Newfoundland, Bilbo, and his owner Steve Jamieson. As a puppy, Bilbo accompanies Steve to his job as a lifeguard. It’s not long before the lifeguard team realise Bilbo is quite a remarkable character, and he is trained up as a lifeguard dog. Full of amusing and heroic stories, it was a such a pleasure to read I didn’t want it to end.</p>
<footer>
<div class="bg-light-gray pa2 pa3-ns mb2 mb4-ns ba b--near-white
">
<p class="ma0 custom-icon-xmas-24">This is one of our advent calendar suggestions for 2016. <a href="/new-suggestions/reviews/advent-calendar-2016/">See the whole calendar →</a><p>
</div>
<footer class="pb4 pb5-ns pt3 bt b--light-gray">
<h1 class="f4 ma0 pa0 pb1">Natasha Catchpole</a></h1>
<p class="ma0">I work at Bury St Edmunds Library.</p>
</footer>
</footer>
</div>
</div>
</article>
</div>
</main>
<div class="custom-g-l2 custom-g-nm custom-underline">
<aside id="sidebar" class="bg-white pa2 pa5-ns pv4-ns cf mb2 border-box b--light-gray
custom-constrain-img" role="complementary">
<section class="pb3 pb4-ns
">
<h1 class="ma0 pb2 f5 f4-ns fw6
">More Reviews</h1>
<ul class="pa0 ma0 list mb2 f6 f5-ns
">
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/wilder-girls-review/">Wilder Girls by Rory Power</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/yes-no-maybe-so/">Yes no maybe so by Aisha Saeed and Becky Albertalli</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/castle-by-the-sea/">Our Castle by the Sea by Lucy Strange</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/the-shepherds-life/">The Shepherd’s Life: A Tale of the Lake District by James Rebanks</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/the-sky-is-mine/">The Sky is Mine by Amy Beashel</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/fallen-land-by-patrick-flanery/">Fallen Land by Patrick Flanery</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/harley-in-the-sky-by-akemi-bowman/">Harley in the Sky by Akemi Dawn Bowman</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/this-is-going-to-hurt-by-adam-kay/">This is going to hurt: Secret diaries of a junior doctor by Adam Kay</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/the-handmaids-tale-by-margaret-atwood/">The Handmaid's Tale by Margaret Atwood</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/staff-picks/anatomy-of-a-scandal-by-sarah-vaughan/">Anatomy of a Scandal by Sarah Vaughan</a></li>
</ul>
</section>
<section class="pb3 pb4-ns
">
<h1 class="ma0 pb2 f5 f4-ns fw6
">More suggestions</h1>
<ul class="pa0 ma0 list mb2 f6 f5-ns
">
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/fiction/">Fiction</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/audiobooks/">Audiobooks</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/films-dvds/">Films & DVDs</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/elibrary-picks/">eLibrary picks</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/childrens-ya-books/">Children's books</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/young-adult/">Young adult</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/non-fiction/">Non-fiction</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/music/">Music</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/meet-the-author/">Meet the Author interviews</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/articles/">Articles</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/health-lists/"> Health and wellbeing</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/reviews/">Reviews</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/new-suggestions/book-club/">Book club favourites</a></li>
</ul>
</section>
<section class="pb3 pb4-ns
">
<h1 class="ma0 pb2 f5 f4-ns fw6
">Keep updated</h1>
<p class="ma0 mb2 f6 f5-ns">Get the latest suggestions, releases and reviews delivered straight to you.</p>
<ul class="pa0 ma0 list mb2 f6 f5-ns
">
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="/newsletter/">Email newsletter</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="https://facebook.com/suffolklibraries">Facebook</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="https://twitter.com/suffolklibrary">Twitter</a></li>
<li class="pv2 bt b--light-gray
"><a class="blue link
" href="https://instagram.com/suffolklibraries">Instagram</a></li>
</ul>
</section>
</aside>
</div>
</div>
<footer id="footer" class="pa2 pt3 pa3-ns pt4-ns bg-near-black white custom-underline">
<div class="custom-max-width">
<div class="flex-l justify-between-l">
<div class="w-30-l mb4 f6">
<section class="pb4">
<h2 class="f6 f5-ns pa0 ma0 mb2 tracked ttu normal
">Do it online</h2>
<ul class="list pa0 ma0">
<li class="mb2 mb1-ns"><a href="https://suffolk.spydus.co.uk" class="link light-gray hover-white">Search & reserve</a></li>
<li class="mb2 mb1-ns"><a href="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/MSGTRN/OPAC/LOGINB" class="link light-gray hover-white">Login & renew</a></li>
<li class="mb2 mb1-ns"><a class="link light-gray hover-white" href="/elibrary">eLibrary</a></li>
<li class="mb2 mb1-ns"><a href="/help/joining-the-library/" class="link light-gray hover-white">Get a library card</a></li>
</ul>
</section>
<section class="pb4">
<h2 class="f6 f5-ns pa0 ma0 mb2 tracked ttu normal
">Support your library</h2>
<p>We're a charity that makes life in Suffolk better for thousands of people.</p>
<p class="ma0"><a class="b pa1 br2 custom-bg-corporate-green hover-bg-green white custom-no-underline" href="/support-us">Donate</a></p>
</section>
</div>
<div class="w-30-l mb4 f6">
<section class="pb4">
<h2 class="f6 f5-ns pa0 ma0 mb2 tracked ttu normal
">Contact us</h2>
<ul class="list pa0 ma0">
<li class="mb2 mb1-ns"><a href="tel:01473351249" class="link light-gray hover-white">01473 351249</a></li>
<li class="mb2 mb1-ns"><a href="mailto:help@suffolklibraries.co.uk" class="link light-gray hover-white">help@suffolklibraries.co.uk</a></li>
</ul>
</section>
<section class="pb4">
<h2 class="f6 f5-ns pa0 ma0 mb2 tracked ttu normal
">Social media</h2>
<ul class="list pa0 ma0">
<li class="mb2 mb1-ns"><a href="http://facebook.com/suffolklibraries" class="link light-gray hover-white">Facebook</a></li>
<li class="mb2 mb1-ns"><a href="https://www.youtube.com/user/SuffolkLibraries/" class="link light-gray hover-white">YouTube</a></li>
<li class="mb2 mb1-ns"><a href="http://twitter.com/suffolklibrary" class="link light-gray hover-white">Twitter</a></li>
<li class="mb2 mb1-ns"><a href="https://instagram.com/suffolklibraries" class="link light-gray hover-white">Instagram</a></li>
<li class="mb2 mb1-ns"><a href="https://www.linkedin.com/company/suffolk-libraries/" class="link light-gray hover-white">LinkedIn</a></li>
<li class="mb2 mb1-ns"><a href="/newsletter" class="link light-gray hover-white">Email newsletter</a></li>
</ul>
</section>
</div>
<div class="w-30-l mb4 f6">
<nav class="pb4" id="footer-nav">
<h2 class="f6 f5-ns pa0 ma0 mb2 tracked ttu normal
">Sections</h2>
<ul class="list pa0 ma0">
<li class="mb2 mb1-ns"><a href="/elibrary/" class="link light-gray hover-white">eLibrary</a></li>
<li class="mb2 mb1-ns"><a href="/libraries/" class="link light-gray hover-white">Libraries</a></li>
<li class="mb2 mb1-ns"><a href="/mobiles-home/" class="link light-gray hover-white">Mobile & home service</a></li>
<li class="mb2 mb1-ns"><a href="/help/" class="link light-gray hover-white">Help using the service</a></li>
<li class="mb2 mb1-ns"><a href="/new-suggestions/" class="link light-gray hover-white">Recommendations & reviews</a></li>
<li class="mb2 mb1-ns"><a href="/events-activities/" class="link light-gray hover-white">Events & activities</a></li>
<li class="mb2 mb1-ns"><a href="/research-and-reference/" class="link light-gray hover-white">Research & reference</a></li>
<li class="mb2 mb1-ns"><a href="/parents-carers-and-children/" class="link light-gray hover-white">Parents, carers & children</a></li>
<li class="mb2 mb1-ns"><a href="/teachers-and-home-educators/" class="link light-gray hover-white">Teachers & home educators</a></li>
<li class="mb2 mb1-ns"><a href="/health/" class="link light-gray hover-white">Health & wellbeing</a></li>
<li class="mb2 mb1-ns"><a href="/help-with-reading-and-literacy/" class="link light-gray hover-white">Help with reading & literacy</a></li>
<li class="mb2 mb1-ns"><a href="/work-and-benefits/" class="link light-gray hover-white">Work & benefits</a></li>
<li class="mb2 mb1-ns"><a href="/business-and-room-hire/" class="link light-gray hover-white">Business & room hire</a></li>
<li class="mb2 mb1-ns"><a href="/bloc/" class="link light-gray hover-white">BLOC</a></li>
<li class="mb2 mb1-ns"><a href="/music-and-drama/" class="link light-gray hover-white">Music & Drama Library</a></li>
<li class="mb2 mb1-ns"><a href="/news/" class="link light-gray hover-white">News</a></li>
<li class="mb2 mb1-ns"><a href="/about/jobs/" class="link light-gray hover-white">Jobs</a></li>
<li class="mb2 mb1-ns"><a href="/volunteer/" class="link light-gray hover-white">Volunteering</a></li>
<li class="mb2 mb1-ns"><a href="/about/" class="link light-gray hover-white">About us</a></li>
</ul>
</nav>
</div>
</div>
<section class="pb4 f6">
<h2 class="f6 f5-ns pa0 ma0 mb2 tracked ttu normal
">Privacy & cookies</h2>
<ul class="list pa0 ma0">
<li class="mb2 mb1-ns">Find out what cookies we use and how we use your data: <a href="/help/privacy-and-cookies/" class="light-gray underline hover-white">our privacy policies</a>.</li>
<li class="mb2 mb1-ns"><a href="/about/jobs/privacy-notice-for-job-applicants/" class="light-gray underline hover-white">Privacy notice for job applicants</a></li>
</ul>
</section>
<div class="pb4 f6">
<p class="ma0 light-gray">Suffolk Libraries HMRC charity number XT34476. Registered company number IP031542.</p>
</div>
</div>
</footer>
</body>
</html>
|
suffolklibraries/sljekyll
|
_site/new-suggestions/reviews/staff-picks/advent-calendar-12/index.html
|
HTML
|
mit
| 21,709
|
/*
* grunt-fontgen
* https://github.com/agentk/grunt-fontgen
*
* Copyright 2015 Karl Bowden
* 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.
*/
'use strict';
module.exports = function(grunt) {
// Project configuration.
grunt.initConfig({
jshint: {
all: [
'Gruntfile.js',
'tasks/*.js',
'<%= nodeunit.tests %>',
],
options: {
jshintrc: '.jshintrc',
},
},
// Before generating any new files, remove any previously-created files.
clean: {
tests: ['tmp'],
},
// Configuration to be run (and then tested).
fontgen: {
default_options: {
options: {
},
files: {
'tmp/default_options': ['test/fixtures/testing', 'test/fixtures/123'],
},
},
custom_options: {
options: {
separator: ': ',
punctuation: ' !!!',
},
files: {
'tmp/custom_options': ['test/fixtures/testing', 'test/fixtures/123'],
},
},
},
// Unit tests.
nodeunit: {
tests: ['test/*_test.js'],
},
});
// Actually load this plugin's task(s).
grunt.loadTasks('tasks');
// These plugins provide necessary tasks.
grunt.loadNpmTasks('grunt-contrib-jshint');
grunt.loadNpmTasks('grunt-contrib-clean');
grunt.loadNpmTasks('grunt-contrib-nodeunit');
// Whenever the "test" task is run, first clean the "tmp" dir, then run this
// plugin's task(s), then test the result.
grunt.registerTask('test', ['clean', 'fontgen', 'nodeunit']);
// By default, lint and run all tests.
grunt.registerTask('default', ['jshint', 'test']);
};
|
agentk/grunt-fontgen
|
Gruntfile.js
|
JavaScript
|
mit
| 2,128
|
<?php
defined('BASEPATH') OR exit('No direct script access allowed');
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
* Description of privilege
*
* @author loong
*/
class Privilege extends CI_Controller {
//put your code here
public function __construct() {
parent::__construct();
$this->load->helper('captcha');
$this->load->library('form_validation');
$this->load->model('admin_model','admin');
$this->load->library('session');
}
public function login()
{
$this->load->view('login.html');
}
public function code()
{
$vals = array(
'word_length' =>4,
);
$code = create_captcha($vals);
$this->session->set_userdata('code',$code);
}
public function singin()
{
$this->form_validation->set_rules('username','用户名','required');
$this->form_validation->set_rules('password','密码','required');
$captcha = strtolower($this->input->post('captcha'));
$code = strtolower($this->session->userdata('code'));
if($captcha ===$code){
if($this->form_validation->run() == FALSE){
$data['message'] = validation_errors();
$data['url'] = site_url('admin/privilege/login');
$data['wait'] = 4;
$this->load->view('message.html',$data);
} else {
$admin_name = $this->input->post('username',true);
$password = $this->input->post('password',true);
if($this->admin->get_admin($admin_name,$password)){
$this->session->set_userdata('admin',$admin_name);
redirect('admin/main/index');
} else {
$data['message'] = '用户或密码错误';
$data['url'] = site_url('admin/privilege/login');
$data['wait'] =4;
$this->load->view('message.html',$data);
}
}
} else {
$data['message'] = '验证码错误，请重新输入';
$data['url'] = site_url('admin/privilege/login');
$data['wait'] = 4;
$this->load->view('message.html',$data);
}
}
public function logout()
{
$this->session->unset_userdata('admin');
$this->session->sess_destroy();
redirect('admin/privilege/login');
}
}
|
chengsann/citest
|
application/controllers/admin/privilege.php
|
PHP
|
mit
| 2,565
|
class CreatePages < ActiveRecord::Migration[5.0]
def change
create_table :pages do |t|
t.string :title
t.string :slug
t.text :text
t.timestamps null: false
end
end
end
|
CollegeSTAR/collegestar_org
|
db/migrate/20161107195717_create_pages.rb
|
Ruby
|
mit
| 204
|
<?php
namespace SuProfile\BlogBundle\Entity;
use Doctrine\ORM\Mapping as ORM;
use Symfony\Component\Validator\Constraints as Assert;
use Gedmo\Mapping\Annotation as Gedmo;
use Symfony\Component\Validator\ExecutionContextInterface;
/**
* SuProfile\BlogBundle\Entity\Article
*
* @ORM\Table(name="article")
* @ORM\Entity(repositoryClass="SuProfile\BlogBundle\Entity\ArticleRepository")
* @ORM\HasLifecycleCallbacks()
*/
class Article
{
/**
* @ORM\Column(name="id", type="integer")
* @ORM\Id
* @ORM\GeneratedValue(strategy="AUTO")
*/
private $id;
/**
* @ORM\Column(name="date", type="datetime")
*/
private $date;
/**
* @ORM\Column(name="titre", type="string", length=255)
*/
private $titre;
/**
* @ORM\Column(name="video", type="string", length=255, nullable=true)
*/
private $video;
/**
* @ORM\Column(name="contenu", type="text", nullable=true)
*/
private $contenu;
/**
* @ORM\Column(type="date", nullable=true)
*/
private $dateEdition;
/**
* @Gedmo\Slug(fields={"titre"})
* @ORM\Column(length=128, unique=true)
*/
private $slug;
/**
* @ORM\OneToOne(targetEntity="SuProfile\BlogBundle\Entity\Image", cascade={"persist", "remove"})
*/
private $image;
/**
* @ORM\ManyToMany(targetEntity="SuProfile\BlogBundle\Entity\Categorie", cascade={"persist"})
* @ORM\JoinTable(name="article_categorie")
*/
private $categories;
/**
* @ORM\OneToMany(targetEntity="SuProfile\BlogBundle\Entity\Commentaire", mappedBy="article", cascade={"remove"})
*/
private $commentaires; // Ici commentaires prend un "s", car un article a plusieurs commentaires !
/**
* @ORM\OneToOne(targetEntity="SuProfile\BlogBundle\Entity\Fichier", cascade={"persist", "remove"})
*/
private $fichier;
/**
* @ORM\ManyToOne(targetEntity="SuProfile\UserBundle\Entity\User")
*/
private $user;
public function __construct()
{
$this->date = new \Datetime;
$this->categories = new \Doctrine\Common\Collections\ArrayCollection();
$this->commentaires = new \Doctrine\Common\Collections\ArrayCollection();
}
/**
* @ORM\PreUpdate
*/
public function updateDate()
{
$this->setDateEdition(new \Datetime());
}
public function getId()
{
return $this->id;
}
/**
* @param datetime $date
* @return Commentaire
*/
public function setDate(\Datetime $date)
{
$this->date = $date;
return $this;
}
/**
* @return datetime
*/
public function getDate()
{
return $this->date;
}
public function setTitre($titre)
{
$this->titre = $titre;
}
public function getTitre()
{
return $this->titre;
}
public function setVideo($video)
{
$this->video = $video;
}
public function getVideo()
{
return $this->video;
}
public function setContenu($contenu)
{
$this->contenu = $contenu;
}
public function getContenu()
{
return $this->contenu;
}
public function setImage(\SuProfile\BlogBundle\Entity\Image $image = null)
{
$this->image = $image;
}
public function getImage()
{
return $this->image;
}
public function addCategorie(\SuProfile\BlogBundle\Entity\Categorie $categorie)
{
$this->categories[] = $categorie;
}
public function removeCategorie(\SuProfile\BlogBundle\Entity\Categorie $categorie)
{
$this->categories->removeElement($categorie);
}
public function getCategories()
{
return $this->categories;
}
public function addCommentaire(\SuProfile\BlogBundle\Entity\Commentaire $commentaire)
{
$this->commentaires[] = $commentaire;
}
public function removeCommentaire(\SuProfile\BlogBundle\Entity\Commentaire $commentaire)
{
$this->commentaires->removeElement($commentaire);
}
public function getCommentaires()
{
return $this->commentaires;
}
public function setFichier(\SuProfile\BlogBundle\Entity\Fichier $fichier = null)
{
$this->fichier = $fichier;
}
public function getFichier()
{
return $this->fichier;
}
public function setDateEdition(\Datetime $dateEdition)
{
$this->dateEdition = $dateEdition;
}
public function getDateEdition()
{
return $this->dateEdition;
}
public function setSlug($slug)
{
$this->slug = $slug;
}
public function getSlug()
{
return $this->slug;
}
public function setUser(\SuProfile\UserBundle\Entity\User $user = null)
{
$this->user = $user;
return $this;
}
public function getUser()
{
return $this->user;
}
}
|
jlafay/SuProfile
|
src/SuProfile/BlogBundle/Entity/Article.php
|
PHP
|
mit
| 4,382
|
# GWAS
This project provides details on the necessary steps to assess and control data in genome wide association studies (GWAS) using genotype information on a large number of genetic markers for a large number of individuals. Due to varied study designs and genotyping platforms between multiple sites/projects as well as potential genotyping errors, it is important to ensure high quality data. Scripts and directions are provided here to facilitate others in this process.
|
sallyrose0425/GWAS
|
README.md
|
Markdown
|
mit
| 477
|
import React, { Component } from 'react';
import _ from 'lodash';
import { connect } from 'react-redux';
import { Link } from 'react-router-dom';
import { fetchPosts } from '../actions';
class PostsIndex extends Component {
componentDidMount() {
this.props.fetchPosts();
}
renderPosts() {
return _.map(this.props.posts, post => {
return (
<li className="list-group-item" key={post.id}>
<Link to={`/posts/${post.id}`}>
{post.title}
</Link>
</li>
);
});
}
render() {
return(
<div>
<div className="text-xs-right">
<Link className="btn btn-primary" to="/posts/new">
Add a Post
</Link>
</div>
<h3>Posts</h3>
<ul className="list-group">
{this.renderPosts()}
</ul>
</div>
);
}
}
function mapStateToProps(state) {
return { posts: state.posts };
}
export default connect(mapStateToProps, { fetchPosts })(PostsIndex);
|
arianithetemi/ReactBlog
|
src/components/posts_index.js
|
JavaScript
|
mit
| 1,050
|
class Api::ConfirmationsController < ApplicationController
def create
@confirmation = Confirmation.new(confirmation_params)
@confirmation.user_id = current_user.id
@home = Home.find(confirmation_params[:home_id])
start_date = confirmation_params[:start_date].to_date
end_date = confirmation_params[:end_date].to_date
if @home.booking_conflict?(start_date, end_date)
render json: "Home is unavailable on those dates", status: 422
elsif @confirmation.save
render :show
else
render json: @confirmation.errors.full_messages, status: 422
end
end
def show
@confirmation = Confirmation.find_by(user_id: current_user.id)
if @confirmation
render :show
else
render json: "Error", status: 422
end
end
def destroy
@confirmation = Confirmation.find_by(user_id: current_user.id)
@confirmation.destroy
render :show
end
private
def confirmation_params
params.require(:confirmation).permit(
:cleaning_cost,
:days,
:end_date,
:home_id,
:num_guests,
:service_cost,
:nightly_cost,
:start_date,
:total_cost,
)
end
end
|
qydchen/SafeHavn
|
app/controllers/api/confirmations_controller.rb
|
Ruby
|
mit
| 1,177
|
var gulp = require('gulp'),
connect = require('gulp-connect'),
open = require('gulp-open'),
concat = require('gulp-concat'),
flatten = require('gulp-flatten'),
port = process.env.port || 3051;
gulp.task('open', function(){
var options = {
url: 'http://localhost:' + port,
};
gulp.src('./app/index.html')
.pipe(open('', options));
});
gulp.task('connect', function() {
connect.server({
root: 'app',
port: port,
livereload: true
});
});
gulp.task('js', function () {
gulp.src('./app/dist/**/*.js')
.pipe(connect.reload());
});
gulp.task('html', function () {
gulp.src('./app/**/*.html')
.pipe(connect.reload());
});
gulp.task('watch', function() {
gulp.watch('app/index.html', ['html']);
gulp.watch('app/src/**/*.js', ['concat', 'js']);
});
gulp.task('bower', function() {
gulp.src('bower_components/**/*.min.js')
.pipe(flatten())
.pipe(gulp.dest('./app/lib/'))
});
gulp.task('concat', function() {
gulp.src('./app/src/**/*.js')
.pipe(concat('trends.js'))
.pipe(gulp.dest('./app/dist/'))
});
gulp.task('default', ['concat', 'bower']);
gulp.task('serve', ['default', 'connect', 'open', 'watch']);
|
oalami/trends
|
web/gulpfile.js
|
JavaScript
|
mit
| 1,155
|