code stringlengths 3 1.01M | repo_name stringlengths 5 116 | path stringlengths 3 311 | language stringclasses 30 values | license stringclasses 15 values | size int64 3 1.01M |
|---|---|---|---|---|---|
<?php
namespace App\Controller;
use App\Controller\AppController;
/**
* Menus Controller
*
* @property \App\Model\Table\MenusTable $Menus
*/
class MenusController extends AppController
{
/**
* Index method
*
* @return \Cake\Network\Response|null
*/
public function index()
{
$menus = $this->paginate($this->Menus);
$this->set(compact('menus'));
$this->set('_serialize', ['menus']);
}
/**
* View method
*
* @param string|null $id Menu id.
* @return \Cake\Network\Response|null
* @throws \Cake\Datasource\Exception\RecordNotFoundException When record not found.
*/
public function view($id = null)
{
$menu = $this->Menus->get($id, [
'contain' => ['Links']
]);
$this->set('menu', $menu);
$this->set('_serialize', ['menu']);
}
/**
* Add method
*
* @return \Cake\Network\Response|void Redirects on successful add, renders view otherwise.
*/
public function add()
{
$menu = $this->Menus->newEntity();
if ($this->request->is('post')) {
$menu = $this->Menus->patchEntity($menu, $this->request->data);
if ($this->Menus->save($menu)) {
$this->Flash->success(__('The menu has been saved.'));
return $this->redirect(['action' => 'index']);
} else {
$this->Flash->error(__('The menu could not be saved. Please, try again.'));
}
}
$this->set(compact('menu'));
$this->set('_serialize', ['menu']);
}
/**
* Edit method
*
* @param string|null $id Menu id.
* @return \Cake\Network\Response|void Redirects on successful edit, renders view otherwise.
* @throws \Cake\Network\Exception\NotFoundException When record not found.
*/
public function edit($id = null)
{
$menu = $this->Menus->get($id, [
'contain' => []
]);
if ($this->request->is(['patch', 'post', 'put'])) {
$menu = $this->Menus->patchEntity($menu, $this->request->data);
if ($this->Menus->save($menu)) {
$this->Flash->success(__('The menu has been saved.'));
return $this->redirect(['action' => 'index']);
} else {
$this->Flash->error(__('The menu could not be saved. Please, try again.'));
}
}
$this->set(compact('menu'));
$this->set('_serialize', ['menu']);
}
/**
* Delete method
*
* @param string|null $id Menu id.
* @return \Cake\Network\Response|null Redirects to index.
* @throws \Cake\Datasource\Exception\RecordNotFoundException When record not found.
*/
public function delete($id = null)
{
$this->request->allowMethod(['post', 'delete']);
$menu = $this->Menus->get($id);
if ($this->Menus->delete($menu)) {
$this->Flash->success(__('The menu has been deleted.'));
} else {
$this->Flash->error(__('The menu could not be deleted. Please, try again.'));
}
return $this->redirect(['action' => 'index']);
}
}
| osaboyac/frisko | src/Controller/MenusController.php | PHP | gpl-3.0 | 3,209 |
<?php
/**
* @link http://www.yincart.com/
* @copyright Copyright (c) 2014 Yincart
* @license http://www.yincart.com/license/
*/
namespace common;
use yincart\Yincart;
class YincartAnnotation
{
public static function generateAnnotation()
{
$classes = array_merge(Yincart::$classMap['singleton'], Yincart::$classMap['class']);
$annotationTypes = ['propertyInstance', 'propertyClass', 'methodInstance', 'methodClass'];
$classTypes = ['Asset', 'widgets', 'Form', 'models'];
$annotations = array_fill_keys($annotationTypes, array_fill_keys($classTypes, []));
$newLine = "\n";
foreach ($classes as $name => $class) {
if (in_array($name, ['yii\web\JqueryAsset'])) {
continue;
}
$len = 45 - strlen($class);
$spaces = '';
while ($len--) {
$spaces .= ' ';
}
foreach ($classTypes as $type) {
if (strpos($class, $type) !== false) {
$annotations['propertyInstance'][$type][] = " * @property \\$class $spaces\$$name";
$annotations['propertyClass'][$type][] = " * @property string|\\$class$spaces\${$name}Class";
$name = ucfirst($name);
$annotations['methodInstance'][$type][] = " * @method \\$class {$spaces}get$name(array \$config = [])";
$annotations['methodClass'][$type][] = " * @method string|\\$class {$spaces}get{$name}Class()";
break;
}
}
}
foreach ($annotations as $key => $types) {
foreach ($types as $type => $values) {
$types[$type] = " * --- $type class $key ---$newLine" . implode("$newLine", $values) . "$newLine * ";
}
$annotations[$key] = implode("$newLine", $types);
}
$annotations = implode("$newLine * ================================================================================$newLine * $newLine", $annotations);
$annotations = "/**\n * Class Container\n * \n" . $annotations . "\n * @package yincart\n * @author jeremy.zhou(gao_lujie@live.cn)\n */";
return $annotations;
}
public static function generateYincartAnnotation()
{
$classes = array_merge(Yincart::$classMap['singleton'], Yincart::$classMap['class']);
$annotationTypes = ['methodInstance', 'methodClass'];
$classTypes = ['Asset', 'widgets', 'Form', 'models'];
$annotations = array_fill_keys($annotationTypes, array_fill_keys($classTypes, []));
$newLine = "\n";
foreach ($classes as $name => $class) {
if (in_array($name, ['yii\web\JqueryAsset'])) {
continue;
}
$len = 45 - strlen($class);
$spaces = '';
while ($len--) {
$spaces .= ' ';
}
foreach ($classTypes as $type) {
if (strpos($class, $type) !== false) {
$name = ucfirst($name);
$annotations['methodInstance'][$type][] = " * @method static \\$class {$spaces}get$name(array \$config = [])";
$annotations['methodClass'][$type][] = " * @method static string|\\$class {$spaces}get{$name}Class()";
break;
}
}
}
foreach ($annotations as $key => $types) {
foreach ($types as $type => $values) {
$types[$type] = " * --- $type class $key ---$newLine" . implode("$newLine", $values) . "$newLine * ";
}
$annotations[$key] = implode("$newLine", $types);
}
$annotations = implode("$newLine * ================================================================================$newLine * $newLine", $annotations);
$txt[] = 'use yincart $container to create model for rewrite';
$txt[] = 'use controllerMap to rewrite controller';
$txt[] = 'use view theme to rewrite view';
$txt = implode("\n * ", $txt);
$annotations = "/**\n * Class Yincart\n * $txt\n * \n" . $annotations . "\n * @package yincart\n * @author jeremy.zhou(gao_lujie@live.cn)\n */";
return $annotations;
}
} | yinheark/yincart2-apps-advanced | common/YincartAnnotation.php | PHP | gpl-3.0 | 4,293 |
<div class="leftpanel">
<div class="leftmenu">
<ul class="nav nav-tabs nav-stacked">
<li class="nav-header">Menu</li>
<?php
$consulta_modulos = $empresas->consulta("SELECT modulos.id, modulos.nome, modulos.url FROM empresa_modulos
INNER JOIN modulos ON modulos.id = empresa_modulos.id_modulo and modulos.ativo = true
WHERE empresa_modulos.id_empresa = '".$formatacoes->criptografia($_SESSION['id_empresa'],'base64','decode')."'");
$tipoEmpresa = $empresas->consulta("SELECT tipoEmpresa FROM parametros WHERE id_empresa = '".(INT)$formatacoes->criptografia($_SESSION['id_empresa'],'base64','decode')."'");
$tipoEmpresa = $tipoEmpresa->fetch();
foreach ( $consulta_modulos as $linha_modulos ) {
if ( $empresas->consulta("SELECT telas.id FROM telas
INNER JOIN usuarioTelaBloqueada ON usuarioTelaBloqueada.id_usuario = '".(INT)$formatacoes->criptografia($_SESSION['id_usuario'],'base64','decode')."' and usuarioTelaBloqueada.id_tela = telas.id
WHERE
telas.id_modulo = '".$linha_modulos['id']."' and telas.tipoEmpresa = 0 or
telas.id_modulo = '".$linha_modulos['id']."' and telas.tipoEmpresa = '".$tipoEmpresa['tipoEmpresa']."'")->rowCount() != $empresas->consulta("SELECT id FROM telas WHERE
id_modulo = '".$linha_modulos['id']."' and tipoEmpresa = 0 and ativo = true or
id_modulo = '".$linha_modulos['id']."' and tipoEmpresa = '".$tipoEmpresa['tipoEmpresa']."' and ativo = true")->rowCount() ) {
?>
<li><a href="<?php echo $configuracoes->url_acesso().$linha_modulos['url']; ?>"><span
<?php
if ( $linha_modulos['url'] == 'estoque' ) {
echo "class='iconfa-folder-close'";
} else if ( $linha_modulos['url'] == 'vendas' ) {
echo "class='iconfa-shopping-cart'";
} else if ( $linha_modulos['url'] == 'financeiro' ) {
echo "class='iconfa-tasks'";
}
?>></span> <?php echo $linha_modulos['nome']; ?></a></li>
<?php
}
}
?>
</ul>
</div><!--leftmenu-->
</div><!-- leftpanel --> | uemersonsantana/OpenAdmin | sistema/paginas/admin/includes/leftpainel.php | PHP | gpl-3.0 | 2,257 |
/*
* This file is part of the Factbook Generator.
*
* The Factbook Generator is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* The Factbook Generator is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with The Factbook Generator. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2008, 2009 Bradley Brown, Dustin Yourstone, Jeffrey Hair, Paul Halvorsen, Tu Hoang
*/
package edu.uara.parser.integrated;
import java.io.File;
/**
* A class that wraps around a File object in order to maintain more information
* about it like file type (AIS, DIS, etc) and the year of the file.
* @author jeff
*/
public class ParseableFile {
private File file;
private int year;
private String type;
public ParseableFile(String type, File file, int year) {
this.file = file;
this.year = year;
this.type = type;
}
public File getFile() {
return file;
}
public int getYear() {
return year;
}
public String getType() {
return type;
}
public String toString() {
return file.toString() + " (" + type + ")";
}
}
| ProjectMoon/fbg | src/edu/uara/parser/integrated/ParseableFile.java | Java | gpl-3.0 | 1,578 |
HostCMS 6.7 = ec096e370b748b9f343847853499fc13
| gohdan/DFC | known_files/hashes/modules/core/hash/sha1.php | PHP | gpl-3.0 | 47 |
EMACS ?= emacs
IPYTHON = env/ipy.$(IPY_VERSION)/bin/ipython
IPY_VERSION = 0.13.0
TESTEIN = tools/testein.py
TESTEIN_OPTS =
PKG_INFO = \
grep '^Version' \
env/ipy.$(IPY_VERSION)/lib/python*/site-packages/*.egg-info/PKG-INFO \
| sed -r 's%.*/site-packages/(.*)-py.*\.egg-info/.*:Version: (.*)$$%\1\t\2%'
testein: test-requirements
${MAKE} testein-1
interactive-testein: test-requirements
${MAKE} TESTEIN_OPTS="--no-batch" testein-1
clean: ert-clean
rm -f lisp/*.elc
purge: clean
rm -rf env log
pkg-info:
@echo "**************************************************"
@echo "Installed Python Packages"
$(PKG_INFO)
submodule:
git submodule update --init
ERT_DIR = lib/ert/lisp/emacs-lisp
ert-compile: submodule ert-clean log
$(EMACS) -Q -batch -L $(ERT_DIR) \
-f batch-byte-compile $(ERT_DIR)/*.el 2> log/ert-compile.log
ert-clean:
rm -f lib/ert/lisp/emacs-lisp/*.elc
env-ipy.%:
tools/makeenv.sh env/ipy.$* tools/requirement-ipy.$*.txt
log:
mkdir log
test-requirements: ert-compile env-ipy.$(IPY_VERSION)
${MAKE} pkg-info
travis-ci-testein: test-requirements
${MAKE} testein-2
testein-2: testein-2-url-retrieve testein-2-curl
testein-2-curl:
EL_REQUEST_BACKEND=curl ${MAKE} testein-1
testein-2-url-retrieve:
EL_REQUEST_BACKEND=url-retrieve ${MAKE} testein-1
testein-1:
$(EMACS) --version
python --version
env/ipy.$(IPY_VERSION)/bin/ipython --version
$(TESTEIN) --clean-elc -e $(EMACS) \
--ipython $(IPYTHON) ${TESTEIN_OPTS}
travis-ci-zeroein:
$(EMACS) --version
EMACS=$(EMACS) lisp/zeroein.el -batch
rm -rf lib/*
EMACS=$(EMACS) lisp/zeroein.el -batch
| tkf/emacs-ipython-notebook | Makefile | Makefile | gpl-3.0 | 1,588 |
<!DOCTYPE html>
<html manifest="hotel.appcache">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8"/>
<title>Evaluate Thy Hotel</title>
<link rel="stylesheet" href="css/style.css" type="text/css" charset="utf-8" />
<link href="css/jquery.multitouch.css" rel="stylesheet">
<script src="http://code.jquery.com/jquery.js"></script>
<script src="js/jquery.multitouch.js"></script>
<script src="scripts/script.js"></script>
<script src="scripts/navigation.js"></script>
<script>setNavigationOrder('reviewers.html', 'index.html');</script>
</head>
<body>
<section id="content">
<header id="header">
<h1 class="title-top">
<a href="#">Evaluate Thy Hotel</a>
</h1>
<nav id="menu-top">
<ul id="nav-top">
<li><a href="index.html" >Home</a></li>
<li><a href="weekly.html" >Weekly Location</a></li>
<li><a href="reviewers.html" >Reviewers</a></li>
</ul>
</nav>
</header>
<section id="container">
<section id="col-left" >
<nav class="orange-box">
<header id="menu-title">Menu</header>
<ul>
<li>
<a href="#">Reviewed Hotels</a>
</li>
<li>
<a href="#">Get Reviewed</a>
</li>
<li>
<a href="#">Guidelines</a>
</li>
<li>
<a href="#">User Feedback</a>
</li>
<li>
<a href="#">Contact us</a>
</li>
</ul>
</nav>
</section>
<section id="col-center" >
<div class="orange-box">
<div class="hotel-suggestion">
<article >
<header>
<h3><a href="#">ETH suggests..</a></h3>
</header>
<div >
<!-- <span id="moving-canvas-container">
<canvas id="moving-canvas"></canvas>
<div id="moving-coordinates"></div>
</span> -->
<!-- <div class="hotel-suggestion-images" ><img id="big-image" src='images/sydney-harbour-panorama1bl.jpg'></div> -->
<div id="panorama-div" class="hotel-suggestion-images" >
<!-- <canvas id="panorama" ></canvas> -->
</div>
<div id="small-image-wrapper" class="hotel-suggestion-images">
<div >
<div>
<span id="black-frame-container">
<canvas id="black-frame"></canvas>
</span>
<img id="small-image" src='images/sydney-harbour-panorama1bl-thumbnail.jpg'/>
</div>
</div>
</div>
<h3>This week's winner is... Sydney, Australia</h3>
<p >
Sydney is the state capital of New South Wales and the most populous city in Australia. It is on Australia's south-east coast, on the Tasman Sea. In June 2010 the greater metropolitan area had an approximate population of 4.6 million people. Inhabitants of Sydney are called Sydneysiders, comprising a cosmopolitan and international population.
</p>
<p id="travel-cite">
"A life without travel is a life unlived"
</p>
<aside class="reviewer">
<img src="images/mranderson.jpg" alt=""/>
<div >Mr. Anderson</div>
</aside>
</div>
</article>
</div>
</div>
</section>
<section id="col-right">
<article class="orange-box">
<header>
<h3>Our last reviews!</h3>
</header>
<div id="col-right-center">
<img src="images/mec-paestum-1.jpg" alt=""/><br>
<span >Mec Paestum Hotel</span>
</div>
<div id="col-right-center">
<img src="images/hotelbern.jpg" alt=""/><br>
<span >Bellevue Palace Bern</span>
</div>
</article>
<article class="orange-box">
<header >
<h3>Weekly Location Contest</h3>
</header>
<img id="contest" src="images/sydney-harbour-panorama1bl-thumbnail.jpg" alt=""/>
<div>
This week's location is:<br>
<span >Sydney, Australia</span>
</div>
<footer >
<a href="#" >Have a look!</a>
</footer>
</article>
<aside class="blue-box">
<a href="http://facebook.com/"><img src='images/facebook-icon.png' /></a>
<a href="http://twitter.com/"><img src='images/twitter-icon.png' /></a>
</aside>
</section>
</section>
<footer id="footer">
<nav>
<ul>
<li class="footer-menu">
<h3>Disclaimer</h3>
</li>
<li class="footer-menu">
<h3>Contact</h3>
</li>
<li class="footer-menu">
<h3>Help</h3>
</li>
</ul>
</nav>
<div>
<p >© Copyright 2014. All rights reserved</p>
</div>
</footer>
</section>
<script>init();</script>
</body>
</html> | bvancea/webeng-2014 | exercise-1-1/weekly.html | HTML | gpl-3.0 | 4,707 |
/* Keyboard and mouse input; editor command loop.
Copyright (C) 1985-1989, 1993-1997, 1999-2021 Free Software Foundation,
Inc.
This file is part of GNU Emacs.
GNU Emacs is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or (at
your option) any later version.
GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Emacs. If not, see <https://www.gnu.org/licenses/>. */
#include <config.h>
#include <sys/stat.h>
#include "lisp.h"
#include "coding.h"
#include "termchar.h"
#include "termopts.h"
#include "frame.h"
#include "termhooks.h"
#include "macros.h"
#include "keyboard.h"
#include "window.h"
#include "commands.h"
#include "character.h"
#include "buffer.h"
#include "dispextern.h"
#include "syntax.h"
#include "intervals.h"
#include "keymap.h"
#include "blockinput.h"
#include "sysstdio.h"
#include "systime.h"
#include "atimer.h"
#include "process.h"
#include "menu.h"
#include <errno.h>
#ifdef HAVE_PTHREAD
#include <pthread.h>
#endif
#ifdef MSDOS
#include "msdos.h"
#include <time.h>
#else /* not MSDOS */
#include <sys/ioctl.h>
#endif /* not MSDOS */
#if defined USABLE_FIONREAD && defined USG5_4
# include <sys/filio.h>
#endif
#include "syssignal.h"
#include <sys/types.h>
#include <unistd.h>
#include <fcntl.h>
#include <ignore-value.h>
#include "pdumper.h"
#ifdef HAVE_WINDOW_SYSTEM
#include TERM_HEADER
#endif /* HAVE_WINDOW_SYSTEM */
/* Work around GCC bug 54561. */
#if GNUC_PREREQ (4, 3, 0)
# pragma GCC diagnostic ignored "-Wclobbered"
#endif
#ifdef WINDOWSNT
char const DEV_TTY[] = "CONOUT$";
#else
char const DEV_TTY[] = "/dev/tty";
#endif
/* Variables for blockinput.h: */
/* Positive if interrupt input is blocked right now. */
volatile int interrupt_input_blocked;
/* True means an input interrupt or alarm signal has arrived.
The maybe_quit function checks this. */
volatile bool pending_signals;
enum { KBD_BUFFER_SIZE = 4096 };
KBOARD *initial_kboard;
KBOARD *current_kboard;
static KBOARD *all_kboards;
/* True in the single-kboard state, false in the any-kboard state. */
static bool single_kboard;
/* Minimum allowed size of the recent_keys vector. */
#define MIN_NUM_RECENT_KEYS (100)
/* Index for storing next element into recent_keys. */
static int recent_keys_index;
/* Total number of elements stored into recent_keys. */
static int total_keys;
/* Size of the recent_keys vector. */
static int lossage_limit = 3 * MIN_NUM_RECENT_KEYS;
/* This vector holds the last lossage_limit keystrokes. */
static Lisp_Object recent_keys;
/* Vector holding the key sequence that invoked the current command.
It is reused for each command, and it may be longer than the current
sequence; this_command_key_count indicates how many elements
actually mean something.
It's easier to staticpro a single Lisp_Object than an array. */
Lisp_Object this_command_keys;
ptrdiff_t this_command_key_count;
/* This vector is used as a buffer to record the events that were actually read
by read_key_sequence. */
static Lisp_Object raw_keybuf;
static int raw_keybuf_count;
#define GROW_RAW_KEYBUF \
if (raw_keybuf_count == ASIZE (raw_keybuf)) \
raw_keybuf = larger_vector (raw_keybuf, 1, -1)
/* Number of elements of this_command_keys
that precede this key sequence. */
static ptrdiff_t this_single_command_key_start;
#ifdef HAVE_STACK_OVERFLOW_HANDLING
/* For longjmp to recover from C stack overflow. */
sigjmp_buf return_to_command_loop;
/* Message displayed by Vtop_level when recovering from C stack overflow. */
static Lisp_Object recover_top_level_message;
#endif /* HAVE_STACK_OVERFLOW_HANDLING */
/* Message normally displayed by Vtop_level. */
static Lisp_Object regular_top_level_message;
/* True while displaying for echoing. Delays C-g throwing. */
static bool echoing;
/* Non-null means we can start echoing at the next input pause even
though there is something in the echo area. */
static struct kboard *ok_to_echo_at_next_pause;
/* The kboard last echoing, or null for none. Reset to 0 in
cancel_echoing. If non-null, and a current echo area message
exists, and echo_message_buffer is eq to the current message
buffer, we know that the message comes from echo_kboard. */
struct kboard *echo_kboard;
/* The buffer used for echoing. Set in echo_now, reset in
cancel_echoing. */
Lisp_Object echo_message_buffer;
/* Character that causes a quit. Normally C-g.
If we are running on an ordinary terminal, this must be an ordinary
ASCII char, since we want to make it our interrupt character.
If we are not running on an ordinary terminal, it still needs to be
an ordinary ASCII char. This character needs to be recognized in
the input interrupt handler. At this point, the keystroke is
represented as a struct input_event, while the desired quit
character is specified as a lispy event. The mapping from struct
input_events to lispy events cannot run in an interrupt handler,
and the reverse mapping is difficult for anything but ASCII
keystrokes.
FOR THESE ELABORATE AND UNSATISFYING REASONS, quit_char must be an
ASCII character. */
int quit_char;
/* Current depth in recursive edits. */
EMACS_INT command_loop_level;
/* If not Qnil, this is a switch-frame event which we decided to put
off until the end of a key sequence. This should be read as the
next command input, after any unread_command_events.
read_key_sequence uses this to delay switch-frame events until the
end of the key sequence; Fread_char uses it to put off switch-frame
events until a non-ASCII event is acceptable as input. */
Lisp_Object unread_switch_frame;
/* Last size recorded for a current buffer which is not a minibuffer. */
static ptrdiff_t last_non_minibuf_size;
uintmax_t num_input_events;
ptrdiff_t point_before_last_command_or_undo;
struct buffer *buffer_before_last_command_or_undo;
/* Value of num_nonmacro_input_events as of last auto save. */
static intmax_t last_auto_save;
/* The value of point when the last command was started. */
static ptrdiff_t last_point_position;
/* The frame in which the last input event occurred, or Qmacro if the
last event came from a macro. We use this to determine when to
generate switch-frame events. This may be cleared by functions
like Fselect_frame, to make sure that a switch-frame event is
generated by the next character.
FIXME: This is modified by a signal handler so it should be volatile.
It's exported to Lisp, though, so it can't simply be marked
'volatile' here. */
Lisp_Object internal_last_event_frame;
/* `read_key_sequence' stores here the command definition of the
key sequence that it reads. */
static Lisp_Object read_key_sequence_cmd;
static Lisp_Object read_key_sequence_remapped;
/* File in which we write all commands we read. */
static FILE *dribble;
/* True if input is available. */
bool input_pending;
/* True if more input was available last time we read an event.
Since redisplay can take a significant amount of time and is not
indispensable to perform the user's commands, when input arrives
"too fast", Emacs skips redisplay. More specifically, if the next
command has already been input when we finish the previous command,
we skip the intermediate redisplay.
This is useful to try and make sure Emacs keeps up with fast input
rates, such as auto-repeating keys. But in some cases, this proves
too conservative: we may end up disabling redisplay for the whole
duration of a key repetition, even though we could afford to
redisplay every once in a while.
So we "sample" the input_pending flag before running a command and
use *that* value after running the command to decide whether to
skip redisplay or not. This way, we only skip redisplay if we
really can't keep up with the repeat rate.
This only makes a difference if the next input arrives while running the
command, which is very unlikely if the command is executed quickly.
IOW this tends to avoid skipping redisplay after a long running command
(which is a case where skipping redisplay is not very useful since the
redisplay time is small compared to the time it took to run the command).
A typical use case is when scrolling. Scrolling time can be split into:
- Time to do jit-lock on the newly displayed portion of buffer.
- Time to run the actual scroll command.
- Time to perform the redisplay.
Jit-lock can happen either during the command or during the redisplay.
In the most painful cases, the jit-lock time is the one that dominates.
Also jit-lock can be tweaked (via jit-lock-defer) to delay its job, at the
cost of temporary inaccuracy in display and scrolling.
So without input_was_pending, what typically happens is the following:
- when the command starts, there's no pending input (yet).
- the scroll command triggers jit-lock.
- during the long jit-lock time the next input arrives.
- at the end of the command, we check input_pending and hence decide to
skip redisplay.
- we read the next input and start over.
End result: all the hard work of jit-locking is "wasted" since redisplay
doesn't actually happens (at least not before the input rate slows down).
With input_was_pending redisplay is still skipped if Emacs can't keep up
with the input rate, but if it can keep up just enough that there's no
input_pending when we begin the command, then redisplay is not skipped
which results in better feedback to the user. */
bool input_was_pending;
/* Circular buffer for pre-read keyboard input. */
static union buffered_input_event kbd_buffer[KBD_BUFFER_SIZE];
/* Pointer to next available character in kbd_buffer.
If kbd_fetch_ptr == kbd_store_ptr, the buffer is empty. */
static union buffered_input_event *kbd_fetch_ptr;
/* Pointer to next place to store character in kbd_buffer. */
static union buffered_input_event *kbd_store_ptr;
/* The above pair of variables forms a "queue empty" flag. When we
enqueue a non-hook event, we increment kbd_store_ptr. When we
dequeue a non-hook event, we increment kbd_fetch_ptr. We say that
there is input available if the two pointers are not equal.
Why not just have a flag set and cleared by the enqueuing and
dequeuing functions? The code is a bit simpler this way. */
static void recursive_edit_unwind (Lisp_Object buffer);
static Lisp_Object command_loop (void);
static void echo_now (void);
static ptrdiff_t echo_length (void);
/* Incremented whenever a timer is run. */
unsigned timers_run;
/* Address (if not 0) of struct timespec to zero out if a SIGIO interrupt
happens. */
struct timespec *input_available_clear_time;
/* True means use SIGIO interrupts; false means use CBREAK mode.
Default is true if INTERRUPT_INPUT is defined. */
bool interrupt_input;
/* Nonzero while interrupts are temporarily deferred during redisplay. */
bool interrupts_deferred;
/* The time when Emacs started being idle. */
static struct timespec timer_idleness_start_time;
/* After Emacs stops being idle, this saves the last value
of timer_idleness_start_time from when it was idle. */
static struct timespec timer_last_idleness_start_time;
/* Global variable declarations. */
/* Flags for readable_events. */
#define READABLE_EVENTS_DO_TIMERS_NOW (1 << 0)
#define READABLE_EVENTS_FILTER_EVENTS (1 << 1)
#define READABLE_EVENTS_IGNORE_SQUEEZABLES (1 << 2)
/* Function for init_keyboard to call with no args (if nonzero). */
static void (*keyboard_init_hook) (void);
static bool get_input_pending (int);
static bool readable_events (int);
static Lisp_Object read_char_x_menu_prompt (Lisp_Object,
Lisp_Object, bool *);
static Lisp_Object read_char_minibuf_menu_prompt (int, Lisp_Object);
static Lisp_Object make_lispy_event (struct input_event *);
static Lisp_Object make_lispy_movement (struct frame *, Lisp_Object,
enum scroll_bar_part,
Lisp_Object, Lisp_Object,
Time);
static Lisp_Object modify_event_symbol (ptrdiff_t, int, Lisp_Object,
Lisp_Object, const char *const *,
Lisp_Object *, ptrdiff_t);
static Lisp_Object make_lispy_switch_frame (Lisp_Object);
static Lisp_Object make_lispy_focus_in (Lisp_Object);
static Lisp_Object make_lispy_focus_out (Lisp_Object);
static bool help_char_p (Lisp_Object);
static void save_getcjmp (sys_jmp_buf);
static void restore_getcjmp (void *);
static Lisp_Object apply_modifiers (int, Lisp_Object);
static void restore_kboard_configuration (int);
static void handle_interrupt (bool);
static AVOID quit_throw_to_read_char (bool);
static void timer_start_idle (void);
static void timer_stop_idle (void);
static void timer_resume_idle (void);
static void deliver_user_signal (int);
static char *find_user_signal_name (int);
static void store_user_signal_events (void);
/* Advance or retreat a buffered input event pointer. */
static union buffered_input_event *
next_kbd_event (union buffered_input_event *ptr)
{
return ptr == kbd_buffer + KBD_BUFFER_SIZE - 1 ? kbd_buffer : ptr + 1;
}
#ifdef HAVE_X11
static union buffered_input_event *
prev_kbd_event (union buffered_input_event *ptr)
{
return ptr == kbd_buffer ? kbd_buffer + KBD_BUFFER_SIZE - 1 : ptr - 1;
}
#endif
/* Like EVENT_START, but assume EVENT is an event.
This pacifies gcc -Wnull-dereference, which might otherwise
complain about earlier checks that EVENT is indeed an event. */
static Lisp_Object
xevent_start (Lisp_Object event)
{
return XCAR (XCDR (event));
}
/* These setters are used only in this file, so they can be private. */
static void
kset_echo_string (struct kboard *kb, Lisp_Object val)
{
kb->echo_string_ = val;
}
static void
kset_echo_prompt (struct kboard *kb, Lisp_Object val)
{
kb->echo_prompt_ = val;
}
static void
kset_kbd_queue (struct kboard *kb, Lisp_Object val)
{
kb->kbd_queue_ = val;
}
static void
kset_keyboard_translate_table (struct kboard *kb, Lisp_Object val)
{
kb->Vkeyboard_translate_table_ = val;
}
static void
kset_last_prefix_arg (struct kboard *kb, Lisp_Object val)
{
kb->Vlast_prefix_arg_ = val;
}
static void
kset_last_repeatable_command (struct kboard *kb, Lisp_Object val)
{
kb->Vlast_repeatable_command_ = val;
}
static void
kset_local_function_key_map (struct kboard *kb, Lisp_Object val)
{
kb->Vlocal_function_key_map_ = val;
}
static void
kset_overriding_terminal_local_map (struct kboard *kb, Lisp_Object val)
{
kb->Voverriding_terminal_local_map_ = val;
}
static void
kset_real_last_command (struct kboard *kb, Lisp_Object val)
{
kb->Vreal_last_command_ = val;
}
static void
kset_system_key_syms (struct kboard *kb, Lisp_Object val)
{
kb->system_key_syms_ = val;
}
static bool
echo_keystrokes_p (void)
{
return (FLOATP (Vecho_keystrokes) ? XFLOAT_DATA (Vecho_keystrokes) > 0.0
: FIXNUMP (Vecho_keystrokes) ? XFIXNUM (Vecho_keystrokes) > 0
: false);
}
/* Add C to the echo string, without echoing it immediately. C can be
a character, which is pretty-printed, or a symbol, whose name is
printed. */
static void
echo_add_key (Lisp_Object c)
{
char initbuf[KEY_DESCRIPTION_SIZE + 100];
ptrdiff_t size = sizeof initbuf;
char *buffer = initbuf;
char *ptr = buffer;
Lisp_Object echo_string = KVAR (current_kboard, echo_string);
USE_SAFE_ALLOCA;
if (STRINGP (echo_string) && SCHARS (echo_string) > 0)
/* Add a space at the end as a separator between keys. */
ptr++[0] = ' ';
/* If someone has passed us a composite event, use its head symbol. */
c = EVENT_HEAD (c);
if (FIXNUMP (c))
ptr = push_key_description (XFIXNUM (c), ptr);
else if (SYMBOLP (c))
{
Lisp_Object name = SYMBOL_NAME (c);
ptrdiff_t nbytes = SBYTES (name);
if (size - (ptr - buffer) < nbytes)
{
ptrdiff_t offset = ptr - buffer;
size = max (2 * size, size + nbytes);
buffer = SAFE_ALLOCA (size);
ptr = buffer + offset;
}
ptr += copy_text (SDATA (name), (unsigned char *) ptr, nbytes,
STRING_MULTIBYTE (name), 1);
}
if ((NILP (echo_string) || SCHARS (echo_string) == 0)
&& help_char_p (c))
{
static const char text[] = " (Type ? for further options)";
int len = sizeof text - 1;
if (size - (ptr - buffer) < len)
{
ptrdiff_t offset = ptr - buffer;
size += len;
buffer = SAFE_ALLOCA (size);
ptr = buffer + offset;
}
memcpy (ptr, text, len);
ptr += len;
}
kset_echo_string
(current_kboard,
concat2 (echo_string, make_string (buffer, ptr - buffer)));
SAFE_FREE ();
}
/* Temporarily add a dash to the end of the echo string if it's not
empty, so that it serves as a mini-prompt for the very next
character. */
static void
echo_dash (void)
{
/* Do nothing if not echoing at all. */
if (NILP (KVAR (current_kboard, echo_string)))
return;
if (!current_kboard->immediate_echo
&& SCHARS (KVAR (current_kboard, echo_string)) == 0)
return;
/* Do nothing if we just printed a prompt. */
if (STRINGP (KVAR (current_kboard, echo_prompt))
&& (SCHARS (KVAR (current_kboard, echo_prompt))
== SCHARS (KVAR (current_kboard, echo_string))))
return;
/* Do nothing if we have already put a dash at the end. */
if (SCHARS (KVAR (current_kboard, echo_string)) > 1)
{
Lisp_Object last_char, prev_char, idx;
idx = make_fixnum (SCHARS (KVAR (current_kboard, echo_string)) - 2);
prev_char = Faref (KVAR (current_kboard, echo_string), idx);
idx = make_fixnum (SCHARS (KVAR (current_kboard, echo_string)) - 1);
last_char = Faref (KVAR (current_kboard, echo_string), idx);
if (XFIXNUM (last_char) == '-' && XFIXNUM (prev_char) != ' ')
return;
}
/* Put a dash at the end of the buffer temporarily,
but make it go away when the next character is added. */
AUTO_STRING (dash, "-");
kset_echo_string (current_kboard,
concat2 (KVAR (current_kboard, echo_string), dash));
echo_now ();
}
static void
echo_update (void)
{
if (current_kboard->immediate_echo)
{
ptrdiff_t i;
Lisp_Object prompt = KVAR (current_kboard, echo_prompt);
Lisp_Object prefix = call0 (Qinternal_echo_keystrokes_prefix);
kset_echo_string (current_kboard,
NILP (prompt) ? prefix
: NILP (prefix) ? prompt
: concat2 (prompt, prefix));
for (i = 0; i < this_command_key_count; i++)
{
Lisp_Object c;
c = AREF (this_command_keys, i);
if (! (EVENT_HAS_PARAMETERS (c)
&& EQ (EVENT_HEAD_KIND (EVENT_HEAD (c)), Qmouse_movement)))
echo_add_key (c);
}
echo_now ();
}
}
/* Display the current echo string, and begin echoing if not already
doing so. */
static void
echo_now (void)
{
if (!current_kboard->immediate_echo
/* This test breaks calls that use `echo_now' to display the echo_prompt.
&& echo_keystrokes_p () */)
{
current_kboard->immediate_echo = true;
echo_update ();
/* Put a dash at the end to invite the user to type more. */
echo_dash ();
}
echoing = true;
/* FIXME: Use call (Qmessage) so it can be advised (e.g. emacspeak). */
message3_nolog (KVAR (current_kboard, echo_string));
echoing = false;
/* Record in what buffer we echoed, and from which kboard. */
echo_message_buffer = echo_area_buffer[0];
echo_kboard = current_kboard;
if (waiting_for_input && !NILP (Vquit_flag))
quit_throw_to_read_char (0);
}
/* Turn off echoing, for the start of a new command. */
void
cancel_echoing (void)
{
current_kboard->immediate_echo = false;
kset_echo_prompt (current_kboard, Qnil);
kset_echo_string (current_kboard, Qnil);
ok_to_echo_at_next_pause = NULL;
echo_kboard = NULL;
echo_message_buffer = Qnil;
}
/* Return the length of the current echo string. */
static ptrdiff_t
echo_length (void)
{
return (STRINGP (KVAR (current_kboard, echo_string))
? SCHARS (KVAR (current_kboard, echo_string))
: 0);
}
/* Truncate the current echo message to its first LEN chars.
This and echo_char get used by read_key_sequence when the user
switches frames while entering a key sequence. */
static void
echo_truncate (ptrdiff_t nchars)
{
Lisp_Object es = KVAR (current_kboard, echo_string);
if (STRINGP (es) && SCHARS (es) > nchars)
kset_echo_string (current_kboard,
Fsubstring (KVAR (current_kboard, echo_string),
make_fixnum (0), make_fixnum (nchars)));
truncate_echo_area (nchars);
}
/* Functions for manipulating this_command_keys. */
static void
add_command_key (Lisp_Object key)
{
if (this_command_key_count >= ASIZE (this_command_keys))
this_command_keys = larger_vector (this_command_keys, 1, -1);
ASET (this_command_keys, this_command_key_count, key);
++this_command_key_count;
}
Lisp_Object
recursive_edit_1 (void)
{
ptrdiff_t count = SPECPDL_INDEX ();
Lisp_Object val;
if (command_loop_level > 0)
{
specbind (Qstandard_output, Qt);
specbind (Qstandard_input, Qt);
}
#ifdef HAVE_WINDOW_SYSTEM
/* The command loop has started an hourglass timer, so we have to
cancel it here, otherwise it will fire because the recursive edit
can take some time. Do not check for display_hourglass_p here,
because it could already be nil. */
cancel_hourglass ();
#endif
/* This function may have been called from a debugger called from
within redisplay, for instance by Edebugging a function called
from fontification-functions. We want to allow redisplay in
the debugging session.
The recursive edit is left with a `(throw exit ...)'. The `exit'
tag is not caught anywhere in redisplay, i.e. when we leave the
recursive edit, the original redisplay leading to the recursive
edit will be unwound. The outcome should therefore be safe. */
specbind (Qinhibit_redisplay, Qnil);
redisplaying_p = 0;
/* This variable stores buffers that have changed so that an undo
boundary can be added. specbind this so that changes in the
recursive edit will not result in undo boundaries in buffers
changed before we entered there recursive edit.
See Bug #23632.
*/
specbind (Qundo_auto__undoably_changed_buffers, Qnil);
val = command_loop ();
if (EQ (val, Qt))
quit ();
/* Handle throw from read_minibuf when using minibuffer
while it's active but we're in another window. */
if (STRINGP (val))
xsignal1 (Qerror, val);
if (FUNCTIONP (val))
call0 (val);
return unbind_to (count, Qnil);
}
/* When an auto-save happens, record the "time", and don't do again soon. */
void
record_auto_save (void)
{
last_auto_save = num_nonmacro_input_events;
}
/* Make an auto save happen as soon as possible at command level. */
#ifdef SIGDANGER
void
force_auto_save_soon (void)
{
last_auto_save = - auto_save_interval - 1;
}
#endif
DEFUN ("recursive-edit", Frecursive_edit, Srecursive_edit, 0, 0, "",
doc: /* Invoke the editor command loop recursively.
To get out of the recursive edit, a command can throw to `exit' -- for
instance (throw \\='exit nil).
If you throw a value other than t, `recursive-edit' returns normally
to the function that called it. Throwing a t value causes
`recursive-edit' to quit, so that control returns to the command loop
one level up.
This function is called by the editor initialization to begin editing. */)
(void)
{
ptrdiff_t count = SPECPDL_INDEX ();
Lisp_Object buffer;
/* If we enter while input is blocked, don't lock up here.
This may happen through the debugger during redisplay. */
if (input_blocked_p ())
return Qnil;
if (command_loop_level >= 0
&& current_buffer != XBUFFER (XWINDOW (selected_window)->contents))
buffer = Fcurrent_buffer ();
else
buffer = Qnil;
/* Don't do anything interesting between the increment and the
record_unwind_protect! Otherwise, we could get distracted and
never decrement the counter again. */
command_loop_level++;
update_mode_lines = 17;
record_unwind_protect (recursive_edit_unwind, buffer);
/* If we leave recursive_edit_1 below with a `throw' for instance,
like it is done in the splash screen display, we have to
make sure that we restore single_kboard as command_loop_1
would have done if it were left normally. */
if (command_loop_level > 0)
temporarily_switch_to_single_kboard (SELECTED_FRAME ());
recursive_edit_1 ();
return unbind_to (count, Qnil);
}
void
recursive_edit_unwind (Lisp_Object buffer)
{
if (BUFFERP (buffer))
Fset_buffer (buffer);
command_loop_level--;
update_mode_lines = 18;
}
/* If we're in single_kboard state for kboard KBOARD,
get out of it. */
void
not_single_kboard_state (KBOARD *kboard)
{
if (kboard == current_kboard)
single_kboard = false;
}
/* Maintain a stack of kboards, so other parts of Emacs
can switch temporarily to the kboard of a given frame
and then revert to the previous status. */
struct kboard_stack
{
KBOARD *kboard;
struct kboard_stack *next;
};
static struct kboard_stack *kboard_stack;
void
push_kboard (struct kboard *k)
{
struct kboard_stack *p = xmalloc (sizeof *p);
p->next = kboard_stack;
p->kboard = current_kboard;
kboard_stack = p;
current_kboard = k;
}
void
pop_kboard (void)
{
struct terminal *t;
struct kboard_stack *p = kboard_stack;
bool found = false;
for (t = terminal_list; t; t = t->next_terminal)
{
if (t->kboard == p->kboard)
{
current_kboard = p->kboard;
found = true;
break;
}
}
if (!found)
{
/* The terminal we remembered has been deleted. */
current_kboard = FRAME_KBOARD (SELECTED_FRAME ());
single_kboard = false;
}
kboard_stack = p->next;
xfree (p);
}
/* Switch to single_kboard mode, making current_kboard the only KBOARD
from which further input is accepted. If F is non-nil, set its
KBOARD as the current keyboard.
This function uses record_unwind_protect_int to return to the previous
state later.
If Emacs is already in single_kboard mode, and F's keyboard is
locked, then this function will throw an error. */
void
temporarily_switch_to_single_kboard (struct frame *f)
{
bool was_locked = single_kboard;
if (was_locked)
{
if (f != NULL && FRAME_KBOARD (f) != current_kboard)
/* We can not switch keyboards while in single_kboard mode.
In rare cases, Lisp code may call `recursive-edit' (or
`read-minibuffer' or `y-or-n-p') after it switched to a
locked frame. For example, this is likely to happen
when server.el connects to a new terminal while Emacs is in
single_kboard mode. It is best to throw an error instead
of presenting the user with a frozen screen. */
error ("Terminal %d is locked, cannot read from it",
FRAME_TERMINAL (f)->id);
else
/* This call is unnecessary, but helps
`restore_kboard_configuration' discover if somebody changed
`current_kboard' behind our back. */
push_kboard (current_kboard);
}
else if (f != NULL)
current_kboard = FRAME_KBOARD (f);
single_kboard = true;
record_unwind_protect_int (restore_kboard_configuration, was_locked);
}
static void
restore_kboard_configuration (int was_locked)
{
single_kboard = was_locked;
if (was_locked)
{
struct kboard *prev = current_kboard;
pop_kboard ();
/* The pop should not change the kboard. */
if (single_kboard && current_kboard != prev)
emacs_abort ();
}
}
/* Handle errors that are not handled at inner levels
by printing an error message and returning to the editor command loop. */
static Lisp_Object
cmd_error (Lisp_Object data)
{
Lisp_Object old_level, old_length;
ptrdiff_t count = SPECPDL_INDEX ();
Lisp_Object conditions;
char macroerror[sizeof "After..kbd macro iterations: "
+ INT_STRLEN_BOUND (EMACS_INT)];
#ifdef HAVE_WINDOW_SYSTEM
if (display_hourglass_p)
cancel_hourglass ();
#endif
if (!NILP (executing_kbd_macro))
{
if (executing_kbd_macro_iterations == 1)
sprintf (macroerror, "After 1 kbd macro iteration: ");
else
sprintf (macroerror, "After %"pI"d kbd macro iterations: ",
executing_kbd_macro_iterations);
}
else
*macroerror = 0;
conditions = Fget (XCAR (data), Qerror_conditions);
if (NILP (Fmemq (Qminibuffer_quit, conditions)))
{
Vexecuting_kbd_macro = Qnil;
executing_kbd_macro = Qnil;
}
specbind (Qstandard_output, Qt);
specbind (Qstandard_input, Qt);
kset_prefix_arg (current_kboard, Qnil);
kset_last_prefix_arg (current_kboard, Qnil);
cancel_echoing ();
/* Avoid unquittable loop if data contains a circular list. */
old_level = Vprint_level;
old_length = Vprint_length;
XSETFASTINT (Vprint_level, 10);
XSETFASTINT (Vprint_length, 10);
cmd_error_internal (data, macroerror);
Vprint_level = old_level;
Vprint_length = old_length;
Vquit_flag = Qnil;
Vinhibit_quit = Qnil;
unbind_to (count, Qnil);
return make_fixnum (0);
}
/* Take actions on handling an error. DATA is the data that describes
the error.
CONTEXT is a C-string containing ASCII characters only which
describes the context in which the error happened. If we need to
generalize CONTEXT to allow multibyte characters, make it a Lisp
string. */
void
cmd_error_internal (Lisp_Object data, const char *context)
{
/* The immediate context is not interesting for Quits,
since they are asynchronous. */
if (signal_quit_p (XCAR (data)))
Vsignaling_function = Qnil;
Vquit_flag = Qnil;
Vinhibit_quit = Qt;
/* Use user's specified output function if any. */
if (!NILP (Vcommand_error_function))
call3 (Vcommand_error_function, data,
context ? build_string (context) : empty_unibyte_string,
Vsignaling_function);
Vsignaling_function = Qnil;
}
DEFUN ("command-error-default-function", Fcommand_error_default_function,
Scommand_error_default_function, 3, 3, 0,
doc: /* Produce default output for unhandled error message.
Default value of `command-error-function'. */)
(Lisp_Object data, Lisp_Object context, Lisp_Object signal)
{
struct frame *sf = SELECTED_FRAME ();
Lisp_Object conditions;
CHECK_STRING (context);
/* If the window system or terminal frame hasn't been initialized
yet, or we're not interactive, write the message to stderr and exit. */
if (!sf->glyphs_initialized_p
/* The initial frame is a special non-displaying frame. It
will be current in daemon mode when there are no frames
to display, and in non-daemon mode before the real frame
has finished initializing. If an error is thrown in the
latter case while creating the frame, then the frame
will never be displayed, so the safest thing to do is
write to stderr and quit. In daemon mode, there are
many other potential errors that do not prevent frames
from being created, so continuing as normal is better in
that case. */
|| (!IS_DAEMON && FRAME_INITIAL_P (sf))
|| noninteractive)
{
print_error_message (data, Qexternal_debugging_output,
SSDATA (context), signal);
Fterpri (Qexternal_debugging_output, Qnil);
Fkill_emacs (make_fixnum (-1));
}
else
{
conditions = Fget (XCAR (data), Qerror_conditions);
clear_message (1, 0);
message_log_maybe_newline ();
if (!NILP (Fmemq (Qminibuffer_quit, conditions)))
{
Fding (Qt);
}
else
{
Fdiscard_input ();
bitch_at_user ();
}
print_error_message (data, Qt, SSDATA (context), signal);
}
return Qnil;
}
static Lisp_Object command_loop_1 (void);
static Lisp_Object top_level_1 (Lisp_Object);
/* Entry to editor-command-loop.
This level has the catches for exiting/returning to editor command loop.
It returns nil to exit recursive edit, t to abort it. */
Lisp_Object
command_loop (void)
{
#ifdef HAVE_STACK_OVERFLOW_HANDLING
/* At least on GNU/Linux, saving signal mask is important here. */
if (sigsetjmp (return_to_command_loop, 1) != 0)
{
/* Comes here from handle_sigsegv (see sysdep.c) and
stack_overflow_handler (see w32fns.c). */
#ifdef WINDOWSNT
w32_reset_stack_overflow_guard ();
#endif
init_eval ();
Vinternal__top_level_message = recover_top_level_message;
}
else
Vinternal__top_level_message = regular_top_level_message;
#endif /* HAVE_STACK_OVERFLOW_HANDLING */
if (command_loop_level > 0 || minibuf_level > 0)
{
Lisp_Object val;
val = internal_catch (Qexit, command_loop_2, Qerror);
executing_kbd_macro = Qnil;
return val;
}
else
while (1)
{
internal_catch (Qtop_level, top_level_1, Qnil);
internal_catch (Qtop_level, command_loop_2, Qerror);
executing_kbd_macro = Qnil;
/* End of file in -batch run causes exit here. */
if (noninteractive)
Fkill_emacs (Qt);
}
}
/* Here we catch errors in execution of commands within the
editing loop, and reenter the editing loop.
When there is an error, cmd_error runs and returns a non-nil
value to us. A value of nil means that command_loop_1 itself
returned due to end of file (or end of kbd macro). HANDLERS is a
list of condition names, passed to internal_condition_case. */
Lisp_Object
command_loop_2 (Lisp_Object handlers)
{
register Lisp_Object val;
do
val = internal_condition_case (command_loop_1, handlers, cmd_error);
while (!NILP (val));
return Qnil;
}
static Lisp_Object
top_level_2 (void)
{
return Feval (Vtop_level, Qnil);
}
static Lisp_Object
top_level_1 (Lisp_Object ignore)
{
/* On entry to the outer level, run the startup file. */
if (!NILP (Vtop_level))
internal_condition_case (top_level_2, Qerror, cmd_error);
else if (!NILP (Vpurify_flag))
message1 ("Bare impure Emacs (standard Lisp code not loaded)");
else
message1 ("Bare Emacs (standard Lisp code not loaded)");
return Qnil;
}
DEFUN ("top-level", Ftop_level, Stop_level, 0, 0, "",
doc: /* Exit all recursive editing levels.
This also exits all active minibuffers. */
attributes: noreturn)
(void)
{
#ifdef HAVE_WINDOW_SYSTEM
if (display_hourglass_p)
cancel_hourglass ();
#endif
/* Unblock input if we enter with input blocked. This may happen if
redisplay traps e.g. during tool-bar update with input blocked. */
totally_unblock_input ();
Fthrow (Qtop_level, Qnil);
}
static AVOID
user_error (const char *msg)
{
xsignal1 (Quser_error, build_string (msg));
}
DEFUN ("exit-recursive-edit", Fexit_recursive_edit, Sexit_recursive_edit, 0, 0, "",
doc: /* Exit from the innermost recursive edit or minibuffer. */
attributes: noreturn)
(void)
{
if (command_loop_level > 0 || minibuf_level > 0)
Fthrow (Qexit, Qnil);
user_error ("No recursive edit is in progress");
}
DEFUN ("abort-recursive-edit", Fabort_recursive_edit, Sabort_recursive_edit, 0, 0, "",
doc: /* Abort the command that requested this recursive edit or minibuffer input. */
attributes: noreturn)
(void)
{
if (command_loop_level > 0 || minibuf_level > 0)
Fthrow (Qexit, Qt);
user_error ("No recursive edit is in progress");
}
/* Restore mouse tracking enablement. See Finternal_track_mouse for
the only use of this function. */
static void
tracking_off (Lisp_Object old_track_mouse)
{
track_mouse = old_track_mouse;
if (NILP (old_track_mouse))
{
/* Redisplay may have been preempted because there was input
available, and it assumes it will be called again after the
input has been processed. If the only input available was
the sort that we have just disabled, then we need to call
redisplay. */
if (!readable_events (READABLE_EVENTS_DO_TIMERS_NOW))
{
redisplay_preserve_echo_area (6);
get_input_pending (READABLE_EVENTS_DO_TIMERS_NOW);
}
}
}
DEFUN ("internal--track-mouse", Finternal_track_mouse, Sinternal_track_mouse,
1, 1, 0,
doc: /* Call BODYFUN with mouse movement events enabled. */)
(Lisp_Object bodyfun)
{
ptrdiff_t count = SPECPDL_INDEX ();
Lisp_Object val;
record_unwind_protect (tracking_off, track_mouse);
track_mouse = Qt;
val = call0 (bodyfun);
return unbind_to (count, val);
}
/* If mouse has moved on some frame and we are tracking the mouse,
return one of those frames. Return NULL otherwise.
If ignore_mouse_drag_p is non-zero, ignore (implicit) mouse movement
after resizing the tool-bar window. */
bool ignore_mouse_drag_p;
static struct frame *
some_mouse_moved (void)
{
Lisp_Object tail, frame;
if (NILP (track_mouse) || ignore_mouse_drag_p)
return NULL;
FOR_EACH_FRAME (tail, frame)
{
if (XFRAME (frame)->mouse_moved)
return XFRAME (frame);
}
return NULL;
}
/* This is the actual command reading loop,
sans error-handling encapsulation. */
enum { READ_KEY_ELTS = 30 };
static int read_key_sequence (Lisp_Object *, Lisp_Object,
bool, bool, bool, bool);
static void adjust_point_for_property (ptrdiff_t, bool);
static Lisp_Object
command_loop_1 (void)
{
modiff_count prev_modiff = 0;
struct buffer *prev_buffer = NULL;
bool already_adjusted = 0;
kset_prefix_arg (current_kboard, Qnil);
kset_last_prefix_arg (current_kboard, Qnil);
Vdeactivate_mark = Qnil;
waiting_for_input = false;
cancel_echoing ();
this_command_key_count = 0;
this_single_command_key_start = 0;
if (NILP (Vmemory_full))
{
/* Make sure this hook runs after commands that get errors and
throw to top level. */
/* Note that the value cell will never directly contain nil
if the symbol is a local variable. */
if (!NILP (Vpost_command_hook) && !NILP (Vrun_hooks))
safe_run_hooks (Qpost_command_hook);
/* If displaying a message, resize the echo area window to fit
that message's size exactly. */
if (!NILP (echo_area_buffer[0]))
resize_echo_area_exactly ();
/* If there are warnings waiting, process them. */
if (!NILP (Vdelayed_warnings_list))
safe_run_hooks (Qdelayed_warnings_hook);
if (!NILP (Vdeferred_action_list))
safe_run_hooks (Qdeferred_action_function);
}
/* Do this after running Vpost_command_hook, for consistency. */
kset_last_command (current_kboard, Vthis_command);
kset_real_last_command (current_kboard, Vreal_this_command);
if (!CONSP (last_command_event))
kset_last_repeatable_command (current_kboard, Vreal_this_command);
while (true)
{
Lisp_Object cmd;
if (! FRAME_LIVE_P (XFRAME (selected_frame)))
Fkill_emacs (Qnil);
/* Make sure the current window's buffer is selected. */
set_buffer_internal (XBUFFER (XWINDOW (selected_window)->contents));
/* Display any malloc warning that just came out. Use while because
displaying one warning can cause another. */
while (pending_malloc_warning)
display_malloc_warning ();
Vdeactivate_mark = Qnil;
/* Don't ignore mouse movements for more than a single command
loop. (This flag is set in xdisp.c whenever the tool bar is
resized, because the resize moves text up or down, and would
generate false mouse drag events if we don't ignore them.) */
ignore_mouse_drag_p = false;
/* If minibuffer on and echo area in use,
wait a short time and redraw minibuffer. */
if (minibuf_level
&& !NILP (echo_area_buffer[0])
&& EQ (minibuf_window, echo_area_window)
&& NUMBERP (Vminibuffer_message_timeout))
{
/* Bind inhibit-quit to t so that C-g gets read in
rather than quitting back to the minibuffer. */
ptrdiff_t count = SPECPDL_INDEX ();
specbind (Qinhibit_quit, Qt);
sit_for (Vminibuffer_message_timeout, 0, 2);
/* Clear the echo area. */
message1 (0);
safe_run_hooks (Qecho_area_clear_hook);
/* We cleared the echo area, and the minibuffer will now
show, so resize the mini-window in case the minibuffer
needs more or less space than the echo area. */
resize_mini_window (XWINDOW (minibuf_window), false);
unbind_to (count, Qnil);
/* If a C-g came in before, treat it as input now. */
if (!NILP (Vquit_flag))
{
Vquit_flag = Qnil;
Vunread_command_events = list1i (quit_char);
}
}
/* If it has changed current-menubar from previous value,
really recompute the menubar from the value. */
if (! NILP (Vlucid_menu_bar_dirty_flag)
&& !NILP (Ffboundp (Qrecompute_lucid_menubar)))
call0 (Qrecompute_lucid_menubar);
Vthis_command = Qnil;
Vreal_this_command = Qnil;
Vthis_original_command = Qnil;
Vthis_command_keys_shift_translated = Qnil;
/* Read next key sequence; i gets its length. */
raw_keybuf_count = 0;
Lisp_Object keybuf[READ_KEY_ELTS];
int i = read_key_sequence (keybuf, Qnil, false, true, true, false);
/* A filter may have run while we were reading the input. */
if (! FRAME_LIVE_P (XFRAME (selected_frame)))
Fkill_emacs (Qnil);
set_buffer_internal (XBUFFER (XWINDOW (selected_window)->contents));
++num_input_keys;
/* Now we have read a key sequence of length I,
or else I is 0 and we found end of file. */
if (i == 0) /* End of file -- happens only in */
return Qnil; /* a kbd macro, at the end. */
/* -1 means read_key_sequence got a menu that was rejected.
Just loop around and read another command. */
if (i == -1)
{
cancel_echoing ();
this_command_key_count = 0;
this_single_command_key_start = 0;
goto finalize;
}
last_command_event = keybuf[i - 1];
/* If the previous command tried to force a specific window-start,
forget about that, in case this command moves point far away
from that position. But also throw away beg_unchanged and
end_unchanged information in that case, so that redisplay will
update the whole window properly. */
if (XWINDOW (selected_window)->force_start)
{
struct buffer *b;
XWINDOW (selected_window)->force_start = 0;
b = XBUFFER (XWINDOW (selected_window)->contents);
BUF_BEG_UNCHANGED (b) = BUF_END_UNCHANGED (b) = 0;
}
cmd = read_key_sequence_cmd;
if (!NILP (Vexecuting_kbd_macro))
{
if (!NILP (Vquit_flag))
{
Vexecuting_kbd_macro = Qt;
maybe_quit (); /* Make some noise. */
/* Will return since macro now empty. */
}
}
/* Do redisplay processing after this command except in special
cases identified below. */
prev_buffer = current_buffer;
prev_modiff = MODIFF;
last_point_position = PT;
/* By default, we adjust point to a boundary of a region that
has such a property that should be treated intangible
(e.g. composition, display). But, some commands will set
this variable differently. */
Vdisable_point_adjustment = Qnil;
/* Process filters and timers may have messed with deactivate-mark.
reset it before we execute the command. */
Vdeactivate_mark = Qnil;
/* Remap command through active keymaps. */
Vthis_original_command = cmd;
if (!NILP (read_key_sequence_remapped))
cmd = read_key_sequence_remapped;
/* Execute the command. */
{
total_keys += total_keys < lossage_limit;
ASET (recent_keys, recent_keys_index,
Fcons (Qnil, cmd));
if (++recent_keys_index >= lossage_limit)
recent_keys_index = 0;
}
Vthis_command = cmd;
Vreal_this_command = cmd;
safe_run_hooks (Qpre_command_hook);
already_adjusted = 0;
if (NILP (Vthis_command))
/* nil means key is undefined. */
call0 (Qundefined);
else
{
/* Here for a command that isn't executed directly. */
#ifdef HAVE_WINDOW_SYSTEM
ptrdiff_t scount = SPECPDL_INDEX ();
if (display_hourglass_p
&& NILP (Vexecuting_kbd_macro))
{
record_unwind_protect_void (cancel_hourglass);
start_hourglass ();
}
#endif
/* Ensure that we have added appropriate undo-boundaries as a
result of changes from the last command. */
call0 (Qundo_auto__add_boundary);
/* Record point and buffer, so we can put point into the undo
information if necessary. */
point_before_last_command_or_undo = PT;
buffer_before_last_command_or_undo = current_buffer;
call1 (Qcommand_execute, Vthis_command);
#ifdef HAVE_WINDOW_SYSTEM
/* Do not check display_hourglass_p here, because
`command-execute' could change it, but we should cancel
hourglass cursor anyway.
But don't cancel the hourglass within a macro
just because a command in the macro finishes. */
if (NILP (Vexecuting_kbd_macro))
unbind_to (scount, Qnil);
#endif
}
kset_last_prefix_arg (current_kboard, Vcurrent_prefix_arg);
safe_run_hooks (Qpost_command_hook);
/* If displaying a message, resize the echo area window to fit
that message's size exactly. Do this only if the echo area
window is the minibuffer window of the selected frame. See
Bug#34317. */
if (!NILP (echo_area_buffer[0])
&& (EQ (echo_area_window,
FRAME_MINIBUF_WINDOW (XFRAME (selected_frame)))))
resize_echo_area_exactly ();
/* If there are warnings waiting, process them. */
if (!NILP (Vdelayed_warnings_list))
safe_run_hooks (Qdelayed_warnings_hook);
safe_run_hooks (Qdeferred_action_function);
kset_last_command (current_kboard, Vthis_command);
kset_real_last_command (current_kboard, Vreal_this_command);
if (!CONSP (last_command_event))
kset_last_repeatable_command (current_kboard, Vreal_this_command);
this_command_key_count = 0;
this_single_command_key_start = 0;
if (current_kboard->immediate_echo
&& !NILP (call0 (Qinternal_echo_keystrokes_prefix)))
{
current_kboard->immediate_echo = false;
/* Refresh the echo message. */
echo_now ();
}
else
cancel_echoing ();
if (!NILP (BVAR (current_buffer, mark_active))
&& !NILP (Vrun_hooks))
{
/* In Emacs 22, setting transient-mark-mode to `only' was a
way of turning it on for just one command. This usage is
obsolete, but support it anyway. */
if (EQ (Vtransient_mark_mode, Qidentity))
Vtransient_mark_mode = Qnil;
else if (EQ (Vtransient_mark_mode, Qonly))
Vtransient_mark_mode = Qidentity;
if (!NILP (Vdeactivate_mark))
/* If `select-active-regions' is non-nil, this call to
`deactivate-mark' also sets the PRIMARY selection. */
call0 (Qdeactivate_mark);
else
{
/* Even if not deactivating the mark, set PRIMARY if
`select-active-regions' is non-nil. */
if (!NILP (Fwindow_system (Qnil))
/* Even if mark_active is non-nil, the actual buffer
marker may not have been set yet (Bug#7044). */
&& XMARKER (BVAR (current_buffer, mark))->buffer
&& (EQ (Vselect_active_regions, Qonly)
? EQ (CAR_SAFE (Vtransient_mark_mode), Qonly)
: (!NILP (Vselect_active_regions)
&& !NILP (Vtransient_mark_mode)))
&& NILP (Fmemq (Vthis_command,
Vselection_inhibit_update_commands)))
{
Lisp_Object txt
= call1 (Vregion_extract_function, Qnil);
if (XFIXNUM (Flength (txt)) > 0)
/* Don't set empty selections. */
call2 (Qgui_set_selection, QPRIMARY, txt);
}
if (current_buffer != prev_buffer || MODIFF != prev_modiff)
run_hook (intern ("activate-mark-hook"));
}
Vsaved_region_selection = Qnil;
}
finalize:
if (current_buffer == prev_buffer
&& XBUFFER (XWINDOW (selected_window)->contents) == current_buffer
&& last_point_position != PT
&& NILP (Vdisable_point_adjustment)
&& NILP (Vglobal_disable_point_adjustment))
{
if (last_point_position > BEGV
&& last_point_position < ZV
&& (composition_adjust_point (last_point_position,
last_point_position)
!= last_point_position))
/* The last point was temporarily set within a grapheme
cluster to prevent automatic composition. To recover
the automatic composition, we must update the
display. */
windows_or_buffers_changed = 21;
if (!already_adjusted)
adjust_point_for_property (last_point_position,
MODIFF != prev_modiff);
}
/* Install chars successfully executed in kbd macro. */
if (!NILP (KVAR (current_kboard, defining_kbd_macro))
&& NILP (KVAR (current_kboard, Vprefix_arg)))
finalize_kbd_macro_chars ();
}
}
Lisp_Object
read_menu_command (void)
{
ptrdiff_t count = SPECPDL_INDEX ();
/* We don't want to echo the keystrokes while navigating the
menus. */
specbind (Qecho_keystrokes, make_fixnum (0));
Lisp_Object keybuf[READ_KEY_ELTS];
int i = read_key_sequence (keybuf, Qnil, false, true, true, true);
unbind_to (count, Qnil);
if (! FRAME_LIVE_P (XFRAME (selected_frame)))
Fkill_emacs (Qnil);
if (i == 0 || i == -1)
return Qt;
return read_key_sequence_cmd;
}
/* Adjust point to a boundary of a region that has such a property
that should be treated intangible. For the moment, we check
`composition', `display' and `invisible' properties.
LAST_PT is the last position of point. */
static void
adjust_point_for_property (ptrdiff_t last_pt, bool modified)
{
ptrdiff_t beg, end;
Lisp_Object val, overlay, tmp;
/* When called after buffer modification, we should temporarily
suppress the point adjustment for automatic composition so that a
user can keep inserting another character at point or keep
deleting characters around point. */
bool check_composition = ! modified;
bool check_display = true, check_invisible = true;
ptrdiff_t orig_pt = PT;
eassert (XBUFFER (XWINDOW (selected_window)->contents) == current_buffer);
/* FIXME: cycling is probably not necessary because these properties
can't be usefully combined anyway. */
while (check_composition || check_display || check_invisible)
{
/* FIXME: check `intangible'. */
if (check_composition
&& PT > BEGV && PT < ZV
&& (beg = composition_adjust_point (last_pt, PT)) != PT)
{
SET_PT (beg);
check_display = check_invisible = true;
}
check_composition = false;
if (check_display
&& PT > BEGV && PT < ZV
&& !NILP (val = get_char_property_and_overlay
(make_fixnum (PT), Qdisplay, selected_window,
&overlay))
&& display_prop_intangible_p (val, overlay, PT, PT_BYTE)
&& (!OVERLAYP (overlay)
? get_property_and_range (PT, Qdisplay, &val, &beg, &end, Qnil)
: (beg = OVERLAY_POSITION (OVERLAY_START (overlay)),
end = OVERLAY_POSITION (OVERLAY_END (overlay))))
&& (beg < PT /* && end > PT <- It's always the case. */
|| (beg <= PT && STRINGP (val) && SCHARS (val) == 0)))
{
eassert (end > PT);
SET_PT (PT < last_pt
? (STRINGP (val) && SCHARS (val) == 0
? max (beg - 1, BEGV)
: beg)
: end);
check_composition = check_invisible = true;
}
check_display = false;
if (check_invisible && PT > BEGV && PT < ZV)
{
int inv;
bool ellipsis = false;
beg = end = PT;
/* Find boundaries `beg' and `end' of the invisible area, if any. */
while (end < ZV
#if 0
/* FIXME: We should stop if we find a spot between
two runs of `invisible' where inserted text would
be visible. This is important when we have two
invisible boundaries that enclose an area: if the
area is empty, we need this test in order to make
it possible to place point in the middle rather
than skip both boundaries. However, this code
also stops anywhere in a non-sticky text-property,
which breaks (e.g.) Org mode. */
&& (val = Fget_pos_property (make_fixnum (end),
Qinvisible, Qnil),
TEXT_PROP_MEANS_INVISIBLE (val))
#endif
&& !NILP (val = get_char_property_and_overlay
(make_fixnum (end), Qinvisible, Qnil, &overlay))
&& (inv = TEXT_PROP_MEANS_INVISIBLE (val)))
{
ellipsis = ellipsis || inv > 1
|| (OVERLAYP (overlay)
&& (!NILP (Foverlay_get (overlay, Qafter_string))
|| !NILP (Foverlay_get (overlay, Qbefore_string))));
tmp = Fnext_single_char_property_change
(make_fixnum (end), Qinvisible, Qnil, Qnil);
end = FIXNATP (tmp) ? XFIXNAT (tmp) : ZV;
}
while (beg > BEGV
#if 0
&& (val = Fget_pos_property (make_fixnum (beg),
Qinvisible, Qnil),
TEXT_PROP_MEANS_INVISIBLE (val))
#endif
&& !NILP (val = get_char_property_and_overlay
(make_fixnum (beg - 1), Qinvisible, Qnil, &overlay))
&& (inv = TEXT_PROP_MEANS_INVISIBLE (val)))
{
ellipsis = ellipsis || inv > 1
|| (OVERLAYP (overlay)
&& (!NILP (Foverlay_get (overlay, Qafter_string))
|| !NILP (Foverlay_get (overlay, Qbefore_string))));
tmp = Fprevious_single_char_property_change
(make_fixnum (beg), Qinvisible, Qnil, Qnil);
beg = FIXNATP (tmp) ? XFIXNAT (tmp) : BEGV;
}
/* Move away from the inside area. */
if (beg < PT && end > PT)
{
SET_PT ((orig_pt == PT && (last_pt < beg || last_pt > end))
/* We haven't moved yet (so we don't need to fear
infinite-looping) and we were outside the range
before (so either end of the range still corresponds
to a move in the right direction): pretend we moved
less than we actually did, so that we still have
more freedom below in choosing which end of the range
to go to. */
? (orig_pt = -1, PT < last_pt ? end : beg)
/* We either have moved already or the last point
was already in the range: we don't get to choose
which end of the range we have to go to. */
: (PT < last_pt ? beg : end));
check_composition = check_display = true;
}
#if 0 /* This assertion isn't correct, because SET_PT may end up setting
the point to something other than its argument, due to
point-motion hooks, intangibility, etc. */
eassert (PT == beg || PT == end);
#endif
/* Pretend the area doesn't exist if the buffer is not
modified. */
if (!modified && !ellipsis && beg < end)
{
if (last_pt == beg && PT == end && end < ZV)
(check_composition = check_display = true, SET_PT (end + 1));
else if (last_pt == end && PT == beg && beg > BEGV)
(check_composition = check_display = true, SET_PT (beg - 1));
else if (PT == ((PT < last_pt) ? beg : end))
/* We've already moved as far as we can. Trying to go
to the other end would mean moving backwards and thus
could lead to an infinite loop. */
;
else if (val = Fget_pos_property (make_fixnum (PT),
Qinvisible, Qnil),
TEXT_PROP_MEANS_INVISIBLE (val)
&& (val = (Fget_pos_property
(make_fixnum (PT == beg ? end : beg),
Qinvisible, Qnil)),
!TEXT_PROP_MEANS_INVISIBLE (val)))
(check_composition = check_display = true,
SET_PT (PT == beg ? end : beg));
}
}
check_invisible = false;
}
}
/* Subroutine for safe_run_hooks: run the hook, which is ARGS[1]. */
static Lisp_Object
safe_run_hooks_1 (ptrdiff_t nargs, Lisp_Object *args)
{
eassert (nargs == 2);
return call0 (args[1]);
}
/* Subroutine for safe_run_hooks: handle an error by clearing out the function
from the hook. */
static Lisp_Object
safe_run_hooks_error (Lisp_Object error, ptrdiff_t nargs, Lisp_Object *args)
{
eassert (nargs == 2);
AUTO_STRING (format, "Error in %s (%S): %S");
Lisp_Object hook = args[0];
Lisp_Object fun = args[1];
CALLN (Fmessage, format, hook, fun, error);
if (SYMBOLP (hook))
{
bool found = false;
Lisp_Object newval = Qnil;
Lisp_Object val = find_symbol_value (hook);
FOR_EACH_TAIL (val)
if (EQ (fun, XCAR (val)))
found = true;
else
newval = Fcons (XCAR (val), newval);
if (found)
return Fset (hook, Fnreverse (newval));
/* Not found in the local part of the hook. Let's look at the global
part. */
newval = Qnil;
val = NILP (Fdefault_boundp (hook)) ? Qnil : Fdefault_value (hook);
FOR_EACH_TAIL (val)
if (EQ (fun, XCAR (val)))
found = true;
else
newval = Fcons (XCAR (val), newval);
if (found)
return Fset_default (hook, Fnreverse (newval));
}
return Qnil;
}
static Lisp_Object
safe_run_hook_funcall (ptrdiff_t nargs, Lisp_Object *args)
{
eassert (nargs == 2);
/* Yes, run_hook_with_args works with args in the other order. */
internal_condition_case_n (safe_run_hooks_1,
2, ((Lisp_Object []) {args[1], args[0]}),
Qt, safe_run_hooks_error);
return Qnil;
}
/* If we get an error while running the hook, cause the hook variable
to be nil. Also inhibit quits, so that C-g won't cause the hook
to mysteriously evaporate. */
void
safe_run_hooks (Lisp_Object hook)
{
ptrdiff_t count = SPECPDL_INDEX ();
specbind (Qinhibit_quit, Qt);
run_hook_with_args (2, ((Lisp_Object []) {hook, hook}), safe_run_hook_funcall);
unbind_to (count, Qnil);
}
/* Nonzero means polling for input is temporarily suppressed. */
int poll_suppress_count;
#ifdef POLL_FOR_INPUT
/* Asynchronous timer for polling. */
static struct atimer *poll_timer;
#if defined CYGWIN || defined DOS_NT
/* Poll for input, so that we catch a C-g if it comes in. */
void
poll_for_input_1 (void)
{
if (! input_blocked_p ()
&& !waiting_for_input)
gobble_input ();
}
#endif
/* Timer callback function for poll_timer. TIMER is equal to
poll_timer. */
static void
poll_for_input (struct atimer *timer)
{
if (poll_suppress_count == 0)
pending_signals = true;
}
#endif /* POLL_FOR_INPUT */
/* Begin signals to poll for input, if they are appropriate.
This function is called unconditionally from various places. */
void
start_polling (void)
{
#ifdef POLL_FOR_INPUT
/* XXX This condition was (read_socket_hook && !interrupt_input),
but read_socket_hook is not global anymore. Let's pretend that
it's always set. */
if (!interrupt_input)
{
/* Turn alarm handling on unconditionally. It might have
been turned off in process.c. */
turn_on_atimers (1);
/* If poll timer doesn't exist, or we need one with
a different interval, start a new one. */
if (poll_timer == NULL
|| poll_timer->interval.tv_sec != polling_period)
{
time_t period = max (1, min (polling_period, TYPE_MAXIMUM (time_t)));
struct timespec interval = make_timespec (period, 0);
if (poll_timer)
cancel_atimer (poll_timer);
poll_timer = start_atimer (ATIMER_CONTINUOUS, interval,
poll_for_input, NULL);
}
/* Let the timer's callback function poll for input
if this becomes zero. */
--poll_suppress_count;
}
#endif
}
#if defined CYGWIN || defined DOS_NT
/* True if we are using polling to handle input asynchronously. */
bool
input_polling_used (void)
{
# ifdef POLL_FOR_INPUT
/* XXX This condition was (read_socket_hook && !interrupt_input),
but read_socket_hook is not global anymore. Let's pretend that
it's always set. */
return !interrupt_input;
# else
return false;
# endif
}
#endif
/* Turn off polling. */
void
stop_polling (void)
{
#ifdef POLL_FOR_INPUT
/* XXX This condition was (read_socket_hook && !interrupt_input),
but read_socket_hook is not global anymore. Let's pretend that
it's always set. */
if (!interrupt_input)
++poll_suppress_count;
#endif
}
/* Set the value of poll_suppress_count to COUNT
and start or stop polling accordingly. */
void
set_poll_suppress_count (int count)
{
#ifdef POLL_FOR_INPUT
if (count == 0 && poll_suppress_count != 0)
{
poll_suppress_count = 1;
start_polling ();
}
else if (count != 0 && poll_suppress_count == 0)
{
stop_polling ();
}
poll_suppress_count = count;
#endif
}
/* Bind polling_period to a value at least N.
But don't decrease it. */
void
bind_polling_period (int n)
{
#ifdef POLL_FOR_INPUT
intmax_t new = polling_period;
if (n > new)
new = n;
stop_other_atimers (poll_timer);
stop_polling ();
specbind (Qpolling_period, make_int (new));
/* Start a new alarm with the new period. */
start_polling ();
#endif
}
/* Apply the control modifier to CHARACTER. */
int
make_ctrl_char (int c)
{
/* Save the upper bits here. */
int upper = c & ~0177;
if (! ASCII_CHAR_P (c))
return c |= ctrl_modifier;
c &= 0177;
/* Everything in the columns containing the upper-case letters
denotes a control character. */
if (c >= 0100 && c < 0140)
{
int oc = c;
c &= ~0140;
/* Set the shift modifier for a control char
made from a shifted letter. But only for letters! */
if (oc >= 'A' && oc <= 'Z')
c |= shift_modifier;
}
/* The lower-case letters denote control characters too. */
else if (c >= 'a' && c <= 'z')
c &= ~0140;
/* Include the bits for control and shift
only if the basic ASCII code can't indicate them. */
else if (c >= ' ')
c |= ctrl_modifier;
/* Replace the high bits. */
c |= (upper & ~ctrl_modifier);
return c;
}
/* Substitute key descriptions and quotes in HELP, unless its first
character has a non-nil help-echo-inhibit-substitution property. */
static Lisp_Object
help_echo_substitute_command_keys (Lisp_Object help)
{
if (STRINGP (help)
&& SCHARS (help) > 0
&& !NILP (Fget_text_property (make_fixnum (0),
Qhelp_echo_inhibit_substitution,
help)))
return help;
return call1 (Qsubstitute_command_keys, help);
}
/* Display the help-echo property of the character after the mouse pointer.
Either show it in the echo area, or call show-help-function to display
it by other means (maybe in a tooltip).
If HELP is nil, that means clear the previous help echo.
If HELP is a string, display that string. If HELP is a function,
call it with OBJECT and POS as arguments; the function should
return a help string or nil for none. For all other types of HELP,
evaluate it to obtain a string.
WINDOW is the window in which the help was generated, if any.
It is nil if not in a window.
If OBJECT is a buffer, POS is the position in the buffer where the
`help-echo' text property was found.
If OBJECT is an overlay, that overlay has a `help-echo' property,
and POS is the position in the overlay's buffer under the mouse.
If OBJECT is a string (an overlay string or a string displayed with
the `display' property). POS is the position in that string under
the mouse.
Note: this function may only be called with HELP nil or a string
from X code running asynchronously. */
void
show_help_echo (Lisp_Object help, Lisp_Object window, Lisp_Object object,
Lisp_Object pos)
{
if (!NILP (help) && !STRINGP (help))
{
if (FUNCTIONP (help))
help = safe_call (4, help, window, object, pos);
else
help = safe_eval (help);
if (!STRINGP (help))
return;
}
if (!noninteractive && STRINGP (help))
{
/* The mouse-fixup-help-message Lisp function can call
mouse_position_hook, which resets the mouse_moved flags.
This causes trouble if we are trying to read a mouse motion
event (i.e., if we are inside a `track-mouse' form), so we
restore the mouse_moved flag. */
struct frame *f = some_mouse_moved ();
help = call1 (Qmouse_fixup_help_message, help);
if (f)
f->mouse_moved = true;
}
if (STRINGP (help) || NILP (help))
{
if (!NILP (Vshow_help_function))
call1 (Vshow_help_function, help_echo_substitute_command_keys (help));
help_echo_showing_p = STRINGP (help);
}
}
/* Input of single characters from keyboard. */
static Lisp_Object kbd_buffer_get_event (KBOARD **kbp, bool *used_mouse_menu,
struct timespec *end_time);
static void record_char (Lisp_Object c);
static Lisp_Object help_form_saved_window_configs;
static void
read_char_help_form_unwind (void)
{
Lisp_Object window_config = XCAR (help_form_saved_window_configs);
help_form_saved_window_configs = XCDR (help_form_saved_window_configs);
if (!NILP (window_config))
Fset_window_configuration (window_config, Qnil, Qnil);
}
#define STOP_POLLING \
do { if (! polling_stopped_here) stop_polling (); \
polling_stopped_here = true; } while (0)
#define RESUME_POLLING \
do { if (polling_stopped_here) start_polling (); \
polling_stopped_here = false; } while (0)
static Lisp_Object
read_event_from_main_queue (struct timespec *end_time,
sys_jmp_buf local_getcjmp,
bool *used_mouse_menu)
{
Lisp_Object c = Qnil;
sys_jmp_buf save_jump;
KBOARD *kb;
start:
/* Read from the main queue, and if that gives us something we can't use yet,
we put it on the appropriate side queue and try again. */
if (end_time && timespec_cmp (*end_time, current_timespec ()) <= 0)
return c;
/* Actually read a character, waiting if necessary. */
ptrdiff_t count = SPECPDL_INDEX ();
save_getcjmp (save_jump);
record_unwind_protect_ptr (restore_getcjmp, save_jump);
restore_getcjmp (local_getcjmp);
if (!end_time)
timer_start_idle ();
c = kbd_buffer_get_event (&kb, used_mouse_menu, end_time);
unbind_to (count, Qnil);
if (! NILP (c) && (kb != current_kboard))
{
Lisp_Object last = KVAR (kb, kbd_queue);
if (CONSP (last))
{
while (CONSP (XCDR (last)))
last = XCDR (last);
if (!NILP (XCDR (last)))
emacs_abort ();
}
if (!CONSP (last))
kset_kbd_queue (kb, list1 (c));
else
XSETCDR (last, list1 (c));
kb->kbd_queue_has_data = true;
c = Qnil;
if (single_kboard)
goto start;
current_kboard = kb;
return make_fixnum (-2);
}
/* Terminate Emacs in batch mode if at eof. */
if (noninteractive && FIXNUMP (c) && XFIXNUM (c) < 0)
Fkill_emacs (make_fixnum (1));
if (FIXNUMP (c))
{
/* Add in any extra modifiers, where appropriate. */
if ((extra_keyboard_modifiers & CHAR_CTL)
|| ((extra_keyboard_modifiers & 0177) < ' '
&& (extra_keyboard_modifiers & 0177) != 0))
XSETINT (c, make_ctrl_char (XFIXNUM (c)));
/* Transfer any other modifier bits directly from
extra_keyboard_modifiers to c. Ignore the actual character code
in the low 16 bits of extra_keyboard_modifiers. */
XSETINT (c, XFIXNUM (c) | (extra_keyboard_modifiers & ~0xff7f & ~CHAR_CTL));
}
return c;
}
/* Like `read_event_from_main_queue' but applies keyboard-coding-system
to tty input. */
static Lisp_Object
read_decoded_event_from_main_queue (struct timespec *end_time,
sys_jmp_buf local_getcjmp,
Lisp_Object prev_event,
bool *used_mouse_menu)
{
#ifndef WINDOWSNT
#define MAX_ENCODED_BYTES 16
Lisp_Object events[MAX_ENCODED_BYTES];
int n = 0;
#endif
while (true)
{
Lisp_Object nextevt
= read_event_from_main_queue (end_time, local_getcjmp,
used_mouse_menu);
#ifdef WINDOWSNT
/* w32_console already returns decoded events. It either reads
Unicode characters from the Windows keyboard input, or
converts characters encoded in the current codepage into
Unicode. See w32inevt.c:key_event, near its end. */
return nextevt;
#else
struct frame *frame = XFRAME (selected_frame);
struct terminal *terminal = frame->terminal;
if (!((FRAME_TERMCAP_P (frame) || FRAME_MSDOS_P (frame))
/* Don't apply decoding if we're just reading a raw event
(e.g. reading bytes sent by the xterm to specify the position
of a mouse click). */
&& (!EQ (prev_event, Qt))
&& (TERMINAL_KEYBOARD_CODING (terminal)->common_flags
& CODING_REQUIRE_DECODING_MASK)))
return nextevt; /* No decoding needed. */
else
{
int meta_key = terminal->display_info.tty->meta_key;
eassert (n < MAX_ENCODED_BYTES);
events[n++] = nextevt;
if (FIXNATP (nextevt)
&& XFIXNUM (nextevt) < (meta_key == 1 ? 0x80 : 0x100))
{ /* An encoded byte sequence, let's try to decode it. */
struct coding_system *coding
= TERMINAL_KEYBOARD_CODING (terminal);
if (raw_text_coding_system_p (coding))
{
int i;
if (meta_key != 2)
{
for (i = 0; i < n; i++)
{
int c = XFIXNUM (events[i]);
int modifier =
(meta_key == 3 && c < 0x100 && (c & 0x80))
? meta_modifier
: 0;
events[i] = make_fixnum ((c & ~0x80) | modifier);
}
}
}
else
{
unsigned char src[MAX_ENCODED_BYTES];
unsigned char dest[MAX_ENCODED_BYTES * MAX_MULTIBYTE_LENGTH];
int i;
for (i = 0; i < n; i++)
src[i] = XFIXNUM (events[i]);
if (meta_key < 2) /* input-meta-mode is t or nil */
for (i = 0; i < n; i++)
src[i] &= ~0x80;
coding->destination = dest;
coding->dst_bytes = sizeof dest;
decode_coding_c_string (coding, src, n, Qnil);
eassert (coding->produced_char <= n);
if (coding->produced_char == 0)
{ /* The encoded sequence is incomplete. */
if (n < MAX_ENCODED_BYTES) /* Avoid buffer overflow. */
continue; /* Read on! */
}
else
{
const unsigned char *p = coding->destination;
eassert (coding->carryover_bytes == 0);
n = 0;
while (n < coding->produced_char)
{
int c = string_char_advance (&p);
if (meta_key == 3)
{
int modifier
= (c < 0x100 && (c & 0x80)
? meta_modifier
: 0);
c = (c & ~0x80) | modifier;
}
events[n++] = make_fixnum (c);
}
}
}
}
/* Now `events' should hold decoded events.
Normally, n should be equal to 1, but better not rely on it.
We can only return one event here, so return the first we
had and keep the others (if any) for later. */
while (n > 1)
Vunread_command_events
= Fcons (events[--n], Vunread_command_events);
return events[0];
}
#endif
}
}
/* Read a character from the keyboard; call the redisplay if needed. */
/* commandflag 0 means do not autosave, but do redisplay.
-1 means do not redisplay, but do autosave.
-2 means do neither.
1 means do both.
The argument MAP is a keymap for menu prompting.
PREV_EVENT is the previous input event, or nil if we are reading
the first event of a key sequence (or not reading a key sequence).
If PREV_EVENT is t, that is a "magic" value that says
not to run input methods, but in other respects to act as if
not reading a key sequence.
If USED_MOUSE_MENU is non-null, then set *USED_MOUSE_MENU to true
if we used a mouse menu to read the input, or false otherwise. If
USED_MOUSE_MENU is null, don't dereference it.
Value is -2 when we find input on another keyboard. A second call
to read_char will read it.
If END_TIME is non-null, it is a pointer to a struct timespec
specifying the maximum time to wait until. If no input arrives by
that time, stop waiting and return nil.
Value is t if we showed a menu and the user rejected it. */
Lisp_Object
read_char (int commandflag, Lisp_Object map,
Lisp_Object prev_event,
bool *used_mouse_menu, struct timespec *end_time)
{
Lisp_Object c;
ptrdiff_t jmpcount;
sys_jmp_buf local_getcjmp;
sys_jmp_buf save_jump;
Lisp_Object tem, save;
volatile Lisp_Object previous_echo_area_message;
volatile Lisp_Object also_record;
volatile bool reread, recorded;
bool volatile polling_stopped_here = false;
struct kboard *orig_kboard = current_kboard;
also_record = Qnil;
c = Qnil;
previous_echo_area_message = Qnil;
retry:
recorded = false;
if (CONSP (Vunread_post_input_method_events))
{
c = XCAR (Vunread_post_input_method_events);
Vunread_post_input_method_events
= XCDR (Vunread_post_input_method_events);
/* Undo what read_char_x_menu_prompt did when it unread
additional keys returned by Fx_popup_menu. */
if (CONSP (c)
&& (SYMBOLP (XCAR (c)) || FIXNUMP (XCAR (c)))
&& NILP (XCDR (c)))
c = XCAR (c);
reread = true;
goto reread_first;
}
else
reread = false;
if (CONSP (Vunread_command_events))
{
bool was_disabled = false;
c = XCAR (Vunread_command_events);
Vunread_command_events = XCDR (Vunread_command_events);
/* Undo what sit-for did when it unread additional keys
inside universal-argument. */
if (CONSP (c) && EQ (XCAR (c), Qt))
c = XCDR (c);
else
{
if (CONSP (c) && EQ (XCAR (c), Qno_record))
{
c = XCDR (c);
recorded = true;
}
reread = true;
}
/* Undo what read_char_x_menu_prompt did when it unread
additional keys returned by Fx_popup_menu. */
if (CONSP (c)
&& EQ (XCDR (c), Qdisabled)
&& (SYMBOLP (XCAR (c)) || FIXNUMP (XCAR (c))))
{
was_disabled = true;
c = XCAR (c);
}
/* If the queued event is something that used the mouse,
set used_mouse_menu accordingly. */
if (used_mouse_menu
/* Also check was_disabled so last-nonmenu-event won't return
a bad value when submenus are involved. (Bug#447) */
&& (EQ (c, Qtool_bar) || EQ (c, Qtab_bar) || EQ (c, Qmenu_bar)
|| was_disabled))
*used_mouse_menu = true;
goto reread_for_input_method;
}
if (CONSP (Vunread_input_method_events))
{
c = XCAR (Vunread_input_method_events);
Vunread_input_method_events = XCDR (Vunread_input_method_events);
/* Undo what read_char_x_menu_prompt did when it unread
additional keys returned by Fx_popup_menu. */
if (CONSP (c)
&& (SYMBOLP (XCAR (c)) || FIXNUMP (XCAR (c)))
&& NILP (XCDR (c)))
c = XCAR (c);
reread = true;
goto reread_for_input_method;
}
if (!NILP (Vexecuting_kbd_macro))
{
/* We set this to Qmacro; since that's not a frame, nobody will
try to switch frames on us, and the selected window will
remain unchanged.
Since this event came from a macro, it would be misleading to
leave internal_last_event_frame set to wherever the last
real event came from. Normally, a switch-frame event selects
internal_last_event_frame after each command is read, but
events read from a macro should never cause a new frame to be
selected. */
Vlast_event_frame = internal_last_event_frame = Qmacro;
/* Exit the macro if we are at the end.
Also, some things replace the macro with t
to force an early exit. */
if (EQ (Vexecuting_kbd_macro, Qt)
|| executing_kbd_macro_index >= XFIXNAT (Flength (Vexecuting_kbd_macro)))
{
XSETINT (c, -1);
goto exit;
}
c = Faref (Vexecuting_kbd_macro, make_int (executing_kbd_macro_index));
if (STRINGP (Vexecuting_kbd_macro)
&& (XFIXNAT (c) & 0x80) && (XFIXNAT (c) <= 0xff))
XSETFASTINT (c, CHAR_META | (XFIXNAT (c) & ~0x80));
executing_kbd_macro_index++;
goto from_macro;
}
if (!NILP (unread_switch_frame))
{
c = unread_switch_frame;
unread_switch_frame = Qnil;
/* This event should make it into this_command_keys, and get echoed
again, so we do not set `reread'. */
goto reread_first;
}
/* If redisplay was requested. */
if (commandflag >= 0)
{
bool echo_current = EQ (echo_message_buffer, echo_area_buffer[0]);
/* If there is pending input, process any events which are not
user-visible, such as X selection_request events. */
if (input_pending
|| detect_input_pending_run_timers (0))
swallow_events (false); /* May clear input_pending. */
/* Redisplay if no pending input. */
while (!(input_pending
&& (input_was_pending || !redisplay_dont_pause)))
{
input_was_pending = input_pending;
if (help_echo_showing_p && !EQ (selected_window, minibuf_window))
redisplay_preserve_echo_area (5);
else
redisplay ();
if (!input_pending)
/* Normal case: no input arrived during redisplay. */
break;
/* Input arrived and pre-empted redisplay.
Process any events which are not user-visible. */
swallow_events (false);
/* If that cleared input_pending, try again to redisplay. */
}
/* Prevent the redisplay we just did
from messing up echoing of the input after the prompt. */
if (commandflag == 0 && echo_current)
echo_message_buffer = echo_area_buffer[0];
}
/* Message turns off echoing unless more keystrokes turn it on again.
The code in 20.x for the condition was
1. echo_area_glyphs && *echo_area_glyphs
2. && echo_area_glyphs != current_kboard->echobuf
3. && ok_to_echo_at_next_pause != echo_area_glyphs
(1) means there's a current message displayed
(2) means it's not the message from echoing from the current
kboard.
(3) There's only one place in 20.x where ok_to_echo_at_next_pause
is set to a non-null value. This is done in read_char and it is
set to echo_area_glyphs. That means
ok_to_echo_at_next_pause is either null or
current_kboard->echobuf with the appropriate current_kboard at
that time.
So, condition (3) means in clear text ok_to_echo_at_next_pause
must be either null, or the current message isn't from echoing at
all, or it's from echoing from a different kboard than the
current one. */
if (/* There currently is something in the echo area. */
!NILP (echo_area_buffer[0])
&& (/* It's an echo from a different kboard. */
echo_kboard != current_kboard
/* Or we explicitly allow overwriting whatever there is. */
|| ok_to_echo_at_next_pause == NULL))
cancel_echoing ();
else
echo_dash ();
/* Try reading a character via menu prompting in the minibuf.
Try this before the sit-for, because the sit-for
would do the wrong thing if we are supposed to do
menu prompting. If EVENT_HAS_PARAMETERS then we are reading
after a mouse event so don't try a minibuf menu. */
c = Qnil;
if (KEYMAPP (map) && INTERACTIVE
&& !NILP (prev_event) && ! EVENT_HAS_PARAMETERS (prev_event)
/* Don't bring up a menu if we already have another event. */
&& !CONSP (Vunread_command_events)
&& !detect_input_pending_run_timers (0))
{
c = read_char_minibuf_menu_prompt (commandflag, map);
if (FIXNUMP (c) && XFIXNUM (c) == -2)
return c; /* wrong_kboard_jmpbuf */
if (! NILP (c))
goto exit;
}
/* Make a longjmp point for quits to use, but don't alter getcjmp just yet.
We will do that below, temporarily for short sections of code,
when appropriate. local_getcjmp must be in effect
around any call to sit_for or kbd_buffer_get_event;
it *must not* be in effect when we call redisplay. */
jmpcount = SPECPDL_INDEX ();
if (sys_setjmp (local_getcjmp))
{
/* Handle quits while reading the keyboard. */
/* We must have saved the outer value of getcjmp here,
so restore it now. */
restore_getcjmp (save_jump);
pthread_sigmask (SIG_SETMASK, &empty_mask, 0);
unbind_to (jmpcount, Qnil);
/* If we are in while-no-input, don't trigger C-g, as that will
quit instead of letting while-no-input do its thing. */
if (!EQ (Vquit_flag, Vthrow_on_input))
XSETINT (c, quit_char);
internal_last_event_frame = selected_frame;
Vlast_event_frame = internal_last_event_frame;
/* If we report the quit char as an event,
don't do so more than once. */
if (!NILP (Vinhibit_quit))
Vquit_flag = Qnil;
{
KBOARD *kb = FRAME_KBOARD (XFRAME (selected_frame));
if (kb != current_kboard)
{
Lisp_Object last = KVAR (kb, kbd_queue);
/* We shouldn't get here if we were in single-kboard mode! */
if (single_kboard)
emacs_abort ();
if (CONSP (last))
{
while (CONSP (XCDR (last)))
last = XCDR (last);
if (!NILP (XCDR (last)))
emacs_abort ();
}
if (!CONSP (last))
kset_kbd_queue (kb, list1 (c));
else
XSETCDR (last, list1 (c));
kb->kbd_queue_has_data = true;
current_kboard = kb;
return make_fixnum (-2); /* wrong_kboard_jmpbuf */
}
}
goto non_reread;
}
/* Start idle timers if no time limit is supplied. We don't do it
if a time limit is supplied to avoid an infinite recursion in the
situation where an idle timer calls `sit-for'. */
if (!end_time)
timer_start_idle ();
/* If in middle of key sequence and minibuffer not active,
start echoing if enough time elapses. */
if (minibuf_level == 0
&& !end_time
&& !current_kboard->immediate_echo
&& (this_command_key_count > 0
|| !NILP (call0 (Qinternal_echo_keystrokes_prefix)))
&& ! noninteractive
&& echo_keystrokes_p ()
&& (/* No message. */
NILP (echo_area_buffer[0])
/* Or empty message. */
|| (BUF_BEG (XBUFFER (echo_area_buffer[0]))
== BUF_Z (XBUFFER (echo_area_buffer[0])))
/* Or already echoing from same kboard. */
|| (echo_kboard && ok_to_echo_at_next_pause == echo_kboard)
/* Or not echoing before and echoing allowed. */
|| (!echo_kboard && ok_to_echo_at_next_pause)))
{
/* After a mouse event, start echoing right away.
This is because we are probably about to display a menu,
and we don't want to delay before doing so. */
if (EVENT_HAS_PARAMETERS (prev_event))
echo_now ();
else
{
Lisp_Object tem0;
ptrdiff_t count = SPECPDL_INDEX ();
save_getcjmp (save_jump);
record_unwind_protect_ptr (restore_getcjmp, save_jump);
restore_getcjmp (local_getcjmp);
tem0 = sit_for (Vecho_keystrokes, 1, 1);
unbind_to (count, Qnil);
if (EQ (tem0, Qt)
&& ! CONSP (Vunread_command_events))
echo_now ();
}
}
/* Maybe auto save due to number of keystrokes. */
if (commandflag != 0 && commandflag != -2
&& auto_save_interval > 0
&& num_nonmacro_input_events - last_auto_save > max (auto_save_interval, 20)
&& !detect_input_pending_run_timers (0))
{
Fdo_auto_save (auto_save_no_message ? Qt : Qnil, Qnil);
/* Hooks can actually change some buffers in auto save. */
redisplay ();
}
/* Try reading using an X menu.
This is never confused with reading using the minibuf
because the recursive call of read_char in read_char_minibuf_menu_prompt
does not pass on any keymaps. */
if (KEYMAPP (map) && INTERACTIVE
&& !NILP (prev_event)
&& EVENT_HAS_PARAMETERS (prev_event)
&& !EQ (XCAR (prev_event), Qmenu_bar)
&& !EQ (XCAR (prev_event), Qtab_bar)
&& !EQ (XCAR (prev_event), Qtool_bar)
/* Don't bring up a menu if we already have another event. */
&& !CONSP (Vunread_command_events))
{
c = read_char_x_menu_prompt (map, prev_event, used_mouse_menu);
/* Now that we have read an event, Emacs is not idle. */
if (!end_time)
timer_stop_idle ();
goto exit;
}
/* Maybe autosave and/or garbage collect due to idleness. */
if (INTERACTIVE && NILP (c))
{
int delay_level;
ptrdiff_t buffer_size;
/* Slow down auto saves logarithmically in size of current buffer,
and garbage collect while we're at it. */
if (! MINI_WINDOW_P (XWINDOW (selected_window)))
last_non_minibuf_size = Z - BEG;
buffer_size = (last_non_minibuf_size >> 8) + 1;
delay_level = 0;
while (buffer_size > 64)
delay_level++, buffer_size -= buffer_size >> 2;
if (delay_level < 4) delay_level = 4;
/* delay_level is 4 for files under around 50k, 7 at 100k,
9 at 200k, 11 at 300k, and 12 at 500k. It is 15 at 1 meg. */
/* Auto save if enough time goes by without input. */
if (commandflag != 0 && commandflag != -2
&& num_nonmacro_input_events > last_auto_save
&& FIXNUMP (Vauto_save_timeout)
&& XFIXNUM (Vauto_save_timeout) > 0)
{
Lisp_Object tem0;
EMACS_INT timeout = XFIXNAT (Vauto_save_timeout);
timeout = min (timeout, MOST_POSITIVE_FIXNUM / delay_level * 4);
timeout = delay_level * timeout / 4;
ptrdiff_t count1 = SPECPDL_INDEX ();
save_getcjmp (save_jump);
record_unwind_protect_ptr (restore_getcjmp, save_jump);
restore_getcjmp (local_getcjmp);
tem0 = sit_for (make_fixnum (timeout), 1, 1);
unbind_to (count1, Qnil);
if (EQ (tem0, Qt)
&& ! CONSP (Vunread_command_events))
{
Fdo_auto_save (auto_save_no_message ? Qt : Qnil, Qnil);
redisplay ();
}
}
/* If there is still no input available, ask for GC. */
if (!detect_input_pending_run_timers (0))
maybe_gc ();
}
/* Notify the caller if an autosave hook, or a timer, sentinel or
filter in the sit_for calls above have changed the current
kboard. This could happen if they use the minibuffer or start a
recursive edit, like the fancy splash screen in server.el's
filter. If this longjmp wasn't here, read_key_sequence would
interpret the next key sequence using the wrong translation
tables and function keymaps. */
if (NILP (c) && current_kboard != orig_kboard)
return make_fixnum (-2); /* wrong_kboard_jmpbuf */
/* If this has become non-nil here, it has been set by a timer
or sentinel or filter. */
if (CONSP (Vunread_command_events))
{
c = XCAR (Vunread_command_events);
Vunread_command_events = XCDR (Vunread_command_events);
if (CONSP (c) && EQ (XCAR (c), Qt))
c = XCDR (c);
else
{
if (CONSP (c) && EQ (XCAR (c), Qno_record))
{
c = XCDR (c);
recorded = true;
}
reread = true;
}
}
/* Read something from current KBOARD's side queue, if possible. */
if (NILP (c))
{
if (current_kboard->kbd_queue_has_data)
{
if (!CONSP (KVAR (current_kboard, kbd_queue)))
emacs_abort ();
c = XCAR (KVAR (current_kboard, kbd_queue));
kset_kbd_queue (current_kboard,
XCDR (KVAR (current_kboard, kbd_queue)));
if (NILP (KVAR (current_kboard, kbd_queue)))
current_kboard->kbd_queue_has_data = false;
input_pending = readable_events (0);
if (EVENT_HAS_PARAMETERS (c)
&& EQ (EVENT_HEAD_KIND (EVENT_HEAD (c)), Qswitch_frame))
internal_last_event_frame = XCAR (XCDR (c));
Vlast_event_frame = internal_last_event_frame;
}
}
/* If current_kboard's side queue is empty check the other kboards.
If one of them has data that we have not yet seen here,
switch to it and process the data waiting for it.
Note: if the events queued up for another kboard
have already been seen here, and therefore are not a complete command,
the kbd_queue_has_data field is 0, so we skip that kboard here.
That's to avoid an infinite loop switching between kboards here. */
if (NILP (c) && !single_kboard)
{
KBOARD *kb;
for (kb = all_kboards; kb; kb = kb->next_kboard)
if (kb->kbd_queue_has_data)
{
current_kboard = kb;
return make_fixnum (-2); /* wrong_kboard_jmpbuf */
}
}
wrong_kboard:
STOP_POLLING;
if (NILP (c))
{
c = read_decoded_event_from_main_queue (end_time, local_getcjmp,
prev_event, used_mouse_menu);
if (NILP (c) && end_time
&& timespec_cmp (*end_time, current_timespec ()) <= 0)
{
goto exit;
}
if (EQ (c, make_fixnum (-2)))
return c;
if (CONSP (c) && EQ (XCAR (c), Qt))
c = XCDR (c);
else if (CONSP (c) && EQ (XCAR (c), Qno_record))
{
c = XCDR (c);
recorded = true;
}
}
non_reread:
if (!end_time)
timer_stop_idle ();
RESUME_POLLING;
if (NILP (c))
{
if (commandflag >= 0
&& !input_pending && !detect_input_pending_run_timers (0))
redisplay ();
goto wrong_kboard;
}
/* Buffer switch events are only for internal wakeups
so don't show them to the user.
Also, don't record a key if we already did. */
if (BUFFERP (c))
goto exit;
/* Process special events within read_char
and loop around to read another event. */
save = Vquit_flag;
Vquit_flag = Qnil;
tem = access_keymap (get_keymap (Vspecial_event_map, 0, 1), c, 0, 0, 1);
Vquit_flag = save;
if (!NILP (tem))
{
struct buffer *prev_buffer = current_buffer;
last_input_event = c;
call4 (Qcommand_execute, tem, Qnil, Fvector (1, &last_input_event), Qt);
if (CONSP (c)
&& (EQ (XCAR (c), Qselect_window)
|| EQ (XCAR (c), Qfocus_out)
#ifdef HAVE_DBUS
|| EQ (XCAR (c), Qdbus_event)
#endif
#ifdef USE_FILE_NOTIFY
|| EQ (XCAR (c), Qfile_notify)
#endif
#ifdef THREADS_ENABLED
|| EQ (XCAR (c), Qthread_event)
#endif
|| EQ (XCAR (c), Qconfig_changed_event))
&& !end_time)
/* We stopped being idle for this event; undo that. This
prevents automatic window selection (under
mouse-autoselect-window) from acting as a real input event, for
example banishing the mouse under mouse-avoidance-mode. */
timer_resume_idle ();
#ifdef HAVE_NS
if (CONSP (c)
&& (EQ (XCAR (c), intern ("ns-unput-working-text"))))
input_was_pending = input_pending;
#endif
if (current_buffer != prev_buffer)
{
/* The command may have changed the keymaps. Pretend there
is input in another keyboard and return. This will
recalculate keymaps. */
c = make_fixnum (-2);
goto exit;
}
else
goto retry;
}
/* Handle things that only apply to characters. */
if (FIXNUMP (c))
{
/* If kbd_buffer_get_event gave us an EOF, return that. */
if (XFIXNUM (c) == -1)
goto exit;
if ((STRINGP (KVAR (current_kboard, Vkeyboard_translate_table))
&& XFIXNAT (c) < SCHARS (KVAR (current_kboard,
Vkeyboard_translate_table)))
|| (VECTORP (KVAR (current_kboard, Vkeyboard_translate_table))
&& XFIXNAT (c) < ASIZE (KVAR (current_kboard,
Vkeyboard_translate_table)))
|| (CHAR_TABLE_P (KVAR (current_kboard, Vkeyboard_translate_table))
&& CHARACTERP (c)))
{
Lisp_Object d;
d = Faref (KVAR (current_kboard, Vkeyboard_translate_table), c);
/* nil in keyboard-translate-table means no translation. */
if (!NILP (d))
c = d;
}
}
/* If this event is a mouse click in the menu bar,
return just menu-bar for now. Modify the mouse click event
so we won't do this twice, then queue it up. */
if (EVENT_HAS_PARAMETERS (c)
&& CONSP (XCDR (c))
&& CONSP (xevent_start (c))
&& CONSP (XCDR (xevent_start (c))))
{
Lisp_Object posn;
posn = POSN_POSN (xevent_start (c));
/* Handle menu-bar events:
insert the dummy prefix event `menu-bar'. */
if (EQ (posn, Qmenu_bar) || EQ (posn, Qtab_bar) || EQ (posn, Qtool_bar))
{
/* Change menu-bar to (menu-bar) as the event "position". */
POSN_SET_POSN (xevent_start (c), list1 (posn));
also_record = c;
Vunread_command_events = Fcons (c, Vunread_command_events);
c = posn;
}
}
/* Store these characters into recent_keys, the dribble file if any,
and the keyboard macro being defined, if any. */
record_char (c);
recorded = true;
if (! NILP (also_record))
record_char (also_record);
/* Wipe the echo area.
But first, if we are about to use an input method,
save the echo area contents for it to refer to. */
if (FIXNUMP (c)
&& ! NILP (Vinput_method_function)
&& ' ' <= XFIXNUM (c) && XFIXNUM (c) < 256 && XFIXNUM (c) != 127)
{
previous_echo_area_message = Fcurrent_message ();
Vinput_method_previous_message = previous_echo_area_message;
}
/* Now wipe the echo area, except for help events which do their
own stuff with the echo area. */
if (!CONSP (c)
|| (!(EQ (Qhelp_echo, XCAR (c)))
&& !(EQ (Qswitch_frame, XCAR (c)))
/* Don't wipe echo area for select window events: These might
get delayed via `mouse-autoselect-window' (Bug#11304). */
&& !(EQ (Qselect_window, XCAR (c)))))
{
if (!NILP (echo_area_buffer[0]))
{
safe_run_hooks (Qecho_area_clear_hook);
clear_message (1, 0);
/* If we were showing the echo-area message on top of an
active minibuffer, resize the mini-window, since the
minibuffer may need more or less space than the echo area
we've just wiped. */
if (minibuf_level
&& EQ (minibuf_window, echo_area_window)
/* The case where minibuffer-message-timeout is a number
was already handled near the beginning of command_loop_1. */
&& !NUMBERP (Vminibuffer_message_timeout))
resize_mini_window (XWINDOW (minibuf_window), false);
}
else if (FUNCTIONP (Vclear_message_function))
clear_message (1, 0);
}
reread_for_input_method:
from_macro:
/* Pass this to the input method, if appropriate. */
if (FIXNUMP (c)
&& ! NILP (Vinput_method_function)
/* Don't run the input method within a key sequence,
after the first event of the key sequence. */
&& NILP (prev_event)
&& ' ' <= XFIXNUM (c) && XFIXNUM (c) < 256 && XFIXNUM (c) != 127)
{
Lisp_Object keys;
ptrdiff_t key_count;
ptrdiff_t command_key_start;
ptrdiff_t count = SPECPDL_INDEX ();
/* Save the echo status. */
bool saved_immediate_echo = current_kboard->immediate_echo;
struct kboard *saved_ok_to_echo = ok_to_echo_at_next_pause;
Lisp_Object saved_echo_string = KVAR (current_kboard, echo_string);
Lisp_Object saved_echo_prompt = KVAR (current_kboard, echo_prompt);
/* Save the this_command_keys status. */
key_count = this_command_key_count;
command_key_start = this_single_command_key_start;
if (key_count > 0)
keys = Fcopy_sequence (this_command_keys);
else
keys = Qnil;
/* Clear out this_command_keys. */
this_command_key_count = 0;
this_single_command_key_start = 0;
/* Now wipe the echo area. */
if (!NILP (echo_area_buffer[0]))
safe_run_hooks (Qecho_area_clear_hook);
clear_message (1, 0);
echo_truncate (0);
/* If we are not reading a key sequence,
never use the echo area. */
if (!KEYMAPP (map))
{
specbind (Qinput_method_use_echo_area, Qt);
}
/* Call the input method. */
tem = call1 (Vinput_method_function, c);
tem = unbind_to (count, tem);
/* Restore the saved echoing state
and this_command_keys state. */
this_command_key_count = key_count;
this_single_command_key_start = command_key_start;
if (key_count > 0)
this_command_keys = keys;
cancel_echoing ();
ok_to_echo_at_next_pause = saved_ok_to_echo;
kset_echo_string (current_kboard, saved_echo_string);
kset_echo_prompt (current_kboard, saved_echo_prompt);
if (saved_immediate_echo)
echo_now ();
/* The input method can return no events. */
if (! CONSP (tem))
{
/* Bring back the previous message, if any. */
if (! NILP (previous_echo_area_message))
message_with_string ("%s", previous_echo_area_message, 0);
goto retry;
}
/* It returned one event or more. */
c = XCAR (tem);
Vunread_post_input_method_events
= nconc2 (XCDR (tem), Vunread_post_input_method_events);
}
/* When we consume events from the various unread-*-events lists, we
bypass the code that records input, so record these events now if
they were not recorded already. */
if (!recorded)
{
record_char (c);
recorded = true;
}
reread_first:
/* Display help if not echoing. */
if (CONSP (c) && EQ (XCAR (c), Qhelp_echo))
{
/* (help-echo FRAME HELP WINDOW OBJECT POS). */
Lisp_Object help, object, position, window, htem;
htem = Fcdr (XCDR (c));
help = Fcar (htem);
htem = Fcdr (htem);
window = Fcar (htem);
htem = Fcdr (htem);
object = Fcar (htem);
htem = Fcdr (htem);
position = Fcar (htem);
show_help_echo (help, window, object, position);
/* We stopped being idle for this event; undo that. */
if (!end_time)
timer_resume_idle ();
goto retry;
}
if ((! reread || this_command_key_count == 0)
&& !end_time)
{
/* Don't echo mouse motion events. */
if (! (EVENT_HAS_PARAMETERS (c)
&& EQ (EVENT_HEAD_KIND (EVENT_HEAD (c)), Qmouse_movement)))
/* Once we reread a character, echoing can happen
the next time we pause to read a new one. */
ok_to_echo_at_next_pause = current_kboard;
/* Record this character as part of the current key. */
add_command_key (c);
if (! NILP (also_record))
add_command_key (also_record);
echo_update ();
}
last_input_event = c;
num_input_events++;
/* Process the help character specially if enabled. */
if (!NILP (Vhelp_form) && help_char_p (c))
{
ptrdiff_t count = SPECPDL_INDEX ();
help_form_saved_window_configs
= Fcons (Fcurrent_window_configuration (Qnil),
help_form_saved_window_configs);
record_unwind_protect_void (read_char_help_form_unwind);
call0 (Qhelp_form_show);
cancel_echoing ();
do
{
c = read_char (0, Qnil, Qnil, 0, NULL);
if (EVENT_HAS_PARAMETERS (c)
&& EQ (EVENT_HEAD_KIND (EVENT_HEAD (c)), Qmouse_click))
XSETCAR (help_form_saved_window_configs, Qnil);
}
while (BUFFERP (c));
/* Remove the help from the frame. */
unbind_to (count, Qnil);
redisplay ();
if (EQ (c, make_fixnum (040)))
{
cancel_echoing ();
do
c = read_char (0, Qnil, Qnil, 0, NULL);
while (BUFFERP (c));
}
}
exit:
RESUME_POLLING;
input_was_pending = input_pending;
return c;
}
/* Record a key that came from a mouse menu.
Record it for echoing, for this-command-keys, and so on. */
static void
record_menu_key (Lisp_Object c)
{
/* Wipe the echo area. */
clear_message (1, 0);
record_char (c);
/* Once we reread a character, echoing can happen
the next time we pause to read a new one. */
ok_to_echo_at_next_pause = NULL;
/* Record this character as part of the current key. */
add_command_key (c);
echo_update ();
/* Re-reading in the middle of a command. */
last_input_event = c;
num_input_events++;
}
/* Return true if should recognize C as "the help character". */
static bool
help_char_p (Lisp_Object c)
{
if (EQ (c, Vhelp_char))
return true;
Lisp_Object tail = Vhelp_event_list;
FOR_EACH_TAIL_SAFE (tail)
if (EQ (c, XCAR (tail)))
return true;
return false;
}
/* Record the input event C in various ways. */
static void
record_char (Lisp_Object c)
{
int recorded = 0;
if (CONSP (c) && (EQ (XCAR (c), Qhelp_echo) || EQ (XCAR (c), Qmouse_movement)))
{
/* To avoid filling recent_keys with help-echo and mouse-movement
events, we filter out repeated help-echo events, only store the
first and last in a series of mouse-movement events, and don't
store repeated help-echo events which are only separated by
mouse-movement events. */
Lisp_Object ev1, ev2, ev3;
int ix1, ix2, ix3;
if ((ix1 = recent_keys_index - 1) < 0)
ix1 = lossage_limit - 1;
ev1 = AREF (recent_keys, ix1);
if ((ix2 = ix1 - 1) < 0)
ix2 = lossage_limit - 1;
ev2 = AREF (recent_keys, ix2);
if ((ix3 = ix2 - 1) < 0)
ix3 = lossage_limit - 1;
ev3 = AREF (recent_keys, ix3);
if (EQ (XCAR (c), Qhelp_echo))
{
/* Don't record `help-echo' in recent_keys unless it shows some help
message, and a different help than the previously recorded
event. */
Lisp_Object help, last_help;
help = Fcar_safe (Fcdr_safe (XCDR (c)));
if (!STRINGP (help))
recorded = 1;
else if (CONSP (ev1) && EQ (XCAR (ev1), Qhelp_echo)
&& (last_help = Fcar_safe (Fcdr_safe (XCDR (ev1))), EQ (last_help, help)))
recorded = 1;
else if (CONSP (ev1) && EQ (XCAR (ev1), Qmouse_movement)
&& CONSP (ev2) && EQ (XCAR (ev2), Qhelp_echo)
&& (last_help = Fcar_safe (Fcdr_safe (XCDR (ev2))), EQ (last_help, help)))
recorded = -1;
else if (CONSP (ev1) && EQ (XCAR (ev1), Qmouse_movement)
&& CONSP (ev2) && EQ (XCAR (ev2), Qmouse_movement)
&& CONSP (ev3) && EQ (XCAR (ev3), Qhelp_echo)
&& (last_help = Fcar_safe (Fcdr_safe (XCDR (ev3))), EQ (last_help, help)))
recorded = -2;
}
else if (EQ (XCAR (c), Qmouse_movement))
{
/* Only record one pair of `mouse-movement' on a window in recent_keys.
So additional mouse movement events replace the last element. */
Lisp_Object last_window, window;
window = Fcar_safe (Fcar_safe (XCDR (c)));
if (CONSP (ev1) && EQ (XCAR (ev1), Qmouse_movement)
&& (last_window = Fcar_safe (Fcar_safe (XCDR (ev1))), EQ (last_window, window))
&& CONSP (ev2) && EQ (XCAR (ev2), Qmouse_movement)
&& (last_window = Fcar_safe (Fcar_safe (XCDR (ev2))), EQ (last_window, window)))
{
ASET (recent_keys, ix1, c);
recorded = 1;
}
}
}
else if (NILP (Vexecuting_kbd_macro))
store_kbd_macro_char (c);
/* recent_keys should not include events from keyboard macros. */
if (NILP (Vexecuting_kbd_macro))
{
if (!recorded)
{
total_keys += total_keys < lossage_limit;
ASET (recent_keys, recent_keys_index,
/* Copy the event, in case it gets modified by side-effect
by some remapping function (bug#30955). */
CONSP (c) ? Fcopy_sequence (c) : c);
if (++recent_keys_index >= lossage_limit)
recent_keys_index = 0;
}
else if (recorded < 0)
{
/* We need to remove one or two events from recent_keys.
To do this, we simply put nil at those events and move the
recent_keys_index backwards over those events. Usually,
users will never see those nil events, as they will be
overwritten by the command keys entered to see recent_keys
(e.g. C-h l). */
while (recorded++ < 0 && total_keys > 0)
{
if (total_keys < lossage_limit)
total_keys--;
if (--recent_keys_index < 0)
recent_keys_index = lossage_limit - 1;
ASET (recent_keys, recent_keys_index, Qnil);
}
}
num_nonmacro_input_events++;
}
/* Write c to the dribble file. If c is a lispy event, write
the event's symbol to the dribble file, in <brackets>. Bleaugh.
If you, dear reader, have a better idea, you've got the source. :-) */
if (dribble && NILP (Vexecuting_kbd_macro))
{
block_input ();
if (FIXNUMP (c))
{
if (XUFIXNUM (c) < 0x100)
putc (XUFIXNUM (c), dribble);
else
fprintf (dribble, " 0x%"pI"x", XUFIXNUM (c));
}
else
{
Lisp_Object dribblee;
/* If it's a structured event, take the event header. */
dribblee = EVENT_HEAD (c);
if (SYMBOLP (dribblee))
{
putc ('<', dribble);
fwrite (SDATA (SYMBOL_NAME (dribblee)), sizeof (char),
SBYTES (SYMBOL_NAME (dribblee)), dribble);
putc ('>', dribble);
}
}
fflush (dribble);
unblock_input ();
}
}
/* Copy out or in the info on where C-g should throw to.
This is used when running Lisp code from within get_char,
in case get_char is called recursively.
See read_process_output. */
static void
save_getcjmp (sys_jmp_buf temp)
{
memcpy (temp, getcjmp, sizeof getcjmp);
}
static void
restore_getcjmp (void *temp)
{
memcpy (getcjmp, temp, sizeof getcjmp);
}
/* Low level keyboard/mouse input.
kbd_buffer_store_event places events in kbd_buffer, and
kbd_buffer_get_event retrieves them. */
/* Return true if there are any events in the queue that read-char
would return. If this returns false, a read-char would block. */
static bool
readable_events (int flags)
{
if (flags & READABLE_EVENTS_DO_TIMERS_NOW)
timer_check ();
/* If the buffer contains only FOCUS_IN/OUT_EVENT events, and
READABLE_EVENTS_FILTER_EVENTS is set, report it as empty. */
if (kbd_fetch_ptr != kbd_store_ptr)
{
if (flags & (READABLE_EVENTS_FILTER_EVENTS
#ifdef USE_TOOLKIT_SCROLL_BARS
| READABLE_EVENTS_IGNORE_SQUEEZABLES
#endif
))
{
union buffered_input_event *event = kbd_fetch_ptr;
do
{
if (!(
#ifdef USE_TOOLKIT_SCROLL_BARS
(flags & READABLE_EVENTS_FILTER_EVENTS) &&
#endif
(event->kind == FOCUS_IN_EVENT
|| event->kind == FOCUS_OUT_EVENT))
#ifdef USE_TOOLKIT_SCROLL_BARS
&& !((flags & READABLE_EVENTS_IGNORE_SQUEEZABLES)
&& (event->kind == SCROLL_BAR_CLICK_EVENT
|| event->kind == HORIZONTAL_SCROLL_BAR_CLICK_EVENT)
&& event->ie.part == scroll_bar_handle
&& event->ie.modifiers == 0)
#endif
)
return 1;
event = next_kbd_event (event);
}
while (event != kbd_store_ptr);
}
else
return 1;
}
if (!(flags & READABLE_EVENTS_IGNORE_SQUEEZABLES) && some_mouse_moved ())
return 1;
if (single_kboard)
{
if (current_kboard->kbd_queue_has_data)
return 1;
}
else
{
KBOARD *kb;
for (kb = all_kboards; kb; kb = kb->next_kboard)
if (kb->kbd_queue_has_data)
return 1;
}
return 0;
}
/* Set this for debugging, to have a way to get out */
int stop_character EXTERNALLY_VISIBLE;
static KBOARD *
event_to_kboard (struct input_event *event)
{
/* Not applicable for these special events. */
if (event->kind == SELECTION_REQUEST_EVENT
|| event->kind == SELECTION_CLEAR_EVENT)
return NULL;
else
{
Lisp_Object obj = event->frame_or_window;
/* There are some events that set this field to nil or string. */
if (WINDOWP (obj))
obj = WINDOW_FRAME (XWINDOW (obj));
/* Also ignore dead frames here. */
return ((FRAMEP (obj) && FRAME_LIVE_P (XFRAME (obj)))
? FRAME_KBOARD (XFRAME (obj)) : NULL);
}
}
#ifdef subprocesses
/* Return the number of slots occupied in kbd_buffer. */
static int
kbd_buffer_nr_stored (void)
{
int n = kbd_store_ptr - kbd_fetch_ptr;
return n + (n < 0 ? KBD_BUFFER_SIZE : 0);
}
#endif /* Store an event obtained at interrupt level into kbd_buffer, fifo */
void
kbd_buffer_store_event (register struct input_event *event)
{
kbd_buffer_store_event_hold (event, 0);
}
/* Store EVENT obtained at interrupt level into kbd_buffer, fifo.
If HOLD_QUIT is 0, just stuff EVENT into the fifo.
Else, if HOLD_QUIT.kind != NO_EVENT, discard EVENT.
Else, if EVENT is a quit event, store the quit event
in HOLD_QUIT, and return (thus ignoring further events).
This is used to postpone the processing of the quit event until all
subsequent input events have been parsed (and discarded). */
void
kbd_buffer_store_buffered_event (union buffered_input_event *event,
struct input_event *hold_quit)
{
if (event->kind == NO_EVENT)
emacs_abort ();
if (hold_quit && hold_quit->kind != NO_EVENT)
return;
if (event->kind == ASCII_KEYSTROKE_EVENT)
{
int c = event->ie.code & 0377;
if (event->ie.modifiers & ctrl_modifier)
c = make_ctrl_char (c);
c |= (event->ie.modifiers
& (meta_modifier | alt_modifier
| hyper_modifier | super_modifier));
if (c == quit_char)
{
KBOARD *kb = FRAME_KBOARD (XFRAME (event->ie.frame_or_window));
if (single_kboard && kb != current_kboard)
{
kset_kbd_queue
(kb, list2 (make_lispy_switch_frame (event->ie.frame_or_window),
make_fixnum (c)));
kb->kbd_queue_has_data = true;
for (union buffered_input_event *sp = kbd_fetch_ptr;
sp != kbd_store_ptr; sp = next_kbd_event (sp))
{
if (event_to_kboard (&sp->ie) == kb)
{
sp->ie.kind = NO_EVENT;
sp->ie.frame_or_window = Qnil;
sp->ie.arg = Qnil;
}
}
return;
}
if (hold_quit)
{
*hold_quit = event->ie;
return;
}
/* If this results in a quit_char being returned to Emacs as
input, set Vlast_event_frame properly. If this doesn't
get returned to Emacs as an event, the next event read
will set Vlast_event_frame again, so this is safe to do. */
{
Lisp_Object focus;
focus = FRAME_FOCUS_FRAME (XFRAME (event->ie.frame_or_window));
if (NILP (focus))
focus = event->ie.frame_or_window;
internal_last_event_frame = focus;
Vlast_event_frame = focus;
}
handle_interrupt (0);
return;
}
if (c && c == stop_character)
{
sys_suspend ();
return;
}
}
/* Don't let the very last slot in the buffer become full,
since that would make the two pointers equal,
and that is indistinguishable from an empty buffer.
Discard the event if it would fill the last slot. */
union buffered_input_event *next_slot = next_kbd_event (kbd_store_ptr);
if (kbd_fetch_ptr != next_slot)
{
*kbd_store_ptr = *event;
kbd_store_ptr = next_slot;
#ifdef subprocesses
if (kbd_buffer_nr_stored () > KBD_BUFFER_SIZE / 2
&& ! kbd_on_hold_p ())
{
/* Don't read keyboard input until we have processed kbd_buffer.
This happens when pasting text longer than KBD_BUFFER_SIZE/2. */
hold_keyboard_input ();
unrequest_sigio ();
stop_polling ();
}
#endif /* subprocesses */
}
Lisp_Object ignore_event;
switch (event->kind)
{
case FOCUS_IN_EVENT: ignore_event = Qfocus_in; break;
case FOCUS_OUT_EVENT: ignore_event = Qfocus_out; break;
case HELP_EVENT: ignore_event = Qhelp_echo; break;
case ICONIFY_EVENT: ignore_event = Qiconify_frame; break;
case DEICONIFY_EVENT: ignore_event = Qmake_frame_visible; break;
case SELECTION_REQUEST_EVENT: ignore_event = Qselection_request; break;
#ifdef USE_FILE_NOTIFY
case FILE_NOTIFY_EVENT: ignore_event = Qfile_notify; break;
#endif
#ifdef HAVE_DBUS
case DBUS_EVENT: ignore_event = Qdbus_event; break;
#endif
default: ignore_event = Qnil; break;
}
/* If we're inside while-no-input, and this event qualifies
as input, set quit-flag to cause an interrupt. */
if (!NILP (Vthrow_on_input)
&& NILP (Fmemq (ignore_event, Vwhile_no_input_ignore_events)))
Vquit_flag = Vthrow_on_input;
}
#ifdef HAVE_X11
/* Put a selection input event back in the head of the event queue. */
void
kbd_buffer_unget_event (struct selection_input_event *event)
{
/* Don't let the very last slot in the buffer become full, */
union buffered_input_event *kp = prev_kbd_event (kbd_fetch_ptr);
if (kp != kbd_store_ptr)
{
kp->sie = *event;
kbd_fetch_ptr = kp;
}
}
#endif
/* Limit help event positions to this range, to avoid overflow problems. */
#define INPUT_EVENT_POS_MAX \
((ptrdiff_t) min (PTRDIFF_MAX, min (TYPE_MAXIMUM (Time) / 2, \
MOST_POSITIVE_FIXNUM)))
#define INPUT_EVENT_POS_MIN (PTRDIFF_MIN < -INPUT_EVENT_POS_MAX \
? -1 - INPUT_EVENT_POS_MAX : PTRDIFF_MIN)
/* Return a Time that encodes position POS. POS must be in range. */
static Time
position_to_Time (ptrdiff_t pos)
{
eassert (INPUT_EVENT_POS_MIN <= pos && pos <= INPUT_EVENT_POS_MAX);
return pos;
}
/* Return the position that ENCODED_POS encodes.
Avoid signed integer overflow. */
static ptrdiff_t
Time_to_position (Time encoded_pos)
{
if (encoded_pos <= INPUT_EVENT_POS_MAX)
return encoded_pos;
Time encoded_pos_min = INPUT_EVENT_POS_MIN;
eassert (encoded_pos_min <= encoded_pos);
ptrdiff_t notpos = -1 - encoded_pos;
return -1 - notpos;
}
/* Generate a HELP_EVENT input_event and store it in the keyboard
buffer.
HELP is the help form.
FRAME and WINDOW are the frame and window where the help is
generated. OBJECT is the Lisp object where the help was found (a
buffer, a string, an overlay, or nil if neither from a string nor
from a buffer). POS is the position within OBJECT where the help
was found. */
void
gen_help_event (Lisp_Object help, Lisp_Object frame, Lisp_Object window,
Lisp_Object object, ptrdiff_t pos)
{
struct input_event event;
event.kind = HELP_EVENT;
event.frame_or_window = frame;
event.arg = object;
event.x = WINDOWP (window) ? window : frame;
event.y = help;
event.timestamp = position_to_Time (pos);
kbd_buffer_store_event (&event);
}
/* Store HELP_EVENTs for HELP on FRAME in the input queue. */
void
kbd_buffer_store_help_event (Lisp_Object frame, Lisp_Object help)
{
struct input_event event;
event.kind = HELP_EVENT;
event.frame_or_window = frame;
event.arg = Qnil;
event.x = Qnil;
event.y = help;
event.timestamp = 0;
kbd_buffer_store_event (&event);
}
/* Discard any mouse events in the event buffer by setting them to
NO_EVENT. */
void
discard_mouse_events (void)
{
for (union buffered_input_event *sp = kbd_fetch_ptr;
sp != kbd_store_ptr; sp = next_kbd_event (sp))
{
if (sp->kind == MOUSE_CLICK_EVENT
|| sp->kind == WHEEL_EVENT
|| sp->kind == HORIZ_WHEEL_EVENT
|| sp->kind == SCROLL_BAR_CLICK_EVENT
|| sp->kind == HORIZONTAL_SCROLL_BAR_CLICK_EVENT)
{
sp->kind = NO_EVENT;
}
}
}
/* Return true if there are any real events waiting in the event
buffer, not counting `NO_EVENT's.
Discard NO_EVENT events at the front of the input queue, possibly
leaving the input queue empty if there are no real input events. */
bool
kbd_buffer_events_waiting (void)
{
for (union buffered_input_event *sp = kbd_fetch_ptr;
; sp = next_kbd_event (sp))
if (sp == kbd_store_ptr || sp->kind != NO_EVENT)
{
kbd_fetch_ptr = sp;
return sp != kbd_store_ptr && sp->kind != NO_EVENT;
}
}
/* Clear input event EVENT. */
static void
clear_event (struct input_event *event)
{
event->kind = NO_EVENT;
}
/* Read one event from the event buffer, waiting if necessary.
The value is a Lisp object representing the event.
The value is nil for an event that should be ignored,
or that was handled here.
We always read and discard one event. */
static Lisp_Object
kbd_buffer_get_event (KBOARD **kbp,
bool *used_mouse_menu,
struct timespec *end_time)
{
Lisp_Object obj;
#ifdef subprocesses
if (kbd_on_hold_p () && kbd_buffer_nr_stored () < KBD_BUFFER_SIZE / 4)
{
/* Start reading input again because we have processed enough to
be able to accept new events again. */
unhold_keyboard_input ();
request_sigio ();
start_polling ();
}
#endif /* subprocesses */
#if !defined HAVE_DBUS && !defined USE_FILE_NOTIFY && !defined THREADS_ENABLED
if (noninteractive
/* In case we are running as a daemon, only do this before
detaching from the terminal. */
|| (IS_DAEMON && DAEMON_RUNNING))
{
int c = getchar ();
XSETINT (obj, c);
*kbp = current_kboard;
return obj;
}
#endif /* !defined HAVE_DBUS && !defined USE_FILE_NOTIFY && !defined THREADS_ENABLED */
/* Wait until there is input available. */
for (;;)
{
/* Break loop if there's an unread command event. Needed in
moused window autoselection which uses a timer to insert such
events. */
if (CONSP (Vunread_command_events))
break;
if (kbd_fetch_ptr != kbd_store_ptr)
break;
if (some_mouse_moved ())
break;
/* If the quit flag is set, then read_char will return
quit_char, so that counts as "available input." */
if (!NILP (Vquit_flag))
quit_throw_to_read_char (0);
/* One way or another, wait until input is available; then, if
interrupt handlers have not read it, read it now. */
#ifdef USABLE_SIGIO
gobble_input ();
#endif
if (kbd_fetch_ptr != kbd_store_ptr)
break;
if (some_mouse_moved ())
break;
if (end_time)
{
struct timespec now = current_timespec ();
if (timespec_cmp (*end_time, now) <= 0)
return Qnil; /* Finished waiting. */
else
{
struct timespec duration = timespec_sub (*end_time, now);
wait_reading_process_output (min (duration.tv_sec,
WAIT_READING_MAX),
duration.tv_nsec,
-1, 1, Qnil, NULL, 0);
}
}
else
{
bool do_display = true;
if (FRAME_TERMCAP_P (SELECTED_FRAME ()))
{
struct tty_display_info *tty = CURTTY ();
/* When this TTY is displaying a menu, we must prevent
any redisplay, because we modify the frame's glyph
matrix behind the back of the display engine. */
if (tty->showing_menu)
do_display = false;
}
wait_reading_process_output (0, 0, -1, do_display, Qnil, NULL, 0);
}
if (!interrupt_input && kbd_fetch_ptr == kbd_store_ptr)
gobble_input ();
}
if (CONSP (Vunread_command_events))
{
Lisp_Object first;
first = XCAR (Vunread_command_events);
Vunread_command_events = XCDR (Vunread_command_events);
*kbp = current_kboard;
return first;
}
/* At this point, we know that there is a readable event available
somewhere. If the event queue is empty, then there must be a
mouse movement enabled and available. */
if (kbd_fetch_ptr != kbd_store_ptr)
{
union buffered_input_event *event = kbd_fetch_ptr;
*kbp = event_to_kboard (&event->ie);
if (*kbp == 0)
*kbp = current_kboard; /* Better than returning null ptr? */
obj = Qnil;
/* These two kinds of events get special handling
and don't actually appear to the command loop.
We return nil for them. */
switch (event->kind)
{
case SELECTION_REQUEST_EVENT:
case SELECTION_CLEAR_EVENT:
{
#ifdef HAVE_X11
/* Remove it from the buffer before processing it,
since otherwise swallow_events will see it
and process it again. */
struct selection_input_event copy = event->sie;
kbd_fetch_ptr = next_kbd_event (event);
input_pending = readable_events (0);
x_handle_selection_event (©);
#else
/* We're getting selection request events, but we don't have
a window system. */
emacs_abort ();
#endif
}
break;
#ifdef HAVE_EXT_MENU_BAR
case MENU_BAR_ACTIVATE_EVENT:
{
struct frame *f;
kbd_fetch_ptr = next_kbd_event (event);
input_pending = readable_events (0);
f = (XFRAME (event->ie.frame_or_window));
if (FRAME_LIVE_P (f) && FRAME_TERMINAL (f)->activate_menubar_hook)
FRAME_TERMINAL (f)->activate_menubar_hook (f);
}
break;
#endif
#if defined (HAVE_NS)
case NS_TEXT_EVENT:
if (used_mouse_menu)
*used_mouse_menu = true;
FALLTHROUGH;
#endif
#ifdef HAVE_NTGUI
case END_SESSION_EVENT:
case LANGUAGE_CHANGE_EVENT:
#endif
#ifdef HAVE_WINDOW_SYSTEM
case DELETE_WINDOW_EVENT:
case ICONIFY_EVENT:
case DEICONIFY_EVENT:
case MOVE_FRAME_EVENT:
#endif
#ifdef USE_FILE_NOTIFY
case FILE_NOTIFY_EVENT:
#endif
#ifdef HAVE_DBUS
case DBUS_EVENT:
#endif
#ifdef THREADS_ENABLED
case THREAD_EVENT:
#endif
#ifdef HAVE_XWIDGETS
case XWIDGET_EVENT:
#endif
case SAVE_SESSION_EVENT:
case NO_EVENT:
case HELP_EVENT:
case FOCUS_IN_EVENT:
case CONFIG_CHANGED_EVENT:
case FOCUS_OUT_EVENT:
case SELECT_WINDOW_EVENT:
{
obj = make_lispy_event (&event->ie);
kbd_fetch_ptr = next_kbd_event (event);
}
break;
default:
{
/* If this event is on a different frame, return a
switch-frame this time, and leave the event in the queue
for next time. */
Lisp_Object frame;
Lisp_Object focus;
frame = event->ie.frame_or_window;
if (CONSP (frame))
frame = XCAR (frame);
else if (WINDOWP (frame))
frame = WINDOW_FRAME (XWINDOW (frame));
focus = FRAME_FOCUS_FRAME (XFRAME (frame));
if (! NILP (focus))
frame = focus;
if (!EQ (frame, internal_last_event_frame)
&& !EQ (frame, selected_frame))
obj = make_lispy_switch_frame (frame);
internal_last_event_frame = frame;
/* If we didn't decide to make a switch-frame event, go ahead
and build a real event from the queue entry. */
if (NILP (obj))
{
obj = make_lispy_event (&event->ie);
#ifdef HAVE_EXT_MENU_BAR
/* If this was a menu selection, then set the flag to inhibit
writing to last_nonmenu_event. Don't do this if the event
we're returning is (menu-bar), though; that indicates the
beginning of the menu sequence, and we might as well leave
that as the `event with parameters' for this selection. */
if (used_mouse_menu
&& !EQ (event->ie.frame_or_window, event->ie.arg)
&& (event->kind == MENU_BAR_EVENT
|| event->kind == TAB_BAR_EVENT
|| event->kind == TOOL_BAR_EVENT))
*used_mouse_menu = true;
#endif
#ifdef HAVE_NS
/* Certain system events are non-key events. */
if (used_mouse_menu
&& event->kind == NS_NONKEY_EVENT)
*used_mouse_menu = true;
#endif
/* Wipe out this event, to catch bugs. */
clear_event (&event->ie);
kbd_fetch_ptr = next_kbd_event (event);
}
}
}
}
/* Try generating a mouse motion event. */
else if (some_mouse_moved ())
{
struct frame *f = some_mouse_moved ();
Lisp_Object bar_window;
enum scroll_bar_part part;
Lisp_Object x, y;
Time t;
*kbp = current_kboard;
/* Note that this uses F to determine which terminal to look at.
If there is no valid info, it does not store anything
so x remains nil. */
x = Qnil;
/* XXX Can f or mouse_position_hook be NULL here? */
if (f && FRAME_TERMINAL (f)->mouse_position_hook)
(*FRAME_TERMINAL (f)->mouse_position_hook) (&f, 0, &bar_window,
&part, &x, &y, &t);
obj = Qnil;
/* Decide if we should generate a switch-frame event. Don't
generate switch-frame events for motion outside of all Emacs
frames. */
if (!NILP (x) && f)
{
Lisp_Object frame;
frame = FRAME_FOCUS_FRAME (f);
if (NILP (frame))
XSETFRAME (frame, f);
if (!EQ (frame, internal_last_event_frame)
&& !EQ (frame, selected_frame))
obj = make_lispy_switch_frame (frame);
internal_last_event_frame = frame;
}
/* If we didn't decide to make a switch-frame event, go ahead and
return a mouse-motion event. */
if (!NILP (x) && NILP (obj))
obj = make_lispy_movement (f, bar_window, part, x, y, t);
}
else
/* We were promised by the above while loop that there was
something for us to read! */
emacs_abort ();
input_pending = readable_events (0);
Vlast_event_frame = internal_last_event_frame;
return (obj);
}
/* Process any non-user-visible events (currently X selection events),
without reading any user-visible events. */
static void
process_special_events (void)
{
for (union buffered_input_event *event = kbd_fetch_ptr;
event != kbd_store_ptr; event = next_kbd_event (event))
{
/* If we find a stored X selection request, handle it now. */
if (event->kind == SELECTION_REQUEST_EVENT
|| event->kind == SELECTION_CLEAR_EVENT)
{
#ifdef HAVE_X11
/* Remove the event from the fifo buffer before processing;
otherwise swallow_events called recursively could see it
and process it again. To do this, we move the events
between kbd_fetch_ptr and EVENT one slot to the right,
cyclically. */
struct selection_input_event copy = event->sie;
int moved_events;
if (event < kbd_fetch_ptr)
{
memmove (kbd_buffer + 1, kbd_buffer,
(event - kbd_buffer) * sizeof *kbd_buffer);
kbd_buffer[0] = kbd_buffer[KBD_BUFFER_SIZE - 1];
moved_events = kbd_buffer + KBD_BUFFER_SIZE - 1 - kbd_fetch_ptr;
}
else
moved_events = event - kbd_fetch_ptr;
memmove (kbd_fetch_ptr + 1, kbd_fetch_ptr,
moved_events * sizeof *kbd_fetch_ptr);
kbd_fetch_ptr = next_kbd_event (kbd_fetch_ptr);
input_pending = readable_events (0);
x_handle_selection_event (©);
#else
/* We're getting selection request events, but we don't have
a window system. */
emacs_abort ();
#endif
}
}
}
/* Process any events that are not user-visible, run timer events that
are ripe, and return, without reading any user-visible events. */
void
swallow_events (bool do_display)
{
unsigned old_timers_run;
process_special_events ();
old_timers_run = timers_run;
get_input_pending (READABLE_EVENTS_DO_TIMERS_NOW);
if (!input_pending && timers_run != old_timers_run && do_display)
redisplay_preserve_echo_area (7);
}
/* Record the start of when Emacs is idle,
for the sake of running idle-time timers. */
static void
timer_start_idle (void)
{
/* If we are already in the idle state, do nothing. */
if (timespec_valid_p (timer_idleness_start_time))
return;
timer_idleness_start_time = current_timespec ();
timer_last_idleness_start_time = timer_idleness_start_time;
/* Mark all idle-time timers as once again candidates for running. */
call0 (intern ("internal-timer-start-idle"));
}
/* Record that Emacs is no longer idle, so stop running idle-time timers. */
static void
timer_stop_idle (void)
{
timer_idleness_start_time = invalid_timespec ();
}
/* Resume idle timer from last idle start time. */
static void
timer_resume_idle (void)
{
if (timespec_valid_p (timer_idleness_start_time))
return;
timer_idleness_start_time = timer_last_idleness_start_time;
}
/* List of elisp functions to call, delayed because they were generated in
a context where Elisp could not be safely run (e.g. redisplay, signal,
...). Each element has the form (FUN . ARGS). */
Lisp_Object pending_funcalls;
/* Return true if TIMER is a valid timer, placing its value into *RESULT. */
static bool
decode_timer (Lisp_Object timer, struct timespec *result)
{
Lisp_Object *vec;
if (! (VECTORP (timer) && ASIZE (timer) == 10))
return false;
vec = XVECTOR (timer)->contents;
if (! NILP (vec[0]))
return false;
if (! FIXNUMP (vec[2]))
return false;
return list4_to_timespec (vec[1], vec[2], vec[3], vec[8], result);
}
/* Check whether a timer has fired. To prevent larger problems we simply
disregard elements that are not proper timers. Do not make a circular
timer list for the time being.
Returns the time to wait until the next timer fires. If a
timer is triggering now, return zero.
If no timer is active, return -1.
If a timer is ripe, we run it, with quitting turned off.
In that case we return 0 to indicate that a new timer_check_2 call
should be done. */
static struct timespec
timer_check_2 (Lisp_Object timers, Lisp_Object idle_timers)
{
struct timespec nexttime;
struct timespec now;
struct timespec idleness_now;
Lisp_Object chosen_timer;
nexttime = invalid_timespec ();
chosen_timer = Qnil;
/* First run the code that was delayed. */
while (CONSP (pending_funcalls))
{
Lisp_Object funcall = XCAR (pending_funcalls);
pending_funcalls = XCDR (pending_funcalls);
safe_call2 (Qapply, XCAR (funcall), XCDR (funcall));
}
if (CONSP (timers) || CONSP (idle_timers))
{
now = current_timespec ();
idleness_now = (timespec_valid_p (timer_idleness_start_time)
? timespec_sub (now, timer_idleness_start_time)
: make_timespec (0, 0));
}
while (CONSP (timers) || CONSP (idle_timers))
{
Lisp_Object timer = Qnil, idle_timer = Qnil;
struct timespec timer_time, idle_timer_time;
struct timespec difference;
struct timespec timer_difference = invalid_timespec ();
struct timespec idle_timer_difference = invalid_timespec ();
bool ripe, timer_ripe = 0, idle_timer_ripe = 0;
/* Set TIMER and TIMER_DIFFERENCE
based on the next ordinary timer.
TIMER_DIFFERENCE is the distance in time from NOW to when
this timer becomes ripe.
Skip past invalid timers and timers already handled. */
if (CONSP (timers))
{
timer = XCAR (timers);
if (! decode_timer (timer, &timer_time))
{
timers = XCDR (timers);
continue;
}
timer_ripe = timespec_cmp (timer_time, now) <= 0;
timer_difference = (timer_ripe
? timespec_sub (now, timer_time)
: timespec_sub (timer_time, now));
}
/* Likewise for IDLE_TIMER and IDLE_TIMER_DIFFERENCE
based on the next idle timer. */
if (CONSP (idle_timers))
{
idle_timer = XCAR (idle_timers);
if (! decode_timer (idle_timer, &idle_timer_time))
{
idle_timers = XCDR (idle_timers);
continue;
}
idle_timer_ripe = timespec_cmp (idle_timer_time, idleness_now) <= 0;
idle_timer_difference
= (idle_timer_ripe
? timespec_sub (idleness_now, idle_timer_time)
: timespec_sub (idle_timer_time, idleness_now));
}
/* Decide which timer is the next timer,
and set CHOSEN_TIMER, DIFFERENCE, and RIPE accordingly.
Also step down the list where we found that timer. */
if (timespec_valid_p (timer_difference)
&& (! timespec_valid_p (idle_timer_difference)
|| idle_timer_ripe < timer_ripe
|| (idle_timer_ripe == timer_ripe
&& ((timer_ripe
? timespec_cmp (idle_timer_difference,
timer_difference)
: timespec_cmp (timer_difference,
idle_timer_difference))
< 0))))
{
chosen_timer = timer;
timers = XCDR (timers);
difference = timer_difference;
ripe = timer_ripe;
}
else
{
chosen_timer = idle_timer;
idle_timers = XCDR (idle_timers);
difference = idle_timer_difference;
ripe = idle_timer_ripe;
}
/* If timer is ripe, run it if it hasn't been run. */
if (ripe)
{
if (NILP (AREF (chosen_timer, 0)))
{
ptrdiff_t count = SPECPDL_INDEX ();
Lisp_Object old_deactivate_mark = Vdeactivate_mark;
/* Mark the timer as triggered to prevent problems if the lisp
code fails to reschedule it right. */
ASET (chosen_timer, 0, Qt);
specbind (Qinhibit_quit, Qt);
call1 (Qtimer_event_handler, chosen_timer);
Vdeactivate_mark = old_deactivate_mark;
timers_run++;
unbind_to (count, Qnil);
/* Since we have handled the event,
we don't need to tell the caller to wake up and do it. */
/* But the caller must still wait for the next timer, so
return 0 to indicate that. */
}
nexttime = make_timespec (0, 0);
break;
}
else
/* When we encounter a timer that is still waiting,
return the amount of time to wait before it is ripe. */
{
return difference;
}
}
/* No timers are pending in the future. */
/* Return 0 if we generated an event, and -1 if not. */
return nexttime;
}
/* Check whether a timer has fired. To prevent larger problems we simply
disregard elements that are not proper timers. Do not make a circular
timer list for the time being.
Returns the time to wait until the next timer fires.
If no timer is active, return an invalid value.
As long as any timer is ripe, we run it. */
struct timespec
timer_check (void)
{
struct timespec nexttime;
Lisp_Object timers, idle_timers;
Lisp_Object tem = Vinhibit_quit;
Vinhibit_quit = Qt;
/* We use copies of the timers' lists to allow a timer to add itself
again, without locking up Emacs if the newly added timer is
already ripe when added. */
/* Always consider the ordinary timers. */
timers = Fcopy_sequence (Vtimer_list);
/* Consider the idle timers only if Emacs is idle. */
if (timespec_valid_p (timer_idleness_start_time))
idle_timers = Fcopy_sequence (Vtimer_idle_list);
else
idle_timers = Qnil;
Vinhibit_quit = tem;
do
{
nexttime = timer_check_2 (timers, idle_timers);
}
while (nexttime.tv_sec == 0 && nexttime.tv_nsec == 0);
return nexttime;
}
DEFUN ("current-idle-time", Fcurrent_idle_time, Scurrent_idle_time, 0, 0, 0,
doc: /* Return the current length of Emacs idleness, or nil.
The value when Emacs is idle is a Lisp timestamp in the style of
`current-time'.
The value when Emacs is not idle is nil.
PSEC is a multiple of the system clock resolution. */)
(void)
{
if (timespec_valid_p (timer_idleness_start_time))
return make_lisp_time (timespec_sub (current_timespec (),
timer_idleness_start_time));
return Qnil;
}
/* Caches for modify_event_symbol. */
static Lisp_Object accent_key_syms;
static Lisp_Object func_key_syms;
static Lisp_Object mouse_syms;
static Lisp_Object wheel_syms;
static Lisp_Object drag_n_drop_syms;
/* This is a list of keysym codes for special "accent" characters.
It parallels lispy_accent_keys. */
static const int lispy_accent_codes[] =
{
#ifdef XK_dead_circumflex
XK_dead_circumflex,
#else
0,
#endif
#ifdef XK_dead_grave
XK_dead_grave,
#else
0,
#endif
#ifdef XK_dead_tilde
XK_dead_tilde,
#else
0,
#endif
#ifdef XK_dead_diaeresis
XK_dead_diaeresis,
#else
0,
#endif
#ifdef XK_dead_macron
XK_dead_macron,
#else
0,
#endif
#ifdef XK_dead_degree
XK_dead_degree,
#else
0,
#endif
#ifdef XK_dead_acute
XK_dead_acute,
#else
0,
#endif
#ifdef XK_dead_cedilla
XK_dead_cedilla,
#else
0,
#endif
#ifdef XK_dead_breve
XK_dead_breve,
#else
0,
#endif
#ifdef XK_dead_ogonek
XK_dead_ogonek,
#else
0,
#endif
#ifdef XK_dead_caron
XK_dead_caron,
#else
0,
#endif
#ifdef XK_dead_doubleacute
XK_dead_doubleacute,
#else
0,
#endif
#ifdef XK_dead_abovedot
XK_dead_abovedot,
#else
0,
#endif
#ifdef XK_dead_abovering
XK_dead_abovering,
#else
0,
#endif
#ifdef XK_dead_iota
XK_dead_iota,
#else
0,
#endif
#ifdef XK_dead_belowdot
XK_dead_belowdot,
#else
0,
#endif
#ifdef XK_dead_voiced_sound
XK_dead_voiced_sound,
#else
0,
#endif
#ifdef XK_dead_semivoiced_sound
XK_dead_semivoiced_sound,
#else
0,
#endif
#ifdef XK_dead_hook
XK_dead_hook,
#else
0,
#endif
#ifdef XK_dead_horn
XK_dead_horn,
#else
0,
#endif
};
/* This is a list of Lisp names for special "accent" characters.
It parallels lispy_accent_codes. */
static const char *const lispy_accent_keys[] =
{
"dead-circumflex",
"dead-grave",
"dead-tilde",
"dead-diaeresis",
"dead-macron",
"dead-degree",
"dead-acute",
"dead-cedilla",
"dead-breve",
"dead-ogonek",
"dead-caron",
"dead-doubleacute",
"dead-abovedot",
"dead-abovering",
"dead-iota",
"dead-belowdot",
"dead-voiced-sound",
"dead-semivoiced-sound",
"dead-hook",
"dead-horn",
};
#ifdef HAVE_NTGUI
#define FUNCTION_KEY_OFFSET 0x0
const char *const lispy_function_keys[] =
{
0, /* 0 */
0, /* VK_LBUTTON 0x01 */
0, /* VK_RBUTTON 0x02 */
"cancel", /* VK_CANCEL 0x03 */
0, /* VK_MBUTTON 0x04 */
0, 0, 0, /* 0x05 .. 0x07 */
"backspace", /* VK_BACK 0x08 */
"tab", /* VK_TAB 0x09 */
0, 0, /* 0x0A .. 0x0B */
"clear", /* VK_CLEAR 0x0C */
"return", /* VK_RETURN 0x0D */
0, 0, /* 0x0E .. 0x0F */
0, /* VK_SHIFT 0x10 */
0, /* VK_CONTROL 0x11 */
0, /* VK_MENU 0x12 */
"pause", /* VK_PAUSE 0x13 */
"capslock", /* VK_CAPITAL 0x14 */
"kana", /* VK_KANA/VK_HANGUL 0x15 */
0, /* 0x16 */
"junja", /* VK_JUNJA 0x17 */
"final", /* VK_FINAL 0x18 */
"kanji", /* VK_KANJI/VK_HANJA 0x19 */
0, /* 0x1A */
"escape", /* VK_ESCAPE 0x1B */
"convert", /* VK_CONVERT 0x1C */
"non-convert", /* VK_NONCONVERT 0x1D */
"accept", /* VK_ACCEPT 0x1E */
"mode-change", /* VK_MODECHANGE 0x1F */
0, /* VK_SPACE 0x20 */
"prior", /* VK_PRIOR 0x21 */
"next", /* VK_NEXT 0x22 */
"end", /* VK_END 0x23 */
"home", /* VK_HOME 0x24 */
"left", /* VK_LEFT 0x25 */
"up", /* VK_UP 0x26 */
"right", /* VK_RIGHT 0x27 */
"down", /* VK_DOWN 0x28 */
"select", /* VK_SELECT 0x29 */
"print", /* VK_PRINT 0x2A */
"execute", /* VK_EXECUTE 0x2B */
"snapshot", /* VK_SNAPSHOT 0x2C */
"insert", /* VK_INSERT 0x2D */
"delete", /* VK_DELETE 0x2E */
"help", /* VK_HELP 0x2F */
/* VK_0 thru VK_9 are the same as ASCII '0' thru '9' (0x30 - 0x39) */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, /* 0x3A .. 0x40 */
/* VK_A thru VK_Z are the same as ASCII 'A' thru 'Z' (0x41 - 0x5A) */
0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
"lwindow", /* VK_LWIN 0x5B */
"rwindow", /* VK_RWIN 0x5C */
"apps", /* VK_APPS 0x5D */
0, /* 0x5E */
"sleep",
"kp-0", /* VK_NUMPAD0 0x60 */
"kp-1", /* VK_NUMPAD1 0x61 */
"kp-2", /* VK_NUMPAD2 0x62 */
"kp-3", /* VK_NUMPAD3 0x63 */
"kp-4", /* VK_NUMPAD4 0x64 */
"kp-5", /* VK_NUMPAD5 0x65 */
"kp-6", /* VK_NUMPAD6 0x66 */
"kp-7", /* VK_NUMPAD7 0x67 */
"kp-8", /* VK_NUMPAD8 0x68 */
"kp-9", /* VK_NUMPAD9 0x69 */
"kp-multiply", /* VK_MULTIPLY 0x6A */
"kp-add", /* VK_ADD 0x6B */
"kp-separator", /* VK_SEPARATOR 0x6C */
"kp-subtract", /* VK_SUBTRACT 0x6D */
"kp-decimal", /* VK_DECIMAL 0x6E */
"kp-divide", /* VK_DIVIDE 0x6F */
"f1", /* VK_F1 0x70 */
"f2", /* VK_F2 0x71 */
"f3", /* VK_F3 0x72 */
"f4", /* VK_F4 0x73 */
"f5", /* VK_F5 0x74 */
"f6", /* VK_F6 0x75 */
"f7", /* VK_F7 0x76 */
"f8", /* VK_F8 0x77 */
"f9", /* VK_F9 0x78 */
"f10", /* VK_F10 0x79 */
"f11", /* VK_F11 0x7A */
"f12", /* VK_F12 0x7B */
"f13", /* VK_F13 0x7C */
"f14", /* VK_F14 0x7D */
"f15", /* VK_F15 0x7E */
"f16", /* VK_F16 0x7F */
"f17", /* VK_F17 0x80 */
"f18", /* VK_F18 0x81 */
"f19", /* VK_F19 0x82 */
"f20", /* VK_F20 0x83 */
"f21", /* VK_F21 0x84 */
"f22", /* VK_F22 0x85 */
"f23", /* VK_F23 0x86 */
"f24", /* VK_F24 0x87 */
0, 0, 0, 0, /* 0x88 .. 0x8B */
0, 0, 0, 0, /* 0x8C .. 0x8F */
"kp-numlock", /* VK_NUMLOCK 0x90 */
"scroll", /* VK_SCROLL 0x91 */
/* Not sure where the following block comes from.
Windows headers have NEC and Fujitsu specific keys in
this block, but nothing generic. */
"kp-space", /* VK_NUMPAD_CLEAR 0x92 */
"kp-enter", /* VK_NUMPAD_ENTER 0x93 */
"kp-prior", /* VK_NUMPAD_PRIOR 0x94 */
"kp-next", /* VK_NUMPAD_NEXT 0x95 */
"kp-end", /* VK_NUMPAD_END 0x96 */
"kp-home", /* VK_NUMPAD_HOME 0x97 */
"kp-left", /* VK_NUMPAD_LEFT 0x98 */
"kp-up", /* VK_NUMPAD_UP 0x99 */
"kp-right", /* VK_NUMPAD_RIGHT 0x9A */
"kp-down", /* VK_NUMPAD_DOWN 0x9B */
"kp-insert", /* VK_NUMPAD_INSERT 0x9C */
"kp-delete", /* VK_NUMPAD_DELETE 0x9D */
0, 0, /* 0x9E .. 0x9F */
/*
* VK_L* & VK_R* - left and right Alt, Ctrl and Shift virtual keys.
* Used only as parameters to GetAsyncKeyState and GetKeyState.
* No other API or message will distinguish left and right keys this way.
* 0xA0 .. 0xA5
*/
0, 0, 0, 0, 0, 0,
/* Multimedia keys. These are handled as WM_APPCOMMAND, which allows us
to enable them selectively, and gives access to a few more functions.
See lispy_multimedia_keys below. */
0, 0, 0, 0, 0, 0, 0, /* 0xA6 .. 0xAC Browser */
0, 0, 0, /* 0xAD .. 0xAF Volume */
0, 0, 0, 0, /* 0xB0 .. 0xB3 Media */
0, 0, 0, 0, /* 0xB4 .. 0xB7 Apps */
/* 0xB8 .. 0xC0 "OEM" keys - all seem to be punctuation. */
0, 0, 0, 0, 0, 0, 0, 0, 0,
/* 0xC1 - 0xDA unallocated, 0xDB-0xDF more OEM keys */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, /* 0xE0 */
"ax", /* VK_OEM_AX 0xE1 */
0, /* VK_OEM_102 0xE2 */
"ico-help", /* VK_ICO_HELP 0xE3 */
"ico-00", /* VK_ICO_00 0xE4 */
0, /* VK_PROCESSKEY 0xE5 - used by IME */
"ico-clear", /* VK_ICO_CLEAR 0xE6 */
0, /* VK_PACKET 0xE7 - used to pass Unicode chars */
0, /* 0xE8 */
"reset", /* VK_OEM_RESET 0xE9 */
"jump", /* VK_OEM_JUMP 0xEA */
"oem-pa1", /* VK_OEM_PA1 0xEB */
"oem-pa2", /* VK_OEM_PA2 0xEC */
"oem-pa3", /* VK_OEM_PA3 0xED */
"wsctrl", /* VK_OEM_WSCTRL 0xEE */
"cusel", /* VK_OEM_CUSEL 0xEF */
"oem-attn", /* VK_OEM_ATTN 0xF0 */
"finish", /* VK_OEM_FINISH 0xF1 */
"copy", /* VK_OEM_COPY 0xF2 */
"auto", /* VK_OEM_AUTO 0xF3 */
"enlw", /* VK_OEM_ENLW 0xF4 */
"backtab", /* VK_OEM_BACKTAB 0xF5 */
"attn", /* VK_ATTN 0xF6 */
"crsel", /* VK_CRSEL 0xF7 */
"exsel", /* VK_EXSEL 0xF8 */
"ereof", /* VK_EREOF 0xF9 */
"play", /* VK_PLAY 0xFA */
"zoom", /* VK_ZOOM 0xFB */
"noname", /* VK_NONAME 0xFC */
"pa1", /* VK_PA1 0xFD */
"oem_clear", /* VK_OEM_CLEAR 0xFE */
0 /* 0xFF */
};
/* Some of these duplicate the "Media keys" on newer keyboards,
but they are delivered to the application in a different way. */
static const char *const lispy_multimedia_keys[] =
{
0,
"browser-back",
"browser-forward",
"browser-refresh",
"browser-stop",
"browser-search",
"browser-favorites",
"browser-home",
"volume-mute",
"volume-down",
"volume-up",
"media-next",
"media-previous",
"media-stop",
"media-play-pause",
"mail",
"media-select",
"app-1",
"app-2",
"bass-down",
"bass-boost",
"bass-up",
"treble-down",
"treble-up",
"mic-volume-mute",
"mic-volume-down",
"mic-volume-up",
"help",
"find",
"new",
"open",
"close",
"save",
"print",
"undo",
"redo",
"copy",
"cut",
"paste",
"mail-reply",
"mail-forward",
"mail-send",
"spell-check",
"toggle-dictate-command",
"mic-toggle",
"correction-list",
"media-play",
"media-pause",
"media-record",
"media-fast-forward",
"media-rewind",
"media-channel-up",
"media-channel-down"
};
#else /* not HAVE_NTGUI */
/* This should be dealt with in XTread_socket now, and that doesn't
depend on the client system having the Kana syms defined. See also
the XK_kana_A case below. */
#if 0
#ifdef XK_kana_A
static const char *const lispy_kana_keys[] =
{
/* X Keysym value */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x400 .. 0x40f */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x410 .. 0x41f */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x420 .. 0x42f */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x430 .. 0x43f */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x440 .. 0x44f */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x450 .. 0x45f */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x460 .. 0x46f */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,"overline",0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x480 .. 0x48f */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x490 .. 0x49f */
0, "kana-fullstop", "kana-openingbracket", "kana-closingbracket",
"kana-comma", "kana-conjunctive", "kana-WO", "kana-a",
"kana-i", "kana-u", "kana-e", "kana-o",
"kana-ya", "kana-yu", "kana-yo", "kana-tsu",
"prolongedsound", "kana-A", "kana-I", "kana-U",
"kana-E", "kana-O", "kana-KA", "kana-KI",
"kana-KU", "kana-KE", "kana-KO", "kana-SA",
"kana-SHI", "kana-SU", "kana-SE", "kana-SO",
"kana-TA", "kana-CHI", "kana-TSU", "kana-TE",
"kana-TO", "kana-NA", "kana-NI", "kana-NU",
"kana-NE", "kana-NO", "kana-HA", "kana-HI",
"kana-FU", "kana-HE", "kana-HO", "kana-MA",
"kana-MI", "kana-MU", "kana-ME", "kana-MO",
"kana-YA", "kana-YU", "kana-YO", "kana-RA",
"kana-RI", "kana-RU", "kana-RE", "kana-RO",
"kana-WA", "kana-N", "voicedsound", "semivoicedsound",
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x4e0 .. 0x4ef */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* 0x4f0 .. 0x4ff */
};
#endif /* XK_kana_A */
#endif /* 0 */
#define FUNCTION_KEY_OFFSET 0xff00
/* You'll notice that this table is arranged to be conveniently
indexed by X Windows keysym values. */
static const char *const lispy_function_keys[] =
{
/* X Keysym value */
0, 0, 0, 0, 0, 0, 0, 0, /* 0xff00...0f */
"backspace", "tab", "linefeed", "clear",
0, "return", 0, 0,
0, 0, 0, "pause", /* 0xff10...1f */
0, 0, 0, 0, 0, 0, 0, "escape",
0, 0, 0, 0,
0, "kanji", "muhenkan", "henkan", /* 0xff20...2f */
"romaji", "hiragana", "katakana", "hiragana-katakana",
"zenkaku", "hankaku", "zenkaku-hankaku", "touroku",
"massyo", "kana-lock", "kana-shift", "eisu-shift",
"eisu-toggle", /* 0xff30...3f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xff40...4f */
"home", "left", "up", "right", /* 0xff50 */ /* IsCursorKey */
"down", "prior", "next", "end",
"begin", 0, 0, 0, 0, 0, 0, 0,
"select", /* 0xff60 */ /* IsMiscFunctionKey */
"print",
"execute",
"insert",
0, /* 0xff64 */
"undo",
"redo",
"menu",
"find",
"cancel",
"help",
"break", /* 0xff6b */
0, 0, 0, 0,
0, 0, 0, 0, "backtab", 0, 0, 0, /* 0xff70... */
0, 0, 0, 0, 0, 0, 0, "kp-numlock", /* 0xff78... */
"kp-space", /* 0xff80 */ /* IsKeypadKey */
0, 0, 0, 0, 0, 0, 0, 0,
"kp-tab", /* 0xff89 */
0, 0, 0,
"kp-enter", /* 0xff8d */
0, 0, 0,
"kp-f1", /* 0xff91 */
"kp-f2",
"kp-f3",
"kp-f4",
"kp-home", /* 0xff95 */
"kp-left",
"kp-up",
"kp-right",
"kp-down",
"kp-prior", /* kp-page-up */
"kp-next", /* kp-page-down */
"kp-end",
"kp-begin",
"kp-insert",
"kp-delete",
0, /* 0xffa0 */
0, 0, 0, 0, 0, 0, 0, 0, 0,
"kp-multiply", /* 0xffaa */
"kp-add",
"kp-separator",
"kp-subtract",
"kp-decimal",
"kp-divide", /* 0xffaf */
"kp-0", /* 0xffb0 */
"kp-1", "kp-2", "kp-3", "kp-4", "kp-5", "kp-6", "kp-7", "kp-8", "kp-9",
0, /* 0xffba */
0, 0,
"kp-equal", /* 0xffbd */
"f1", /* 0xffbe */ /* IsFunctionKey */
"f2",
"f3", "f4", "f5", "f6", "f7", "f8", "f9", "f10", /* 0xffc0 */
"f11", "f12", "f13", "f14", "f15", "f16", "f17", "f18",
"f19", "f20", "f21", "f22", "f23", "f24", "f25", "f26", /* 0xffd0 */
"f27", "f28", "f29", "f30", "f31", "f32", "f33", "f34",
"f35", 0, 0, 0, 0, 0, 0, 0, /* 0xffe0 */
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, /* 0xfff0 */
0, 0, 0, 0, 0, 0, 0, "delete"
};
/* ISO 9995 Function and Modifier Keys; the first byte is 0xFE. */
#define ISO_FUNCTION_KEY_OFFSET 0xfe00
static const char *const iso_lispy_function_keys[] =
{
0, 0, 0, 0, 0, 0, 0, 0, /* 0xfe00 */
0, 0, 0, 0, 0, 0, 0, 0, /* 0xfe08 */
0, 0, 0, 0, 0, 0, 0, 0, /* 0xfe10 */
0, 0, 0, 0, 0, 0, 0, 0, /* 0xfe18 */
"iso-lefttab", /* 0xfe20 */
"iso-move-line-up", "iso-move-line-down",
"iso-partial-line-up", "iso-partial-line-down",
"iso-partial-space-left", "iso-partial-space-right",
"iso-set-margin-left", "iso-set-margin-right", /* 0xffe27, 28 */
"iso-release-margin-left", "iso-release-margin-right",
"iso-release-both-margins",
"iso-fast-cursor-left", "iso-fast-cursor-right",
"iso-fast-cursor-up", "iso-fast-cursor-down",
"iso-continuous-underline", "iso-discontinuous-underline", /* 0xfe30, 31 */
"iso-emphasize", "iso-center-object", "iso-enter", /* ... 0xfe34 */
};
#endif /* not HAVE_NTGUI */
static Lisp_Object Vlispy_mouse_stem;
static const char *const lispy_wheel_names[] =
{
"wheel-up", "wheel-down", "wheel-left", "wheel-right"
};
/* drag-n-drop events are generated when a set of selected files are
dragged from another application and dropped onto an Emacs window. */
static const char *const lispy_drag_n_drop_names[] =
{
"drag-n-drop"
};
/* An array of symbol indexes of scroll bar parts, indexed by an enum
scroll_bar_part value. Note that Qnil corresponds to
scroll_bar_nowhere and should not appear in Lisp events. */
static short const scroll_bar_parts[] = {
SYMBOL_INDEX (Qnil), SYMBOL_INDEX (Qabove_handle), SYMBOL_INDEX (Qhandle),
SYMBOL_INDEX (Qbelow_handle), SYMBOL_INDEX (Qup), SYMBOL_INDEX (Qdown),
SYMBOL_INDEX (Qtop), SYMBOL_INDEX (Qbottom), SYMBOL_INDEX (Qend_scroll),
SYMBOL_INDEX (Qratio), SYMBOL_INDEX (Qbefore_handle),
SYMBOL_INDEX (Qhorizontal_handle), SYMBOL_INDEX (Qafter_handle),
SYMBOL_INDEX (Qleft), SYMBOL_INDEX (Qright), SYMBOL_INDEX (Qleftmost),
SYMBOL_INDEX (Qrightmost), SYMBOL_INDEX (Qend_scroll), SYMBOL_INDEX (Qratio)
};
#ifdef HAVE_WINDOW_SYSTEM
/* An array of symbol indexes of internal border parts, indexed by an enum
internal_border_part value. Note that Qnil corresponds to
internal_border_part_none and should not appear in Lisp events. */
static short const internal_border_parts[] = {
SYMBOL_INDEX (Qnil), SYMBOL_INDEX (Qleft_edge),
SYMBOL_INDEX (Qtop_left_corner), SYMBOL_INDEX (Qtop_edge),
SYMBOL_INDEX (Qtop_right_corner), SYMBOL_INDEX (Qright_edge),
SYMBOL_INDEX (Qbottom_right_corner), SYMBOL_INDEX (Qbottom_edge),
SYMBOL_INDEX (Qbottom_left_corner)
};
#endif
/* A vector, indexed by button number, giving the down-going location
of currently depressed buttons, both scroll bar and non-scroll bar.
The elements have the form
(BUTTON-NUMBER MODIFIER-MASK . REST)
where REST is the cdr of a position as it would be reported in the event.
The make_lispy_event function stores positions here to tell the
difference between click and drag events, and to store the starting
location to be included in drag events. */
static Lisp_Object button_down_location;
/* A cons recording the original frame-relative x and y coordinates of
the down mouse event. */
static Lisp_Object frame_relative_event_pos;
/* Information about the most recent up-going button event: Which
button, what location, and what time. */
static int last_mouse_button;
static int last_mouse_x;
static int last_mouse_y;
static Time button_down_time;
/* The number of clicks in this multiple-click. */
static int double_click_count;
/* X and Y are frame-relative coordinates for a click or wheel event.
Return a Lisp-style event list. */
static Lisp_Object
make_lispy_position (struct frame *f, Lisp_Object x, Lisp_Object y,
Time t)
{
enum window_part part;
Lisp_Object posn = Qnil;
Lisp_Object extra_info = Qnil;
/* Coordinate pixel positions to return. */
int xret = 0, yret = 0;
/* The window or frame under frame pixel coordinates (x,y) */
Lisp_Object window_or_frame = f
? window_from_coordinates (f, XFIXNUM (x), XFIXNUM (y), &part, 0, 0)
: Qnil;
if (WINDOWP (window_or_frame))
{
/* It's a click in window WINDOW at frame coordinates (X,Y) */
struct window *w = XWINDOW (window_or_frame);
Lisp_Object string_info = Qnil;
ptrdiff_t textpos = 0;
int col = -1, row = -1;
int dx = -1, dy = -1;
int width = -1, height = -1;
Lisp_Object object = Qnil;
/* Pixel coordinates relative to the window corner. */
int wx = XFIXNUM (x) - WINDOW_LEFT_EDGE_X (w);
int wy = XFIXNUM (y) - WINDOW_TOP_EDGE_Y (w);
/* For text area clicks, return X, Y relative to the corner of
this text area. Note that dX, dY etc are set below, by
buffer_posn_from_coords. */
if (part == ON_TEXT)
{
xret = XFIXNUM (x) - window_box_left (w, TEXT_AREA);
yret = wy - WINDOW_TAB_LINE_HEIGHT (w) - WINDOW_HEADER_LINE_HEIGHT (w);
}
/* For mode line and header line clicks, return X, Y relative to
the left window edge. Use mode_line_string to look for a
string on the click position. */
else if (part == ON_MODE_LINE || part == ON_TAB_LINE
|| part == ON_HEADER_LINE)
{
Lisp_Object string;
ptrdiff_t charpos;
posn = (part == ON_MODE_LINE ? Qmode_line
: (part == ON_TAB_LINE ? Qtab_line
: Qheader_line));
/* Note that mode_line_string takes COL, ROW as pixels and
converts them to characters. */
col = wx;
row = wy;
string = mode_line_string (w, part, &col, &row, &charpos,
&object, &dx, &dy, &width, &height);
if (STRINGP (string))
string_info = Fcons (string, make_fixnum (charpos));
textpos = -1;
xret = wx;
yret = wy;
}
/* For fringes and margins, Y is relative to the area's (and the
window's) top edge, while X is meaningless. */
else if (part == ON_LEFT_MARGIN || part == ON_RIGHT_MARGIN)
{
Lisp_Object string;
ptrdiff_t charpos;
posn = (part == ON_LEFT_MARGIN) ? Qleft_margin : Qright_margin;
col = wx;
row = wy;
string = marginal_area_string (w, part, &col, &row, &charpos,
&object, &dx, &dy, &width, &height);
if (STRINGP (string))
string_info = Fcons (string, make_fixnum (charpos));
xret = wx;
yret = wy - WINDOW_TAB_LINE_HEIGHT (w) - WINDOW_HEADER_LINE_HEIGHT (w);
}
else if (part == ON_LEFT_FRINGE)
{
posn = Qleft_fringe;
col = 0;
xret = wx;
dx = wx
- (WINDOW_HAS_FRINGES_OUTSIDE_MARGINS (w)
? 0 : window_box_width (w, LEFT_MARGIN_AREA));
dy = yret = wy - WINDOW_TAB_LINE_HEIGHT (w) - WINDOW_HEADER_LINE_HEIGHT (w);
}
else if (part == ON_RIGHT_FRINGE)
{
posn = Qright_fringe;
col = 0;
xret = wx;
dx = wx
- window_box_width (w, LEFT_MARGIN_AREA)
- window_box_width (w, TEXT_AREA)
- (WINDOW_HAS_FRINGES_OUTSIDE_MARGINS (w)
? window_box_width (w, RIGHT_MARGIN_AREA)
: 0);
dy = yret = wy - WINDOW_TAB_LINE_HEIGHT (w) - WINDOW_HEADER_LINE_HEIGHT (w);
}
else if (part == ON_VERTICAL_BORDER)
{
posn = Qvertical_line;
width = 1;
dx = 0;
xret = wx;
dy = yret = wy;
}
else if (part == ON_VERTICAL_SCROLL_BAR)
{
posn = Qvertical_scroll_bar;
width = WINDOW_SCROLL_BAR_AREA_WIDTH (w);
dx = xret = wx;
dy = yret = wy;
}
else if (part == ON_HORIZONTAL_SCROLL_BAR)
{
posn = Qhorizontal_scroll_bar;
width = WINDOW_SCROLL_BAR_AREA_HEIGHT (w);
dx = xret = wx;
dy = yret = wy;
}
else if (part == ON_RIGHT_DIVIDER)
{
posn = Qright_divider;
width = WINDOW_RIGHT_DIVIDER_WIDTH (w);
dx = xret = wx;
dy = yret = wy;
}
else if (part == ON_BOTTOM_DIVIDER)
{
posn = Qbottom_divider;
width = WINDOW_BOTTOM_DIVIDER_WIDTH (w);
dx = xret = wx;
dy = yret = wy;
}
/* For clicks in the text area, fringes, margins, or vertical
scroll bar, call buffer_posn_from_coords to extract TEXTPOS,
the buffer position nearest to the click. */
if (!textpos)
{
Lisp_Object string2, object2 = Qnil;
struct display_pos p;
int dx2, dy2;
int width2, height2;
/* The pixel X coordinate passed to buffer_posn_from_coords
is the X coordinate relative to the text area for clicks
in text-area, right-margin/fringe and right-side vertical
scroll bar, zero otherwise. */
int x2
= (part == ON_TEXT) ? xret
: (part == ON_RIGHT_FRINGE || part == ON_RIGHT_MARGIN
|| (part == ON_VERTICAL_SCROLL_BAR
&& WINDOW_HAS_VERTICAL_SCROLL_BAR_ON_RIGHT (w)))
? (XFIXNUM (x) - window_box_left (w, TEXT_AREA))
: 0;
int y2 = wy;
string2 = buffer_posn_from_coords (w, &x2, &y2, &p,
&object2, &dx2, &dy2,
&width2, &height2);
textpos = CHARPOS (p.pos);
if (col < 0) col = x2;
if (row < 0) row = y2;
if (dx < 0) dx = dx2;
if (dy < 0) dy = dy2;
if (width < 0) width = width2;
if (height < 0) height = height2;
if (NILP (posn))
{
posn = make_fixnum (textpos);
if (STRINGP (string2))
string_info = Fcons (string2,
make_fixnum (CHARPOS (p.string_pos)));
}
if (NILP (object))
object = object2;
}
#ifdef HAVE_WINDOW_SYSTEM
if (IMAGEP (object))
{
Lisp_Object image_map, hotspot;
if ((image_map = Fplist_get (XCDR (object), QCmap),
!NILP (image_map))
&& (hotspot = find_hot_spot (image_map, dx, dy),
CONSP (hotspot))
&& (hotspot = XCDR (hotspot), CONSP (hotspot)))
posn = XCAR (hotspot);
}
#endif
/* Object info. */
extra_info
= list3 (object,
Fcons (make_fixnum (dx), make_fixnum (dy)),
Fcons (make_fixnum (width), make_fixnum (height)));
/* String info. */
extra_info = Fcons (string_info,
Fcons (textpos < 0 ? Qnil : make_fixnum (textpos),
Fcons (Fcons (make_fixnum (col),
make_fixnum (row)),
extra_info)));
}
else if (f)
{
/* Return mouse pixel coordinates here. */
XSETFRAME (window_or_frame, f);
xret = XFIXNUM (x);
yret = XFIXNUM (y);
#ifdef HAVE_WINDOW_SYSTEM
if (FRAME_WINDOW_P (f)
&& FRAME_LIVE_P (f)
&& FRAME_INTERNAL_BORDER_WIDTH (f) > 0
&& !NILP (get_frame_param (f, Qdrag_internal_border)))
{
enum internal_border_part part
= frame_internal_border_part (f, xret, yret);
posn = builtin_lisp_symbol (internal_border_parts[part]);
}
#endif
}
else
window_or_frame = Qnil;
return Fcons (window_or_frame,
Fcons (posn,
Fcons (Fcons (make_fixnum (xret),
make_fixnum (yret)),
Fcons (INT_TO_INTEGER (t),
extra_info))));
}
/* Return non-zero if F is a GUI frame that uses some toolkit-managed
menu bar. This really means that Emacs draws and manages the menu
bar as part of its normal display, and therefore can compute its
geometry. */
static bool
toolkit_menubar_in_use (struct frame *f)
{
#ifdef HAVE_EXT_MENU_BAR
return !(!FRAME_WINDOW_P (f));
#else
return false;
#endif
}
/* Build the part of Lisp event which represents scroll bar state from
EV. TYPE is one of Qvertical_scroll_bar or Qhorizontal_scroll_bar. */
static Lisp_Object
make_scroll_bar_position (struct input_event *ev, Lisp_Object type)
{
return list5 (ev->frame_or_window, type, Fcons (ev->x, ev->y),
INT_TO_INTEGER (ev->timestamp),
builtin_lisp_symbol (scroll_bar_parts[ev->part]));
}
/* Given a struct input_event, build the lisp event which represents
it. If EVENT is 0, build a mouse movement event from the mouse
movement buffer, which should have a movement event in it.
Note that events must be passed to this function in the order they
are received; this function stores the location of button presses
in order to build drag events when the button is released. */
static Lisp_Object
make_lispy_event (struct input_event *event)
{
int i;
switch (event->kind)
{
#ifdef HAVE_WINDOW_SYSTEM
case DELETE_WINDOW_EVENT:
/* Make an event (delete-frame (FRAME)). */
return list2 (Qdelete_frame, list1 (event->frame_or_window));
case ICONIFY_EVENT:
/* Make an event (iconify-frame (FRAME)). */
return list2 (Qiconify_frame, list1 (event->frame_or_window));
case DEICONIFY_EVENT:
/* Make an event (make-frame-visible (FRAME)). */
return list2 (Qmake_frame_visible, list1 (event->frame_or_window));
case MOVE_FRAME_EVENT:
/* Make an event (move-frame (FRAME)). */
return list2 (Qmove_frame, list1 (event->frame_or_window));
#endif
/* Just discard these, by returning nil.
With MULTI_KBOARD, these events are used as placeholders
when we need to randomly delete events from the queue.
(They shouldn't otherwise be found in the buffer,
but on some machines it appears they do show up
even without MULTI_KBOARD.) */
/* On Windows NT/9X, NO_EVENT is used to delete extraneous
mouse events during a popup-menu call. */
case NO_EVENT:
return Qnil;
case HELP_EVENT:
{
Lisp_Object frame = event->frame_or_window;
Lisp_Object object = event->arg;
Lisp_Object position
= make_fixnum (Time_to_position (event->timestamp));
Lisp_Object window = event->x;
Lisp_Object help = event->y;
clear_event (event);
if (!WINDOWP (window))
window = Qnil;
return Fcons (Qhelp_echo,
list5 (frame, help, window, object, position));
}
case FOCUS_IN_EVENT:
return make_lispy_focus_in (event->frame_or_window);
case FOCUS_OUT_EVENT:
return make_lispy_focus_out (event->frame_or_window);
/* A simple keystroke. */
case ASCII_KEYSTROKE_EVENT:
case MULTIBYTE_CHAR_KEYSTROKE_EVENT:
{
Lisp_Object lispy_c;
EMACS_INT c = event->code;
if (event->kind == ASCII_KEYSTROKE_EVENT)
{
c &= 0377;
eassert (c == event->code);
}
/* Caps-lock shouldn't affect interpretation of key chords:
Control+s should produce C-s whether caps-lock is on or
not. And Control+Shift+s should produce C-S-s whether
caps-lock is on or not. */
if (event->modifiers & ~shift_modifier)
{
/* This is a key chord: some non-shift modifier is
depressed. */
if (uppercasep (c) &&
!(event->modifiers & shift_modifier))
{
/* Got a capital letter without a shift. The caps
lock is on. Un-capitalize the letter. */
c = downcase (c);
}
else if (lowercasep (c) &&
(event->modifiers & shift_modifier))
{
/* Got a lower-case letter even though shift is
depressed. The caps lock is on. Capitalize the
letter. */
c = upcase (c);
}
}
if (event->kind == ASCII_KEYSTROKE_EVENT)
{
/* Turn ASCII characters into control characters
when proper. */
if (event->modifiers & ctrl_modifier)
{
c = make_ctrl_char (c);
event->modifiers &= ~ctrl_modifier;
}
}
/* Add in the other modifier bits. The shift key was taken care
of by the X code. */
c |= (event->modifiers
& (meta_modifier | alt_modifier
| hyper_modifier | super_modifier | ctrl_modifier));
/* Distinguish Shift-SPC from SPC. */
if ((event->code) == 040
&& event->modifiers & shift_modifier)
c |= shift_modifier;
button_down_time = 0;
XSETFASTINT (lispy_c, c);
return lispy_c;
}
#ifdef HAVE_NS
case NS_TEXT_EVENT:
return list1 (intern (event->code == KEY_NS_PUT_WORKING_TEXT
? "ns-put-working-text"
: "ns-unput-working-text"));
/* NS_NONKEY_EVENTs are just like NON_ASCII_KEYSTROKE_EVENTs,
except that they are non-key events (last-nonmenu-event is nil). */
case NS_NONKEY_EVENT:
#endif
/* A function key. The symbol may need to have modifier prefixes
tacked onto it. */
case NON_ASCII_KEYSTROKE_EVENT:
button_down_time = 0;
for (i = 0; i < ARRAYELTS (lispy_accent_codes); i++)
if (event->code == lispy_accent_codes[i])
return modify_event_symbol (i,
event->modifiers,
Qfunction_key, Qnil,
lispy_accent_keys, &accent_key_syms,
ARRAYELTS (lispy_accent_keys));
#if 0
#ifdef XK_kana_A
if (event->code >= 0x400 && event->code < 0x500)
return modify_event_symbol (event->code - 0x400,
event->modifiers & ~shift_modifier,
Qfunction_key, Qnil,
lispy_kana_keys, &func_key_syms,
ARRAYELTS (lispy_kana_keys));
#endif /* XK_kana_A */
#endif /* 0 */
#ifdef ISO_FUNCTION_KEY_OFFSET
if (event->code < FUNCTION_KEY_OFFSET
&& event->code >= ISO_FUNCTION_KEY_OFFSET)
return modify_event_symbol (event->code - ISO_FUNCTION_KEY_OFFSET,
event->modifiers,
Qfunction_key, Qnil,
iso_lispy_function_keys, &func_key_syms,
ARRAYELTS (iso_lispy_function_keys));
#endif
if ((FUNCTION_KEY_OFFSET <= event->code
&& (event->code
< FUNCTION_KEY_OFFSET + ARRAYELTS (lispy_function_keys)))
&& lispy_function_keys[event->code - FUNCTION_KEY_OFFSET])
return modify_event_symbol (event->code - FUNCTION_KEY_OFFSET,
event->modifiers,
Qfunction_key, Qnil,
lispy_function_keys, &func_key_syms,
ARRAYELTS (lispy_function_keys));
/* Handle system-specific or unknown keysyms.
We need to use an alist rather than a vector as the cache
since we can't make a vector long enough. */
if (NILP (KVAR (current_kboard, system_key_syms)))
kset_system_key_syms (current_kboard, Fcons (Qnil, Qnil));
return modify_event_symbol (event->code,
event->modifiers,
Qfunction_key,
KVAR (current_kboard, Vsystem_key_alist),
0, &KVAR (current_kboard, system_key_syms),
PTRDIFF_MAX);
#ifdef HAVE_NTGUI
case END_SESSION_EVENT:
/* Make an event (end-session). */
return list1 (Qend_session);
case LANGUAGE_CHANGE_EVENT:
/* Make an event (language-change FRAME CODEPAGE LANGUAGE-ID). */
return list4 (Qlanguage_change,
event->frame_or_window,
make_fixnum (event->code),
make_fixnum (event->modifiers));
case MULTIMEDIA_KEY_EVENT:
if (event->code < ARRAYELTS (lispy_multimedia_keys)
&& event->code > 0 && lispy_multimedia_keys[event->code])
{
return modify_event_symbol (event->code, event->modifiers,
Qfunction_key, Qnil,
lispy_multimedia_keys, &func_key_syms,
ARRAYELTS (lispy_multimedia_keys));
}
return Qnil;
#endif
/* A mouse click. Figure out where it is, decide whether it's
a press, click or drag, and build the appropriate structure. */
case MOUSE_CLICK_EVENT:
#ifndef USE_TOOLKIT_SCROLL_BARS
case SCROLL_BAR_CLICK_EVENT:
case HORIZONTAL_SCROLL_BAR_CLICK_EVENT:
#endif
{
int button = event->code;
bool is_double;
Lisp_Object position;
Lisp_Object *start_pos_ptr;
Lisp_Object start_pos;
position = Qnil;
/* Build the position as appropriate for this mouse click. */
if (event->kind == MOUSE_CLICK_EVENT)
{
struct frame *f = XFRAME (event->frame_or_window);
int row, column;
/* Ignore mouse events that were made on frame that
have been deleted. */
if (! FRAME_LIVE_P (f))
return Qnil;
/* EVENT->x and EVENT->y are frame-relative pixel
coordinates at this place. Under old redisplay, COLUMN
and ROW are set to frame relative glyph coordinates
which are then used to determine whether this click is
in a menu (non-toolkit version). */
if (!toolkit_menubar_in_use (f))
{
pixel_to_glyph_coords (f, XFIXNUM (event->x), XFIXNUM (event->y),
&column, &row, NULL, 1);
/* In the non-toolkit version, clicks on the menu bar
are ordinary button events in the event buffer.
Distinguish them, and invoke the menu.
(In the toolkit version, the toolkit handles the
menu bar and Emacs doesn't know about it until
after the user makes a selection.) */
if (row >= 0 && row < FRAME_MENU_BAR_LINES (f)
&& (event->modifiers & down_modifier))
{
Lisp_Object items, item;
/* Find the menu bar item under `column'. */
item = Qnil;
items = FRAME_MENU_BAR_ITEMS (f);
for (i = 0; i < ASIZE (items); i += 4)
{
Lisp_Object pos, string;
string = AREF (items, i + 1);
pos = AREF (items, i + 3);
if (NILP (string))
break;
if (column >= XFIXNUM (pos)
&& column < XFIXNUM (pos) + SCHARS (string))
{
item = AREF (items, i);
break;
}
}
/* ELisp manual 2.4b says (x y) are window
relative but code says they are
frame-relative. */
position = list4 (event->frame_or_window,
Qmenu_bar,
Fcons (event->x, event->y),
INT_TO_INTEGER (event->timestamp));
return list2 (item, position);
}
}
position = make_lispy_position (f, event->x, event->y,
event->timestamp);
}
#ifndef USE_TOOLKIT_SCROLL_BARS
else
/* It's a scrollbar click. */
position = make_scroll_bar_position (event, Qvertical_scroll_bar);
#endif /* not USE_TOOLKIT_SCROLL_BARS */
if (button >= ASIZE (button_down_location))
{
ptrdiff_t incr = button - ASIZE (button_down_location) + 1;
button_down_location = larger_vector (button_down_location,
incr, -1);
mouse_syms = larger_vector (mouse_syms, incr, -1);
}
start_pos_ptr = aref_addr (button_down_location, button);
start_pos = *start_pos_ptr;
*start_pos_ptr = Qnil;
{
/* On window-system frames, use the value of
double-click-fuzz as is. On other frames, interpret it
as a multiple of 1/8 characters. */
struct frame *f;
intmax_t fuzz;
if (WINDOWP (event->frame_or_window))
f = XFRAME (XWINDOW (event->frame_or_window)->frame);
else if (FRAMEP (event->frame_or_window))
f = XFRAME (event->frame_or_window);
else
emacs_abort ();
if (FRAME_WINDOW_P (f))
fuzz = double_click_fuzz;
else
fuzz = double_click_fuzz / 8;
is_double = (button == last_mouse_button
&& (eabs (XFIXNUM (event->x) - last_mouse_x) <= fuzz)
&& (eabs (XFIXNUM (event->y) - last_mouse_y) <= fuzz)
&& button_down_time != 0
&& (EQ (Vdouble_click_time, Qt)
|| (FIXNATP (Vdouble_click_time)
&& (event->timestamp - button_down_time
< XFIXNAT (Vdouble_click_time)))));
}
last_mouse_button = button;
last_mouse_x = XFIXNUM (event->x);
last_mouse_y = XFIXNUM (event->y);
/* If this is a button press, squirrel away the location, so
we can decide later whether it was a click or a drag. */
if (event->modifiers & down_modifier)
{
if (is_double)
{
double_click_count++;
event->modifiers |= ((double_click_count > 2)
? triple_modifier
: double_modifier);
}
else
double_click_count = 1;
button_down_time = event->timestamp;
*start_pos_ptr = Fcopy_alist (position);
frame_relative_event_pos = Fcons (event->x, event->y);
ignore_mouse_drag_p = false;
}
/* Now we're releasing a button - check the coordinates to
see if this was a click or a drag. */
else if (event->modifiers & up_modifier)
{
/* If we did not see a down before this up, ignore the up.
Probably this happened because the down event chose a
menu item. It would be an annoyance to treat the
release of the button that chose the menu item as a
separate event. */
if (!CONSP (start_pos))
return Qnil;
unsigned click_or_drag_modifier = click_modifier;
if (ignore_mouse_drag_p)
ignore_mouse_drag_p = false;
else
{
intmax_t xdiff = double_click_fuzz, ydiff = double_click_fuzz;
xdiff = XFIXNUM (event->x)
- XFIXNUM (XCAR (frame_relative_event_pos));
ydiff = XFIXNUM (event->y)
- XFIXNUM (XCDR (frame_relative_event_pos));
if (! (0 < double_click_fuzz
&& - double_click_fuzz < xdiff
&& xdiff < double_click_fuzz
&& - double_click_fuzz < ydiff
&& ydiff < double_click_fuzz
/* Maybe the mouse has moved a lot, caused scrolling, and
eventually ended up at the same screen position (but
not buffer position) in which case it is a drag, not
a click. */
/* FIXME: OTOH if the buffer position has changed
because of a timer or process filter rather than
because of mouse movement, it should be considered as
a click. But mouse-drag-region completely ignores
this case and it hasn't caused any real problem, so
it's probably OK to ignore it as well. */
&& (EQ (Fcar (Fcdr (start_pos)),
Fcar (Fcdr (position))) /* Same buffer pos */
|| !EQ (Fcar (start_pos),
Fcar (position))))) /* Different window */
{
/* Mouse has moved enough. */
button_down_time = 0;
click_or_drag_modifier = drag_modifier;
}
else if (((!EQ (Fcar (start_pos), Fcar (position)))
|| (!EQ (Fcar (Fcdr (start_pos)),
Fcar (Fcdr (position)))))
/* Was the down event in a window body? */
&& FIXNUMP (Fcar (Fcdr (start_pos)))
&& WINDOW_LIVE_P (Fcar (start_pos))
&& !NILP (Ffboundp (Qwindow_edges)))
/* If the window (etc.) at the mouse position has
changed between the down event and the up event,
we assume there's been a redisplay between the
two events, and we pretend the mouse is still in
the old window to prevent a spurious drag event
being generated. */
{
Lisp_Object edges
= call4 (Qwindow_edges, Fcar (start_pos), Qt, Qnil, Qt);
int new_x = XFIXNUM (Fcar (frame_relative_event_pos));
int new_y = XFIXNUM (Fcdr (frame_relative_event_pos));
/* If the up-event is outside the down-event's
window, use coordinates that are within it. */
if (new_x < XFIXNUM (Fcar (edges)))
new_x = XFIXNUM (Fcar (edges));
else if (new_x >= XFIXNUM (Fcar (Fcdr (Fcdr (edges)))))
new_x = XFIXNUM (Fcar (Fcdr (Fcdr (edges)))) - 1;
if (new_y < XFIXNUM (Fcar (Fcdr (edges))))
new_y = XFIXNUM (Fcar (Fcdr (edges)));
else if (new_y
>= XFIXNUM (Fcar (Fcdr (Fcdr (Fcdr (edges))))))
new_y = XFIXNUM (Fcar (Fcdr (Fcdr (Fcdr (edges))))) - 1;
position = make_lispy_position
(XFRAME (event->frame_or_window),
make_fixnum (new_x), make_fixnum (new_y),
event->timestamp);
}
}
/* Don't check is_double; treat this as multiple if the
down-event was multiple. */
event->modifiers
= ((event->modifiers & ~up_modifier)
| click_or_drag_modifier
| (double_click_count < 2 ? 0
: double_click_count == 2 ? double_modifier
: triple_modifier));
}
else
/* Every mouse event should either have the down_modifier or
the up_modifier set. */
emacs_abort ();
{
/* Get the symbol we should use for the mouse click. */
Lisp_Object head;
head = modify_event_symbol (button,
event->modifiers,
Qmouse_click, Vlispy_mouse_stem,
NULL,
&mouse_syms,
ASIZE (mouse_syms));
if (event->modifiers & drag_modifier)
return list3 (head, start_pos, position);
else if (event->modifiers & (double_modifier | triple_modifier))
return list3 (head, position, make_fixnum (double_click_count));
else
return list2 (head, position);
}
}
case WHEEL_EVENT:
case HORIZ_WHEEL_EVENT:
{
Lisp_Object position;
Lisp_Object head;
/* Build the position as appropriate for this mouse click. */
struct frame *f = XFRAME (event->frame_or_window);
/* Ignore wheel events that were made on frame that have been
deleted. */
if (! FRAME_LIVE_P (f))
return Qnil;
position = make_lispy_position (f, event->x, event->y,
event->timestamp);
/* Set double or triple modifiers to indicate the wheel speed. */
{
/* On window-system frames, use the value of
double-click-fuzz as is. On other frames, interpret it
as a multiple of 1/8 characters. */
struct frame *fr;
intmax_t fuzz;
int symbol_num;
bool is_double;
if (WINDOWP (event->frame_or_window))
fr = XFRAME (XWINDOW (event->frame_or_window)->frame);
else if (FRAMEP (event->frame_or_window))
fr = XFRAME (event->frame_or_window);
else
emacs_abort ();
fuzz = FRAME_WINDOW_P (fr)
? double_click_fuzz : double_click_fuzz / 8;
if (event->modifiers & up_modifier)
{
/* Emit a wheel-up event. */
event->modifiers &= ~up_modifier;
symbol_num = 0;
}
else if (event->modifiers & down_modifier)
{
/* Emit a wheel-down event. */
event->modifiers &= ~down_modifier;
symbol_num = 1;
}
else
/* Every wheel event should either have the down_modifier or
the up_modifier set. */
emacs_abort ();
if (event->kind == HORIZ_WHEEL_EVENT)
symbol_num += 2;
is_double = (last_mouse_button == - (1 + symbol_num)
&& (eabs (XFIXNUM (event->x) - last_mouse_x) <= fuzz)
&& (eabs (XFIXNUM (event->y) - last_mouse_y) <= fuzz)
&& button_down_time != 0
&& (EQ (Vdouble_click_time, Qt)
|| (FIXNATP (Vdouble_click_time)
&& (event->timestamp - button_down_time
< XFIXNAT (Vdouble_click_time)))));
if (is_double)
{
double_click_count++;
event->modifiers |= ((double_click_count > 2)
? triple_modifier
: double_modifier);
}
else
{
double_click_count = 1;
event->modifiers |= click_modifier;
}
button_down_time = event->timestamp;
/* Use a negative value to distinguish wheel from mouse button. */
last_mouse_button = - (1 + symbol_num);
last_mouse_x = XFIXNUM (event->x);
last_mouse_y = XFIXNUM (event->y);
/* Get the symbol we should use for the wheel event. */
head = modify_event_symbol (symbol_num,
event->modifiers,
Qmouse_click,
Qnil,
lispy_wheel_names,
&wheel_syms,
ASIZE (wheel_syms));
}
if (NUMBERP (event->arg))
return list4 (head, position, make_fixnum (double_click_count),
event->arg);
else if (event->modifiers & (double_modifier | triple_modifier))
return list3 (head, position, make_fixnum (double_click_count));
else
return list2 (head, position);
}
#ifdef USE_TOOLKIT_SCROLL_BARS
/* We don't have down and up events if using toolkit scroll bars,
so make this always a click event. Store in the `part' of
the Lisp event a symbol which maps to the following actions:
`above_handle' page up
`below_handle' page down
`up' line up
`down' line down
`top' top of buffer
`bottom' bottom of buffer
`handle' thumb has been dragged.
`end-scroll' end of interaction with scroll bar
The incoming input_event contains in its `part' member an
index of type `enum scroll_bar_part' which we can use as an
index in scroll_bar_parts to get the appropriate symbol. */
case SCROLL_BAR_CLICK_EVENT:
{
Lisp_Object position, head;
position = make_scroll_bar_position (event, Qvertical_scroll_bar);
/* Always treat scroll bar events as clicks. */
event->modifiers |= click_modifier;
event->modifiers &= ~up_modifier;
if (event->code >= ASIZE (mouse_syms))
mouse_syms = larger_vector (mouse_syms,
event->code - ASIZE (mouse_syms) + 1,
-1);
/* Get the symbol we should use for the mouse click. */
head = modify_event_symbol (event->code,
event->modifiers,
Qmouse_click,
Vlispy_mouse_stem,
NULL, &mouse_syms,
ASIZE (mouse_syms));
return list2 (head, position);
}
case HORIZONTAL_SCROLL_BAR_CLICK_EVENT:
{
Lisp_Object position, head;
position = make_scroll_bar_position (event, Qhorizontal_scroll_bar);
/* Always treat scroll bar events as clicks. */
event->modifiers |= click_modifier;
event->modifiers &= ~up_modifier;
if (event->code >= ASIZE (mouse_syms))
mouse_syms = larger_vector (mouse_syms,
event->code - ASIZE (mouse_syms) + 1,
-1);
/* Get the symbol we should use for the mouse click. */
head = modify_event_symbol (event->code,
event->modifiers,
Qmouse_click,
Vlispy_mouse_stem,
NULL, &mouse_syms,
ASIZE (mouse_syms));
return list2 (head, position);
}
#endif /* USE_TOOLKIT_SCROLL_BARS */
case DRAG_N_DROP_EVENT:
{
struct frame *f;
Lisp_Object head, position;
Lisp_Object files;
f = XFRAME (event->frame_or_window);
files = event->arg;
/* Ignore mouse events that were made on frames that
have been deleted. */
if (! FRAME_LIVE_P (f))
return Qnil;
position = make_lispy_position (f, event->x, event->y,
event->timestamp);
head = modify_event_symbol (0, event->modifiers,
Qdrag_n_drop, Qnil,
lispy_drag_n_drop_names,
&drag_n_drop_syms, 1);
return list3 (head, position, files);
}
#ifdef HAVE_EXT_MENU_BAR
case MENU_BAR_EVENT:
if (EQ (event->arg, event->frame_or_window))
/* This is the prefix key. We translate this to
`(menu_bar)' because the code in keyboard.c for menu
events, which we use, relies on this. */
return list1 (Qmenu_bar);
return event->arg;
#endif
case SELECT_WINDOW_EVENT:
/* Make an event (select-window (WINDOW)). */
return list2 (Qselect_window, list1 (event->frame_or_window));
case TAB_BAR_EVENT:
case TOOL_BAR_EVENT:
{
Lisp_Object res = event->arg;
Lisp_Object location
= event->kind == TAB_BAR_EVENT ? Qtab_bar : Qtool_bar;
if (SYMBOLP (res)) res = apply_modifiers (event->modifiers, res);
return list2 (res, list2 (event->frame_or_window, location));
}
case USER_SIGNAL_EVENT:
/* A user signal. */
{
char *name = find_user_signal_name (event->code);
if (!name)
emacs_abort ();
return intern (name);
}
case SAVE_SESSION_EVENT:
return list2 (Qsave_session, event->arg);
#ifdef HAVE_DBUS
case DBUS_EVENT:
{
return Fcons (Qdbus_event, event->arg);
}
#endif /* HAVE_DBUS */
#ifdef THREADS_ENABLED
case THREAD_EVENT:
{
return Fcons (Qthread_event, event->arg);
}
#endif /* THREADS_ENABLED */
#ifdef HAVE_XWIDGETS
case XWIDGET_EVENT:
{
return Fcons (Qxwidget_event, event->arg);
}
#endif
#ifdef USE_FILE_NOTIFY
case FILE_NOTIFY_EVENT:
#ifdef HAVE_W32NOTIFY
/* Make an event (file-notify (DESCRIPTOR ACTION FILE) CALLBACK). */
return list3 (Qfile_notify, event->arg, event->frame_or_window);
#else
return Fcons (Qfile_notify, event->arg);
#endif
#endif /* USE_FILE_NOTIFY */
case CONFIG_CHANGED_EVENT:
return list3 (Qconfig_changed_event,
event->arg, event->frame_or_window);
/* The 'kind' field of the event is something we don't recognize. */
default:
emacs_abort ();
}
}
static Lisp_Object
make_lispy_movement (struct frame *frame, Lisp_Object bar_window, enum scroll_bar_part part,
Lisp_Object x, Lisp_Object y, Time t)
{
/* Is it a scroll bar movement? */
if (frame && ! NILP (bar_window))
{
Lisp_Object part_sym;
part_sym = builtin_lisp_symbol (scroll_bar_parts[part]);
return list2 (Qscroll_bar_movement,
list5 (bar_window,
Qvertical_scroll_bar,
Fcons (x, y),
make_fixnum (t),
part_sym));
}
/* Or is it an ordinary mouse movement? */
else
{
Lisp_Object position;
position = make_lispy_position (frame, x, y, t);
return list2 (Qmouse_movement, position);
}
}
/* Construct a switch frame event. */
static Lisp_Object
make_lispy_switch_frame (Lisp_Object frame)
{
return list2 (Qswitch_frame, frame);
}
static Lisp_Object
make_lispy_focus_in (Lisp_Object frame)
{
return list2 (Qfocus_in, frame);
}
static Lisp_Object
make_lispy_focus_out (Lisp_Object frame)
{
return list2 (Qfocus_out, frame);
}
/* Manipulating modifiers. */
/* Parse the name of SYMBOL, and return the set of modifiers it contains.
If MODIFIER_END is non-zero, set *MODIFIER_END to the position in
SYMBOL's name of the end of the modifiers; the string from this
position is the unmodified symbol name.
This doesn't use any caches. */
static int
parse_modifiers_uncached (Lisp_Object symbol, ptrdiff_t *modifier_end)
{
Lisp_Object name;
ptrdiff_t i;
int modifiers;
CHECK_SYMBOL (symbol);
modifiers = 0;
name = SYMBOL_NAME (symbol);
for (i = 0; i < SBYTES (name) - 1; )
{
ptrdiff_t this_mod_end = 0;
int this_mod = 0;
/* See if the name continues with a modifier word.
Check that the word appears, but don't check what follows it.
Set this_mod and this_mod_end to record what we find. */
switch (SREF (name, i))
{
#define SINGLE_LETTER_MOD(BIT) \
(this_mod_end = i + 1, this_mod = BIT)
case 'A':
SINGLE_LETTER_MOD (alt_modifier);
break;
case 'C':
SINGLE_LETTER_MOD (ctrl_modifier);
break;
case 'H':
SINGLE_LETTER_MOD (hyper_modifier);
break;
case 'M':
SINGLE_LETTER_MOD (meta_modifier);
break;
case 'S':
SINGLE_LETTER_MOD (shift_modifier);
break;
case 's':
SINGLE_LETTER_MOD (super_modifier);
break;
#undef SINGLE_LETTER_MOD
#define MULTI_LETTER_MOD(BIT, NAME, LEN) \
if (i + LEN + 1 <= SBYTES (name) \
&& ! memcmp (SDATA (name) + i, NAME, LEN)) \
{ \
this_mod_end = i + LEN; \
this_mod = BIT; \
}
case 'd':
MULTI_LETTER_MOD (drag_modifier, "drag", 4);
MULTI_LETTER_MOD (down_modifier, "down", 4);
MULTI_LETTER_MOD (double_modifier, "double", 6);
break;
case 't':
MULTI_LETTER_MOD (triple_modifier, "triple", 6);
break;
case 'u':
MULTI_LETTER_MOD (up_modifier, "up", 2);
break;
#undef MULTI_LETTER_MOD
}
/* If we found no modifier, stop looking for them. */
if (this_mod_end == 0)
break;
/* Check there is a dash after the modifier, so that it
really is a modifier. */
if (this_mod_end >= SBYTES (name)
|| SREF (name, this_mod_end) != '-')
break;
/* This modifier is real; look for another. */
modifiers |= this_mod;
i = this_mod_end + 1;
}
/* Should we include the `click' modifier? */
if (! (modifiers & (down_modifier | drag_modifier
| double_modifier | triple_modifier))
&& i + 7 == SBYTES (name)
&& memcmp (SDATA (name) + i, "mouse-", 6) == 0
&& ('0' <= SREF (name, i + 6) && SREF (name, i + 6) <= '9'))
modifiers |= click_modifier;
if (! (modifiers & (double_modifier | triple_modifier))
&& i + 6 < SBYTES (name)
&& memcmp (SDATA (name) + i, "wheel-", 6) == 0)
modifiers |= click_modifier;
if (modifier_end)
*modifier_end = i;
return modifiers;
}
/* Return a symbol whose name is the modifier prefixes for MODIFIERS
prepended to the string BASE[0..BASE_LEN-1].
This doesn't use any caches. */
static Lisp_Object
apply_modifiers_uncached (int modifiers, char *base, int base_len, int base_len_byte)
{
/* Since BASE could contain nulls, we can't use intern here; we have
to use Fintern, which expects a genuine Lisp_String, and keeps a
reference to it. */
char new_mods[sizeof "A-C-H-M-S-s-up-down-drag-double-triple-"];
int mod_len;
{
char *p = new_mods;
/* Mouse events should not exhibit the `up' modifier once they
leave the event queue only accessible to C code; `up' will
always be turned into a click or drag event before being
presented to lisp code. But since lisp events can be
synthesized bypassing the event queue and pushed into
`unread-command-events' or its companions, it's better to just
deal with unexpected modifier combinations. */
if (modifiers & alt_modifier) { *p++ = 'A'; *p++ = '-'; }
if (modifiers & ctrl_modifier) { *p++ = 'C'; *p++ = '-'; }
if (modifiers & hyper_modifier) { *p++ = 'H'; *p++ = '-'; }
if (modifiers & meta_modifier) { *p++ = 'M'; *p++ = '-'; }
if (modifiers & shift_modifier) { *p++ = 'S'; *p++ = '-'; }
if (modifiers & super_modifier) { *p++ = 's'; *p++ = '-'; }
if (modifiers & double_modifier) p = stpcpy (p, "double-");
if (modifiers & triple_modifier) p = stpcpy (p, "triple-");
if (modifiers & up_modifier) p = stpcpy (p, "up-");
if (modifiers & down_modifier) p = stpcpy (p, "down-");
if (modifiers & drag_modifier) p = stpcpy (p, "drag-");
/* The click modifier is denoted by the absence of other modifiers. */
*p = '\0';
mod_len = p - new_mods;
}
{
Lisp_Object new_name;
new_name = make_uninit_multibyte_string (mod_len + base_len,
mod_len + base_len_byte);
memcpy (SDATA (new_name), new_mods, mod_len);
memcpy (SDATA (new_name) + mod_len, base, base_len_byte);
return Fintern (new_name, Qnil);
}
}
static const char *const modifier_names[] =
{
"up", "down", "drag", "click", "double", "triple", 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, "alt", "super", "hyper", "shift", "control", "meta"
};
#define NUM_MOD_NAMES ARRAYELTS (modifier_names)
static Lisp_Object modifier_symbols;
/* Return the list of modifier symbols corresponding to the mask MODIFIERS. */
static Lisp_Object
lispy_modifier_list (int modifiers)
{
Lisp_Object modifier_list;
int i;
modifier_list = Qnil;
for (i = 0; (1<<i) <= modifiers && i < NUM_MOD_NAMES; i++)
if (modifiers & (1<<i))
modifier_list = Fcons (AREF (modifier_symbols, i),
modifier_list);
return modifier_list;
}
/* Parse the modifiers on SYMBOL, and return a list like (UNMODIFIED MASK),
where UNMODIFIED is the unmodified form of SYMBOL,
MASK is the set of modifiers present in SYMBOL's name.
This is similar to parse_modifiers_uncached, but uses the cache in
SYMBOL's Qevent_symbol_element_mask property, and maintains the
Qevent_symbol_elements property. */
#define KEY_TO_CHAR(k) (XFIXNUM (k) & ((1 << CHARACTERBITS) - 1))
Lisp_Object
parse_modifiers (Lisp_Object symbol)
{
Lisp_Object elements;
if (FIXNUMP (symbol))
return list2i (KEY_TO_CHAR (symbol), XFIXNUM (symbol) & CHAR_MODIFIER_MASK);
else if (!SYMBOLP (symbol))
return Qnil;
elements = Fget (symbol, Qevent_symbol_element_mask);
if (CONSP (elements))
return elements;
else
{
ptrdiff_t end;
int modifiers = parse_modifiers_uncached (symbol, &end);
Lisp_Object unmodified;
Lisp_Object mask;
unmodified = Fintern (make_string (SSDATA (SYMBOL_NAME (symbol)) + end,
SBYTES (SYMBOL_NAME (symbol)) - end),
Qnil);
if (modifiers & ~INTMASK)
emacs_abort ();
XSETFASTINT (mask, modifiers);
elements = list2 (unmodified, mask);
/* Cache the parsing results on SYMBOL. */
Fput (symbol, Qevent_symbol_element_mask,
elements);
Fput (symbol, Qevent_symbol_elements,
Fcons (unmodified, lispy_modifier_list (modifiers)));
/* Since we know that SYMBOL is modifiers applied to unmodified,
it would be nice to put that in unmodified's cache.
But we can't, since we're not sure that parse_modifiers is
canonical. */
return elements;
}
}
DEFUN ("internal-event-symbol-parse-modifiers", Fevent_symbol_parse_modifiers,
Sevent_symbol_parse_modifiers, 1, 1, 0,
doc: /* Parse the event symbol. For internal use. */)
(Lisp_Object symbol)
{
/* Fill the cache if needed. */
parse_modifiers (symbol);
/* Ignore the result (which is stored on Qevent_symbol_element_mask)
and use the Lispier representation stored on Qevent_symbol_elements
instead. */
return Fget (symbol, Qevent_symbol_elements);
}
/* Apply the modifiers MODIFIERS to the symbol BASE.
BASE must be unmodified.
This is like apply_modifiers_uncached, but uses BASE's
Qmodifier_cache property, if present.
apply_modifiers copies the value of BASE's Qevent_kind property to
the modified symbol. */
static Lisp_Object
apply_modifiers (int modifiers, Lisp_Object base)
{
Lisp_Object cache, idx, entry, new_symbol;
/* Mask out upper bits. We don't know where this value's been. */
modifiers &= INTMASK;
if (FIXNUMP (base))
return make_fixnum (XFIXNUM (base) | modifiers);
/* The click modifier never figures into cache indices. */
cache = Fget (base, Qmodifier_cache);
XSETFASTINT (idx, (modifiers & ~click_modifier));
entry = assq_no_quit (idx, cache);
if (CONSP (entry))
new_symbol = XCDR (entry);
else
{
/* We have to create the symbol ourselves. */
new_symbol = apply_modifiers_uncached (modifiers,
SSDATA (SYMBOL_NAME (base)),
SCHARS (SYMBOL_NAME (base)),
SBYTES (SYMBOL_NAME (base)));
/* Add the new symbol to the base's cache. */
entry = Fcons (idx, new_symbol);
Fput (base, Qmodifier_cache, Fcons (entry, cache));
/* We have the parsing info now for free, so we could add it to
the caches:
XSETFASTINT (idx, modifiers);
Fput (new_symbol, Qevent_symbol_element_mask,
list2 (base, idx));
Fput (new_symbol, Qevent_symbol_elements,
Fcons (base, lispy_modifier_list (modifiers)));
Sadly, this is only correct if `base' is indeed a base event,
which is not necessarily the case. -stef */
}
/* Make sure this symbol is of the same kind as BASE.
You'd think we could just set this once and for all when we
intern the symbol above, but reorder_modifiers may call us when
BASE's property isn't set right; we can't assume that just
because it has a Qmodifier_cache property it must have its
Qevent_kind set right as well. */
if (NILP (Fget (new_symbol, Qevent_kind)))
{
Lisp_Object kind;
kind = Fget (base, Qevent_kind);
if (! NILP (kind))
Fput (new_symbol, Qevent_kind, kind);
}
return new_symbol;
}
/* Given a symbol whose name begins with modifiers ("C-", "M-", etc),
return a symbol with the modifiers placed in the canonical order.
Canonical order is alphabetical, except for down and drag, which
always come last. The 'click' modifier is never written out.
Fdefine_key calls this to make sure that (for example) C-M-foo
and M-C-foo end up being equivalent in the keymap. */
Lisp_Object
reorder_modifiers (Lisp_Object symbol)
{
/* It's hopefully okay to write the code this way, since everything
will soon be in caches, and no consing will be done at all. */
Lisp_Object parsed;
parsed = parse_modifiers (symbol);
return apply_modifiers (XFIXNAT (XCAR (XCDR (parsed))),
XCAR (parsed));
}
/* For handling events, we often want to produce a symbol whose name
is a series of modifier key prefixes ("M-", "C-", etcetera) attached
to some base, like the name of a function key or mouse button.
modify_event_symbol produces symbols of this sort.
NAME_TABLE should point to an array of strings, such that NAME_TABLE[i]
is the name of the i'th symbol. TABLE_SIZE is the number of elements
in the table.
Alternatively, NAME_ALIST_OR_STEM is either an alist mapping codes
into symbol names, or a string specifying a name stem used to
construct a symbol name or the form `STEM-N', where N is the decimal
representation of SYMBOL_NUM. NAME_ALIST_OR_STEM is used if it is
non-nil; otherwise NAME_TABLE is used.
SYMBOL_TABLE should be a pointer to a Lisp_Object whose value will
persist between calls to modify_event_symbol that it can use to
store a cache of the symbols it's generated for this NAME_TABLE
before. The object stored there may be a vector or an alist.
SYMBOL_NUM is the number of the base name we want from NAME_TABLE.
MODIFIERS is a set of modifier bits (as given in struct input_events)
whose prefixes should be applied to the symbol name.
SYMBOL_KIND is the value to be placed in the event_kind property of
the returned symbol.
The symbols we create are supposed to have an
`event-symbol-elements' property, which lists the modifiers present
in the symbol's name. */
static Lisp_Object
modify_event_symbol (ptrdiff_t symbol_num, int modifiers, Lisp_Object symbol_kind,
Lisp_Object name_alist_or_stem, const char *const *name_table,
Lisp_Object *symbol_table, ptrdiff_t table_size)
{
Lisp_Object value;
Lisp_Object symbol_int;
/* Get rid of the "vendor-specific" bit here. */
XSETINT (symbol_int, symbol_num & 0xffffff);
/* Is this a request for a valid symbol? */
if (symbol_num < 0 || symbol_num >= table_size)
return Qnil;
if (CONSP (*symbol_table))
value = Fcdr (assq_no_quit (symbol_int, *symbol_table));
/* If *symbol_table doesn't seem to be initialized properly, fix that.
*symbol_table should be a lisp vector TABLE_SIZE elements long,
where the Nth element is the symbol for NAME_TABLE[N], or nil if
we've never used that symbol before. */
else
{
if (! VECTORP (*symbol_table)
|| ASIZE (*symbol_table) != table_size)
*symbol_table = make_nil_vector (table_size);
value = AREF (*symbol_table, symbol_num);
}
/* Have we already used this symbol before? */
if (NILP (value))
{
/* No; let's create it. */
if (CONSP (name_alist_or_stem))
value = Fcdr_safe (Fassq (symbol_int, name_alist_or_stem));
else if (STRINGP (name_alist_or_stem))
{
char *buf;
ptrdiff_t len = (SBYTES (name_alist_or_stem)
+ sizeof "-" + INT_STRLEN_BOUND (EMACS_INT));
USE_SAFE_ALLOCA;
buf = SAFE_ALLOCA (len);
esprintf (buf, "%s-%"pI"d", SDATA (name_alist_or_stem),
XFIXNUM (symbol_int) + 1);
value = intern (buf);
SAFE_FREE ();
}
else if (name_table != 0 && name_table[symbol_num])
value = intern (name_table[symbol_num]);
#ifdef HAVE_WINDOW_SYSTEM
if (NILP (value))
{
char *name = get_keysym_name (symbol_num);
if (name)
value = intern (name);
}
#endif
if (NILP (value))
{
char buf[sizeof "key-" + INT_STRLEN_BOUND (EMACS_INT)];
sprintf (buf, "key-%"pD"d", symbol_num);
value = intern (buf);
}
if (CONSP (*symbol_table))
*symbol_table = Fcons (Fcons (symbol_int, value), *symbol_table);
else
ASET (*symbol_table, symbol_num, value);
/* Fill in the cache entries for this symbol; this also
builds the Qevent_symbol_elements property, which the user
cares about. */
apply_modifiers (modifiers & click_modifier, value);
Fput (value, Qevent_kind, symbol_kind);
}
/* Apply modifiers to that symbol. */
return apply_modifiers (modifiers, value);
}
/* Convert a list that represents an event type,
such as (ctrl meta backspace), into the usual representation of that
event type as a number or a symbol. */
DEFUN ("event-convert-list", Fevent_convert_list, Sevent_convert_list, 1, 1, 0,
doc: /* Convert the event description list EVENT-DESC to an event type.
EVENT-DESC should contain one base event type (a character or symbol)
and zero or more modifier names (control, meta, hyper, super, shift, alt,
drag, down, double or triple). The base must be last.
The return value is an event type (a character or symbol) which has
essentially the same base event type and all the specified modifiers.
(Some compatibility base types, like symbols that represent a
character, are not returned verbatim.) */)
(Lisp_Object event_desc)
{
Lisp_Object base = Qnil;
int modifiers = 0;
FOR_EACH_TAIL_SAFE (event_desc)
{
Lisp_Object elt = XCAR (event_desc);
int this = 0;
/* Given a symbol, see if it is a modifier name. */
if (SYMBOLP (elt) && CONSP (XCDR (event_desc)))
this = parse_solitary_modifier (elt);
if (this != 0)
modifiers |= this;
else if (!NILP (base))
error ("Two bases given in one event");
else
base = elt;
}
/* Let the symbol A refer to the character A. */
if (SYMBOLP (base) && SCHARS (SYMBOL_NAME (base)) == 1)
XSETINT (base, SREF (SYMBOL_NAME (base), 0));
if (FIXNUMP (base))
{
/* Turn (shift a) into A. */
if ((modifiers & shift_modifier) != 0
&& (XFIXNUM (base) >= 'a' && XFIXNUM (base) <= 'z'))
{
XSETINT (base, XFIXNUM (base) - ('a' - 'A'));
modifiers &= ~shift_modifier;
}
/* Turn (control a) into C-a. */
if (modifiers & ctrl_modifier)
return make_fixnum ((modifiers & ~ctrl_modifier)
| make_ctrl_char (XFIXNUM (base)));
else
return make_fixnum (modifiers | XFIXNUM (base));
}
else if (SYMBOLP (base))
return apply_modifiers (modifiers, base);
else
error ("Invalid base event");
}
DEFUN ("internal-handle-focus-in", Finternal_handle_focus_in,
Sinternal_handle_focus_in, 1, 1, 0,
doc: /* Internally handle focus-in events.
This function potentially generates an artificial switch-frame event. */)
(Lisp_Object event)
{
Lisp_Object frame;
if (!EQ (CAR_SAFE (event), Qfocus_in) ||
!CONSP (XCDR (event)) ||
!FRAMEP ((frame = XCAR (XCDR (event)))))
error ("invalid focus-in event");
/* Conceptually, the concept of window manager focus on a particular
frame and the Emacs selected frame shouldn't be related, but for
a long time, we automatically switched the selected frame in
response to focus events, so let's keep doing that. */
bool switching = (!EQ (frame, internal_last_event_frame)
&& !EQ (frame, selected_frame));
internal_last_event_frame = frame;
if (switching || !NILP (unread_switch_frame))
unread_switch_frame = make_lispy_switch_frame (frame);
return Qnil;
}
/* Try to recognize SYMBOL as a modifier name.
Return the modifier flag bit, or 0 if not recognized. */
int
parse_solitary_modifier (Lisp_Object symbol)
{
Lisp_Object name;
if (!SYMBOLP (symbol))
return 0;
name = SYMBOL_NAME (symbol);
switch (SREF (name, 0))
{
#define SINGLE_LETTER_MOD(BIT) \
if (SBYTES (name) == 1) \
return BIT;
#define MULTI_LETTER_MOD(BIT, NAME, LEN) \
if (LEN == SBYTES (name) \
&& ! memcmp (SDATA (name), NAME, LEN)) \
return BIT;
case 'A':
SINGLE_LETTER_MOD (alt_modifier);
break;
case 'a':
MULTI_LETTER_MOD (alt_modifier, "alt", 3);
break;
case 'C':
SINGLE_LETTER_MOD (ctrl_modifier);
break;
case 'c':
MULTI_LETTER_MOD (ctrl_modifier, "ctrl", 4);
MULTI_LETTER_MOD (ctrl_modifier, "control", 7);
MULTI_LETTER_MOD (click_modifier, "click", 5);
break;
case 'H':
SINGLE_LETTER_MOD (hyper_modifier);
break;
case 'h':
MULTI_LETTER_MOD (hyper_modifier, "hyper", 5);
break;
case 'M':
SINGLE_LETTER_MOD (meta_modifier);
break;
case 'm':
MULTI_LETTER_MOD (meta_modifier, "meta", 4);
break;
case 'S':
SINGLE_LETTER_MOD (shift_modifier);
break;
case 's':
MULTI_LETTER_MOD (shift_modifier, "shift", 5);
MULTI_LETTER_MOD (super_modifier, "super", 5);
SINGLE_LETTER_MOD (super_modifier);
break;
case 'd':
MULTI_LETTER_MOD (drag_modifier, "drag", 4);
MULTI_LETTER_MOD (down_modifier, "down", 4);
MULTI_LETTER_MOD (double_modifier, "double", 6);
break;
case 't':
MULTI_LETTER_MOD (triple_modifier, "triple", 6);
break;
case 'u':
MULTI_LETTER_MOD (up_modifier, "up", 2);
break;
#undef SINGLE_LETTER_MOD
#undef MULTI_LETTER_MOD
}
return 0;
}
/* Return true if EVENT is a list whose elements are all integers or symbols.
Such a list is not valid as an event,
but it can be a Lucid-style event type list. */
bool
lucid_event_type_list_p (Lisp_Object object)
{
if (! CONSP (object))
return false;
if (EQ (XCAR (object), Qhelp_echo)
|| EQ (XCAR (object), Qvertical_line)
|| EQ (XCAR (object), Qmode_line)
|| EQ (XCAR (object), Qtab_line)
|| EQ (XCAR (object), Qheader_line))
return false;
Lisp_Object tail = object;
FOR_EACH_TAIL_SAFE (object)
{
Lisp_Object elt = XCAR (object);
if (! (FIXNUMP (elt) || SYMBOLP (elt)))
return false;
tail = XCDR (object);
}
return NILP (tail);
}
/* Return true if terminal input chars are available.
Also, store the return value into INPUT_PENDING.
Serves the purpose of ioctl (0, FIONREAD, ...)
but works even if FIONREAD does not exist.
(In fact, this may actually read some input.)
If READABLE_EVENTS_DO_TIMERS_NOW is set in FLAGS, actually run
timer events that are ripe.
If READABLE_EVENTS_FILTER_EVENTS is set in FLAGS, ignore internal
events (FOCUS_IN_EVENT).
If READABLE_EVENTS_IGNORE_SQUEEZABLES is set in FLAGS, ignore mouse
movements and toolkit scroll bar thumb drags. */
static bool
get_input_pending (int flags)
{
/* First of all, have we already counted some input? */
input_pending = (!NILP (Vquit_flag) || readable_events (flags));
/* If input is being read as it arrives, and we have none, there is none. */
if (!input_pending && (!interrupt_input || interrupts_deferred))
{
/* Try to read some input and see how much we get. */
gobble_input ();
input_pending = (!NILP (Vquit_flag) || readable_events (flags));
}
return input_pending;
}
/* Read any terminal input already buffered up by the system
into the kbd_buffer, but do not wait.
Return the number of keyboard chars read, or -1 meaning
this is a bad time to try to read input. */
int
gobble_input (void)
{
int nread = 0;
bool err = false;
struct terminal *t;
/* Store pending user signal events, if any. */
store_user_signal_events ();
/* Loop through the available terminals, and call their input hooks. */
t = terminal_list;
while (t)
{
struct terminal *next = t->next_terminal;
if (t->read_socket_hook)
{
int nr;
struct input_event hold_quit;
if (input_blocked_p ())
{
pending_signals = true;
break;
}
EVENT_INIT (hold_quit);
hold_quit.kind = NO_EVENT;
/* No need for FIONREAD or fcntl; just say don't wait. */
while ((nr = (*t->read_socket_hook) (t, &hold_quit)) > 0)
nread += nr;
if (nr == -1) /* Not OK to read input now. */
{
err = true;
}
else if (nr == -2) /* Non-transient error. */
{
/* The terminal device terminated; it should be closed. */
/* Kill Emacs if this was our last terminal. */
if (!terminal_list->next_terminal)
/* Formerly simply reported no input, but that
sometimes led to a failure of Emacs to terminate.
SIGHUP seems appropriate if we can't reach the
terminal. */
/* ??? Is it really right to send the signal just to
this process rather than to the whole process
group? Perhaps on systems with FIONREAD Emacs is
alone in its group. */
terminate_due_to_signal (SIGHUP, 10);
/* XXX Is calling delete_terminal safe here? It calls delete_frame. */
{
Lisp_Object tmp;
XSETTERMINAL (tmp, t);
Fdelete_terminal (tmp, Qnoelisp);
}
}
/* If there was no error, make sure the pointer
is visible for all frames on this terminal. */
if (nr >= 0)
{
Lisp_Object tail, frame;
FOR_EACH_FRAME (tail, frame)
{
struct frame *f = XFRAME (frame);
if (FRAME_TERMINAL (f) == t)
frame_make_pointer_visible (f);
}
}
if (hold_quit.kind != NO_EVENT)
kbd_buffer_store_event (&hold_quit);
}
t = next;
}
if (err && !nread)
nread = -1;
return nread;
}
/* This is the tty way of reading available input.
Note that each terminal device has its own `struct terminal' object,
and so this function is called once for each individual termcap
terminal. The first parameter indicates which terminal to read from. */
int
tty_read_avail_input (struct terminal *terminal,
struct input_event *hold_quit)
{
/* Using KBD_BUFFER_SIZE - 1 here avoids reading more than
the kbd_buffer can really hold. That may prevent loss
of characters on some systems when input is stuffed at us. */
unsigned char cbuf[KBD_BUFFER_SIZE - 1];
#ifndef WINDOWSNT
int n_to_read;
#endif
int i;
struct tty_display_info *tty = terminal->display_info.tty;
int nread = 0;
#ifdef subprocesses
int buffer_free = KBD_BUFFER_SIZE - kbd_buffer_nr_stored () - 1;
if (kbd_on_hold_p () || buffer_free <= 0)
return 0;
#endif /* subprocesses */
if (!terminal->name) /* Don't read from a dead terminal. */
return 0;
if (terminal->type != output_termcap
&& terminal->type != output_msdos_raw)
emacs_abort ();
/* XXX I think the following code should be moved to separate hook
functions in system-dependent files. */
#ifdef WINDOWSNT
/* FIXME: AFAIK, tty_read_avail_input is not used under w32 since the non-GUI
code sets read_socket_hook to w32_console_read_socket instead! */
return 0;
#else /* not WINDOWSNT */
if (! tty->term_initted) /* In case we get called during bootstrap. */
return 0;
if (! tty->input)
return 0; /* The terminal is suspended. */
#ifdef MSDOS
n_to_read = dos_keysns ();
if (n_to_read == 0)
return 0;
cbuf[0] = dos_keyread ();
nread = 1;
#else /* not MSDOS */
#ifdef HAVE_GPM
if (gpm_tty == tty)
{
Gpm_Event event;
int gpm, fd = gpm_fd;
/* gpm==1 if event received.
gpm==0 if the GPM daemon has closed the connection, in which case
Gpm_GetEvent closes gpm_fd and clears it to -1, which is why
we save it in `fd' so close_gpm can remove it from the
select masks.
gpm==-1 if a protocol error or EWOULDBLOCK; the latter is normal. */
while (gpm = Gpm_GetEvent (&event), gpm == 1) {
nread += handle_one_term_event (tty, &event);
}
if (gpm == 0)
/* Presumably the GPM daemon has closed the connection. */
close_gpm (fd);
if (nread)
return nread;
}
#endif /* HAVE_GPM */
/* Determine how many characters we should *try* to read. */
#ifdef USABLE_FIONREAD
/* Find out how much input is available. */
if (ioctl (fileno (tty->input), FIONREAD, &n_to_read) < 0)
{
if (! noninteractive)
return -2; /* Close this terminal. */
else
n_to_read = 0;
}
if (n_to_read == 0)
return 0;
if (n_to_read > sizeof cbuf)
n_to_read = sizeof cbuf;
#elif defined USG || defined CYGWIN
/* Read some input if available, but don't wait. */
n_to_read = sizeof cbuf;
fcntl (fileno (tty->input), F_SETFL, O_NONBLOCK);
#else
# error "Cannot read without possibly delaying"
#endif
#ifdef subprocesses
/* Don't read more than we can store. */
if (n_to_read > buffer_free)
n_to_read = buffer_free;
#endif /* subprocesses */
/* Now read; for one reason or another, this will not block.
NREAD is set to the number of chars read. */
nread = emacs_read (fileno (tty->input), (char *) cbuf, n_to_read);
/* POSIX infers that processes which are not in the session leader's
process group won't get SIGHUPs at logout time. BSDI adheres to
this part standard and returns -1 from read (0) with errno==EIO
when the control tty is taken away.
Jeffrey Honig <jch@bsdi.com> says this is generally safe. */
if (nread == -1 && errno == EIO)
return -2; /* Close this terminal. */
#if defined AIX && defined _BSD
/* The kernel sometimes fails to deliver SIGHUP for ptys.
This looks incorrect, but it isn't, because _BSD causes
O_NDELAY to be defined in fcntl.h as O_NONBLOCK,
and that causes a value other than 0 when there is no input. */
if (nread == 0)
return -2; /* Close this terminal. */
#endif
#ifndef USABLE_FIONREAD
#if defined (USG) || defined (CYGWIN)
fcntl (fileno (tty->input), F_SETFL, 0);
#endif /* USG or CYGWIN */
#endif /* no FIONREAD */
if (nread <= 0)
return nread;
#endif /* not MSDOS */
#endif /* not WINDOWSNT */
for (i = 0; i < nread; i++)
{
struct input_event buf;
EVENT_INIT (buf);
buf.kind = ASCII_KEYSTROKE_EVENT;
buf.modifiers = 0;
if (tty->meta_key == 1 && (cbuf[i] & 0x80))
buf.modifiers = meta_modifier;
if (tty->meta_key < 2)
cbuf[i] &= ~0x80;
buf.code = cbuf[i];
/* Set the frame corresponding to the active tty. Note that the
value of selected_frame is not reliable here, redisplay tends
to temporarily change it. */
buf.frame_or_window = tty->top_frame;
buf.arg = Qnil;
kbd_buffer_store_event (&buf);
/* Don't look at input that follows a C-g too closely.
This reduces lossage due to autorepeat on C-g. */
if (buf.kind == ASCII_KEYSTROKE_EVENT
&& buf.code == quit_char)
break;
}
return nread;
}
static void
handle_async_input (void)
{
#ifdef USABLE_SIGIO
while (1)
{
int nread = gobble_input ();
/* -1 means it's not ok to read the input now.
UNBLOCK_INPUT will read it later; now, avoid infinite loop.
0 means there was no keyboard input available. */
if (nread <= 0)
break;
}
#endif
}
void
process_pending_signals (void)
{
pending_signals = false;
handle_async_input ();
do_pending_atimers ();
}
/* Undo any number of BLOCK_INPUT calls down to level LEVEL,
and reinvoke any pending signal if the level is now 0 and
a fatal error is not already in progress. */
void
unblock_input_to (int level)
{
interrupt_input_blocked = level;
if (level == 0)
{
if (pending_signals && !fatal_error_in_progress)
process_pending_signals ();
}
else if (level < 0)
emacs_abort ();
}
/* End critical section.
If doing signal-driven input, and a signal came in when input was
blocked, reinvoke the signal handler now to deal with it.
It will also process queued input, if it was not read before.
When a longer code sequence does not use block/unblock input
at all, the whole input gathered up to the next call to
unblock_input will be processed inside that call. */
void
unblock_input (void)
{
unblock_input_to (interrupt_input_blocked - 1);
}
/* Undo any number of BLOCK_INPUT calls,
and also reinvoke any pending signal. */
void
totally_unblock_input (void)
{
unblock_input_to (0);
}
#ifdef USABLE_SIGIO
void
handle_input_available_signal (int sig)
{
pending_signals = true;
if (input_available_clear_time)
*input_available_clear_time = make_timespec (0, 0);
}
static void
deliver_input_available_signal (int sig)
{
deliver_process_signal (sig, handle_input_available_signal);
}
#endif /* USABLE_SIGIO */
/* User signal events. */
struct user_signal_info
{
/* Signal number. */
int sig;
/* Name of the signal. */
char *name;
/* Number of pending signals. */
int npending;
struct user_signal_info *next;
};
/* List of user signals. */
static struct user_signal_info *user_signals = NULL;
void
add_user_signal (int sig, const char *name)
{
struct sigaction action;
struct user_signal_info *p;
for (p = user_signals; p; p = p->next)
if (p->sig == sig)
/* Already added. */
return;
p = xmalloc (sizeof *p);
p->sig = sig;
p->name = xstrdup (name);
p->npending = 0;
p->next = user_signals;
user_signals = p;
emacs_sigaction_init (&action, deliver_user_signal);
sigaction (sig, &action, 0);
}
static void
handle_user_signal (int sig)
{
struct user_signal_info *p;
const char *special_event_name = NULL;
if (SYMBOLP (Vdebug_on_event))
special_event_name = SSDATA (SYMBOL_NAME (Vdebug_on_event));
for (p = user_signals; p; p = p->next)
if (p->sig == sig)
{
if (special_event_name
&& strcmp (special_event_name, p->name) == 0)
{
/* Enter the debugger in many ways. */
debug_on_next_call = true;
debug_on_quit = true;
Vquit_flag = Qt;
Vinhibit_quit = Qnil;
/* Eat the event. */
break;
}
p->npending++;
#ifdef USABLE_SIGIO
if (interrupt_input)
handle_input_available_signal (sig);
else
#endif
{
/* Tell wait_reading_process_output that it needs to wake
up and look around. */
if (input_available_clear_time)
*input_available_clear_time = make_timespec (0, 0);
}
break;
}
}
static void
deliver_user_signal (int sig)
{
deliver_process_signal (sig, handle_user_signal);
}
static char *
find_user_signal_name (int sig)
{
struct user_signal_info *p;
for (p = user_signals; p; p = p->next)
if (p->sig == sig)
return p->name;
return NULL;
}
static void
store_user_signal_events (void)
{
struct user_signal_info *p;
struct input_event buf;
bool buf_initialized = false;
for (p = user_signals; p; p = p->next)
if (p->npending > 0)
{
if (! buf_initialized)
{
memset (&buf, 0, sizeof buf);
buf.kind = USER_SIGNAL_EVENT;
buf.frame_or_window = selected_frame;
buf_initialized = true;
}
do
{
buf.code = p->sig;
kbd_buffer_store_event (&buf);
p->npending--;
}
while (p->npending > 0);
}
}
static void menu_bar_item (Lisp_Object, Lisp_Object, Lisp_Object, void *);
static Lisp_Object menu_bar_one_keymap_changed_items;
/* These variables hold the vector under construction within
menu_bar_items and its subroutines, and the current index
for storing into that vector. */
static Lisp_Object menu_bar_items_vector;
static int menu_bar_items_index;
static const char *separator_names[] = {
"space",
"no-line",
"single-line",
"double-line",
"single-dashed-line",
"double-dashed-line",
"shadow-etched-in",
"shadow-etched-out",
"shadow-etched-in-dash",
"shadow-etched-out-dash",
"shadow-double-etched-in",
"shadow-double-etched-out",
"shadow-double-etched-in-dash",
"shadow-double-etched-out-dash",
0,
};
/* Return true if LABEL specifies a separator. */
bool
menu_separator_name_p (const char *label)
{
if (!label)
return 0;
else if (strnlen (label, 4) == 4
&& memcmp (label, "--", 2) == 0
&& label[2] != '-')
{
int i;
label += 2;
for (i = 0; separator_names[i]; ++i)
if (strcmp (label, separator_names[i]) == 0)
return 1;
}
else
{
/* It's a separator if it contains only dashes. */
while (*label == '-')
++label;
return (*label == 0);
}
return 0;
}
/* Return a vector of menu items for a menu bar, appropriate
to the current buffer. Each item has three elements in the vector:
KEY STRING MAPLIST.
OLD is an old vector we can optionally reuse, or nil. */
Lisp_Object
menu_bar_items (Lisp_Object old)
{
/* The number of keymaps we're scanning right now, and the number of
keymaps we have allocated space for. */
ptrdiff_t nmaps;
/* maps[0..nmaps-1] are the prefix definitions of KEYBUF[0..t-1]
in the current keymaps, or nil where it is not a prefix. */
Lisp_Object *maps;
Lisp_Object mapsbuf[3];
Lisp_Object def;
ptrdiff_t mapno;
Lisp_Object oquit;
USE_SAFE_ALLOCA;
/* In order to build the menus, we need to call the keymap
accessors. They all call maybe_quit. But this function is called
during redisplay, during which a quit is fatal. So inhibit
quitting while building the menus.
We do this instead of specbind because (1) errors will clear it anyway
and (2) this avoids risk of specpdl overflow. */
oquit = Vinhibit_quit;
Vinhibit_quit = Qt;
if (!NILP (old))
menu_bar_items_vector = old;
else
menu_bar_items_vector = make_nil_vector (24);
menu_bar_items_index = 0;
/* Build our list of keymaps.
If we recognize a function key and replace its escape sequence in
keybuf with its symbol, or if the sequence starts with a mouse
click and we need to switch buffers, we jump back here to rebuild
the initial keymaps from the current buffer. */
{
Lisp_Object *tmaps;
/* Should overriding-terminal-local-map and overriding-local-map apply? */
if (!NILP (Voverriding_local_map_menu_flag)
&& !NILP (Voverriding_local_map))
{
/* Yes, use them (if non-nil) as well as the global map. */
maps = mapsbuf;
nmaps = 0;
if (!NILP (KVAR (current_kboard, Voverriding_terminal_local_map)))
maps[nmaps++] = KVAR (current_kboard, Voverriding_terminal_local_map);
if (!NILP (Voverriding_local_map))
maps[nmaps++] = Voverriding_local_map;
}
else
{
/* No, so use major and minor mode keymaps and keymap property.
Note that menu-bar bindings in the local-map and keymap
properties may not work reliable, as they are only
recognized when the menu-bar (or mode-line) is updated,
which does not normally happen after every command. */
ptrdiff_t nminor = current_minor_maps (NULL, &tmaps);
SAFE_NALLOCA (maps, 1, nminor + 4);
nmaps = 0;
Lisp_Object tem = KVAR (current_kboard, Voverriding_terminal_local_map);
if (!NILP (tem) && !NILP (Voverriding_local_map_menu_flag))
maps[nmaps++] = tem;
if (tem = get_local_map (PT, current_buffer, Qkeymap), !NILP (tem))
maps[nmaps++] = tem;
if (nminor != 0)
{
memcpy (maps + nmaps, tmaps, nminor * sizeof (maps[0]));
nmaps += nminor;
}
maps[nmaps++] = get_local_map (PT, current_buffer, Qlocal_map);
}
maps[nmaps++] = current_global_map;
}
/* Look up in each map the dummy prefix key `menu-bar'. */
for (mapno = nmaps - 1; mapno >= 0; mapno--)
if (!NILP (maps[mapno]))
{
def = get_keymap (access_keymap (maps[mapno], Qmenu_bar, 1, 0, 1),
0, 1);
if (CONSP (def))
{
menu_bar_one_keymap_changed_items = Qnil;
map_keymap_canonical (def, menu_bar_item, Qnil, NULL);
}
}
/* Move to the end those items that should be at the end. */
Lisp_Object tail = Vmenu_bar_final_items;
FOR_EACH_TAIL (tail)
{
int end = menu_bar_items_index;
for (int i = 0; i < end; i += 4)
if (EQ (XCAR (tail), AREF (menu_bar_items_vector, i)))
{
Lisp_Object tem0, tem1, tem2, tem3;
/* Move the item at index I to the end,
shifting all the others forward. */
tem0 = AREF (menu_bar_items_vector, i + 0);
tem1 = AREF (menu_bar_items_vector, i + 1);
tem2 = AREF (menu_bar_items_vector, i + 2);
tem3 = AREF (menu_bar_items_vector, i + 3);
if (end > i + 4)
memmove (aref_addr (menu_bar_items_vector, i),
aref_addr (menu_bar_items_vector, i + 4),
(end - i - 4) * word_size);
ASET (menu_bar_items_vector, end - 4, tem0);
ASET (menu_bar_items_vector, end - 3, tem1);
ASET (menu_bar_items_vector, end - 2, tem2);
ASET (menu_bar_items_vector, end - 1, tem3);
break;
}
}
/* Add nil, nil, nil, nil at the end. */
{
int i = menu_bar_items_index;
if (i + 4 > ASIZE (menu_bar_items_vector))
menu_bar_items_vector
= larger_vector (menu_bar_items_vector, 4, -1);
/* Add this item. */
ASET (menu_bar_items_vector, i, Qnil); i++;
ASET (menu_bar_items_vector, i, Qnil); i++;
ASET (menu_bar_items_vector, i, Qnil); i++;
ASET (menu_bar_items_vector, i, Qnil); i++;
menu_bar_items_index = i;
}
Vinhibit_quit = oquit;
SAFE_FREE ();
return menu_bar_items_vector;
}
/* Add one item to menu_bar_items_vector, for KEY, ITEM_STRING and DEF.
If there's already an item for KEY, add this DEF to it. */
Lisp_Object item_properties;
static void
menu_bar_item (Lisp_Object key, Lisp_Object item, Lisp_Object dummy1, void *dummy2)
{
int i;
bool parsed;
Lisp_Object tem;
if (EQ (item, Qundefined))
{
/* If a map has an explicit `undefined' as definition,
discard any previously made menu bar item. */
for (i = 0; i < menu_bar_items_index; i += 4)
if (EQ (key, AREF (menu_bar_items_vector, i)))
{
if (menu_bar_items_index > i + 4)
memmove (aref_addr (menu_bar_items_vector, i),
aref_addr (menu_bar_items_vector, i + 4),
(menu_bar_items_index - i - 4) * word_size);
menu_bar_items_index -= 4;
}
}
/* If this keymap has already contributed to this KEY,
don't contribute to it a second time. */
tem = Fmemq (key, menu_bar_one_keymap_changed_items);
if (!NILP (tem) || NILP (item))
return;
menu_bar_one_keymap_changed_items
= Fcons (key, menu_bar_one_keymap_changed_items);
/* We add to menu_bar_one_keymap_changed_items before doing the
parse_menu_item, so that if it turns out it wasn't a menu item,
it still correctly hides any further menu item. */
parsed = parse_menu_item (item, 1);
if (!parsed)
return;
item = AREF (item_properties, ITEM_PROPERTY_DEF);
/* Find any existing item for this KEY. */
for (i = 0; i < menu_bar_items_index; i += 4)
if (EQ (key, AREF (menu_bar_items_vector, i)))
break;
/* If we did not find this KEY, add it at the end. */
if (i == menu_bar_items_index)
{
/* If vector is too small, get a bigger one. */
if (i + 4 > ASIZE (menu_bar_items_vector))
menu_bar_items_vector = larger_vector (menu_bar_items_vector, 4, -1);
/* Add this item. */
ASET (menu_bar_items_vector, i, key); i++;
ASET (menu_bar_items_vector, i,
AREF (item_properties, ITEM_PROPERTY_NAME)); i++;
ASET (menu_bar_items_vector, i, list1 (item)); i++;
ASET (menu_bar_items_vector, i, make_fixnum (0)); i++;
menu_bar_items_index = i;
}
/* We did find an item for this KEY. Add ITEM to its list of maps. */
else
{
Lisp_Object old;
old = AREF (menu_bar_items_vector, i + 2);
/* If the new and the old items are not both keymaps,
the lookup will only find `item'. */
item = Fcons (item, KEYMAPP (item) && KEYMAPP (XCAR (old)) ? old : Qnil);
ASET (menu_bar_items_vector, i + 2, item);
}
}
/* This is used as the handler when calling menu_item_eval_property. */
static Lisp_Object
menu_item_eval_property_1 (Lisp_Object arg)
{
/* If we got a quit from within the menu computation,
quit all the way out of it. This takes care of C-] in the debugger. */
if (CONSP (arg) && signal_quit_p (XCAR (arg)))
quit ();
return Qnil;
}
static Lisp_Object
eval_dyn (Lisp_Object form)
{
return Feval (form, Qnil);
}
/* Evaluate an expression and return the result (or nil if something
went wrong). Used to evaluate dynamic parts of menu items. */
Lisp_Object
menu_item_eval_property (Lisp_Object sexpr)
{
ptrdiff_t count = SPECPDL_INDEX ();
Lisp_Object val;
specbind (Qinhibit_redisplay, Qt);
val = internal_condition_case_1 (eval_dyn, sexpr, Qerror,
menu_item_eval_property_1);
return unbind_to (count, val);
}
/* This function parses a menu item and leaves the result in the
vector item_properties.
ITEM is a key binding, a possible menu item.
INMENUBAR is > 0 when this is considered for an entry in a menu bar
top level.
INMENUBAR is < 0 when this is considered for an entry in a keyboard menu.
parse_menu_item returns true if the item is a menu item and false
otherwise. */
bool
parse_menu_item (Lisp_Object item, int inmenubar)
{
Lisp_Object def, tem, item_string, start;
Lisp_Object filter;
Lisp_Object keyhint;
int i;
filter = Qnil;
keyhint = Qnil;
if (!CONSP (item))
return 0;
/* Create item_properties vector if necessary. */
if (NILP (item_properties))
item_properties = make_nil_vector (ITEM_PROPERTY_ENABLE + 1);
/* Initialize optional entries. */
for (i = ITEM_PROPERTY_DEF; i < ITEM_PROPERTY_ENABLE; i++)
ASET (item_properties, i, Qnil);
ASET (item_properties, ITEM_PROPERTY_ENABLE, Qt);
/* Save the item here to protect it from GC. */
ASET (item_properties, ITEM_PROPERTY_ITEM, item);
item_string = XCAR (item);
start = item;
item = XCDR (item);
if (STRINGP (item_string))
{
/* Old format menu item. */
ASET (item_properties, ITEM_PROPERTY_NAME, item_string);
/* Maybe help string. */
if (CONSP (item) && STRINGP (XCAR (item)))
{
ASET (item_properties, ITEM_PROPERTY_HELP,
help_echo_substitute_command_keys (XCAR (item)));
start = item;
item = XCDR (item);
}
/* Maybe an obsolete key binding cache. */
if (CONSP (item) && CONSP (XCAR (item))
&& (NILP (XCAR (XCAR (item)))
|| VECTORP (XCAR (XCAR (item)))))
item = XCDR (item);
/* This is the real definition--the function to run. */
ASET (item_properties, ITEM_PROPERTY_DEF, item);
/* Get enable property, if any. */
if (SYMBOLP (item))
{
tem = Fget (item, Qmenu_enable);
if (!NILP (Venable_disabled_menus_and_buttons))
ASET (item_properties, ITEM_PROPERTY_ENABLE, Qt);
else if (!NILP (tem))
ASET (item_properties, ITEM_PROPERTY_ENABLE, tem);
}
}
else if (EQ (item_string, Qmenu_item) && CONSP (item))
{
/* New format menu item. */
ASET (item_properties, ITEM_PROPERTY_NAME, XCAR (item));
start = XCDR (item);
if (CONSP (start))
{
/* We have a real binding. */
ASET (item_properties, ITEM_PROPERTY_DEF, XCAR (start));
item = XCDR (start);
/* Is there an obsolete cache list with key equivalences. */
if (CONSP (item) && CONSP (XCAR (item)))
item = XCDR (item);
/* Parse properties. */
FOR_EACH_TAIL (item)
{
tem = XCAR (item);
item = XCDR (item);
if (!CONSP (item))
break;
if (EQ (tem, QCenable))
{
if (!NILP (Venable_disabled_menus_and_buttons))
ASET (item_properties, ITEM_PROPERTY_ENABLE, Qt);
else
ASET (item_properties, ITEM_PROPERTY_ENABLE, XCAR (item));
}
else if (EQ (tem, QCvisible))
{
/* If got a visible property and that evaluates to nil
then ignore this item. */
tem = menu_item_eval_property (XCAR (item));
if (NILP (tem))
return 0;
}
else if (EQ (tem, QChelp))
{
Lisp_Object help = XCAR (item);
if (STRINGP (help))
help = help_echo_substitute_command_keys (help);
ASET (item_properties, ITEM_PROPERTY_HELP, help);
}
else if (EQ (tem, QCfilter))
filter = item;
else if (EQ (tem, QCkey_sequence))
{
tem = XCAR (item);
if (SYMBOLP (tem) || STRINGP (tem) || VECTORP (tem))
/* Be GC protected. Set keyhint to item instead of tem. */
keyhint = item;
}
else if (EQ (tem, QCkeys))
{
tem = XCAR (item);
if (CONSP (tem) || STRINGP (tem))
ASET (item_properties, ITEM_PROPERTY_KEYEQ, tem);
}
else if (EQ (tem, QCbutton) && CONSP (XCAR (item)))
{
Lisp_Object type;
tem = XCAR (item);
type = XCAR (tem);
if (EQ (type, QCtoggle) || EQ (type, QCradio))
{
ASET (item_properties, ITEM_PROPERTY_SELECTED,
XCDR (tem));
ASET (item_properties, ITEM_PROPERTY_TYPE, type);
}
}
}
}
else if (inmenubar || !NILP (start))
return 0;
}
else
return 0; /* not a menu item */
/* If item string is not a string, evaluate it to get string.
If we don't get a string, skip this item. */
item_string = AREF (item_properties, ITEM_PROPERTY_NAME);
if (!(STRINGP (item_string)))
{
item_string = menu_item_eval_property (item_string);
if (!STRINGP (item_string))
return 0;
ASET (item_properties, ITEM_PROPERTY_NAME, item_string);
}
/* If got a filter apply it on definition. */
def = AREF (item_properties, ITEM_PROPERTY_DEF);
if (!NILP (filter))
{
def = menu_item_eval_property (list2 (XCAR (filter),
list2 (Qquote, def)));
ASET (item_properties, ITEM_PROPERTY_DEF, def);
}
/* Enable or disable selection of item. */
tem = AREF (item_properties, ITEM_PROPERTY_ENABLE);
if (!EQ (tem, Qt))
{
tem = menu_item_eval_property (tem);
if (inmenubar && NILP (tem))
return 0; /* Ignore disabled items in menu bar. */
ASET (item_properties, ITEM_PROPERTY_ENABLE, tem);
}
/* If we got no definition, this item is just unselectable text which
is OK in a submenu but not in the menubar. */
if (NILP (def))
return (!inmenubar);
/* See if this is a separate pane or a submenu. */
def = AREF (item_properties, ITEM_PROPERTY_DEF);
tem = get_keymap (def, 0, 1);
/* For a subkeymap, just record its details and exit. */
if (CONSP (tem))
{
ASET (item_properties, ITEM_PROPERTY_MAP, tem);
ASET (item_properties, ITEM_PROPERTY_DEF, tem);
return 1;
}
/* At the top level in the menu bar, do likewise for commands also.
The menu bar does not display equivalent key bindings anyway.
ITEM_PROPERTY_DEF is already set up properly. */
if (inmenubar > 0)
return 1;
{ /* This is a command. See if there is an equivalent key binding. */
Lisp_Object keyeq = AREF (item_properties, ITEM_PROPERTY_KEYEQ);
AUTO_STRING (space_space, " ");
/* The previous code preferred :key-sequence to :keys, so we
preserve this behavior. */
if (STRINGP (keyeq) && !CONSP (keyhint))
keyeq = concat2 (space_space, call1 (Qsubstitute_command_keys, keyeq));
else
{
Lisp_Object prefix = keyeq;
Lisp_Object keys = Qnil;
if (CONSP (prefix))
{
def = XCAR (prefix);
prefix = XCDR (prefix);
}
else
def = AREF (item_properties, ITEM_PROPERTY_DEF);
if (CONSP (keyhint) && !NILP (XCAR (keyhint)))
{
keys = XCAR (keyhint);
tem = Fkey_binding (keys, Qnil, Qnil, Qnil);
/* We have a suggested key. Is it bound to the command? */
if (NILP (tem)
|| (!EQ (tem, def)
/* If the command is an alias for another
(such as lmenu.el set it up), check if the
original command matches the cached command. */
&& !(SYMBOLP (def)
&& EQ (tem, XSYMBOL (def)->u.s.function))))
keys = Qnil;
}
if (NILP (keys))
keys = Fwhere_is_internal (def, Qnil, Qt, Qnil, Qnil);
if (!NILP (keys))
{
tem = Fkey_description (keys, Qnil);
if (CONSP (prefix))
{
if (STRINGP (XCAR (prefix)))
tem = concat2 (XCAR (prefix), tem);
if (STRINGP (XCDR (prefix)))
tem = concat2 (tem, XCDR (prefix));
}
keyeq = concat2 (space_space, tem);
}
else
keyeq = Qnil;
}
/* If we have an equivalent key binding, use that. */
ASET (item_properties, ITEM_PROPERTY_KEYEQ, keyeq);
}
/* Include this when menu help is implemented.
tem = XVECTOR (item_properties)->contents[ITEM_PROPERTY_HELP];
if (!(NILP (tem) || STRINGP (tem)))
{
tem = menu_item_eval_property (tem);
if (!STRINGP (tem))
tem = Qnil;
XVECTOR (item_properties)->contents[ITEM_PROPERTY_HELP] = tem;
}
*/
/* Handle radio buttons or toggle boxes. */
tem = AREF (item_properties, ITEM_PROPERTY_SELECTED);
if (!NILP (tem))
ASET (item_properties, ITEM_PROPERTY_SELECTED,
menu_item_eval_property (tem));
return 1;
}
/***********************************************************************
Tab-bars
***********************************************************************/
/* A vector holding tab bar items while they are parsed in function
tab_bar_items. Each item occupies TAB_BAR_ITEM_NSCLOTS elements
in the vector. */
static Lisp_Object tab_bar_items_vector;
/* A vector holding the result of parse_tab_bar_item. Layout is like
the one for a single item in tab_bar_items_vector. */
static Lisp_Object tab_bar_item_properties;
/* Next free index in tab_bar_items_vector. */
static int ntab_bar_items;
/* Function prototypes. */
static void init_tab_bar_items (Lisp_Object);
static void process_tab_bar_item (Lisp_Object, Lisp_Object, Lisp_Object,
void *);
static bool parse_tab_bar_item (Lisp_Object, Lisp_Object);
static void append_tab_bar_item (void);
/* Return a vector of tab bar items for keymaps currently in effect.
Reuse vector REUSE if non-nil. Return in *NITEMS the number of
tab bar items found. */
Lisp_Object
tab_bar_items (Lisp_Object reuse, int *nitems)
{
Lisp_Object *maps;
Lisp_Object mapsbuf[3];
ptrdiff_t nmaps, i;
Lisp_Object oquit;
Lisp_Object *tmaps;
USE_SAFE_ALLOCA;
*nitems = 0;
/* In order to build the menus, we need to call the keymap
accessors. They all call maybe_quit. But this function is called
during redisplay, during which a quit is fatal. So inhibit
quitting while building the menus. We do this instead of
specbind because (1) errors will clear it anyway and (2) this
avoids risk of specpdl overflow. */
oquit = Vinhibit_quit;
Vinhibit_quit = Qt;
/* Initialize tab_bar_items_vector and protect it from GC. */
init_tab_bar_items (reuse);
/* Build list of keymaps in maps. Set nmaps to the number of maps
to process. */
/* Should overriding-terminal-local-map and overriding-local-map apply? */
if (!NILP (Voverriding_local_map_menu_flag)
&& !NILP (Voverriding_local_map))
{
/* Yes, use them (if non-nil) as well as the global map. */
maps = mapsbuf;
nmaps = 0;
if (!NILP (KVAR (current_kboard, Voverriding_terminal_local_map)))
maps[nmaps++] = KVAR (current_kboard, Voverriding_terminal_local_map);
if (!NILP (Voverriding_local_map))
maps[nmaps++] = Voverriding_local_map;
}
else
{
/* No, so use major and minor mode keymaps and keymap property.
Note that tab-bar bindings in the local-map and keymap
properties may not work reliably, as they are only
recognized when the tab-bar (or mode-line) is updated,
which does not normally happen after every command. */
ptrdiff_t nminor = current_minor_maps (NULL, &tmaps);
SAFE_NALLOCA (maps, 1, nminor + 4);
nmaps = 0;
Lisp_Object tem = KVAR (current_kboard, Voverriding_terminal_local_map);
if (!NILP (tem) && !NILP (Voverriding_local_map_menu_flag))
maps[nmaps++] = tem;
if (tem = get_local_map (PT, current_buffer, Qkeymap), !NILP (tem))
maps[nmaps++] = tem;
if (nminor != 0)
{
memcpy (maps + nmaps, tmaps, nminor * sizeof (maps[0]));
nmaps += nminor;
}
maps[nmaps++] = get_local_map (PT, current_buffer, Qlocal_map);
}
/* Add global keymap at the end. */
maps[nmaps++] = current_global_map;
/* Process maps in reverse order and look up in each map the prefix
key `tab-bar'. */
for (i = nmaps - 1; i >= 0; --i)
if (!NILP (maps[i]))
{
Lisp_Object keymap;
keymap = get_keymap (access_keymap (maps[i], Qtab_bar, 1, 0, 1), 0, 1);
if (CONSP (keymap))
map_keymap (keymap, process_tab_bar_item, Qnil, NULL, 1);
}
Vinhibit_quit = oquit;
*nitems = ntab_bar_items / TAB_BAR_ITEM_NSLOTS;
SAFE_FREE ();
return tab_bar_items_vector;
}
/* Process the definition of KEY which is DEF. */
static void
process_tab_bar_item (Lisp_Object key, Lisp_Object def, Lisp_Object data, void *args)
{
int i;
if (EQ (def, Qundefined))
{
/* If a map has an explicit `undefined' as definition,
discard any previously made item. */
for (i = 0; i < ntab_bar_items; i += TAB_BAR_ITEM_NSLOTS)
{
Lisp_Object *v = XVECTOR (tab_bar_items_vector)->contents + i;
if (EQ (key, v[TAB_BAR_ITEM_KEY]))
{
if (ntab_bar_items > i + TAB_BAR_ITEM_NSLOTS)
memmove (v, v + TAB_BAR_ITEM_NSLOTS,
((ntab_bar_items - i - TAB_BAR_ITEM_NSLOTS)
* word_size));
ntab_bar_items -= TAB_BAR_ITEM_NSLOTS;
break;
}
}
}
else if (parse_tab_bar_item (key, def))
/* Append a new tab bar item to tab_bar_items_vector. Accept
more than one definition for the same key. */
append_tab_bar_item ();
}
/* Access slot with index IDX of vector tab_bar_item_properties. */
#define PROP(IDX) AREF (tab_bar_item_properties, (IDX))
static void
set_prop_tab_bar (ptrdiff_t idx, Lisp_Object val)
{
ASET (tab_bar_item_properties, idx, val);
}
/* Parse a tab bar item specification ITEM for key KEY and return the
result in tab_bar_item_properties. Value is false if ITEM is
invalid.
ITEM is a list `(menu-item CAPTION BINDING PROPS...)'.
CAPTION is the caption of the item, If it's not a string, it is
evaluated to get a string.
BINDING is the tab bar item's binding. Tab-bar items with keymaps
as binding are currently ignored.
The following properties are recognized:
- `:enable FORM'.
FORM is evaluated and specifies whether the tab bar item is
enabled or disabled.
- `:visible FORM'
FORM is evaluated and specifies whether the tab bar item is visible.
- `:filter FUNCTION'
FUNCTION is invoked with one parameter `(quote BINDING)'. Its
result is stored as the new binding.
- `:button (TYPE SELECTED)'
TYPE must be one of `:radio' or `:toggle'. SELECTED is evaluated
and specifies whether the button is selected (pressed) or not.
- `:image IMAGES'
IMAGES is either a single image specification or a vector of four
image specifications. See enum tab_bar_item_images.
- `:help HELP-STRING'.
Gives a help string to display for the tab bar item.
- `:label LABEL-STRING'.
A text label to show with the tab bar button if labels are enabled. */
static bool
parse_tab_bar_item (Lisp_Object key, Lisp_Object item)
{
Lisp_Object filter = Qnil;
Lisp_Object caption;
int i;
/* Definition looks like `(menu-item CAPTION BINDING PROPS...)'.
Rule out items that aren't lists, don't start with
`menu-item' or whose rest following `tab-bar-item' is not a
list. */
if (!CONSP (item))
return 0;
/* As an exception, allow old-style menu separators. */
if (STRINGP (XCAR (item)))
item = list1 (XCAR (item));
else if (!EQ (XCAR (item), Qmenu_item)
|| (item = XCDR (item), !CONSP (item)))
return 0;
/* Create tab_bar_item_properties vector if necessary. Reset it to
defaults. */
if (VECTORP (tab_bar_item_properties))
{
for (i = 0; i < TAB_BAR_ITEM_NSLOTS; ++i)
set_prop_tab_bar (i, Qnil);
}
else
tab_bar_item_properties = make_nil_vector (TAB_BAR_ITEM_NSLOTS);
/* Set defaults. */
set_prop_tab_bar (TAB_BAR_ITEM_KEY, key);
set_prop_tab_bar (TAB_BAR_ITEM_ENABLED_P, Qt);
/* Get the caption of the item. If the caption is not a string,
evaluate it to get a string. If we don't get a string, skip this
item. */
caption = XCAR (item);
if (!STRINGP (caption))
{
caption = menu_item_eval_property (caption);
if (!STRINGP (caption))
return 0;
}
set_prop_tab_bar (TAB_BAR_ITEM_CAPTION, caption);
/* If the rest following the caption is not a list, the menu item is
either a separator, or invalid. */
item = XCDR (item);
if (!CONSP (item))
{
if (menu_separator_name_p (SSDATA (caption)))
{
set_prop_tab_bar (TAB_BAR_ITEM_ENABLED_P, Qnil);
set_prop_tab_bar (TAB_BAR_ITEM_SELECTED_P, Qnil);
set_prop_tab_bar (TAB_BAR_ITEM_CAPTION, Qnil);
return 1;
}
return 0;
}
/* Store the binding. */
set_prop_tab_bar (TAB_BAR_ITEM_BINDING, XCAR (item));
item = XCDR (item);
/* Ignore cached key binding, if any. */
if (CONSP (item) && CONSP (XCAR (item)))
item = XCDR (item);
/* Process the rest of the properties. */
FOR_EACH_TAIL (item)
{
Lisp_Object ikey = XCAR (item);
item = XCDR (item);
if (!CONSP (item))
break;
Lisp_Object value = XCAR (item);
if (EQ (ikey, QCenable))
{
/* `:enable FORM'. */
if (!NILP (Venable_disabled_menus_and_buttons))
set_prop_tab_bar (TAB_BAR_ITEM_ENABLED_P, Qt);
else
set_prop_tab_bar (TAB_BAR_ITEM_ENABLED_P, value);
}
else if (EQ (ikey, QCvisible))
{
/* `:visible FORM'. If got a visible property and that
evaluates to nil then ignore this item. */
if (NILP (menu_item_eval_property (value)))
return 0;
}
else if (EQ (ikey, QChelp))
/* `:help HELP-STRING'. */
set_prop_tab_bar (TAB_BAR_ITEM_HELP, value);
else if (EQ (ikey, QCfilter))
/* ':filter FORM'. */
filter = value;
else if (EQ (ikey, QCbutton) && CONSP (value))
{
/* `:button (TYPE . SELECTED)'. */
Lisp_Object type, selected;
type = XCAR (value);
selected = XCDR (value);
if (EQ (type, QCtoggle) || EQ (type, QCradio))
{
set_prop_tab_bar (TAB_BAR_ITEM_SELECTED_P, selected);
}
}
}
/* If got a filter apply it on binding. */
if (!NILP (filter))
set_prop_tab_bar (TAB_BAR_ITEM_BINDING,
(menu_item_eval_property
(list2 (filter,
list2 (Qquote,
PROP (TAB_BAR_ITEM_BINDING))))));
/* See if the binding is a keymap. Give up if it is. */
if (CONSP (get_keymap (PROP (TAB_BAR_ITEM_BINDING), 0, 1)))
return 0;
/* Enable or disable selection of item. */
if (!EQ (PROP (TAB_BAR_ITEM_ENABLED_P), Qt))
set_prop_tab_bar (TAB_BAR_ITEM_ENABLED_P,
menu_item_eval_property (PROP (TAB_BAR_ITEM_ENABLED_P)));
/* Handle radio buttons or toggle boxes. */
if (!NILP (PROP (TAB_BAR_ITEM_SELECTED_P)))
set_prop_tab_bar (TAB_BAR_ITEM_SELECTED_P,
menu_item_eval_property (PROP (TAB_BAR_ITEM_SELECTED_P)));
return 1;
#undef PROP
}
/* Initialize tab_bar_items_vector. REUSE, if non-nil, is a vector
that can be reused. */
static void
init_tab_bar_items (Lisp_Object reuse)
{
if (VECTORP (reuse))
tab_bar_items_vector = reuse;
else
tab_bar_items_vector = make_nil_vector (64);
ntab_bar_items = 0;
}
/* Append parsed tab bar item properties from
tab_bar_item_properties */
static void
append_tab_bar_item (void)
{
ptrdiff_t incr
= (ntab_bar_items
- (ASIZE (tab_bar_items_vector) - TAB_BAR_ITEM_NSLOTS));
/* Enlarge tab_bar_items_vector if necessary. */
if (incr > 0)
tab_bar_items_vector = larger_vector (tab_bar_items_vector, incr, -1);
/* Append entries from tab_bar_item_properties to the end of
tab_bar_items_vector. */
vcopy (tab_bar_items_vector, ntab_bar_items,
xvector_contents (tab_bar_item_properties), TAB_BAR_ITEM_NSLOTS);
ntab_bar_items += TAB_BAR_ITEM_NSLOTS;
}
/***********************************************************************
Tool-bars
***********************************************************************/
/* A vector holding tool bar items while they are parsed in function
tool_bar_items. Each item occupies TOOL_BAR_ITEM_NSCLOTS elements
in the vector. */
static Lisp_Object tool_bar_items_vector;
/* A vector holding the result of parse_tool_bar_item. Layout is like
the one for a single item in tool_bar_items_vector. */
static Lisp_Object tool_bar_item_properties;
/* Next free index in tool_bar_items_vector. */
static int ntool_bar_items;
/* Function prototypes. */
static void init_tool_bar_items (Lisp_Object);
static void process_tool_bar_item (Lisp_Object, Lisp_Object, Lisp_Object,
void *);
static bool parse_tool_bar_item (Lisp_Object, Lisp_Object);
static void append_tool_bar_item (void);
/* Return a vector of tool bar items for keymaps currently in effect.
Reuse vector REUSE if non-nil. Return in *NITEMS the number of
tool bar items found. */
Lisp_Object
tool_bar_items (Lisp_Object reuse, int *nitems)
{
Lisp_Object *maps;
Lisp_Object mapsbuf[3];
ptrdiff_t nmaps, i;
Lisp_Object oquit;
Lisp_Object *tmaps;
USE_SAFE_ALLOCA;
*nitems = 0;
/* In order to build the menus, we need to call the keymap
accessors. They all call maybe_quit. But this function is called
during redisplay, during which a quit is fatal. So inhibit
quitting while building the menus. We do this instead of
specbind because (1) errors will clear it anyway and (2) this
avoids risk of specpdl overflow. */
oquit = Vinhibit_quit;
Vinhibit_quit = Qt;
/* Initialize tool_bar_items_vector and protect it from GC. */
init_tool_bar_items (reuse);
/* Build list of keymaps in maps. Set nmaps to the number of maps
to process. */
/* Should overriding-terminal-local-map and overriding-local-map apply? */
if (!NILP (Voverriding_local_map_menu_flag)
&& !NILP (Voverriding_local_map))
{
/* Yes, use them (if non-nil) as well as the global map. */
maps = mapsbuf;
nmaps = 0;
if (!NILP (KVAR (current_kboard, Voverriding_terminal_local_map)))
maps[nmaps++] = KVAR (current_kboard, Voverriding_terminal_local_map);
if (!NILP (Voverriding_local_map))
maps[nmaps++] = Voverriding_local_map;
}
else
{
/* No, so use major and minor mode keymaps and keymap property.
Note that tool-bar bindings in the local-map and keymap
properties may not work reliably, as they are only
recognized when the tool-bar (or mode-line) is updated,
which does not normally happen after every command. */
ptrdiff_t nminor = current_minor_maps (NULL, &tmaps);
SAFE_NALLOCA (maps, 1, nminor + 4);
nmaps = 0;
Lisp_Object tem = KVAR (current_kboard, Voverriding_terminal_local_map);
if (!NILP (tem) && !NILP (Voverriding_local_map_menu_flag))
maps[nmaps++] = tem;
if (tem = get_local_map (PT, current_buffer, Qkeymap), !NILP (tem))
maps[nmaps++] = tem;
if (nminor != 0)
{
memcpy (maps + nmaps, tmaps, nminor * sizeof (maps[0]));
nmaps += nminor;
}
maps[nmaps++] = get_local_map (PT, current_buffer, Qlocal_map);
}
/* Add global keymap at the end. */
maps[nmaps++] = current_global_map;
/* Process maps in reverse order and look up in each map the prefix
key `tool-bar'. */
for (i = nmaps - 1; i >= 0; --i)
if (!NILP (maps[i]))
{
Lisp_Object keymap;
keymap = get_keymap (access_keymap (maps[i], Qtool_bar, 1, 0, 1), 0, 1);
if (CONSP (keymap))
map_keymap (keymap, process_tool_bar_item, Qnil, NULL, 1);
}
Vinhibit_quit = oquit;
*nitems = ntool_bar_items / TOOL_BAR_ITEM_NSLOTS;
SAFE_FREE ();
return tool_bar_items_vector;
}
/* Process the definition of KEY which is DEF. */
static void
process_tool_bar_item (Lisp_Object key, Lisp_Object def, Lisp_Object data, void *args)
{
int i;
if (EQ (def, Qundefined))
{
/* If a map has an explicit `undefined' as definition,
discard any previously made item. */
for (i = 0; i < ntool_bar_items; i += TOOL_BAR_ITEM_NSLOTS)
{
Lisp_Object *v = XVECTOR (tool_bar_items_vector)->contents + i;
if (EQ (key, v[TOOL_BAR_ITEM_KEY]))
{
if (ntool_bar_items > i + TOOL_BAR_ITEM_NSLOTS)
memmove (v, v + TOOL_BAR_ITEM_NSLOTS,
((ntool_bar_items - i - TOOL_BAR_ITEM_NSLOTS)
* word_size));
ntool_bar_items -= TOOL_BAR_ITEM_NSLOTS;
break;
}
}
}
else if (parse_tool_bar_item (key, def))
/* Append a new tool bar item to tool_bar_items_vector. Accept
more than one definition for the same key. */
append_tool_bar_item ();
}
/* Access slot with index IDX of vector tool_bar_item_properties. */
#define PROP(IDX) AREF (tool_bar_item_properties, (IDX))
static void
set_prop (ptrdiff_t idx, Lisp_Object val)
{
ASET (tool_bar_item_properties, idx, val);
}
/* Parse a tool bar item specification ITEM for key KEY and return the
result in tool_bar_item_properties. Value is false if ITEM is
invalid.
ITEM is a list `(menu-item CAPTION BINDING PROPS...)'.
CAPTION is the caption of the item, If it's not a string, it is
evaluated to get a string.
BINDING is the tool bar item's binding. Tool-bar items with keymaps
as binding are currently ignored.
The following properties are recognized:
- `:enable FORM'.
FORM is evaluated and specifies whether the tool bar item is
enabled or disabled.
- `:visible FORM'
FORM is evaluated and specifies whether the tool bar item is visible.
- `:filter FUNCTION'
FUNCTION is invoked with one parameter `(quote BINDING)'. Its
result is stored as the new binding.
- `:button (TYPE SELECTED)'
TYPE must be one of `:radio' or `:toggle'. SELECTED is evaluated
and specifies whether the button is selected (pressed) or not.
- `:image IMAGES'
IMAGES is either a single image specification or a vector of four
image specifications. See enum tool_bar_item_images.
- `:help HELP-STRING'.
Gives a help string to display for the tool bar item.
- `:label LABEL-STRING'.
A text label to show with the tool bar button if labels are enabled. */
static bool
parse_tool_bar_item (Lisp_Object key, Lisp_Object item)
{
Lisp_Object filter = Qnil;
Lisp_Object caption;
int i;
bool have_label = false;
/* Definition looks like `(menu-item CAPTION BINDING PROPS...)'.
Rule out items that aren't lists, don't start with
`menu-item' or whose rest following `tool-bar-item' is not a
list. */
if (!CONSP (item))
return 0;
/* As an exception, allow old-style menu separators. */
if (STRINGP (XCAR (item)))
item = list1 (XCAR (item));
else if (!EQ (XCAR (item), Qmenu_item)
|| (item = XCDR (item), !CONSP (item)))
return 0;
/* Create tool_bar_item_properties vector if necessary. Reset it to
defaults. */
if (VECTORP (tool_bar_item_properties))
{
for (i = 0; i < TOOL_BAR_ITEM_NSLOTS; ++i)
set_prop (i, Qnil);
}
else
tool_bar_item_properties = make_nil_vector (TOOL_BAR_ITEM_NSLOTS);
/* Set defaults. */
set_prop (TOOL_BAR_ITEM_KEY, key);
set_prop (TOOL_BAR_ITEM_ENABLED_P, Qt);
/* Get the caption of the item. If the caption is not a string,
evaluate it to get a string. If we don't get a string, skip this
item. */
caption = XCAR (item);
if (!STRINGP (caption))
{
caption = menu_item_eval_property (caption);
if (!STRINGP (caption))
return 0;
}
set_prop (TOOL_BAR_ITEM_CAPTION, caption);
/* If the rest following the caption is not a list, the menu item is
either a separator, or invalid. */
item = XCDR (item);
if (!CONSP (item))
{
if (menu_separator_name_p (SSDATA (caption)))
{
set_prop (TOOL_BAR_ITEM_TYPE, Qt);
#ifndef HAVE_EXT_TOOL_BAR
/* If we use build_desired_tool_bar_string to render the
tool bar, the separator is rendered as an image. */
set_prop (TOOL_BAR_ITEM_IMAGES,
(menu_item_eval_property
(Vtool_bar_separator_image_expression)));
set_prop (TOOL_BAR_ITEM_ENABLED_P, Qnil);
set_prop (TOOL_BAR_ITEM_SELECTED_P, Qnil);
set_prop (TOOL_BAR_ITEM_CAPTION, Qnil);
#endif
return 1;
}
return 0;
}
/* Store the binding. */
set_prop (TOOL_BAR_ITEM_BINDING, XCAR (item));
item = XCDR (item);
/* Ignore cached key binding, if any. */
if (CONSP (item) && CONSP (XCAR (item)))
item = XCDR (item);
/* Process the rest of the properties. */
FOR_EACH_TAIL (item)
{
Lisp_Object ikey = XCAR (item);
item = XCDR (item);
if (!CONSP (item))
break;
Lisp_Object value = XCAR (item);
if (EQ (ikey, QCenable))
{
/* `:enable FORM'. */
if (!NILP (Venable_disabled_menus_and_buttons))
set_prop (TOOL_BAR_ITEM_ENABLED_P, Qt);
else
set_prop (TOOL_BAR_ITEM_ENABLED_P, value);
}
else if (EQ (ikey, QCvisible))
{
/* `:visible FORM'. If got a visible property and that
evaluates to nil then ignore this item. */
if (NILP (menu_item_eval_property (value)))
return 0;
}
else if (EQ (ikey, QChelp))
/* `:help HELP-STRING'. */
set_prop (TOOL_BAR_ITEM_HELP, value);
else if (EQ (ikey, QCvert_only))
/* `:vert-only t/nil'. */
set_prop (TOOL_BAR_ITEM_VERT_ONLY, value);
else if (EQ (ikey, QClabel))
{
const char *bad_label = "!!?GARBLED ITEM?!!";
/* `:label LABEL-STRING'. */
set_prop (TOOL_BAR_ITEM_LABEL,
STRINGP (value) ? value : build_string (bad_label));
have_label = true;
}
else if (EQ (ikey, QCfilter))
/* ':filter FORM'. */
filter = value;
else if (EQ (ikey, QCbutton) && CONSP (value))
{
/* `:button (TYPE . SELECTED)'. */
Lisp_Object type, selected;
type = XCAR (value);
selected = XCDR (value);
if (EQ (type, QCtoggle) || EQ (type, QCradio))
{
set_prop (TOOL_BAR_ITEM_SELECTED_P, selected);
set_prop (TOOL_BAR_ITEM_TYPE, type);
}
}
else if (EQ (ikey, QCimage)
&& (CONSP (value)
|| (VECTORP (value) && ASIZE (value) == 4)))
/* Value is either a single image specification or a vector
of 4 such specifications for the different button states. */
set_prop (TOOL_BAR_ITEM_IMAGES, value);
else if (EQ (ikey, QCrtl))
/* ':rtl STRING' */
set_prop (TOOL_BAR_ITEM_RTL_IMAGE, value);
}
if (!have_label)
{
/* Try to make one from caption and key. */
Lisp_Object tkey = PROP (TOOL_BAR_ITEM_KEY);
Lisp_Object tcapt = PROP (TOOL_BAR_ITEM_CAPTION);
const char *label = SYMBOLP (tkey) ? SSDATA (SYMBOL_NAME (tkey)) : "";
const char *capt = STRINGP (tcapt) ? SSDATA (tcapt) : "";
ptrdiff_t max_lbl_size =
2 * max (0, min (tool_bar_max_label_size, STRING_BYTES_BOUND / 2)) + 1;
char *buf = xmalloc (max_lbl_size);
Lisp_Object new_lbl;
ptrdiff_t caption_len = strnlen (capt, max_lbl_size);
if (0 < caption_len && caption_len < max_lbl_size)
{
strcpy (buf, capt);
while (caption_len > 0 && buf[caption_len - 1] == '.')
caption_len--;
buf[caption_len] = '\0';
label = capt = buf;
}
ptrdiff_t label_len = strnlen (label, max_lbl_size);
if (0 < label_len && label_len < max_lbl_size)
{
ptrdiff_t j;
if (label != buf)
strcpy (buf, label);
for (j = 0; buf[j] != '\0'; ++j)
if (buf[j] == '-')
buf[j] = ' ';
label = buf;
}
else
label = "";
new_lbl = Fupcase_initials (build_string (label));
if (SCHARS (new_lbl) <= tool_bar_max_label_size)
set_prop (TOOL_BAR_ITEM_LABEL, new_lbl);
else
set_prop (TOOL_BAR_ITEM_LABEL, empty_unibyte_string);
xfree (buf);
}
/* If got a filter apply it on binding. */
if (!NILP (filter))
set_prop (TOOL_BAR_ITEM_BINDING,
(menu_item_eval_property
(list2 (filter,
list2 (Qquote,
PROP (TOOL_BAR_ITEM_BINDING))))));
/* See if the binding is a keymap. Give up if it is. */
if (CONSP (get_keymap (PROP (TOOL_BAR_ITEM_BINDING), 0, 1)))
return 0;
/* If there is a key binding, add it to the help, which will be
displayed as a tooltip for this entry. */
Lisp_Object binding = PROP (TOOL_BAR_ITEM_BINDING);
Lisp_Object keys = Fwhere_is_internal (binding, Qnil, Qt, Qnil, Qnil);
if (!NILP (keys))
{
AUTO_STRING (beg, " (");
AUTO_STRING (end, ")");
Lisp_Object orig = PROP (TOOL_BAR_ITEM_HELP);
Lisp_Object desc = Fkey_description (keys, Qnil);
if (NILP (orig))
orig = PROP (TOOL_BAR_ITEM_CAPTION);
set_prop (TOOL_BAR_ITEM_HELP, CALLN (Fconcat, orig, beg, desc, end));
}
/* Enable or disable selection of item. */
if (!EQ (PROP (TOOL_BAR_ITEM_ENABLED_P), Qt))
set_prop (TOOL_BAR_ITEM_ENABLED_P,
menu_item_eval_property (PROP (TOOL_BAR_ITEM_ENABLED_P)));
/* Handle radio buttons or toggle boxes. */
if (!NILP (PROP (TOOL_BAR_ITEM_SELECTED_P)))
set_prop (TOOL_BAR_ITEM_SELECTED_P,
menu_item_eval_property (PROP (TOOL_BAR_ITEM_SELECTED_P)));
return 1;
#undef PROP
}
/* Initialize tool_bar_items_vector. REUSE, if non-nil, is a vector
that can be reused. */
static void
init_tool_bar_items (Lisp_Object reuse)
{
if (VECTORP (reuse))
tool_bar_items_vector = reuse;
else
tool_bar_items_vector = make_nil_vector (64);
ntool_bar_items = 0;
}
/* Append parsed tool bar item properties from
tool_bar_item_properties */
static void
append_tool_bar_item (void)
{
ptrdiff_t incr
= (ntool_bar_items
- (ASIZE (tool_bar_items_vector) - TOOL_BAR_ITEM_NSLOTS));
/* Enlarge tool_bar_items_vector if necessary. */
if (incr > 0)
tool_bar_items_vector = larger_vector (tool_bar_items_vector, incr, -1);
/* Append entries from tool_bar_item_properties to the end of
tool_bar_items_vector. */
vcopy (tool_bar_items_vector, ntool_bar_items,
xvector_contents (tool_bar_item_properties), TOOL_BAR_ITEM_NSLOTS);
ntool_bar_items += TOOL_BAR_ITEM_NSLOTS;
}
/* Read a character using menus based on the keymap MAP.
Return nil if there are no menus in the maps.
Return t if we displayed a menu but the user rejected it.
PREV_EVENT is the previous input event, or nil if we are reading
the first event of a key sequence.
If USED_MOUSE_MENU is non-null, set *USED_MOUSE_MENU to true
if we used a mouse menu to read the input, or false otherwise. If
USED_MOUSE_MENU is null, don't dereference it.
The prompting is done based on the prompt-string of the map
and the strings associated with various map elements.
This can be done with X menus or with menus put in the minibuf.
These are done in different ways, depending on how the input will be read.
Menus using X are done after auto-saving in read-char, getting the input
event from Fx_popup_menu; menus using the minibuf use read_char recursively
and do auto-saving in the inner call of read_char. */
static Lisp_Object
read_char_x_menu_prompt (Lisp_Object map,
Lisp_Object prev_event, bool *used_mouse_menu)
{
if (used_mouse_menu)
*used_mouse_menu = false;
/* Use local over global Menu maps. */
if (! menu_prompting)
return Qnil;
/* If we got to this point via a mouse click,
use a real menu for mouse selection. */
if (EVENT_HAS_PARAMETERS (prev_event)
&& !EQ (XCAR (prev_event), Qmenu_bar)
&& !EQ (XCAR (prev_event), Qtab_bar)
&& !EQ (XCAR (prev_event), Qtool_bar))
{
/* Display the menu and get the selection. */
Lisp_Object value;
value = x_popup_menu_1 (prev_event, get_keymap (map, 0, 1));
if (CONSP (value))
{
Lisp_Object tem;
record_menu_key (XCAR (value));
/* If we got multiple events, unread all but
the first.
There is no way to prevent those unread events
from showing up later in last_nonmenu_event.
So turn symbol and integer events into lists,
to indicate that they came from a mouse menu,
so that when present in last_nonmenu_event
they won't confuse things. */
for (tem = XCDR (value); CONSP (tem); tem = XCDR (tem))
{
record_menu_key (XCAR (tem));
if (SYMBOLP (XCAR (tem))
|| FIXNUMP (XCAR (tem)))
XSETCAR (tem, Fcons (XCAR (tem), Qdisabled));
}
/* If we got more than one event, put all but the first
onto this list to be read later.
Return just the first event now. */
Vunread_command_events
= nconc2 (XCDR (value), Vunread_command_events);
value = XCAR (value);
}
else if (NILP (value))
value = Qt;
if (used_mouse_menu)
*used_mouse_menu = true;
return value;
}
return Qnil ;
}
static Lisp_Object
read_char_minibuf_menu_prompt (int commandflag,
Lisp_Object map)
{
Lisp_Object name;
ptrdiff_t nlength;
/* FIXME: Use the minibuffer's frame width. */
ptrdiff_t width = FRAME_COLS (SELECTED_FRAME ()) - 4;
ptrdiff_t idx = -1;
bool nobindings = true;
Lisp_Object rest, vector;
Lisp_Object prompt_strings = Qnil;
vector = Qnil;
if (! menu_prompting)
return Qnil;
map = get_keymap (map, 0, 1);
name = Fkeymap_prompt (map);
/* If we don't have any menus, just read a character normally. */
if (!STRINGP (name))
return Qnil;
#define PUSH_C_STR(str, listvar) \
listvar = Fcons (build_unibyte_string (str), listvar)
/* Prompt string always starts with map's prompt, and a space. */
prompt_strings = Fcons (name, prompt_strings);
PUSH_C_STR (": ", prompt_strings);
nlength = SCHARS (name) + 2;
rest = map;
/* Present the documented bindings, a line at a time. */
while (1)
{
bool notfirst = false;
Lisp_Object menu_strings = prompt_strings;
ptrdiff_t i = nlength;
Lisp_Object obj;
Lisp_Object orig_defn_macro;
/* Loop over elements of map. */
while (i < width)
{
Lisp_Object elt;
/* FIXME: Use map_keymap to handle new keymap formats. */
/* At end of map, wrap around if just starting,
or end this line if already have something on it. */
if (NILP (rest))
{
if (notfirst || nobindings)
break;
else
rest = map;
}
/* Look at the next element of the map. */
if (idx >= 0)
elt = AREF (vector, idx);
else
elt = Fcar_safe (rest);
if (idx < 0 && VECTORP (elt))
{
/* If we found a dense table in the keymap,
advanced past it, but start scanning its contents. */
rest = Fcdr_safe (rest);
vector = elt;
idx = 0;
}
else
{
/* An ordinary element. */
Lisp_Object event, tem;
if (idx < 0)
{
event = Fcar_safe (elt); /* alist */
elt = Fcdr_safe (elt);
}
else
{
XSETINT (event, idx); /* vector */
}
/* Ignore the element if it has no prompt string. */
if (FIXNUMP (event) && parse_menu_item (elt, -1))
{
/* True if the char to type matches the string. */
bool char_matches;
Lisp_Object upcased_event, downcased_event;
Lisp_Object desc = Qnil;
Lisp_Object s
= AREF (item_properties, ITEM_PROPERTY_NAME);
upcased_event = Fupcase (event);
downcased_event = Fdowncase (event);
char_matches = (XFIXNUM (upcased_event) == SREF (s, 0)
|| XFIXNUM (downcased_event) == SREF (s, 0));
if (! char_matches)
desc = Fsingle_key_description (event, Qnil);
#if 0 /* It is redundant to list the equivalent key bindings because
the prefix is what the user has already typed. */
tem
= XVECTOR (item_properties)->contents[ITEM_PROPERTY_KEYEQ];
if (!NILP (tem))
/* Insert equivalent keybinding. */
s = concat2 (s, tem);
#endif
tem
= AREF (item_properties, ITEM_PROPERTY_TYPE);
if (EQ (tem, QCradio) || EQ (tem, QCtoggle))
{
/* Insert button prefix. */
Lisp_Object selected
= AREF (item_properties, ITEM_PROPERTY_SELECTED);
AUTO_STRING (radio_yes, "(*) ");
AUTO_STRING (radio_no , "( ) ");
AUTO_STRING (check_yes, "[X] ");
AUTO_STRING (check_no , "[ ] ");
if (EQ (tem, QCradio))
tem = NILP (selected) ? radio_yes : radio_no;
else
tem = NILP (selected) ? check_yes : check_no;
s = concat2 (tem, s);
}
/* If we have room for the prompt string, add it to this line.
If this is the first on the line, always add it. */
if ((SCHARS (s) + i + 2
+ (char_matches ? 0 : SCHARS (desc) + 3))
< width
|| !notfirst)
{
ptrdiff_t thiswidth;
/* Punctuate between strings. */
if (notfirst)
{
PUSH_C_STR (", ", menu_strings);
i += 2;
}
notfirst = true;
nobindings = false;
/* If the char to type doesn't match the string's
first char, explicitly show what char to type. */
if (! char_matches)
{
/* Add as much of string as fits. */
thiswidth = min (SCHARS (desc), width - i);
menu_strings
= Fcons (Fsubstring (desc, make_fixnum (0),
make_fixnum (thiswidth)),
menu_strings);
i += thiswidth;
PUSH_C_STR (" = ", menu_strings);
i += 3;
}
/* Add as much of string as fits. */
thiswidth = min (SCHARS (s), width - i);
menu_strings
= Fcons (Fsubstring (s, make_fixnum (0),
make_fixnum (thiswidth)),
menu_strings);
i += thiswidth;
}
else
{
/* If this element does not fit, end the line now,
and save the element for the next line. */
PUSH_C_STR ("...", menu_strings);
break;
}
}
/* Move past this element. */
if (idx >= 0 && idx + 1 >= ASIZE (vector))
/* Handle reaching end of dense table. */
idx = -1;
if (idx >= 0)
idx++;
else
rest = Fcdr_safe (rest);
}
}
/* Prompt with that and read response. */
message3_nolog (apply1 (intern ("concat"), Fnreverse (menu_strings)));
/* Make believe it's not a keyboard macro in case the help char
is pressed. Help characters are not recorded because menu prompting
is not used on replay. */
orig_defn_macro = KVAR (current_kboard, defining_kbd_macro);
kset_defining_kbd_macro (current_kboard, Qnil);
do
obj = read_char (commandflag, Qnil, Qt, 0, NULL);
while (BUFFERP (obj));
kset_defining_kbd_macro (current_kboard, orig_defn_macro);
if (!FIXNUMP (obj) || XFIXNUM (obj) == -2
|| (! EQ (obj, menu_prompt_more_char)
&& (!FIXNUMP (menu_prompt_more_char)
|| ! EQ (obj, make_fixnum (Ctl (XFIXNUM (menu_prompt_more_char)))))))
{
if (!NILP (KVAR (current_kboard, defining_kbd_macro)))
store_kbd_macro_char (obj);
return obj;
}
/* Help char - go round again. */
}
}
/* Reading key sequences. */
static Lisp_Object
follow_key (Lisp_Object keymap, Lisp_Object key)
{
return access_keymap (get_keymap (keymap, 0, 1),
key, 1, 0, 1);
}
static Lisp_Object
active_maps (Lisp_Object first_event, Lisp_Object second_event)
{
Lisp_Object position
= EVENT_HAS_PARAMETERS (first_event) ? EVENT_START (first_event) : Qnil;
/* The position of a click can be in the second event if the first event
is a fake_prefixed_key like `header-line` or `mode-line`. */
if (SYMBOLP (first_event)
&& EVENT_HAS_PARAMETERS (second_event)
&& EQ (first_event, POSN_POSN (EVENT_START (second_event))))
{
eassert (NILP (position));
position = EVENT_START (second_event);
}
return Fcons (Qkeymap, Fcurrent_active_maps (Qt, position));
}
/* Structure used to keep track of partial application of key remapping
such as Vfunction_key_map and Vkey_translation_map. */
typedef struct keyremap
{
/* This is the map originally specified for this use. */
Lisp_Object parent;
/* This is a submap reached by looking up, in PARENT,
the events from START to END. */
Lisp_Object map;
/* Positions [START, END) in the key sequence buffer
are the key that we have scanned so far.
Those events are the ones that we will replace
if PARENT maps them into a key sequence. */
int start, end;
} keyremap;
/* Lookup KEY in MAP.
MAP is a keymap mapping keys to key vectors or functions.
If the mapping is a function and DO_FUNCALL is true,
the function is called with PROMPT as parameter and its return
value is used as the return value of this function (after checking
that it is indeed a vector). */
static Lisp_Object
access_keymap_keyremap (Lisp_Object map, Lisp_Object key, Lisp_Object prompt,
bool do_funcall)
{
Lisp_Object next;
next = access_keymap (map, key, 1, 0, 1);
/* Handle a symbol whose function definition is a keymap
or an array. */
if (SYMBOLP (next) && !NILP (Ffboundp (next))
&& (ARRAYP (XSYMBOL (next)->u.s.function)
|| KEYMAPP (XSYMBOL (next)->u.s.function)))
next = Fautoload_do_load (XSYMBOL (next)->u.s.function, next, Qnil);
/* If the keymap gives a function, not an
array, then call the function with one arg and use
its value instead. */
if (do_funcall && FUNCTIONP (next))
{
Lisp_Object tem;
tem = next;
next = call1 (next, prompt);
/* If the function returned something invalid,
barf--don't ignore it. */
if (! (NILP (next) || VECTORP (next) || STRINGP (next)))
error ("Function %s returns invalid key sequence",
SSDATA (SYMBOL_NAME (tem)));
}
return next;
}
/* Do one step of the key remapping used for function-key-map and
key-translation-map:
KEYBUF is the READ_KEY_ELTS-size buffer holding the input events.
FKEY is a pointer to the keyremap structure to use.
INPUT is the index of the last element in KEYBUF.
DOIT if true says that the remapping can actually take place.
DIFF is used to return the number of keys added/removed by the remapping.
PARENT is the root of the keymap.
PROMPT is the prompt to use if the remapping happens through a function.
Return true if the remapping actually took place. */
static bool
keyremap_step (Lisp_Object *keybuf, volatile keyremap *fkey,
int input, bool doit, int *diff, Lisp_Object prompt)
{
Lisp_Object next, key;
key = keybuf[fkey->end++];
if (KEYMAPP (fkey->parent))
next = access_keymap_keyremap (fkey->map, key, prompt, doit);
else
next = Qnil;
/* If keybuf[fkey->start..fkey->end] is bound in the
map and we're in a position to do the key remapping, replace it with
the binding and restart with fkey->start at the end. */
if ((VECTORP (next) || STRINGP (next)) && doit)
{
int len = XFIXNAT (Flength (next));
int i;
*diff = len - (fkey->end - fkey->start);
if (READ_KEY_ELTS - input <= *diff)
error ("Key sequence too long");
/* Shift the keys that follow fkey->end. */
if (*diff < 0)
for (i = fkey->end; i < input; i++)
keybuf[i + *diff] = keybuf[i];
else if (*diff > 0)
for (i = input - 1; i >= fkey->end; i--)
keybuf[i + *diff] = keybuf[i];
/* Overwrite the old keys with the new ones. */
for (i = 0; i < len; i++)
keybuf[fkey->start + i]
= Faref (next, make_fixnum (i));
fkey->start = fkey->end += *diff;
fkey->map = fkey->parent;
return 1;
}
fkey->map = get_keymap (next, 0, 1);
/* If we no longer have a bound suffix, try a new position for
fkey->start. */
if (!CONSP (fkey->map))
{
fkey->end = ++fkey->start;
fkey->map = fkey->parent;
}
return 0;
}
static bool
test_undefined (Lisp_Object binding)
{
return (NILP (binding)
|| EQ (binding, Qundefined)
|| (SYMBOLP (binding)
&& EQ (Fcommand_remapping (binding, Qnil, Qnil), Qundefined)));
}
void init_raw_keybuf_count (void)
{
raw_keybuf_count = 0;
}
/* Read a sequence of keys that ends with a non prefix character,
storing it in KEYBUF, a buffer of size READ_KEY_ELTS.
Prompt with PROMPT.
Return the length of the key sequence stored.
Return -1 if the user rejected a command menu.
Echo starting immediately unless `prompt' is 0.
If PREVENT_REDISPLAY is non-zero, avoid redisplay by calling
read_char with a suitable COMMANDFLAG argument.
Where a key sequence ends depends on the currently active keymaps.
These include any minor mode keymaps active in the current buffer,
the current buffer's local map, and the global map.
If a key sequence has no other bindings, we check Vfunction_key_map
to see if some trailing subsequence might be the beginning of a
function key's sequence. If so, we try to read the whole function
key, and substitute its symbolic name into the key sequence.
We ignore unbound `down-' mouse clicks. We turn unbound `drag-' and
`double-' events into similar click events, if that would make them
bound. We try to turn `triple-' events first into `double-' events,
then into clicks.
If we get a mouse click in a mode line, vertical divider, or other
non-text area, we treat the click as if it were prefixed by the
symbol denoting that area - `mode-line', `vertical-line', or
whatever.
If the sequence starts with a mouse click, we read the key sequence
with respect to the buffer clicked on, not the current buffer.
If the user switches frames in the midst of a key sequence, we put
off the switch-frame event until later; the next call to
read_char will return it.
If FIX_CURRENT_BUFFER, we restore current_buffer
from the selected window's buffer. */
static int
read_key_sequence (Lisp_Object *keybuf, Lisp_Object prompt,
bool dont_downcase_last, bool can_return_switch_frame,
bool fix_current_buffer, bool prevent_redisplay)
{
ptrdiff_t count = SPECPDL_INDEX ();
/* How many keys there are in the current key sequence. */
int t;
/* The length of the echo buffer when we started reading, and
the length of this_command_keys when we started reading. */
ptrdiff_t echo_start UNINIT;
ptrdiff_t keys_start;
Lisp_Object current_binding = Qnil;
/* Index of the first key that has no binding.
It is useless to try fkey.start larger than that. */
int first_unbound;
/* If t < mock_input, then KEYBUF[t] should be read as the next
input key.
We use this to recover after recognizing a function key. Once we
realize that a suffix of the current key sequence is actually a
function key's escape sequence, we replace the suffix with the
function key's binding from Vfunction_key_map. Now keybuf
contains a new and different key sequence, so the echo area,
this_command_keys, and the submaps and defs arrays are wrong. In
this situation, we set mock_input to t, set t to 0, and jump to
restart_sequence; the loop will read keys from keybuf up until
mock_input, thus rebuilding the state; and then it will resume
reading characters from the keyboard. */
int mock_input = 0;
/* Whether each event in the mocked input came from a mouse menu. */
bool used_mouse_menu_history[READ_KEY_ELTS] = {0};
/* If the sequence is unbound in submaps[], then
keybuf[fkey.start..fkey.end-1] is a prefix in Vfunction_key_map,
and fkey.map is its binding.
These might be > t, indicating that all function key scanning
should hold off until t reaches them. We do this when we've just
recognized a function key, to avoid searching for the function
key's again in Vfunction_key_map. */
keyremap fkey;
/* Likewise, for key_translation_map and input-decode-map. */
keyremap keytran, indec;
/* True if we are trying to map a key by changing an upper-case
letter to lower case, or a shifted function key to an unshifted
one. */
bool shift_translated = false;
/* If we receive a `switch-frame' or `select-window' event in the middle of
a key sequence, we put it off for later.
While we're reading, we keep the event here. */
Lisp_Object delayed_switch_frame;
Lisp_Object original_uppercase UNINIT;
int original_uppercase_position = -1;
/* Gets around Microsoft compiler limitations. */
bool dummyflag = false;
struct buffer *starting_buffer;
/* List of events for which a fake prefix key has been generated. */
Lisp_Object fake_prefixed_keys = Qnil;
/* raw_keybuf_count is now initialized in (most of) the callers of
read_key_sequence. This is so that in a recursive call (for
mouse menus) a spurious initialization doesn't erase the contents
of raw_keybuf created by the outer call. */
/* raw_keybuf_count = 0; */
delayed_switch_frame = Qnil;
if (INTERACTIVE)
{
if (!NILP (prompt))
{
/* Install the string PROMPT as the beginning of the string
of echoing, so that it serves as a prompt for the next
character. */
kset_echo_prompt (current_kboard, prompt);
/* FIXME: This use of echo_now doesn't look quite right and is ugly
since it forces us to fiddle with current_kboard->immediate_echo
before and after. */
current_kboard->immediate_echo = false;
echo_now ();
if (!echo_keystrokes_p ())
current_kboard->immediate_echo = false;
}
else if (cursor_in_echo_area /* FIXME: Not sure why we test this here,
maybe we should just drop this test. */
&& echo_keystrokes_p ())
/* This doesn't put in a dash if the echo buffer is empty, so
you don't always see a dash hanging out in the minibuffer. */
echo_dash ();
}
/* Record the initial state of the echo area and this_command_keys;
we will need to restore them if we replay a key sequence. */
if (INTERACTIVE)
echo_start = echo_length ();
keys_start = this_command_key_count;
this_single_command_key_start = keys_start;
/* We jump here when we need to reinitialize fkey and keytran; this
happens if we switch keyboards between rescans. */
replay_entire_sequence:
indec.map = indec.parent = KVAR (current_kboard, Vinput_decode_map);
fkey.map = fkey.parent = KVAR (current_kboard, Vlocal_function_key_map);
keytran.map = keytran.parent = Vkey_translation_map;
indec.start = indec.end = 0;
fkey.start = fkey.end = 0;
keytran.start = keytran.end = 0;
/* We jump here when the key sequence has been thoroughly changed, and
we need to rescan it starting from the beginning. When we jump here,
keybuf[0..mock_input] holds the sequence we should reread. */
replay_sequence:
starting_buffer = current_buffer;
first_unbound = READ_KEY_ELTS + 1;
Lisp_Object first_event = mock_input > 0 ? keybuf[0] : Qnil;
Lisp_Object second_event = mock_input > 1 ? keybuf[1] : Qnil;
/* Build our list of keymaps.
If we recognize a function key and replace its escape sequence in
keybuf with its symbol, or if the sequence starts with a mouse
click and we need to switch buffers, we jump back here to rebuild
the initial keymaps from the current buffer. */
current_binding = active_maps (first_event, second_event);
/* Start from the beginning in keybuf. */
t = 0;
last_nonmenu_event = Qnil;
/* These are no-ops the first time through, but if we restart, they
revert the echo area and this_command_keys to their original state. */
this_command_key_count = keys_start;
if (INTERACTIVE && t < mock_input)
echo_truncate (echo_start);
/* If the best binding for the current key sequence is a keymap, or
we may be looking at a function key's escape sequence, keep on
reading. */
while (!NILP (current_binding)
/* Keep reading as long as there's a prefix binding. */
? KEYMAPP (current_binding)
/* Don't return in the middle of a possible function key sequence,
if the only bindings we found were via case conversion.
Thus, if ESC O a has a function-key-map translation
and ESC o has a binding, don't return after ESC O,
so that we can translate ESC O plus the next character. */
: (/* indec.start < t || fkey.start < t || */ keytran.start < t))
{
Lisp_Object key;
bool used_mouse_menu = false;
/* Where the last real key started. If we need to throw away a
key that has expanded into more than one element of keybuf
(say, a mouse click on the mode line which is being treated
as [mode-line (mouse-...)], then we backtrack to this point
of keybuf. */
int last_real_key_start;
/* These variables are analogous to echo_start and keys_start;
while those allow us to restart the entire key sequence,
echo_local_start and keys_local_start allow us to throw away
just one key. */
ptrdiff_t echo_local_start UNINIT;
int keys_local_start;
Lisp_Object new_binding;
eassert (indec.end == t || (indec.end > t && indec.end <= mock_input));
eassert (indec.start <= indec.end);
eassert (fkey.start <= fkey.end);
eassert (keytran.start <= keytran.end);
/* key-translation-map is applied *after* function-key-map
which is itself applied *after* input-decode-map. */
eassert (fkey.end <= indec.start);
eassert (keytran.end <= fkey.start);
if (/* first_unbound < indec.start && first_unbound < fkey.start && */
first_unbound < keytran.start)
{ /* The prefix upto first_unbound has no binding and has
no translation left to do either, so we know it's unbound.
If we don't stop now, we risk staying here indefinitely
(if the user keeps entering fkey or keytran prefixes
like C-c ESC ESC ESC ESC ...) */
int i;
for (i = first_unbound + 1; i < t; i++)
keybuf[i - first_unbound - 1] = keybuf[i];
mock_input = t - first_unbound - 1;
indec.end = indec.start -= first_unbound + 1;
indec.map = indec.parent;
fkey.end = fkey.start -= first_unbound + 1;
fkey.map = fkey.parent;
keytran.end = keytran.start -= first_unbound + 1;
keytran.map = keytran.parent;
goto replay_sequence;
}
if (t >= READ_KEY_ELTS)
error ("Key sequence too long");
if (INTERACTIVE)
echo_local_start = echo_length ();
keys_local_start = this_command_key_count;
replay_key:
/* These are no-ops, unless we throw away a keystroke below and
jumped back up to replay_key; in that case, these restore the
variables to their original state, allowing us to replay the
loop. */
if (INTERACTIVE && t < mock_input)
echo_truncate (echo_local_start);
this_command_key_count = keys_local_start;
/* By default, assume each event is "real". */
last_real_key_start = t;
/* Does mock_input indicate that we are re-reading a key sequence? */
if (t < mock_input)
{
key = keybuf[t];
add_command_key (key);
if (current_kboard->immediate_echo)
{
/* Set immediate_echo to false so as to force echo_now to
redisplay (it will set immediate_echo right back to true). */
current_kboard->immediate_echo = false;
echo_now ();
}
used_mouse_menu = used_mouse_menu_history[t];
}
/* If not, we should actually read a character. */
else
{
{
KBOARD *interrupted_kboard = current_kboard;
struct frame *interrupted_frame = SELECTED_FRAME ();
/* Calling read_char with COMMANDFLAG = -2 avoids
redisplay in read_char and its subroutines. */
key = read_char (prevent_redisplay ? -2 : NILP (prompt),
current_binding, last_nonmenu_event,
&used_mouse_menu, NULL);
used_mouse_menu_history[t] = used_mouse_menu;
if ((FIXNUMP (key) && XFIXNUM (key) == -2) /* wrong_kboard_jmpbuf */
/* When switching to a new tty (with a new keyboard),
read_char returns the new buffer, rather than -2
(Bug#5095). This is because `terminal-init-xterm'
calls read-char, which eats the wrong_kboard_jmpbuf
return. Any better way to fix this? -- cyd */
|| (interrupted_kboard != current_kboard))
{
bool found = false;
struct kboard *k;
for (k = all_kboards; k; k = k->next_kboard)
if (k == interrupted_kboard)
found = true;
if (!found)
{
/* Don't touch interrupted_kboard when it's been
deleted. */
delayed_switch_frame = Qnil;
goto replay_entire_sequence;
}
if (!NILP (delayed_switch_frame))
{
kset_kbd_queue
(interrupted_kboard,
Fcons (delayed_switch_frame,
KVAR (interrupted_kboard, kbd_queue)));
delayed_switch_frame = Qnil;
}
while (t > 0)
kset_kbd_queue
(interrupted_kboard,
Fcons (keybuf[--t], KVAR (interrupted_kboard, kbd_queue)));
/* If the side queue is non-empty, ensure it begins with a
switch-frame, so we'll replay it in the right context. */
if (CONSP (KVAR (interrupted_kboard, kbd_queue))
&& (key = XCAR (KVAR (interrupted_kboard, kbd_queue)),
!(EVENT_HAS_PARAMETERS (key)
&& EQ (EVENT_HEAD_KIND (EVENT_HEAD (key)),
Qswitch_frame))))
{
Lisp_Object frame;
XSETFRAME (frame, interrupted_frame);
kset_kbd_queue
(interrupted_kboard,
Fcons (make_lispy_switch_frame (frame),
KVAR (interrupted_kboard, kbd_queue)));
mock_input = 0;
}
else
{
if (FIXNUMP (key) && XFIXNUM (key) != -2)
{
/* If interrupted while initializing terminal, we
need to replay the interrupting key. See
Bug#5095 and Bug#37782. */
mock_input = 1;
keybuf[0] = key;
}
else
{
mock_input = 0;
}
}
goto replay_entire_sequence;
}
}
/* read_char returns t when it shows a menu and the user rejects it.
Just return -1. */
if (EQ (key, Qt))
{
unbind_to (count, Qnil);
return -1;
}
/* read_char returns -1 at the end of a macro.
Emacs 18 handles this by returning immediately with a
zero, so that's what we'll do. */
if (FIXNUMP (key) && XFIXNUM (key) == -1)
{
t = 0;
/* The Microsoft C compiler can't handle the goto that
would go here. */
dummyflag = true;
break;
}
/* If the current buffer has been changed from under us, the
keymap may have changed, so replay the sequence. */
if (BUFFERP (key))
{
timer_resume_idle ();
mock_input = t;
/* Reset the current buffer from the selected window
in case something changed the former and not the latter.
This is to be more consistent with the behavior
of the command_loop_1. */
if (fix_current_buffer)
{
if (! FRAME_LIVE_P (XFRAME (selected_frame)))
Fkill_emacs (Qnil);
if (XBUFFER (XWINDOW (selected_window)->contents)
!= current_buffer)
Fset_buffer (XWINDOW (selected_window)->contents);
}
goto replay_sequence;
}
/* If we have a quit that was typed in another frame, and
quit_throw_to_read_char switched buffers,
replay to get the right keymap. */
if (FIXNUMP (key)
&& XFIXNUM (key) == quit_char
&& current_buffer != starting_buffer)
{
GROW_RAW_KEYBUF;
ASET (raw_keybuf, raw_keybuf_count, key);
raw_keybuf_count++;
keybuf[t++] = key;
mock_input = t;
Vquit_flag = Qnil;
goto replay_sequence;
}
Vquit_flag = Qnil;
if (EVENT_HAS_PARAMETERS (key)
/* Either a `switch-frame' or a `select-window' event. */
&& EQ (EVENT_HEAD_KIND (EVENT_HEAD (key)), Qswitch_frame))
{
/* If we're at the beginning of a key sequence, and the caller
says it's okay, go ahead and return this event. If we're
in the midst of a key sequence, delay it until the end. */
if (t > 0 || !can_return_switch_frame)
{
delayed_switch_frame = key;
goto replay_key;
}
}
if (NILP (first_event))
{
first_event = key;
/* Even if first_event does not specify a particular
window/position, it's important to recompute the maps here
since a long time might have passed since we entered
read_key_sequence, and a timer (or process-filter or
special-event-map, ...) might have switched the current buffer
or the selected window from under us in the mean time. */
if (fix_current_buffer
&& (XBUFFER (XWINDOW (selected_window)->contents)
!= current_buffer))
Fset_buffer (XWINDOW (selected_window)->contents);
current_binding = active_maps (first_event, Qnil);
}
GROW_RAW_KEYBUF;
ASET (raw_keybuf, raw_keybuf_count,
/* Copy the event, in case it gets modified by side-effect
by some remapping function (bug#30955). */
CONSP (key) ? Fcopy_sequence (key) : key);
raw_keybuf_count++;
}
/* Clicks in non-text areas get prefixed by the symbol
in their CHAR-ADDRESS field. For example, a click on
the mode line is prefixed by the symbol `mode-line'.
Furthermore, key sequences beginning with mouse clicks
are read using the keymaps of the buffer clicked on, not
the current buffer. So we may have to switch the buffer
here.
When we turn one event into two events, we must make sure
that neither of the two looks like the original--so that,
if we replay the events, they won't be expanded again.
If not for this, such reexpansion could happen either here
or when user programs play with this-command-keys. */
if (EVENT_HAS_PARAMETERS (key))
{
Lisp_Object kind = EVENT_HEAD_KIND (EVENT_HEAD (key));
if (EQ (kind, Qmouse_click))
{
Lisp_Object window = POSN_WINDOW (EVENT_START (key));
Lisp_Object posn = POSN_POSN (EVENT_START (key));
if (CONSP (posn)
|| (!NILP (fake_prefixed_keys)
&& !NILP (Fmemq (key, fake_prefixed_keys))))
{
/* We're looking a second time at an event for which
we generated a fake prefix key. Set
last_real_key_start appropriately. */
if (t > 0)
last_real_key_start = t - 1;
}
if (last_real_key_start == 0)
{
/* Key sequences beginning with mouse clicks are
read using the keymaps in the buffer clicked on,
not the current buffer. If we're at the
beginning of a key sequence, switch buffers. */
if (WINDOWP (window)
&& BUFFERP (XWINDOW (window)->contents)
&& XBUFFER (XWINDOW (window)->contents) != current_buffer)
{
keybuf[t] = key;
mock_input = t + 1;
/* Arrange to go back to the original buffer once we're
done reading the key sequence. Note that we can't
use save_excursion_{save,restore} here, because they
save point as well as the current buffer; we don't
want to save point, because redisplay may change it,
to accommodate a Fset_window_start or something. We
don't want to do this at the top of the function,
because we may get input from a subprocess which
wants to change the selected window and stuff (say,
emacsclient). */
record_unwind_current_buffer ();
if (! FRAME_LIVE_P (XFRAME (selected_frame)))
Fkill_emacs (Qnil);
set_buffer_internal (XBUFFER (XWINDOW (window)->contents));
goto replay_sequence;
}
}
/* Expand mode-line and scroll-bar events into two events:
use posn as a fake prefix key. */
if (SYMBOLP (posn)
&& (NILP (fake_prefixed_keys)
|| NILP (Fmemq (key, fake_prefixed_keys))))
{
if (READ_KEY_ELTS - t <= 1)
error ("Key sequence too long");
keybuf[t] = posn;
keybuf[t + 1] = key;
mock_input = t + 2;
/* Record that a fake prefix key has been generated
for KEY. Don't modify the event; this would
prevent proper action when the event is pushed
back into unread-command-events. */
fake_prefixed_keys = Fcons (key, fake_prefixed_keys);
goto replay_key;
}
}
else if (CONSP (XCDR (key))
&& CONSP (xevent_start (key))
&& CONSP (XCDR (xevent_start (key))))
{
Lisp_Object posn;
posn = POSN_POSN (xevent_start (key));
/* Handle menu-bar events:
insert the dummy prefix event `menu-bar'. */
if (EQ (posn, Qmenu_bar) || EQ (posn, Qtab_bar) || EQ (posn, Qtool_bar))
{
if (READ_KEY_ELTS - t <= 1)
error ("Key sequence too long");
keybuf[t] = posn;
keybuf[t + 1] = key;
/* Zap the position in key, so we know that we've
expanded it, and don't try to do so again. */
POSN_SET_POSN (xevent_start (key), list1 (posn));
mock_input = t + 2;
goto replay_sequence;
}
else if (CONSP (posn))
{
/* We're looking at the second event of a
sequence which we expanded before. Set
last_real_key_start appropriately. */
if (last_real_key_start == t && t > 0)
last_real_key_start = t - 1;
}
}
}
/* We have finally decided that KEY is something we might want
to look up. */
new_binding = follow_key (current_binding, key);
/* If KEY wasn't bound, we'll try some fallbacks. */
if (!NILP (new_binding))
/* This is needed for the following scenario:
event 0: a down-event that gets dropped by calling replay_key.
event 1: some normal prefix like C-h.
After event 0, first_unbound is 0, after event 1 indec.start,
fkey.start, and keytran.start are all 1, so when we see that
C-h is bound, we need to update first_unbound. */
first_unbound = max (t + 1, first_unbound);
else
{
Lisp_Object head;
/* Remember the position to put an upper bound on indec.start. */
first_unbound = min (t, first_unbound);
head = EVENT_HEAD (key);
if (SYMBOLP (head))
{
Lisp_Object breakdown;
int modifiers;
breakdown = parse_modifiers (head);
modifiers = XFIXNUM (XCAR (XCDR (breakdown)));
/* Attempt to reduce an unbound mouse event to a simpler
event that is bound:
Drags reduce to clicks.
Double-clicks reduce to clicks.
Triple-clicks reduce to double-clicks, then to clicks.
Up/Down-clicks are eliminated.
Double-downs reduce to downs, then are eliminated.
Triple-downs reduce to double-downs, then to downs,
then are eliminated. */
if (modifiers & (up_modifier | down_modifier
| drag_modifier
| double_modifier | triple_modifier))
{
while (modifiers & (up_modifier | down_modifier
| drag_modifier
| double_modifier | triple_modifier))
{
Lisp_Object new_head, new_click;
if (modifiers & triple_modifier)
modifiers ^= (double_modifier | triple_modifier);
else if (modifiers & double_modifier)
modifiers &= ~double_modifier;
else if (modifiers & drag_modifier)
modifiers &= ~drag_modifier;
else
{
/* Dispose of this `up/down' event by simply jumping
back to replay_key, to get another event.
Note that if this event came from mock input,
then just jumping back to replay_key will just
hand it to us again. So we have to wipe out any
mock input.
We could delete keybuf[t] and shift everything
after that to the left by one spot, but we'd also
have to fix up any variable that points into
keybuf, and shifting isn't really necessary
anyway.
Adding prefixes for non-textual mouse clicks
creates two characters of mock input, and both
must be thrown away. If we're only looking at
the prefix now, we can just jump back to
replay_key. On the other hand, if we've already
processed the prefix, and now the actual click
itself is giving us trouble, then we've lost the
state of the keymaps we want to backtrack to, and
we need to replay the whole sequence to rebuild
it.
Beyond that, only function key expansion could
create more than two keys, but that should never
generate mouse events, so it's okay to zero
mock_input in that case too.
FIXME: The above paragraph seems just plain
wrong, if you consider things like
xterm-mouse-mode. -stef
Isn't this just the most wonderful code ever? */
/* If mock_input > t + 1, the above simplification
will actually end up dropping keys on the floor.
This is probably OK for now, but even
if mock_input <= t + 1, we need to adjust indec,
fkey, and keytran.
Typical case [header-line down-mouse-N]:
mock_input = 2, t = 1, fkey.end = 1,
last_real_key_start = 0. */
if (indec.end > last_real_key_start)
{
indec.end = indec.start
= min (last_real_key_start, indec.start);
indec.map = indec.parent;
if (fkey.end > last_real_key_start)
{
fkey.end = fkey.start
= min (last_real_key_start, fkey.start);
fkey.map = fkey.parent;
if (keytran.end > last_real_key_start)
{
keytran.end = keytran.start
= min (last_real_key_start, keytran.start);
keytran.map = keytran.parent;
}
}
}
if (t == last_real_key_start)
{
mock_input = 0;
goto replay_key;
}
else
{
mock_input = last_real_key_start;
goto replay_sequence;
}
}
new_head
= apply_modifiers (modifiers, XCAR (breakdown));
new_click = list2 (new_head, EVENT_START (key));
/* Look for a binding for this new key. */
new_binding = follow_key (current_binding, new_click);
/* If that click is bound, go for it. */
if (!NILP (new_binding))
{
current_binding = new_binding;
key = new_click;
break;
}
/* Otherwise, we'll leave key set to the drag event. */
}
}
}
}
current_binding = new_binding;
keybuf[t++] = key;
/* Normally, last_nonmenu_event gets the previous key we read.
But when a mouse popup menu is being used,
we don't update last_nonmenu_event; it continues to hold the mouse
event that preceded the first level of menu. */
if (!used_mouse_menu)
last_nonmenu_event = key;
/* Record what part of this_command_keys is the current key sequence. */
this_single_command_key_start = this_command_key_count - t;
/* When 'input-method-function' called above causes events to be
put on 'unread-post-input-method-events', and as result
'reread' is set to 'true', the value of 't' can become larger
than 'this_command_key_count', because 'add_command_key' is
not called to update 'this_command_key_count'. If this
happens, 'this_single_command_key_start' will become negative
above, and any call to 'this-single-command-keys' will return
a garbled vector. See bug #20223 for one such situation.
Here we force 'this_single_command_key_start' to never become
negative, to avoid that. */
if (this_single_command_key_start < 0)
this_single_command_key_start = 0;
/* Look for this sequence in input-decode-map.
Scan from indec.end until we find a bound suffix. */
while (indec.end < t)
{
bool done;
int diff;
done = keyremap_step (keybuf, &indec, max (t, mock_input),
true, &diff, prompt);
if (done)
{
mock_input = diff + max (t, mock_input);
goto replay_sequence;
}
}
if (!KEYMAPP (current_binding)
&& !test_undefined (current_binding)
&& indec.start >= t)
/* There is a binding and it's not a prefix.
(and it doesn't have any input-decode-map translation pending).
There is thus no function-key in this sequence.
Moving fkey.start is important in this case to allow keytran.start
to go over the sequence before we return (since we keep the
invariant that keytran.end <= fkey.start). */
{
if (fkey.start < t)
(fkey.start = fkey.end = t, fkey.map = fkey.parent);
}
else
/* If the sequence is unbound, see if we can hang a function key
off the end of it. */
/* Continue scan from fkey.end until we find a bound suffix. */
while (fkey.end < indec.start)
{
bool done;
int diff;
done = keyremap_step (keybuf, &fkey,
max (t, mock_input),
/* If there's a binding (i.e.
first_binding >= nmaps) we don't want
to apply this function-key-mapping. */
(fkey.end + 1 == t
&& test_undefined (current_binding)),
&diff, prompt);
if (done)
{
mock_input = diff + max (t, mock_input);
/* Adjust the input-decode-map counters. */
indec.end += diff;
indec.start += diff;
goto replay_sequence;
}
}
/* Look for this sequence in key-translation-map.
Scan from keytran.end until we find a bound suffix. */
while (keytran.end < fkey.start)
{
bool done;
int diff;
done = keyremap_step (keybuf, &keytran, max (t, mock_input),
true, &diff, prompt);
if (done)
{
mock_input = diff + max (t, mock_input);
/* Adjust the function-key-map and input-decode-map counters. */
indec.end += diff;
indec.start += diff;
fkey.end += diff;
fkey.start += diff;
goto replay_sequence;
}
}
/* If KEY is not defined in any of the keymaps,
and cannot be part of a function key or translation,
and is an upper case letter
use the corresponding lower-case letter instead. */
if (NILP (current_binding)
&& /* indec.start >= t && fkey.start >= t && */ keytran.start >= t
&& FIXNUMP (key))
{
Lisp_Object new_key;
EMACS_INT k = XFIXNUM (key);
if (k & shift_modifier)
XSETINT (new_key, k & ~shift_modifier);
else if (CHARACTERP (make_fixnum (k & ~CHAR_MODIFIER_MASK)))
{
int dc = downcase (k & ~CHAR_MODIFIER_MASK);
if (dc == (k & ~CHAR_MODIFIER_MASK))
goto not_upcase;
XSETINT (new_key, dc | (k & CHAR_MODIFIER_MASK));
}
else
goto not_upcase;
original_uppercase = key;
original_uppercase_position = t - 1;
/* We have to do this unconditionally, regardless of whether
the lower-case char is defined in the keymaps, because they
might get translated through function-key-map. */
keybuf[t - 1] = new_key;
mock_input = max (t, mock_input);
shift_translated = true;
goto replay_sequence;
}
not_upcase:
if (NILP (current_binding)
&& help_char_p (EVENT_HEAD (key)) && t > 1)
{
read_key_sequence_cmd = Vprefix_help_command;
/* The Microsoft C compiler can't handle the goto that
would go here. */
dummyflag = true;
break;
}
/* If KEY is not defined in any of the keymaps,
and cannot be part of a function key or translation,
and is a shifted function key,
use the corresponding unshifted function key instead. */
if (NILP (current_binding)
&& /* indec.start >= t && fkey.start >= t && */ keytran.start >= t)
{
Lisp_Object breakdown = parse_modifiers (key);
int modifiers
= CONSP (breakdown) ? (XFIXNUM (XCAR (XCDR (breakdown)))) : 0;
if (modifiers & shift_modifier
/* Treat uppercase keys as shifted. */
|| (FIXNUMP (key)
&& (KEY_TO_CHAR (key)
< XCHAR_TABLE (BVAR (current_buffer, downcase_table))->header.size)
&& uppercasep (KEY_TO_CHAR (key))))
{
Lisp_Object new_key
= (modifiers & shift_modifier
? apply_modifiers (modifiers & ~shift_modifier,
XCAR (breakdown))
: make_fixnum (downcase (KEY_TO_CHAR (key)) | modifiers));
original_uppercase = key;
original_uppercase_position = t - 1;
/* We have to do this unconditionally, regardless of whether
the lower-case char is defined in the keymaps, because they
might get translated through function-key-map. */
keybuf[t - 1] = new_key;
mock_input = max (t, mock_input);
/* Reset fkey (and consequently keytran) to apply
function-key-map on the result, so that S-backspace is
correctly mapped to DEL (via backspace). OTOH,
input-decode-map doesn't need to go through it again. */
fkey.start = fkey.end = 0;
keytran.start = keytran.end = 0;
shift_translated = true;
goto replay_sequence;
}
}
}
if (!dummyflag)
read_key_sequence_cmd = current_binding;
read_key_sequence_remapped
/* Remap command through active keymaps.
Do the remapping here, before the unbind_to so it uses the keymaps
of the appropriate buffer. */
= SYMBOLP (read_key_sequence_cmd)
? Fcommand_remapping (read_key_sequence_cmd, Qnil, Qnil)
: Qnil;
unread_switch_frame = delayed_switch_frame;
unbind_to (count, Qnil);
/* Don't downcase the last character if the caller says don't.
Don't downcase it if the result is undefined, either. */
if ((dont_downcase_last || NILP (current_binding))
&& t > 0
&& t - 1 == original_uppercase_position)
{
keybuf[t - 1] = original_uppercase;
shift_translated = false;
}
if (shift_translated)
Vthis_command_keys_shift_translated = Qt;
/* Occasionally we fabricate events, perhaps by expanding something
according to function-key-map, or by adding a prefix symbol to a
mouse click in the scroll bar or modeline. In this cases, return
the entire generated key sequence, even if we hit an unbound
prefix or a definition before the end. This means that you will
be able to push back the event properly, and also means that
read-key-sequence will always return a logical unit.
Better ideas? */
for (; t < mock_input; t++)
add_command_key (keybuf[t]);
echo_update ();
return t;
}
static Lisp_Object
read_key_sequence_vs (Lisp_Object prompt, Lisp_Object continue_echo,
Lisp_Object dont_downcase_last,
Lisp_Object can_return_switch_frame,
Lisp_Object cmd_loop, bool allow_string)
{
ptrdiff_t count = SPECPDL_INDEX ();
if (!NILP (prompt))
CHECK_STRING (prompt);
maybe_quit ();
specbind (Qinput_method_exit_on_first_char,
(NILP (cmd_loop) ? Qt : Qnil));
specbind (Qinput_method_use_echo_area,
(NILP (cmd_loop) ? Qt : Qnil));
if (NILP (continue_echo))
{
this_command_key_count = 0;
this_single_command_key_start = 0;
}
#ifdef HAVE_WINDOW_SYSTEM
if (display_hourglass_p)
cancel_hourglass ();
#endif
raw_keybuf_count = 0;
Lisp_Object keybuf[READ_KEY_ELTS];
int i = read_key_sequence (keybuf, prompt, ! NILP (dont_downcase_last),
! NILP (can_return_switch_frame), false, false);
#if 0 /* The following is fine for code reading a key sequence and
then proceeding with a lengthy computation, but it's not good
for code reading keys in a loop, like an input method. */
#ifdef HAVE_WINDOW_SYSTEM
if (display_hourglass_p)
start_hourglass ();
#endif
#endif
if (i == -1)
{
Vquit_flag = Qt;
maybe_quit ();
}
return unbind_to (count,
((allow_string ? make_event_array : Fvector)
(i, keybuf)));
}
DEFUN ("read-key-sequence", Fread_key_sequence, Sread_key_sequence, 1, 5, 0,
doc: /* Read a sequence of keystrokes and return as a string or vector.
The sequence is sufficient to specify a non-prefix command in the
current local and global maps.
First arg PROMPT is a prompt string. If nil, do not prompt specially.
Second (optional) arg CONTINUE-ECHO, if non-nil, means this key echos
as a continuation of the previous key.
The third (optional) arg DONT-DOWNCASE-LAST, if non-nil, means do not
convert the last event to lower case. (Normally any upper case event
is converted to lower case if the original event is undefined and the lower
case equivalent is defined.) A non-nil value is appropriate for reading
a key sequence to be defined.
A C-g typed while in this function is treated like any other character,
and `quit-flag' is not set.
If the key sequence starts with a mouse click, then the sequence is read
using the keymaps of the buffer of the window clicked in, not the buffer
of the selected window as normal.
`read-key-sequence' drops unbound button-down events, since you normally
only care about the click or drag events which follow them. If a drag
or multi-click event is unbound, but the corresponding click event would
be bound, `read-key-sequence' turns the event into a click event at the
drag's starting position. This means that you don't have to distinguish
between click and drag, double, or triple events unless you want to.
`read-key-sequence' prefixes mouse events on mode lines, the vertical
lines separating windows, and scroll bars with imaginary keys
`mode-line', `vertical-line', and `vertical-scroll-bar'.
Optional fourth argument CAN-RETURN-SWITCH-FRAME non-nil means that this
function will process a switch-frame event if the user switches frames
before typing anything. If the user switches frames in the middle of a
key sequence, or at the start of the sequence but CAN-RETURN-SWITCH-FRAME
is nil, then the event will be put off until after the current key sequence.
`read-key-sequence' checks `function-key-map' for function key
sequences, where they wouldn't conflict with ordinary bindings. See
`function-key-map' for more details.
The optional fifth argument CMD-LOOP, if non-nil, means
that this key sequence is being read by something that will
read commands one after another. It should be nil if the caller
will read just one key sequence. */)
(Lisp_Object prompt, Lisp_Object continue_echo, Lisp_Object dont_downcase_last, Lisp_Object can_return_switch_frame, Lisp_Object cmd_loop)
{
return read_key_sequence_vs (prompt, continue_echo, dont_downcase_last,
can_return_switch_frame, cmd_loop, true);
}
DEFUN ("read-key-sequence-vector", Fread_key_sequence_vector,
Sread_key_sequence_vector, 1, 5, 0,
doc: /* Like `read-key-sequence' but always return a vector. */)
(Lisp_Object prompt, Lisp_Object continue_echo, Lisp_Object dont_downcase_last, Lisp_Object can_return_switch_frame, Lisp_Object cmd_loop)
{
return read_key_sequence_vs (prompt, continue_echo, dont_downcase_last,
can_return_switch_frame, cmd_loop, false);
}
/* Return true if input events are pending. */
bool
detect_input_pending (void)
{
return input_pending || get_input_pending (0);
}
/* Return true if input events other than mouse movements are
pending. */
bool
detect_input_pending_ignore_squeezables (void)
{
return input_pending || get_input_pending (READABLE_EVENTS_IGNORE_SQUEEZABLES);
}
/* Return true if input events are pending, and run any pending timers. */
bool
detect_input_pending_run_timers (bool do_display)
{
unsigned old_timers_run = timers_run;
if (!input_pending)
get_input_pending (READABLE_EVENTS_DO_TIMERS_NOW);
if (old_timers_run != timers_run && do_display)
redisplay_preserve_echo_area (8);
return input_pending;
}
/* This is called in some cases before a possible quit.
It cases the next call to detect_input_pending to recompute input_pending.
So calling this function unnecessarily can't do any harm. */
void
clear_input_pending (void)
{
input_pending = false;
}
/* Return true if there are pending requeued events.
This isn't used yet. The hope is to make wait_reading_process_output
call it, and return if it runs Lisp code that unreads something.
The problem is, kbd_buffer_get_event needs to be fixed to know what
to do in that case. It isn't trivial. */
bool
requeued_events_pending_p (void)
{
return (CONSP (Vunread_command_events));
}
DEFUN ("input-pending-p", Finput_pending_p, Sinput_pending_p, 0, 1, 0,
doc: /* Return t if command input is currently available with no wait.
Actually, the value is nil only if we can be sure that no input is available;
if there is a doubt, the value is t.
If CHECK-TIMERS is non-nil, timers that are ready to run will do so. */)
(Lisp_Object check_timers)
{
if (CONSP (Vunread_command_events)
|| !NILP (Vunread_post_input_method_events)
|| !NILP (Vunread_input_method_events))
return (Qt);
/* Process non-user-visible events (Bug#10195). */
process_special_events ();
return (get_input_pending ((NILP (check_timers)
? 0 : READABLE_EVENTS_DO_TIMERS_NOW)
| READABLE_EVENTS_FILTER_EVENTS)
? Qt : Qnil);
}
/* Reallocate recent_keys copying the recorded keystrokes
in the right order. */
static void
update_recent_keys (int new_size, int kept_keys)
{
int osize = ASIZE (recent_keys);
eassert (recent_keys_index < osize);
eassert (kept_keys <= min (osize, new_size));
Lisp_Object v = make_nil_vector (new_size);
int i, idx;
for (i = 0; i < kept_keys; ++i)
{
idx = recent_keys_index - kept_keys + i;
while (idx < 0)
idx += osize;
ASET (v, i, AREF (recent_keys, idx));
}
recent_keys = v;
total_keys = kept_keys;
recent_keys_index = total_keys % new_size;
lossage_limit = new_size;
}
DEFUN ("lossage-size", Flossage_size, Slossage_size, 0, 1,
"(list (read-number \"Set maximum keystrokes to: \" (lossage-size)))",
doc: /* Return or set the maximum number of keystrokes to save.
If called with a non-nil ARG, set the limit to ARG and return it.
Otherwise, return the current limit.
The saved keystrokes are shown by `view-lossage'. */)
(Lisp_Object arg)
{
if (NILP(arg))
return make_fixnum (lossage_limit);
if (!FIXNATP (arg))
user_error ("Value must be a positive integer");
int osize = ASIZE (recent_keys);
eassert (lossage_limit == osize);
int min_size = MIN_NUM_RECENT_KEYS;
int new_size = XFIXNAT (arg);
if (new_size == osize)
return make_fixnum (lossage_limit);
if (new_size < min_size)
{
AUTO_STRING (fmt, "Value must be >= %d");
Fsignal (Quser_error, list1 (CALLN (Fformat, fmt, make_fixnum (min_size))));
}
int kept_keys = new_size > osize ? total_keys : min (new_size, total_keys);
update_recent_keys (new_size, kept_keys);
return make_fixnum (lossage_limit);
}
DEFUN ("recent-keys", Frecent_keys, Srecent_keys, 0, 1, 0,
doc: /* Return vector of last few events, not counting those from keyboard macros.
If INCLUDE-CMDS is non-nil, include the commands that were run,
represented as pseudo-events of the form (nil . COMMAND). */)
(Lisp_Object include_cmds)
{
bool cmds = !NILP (include_cmds);
if (!total_keys
|| (cmds && total_keys < lossage_limit))
return Fvector (total_keys,
XVECTOR (recent_keys)->contents);
else
{
Lisp_Object es = Qnil;
int i = (total_keys < lossage_limit
? 0 : recent_keys_index);
eassert (recent_keys_index < lossage_limit);
do
{
Lisp_Object e = AREF (recent_keys, i);
if (cmds || !CONSP (e) || !NILP (XCAR (e)))
es = Fcons (e, es);
if (++i >= lossage_limit)
i = 0;
} while (i != recent_keys_index);
es = Fnreverse (es);
return Fvconcat (1, &es);
}
}
DEFUN ("this-command-keys", Fthis_command_keys, Sthis_command_keys, 0, 0, 0,
doc: /* Return the key sequence that invoked this command.
However, if the command has called `read-key-sequence', it returns
the last key sequence that has been read.
The value is a string or a vector.
See also `this-command-keys-vector'. */)
(void)
{
return make_event_array (this_command_key_count,
XVECTOR (this_command_keys)->contents);
}
DEFUN ("set--this-command-keys", Fset__this_command_keys,
Sset__this_command_keys, 1, 1, 0,
doc: /* Set the vector to be returned by `this-command-keys'.
The argument KEYS must be a string.
Internal use only. */)
(Lisp_Object keys)
{
CHECK_STRING (keys);
this_command_key_count = 0;
this_single_command_key_start = 0;
ptrdiff_t charidx = 0, byteidx = 0;
int key0 = fetch_string_char_advance (keys, &charidx, &byteidx);
if (CHAR_BYTE8_P (key0))
key0 = CHAR_TO_BYTE8 (key0);
/* Kludge alert: this makes M-x be in the form expected by
novice.el. (248 is \370, a.k.a. "Meta-x".) Any better ideas? */
if (key0 == 248)
add_command_key (make_fixnum ('x' | meta_modifier));
else
add_command_key (make_fixnum (key0));
for (ptrdiff_t i = 1; i < SCHARS (keys); i++)
{
int key_i = fetch_string_char_advance (keys, &charidx, &byteidx);
if (CHAR_BYTE8_P (key_i))
key_i = CHAR_TO_BYTE8 (key_i);
add_command_key (make_fixnum (key_i));
}
return Qnil;
}
DEFUN ("this-command-keys-vector", Fthis_command_keys_vector, Sthis_command_keys_vector, 0, 0, 0,
doc: /* Return the key sequence that invoked this command, as a vector.
However, if the command has called `read-key-sequence', it returns
the last key sequence that has been read.
See also `this-command-keys'. */)
(void)
{
return Fvector (this_command_key_count,
XVECTOR (this_command_keys)->contents);
}
DEFUN ("this-single-command-keys", Fthis_single_command_keys,
Sthis_single_command_keys, 0, 0, 0,
doc: /* Return the key sequence that invoked this command.
More generally, it returns the last key sequence read, either by
the command loop or by `read-key-sequence'.
The value is always a vector. */)
(void)
{
return Fvector (this_command_key_count
- this_single_command_key_start,
(XVECTOR (this_command_keys)->contents
+ this_single_command_key_start));
}
DEFUN ("this-single-command-raw-keys", Fthis_single_command_raw_keys,
Sthis_single_command_raw_keys, 0, 0, 0,
doc: /* Return the raw events that were read for this command.
More generally, it returns the last key sequence read, either by
the command loop or by `read-key-sequence'.
Unlike `this-single-command-keys', this function's value
shows the events before all translations (except for input methods).
The value is always a vector. */)
(void)
{
return Fvector (raw_keybuf_count, XVECTOR (raw_keybuf)->contents);
}
DEFUN ("clear-this-command-keys", Fclear_this_command_keys,
Sclear_this_command_keys, 0, 1, 0,
doc: /* Clear out the vector that `this-command-keys' returns.
Also clear the record of the last 300 input events, unless optional arg
KEEP-RECORD is non-nil. */)
(Lisp_Object keep_record)
{
int i;
this_command_key_count = 0;
if (NILP (keep_record))
{
for (i = 0; i < ASIZE (recent_keys); ++i)
ASET (recent_keys, i, Qnil);
total_keys = 0;
recent_keys_index = 0;
}
return Qnil;
}
DEFUN ("recursion-depth", Frecursion_depth, Srecursion_depth, 0, 0, 0,
doc: /* Return the current depth in recursive edits. */)
(void)
{
EMACS_INT sum;
INT_ADD_WRAPV (command_loop_level, minibuf_level, &sum);
return make_fixnum (sum);
}
DEFUN ("open-dribble-file", Fopen_dribble_file, Sopen_dribble_file, 1, 1,
"FOpen dribble file: ",
doc: /* Start writing input events to a dribble file called FILE.
Any previously open dribble file will be closed first. If FILE is
nil, just close the dribble file, if any.
If the file is still open when Emacs exits, it will be closed then.
The events written to the file include keyboard and mouse input
events, but not events from executing keyboard macros. The events are
written to the dribble file immediately without line buffering.
Be aware that this records ALL characters you type!
This may include sensitive information such as passwords. */)
(Lisp_Object file)
{
if (dribble)
{
block_input ();
fclose (dribble);
unblock_input ();
dribble = 0;
}
if (!NILP (file))
{
int fd;
Lisp_Object encfile;
file = Fexpand_file_name (file, Qnil);
encfile = ENCODE_FILE (file);
fd = emacs_open (SSDATA (encfile), O_WRONLY | O_CREAT | O_EXCL, 0600);
if (fd < 0 && errno == EEXIST
&& (unlink (SSDATA (encfile)) == 0 || errno == ENOENT))
fd = emacs_open (SSDATA (encfile), O_WRONLY | O_CREAT | O_EXCL, 0600);
dribble = fd < 0 ? 0 : fdopen (fd, "w");
if (dribble == 0)
report_file_error ("Opening dribble", file);
}
return Qnil;
}
DEFUN ("discard-input", Fdiscard_input, Sdiscard_input, 0, 0, 0,
doc: /* Discard the contents of the terminal input buffer.
Also end any kbd macro being defined. */)
(void)
{
if (!NILP (KVAR (current_kboard, defining_kbd_macro)))
{
/* Discard the last command from the macro. */
Fcancel_kbd_macro_events ();
end_kbd_macro ();
}
Vunread_command_events = Qnil;
discard_tty_input ();
kbd_fetch_ptr = kbd_store_ptr;
input_pending = false;
return Qnil;
}
DEFUN ("suspend-emacs", Fsuspend_emacs, Ssuspend_emacs, 0, 1, "",
doc: /* Stop Emacs and return to superior process. You can resume later.
If `cannot-suspend' is non-nil, or if the system doesn't support job
control, run a subshell instead.
If optional arg STUFFSTRING is non-nil, its characters are stuffed
to be read as terminal input by Emacs's parent, after suspension.
Before suspending, run the normal hook `suspend-hook'.
After resumption run the normal hook `suspend-resume-hook'.
Some operating systems cannot stop the Emacs process and resume it later.
On such systems, Emacs starts a subshell instead of suspending. */)
(Lisp_Object stuffstring)
{
ptrdiff_t count = SPECPDL_INDEX ();
int old_height, old_width;
int width, height;
if (tty_list && tty_list->next)
error ("There are other tty frames open; close them before suspending Emacs");
if (!NILP (stuffstring))
CHECK_STRING (stuffstring);
run_hook (intern ("suspend-hook"));
get_tty_size (fileno (CURTTY ()->input), &old_width, &old_height);
reset_all_sys_modes ();
/* sys_suspend can get an error if it tries to fork a subshell
and the system resources aren't available for that. */
record_unwind_protect_void (init_all_sys_modes);
stuff_buffered_input (stuffstring);
if (cannot_suspend)
sys_subshell ();
else
sys_suspend ();
unbind_to (count, Qnil);
/* Check if terminal/window size has changed.
Note that this is not useful when we are running directly
with a window system; but suspend should be disabled in that case. */
get_tty_size (fileno (CURTTY ()->input), &width, &height);
if (width != old_width || height != old_height)
change_frame_size (SELECTED_FRAME (), width, height, false, false, false);
run_hook (intern ("suspend-resume-hook"));
return Qnil;
}
/* If STUFFSTRING is a string, stuff its contents as pending terminal input.
Then in any case stuff anything Emacs has read ahead and not used. */
void
stuff_buffered_input (Lisp_Object stuffstring)
{
#ifdef SIGTSTP /* stuff_char is defined if SIGTSTP. */
register unsigned char *p;
if (STRINGP (stuffstring))
{
register ptrdiff_t count;
p = SDATA (stuffstring);
count = SBYTES (stuffstring);
while (count-- > 0)
stuff_char (*p++);
stuff_char ('\n');
}
/* Anything we have read ahead, put back for the shell to read. */
/* ?? What should this do when we have multiple keyboards??
Should we ignore anything that was typed in at the "wrong" kboard?
rms: we should stuff everything back into the kboard
it came from. */
for (; kbd_fetch_ptr != kbd_store_ptr;
kbd_fetch_ptr = next_kbd_event (kbd_fetch_ptr))
{
if (kbd_fetch_ptr->kind == ASCII_KEYSTROKE_EVENT)
stuff_char (kbd_fetch_ptr->ie.code);
clear_event (&kbd_fetch_ptr->ie);
}
input_pending = false;
#endif /* SIGTSTP */
}
void
set_waiting_for_input (struct timespec *time_to_clear)
{
input_available_clear_time = time_to_clear;
/* Tell handle_interrupt to throw back to read_char, */
waiting_for_input = true;
/* If handle_interrupt was called before and buffered a C-g,
make it run again now, to avoid timing error. */
if (!NILP (Vquit_flag))
quit_throw_to_read_char (0);
}
void
clear_waiting_for_input (void)
{
/* Tell handle_interrupt not to throw back to read_char, */
waiting_for_input = false;
input_available_clear_time = 0;
}
/* The SIGINT handler.
If we have a frame on the controlling tty, we assume that the
SIGINT was generated by C-g, so we call handle_interrupt.
Otherwise, tell maybe_quit to kill Emacs. */
static void
handle_interrupt_signal (int sig)
{
/* See if we have an active terminal on our controlling tty. */
struct terminal *terminal = get_named_terminal (DEV_TTY);
if (!terminal)
{
/* If there are no frames there, let's pretend that we are a
well-behaving UN*X program and quit. We must not call Lisp
in a signal handler, so tell maybe_quit to exit when it is
safe. */
Vquit_flag = Qkill_emacs;
}
else
{
/* Otherwise, the SIGINT was probably generated by C-g. */
/* Set internal_last_event_frame to the top frame of the
controlling tty, if we have a frame there. We disable the
interrupt key on secondary ttys, so the SIGINT must have come
from the controlling tty. */
internal_last_event_frame = terminal->display_info.tty->top_frame;
handle_interrupt (1);
}
}
static void
deliver_interrupt_signal (int sig)
{
deliver_process_signal (sig, handle_interrupt_signal);
}
/* Output MSG directly to standard output, without buffering. Ignore
failures. This is safe in a signal handler. */
static void
write_stdout (char const *msg)
{
ignore_value (write (STDOUT_FILENO, msg, strlen (msg)));
}
/* Read a byte from stdin, without buffering. Safe in signal handlers. */
static int
read_stdin (void)
{
char c;
return read (STDIN_FILENO, &c, 1) == 1 ? c : EOF;
}
/* If Emacs is stuck because `inhibit-quit' is true, then keep track
of the number of times C-g has been requested. If C-g is pressed
enough times, then quit anyway. See bug#6585. */
static int volatile force_quit_count;
/* This routine is called at interrupt level in response to C-g.
It is called from the SIGINT handler or kbd_buffer_store_event.
If `waiting_for_input' is non zero, then unless `echoing' is
nonzero, immediately throw back to read_char.
Otherwise it sets the Lisp variable quit-flag not-nil. This causes
eval to throw, when it gets a chance. If quit-flag is already
non-nil, it stops the job right away. */
static void
handle_interrupt (bool in_signal_handler)
{
char c;
cancel_echoing ();
/* XXX This code needs to be revised for multi-tty support. */
if (!NILP (Vquit_flag) && get_named_terminal (DEV_TTY))
{
if (! in_signal_handler)
{
/* If SIGINT isn't blocked, don't let us be interrupted by
a SIGINT. It might be harmful due to non-reentrancy
in I/O functions. */
sigset_t blocked;
sigemptyset (&blocked);
sigaddset (&blocked, SIGINT);
pthread_sigmask (SIG_BLOCK, &blocked, 0);
fflush (stdout);
}
reset_all_sys_modes ();
#ifdef SIGTSTP
/*
* On systems which can suspend the current process and return to the original
* shell, this command causes the user to end up back at the shell.
* The "Auto-save" and "Abort" questions are not asked until
* the user elects to return to emacs, at which point he can save the current
* job and either dump core or continue.
*/
sys_suspend ();
#else
/* Perhaps should really fork an inferior shell?
But that would not provide any way to get back
to the original shell, ever. */
write_stdout ("No support for stopping a process"
" on this operating system;\n"
"you can continue or abort.\n");
#endif /* not SIGTSTP */
#ifdef MSDOS
/* We must remain inside the screen area when the internal terminal
is used. Note that [Enter] is not echoed by dos. */
cursor_to (SELECTED_FRAME (), 0, 0);
#endif
write_stdout ("Emacs is resuming after an emergency escape.\n");
/* It doesn't work to autosave while GC is in progress;
the code used for auto-saving doesn't cope with the mark bit. */
if (!gc_in_progress)
{
write_stdout ("Auto-save? (y or n) ");
c = read_stdin ();
if (c == 'y' || c == 'Y')
{
Fdo_auto_save (Qt, Qnil);
#ifdef MSDOS
write_stdout ("\r\nAuto-save done");
#else
write_stdout ("Auto-save done\n");
#endif
}
while (c != '\n')
c = read_stdin ();
}
else
{
/* During GC, it must be safe to reenable quitting again. */
Vinhibit_quit = Qnil;
write_stdout
(
#ifdef MSDOS
"\r\n"
#endif
"Garbage collection in progress; cannot auto-save now\r\n"
"but will instead do a real quit"
" after garbage collection ends\r\n");
}
#ifdef MSDOS
write_stdout ("\r\nAbort? (y or n) ");
#else
write_stdout ("Abort (and dump core)? (y or n) ");
#endif
c = read_stdin ();
if (c == 'y' || c == 'Y')
emacs_abort ();
while (c != '\n')
c = read_stdin ();
#ifdef MSDOS
write_stdout ("\r\nContinuing...\r\n");
#else /* not MSDOS */
write_stdout ("Continuing...\n");
#endif /* not MSDOS */
init_all_sys_modes ();
}
else
{
/* Request quit when it's safe. */
int count = NILP (Vquit_flag) ? 1 : force_quit_count + 1;
force_quit_count = count;
if (count == 3)
Vinhibit_quit = Qnil;
Vquit_flag = Qt;
}
pthread_sigmask (SIG_SETMASK, &empty_mask, 0);
/* TODO: The longjmp in this call throws the NS event loop integration off,
and it seems to do fine without this. Probably some attention
needs to be paid to the setting of waiting_for_input in
wait_reading_process_output() under HAVE_NS because of the call
to ns_select there (needed because otherwise events aren't picked up
outside of polling since we don't get SIGIO like X and we don't have a
separate event loop thread like W32. */
#ifndef HAVE_NS
#ifdef THREADS_ENABLED
/* If we were called from a signal handler, we must be in the main
thread, see deliver_process_signal. So we must make sure the
main thread holds the global lock. */
if (in_signal_handler)
maybe_reacquire_global_lock ();
#endif
if (waiting_for_input && !echoing)
quit_throw_to_read_char (in_signal_handler);
#endif
}
/* Handle a C-g by making read_char return C-g. */
static void
quit_throw_to_read_char (bool from_signal)
{
/* When not called from a signal handler it is safe to call
Lisp. */
if (!from_signal && EQ (Vquit_flag, Qkill_emacs))
Fkill_emacs (Qnil);
/* Prevent another signal from doing this before we finish. */
clear_waiting_for_input ();
input_pending = false;
Vunread_command_events = Qnil;
if (FRAMEP (internal_last_event_frame)
&& !EQ (internal_last_event_frame, selected_frame))
do_switch_frame (make_lispy_switch_frame (internal_last_event_frame),
0, 0, Qnil);
sys_longjmp (getcjmp, 1);
}
DEFUN ("set-input-interrupt-mode", Fset_input_interrupt_mode,
Sset_input_interrupt_mode, 1, 1, 0,
doc: /* Set interrupt mode of reading keyboard input.
If INTERRUPT is non-nil, Emacs will use input interrupts;
otherwise Emacs uses CBREAK mode.
See also `current-input-mode'. */)
(Lisp_Object interrupt)
{
bool new_interrupt_input;
#ifdef USABLE_SIGIO
#ifdef HAVE_X_WINDOWS
if (x_display_list != NULL)
{
/* When using X, don't give the user a real choice,
because we haven't implemented the mechanisms to support it. */
new_interrupt_input = true;
}
else
#endif /* HAVE_X_WINDOWS */
new_interrupt_input = !NILP (interrupt);
#else /* not USABLE_SIGIO */
new_interrupt_input = false;
#endif /* not USABLE_SIGIO */
if (new_interrupt_input != interrupt_input)
{
#ifdef POLL_FOR_INPUT
stop_polling ();
#endif
#ifndef DOS_NT
/* this causes startup screen to be restored and messes with the mouse */
reset_all_sys_modes ();
interrupt_input = new_interrupt_input;
init_all_sys_modes ();
#else
interrupt_input = new_interrupt_input;
#endif
#ifdef POLL_FOR_INPUT
poll_suppress_count = 1;
start_polling ();
#endif
}
return Qnil;
}
DEFUN ("set-output-flow-control", Fset_output_flow_control, Sset_output_flow_control, 1, 2, 0,
doc: /* Enable or disable ^S/^Q flow control for output to TERMINAL.
If FLOW is non-nil, flow control is enabled and you cannot use C-s or
C-q in key sequences.
This setting only has an effect on tty terminals and only when
Emacs reads input in CBREAK mode; see `set-input-interrupt-mode'.
See also `current-input-mode'. */)
(Lisp_Object flow, Lisp_Object terminal)
{
struct terminal *t = decode_tty_terminal (terminal);
struct tty_display_info *tty;
if (!t)
return Qnil;
tty = t->display_info.tty;
if (tty->flow_control != !NILP (flow))
{
#ifndef DOS_NT
/* This causes startup screen to be restored and messes with the mouse. */
reset_sys_modes (tty);
#endif
tty->flow_control = !NILP (flow);
#ifndef DOS_NT
init_sys_modes (tty);
#endif
}
return Qnil;
}
DEFUN ("set-input-meta-mode", Fset_input_meta_mode, Sset_input_meta_mode, 1, 2, 0,
doc: /* Enable or disable 8-bit input on TERMINAL.
If META is t, Emacs will accept 8-bit input, and interpret the 8th
bit as the Meta modifier before it decodes the characters.
If META is `encoded', Emacs will interpret the 8th bit of single-byte
characters after decoding the characters.
If META is nil, Emacs will ignore the top bit, on the assumption it is
parity.
Otherwise, Emacs will accept and pass through 8-bit input without
specially interpreting the top bit.
This setting only has an effect on tty terminal devices.
Optional parameter TERMINAL specifies the tty terminal device to use.
It may be a terminal object, a frame, or nil for the terminal used by
the currently selected frame.
See also `current-input-mode'. */)
(Lisp_Object meta, Lisp_Object terminal)
{
struct terminal *t = decode_tty_terminal (terminal);
struct tty_display_info *tty;
int new_meta;
if (!t)
return Qnil;
tty = t->display_info.tty;
if (NILP (meta))
new_meta = 0;
else if (EQ (meta, Qt))
new_meta = 1;
else if (EQ (meta, Qencoded))
new_meta = 3;
else
new_meta = 2;
if (tty->meta_key != new_meta)
{
#ifndef DOS_NT
/* this causes startup screen to be restored and messes with the mouse */
reset_sys_modes (tty);
#endif
tty->meta_key = new_meta;
#ifndef DOS_NT
init_sys_modes (tty);
#endif
}
return Qnil;
}
DEFUN ("set-quit-char", Fset_quit_char, Sset_quit_char, 1, 1, 0,
doc: /* Specify character used for quitting.
QUIT must be an ASCII character.
This function only has an effect on the controlling tty of the Emacs
process.
See also `current-input-mode'. */)
(Lisp_Object quit)
{
struct terminal *t = get_named_terminal (DEV_TTY);
struct tty_display_info *tty;
if (!t)
return Qnil;
tty = t->display_info.tty;
if (NILP (quit) || !FIXNUMP (quit) || XFIXNUM (quit) < 0 || XFIXNUM (quit) > 0400)
error ("QUIT must be an ASCII character");
#ifndef DOS_NT
/* this causes startup screen to be restored and messes with the mouse */
reset_sys_modes (tty);
#endif
/* Don't let this value be out of range. */
quit_char = XFIXNUM (quit) & (tty->meta_key == 0 ? 0177 : 0377);
#ifndef DOS_NT
init_sys_modes (tty);
#endif
return Qnil;
}
DEFUN ("set-input-mode", Fset_input_mode, Sset_input_mode, 3, 4, 0,
doc: /* Set mode of reading keyboard input.
First arg INTERRUPT non-nil means use input interrupts;
nil means use CBREAK mode.
Second arg FLOW non-nil means use ^S/^Q flow control for output to terminal
(no effect except in CBREAK mode).
Third arg META t means accept 8-bit input (for a Meta key).
META nil means ignore the top bit, on the assumption it is parity.
META `encoded' means accept 8-bit input and interpret Meta after
decoding the input characters.
Otherwise, accept 8-bit input and don't use the top bit for Meta.
Optional fourth arg QUIT if non-nil specifies character to use for quitting.
See also `current-input-mode'. */)
(Lisp_Object interrupt, Lisp_Object flow, Lisp_Object meta, Lisp_Object quit)
{
Fset_input_interrupt_mode (interrupt);
Fset_output_flow_control (flow, Qnil);
Fset_input_meta_mode (meta, Qnil);
if (!NILP (quit))
Fset_quit_char (quit);
return Qnil;
}
DEFUN ("current-input-mode", Fcurrent_input_mode, Scurrent_input_mode, 0, 0, 0,
doc: /* Return information about the way Emacs currently reads keyboard input.
The value is a list of the form (INTERRUPT FLOW META QUIT), where
INTERRUPT is non-nil if Emacs is using interrupt-driven input; if
nil, Emacs is using CBREAK mode.
FLOW is non-nil if Emacs uses ^S/^Q flow control for output to the
terminal; this does not apply if Emacs uses interrupt-driven input.
META is t if accepting 8-bit unencoded input with 8th bit as Meta flag.
META is `encoded' if accepting 8-bit encoded input with 8th bit as
Meta flag which has to be interpreted after decoding the input.
META is nil if ignoring the top bit of input, on the assumption that
it is a parity bit.
META is neither t nor nil if accepting 8-bit input and using
all 8 bits as the character code.
QUIT is the character Emacs currently uses to quit.
The elements of this list correspond to the arguments of
`set-input-mode'. */)
(void)
{
struct frame *sf = XFRAME (selected_frame);
Lisp_Object interrupt = interrupt_input ? Qt : Qnil;
Lisp_Object flow, meta;
if (FRAME_TERMCAP_P (sf) || FRAME_MSDOS_P (sf))
{
flow = FRAME_TTY (sf)->flow_control ? Qt : Qnil;
meta = (FRAME_TTY (sf)->meta_key == 2
? make_fixnum (0)
: (CURTTY ()->meta_key == 1
? Qt
: (CURTTY ()->meta_key == 3 ? Qencoded : Qnil)));
}
else
{
flow = Qnil;
meta = Qt;
}
Lisp_Object quit = make_fixnum (quit_char);
return list4 (interrupt, flow, meta, quit);
}
DEFUN ("posn-at-x-y", Fposn_at_x_y, Sposn_at_x_y, 2, 4, 0,
doc: /* Return position information for pixel coordinates X and Y.
By default, X and Y are relative to text area of the selected window.
Optional third arg FRAME-OR-WINDOW non-nil specifies frame or window.
If optional fourth arg WHOLE is non-nil, X is relative to the left
edge of the window.
The return value is similar to a mouse click position:
(WINDOW AREA-OR-POS (X . Y) TIMESTAMP OBJECT POS (COL . ROW)
IMAGE (DX . DY) (WIDTH . HEIGHT))
The `posn-' functions access elements of such lists. */)
(Lisp_Object x, Lisp_Object y, Lisp_Object frame_or_window, Lisp_Object whole)
{
CHECK_FIXNUM (x);
/* We allow X of -1, for the newline in a R2L line that overflowed
into the left fringe. */
if (XFIXNUM (x) != -1)
CHECK_FIXNAT (x);
CHECK_FIXNAT (y);
if (NILP (frame_or_window))
frame_or_window = selected_window;
if (WINDOWP (frame_or_window))
{
struct window *w = decode_live_window (frame_or_window);
XSETINT (x, (XFIXNUM (x)
+ WINDOW_LEFT_EDGE_X (w)
+ (NILP (whole)
? window_box_left_offset (w, TEXT_AREA)
: 0)));
XSETINT (y, WINDOW_TO_FRAME_PIXEL_Y (w, XFIXNUM (y)));
frame_or_window = w->frame;
}
CHECK_LIVE_FRAME (frame_or_window);
return make_lispy_position (XFRAME (frame_or_window), x, y, 0);
}
DEFUN ("posn-at-point", Fposn_at_point, Sposn_at_point, 0, 2, 0,
doc: /* Return position information for buffer position POS in WINDOW.
POS defaults to point in WINDOW; WINDOW defaults to the selected window.
Return nil if POS is not visible in WINDOW. Otherwise,
the return value is similar to that returned by `event-start' for
a mouse click at the upper left corner of the glyph corresponding
to POS:
(WINDOW AREA-OR-POS (X . Y) TIMESTAMP OBJECT POS (COL . ROW)
IMAGE (DX . DY) (WIDTH . HEIGHT))
The `posn-' functions access elements of such lists. */)
(Lisp_Object pos, Lisp_Object window)
{
Lisp_Object tem;
if (NILP (window))
window = selected_window;
tem = Fpos_visible_in_window_p (pos, window, Qt);
if (!NILP (tem))
{
Lisp_Object x = XCAR (tem);
Lisp_Object y = XCAR (XCDR (tem));
Lisp_Object aux_info = XCDR (XCDR (tem));
int y_coord = XFIXNUM (y);
/* Point invisible due to hscrolling? X can be -1 when a
newline in a R2L line overflows into the left fringe. */
if (XFIXNUM (x) < -1)
return Qnil;
if (!NILP (aux_info) && y_coord < 0)
{
int rtop = XFIXNUM (XCAR (aux_info));
y = make_fixnum (y_coord + rtop);
}
tem = Fposn_at_x_y (x, y, window, Qnil);
}
return tem;
}
/* Set up a new kboard object with reasonable initial values.
TYPE is a window system for which this keyboard is used. */
static void
init_kboard (KBOARD *kb, Lisp_Object type)
{
kset_overriding_terminal_local_map (kb, Qnil);
kset_last_command (kb, Qnil);
kset_real_last_command (kb, Qnil);
kset_keyboard_translate_table (kb, Qnil);
kset_last_repeatable_command (kb, Qnil);
kset_prefix_arg (kb, Qnil);
kset_last_prefix_arg (kb, Qnil);
kset_kbd_queue (kb, Qnil);
kb->kbd_queue_has_data = false;
kb->immediate_echo = false;
kset_echo_string (kb, Qnil);
kset_echo_prompt (kb, Qnil);
kb->kbd_macro_buffer = 0;
kb->kbd_macro_bufsize = 0;
kset_defining_kbd_macro (kb, Qnil);
kset_last_kbd_macro (kb, Qnil);
kb->reference_count = 0;
kset_system_key_alist (kb, Qnil);
kset_system_key_syms (kb, Qnil);
kset_window_system (kb, type);
kset_input_decode_map (kb, Fmake_sparse_keymap (Qnil));
kset_local_function_key_map (kb, Fmake_sparse_keymap (Qnil));
Fset_keymap_parent (KVAR (kb, Vlocal_function_key_map), Vfunction_key_map);
kset_default_minibuffer_frame (kb, Qnil);
}
/* Allocate and basically initialize keyboard
object to use with window system TYPE. */
KBOARD *
allocate_kboard (Lisp_Object type)
{
KBOARD *kb = xmalloc (sizeof *kb);
init_kboard (kb, type);
kb->next_kboard = all_kboards;
all_kboards = kb;
return kb;
}
/*
* Destroy the contents of a kboard object, but not the object itself.
* We use this just before deleting it, or if we're going to initialize
* it a second time.
*/
static void
wipe_kboard (KBOARD *kb)
{
xfree (kb->kbd_macro_buffer);
}
/* Free KB and memory referenced from it. */
void
delete_kboard (KBOARD *kb)
{
KBOARD **kbp;
for (kbp = &all_kboards; *kbp != kb; kbp = &(*kbp)->next_kboard)
if (*kbp == NULL)
emacs_abort ();
*kbp = kb->next_kboard;
/* Prevent a dangling reference to KB. */
if (kb == current_kboard
&& FRAMEP (selected_frame)
&& FRAME_LIVE_P (XFRAME (selected_frame)))
{
current_kboard = FRAME_KBOARD (XFRAME (selected_frame));
single_kboard = false;
if (current_kboard == kb)
emacs_abort ();
}
wipe_kboard (kb);
xfree (kb);
}
void
init_keyboard (void)
{
/* This is correct before outermost invocation of the editor loop. */
command_loop_level = -1;
quit_char = Ctl ('g');
Vunread_command_events = Qnil;
timer_idleness_start_time = invalid_timespec ();
total_keys = 0;
recent_keys_index = 0;
kbd_fetch_ptr = kbd_buffer;
kbd_store_ptr = kbd_buffer;
track_mouse = Qnil;
input_pending = false;
interrupt_input_blocked = 0;
pending_signals = false;
/* This means that command_loop_1 won't try to select anything the first
time through. */
internal_last_event_frame = Qnil;
Vlast_event_frame = internal_last_event_frame;
current_kboard = initial_kboard;
/* Re-initialize the keyboard again. */
wipe_kboard (current_kboard);
/* A value of nil for Vwindow_system normally means a tty, but we also use
it for the initial terminal since there is no window system there. */
init_kboard (current_kboard, Qnil);
if (!noninteractive)
{
/* Before multi-tty support, these handlers used to be installed
only if the current session was a tty session. Now an Emacs
session may have multiple display types, so we always handle
SIGINT. There is special code in handle_interrupt_signal to exit
Emacs on SIGINT when there are no termcap frames on the
controlling terminal. */
struct sigaction action;
emacs_sigaction_init (&action, deliver_interrupt_signal);
sigaction (SIGINT, &action, 0);
#ifndef DOS_NT
/* For systems with SysV TERMIO, C-g is set up for both SIGINT and
SIGQUIT and we can't tell which one it will give us. */
sigaction (SIGQUIT, &action, 0);
#endif /* not DOS_NT */
}
#ifdef USABLE_SIGIO
if (!noninteractive)
{
struct sigaction action;
emacs_sigaction_init (&action, deliver_input_available_signal);
sigaction (SIGIO, &action, 0);
}
#endif
/* Use interrupt input by default, if it works and noninterrupt input
has deficiencies. */
#ifdef INTERRUPT_INPUT
interrupt_input = 1;
#else
interrupt_input = 0;
#endif
pthread_sigmask (SIG_SETMASK, &empty_mask, 0);
dribble = 0;
if (keyboard_init_hook)
(*keyboard_init_hook) ();
#ifdef POLL_FOR_INPUT
poll_timer = NULL;
poll_suppress_count = 1;
start_polling ();
#endif
}
/* This type's only use is in syms_of_keyboard, to put properties on the
event header symbols. */
struct event_head
{
short var;
short kind;
};
static const struct event_head head_table[] = {
{SYMBOL_INDEX (Qmouse_movement), SYMBOL_INDEX (Qmouse_movement)},
{SYMBOL_INDEX (Qscroll_bar_movement), SYMBOL_INDEX (Qmouse_movement)},
/* Some of the event heads. */
{SYMBOL_INDEX (Qswitch_frame), SYMBOL_INDEX (Qswitch_frame)},
{SYMBOL_INDEX (Qfocus_in), SYMBOL_INDEX (Qfocus_in)},
{SYMBOL_INDEX (Qfocus_out), SYMBOL_INDEX (Qfocus_out)},
{SYMBOL_INDEX (Qmove_frame), SYMBOL_INDEX (Qmove_frame)},
{SYMBOL_INDEX (Qdelete_frame), SYMBOL_INDEX (Qdelete_frame)},
{SYMBOL_INDEX (Qiconify_frame), SYMBOL_INDEX (Qiconify_frame)},
{SYMBOL_INDEX (Qmake_frame_visible), SYMBOL_INDEX (Qmake_frame_visible)},
/* `select-window' should be handled just like `switch-frame'
in read_key_sequence. */
{SYMBOL_INDEX (Qselect_window), SYMBOL_INDEX (Qswitch_frame)}
};
static void syms_of_keyboard_for_pdumper (void);
void
syms_of_keyboard (void)
{
pending_funcalls = Qnil;
staticpro (&pending_funcalls);
Vlispy_mouse_stem = build_pure_c_string ("mouse");
staticpro (&Vlispy_mouse_stem);
regular_top_level_message = build_pure_c_string ("Back to top level");
staticpro (®ular_top_level_message);
#ifdef HAVE_STACK_OVERFLOW_HANDLING
recover_top_level_message
= build_pure_c_string ("Re-entering top level after C stack overflow");
staticpro (&recover_top_level_message);
#endif
DEFVAR_LISP ("internal--top-level-message", Vinternal__top_level_message,
doc: /* Message displayed by `normal-top-level'. */);
Vinternal__top_level_message = regular_top_level_message;
/* Tool-bars. */
DEFSYM (QCimage, ":image");
DEFSYM (Qhelp_echo, "help-echo");
DEFSYM (Qhelp_echo_inhibit_substitution, "help-echo-inhibit-substitution");
DEFSYM (QCrtl, ":rtl");
staticpro (&item_properties);
item_properties = Qnil;
staticpro (&tab_bar_item_properties);
tab_bar_item_properties = Qnil;
staticpro (&tab_bar_items_vector);
tab_bar_items_vector = Qnil;
staticpro (&tool_bar_item_properties);
tool_bar_item_properties = Qnil;
staticpro (&tool_bar_items_vector);
tool_bar_items_vector = Qnil;
DEFSYM (Qtimer_event_handler, "timer-event-handler");
/* Non-nil disable property on a command means do not execute it;
call disabled-command-function's value instead. */
DEFSYM (Qdisabled, "disabled");
DEFSYM (Qundefined, "undefined");
/* Hooks to run before and after each command. */
DEFSYM (Qpre_command_hook, "pre-command-hook");
DEFSYM (Qpost_command_hook, "post-command-hook");
DEFSYM (Qundo_auto__add_boundary, "undo-auto--add-boundary");
DEFSYM (Qundo_auto__undoably_changed_buffers,
"undo-auto--undoably-changed-buffers");
DEFSYM (Qdeferred_action_function, "deferred-action-function");
DEFSYM (Qdelayed_warnings_hook, "delayed-warnings-hook");
DEFSYM (Qfunction_key, "function-key");
/* The values of Qevent_kind properties. */
DEFSYM (Qmouse_click, "mouse-click");
DEFSYM (Qdrag_n_drop, "drag-n-drop");
DEFSYM (Qsave_session, "save-session");
DEFSYM (Qconfig_changed_event, "config-changed-event");
/* Menu and tool bar item parts. */
DEFSYM (Qmenu_enable, "menu-enable");
#ifdef HAVE_NTGUI
DEFSYM (Qlanguage_change, "language-change");
DEFSYM (Qend_session, "end-session");
#endif
#ifdef HAVE_DBUS
DEFSYM (Qdbus_event, "dbus-event");
#endif
#ifdef THREADS_ENABLED
DEFSYM (Qthread_event, "thread-event");
#endif
#ifdef HAVE_XWIDGETS
DEFSYM (Qxwidget_event, "xwidget-event");
#endif
#ifdef USE_FILE_NOTIFY
DEFSYM (Qfile_notify, "file-notify");
#endif /* USE_FILE_NOTIFY */
/* Menu and tool bar item parts. */
DEFSYM (QCenable, ":enable");
DEFSYM (QCvisible, ":visible");
DEFSYM (QChelp, ":help");
DEFSYM (QCfilter, ":filter");
DEFSYM (QCbutton, ":button");
DEFSYM (QCkeys, ":keys");
DEFSYM (QCkey_sequence, ":key-sequence");
/* Non-nil disable property on a command means
do not execute it; call disabled-command-function's value instead. */
DEFSYM (QCtoggle, ":toggle");
DEFSYM (QCradio, ":radio");
DEFSYM (QClabel, ":label");
DEFSYM (QCvert_only, ":vert-only");
/* Symbols to use for parts of windows. */
DEFSYM (Qvertical_line, "vertical-line");
DEFSYM (Qright_divider, "right-divider");
DEFSYM (Qbottom_divider, "bottom-divider");
DEFSYM (Qmouse_fixup_help_message, "mouse-fixup-help-message");
DEFSYM (Qabove_handle, "above-handle");
DEFSYM (Qhandle, "handle");
DEFSYM (Qbelow_handle, "below-handle");
DEFSYM (Qup, "up");
DEFSYM (Qdown, "down");
DEFSYM (Qtop, "top");
DEFSYM (Qbottom, "bottom");
DEFSYM (Qend_scroll, "end-scroll");
DEFSYM (Qratio, "ratio");
DEFSYM (Qbefore_handle, "before-handle");
DEFSYM (Qhorizontal_handle, "horizontal-handle");
DEFSYM (Qafter_handle, "after-handle");
DEFSYM (Qleft, "left");
DEFSYM (Qright, "right");
DEFSYM (Qleftmost, "leftmost");
DEFSYM (Qrightmost, "rightmost");
/* Properties of event headers. */
DEFSYM (Qevent_kind, "event-kind");
DEFSYM (Qevent_symbol_elements, "event-symbol-elements");
/* An event header symbol HEAD may have a property named
Qevent_symbol_element_mask, which is of the form (BASE MODIFIERS);
BASE is the base, unmodified version of HEAD, and MODIFIERS is the
mask of modifiers applied to it. If present, this is used to help
speed up parse_modifiers. */
DEFSYM (Qevent_symbol_element_mask, "event-symbol-element-mask");
/* An unmodified event header BASE may have a property named
Qmodifier_cache, which is an alist mapping modifier masks onto
modified versions of BASE. If present, this helps speed up
apply_modifiers. */
DEFSYM (Qmodifier_cache, "modifier-cache");
DEFSYM (Qrecompute_lucid_menubar, "recompute-lucid-menubar");
DEFSYM (Qactivate_menubar_hook, "activate-menubar-hook");
DEFSYM (Qpolling_period, "polling-period");
DEFSYM (Qgui_set_selection, "gui-set-selection");
/* The primary selection. */
DEFSYM (QPRIMARY, "PRIMARY");
DEFSYM (Qhandle_switch_frame, "handle-switch-frame");
DEFSYM (Qhandle_select_window, "handle-select-window");
DEFSYM (Qinput_method_exit_on_first_char, "input-method-exit-on-first-char");
DEFSYM (Qinput_method_use_echo_area, "input-method-use-echo-area");
DEFSYM (Qhelp_form_show, "help-form-show");
DEFSYM (Qecho_keystrokes, "echo-keystrokes");
Fset (Qinput_method_exit_on_first_char, Qnil);
Fset (Qinput_method_use_echo_area, Qnil);
/* Symbols for dragging internal borders. */
DEFSYM (Qdrag_internal_border, "drag-internal-border");
DEFSYM (Qleft_edge, "left-edge");
DEFSYM (Qtop_left_corner, "top-left-corner");
DEFSYM (Qtop_edge, "top-edge");
DEFSYM (Qtop_right_corner, "top-right-corner");
DEFSYM (Qright_edge, "right-edge");
DEFSYM (Qbottom_right_corner, "bottom-right-corner");
DEFSYM (Qbottom_edge, "bottom-edge");
DEFSYM (Qbottom_left_corner, "bottom-left-corner");
/* Symbols to head events. */
DEFSYM (Qmouse_movement, "mouse-movement");
DEFSYM (Qscroll_bar_movement, "scroll-bar-movement");
DEFSYM (Qswitch_frame, "switch-frame");
DEFSYM (Qfocus_in, "focus-in");
DEFSYM (Qfocus_out, "focus-out");
DEFSYM (Qmove_frame, "move-frame");
DEFSYM (Qdelete_frame, "delete-frame");
DEFSYM (Qiconify_frame, "iconify-frame");
DEFSYM (Qmake_frame_visible, "make-frame-visible");
DEFSYM (Qselect_window, "select-window");
DEFSYM (Qselection_request, "selection-request");
DEFSYM (Qwindow_edges, "window-edges");
{
int i;
for (i = 0; i < ARRAYELTS (head_table); i++)
{
const struct event_head *p = &head_table[i];
Lisp_Object var = builtin_lisp_symbol (p->var);
Lisp_Object kind = builtin_lisp_symbol (p->kind);
Fput (var, Qevent_kind, kind);
Fput (var, Qevent_symbol_elements, list1 (var));
}
}
DEFSYM (Qno_record, "no-record");
DEFSYM (Qencoded, "encoded");
button_down_location = make_nil_vector (5);
staticpro (&button_down_location);
staticpro (&frame_relative_event_pos);
mouse_syms = make_nil_vector (5);
staticpro (&mouse_syms);
wheel_syms = make_nil_vector (ARRAYELTS (lispy_wheel_names));
staticpro (&wheel_syms);
{
int i;
int len = ARRAYELTS (modifier_names);
modifier_symbols = make_nil_vector (len);
for (i = 0; i < len; i++)
if (modifier_names[i])
ASET (modifier_symbols, i, intern_c_string (modifier_names[i]));
staticpro (&modifier_symbols);
}
recent_keys = make_nil_vector (lossage_limit);
staticpro (&recent_keys);
this_command_keys = make_nil_vector (40);
staticpro (&this_command_keys);
raw_keybuf = make_nil_vector (30);
staticpro (&raw_keybuf);
DEFSYM (Qcommand_execute, "command-execute");
DEFSYM (Qinternal_echo_keystrokes_prefix, "internal-echo-keystrokes-prefix");
accent_key_syms = Qnil;
staticpro (&accent_key_syms);
func_key_syms = Qnil;
staticpro (&func_key_syms);
drag_n_drop_syms = Qnil;
staticpro (&drag_n_drop_syms);
unread_switch_frame = Qnil;
staticpro (&unread_switch_frame);
internal_last_event_frame = Qnil;
staticpro (&internal_last_event_frame);
read_key_sequence_cmd = Qnil;
staticpro (&read_key_sequence_cmd);
read_key_sequence_remapped = Qnil;
staticpro (&read_key_sequence_remapped);
menu_bar_one_keymap_changed_items = Qnil;
staticpro (&menu_bar_one_keymap_changed_items);
menu_bar_items_vector = Qnil;
staticpro (&menu_bar_items_vector);
help_form_saved_window_configs = Qnil;
staticpro (&help_form_saved_window_configs);
defsubr (&Scurrent_idle_time);
defsubr (&Sevent_symbol_parse_modifiers);
defsubr (&Sevent_convert_list);
defsubr (&Sinternal_handle_focus_in);
defsubr (&Sread_key_sequence);
defsubr (&Sread_key_sequence_vector);
defsubr (&Srecursive_edit);
defsubr (&Sinternal_track_mouse);
defsubr (&Sinput_pending_p);
defsubr (&Slossage_size);
defsubr (&Srecent_keys);
defsubr (&Sthis_command_keys);
defsubr (&Sthis_command_keys_vector);
defsubr (&Sthis_single_command_keys);
defsubr (&Sthis_single_command_raw_keys);
defsubr (&Sset__this_command_keys);
defsubr (&Sclear_this_command_keys);
defsubr (&Ssuspend_emacs);
defsubr (&Sabort_recursive_edit);
defsubr (&Sexit_recursive_edit);
defsubr (&Srecursion_depth);
defsubr (&Scommand_error_default_function);
defsubr (&Stop_level);
defsubr (&Sdiscard_input);
defsubr (&Sopen_dribble_file);
defsubr (&Sset_input_interrupt_mode);
defsubr (&Sset_output_flow_control);
defsubr (&Sset_input_meta_mode);
defsubr (&Sset_quit_char);
defsubr (&Sset_input_mode);
defsubr (&Scurrent_input_mode);
defsubr (&Sposn_at_point);
defsubr (&Sposn_at_x_y);
DEFVAR_LISP ("last-command-event", last_command_event,
doc: /* Last input event of a key sequence that called a command.
See Info node `(elisp)Command Loop Info'.*/);
DEFVAR_LISP ("last-nonmenu-event", last_nonmenu_event,
doc: /* Last input event in a command, except for mouse menu events.
Mouse menus give back keys that don't look like mouse events;
this variable holds the actual mouse event that led to the menu,
so that you can determine whether the command was run by mouse or not. */);
DEFVAR_LISP ("last-input-event", last_input_event,
doc: /* Last input event. */);
DEFVAR_LISP ("unread-command-events", Vunread_command_events,
doc: /* List of events to be read as the command input.
These events are processed first, before actual keyboard input.
Events read from this list are not normally added to `this-command-keys',
as they will already have been added once as they were read for the first time.
An element of the form (t . EVENT) forces EVENT to be added to that list.
An element of the form (no-record . EVENT) means process EVENT, but do not
record it in the keyboard macros, recent-keys, and the dribble file. */);
Vunread_command_events = Qnil;
DEFVAR_LISP ("unread-post-input-method-events", Vunread_post_input_method_events,
doc: /* List of events to be processed as input by input methods.
These events are processed before `unread-command-events'
and actual keyboard input, but are not given to `input-method-function'. */);
Vunread_post_input_method_events = Qnil;
DEFVAR_LISP ("unread-input-method-events", Vunread_input_method_events,
doc: /* List of events to be processed as input by input methods.
These events are processed after `unread-command-events', but
before actual keyboard input.
If there's an active input method, the events are given to
`input-method-function'. */);
Vunread_input_method_events = Qnil;
DEFVAR_LISP ("meta-prefix-char", meta_prefix_char,
doc: /* Meta-prefix character code.
Meta-foo as command input turns into this character followed by foo. */);
XSETINT (meta_prefix_char, 033);
DEFVAR_KBOARD ("last-command", Vlast_command,
doc: /* The last command executed.
Normally a symbol with a function definition, but can be whatever was found
in the keymap, or whatever the variable `this-command' was set to by that
command.
The value `mode-exit' is special; it means that the previous command
read an event that told it to exit, and it did so and unread that event.
In other words, the present command is the event that made the previous
command exit.
The value `kill-region' is special; it means that the previous command
was a kill command.
`last-command' has a separate binding for each terminal device.
See Info node `(elisp)Multiple Terminals'. */);
DEFVAR_KBOARD ("real-last-command", Vreal_last_command,
doc: /* Same as `last-command', but never altered by Lisp code.
Taken from the previous value of `real-this-command'. */);
DEFVAR_KBOARD ("last-repeatable-command", Vlast_repeatable_command,
doc: /* Last command that may be repeated.
The last command executed that was not bound to an input event.
This is the command `repeat' will try to repeat.
Taken from a previous value of `real-this-command'. */);
DEFVAR_LISP ("this-command", Vthis_command,
doc: /* The command now being executed.
The command can set this variable; whatever is put here
will be in `last-command' during the following command. */);
Vthis_command = Qnil;
DEFVAR_LISP ("real-this-command", Vreal_this_command,
doc: /* This is like `this-command', except that commands should never modify it. */);
Vreal_this_command = Qnil;
DEFSYM (Qcurrent_minibuffer_command, "current-minibuffer-command");
DEFVAR_LISP ("current-minibuffer-command", Vcurrent_minibuffer_command,
doc: /* This is like `this-command', but bound recursively.
Code running from (for instance) a minibuffer hook can check this variable
to see what command invoked the current minibuffer. */);
Vcurrent_minibuffer_command = Qnil;
DEFVAR_LISP ("this-command-keys-shift-translated",
Vthis_command_keys_shift_translated,
doc: /* Non-nil if the key sequence activating this command was shift-translated.
Shift-translation occurs when there is no binding for the key sequence
as entered, but a binding was found by changing an upper-case letter
to lower-case, or a shifted function key to an unshifted one. */);
Vthis_command_keys_shift_translated = Qnil;
DEFVAR_LISP ("this-original-command", Vthis_original_command,
doc: /* The command bound to the current key sequence before remapping.
It equals `this-command' if the original command was not remapped through
any of the active keymaps. Otherwise, the value of `this-command' is the
result of looking up the original command in the active keymaps. */);
Vthis_original_command = Qnil;
DEFVAR_INT ("auto-save-interval", auto_save_interval,
doc: /* Number of input events between auto-saves.
Zero means disable autosaving due to number of characters typed. */);
auto_save_interval = 300;
DEFVAR_BOOL ("auto-save-no-message", auto_save_no_message,
doc: /* Non-nil means do not print any message when auto-saving. */);
auto_save_no_message = false;
DEFVAR_LISP ("auto-save-timeout", Vauto_save_timeout,
doc: /* Number of seconds idle time before auto-save.
Zero or nil means disable auto-saving due to idleness.
After auto-saving due to this many seconds of idle time,
Emacs also does a garbage collection if that seems to be warranted. */);
XSETFASTINT (Vauto_save_timeout, 30);
DEFVAR_LISP ("echo-keystrokes", Vecho_keystrokes,
doc: /* Nonzero means echo unfinished commands after this many seconds of pause.
The value may be integer or floating point.
If the value is zero, don't echo at all. */);
Vecho_keystrokes = make_fixnum (1);
DEFVAR_INT ("polling-period", polling_period,
doc: /* Interval between polling for input during Lisp execution.
The reason for polling is to make C-g work to stop a running program.
Polling is needed only when using X windows and SIGIO does not work.
Polling is automatically disabled in all other cases. */);
polling_period = 2;
DEFVAR_LISP ("double-click-time", Vdouble_click_time,
doc: /* Maximum time between mouse clicks to make a double-click.
Measured in milliseconds. The value nil means disable double-click
recognition; t means double-clicks have no time limit and are detected
by position only. */);
Vdouble_click_time = make_fixnum (500);
DEFVAR_INT ("double-click-fuzz", double_click_fuzz,
doc: /* Maximum mouse movement between clicks to make a double-click.
On window-system frames, value is the number of pixels the mouse may have
moved horizontally or vertically between two clicks to make a double-click.
On non window-system frames, value is interpreted in units of 1/8 characters
instead of pixels.
This variable is also the threshold for motion of the mouse
to count as a drag. */);
double_click_fuzz = 3;
DEFVAR_INT ("num-input-keys", num_input_keys,
doc: /* Number of complete key sequences read as input so far.
This includes key sequences read from keyboard macros.
The number is effectively the number of interactive command invocations. */);
num_input_keys = 0;
DEFVAR_INT ("num-nonmacro-input-events", num_nonmacro_input_events,
doc: /* Number of input events read from the keyboard so far.
This does not include events generated by keyboard macros. */);
num_nonmacro_input_events = 0;
DEFVAR_LISP ("last-event-frame", Vlast_event_frame,
doc: /* The frame in which the most recently read event occurred.
If the last event came from a keyboard macro, this is set to `macro'. */);
Vlast_event_frame = Qnil;
/* This variable is set up in sysdep.c. */
DEFVAR_LISP ("tty-erase-char", Vtty_erase_char,
doc: /* The ERASE character as set by the user with stty. */);
DEFVAR_LISP ("help-char", Vhelp_char,
doc: /* Character to recognize as meaning Help.
When it is read, do `(eval help-form)', and display result if it's a string.
If the value of `help-form' is nil, this char can be read normally. */);
XSETINT (Vhelp_char, Ctl ('H'));
DEFVAR_LISP ("help-event-list", Vhelp_event_list,
doc: /* List of input events to recognize as meaning Help.
These work just like the value of `help-char' (see that). */);
Vhelp_event_list = Qnil;
DEFVAR_LISP ("help-form", Vhelp_form,
doc: /* Form to execute when character `help-char' is read.
If the form returns a string, that string is displayed.
If `help-form' is nil, the help char is not recognized. */);
Vhelp_form = Qnil;
DEFVAR_LISP ("prefix-help-command", Vprefix_help_command,
doc: /* Command to run when `help-char' character follows a prefix key.
This command is used only when there is no actual binding
for that character after that prefix key. */);
Vprefix_help_command = Qnil;
DEFVAR_LISP ("top-level", Vtop_level,
doc: /* Form to evaluate when Emacs starts up.
Useful to set before you dump a modified Emacs. */);
Vtop_level = Qnil;
XSYMBOL (Qtop_level)->u.s.declared_special = false;
DEFVAR_KBOARD ("keyboard-translate-table", Vkeyboard_translate_table,
doc: /* Translate table for local keyboard input, or nil.
If non-nil, the value should be a char-table. Each character read
from the keyboard is looked up in this char-table. If the value found
there is non-nil, then it is used instead of the actual input character.
The value can also be a string or vector, but this is considered obsolete.
If it is a string or vector of length N, character codes N and up are left
untranslated. In a vector, an element which is nil means "no translation".
This is applied to the characters supplied to input methods, not their
output. See also `translation-table-for-input'.
This variable has a separate binding for each terminal.
See Info node `(elisp)Multiple Terminals'. */);
DEFVAR_BOOL ("cannot-suspend", cannot_suspend,
doc: /* Non-nil means to always spawn a subshell instead of suspending.
\(Even if the operating system has support for stopping a process.) */);
cannot_suspend = false;
DEFVAR_BOOL ("menu-prompting", menu_prompting,
doc: /* Non-nil means prompt with menus when appropriate.
This is done when reading from a keymap that has a prompt string,
for elements that have prompt strings.
The menu is displayed on the screen
if X menus were enabled at configuration
time and the previous event was a mouse click prefix key.
Otherwise, menu prompting uses the echo area. */);
menu_prompting = true;
DEFVAR_LISP ("menu-prompt-more-char", menu_prompt_more_char,
doc: /* Character to see next line of menu prompt.
Type this character while in a menu prompt to rotate around the lines of it. */);
XSETINT (menu_prompt_more_char, ' ');
DEFVAR_INT ("extra-keyboard-modifiers", extra_keyboard_modifiers,
doc: /* A mask of additional modifier keys to use with every keyboard character.
Emacs applies the modifiers of the character stored here to each keyboard
character it reads. For example, after evaluating the expression
(setq extra-keyboard-modifiers ?\\C-x)
all input characters will have the control modifier applied to them.
Note that the character ?\\C-@, equivalent to the integer zero, does
not count as a control character; rather, it counts as a character
with no modifiers; thus, setting `extra-keyboard-modifiers' to zero
cancels any modification. */);
extra_keyboard_modifiers = 0;
DEFSYM (Qdeactivate_mark, "deactivate-mark");
DEFVAR_LISP ("deactivate-mark", Vdeactivate_mark,
doc: /* If an editing command sets this to t, deactivate the mark afterward.
The command loop sets this to nil before each command,
and tests the value when the command returns.
Buffer modification stores t in this variable. */);
Vdeactivate_mark = Qnil;
Fmake_variable_buffer_local (Qdeactivate_mark);
DEFVAR_LISP ("pre-command-hook", Vpre_command_hook,
doc: /* Normal hook run before each command is executed.
If an unhandled error happens in running this hook,
the function in which the error occurred is unconditionally removed, since
otherwise the error might happen repeatedly and make Emacs nonfunctional.
See also `post-command-hook'. */);
Vpre_command_hook = Qnil;
DEFVAR_LISP ("post-command-hook", Vpost_command_hook,
doc: /* Normal hook run after each command is executed.
If an unhandled error happens in running this hook,
the function in which the error occurred is unconditionally removed, since
otherwise the error might happen repeatedly and make Emacs nonfunctional.
It is a bad idea to use this hook for expensive processing. If
unavoidable, wrap your code in `(while-no-input (redisplay) CODE)' to
avoid making Emacs unresponsive while the user types.
See also `pre-command-hook'. */);
Vpost_command_hook = Qnil;
#if 0
DEFVAR_LISP ("echo-area-clear-hook", ...,
doc: /* Normal hook run when clearing the echo area. */);
#endif
DEFSYM (Qecho_area_clear_hook, "echo-area-clear-hook");
Fset (Qecho_area_clear_hook, Qnil);
DEFVAR_LISP ("lucid-menu-bar-dirty-flag", Vlucid_menu_bar_dirty_flag,
doc: /* Non-nil means menu bar, specified Lucid style, needs to be recomputed. */);
Vlucid_menu_bar_dirty_flag = Qnil;
DEFVAR_LISP ("menu-bar-final-items", Vmenu_bar_final_items,
doc: /* List of menu bar items to move to the end of the menu bar.
The elements of the list are event types that may have menu bar
bindings. The order of this list controls the order of the items. */);
Vmenu_bar_final_items = Qnil;
DEFVAR_LISP ("tab-bar-separator-image-expression", Vtab_bar_separator_image_expression,
doc: /* Expression evaluating to the image spec for a tab-bar separator.
This is used internally by graphical displays that do not render
tab-bar separators natively. Otherwise it is unused (e.g. on GTK). */);
Vtab_bar_separator_image_expression = Qnil;
DEFVAR_LISP ("tool-bar-separator-image-expression", Vtool_bar_separator_image_expression,
doc: /* Expression evaluating to the image spec for a tool-bar separator.
This is used internally by graphical displays that do not render
tool-bar separators natively. Otherwise it is unused (e.g. on GTK). */);
Vtool_bar_separator_image_expression = Qnil;
DEFVAR_KBOARD ("overriding-terminal-local-map",
Voverriding_terminal_local_map,
doc: /* Per-terminal keymap that takes precedence over all other keymaps.
This variable is intended to let commands such as `universal-argument'
set up a different keymap for reading the next command.
`overriding-terminal-local-map' has a separate binding for each
terminal device. See Info node `(elisp)Multiple Terminals'. */);
DEFVAR_LISP ("overriding-local-map", Voverriding_local_map,
doc: /* Keymap that replaces (overrides) local keymaps.
If this variable is non-nil, Emacs looks up key bindings in this
keymap INSTEAD OF `keymap' text properties, `local-map' and `keymap'
overlay properties, minor mode maps, and the buffer's local map.
Hence, the only active keymaps would be `overriding-terminal-local-map',
this keymap, and `global-keymap', in order of precedence. */);
Voverriding_local_map = Qnil;
DEFVAR_LISP ("overriding-local-map-menu-flag", Voverriding_local_map_menu_flag,
doc: /* Non-nil means `overriding-local-map' applies to the menu bar.
Otherwise, the menu bar continues to reflect the buffer's local map
and the minor mode maps regardless of `overriding-local-map'. */);
Voverriding_local_map_menu_flag = Qnil;
DEFVAR_LISP ("special-event-map", Vspecial_event_map,
doc: /* Keymap defining bindings for special events to execute at low level. */);
Vspecial_event_map = list1 (Qkeymap);
DEFVAR_LISP ("track-mouse", track_mouse,
doc: /* Non-nil means generate motion events for mouse motion.
The special values `dragging' and `dropping' assert that the mouse
cursor retains its appearance during mouse motion. Any non-nil value
but `dropping' asserts that motion events always relate to the frame
where the mouse movement started. The value `dropping' asserts
that motion events relate to the frame where the mouse cursor is seen
when generating the event. If there's no such frame, such motion
events relate to the frame where the mouse movement started. */);
DEFVAR_KBOARD ("system-key-alist", Vsystem_key_alist,
doc: /* Alist of system-specific X windows key symbols.
Each element should have the form (N . SYMBOL) where N is the
numeric keysym code (sans the \"system-specific\" bit 1<<28)
and SYMBOL is its name.
`system-key-alist' has a separate binding for each terminal device.
See Info node `(elisp)Multiple Terminals'. */);
DEFVAR_KBOARD ("local-function-key-map", Vlocal_function_key_map,
doc: /* Keymap that translates key sequences to key sequences during input.
This is used mainly for mapping key sequences into some preferred
key events (symbols).
The `read-key-sequence' function replaces any subsequence bound by
`local-function-key-map' with its binding. More precisely, when the
active keymaps have no binding for the current key sequence but
`local-function-key-map' binds a suffix of the sequence to a vector or
string, `read-key-sequence' replaces the matching suffix with its
binding, and continues with the new sequence.
If the binding is a function, it is called with one argument (the prompt)
and its return value (a key sequence) is used.
The events that come from bindings in `local-function-key-map' are not
themselves looked up in `local-function-key-map'.
For example, suppose `local-function-key-map' binds `ESC O P' to [f1].
Typing `ESC O P' to `read-key-sequence' would return [f1]. Typing
`C-x ESC O P' would return [?\\C-x f1]. If [f1] were a prefix key,
typing `ESC O P x' would return [f1 x].
`local-function-key-map' has a separate binding for each terminal
device. See Info node `(elisp)Multiple Terminals'. If you need to
define a binding on all terminals, change `function-key-map'
instead. Initially, `local-function-key-map' is an empty keymap that
has `function-key-map' as its parent on all terminal devices. */);
DEFVAR_KBOARD ("input-decode-map", Vinput_decode_map,
doc: /* Keymap that decodes input escape sequences.
This is used mainly for mapping ASCII function key sequences into
real Emacs function key events (symbols).
The `read-key-sequence' function replaces any subsequence bound by
`input-decode-map' with its binding. Contrary to `function-key-map',
this map applies its rebinding regardless of the presence of an ordinary
binding. So it is more like `key-translation-map' except that it applies
before `function-key-map' rather than after.
If the binding is a function, it is called with one argument (the prompt)
and its return value (a key sequence) is used.
The events that come from bindings in `input-decode-map' are not
themselves looked up in `input-decode-map'. */);
DEFVAR_LISP ("function-key-map", Vfunction_key_map,
doc: /* The parent keymap of all `local-function-key-map' instances.
Function key definitions that apply to all terminal devices should go
here. If a mapping is defined in both the current
`local-function-key-map' binding and this variable, then the local
definition will take precedence. */);
Vfunction_key_map = Fmake_sparse_keymap (Qnil);
DEFVAR_LISP ("key-translation-map", Vkey_translation_map,
doc: /* Keymap of key translations that can override keymaps.
This keymap works like `input-decode-map', but comes after `function-key-map'.
Another difference is that it is global rather than terminal-local. */);
Vkey_translation_map = Fmake_sparse_keymap (Qnil);
DEFVAR_LISP ("deferred-action-list", Vdeferred_action_list,
doc: /* List of deferred actions to be performed at a later time.
The precise format isn't relevant here; we just check whether it is nil. */);
Vdeferred_action_list = Qnil;
DEFVAR_LISP ("deferred-action-function", Vdeferred_action_function,
doc: /* Function to call to handle deferred actions, after each command.
This function is called with no arguments after each command
whenever `deferred-action-list' is non-nil. */);
Vdeferred_action_function = Qnil;
DEFVAR_LISP ("delayed-warnings-list", Vdelayed_warnings_list,
doc: /* List of warnings to be displayed after this command.
Each element must be a list (TYPE MESSAGE [LEVEL [BUFFER-NAME]]),
as per the args of `display-warning' (which see).
If this variable is non-nil, `delayed-warnings-hook' will be run
immediately after running `post-command-hook'. */);
Vdelayed_warnings_list = Qnil;
DEFVAR_LISP ("timer-list", Vtimer_list,
doc: /* List of active absolute time timers in order of increasing time. */);
Vtimer_list = Qnil;
DEFVAR_LISP ("timer-idle-list", Vtimer_idle_list,
doc: /* List of active idle-time timers in order of increasing time. */);
Vtimer_idle_list = Qnil;
DEFVAR_LISP ("input-method-function", Vinput_method_function,
doc: /* If non-nil, the function that implements the current input method.
It's called with one argument, which must be a single-byte
character that was just read. Any single-byte character is
acceptable, except the DEL character, codepoint 127 decimal, 177 octal.
Typically this function uses `read-event' to read additional events.
When it does so, it should first bind `input-method-function' to nil
so it will not be called recursively.
The function should return a list of zero or more events
to be used as input. If it wants to put back some events
to be reconsidered, separately, by the input method,
it can add them to the beginning of `unread-command-events'.
The input method function can find in `input-method-previous-message'
the previous echo area message.
The input method function should refer to the variables
`input-method-use-echo-area' and `input-method-exit-on-first-char'
for guidance on what to do. */);
Vinput_method_function = Qlist;
DEFVAR_LISP ("input-method-previous-message",
Vinput_method_previous_message,
doc: /* When `input-method-function' is called, hold the previous echo area message.
This variable exists because `read-event' clears the echo area
before running the input method. It is nil if there was no message. */);
Vinput_method_previous_message = Qnil;
DEFVAR_LISP ("show-help-function", Vshow_help_function,
doc: /* If non-nil, the function that implements the display of help.
It's called with one argument, the help string to display. */);
Vshow_help_function = Qnil;
DEFVAR_LISP ("disable-point-adjustment", Vdisable_point_adjustment,
doc: /* If non-nil, suppress point adjustment after executing a command.
After a command is executed, if point moved into a region that has
special properties (e.g. composition, display), Emacs adjusts point to
the boundary of the region. But when a command leaves this variable at
a non-nil value (e.g., with a setq), this point adjustment is suppressed.
This variable is set to nil before reading a command, and is checked
just after executing the command. */);
Vdisable_point_adjustment = Qnil;
DEFVAR_LISP ("global-disable-point-adjustment",
Vglobal_disable_point_adjustment,
doc: /* If non-nil, always suppress point adjustments.
The default value is nil, in which case point adjustments are
suppressed only after special commands that leave
`disable-point-adjustment' (which see) at a non-nil value. */);
Vglobal_disable_point_adjustment = Qnil;
DEFVAR_LISP ("minibuffer-message-timeout", Vminibuffer_message_timeout,
doc: /* How long to display an echo-area message when the minibuffer is active.
If the value is a number, it should be specified in seconds.
If the value is not a number, such messages never time out. */);
Vminibuffer_message_timeout = make_fixnum (2);
DEFVAR_LISP ("throw-on-input", Vthrow_on_input,
doc: /* If non-nil, any keyboard input throws to this symbol.
The value of that variable is passed to `quit-flag' and later causes a
peculiar kind of quitting. */);
Vthrow_on_input = Qnil;
DEFVAR_LISP ("command-error-function", Vcommand_error_function,
doc: /* Function to output error messages.
Called with three arguments:
- the error data, a list of the form (SIGNALED-CONDITION . SIGNAL-DATA)
such as what `condition-case' would bind its variable to,
- the context (a string which normally goes at the start of the message),
- the Lisp function within which the error was signaled.
Also see `set-message-function' (which controls how non-error messages
are displayed). */);
Vcommand_error_function = intern ("command-error-default-function");
DEFVAR_LISP ("enable-disabled-menus-and-buttons",
Venable_disabled_menus_and_buttons,
doc: /* If non-nil, don't ignore events produced by disabled menu items and tool-bar.
Help functions bind this to allow help on disabled menu items
and tool-bar buttons. */);
Venable_disabled_menus_and_buttons = Qnil;
DEFVAR_LISP ("select-active-regions",
Vselect_active_regions,
doc: /* If non-nil, an active region automatically sets the primary selection.
If the value is `only', only temporarily active regions (usually made
by mouse-dragging or shift-selection) set the window selection.
This takes effect only when Transient Mark mode is enabled. */);
Vselect_active_regions = Qt;
DEFVAR_LISP ("saved-region-selection",
Vsaved_region_selection,
doc: /* Contents of active region prior to buffer modification.
If `select-active-regions' is non-nil, Emacs sets this to the
text in the region before modifying the buffer. The next call to
the function `deactivate-mark' uses this to set the window selection. */);
Vsaved_region_selection = Qnil;
DEFVAR_LISP ("selection-inhibit-update-commands",
Vselection_inhibit_update_commands,
doc: /* List of commands which should not update the selection.
Normally, if `select-active-regions' is non-nil and the mark remains
active after a command (i.e. the mark was not deactivated), the Emacs
command loop sets the selection to the text in the region. However,
if the command is in this list, the selection is not updated. */);
Vselection_inhibit_update_commands
= list2 (Qhandle_switch_frame, Qhandle_select_window);
DEFVAR_LISP ("debug-on-event",
Vdebug_on_event,
doc: /* Enter debugger on this event.
When Emacs receives the special event specified by this variable,
it will try to break into the debugger as soon as possible instead
of processing the event normally through `special-event-map'.
Currently, the only supported values for this
variable are `sigusr1' and `sigusr2'. */);
Vdebug_on_event = intern_c_string ("sigusr2");
DEFVAR_BOOL ("attempt-stack-overflow-recovery",
attempt_stack_overflow_recovery,
doc: /* If non-nil, attempt to recover from C stack overflows.
This recovery is potentially unsafe and may lead to deadlocks or data
corruption, but it usually works and may preserve modified buffers
that would otherwise be lost. If nil, treat stack overflow like any
other kind of crash or fatal error. */);
attempt_stack_overflow_recovery = true;
DEFVAR_BOOL ("attempt-orderly-shutdown-on-fatal-signal",
attempt_orderly_shutdown_on_fatal_signal,
doc: /* If non-nil, attempt orderly shutdown on fatal signals.
By default this variable is non-nil, and Emacs attempts to perform
an orderly shutdown when it catches a fatal signal (e.g., a crash).
The orderly shutdown includes an attempt to auto-save your unsaved edits
and other useful cleanups. These cleanups are potentially unsafe and may
lead to deadlocks or data corruption, but it usually works and may
preserve data in modified buffers that would otherwise be lost.
If nil, Emacs crashes immediately in response to fatal signals. */);
attempt_orderly_shutdown_on_fatal_signal = true;
DEFVAR_LISP ("while-no-input-ignore-events",
Vwhile_no_input_ignore_events,
doc: /* Ignored events from while-no-input. */);
pdumper_do_now_and_after_load (syms_of_keyboard_for_pdumper);
}
static void
syms_of_keyboard_for_pdumper (void)
{
/* Make sure input state is pristine when restoring from a dump.
init_keyboard() also resets some of these, but the duplication
doesn't hurt and makes sure that allocate_kboard and subsequent
early init functions see the environment they expect. */
PDUMPER_RESET_LV (pending_funcalls, Qnil);
PDUMPER_RESET_LV (unread_switch_frame, Qnil);
PDUMPER_RESET_LV (internal_last_event_frame, Qnil);
PDUMPER_RESET_LV (last_command_event, Qnil);
PDUMPER_RESET_LV (last_nonmenu_event, Qnil);
PDUMPER_RESET_LV (last_input_event, Qnil);
PDUMPER_RESET_LV (Vunread_command_events, Qnil);
PDUMPER_RESET_LV (Vunread_post_input_method_events, Qnil);
PDUMPER_RESET_LV (Vunread_input_method_events, Qnil);
PDUMPER_RESET_LV (Vthis_command, Qnil);
PDUMPER_RESET_LV (Vreal_this_command, Qnil);
PDUMPER_RESET_LV (Vthis_command_keys_shift_translated, Qnil);
PDUMPER_RESET_LV (Vthis_original_command, Qnil);
PDUMPER_RESET (num_input_keys, 0);
PDUMPER_RESET (num_nonmacro_input_events, 0);
PDUMPER_RESET_LV (Vlast_event_frame, Qnil);
PDUMPER_RESET_LV (Vdeferred_action_list, Qnil);
PDUMPER_RESET_LV (Vdelayed_warnings_list, Qnil);
/* Create the initial keyboard. Qt means 'unset'. */
eassert (initial_kboard == NULL);
initial_kboard = allocate_kboard (Qt);
}
void
keys_of_keyboard (void)
{
initial_define_lispy_key (Vspecial_event_map, "delete-frame",
"handle-delete-frame");
#ifdef HAVE_NTGUI
initial_define_lispy_key (Vspecial_event_map, "end-session",
"kill-emacs");
#endif
initial_define_lispy_key (Vspecial_event_map, "ns-put-working-text",
"ns-put-working-text");
initial_define_lispy_key (Vspecial_event_map, "ns-unput-working-text",
"ns-unput-working-text");
/* Here we used to use `ignore-event' which would simple set prefix-arg to
current-prefix-arg, as is done in `handle-switch-frame'.
But `handle-switch-frame is not run from the special-map.
Commands from that map are run in a special way that automatically
preserves the prefix-arg. Restoring the prefix arg here is not just
redundant but harmful:
- C-u C-x v =
- current-prefix-arg is set to non-nil, prefix-arg is set to nil.
- after the first prompt, the exit-minibuffer-hook is run which may
iconify a frame and thus push a `iconify-frame' event.
- after running exit-minibuffer-hook, current-prefix-arg is
restored to the non-nil value it had before the prompt.
- we enter the second prompt.
current-prefix-arg is non-nil, prefix-arg is nil.
- before running the first real event, we run the special iconify-frame
event, but we pass the `special' arg to command-execute so
current-prefix-arg and prefix-arg are left untouched.
- here we foolishly copy the non-nil current-prefix-arg to prefix-arg.
- the next key event will have a spuriously non-nil current-prefix-arg. */
initial_define_lispy_key (Vspecial_event_map, "iconify-frame",
"ignore");
initial_define_lispy_key (Vspecial_event_map, "make-frame-visible",
"ignore");
/* Handling it at such a low-level causes read_key_sequence to get
* confused because it doesn't realize that the current_buffer was
* changed by read_char.
*
* initial_define_lispy_key (Vspecial_event_map, "select-window",
* "handle-select-window"); */
initial_define_lispy_key (Vspecial_event_map, "save-session",
"handle-save-session");
#ifdef HAVE_DBUS
/* Define a special event which is raised for dbus callback
functions. */
initial_define_lispy_key (Vspecial_event_map, "dbus-event",
"dbus-handle-event");
#endif
#ifdef THREADS_ENABLED
/* Define a special event which is raised for thread signals. */
initial_define_lispy_key (Vspecial_event_map, "thread-event",
"thread-handle-event");
#endif
#ifdef USE_FILE_NOTIFY
/* Define a special event which is raised for notification callback
functions. */
initial_define_lispy_key (Vspecial_event_map, "file-notify",
"file-notify-handle-event");
#endif /* USE_FILE_NOTIFY */
initial_define_lispy_key (Vspecial_event_map, "config-changed-event",
"ignore");
#if defined (WINDOWSNT)
initial_define_lispy_key (Vspecial_event_map, "language-change",
"ignore");
#endif
initial_define_lispy_key (Vspecial_event_map, "focus-in",
"handle-focus-in");
initial_define_lispy_key (Vspecial_event_map, "focus-out",
"handle-focus-out");
initial_define_lispy_key (Vspecial_event_map, "move-frame",
"handle-move-frame");
}
/* Mark the pointers in the kboard objects.
Called by Fgarbage_collect. */
void
mark_kboards (void)
{
for (KBOARD *kb = all_kboards; kb; kb = kb->next_kboard)
{
if (kb->kbd_macro_buffer)
mark_objects (kb->kbd_macro_buffer,
kb->kbd_macro_ptr - kb->kbd_macro_buffer);
mark_object (KVAR (kb, Voverriding_terminal_local_map));
mark_object (KVAR (kb, Vlast_command));
mark_object (KVAR (kb, Vreal_last_command));
mark_object (KVAR (kb, Vkeyboard_translate_table));
mark_object (KVAR (kb, Vlast_repeatable_command));
mark_object (KVAR (kb, Vprefix_arg));
mark_object (KVAR (kb, Vlast_prefix_arg));
mark_object (KVAR (kb, kbd_queue));
mark_object (KVAR (kb, defining_kbd_macro));
mark_object (KVAR (kb, Vlast_kbd_macro));
mark_object (KVAR (kb, Vsystem_key_alist));
mark_object (KVAR (kb, system_key_syms));
mark_object (KVAR (kb, Vwindow_system));
mark_object (KVAR (kb, Vinput_decode_map));
mark_object (KVAR (kb, Vlocal_function_key_map));
mark_object (KVAR (kb, Vdefault_minibuffer_frame));
mark_object (KVAR (kb, echo_string));
mark_object (KVAR (kb, echo_prompt));
}
for (union buffered_input_event *event = kbd_fetch_ptr;
event != kbd_store_ptr; event = next_kbd_event (event))
{
/* These two special event types have no Lisp_Objects to mark. */
if (event->kind != SELECTION_REQUEST_EVENT
&& event->kind != SELECTION_CLEAR_EVENT)
{
mark_object (event->ie.x);
mark_object (event->ie.y);
mark_object (event->ie.frame_or_window);
mark_object (event->ie.arg);
}
}
}
| 0xAX/emacs | src/keyboard.c | C | gpl-3.0 | 395,380 |
///
/// WSView.h
/// PowerPlot
///
/// Basic view class which uses the simple versioning mechanism
/// (optional).
///
///
/// Created by Wolfram Schroers on 03/15/10.
/// Copyright 2010 Numerik & Analyse Schroers. All rights reserved.
///
#import <UIKit/UIKit.h>
#import "WSVersion.h"
#import "WSVersionDelegate.h"
#import "NAAmethyst.h"
@interface WSView : UIView <WSVersionDelegate>
@end
| jonguan/PowerPlotTest | PowerPlotLib/PowerPlotLib/PowerPlot_lib/lib/WSView.h | C | gpl-3.0 | 401 |
<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT> /*<a name="line.1"></a>
<FONT color="green">002</FONT> * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
<FONT color="green">003</FONT> * contributor license agreements. See the NOTICE file distributed with<a name="line.3"></a>
<FONT color="green">004</FONT> * this work for additional information regarding copyright ownership.<a name="line.4"></a>
<FONT color="green">005</FONT> * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
<FONT color="green">006</FONT> * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
<FONT color="green">007</FONT> * the License. You may obtain a copy of the License at<a name="line.7"></a>
<FONT color="green">008</FONT> *<a name="line.8"></a>
<FONT color="green">009</FONT> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
<FONT color="green">010</FONT> *<a name="line.10"></a>
<FONT color="green">011</FONT> * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
<FONT color="green">012</FONT> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
<FONT color="green">013</FONT> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
<FONT color="green">014</FONT> * See the License for the specific language governing permissions and<a name="line.14"></a>
<FONT color="green">015</FONT> * limitations under the License.<a name="line.15"></a>
<FONT color="green">016</FONT> */<a name="line.16"></a>
<FONT color="green">017</FONT> <a name="line.17"></a>
<FONT color="green">018</FONT> <a name="line.18"></a>
<FONT color="green">019</FONT> package org.apache.commons.net.ftp.parser;<a name="line.19"></a>
<FONT color="green">020</FONT> <a name="line.20"></a>
<FONT color="green">021</FONT> import java.util.regex.MatchResult;<a name="line.21"></a>
<FONT color="green">022</FONT> import java.util.regex.Matcher;<a name="line.22"></a>
<FONT color="green">023</FONT> import java.util.regex.Pattern;<a name="line.23"></a>
<FONT color="green">024</FONT> import java.util.regex.PatternSyntaxException;<a name="line.24"></a>
<FONT color="green">025</FONT> <a name="line.25"></a>
<FONT color="green">026</FONT> import org.apache.commons.net.ftp.FTPFileEntryParserImpl;<a name="line.26"></a>
<FONT color="green">027</FONT> <a name="line.27"></a>
<FONT color="green">028</FONT> /**<a name="line.28"></a>
<FONT color="green">029</FONT> * This abstract class implements both the older FTPFileListParser and<a name="line.29"></a>
<FONT color="green">030</FONT> * newer FTPFileEntryParser interfaces with default functionality.<a name="line.30"></a>
<FONT color="green">031</FONT> * All the classes in the parser subpackage inherit from this.<a name="line.31"></a>
<FONT color="green">032</FONT> *<a name="line.32"></a>
<FONT color="green">033</FONT> * This is the base class for all regular expression based FTPFileEntryParser classes<a name="line.33"></a>
<FONT color="green">034</FONT> *<a name="line.34"></a>
<FONT color="green">035</FONT> * @author Steve Cohen <scohen@apache.org><a name="line.35"></a>
<FONT color="green">036</FONT> */<a name="line.36"></a>
<FONT color="green">037</FONT> public abstract class RegexFTPFileEntryParserImpl extends<a name="line.37"></a>
<FONT color="green">038</FONT> FTPFileEntryParserImpl {<a name="line.38"></a>
<FONT color="green">039</FONT> /**<a name="line.39"></a>
<FONT color="green">040</FONT> * internal pattern the matcher tries to match, representing a file<a name="line.40"></a>
<FONT color="green">041</FONT> * entry<a name="line.41"></a>
<FONT color="green">042</FONT> */<a name="line.42"></a>
<FONT color="green">043</FONT> private Pattern pattern = null;<a name="line.43"></a>
<FONT color="green">044</FONT> <a name="line.44"></a>
<FONT color="green">045</FONT> /**<a name="line.45"></a>
<FONT color="green">046</FONT> * internal match result used by the parser<a name="line.46"></a>
<FONT color="green">047</FONT> */<a name="line.47"></a>
<FONT color="green">048</FONT> private MatchResult result = null;<a name="line.48"></a>
<FONT color="green">049</FONT> <a name="line.49"></a>
<FONT color="green">050</FONT> /**<a name="line.50"></a>
<FONT color="green">051</FONT> * Internal PatternMatcher object used by the parser. It has protected<a name="line.51"></a>
<FONT color="green">052</FONT> * scope in case subclasses want to make use of it for their own purposes.<a name="line.52"></a>
<FONT color="green">053</FONT> */<a name="line.53"></a>
<FONT color="green">054</FONT> protected Matcher _matcher_ = null;<a name="line.54"></a>
<FONT color="green">055</FONT> <a name="line.55"></a>
<FONT color="green">056</FONT> /**<a name="line.56"></a>
<FONT color="green">057</FONT> * The constructor for a RegexFTPFileEntryParserImpl object.<a name="line.57"></a>
<FONT color="green">058</FONT> *<a name="line.58"></a>
<FONT color="green">059</FONT> * @param regex The regular expression with which this object is<a name="line.59"></a>
<FONT color="green">060</FONT> * initialized.<a name="line.60"></a>
<FONT color="green">061</FONT> *<a name="line.61"></a>
<FONT color="green">062</FONT> * @exception IllegalArgumentException<a name="line.62"></a>
<FONT color="green">063</FONT> * Thrown if the regular expression is unparseable. Should not be seen in<a name="line.63"></a>
<FONT color="green">064</FONT> * normal conditions. It it is seen, this is a sign that a subclass has<a name="line.64"></a>
<FONT color="green">065</FONT> * been created with a bad regular expression. Since the parser must be<a name="line.65"></a>
<FONT color="green">066</FONT> * created before use, this means that any bad parser subclasses created<a name="line.66"></a>
<FONT color="green">067</FONT> * from this will bomb very quickly, leading to easy detection.<a name="line.67"></a>
<FONT color="green">068</FONT> */<a name="line.68"></a>
<FONT color="green">069</FONT> <a name="line.69"></a>
<FONT color="green">070</FONT> public RegexFTPFileEntryParserImpl(String regex) {<a name="line.70"></a>
<FONT color="green">071</FONT> super();<a name="line.71"></a>
<FONT color="green">072</FONT> setRegex(regex);<a name="line.72"></a>
<FONT color="green">073</FONT> }<a name="line.73"></a>
<FONT color="green">074</FONT> <a name="line.74"></a>
<FONT color="green">075</FONT> /**<a name="line.75"></a>
<FONT color="green">076</FONT> * Convenience method delegates to the internal MatchResult's matches()<a name="line.76"></a>
<FONT color="green">077</FONT> * method.<a name="line.77"></a>
<FONT color="green">078</FONT> *<a name="line.78"></a>
<FONT color="green">079</FONT> * @param s the String to be matched<a name="line.79"></a>
<FONT color="green">080</FONT> * @return true if s matches this object's regular expression.<a name="line.80"></a>
<FONT color="green">081</FONT> */<a name="line.81"></a>
<FONT color="green">082</FONT> <a name="line.82"></a>
<FONT color="green">083</FONT> public boolean matches(String s) {<a name="line.83"></a>
<FONT color="green">084</FONT> this.result = null;<a name="line.84"></a>
<FONT color="green">085</FONT> _matcher_ = pattern.matcher(s);<a name="line.85"></a>
<FONT color="green">086</FONT> if (_matcher_.matches()) {<a name="line.86"></a>
<FONT color="green">087</FONT> this.result = _matcher_.toMatchResult();<a name="line.87"></a>
<FONT color="green">088</FONT> }<a name="line.88"></a>
<FONT color="green">089</FONT> return null != this.result;<a name="line.89"></a>
<FONT color="green">090</FONT> }<a name="line.90"></a>
<FONT color="green">091</FONT> <a name="line.91"></a>
<FONT color="green">092</FONT> /**<a name="line.92"></a>
<FONT color="green">093</FONT> * Convenience method<a name="line.93"></a>
<FONT color="green">094</FONT> *<a name="line.94"></a>
<FONT color="green">095</FONT> * @return the number of groups() in the internal MatchResult.<a name="line.95"></a>
<FONT color="green">096</FONT> */<a name="line.96"></a>
<FONT color="green">097</FONT> <a name="line.97"></a>
<FONT color="green">098</FONT> public int getGroupCnt() {<a name="line.98"></a>
<FONT color="green">099</FONT> if (this.result == null) {<a name="line.99"></a>
<FONT color="green">100</FONT> return 0;<a name="line.100"></a>
<FONT color="green">101</FONT> }<a name="line.101"></a>
<FONT color="green">102</FONT> return this.result.groupCount();<a name="line.102"></a>
<FONT color="green">103</FONT> }<a name="line.103"></a>
<FONT color="green">104</FONT> <a name="line.104"></a>
<FONT color="green">105</FONT> /**<a name="line.105"></a>
<FONT color="green">106</FONT> * Convenience method delegates to the internal MatchResult's group()<a name="line.106"></a>
<FONT color="green">107</FONT> * method.<a name="line.107"></a>
<FONT color="green">108</FONT> *<a name="line.108"></a>
<FONT color="green">109</FONT> * @param matchnum match group number to be retrieved<a name="line.109"></a>
<FONT color="green">110</FONT> *<a name="line.110"></a>
<FONT color="green">111</FONT> * @return the content of the <code>matchnum'th</code> group of the internal<a name="line.111"></a>
<FONT color="green">112</FONT> * match or null if this method is called without a match having<a name="line.112"></a>
<FONT color="green">113</FONT> * been made.<a name="line.113"></a>
<FONT color="green">114</FONT> */<a name="line.114"></a>
<FONT color="green">115</FONT> public String group(int matchnum) {<a name="line.115"></a>
<FONT color="green">116</FONT> if (this.result == null) {<a name="line.116"></a>
<FONT color="green">117</FONT> return null;<a name="line.117"></a>
<FONT color="green">118</FONT> }<a name="line.118"></a>
<FONT color="green">119</FONT> return this.result.group(matchnum);<a name="line.119"></a>
<FONT color="green">120</FONT> }<a name="line.120"></a>
<FONT color="green">121</FONT> <a name="line.121"></a>
<FONT color="green">122</FONT> /**<a name="line.122"></a>
<FONT color="green">123</FONT> * For debugging purposes - returns a string shows each match group by<a name="line.123"></a>
<FONT color="green">124</FONT> * number.<a name="line.124"></a>
<FONT color="green">125</FONT> *<a name="line.125"></a>
<FONT color="green">126</FONT> * @return a string shows each match group by number.<a name="line.126"></a>
<FONT color="green">127</FONT> */<a name="line.127"></a>
<FONT color="green">128</FONT> <a name="line.128"></a>
<FONT color="green">129</FONT> public String getGroupsAsString() {<a name="line.129"></a>
<FONT color="green">130</FONT> StringBuilder b = new StringBuilder();<a name="line.130"></a>
<FONT color="green">131</FONT> for (int i = 1; i <= this.result.groupCount(); i++) {<a name="line.131"></a>
<FONT color="green">132</FONT> b.append(i).append(") ").append(this.result.group(i)).append(<a name="line.132"></a>
<FONT color="green">133</FONT> System.getProperty("line.separator"));<a name="line.133"></a>
<FONT color="green">134</FONT> }<a name="line.134"></a>
<FONT color="green">135</FONT> return b.toString();<a name="line.135"></a>
<FONT color="green">136</FONT> }<a name="line.136"></a>
<FONT color="green">137</FONT> <a name="line.137"></a>
<FONT color="green">138</FONT> /**<a name="line.138"></a>
<FONT color="green">139</FONT> * Alter the current regular expression being utilised for entry parsing<a name="line.139"></a>
<FONT color="green">140</FONT> * and create a new {@link Pattern} instance.<a name="line.140"></a>
<FONT color="green">141</FONT> * @param regex The new regular expression<a name="line.141"></a>
<FONT color="green">142</FONT> * @return true if the compiled pattern is not null<a name="line.142"></a>
<FONT color="green">143</FONT> * @since 2.0<a name="line.143"></a>
<FONT color="green">144</FONT> */<a name="line.144"></a>
<FONT color="green">145</FONT> public boolean setRegex(String regex) {<a name="line.145"></a>
<FONT color="green">146</FONT> try {<a name="line.146"></a>
<FONT color="green">147</FONT> pattern = Pattern.compile(regex);<a name="line.147"></a>
<FONT color="green">148</FONT> } catch (PatternSyntaxException pse) {<a name="line.148"></a>
<FONT color="green">149</FONT> throw new IllegalArgumentException("Unparseable regex supplied: "<a name="line.149"></a>
<FONT color="green">150</FONT> + regex);<a name="line.150"></a>
<FONT color="green">151</FONT> }<a name="line.151"></a>
<FONT color="green">152</FONT> return (pattern != null);<a name="line.152"></a>
<FONT color="green">153</FONT> }<a name="line.153"></a>
<FONT color="green">154</FONT> <a name="line.154"></a>
<FONT color="green">155</FONT> }<a name="line.155"></a>
</PRE>
</BODY>
</HTML>
| msf-ch/msf-malnutrition | msf-malnutrition/lib/commons-net-3.1/apidocs/src-html/org/apache/commons/net/ftp/parser/RegexFTPFileEntryParserImpl.html | HTML | gpl-3.0 | 14,079 |
<?php
/**
* This is part of rampage.php
* Copyright (c) 2012 Axel Helmert
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* @category library
* @package rampage.core
* @author Axel Helmert
* @copyright Copyright (c) 2013 Axel Helmert
* @license http://www.gnu.org/licenses/gpl-3.0.txt GNU General Public License
*/
namespace rampage\core\resources;
use rampage\core\exception;
use rampage\core\BaseUrl;
use Zend\View\HelperPluginManager;
use Zend\Mvc\Router\RouteInterface;
/**
* Theme auto publishing
*/
class UrlLocator implements UrlLocatorInterface
{
/**
* @var ThemeInterface
*/
protected $theme = null;
/**
* Cached url locations
*
* @var string
*/
protected $locations = null;
/**
* @var PublishingStrategyInterface
*/
protected $publishingStrategy = null;
/**
* @var RouteInterface
*/
protected $router = null;
/**
* @var BaseUrl
*/
protected $baseUrl = null;
/**
* Construct
*
* @param FileLocatorInterface $fileLocator
* @param UrlRepository $urlRepository
*/
public function __construct(ThemeInterface $theme, PublishingStrategyInterface $strategy)
{
$this->theme = $theme;
$this->publishingStrategy = $strategy;
}
/**
* @param RouteInterface $router
* @return self
*/
public function setRouter(RouteInterface $router)
{
$this->router = $router;
return $this;
}
/**
* @param string|BaseUrl|\Zend\Uri\Http $baseUrl
*/
public function setBaseUrl($baseUrl = null)
{
if (!$baseUrl instanceof BaseUrl) {
$baseUrl = new BaseUrl($baseUrl);
}
$this->baseUrl = $baseUrl;
}
/**
* @param PublishingStrategyInterface $strategy
* @return self
*/
public function setPublishingStrategy(PublishingStrategyInterface $strategy)
{
$this->publishingStrategy = $strategy;
return $this;
}
/**
* @param HelperPluginManager $helpers
* @return self
*/
public function setViewHelperManager(HelperPluginManager $helpers)
{
$this->helpers = $helpers;
return $this;
}
/**
* Current file locator instance
*
* @return \rampage\core\resources\ThemeInterface
*/
protected function getTheme()
{
return $this->theme;
}
/**
* Current theme
*
* @return null
*/
protected function getCurrentTheme()
{
return $this->getTheme()->getCurrentTheme();
}
/**
* Resolve relative path
*
* @param string $filename
* @param string $scope
* @param $theme
*/
protected function resolve($filename, $scope)
{
$scopeIndex = ($scope === false)? '' : $scope;
$theme = $this->getCurrentTheme();
$url = false;
if (isset($this->locations[$theme][$scopeIndex][$filename])) {
return $this->locations[$theme][$scopeIndex][$filename];
}
if ($this->publishingStrategy) {
$url = $this->publishingStrategy->find($filename, $scope, $this->getTheme());
}
if ($url === false) {
if (!$this->router) {
throw new exception\DependencyException('Missing router instance to build dynamic resource url');
}
$routeOptions = array(
'name' => 'rampage.core.resources',
);
$routeParams = array(
'theme' => $theme,
'scope' => ($scope? : '__theme__'),
'file' => $filename
);
$url = $this->router->assemble($routeParams, $routeOptions);
if ($this->baseUrl) {
$url = $this->baseUrl->getUrl($url);
}
}
$this->locations[$theme][$scopeIndex][$filename] = $url;
return $url;
}
/**
* (non-PHPdoc)
* @see \rampage\core\resource\UrlLocatorInterface::getUrl()
*/
public function getUrl($file, $scope = null)
{
$asset = new AssetPath($file, $scope);
return $this->resolve($asset->getPath(), $asset->getScope());
}
}
| tux-rampage/rampage-php | library/rampage/core/resources/UrlLocator.php | PHP | gpl-3.0 | 4,840 |
using Microsoft.Xna.Framework;
using Microsoft.Xna.Framework.Graphics;
using System;
using System.Collections.Generic;
using System.IO;
using System.Text;
namespace Terraria
{
public static class Utils
{
public static Dictionary<SpriteFont, float[]> charLengths = new Dictionary<SpriteFont, float[]>();
public static bool FloatIntersect(float r1StartX, float r1StartY, float r1Width, float r1Height, float r2StartX, float r2StartY, float r2Width, float r2Height)
{
return r1StartX <= r2StartX + r2Width && r1StartY <= r2StartY + r2Height && r1StartX + r1Width >= r2StartX && r1StartY + r1Height >= r2StartY;
}
public static string[] WordwrapString(string text, SpriteFont font, int maxWidth, int maxLines, out int lineAmount)
{
string[] array = new string[maxLines];
int num = 0;
List<string> list = new List<string>(text.Split(new char[]
{
'\n'
}));
List<string> list2 = new List<string>(list[0].Split(new char[]
{
' '
}));
for (int i = 1; i < list.Count; i++)
{
list2.Add("\n");
list2.AddRange(list[i].Split(new char[]
{
' '
}));
}
bool flag = true;
while (list2.Count > 0)
{
string text2 = list2[0];
string str = " ";
if (list2.Count == 1)
{
str = "";
}
if (text2 == "\n")
{
string[] array2;
IntPtr intPtr;
(array2 = array)[(int)(intPtr = (IntPtr)(num++))] = array2[(int)intPtr] + text2;
if (num >= maxLines)
{
break;
}
list2.RemoveAt(0);
}
else if (flag)
{
if (font.MeasureString(text2).X > (float)maxWidth)
{
string text3 = string.Concat(text2[0]);
int num2 = 1;
while (font.MeasureString(text3 + text2[num2] + '-').X <= (float)maxWidth)
{
text3 += text2[num2++];
}
text3 += '-';
array[num++] = text3 + " ";
if (num >= maxLines)
{
break;
}
list2.RemoveAt(0);
list2.Insert(0, text2.Substring(num2));
}
else
{
string[] array3;
IntPtr intPtr2;
(array3 = array)[(int)(intPtr2 = (IntPtr)num)] = array3[(int)intPtr2] + text2 + str;
flag = false;
list2.RemoveAt(0);
}
}
else if (font.MeasureString(array[num] + text2).X > (float)maxWidth)
{
num++;
if (num >= maxLines)
{
break;
}
flag = true;
}
else
{
string[] array4;
IntPtr intPtr3;
(array4 = array)[(int)(intPtr3 = (IntPtr)num)] = array4[(int)intPtr3] + text2 + str;
flag = false;
list2.RemoveAt(0);
}
}
lineAmount = num;
if (lineAmount == maxLines)
{
lineAmount--;
}
return array;
}
public static void DrawBorderStringFourWay(SpriteBatch sb, SpriteFont font, string text, float x, float y, Color textColor, Color borderColor, Vector2 origin, float scale = 1f)
{
Color color = borderColor;
Vector2 zero = Vector2.Zero;
int i = 0;
while (i < 5)
{
switch (i)
{
case 0:
zero.X = x - 2f;
zero.Y = y;
break;
case 1:
zero.X = x + 2f;
zero.Y = y;
break;
case 2:
zero.X = x;
zero.Y = y - 2f;
break;
case 3:
zero.X = x;
zero.Y = y + 2f;
break;
case 4:
goto IL_92;
default:
goto IL_92;
}
IL_A6:
sb.DrawString(font, text, zero, color, 0f, origin, scale, SpriteEffects.None, 0f);
i++;
continue;
IL_92:
zero.X = x;
zero.Y = y;
color = textColor;
goto IL_A6;
}
}
public static Vector2 DrawBorderString(SpriteBatch sb, string text, Vector2 pos, Color color, float scale = 1f, float anchorx = 0f, float anchory = 0f, int stringLimit = -1)
{
if (stringLimit != -1 && text.Length > stringLimit)
{
text.Substring(0, stringLimit);
}
SpriteFont fontMouseText = Main.fontMouseText;
for (int i = -1; i < 2; i++)
{
for (int j = -1; j < 2; j++)
{
sb.DrawString(fontMouseText, text, pos + new Vector2((float)i, (float)j) * 1f, Color.Black, 0f, new Vector2(anchorx, anchory) * fontMouseText.MeasureString(text), scale, SpriteEffects.None, 0f);
}
}
sb.DrawString(fontMouseText, text, pos, color, 0f, new Vector2(anchorx, anchory) * fontMouseText.MeasureString(text), scale, SpriteEffects.None, 0f);
return fontMouseText.MeasureString(text) * scale;
}
public static Vector2 DrawBorderStringBig(SpriteBatch sb, string text, Vector2 pos, Color color, float scale = 1f, float anchorx = 0f, float anchory = 0f, int stringLimit = -1)
{
if (stringLimit != -1 && text.Length > stringLimit)
{
text.Substring(0, stringLimit);
}
SpriteFont fontDeathText = Main.fontDeathText;
for (int i = -1; i < 2; i++)
{
for (int j = -1; j < 2; j++)
{
sb.DrawString(fontDeathText, text, pos + new Vector2((float)i, (float)j) * 1f, Color.Black, 0f, new Vector2(anchorx, anchory) * fontDeathText.MeasureString(text), scale, SpriteEffects.None, 0f);
}
}
sb.DrawString(fontDeathText, text, pos, color, 0f, new Vector2(anchorx, anchory) * fontDeathText.MeasureString(text), scale, SpriteEffects.None, 0f);
return fontDeathText.MeasureString(text) * scale;
}
public static void DrawInvBG(SpriteBatch sb, Rectangle R, Color c = default(Color))
{
Utils.DrawInvBG(sb, R.X, R.Y, R.Width, R.Height, c);
}
public static void DrawInvBG(SpriteBatch sb, float x, float y, float w, float h, Color c = default(Color))
{
Utils.DrawInvBG(sb, (int)x, (int)y, (int)w, (int)h, c);
}
public static void DrawInvBG(SpriteBatch sb, int x, int y, int w, int h, Color c = default(Color))
{
if (c == default(Color))
{
c = new Color(63, 65, 151, 255) * 0.785f;
}
Texture2D inventoryBack13Texture = Main.inventoryBack13Texture;
if (w < 20)
{
w = 20;
}
if (h < 20)
{
h = 20;
}
sb.Draw(inventoryBack13Texture, new Rectangle(x, y, 10, 10), new Rectangle?(new Rectangle(0, 0, 10, 10)), c);
sb.Draw(inventoryBack13Texture, new Rectangle(x + 10, y, w - 20, 10), new Rectangle?(new Rectangle(10, 0, 10, 10)), c);
sb.Draw(inventoryBack13Texture, new Rectangle(x + w - 10, y, 10, 10), new Rectangle?(new Rectangle(inventoryBack13Texture.Width - 10, 0, 10, 10)), c);
sb.Draw(inventoryBack13Texture, new Rectangle(x, y + 10, 10, h - 20), new Rectangle?(new Rectangle(0, 10, 10, 10)), c);
sb.Draw(inventoryBack13Texture, new Rectangle(x + 10, y + 10, w - 20, h - 20), new Rectangle?(new Rectangle(10, 10, 10, 10)), c);
sb.Draw(inventoryBack13Texture, new Rectangle(x + w - 10, y + 10, 10, h - 20), new Rectangle?(new Rectangle(inventoryBack13Texture.Width - 10, 10, 10, 10)), c);
sb.Draw(inventoryBack13Texture, new Rectangle(x, y + h - 10, 10, 10), new Rectangle?(new Rectangle(0, inventoryBack13Texture.Height - 10, 10, 10)), c);
sb.Draw(inventoryBack13Texture, new Rectangle(x + 10, y + h - 10, w - 20, 10), new Rectangle?(new Rectangle(10, inventoryBack13Texture.Height - 10, 10, 10)), c);
sb.Draw(inventoryBack13Texture, new Rectangle(x + w - 10, y + h - 10, 10, 10), new Rectangle?(new Rectangle(inventoryBack13Texture.Width - 10, inventoryBack13Texture.Height - 10, 10, 10)), c);
}
public static void WriteRGB(this BinaryWriter bb, Color c)
{
bb.Write(c.R);
bb.Write(c.G);
bb.Write(c.B);
}
public static void WriteVector2(this BinaryWriter bb, Vector2 v)
{
bb.Write(v.X);
bb.Write(v.Y);
}
public static Color ReadRGB(this BinaryReader bb)
{
return new Color((int)bb.ReadByte(), (int)bb.ReadByte(), (int)bb.ReadByte());
}
public static Vector2 ReadVector2(this BinaryReader bb)
{
return new Vector2(bb.ReadSingle(), bb.ReadSingle());
}
public static float ToRotation(this Vector2 v)
{
return (float)Math.Atan2((double)v.Y, (double)v.X);
}
public static Vector2 ToRotationVector2(this float f)
{
return new Vector2((float)Math.Cos((double)f), (float)Math.Sin((double)f));
}
public static Vector2 Rotate(this Vector2 spinningpoint, double radians, Vector2 center = default(Vector2))
{
float num = (float)Math.Cos(radians);
float num2 = (float)Math.Sin(radians);
Vector2 vector = spinningpoint - center;
Vector2 result = center;
result.X += vector.X * num - vector.Y * num2;
result.Y += vector.X * num2 + vector.Y * num;
return result;
}
public static Color Multiply(this Color firstColor, Color secondColor)
{
return new Color((int)((byte)((float)(firstColor.R * secondColor.R) / 255f)), (int)((byte)((float)(firstColor.G * secondColor.G) / 255f)), (int)((byte)((float)(firstColor.B * secondColor.B) / 255f)));
}
}
}
| NyxStudios/ModBox | Terraria/Terraria/Utils.cs | C# | gpl-3.0 | 8,832 |
package ru.cft.chuldrenofcorn.cornchat;
import org.junit.Test;
import static org.junit.Assert.*;
/**
* To work on unit tests, switch the Test Artifact in the Build Variants view.
*/
public class ExampleUnitTest {
@Test
public void addition_isCorrect() throws Exception {
assertEquals(4, 2 + 2);
}
} | ChildrenOfCorn/CornChat | app/src/test/java/ru/cft/chuldrenofcorn/cornchat/ExampleUnitTest.java | Java | gpl-3.0 | 323 |
<?php
/**
* This file is part of OXID eShop Community Edition.
*
* OXID eShop Community Edition is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* OXID eShop Community Edition is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with OXID eShop Community Edition. If not, see <http://www.gnu.org/licenses/>.
*
* @link http://www.oxid-esales.com
* @package smarty_plugins
* @copyright (C) OXID eSales AG 2003-2013
* @version OXID eShop CE
* @version SVN: $Id: function.oxid_include_widget.php 50798 2012-10-22 08:59:35Z saulius.stasiukaitis $
*/
/**
* Smarty function
* -------------------------------------------------------------
* Purpose: set params and render widget
* Use [{ oxid_include_dynamic file="..." }] instead of include
* -------------------------------------------------------------
*
* @param array $params params
* @param Smarty &$oSmarty clever simulation of a method
*
* @return string
*/
function smarty_function_oxid_include_widget($params, &$oSmarty)
{
$myConfig = oxRegistry::getConfig();
$blNoScript = ($params['noscript']?$params['noscript']:false);
$sClass = strtolower($params['cl']);
$params['cl'] = $sClass;
$aParentViews = null;
unset($params['cl']);
$aParentViews = null;
if ( !empty($params["_parent"]) ) {
$aParentViews = explode("|", $params["_parent"]);
unset( $params["_parent"] );
}
$oShopControl = oxRegistry::get('oxWidgetControl');
return $oShopControl->start( $sClass, null, $params, $aParentViews );
}
| NikolayPetrenko/oxid | core/smarty/plugins/function.oxid_include_widget.php | PHP | gpl-3.0 | 2,031 |
module.exports = function(grunt) {
grunt.initConfig({
// !! This is the name of the task 'requirejs' (grunt-contrib-requirejs module)
requirejs: {
dist: {
// !! You can drop your app.build.js config wholesale into 'options'
options: {
appDir: "bl_scoreboard/static",
baseUrl: "js",
dir: "bl_scoreboard/dist",
keepBuildDir: true, // cleanup of 'dist' is supposed to be done by 'purge:dist' task
mainConfigFile: "bl_scoreboard/static/js/main.js",
name: "main", // points to 'static/js/main.js'
optimize: 'uglify2',
uglify2: {
compress: {}
},
skipDirOptimize: true,
preserveLicenseComments: false,
findNestedDependencies: false,
removeCombined: true,
inlineText: true,
optimizeCss: 'standard',
logLevel: 0,
fileExclusionRegExp: /^\./
}
}
},
compress: {
dist: {
options: {
mode: 'gzip',
level: 9
},
files: [
{expand: true, src: [
'bl_scoreboard/dist/js/**/*.js',
'bl_scoreboard/dist/lib/requirejs/require.js'
], ext: '.js.gz'}
]
}
},
uglify: {
rjs_dist: {
options: { },
files: {
'bl_scoreboard/dist/lib/requirejs/require.js': ['bl_scoreboard/dist/lib/requirejs/require.js']
}
}
},
// !! This is the name of the task 'clean' (grunt-contrib-clean module) after renaming to 'purge'
purge: {
dist: {
src: [
'bl_scoreboard/dist/*', '!bl_scoreboard/dist/.gitignore'
]
},
dev: {
src: [
'bl_scoreboard/static/lib/*', '!bl_scoreboard/static/lib/.gitignore',
]
}
},
// !! Bower's 'install' task
bower: {
dev: {
options: {
// targetDir: "bl_scoreboard/static/lib",
// layout: "byComponent",
verbose: true
}
}
},
bower_rjs: {
all: {
rjsConfig: "bl_scoreboard/static/js/main.js"
}
}
});
// This loads the requirejs plugin into grunt
grunt.loadNpmTasks('grunt-contrib-requirejs');
grunt.loadNpmTasks('grunt-contrib-compress');
grunt.loadNpmTasks('grunt-contrib-uglify');
// Must be renamed because 'clean' is very common name
grunt.loadNpmTasks('grunt-contrib-clean');
grunt.renameTask('clean', 'purge'); // because 'clean' is very common name
// Must be renamed because of task name conflict between 'grunt-bower-requirejs' and 'grunt-bower-task'.
// They both are use 'bower' task name.
// Also, 'bower-requirejs' npm module can be used. See '.bowerrc.inactive' at the root directory for some details.
grunt.loadNpmTasks('grunt-bower-requirejs');
grunt.renameTask('bower', 'bower_rjs');
grunt.loadNpmTasks('grunt-bower-task');
// Register tasks
grunt.registerTask('clean', ['purge:dist', 'purge:dev']);
grunt.registerTask('clean-dist', ['purge:dist']);
grunt.registerTask('clean-dev', ['purge:dev']);
grunt.registerTask('build-dev', ['clean-dev', 'bower:dev', 'bower_rjs']);
grunt.registerTask('build-dist', ['clean-dist', 'requirejs:dist', 'uglify:rjs_dist', 'compress:dist']);
};
| olegvg/scoreboard | Gruntfile.js | JavaScript | gpl-3.0 | 3,304 |
/*
Unix SMB/CIFS implementation.
VFS wrapper macros
Copyright (C) Stefan (metze) Metzmacher 2003
Copyright (C) Volker Lendecke 2009
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _VFS_MACROS_H
#define _VFS_MACROS_H
/*******************************************************************
Don't access conn->vfs.ops.* directly!!!
Use this macros!
(Fixes should go also into the vfs_opaque_* and vfs_next_* macros!)
********************************************************************/
/* Disk operations */
#define SMB_VFS_CONNECT(conn, service, user) \
smb_vfs_call_connect((conn)->vfs_handles, (service), (user))
#define SMB_VFS_NEXT_CONNECT(handle, service, user) \
smb_vfs_call_connect((handle)->next, (service), (user))
#define SMB_VFS_DISCONNECT(conn) \
smb_vfs_call_disconnect((conn)->vfs_handles)
#define SMB_VFS_NEXT_DISCONNECT(handle) \
smb_vfs_call_disconnect((handle)->next)
#define SMB_VFS_DISK_FREE(conn, path, small_query, bsize, dfree ,dsize) \
smb_vfs_call_disk_free((conn)->vfs_handles, (path), (small_query), (bsize), (dfree), (dsize))
#define SMB_VFS_NEXT_DISK_FREE(handle, path, small_query, bsize, dfree ,dsize)\
smb_vfs_call_disk_free((handle)->next, (path), (small_query), (bsize), (dfree), (dsize))
#define SMB_VFS_GET_QUOTA(conn, qtype, id, qt) \
smb_vfs_call_get_quota((conn)->vfs_handles, (qtype), (id), (qt))
#define SMB_VFS_NEXT_GET_QUOTA(handle, qtype, id, qt) \
smb_vfs_call_get_quota((handle)->next, (qtype), (id), (qt))
#define SMB_VFS_SET_QUOTA(conn, qtype, id, qt) \
smb_vfs_call_set_quota((conn)->vfs_handles, (qtype), (id), (qt))
#define SMB_VFS_NEXT_SET_QUOTA(handle, qtype, id, qt) \
smb_vfs_call_set_quota((handle)->next, (qtype), (id), (qt))
#define SMB_VFS_GET_SHADOW_COPY_DATA(fsp,shadow_copy_data,labels) \
smb_vfs_call_get_shadow_copy_data((fsp)->conn->vfs_handles, (fsp), (shadow_copy_data), (labels))
#define SMB_VFS_NEXT_GET_SHADOW_COPY_DATA(handle, fsp, shadow_copy_data ,labels) \
smb_vfs_call_get_shadow_copy_data((handle)->next, (fsp), (shadow_copy_data), (labels))
#define SMB_VFS_STATVFS(conn, path, statbuf) \
smb_vfs_call_statvfs((conn)->vfs_handles, (path), (statbuf))
#define SMB_VFS_NEXT_STATVFS(handle, path, statbuf) \
smb_vfs_call_statvfs((handle)->next, (path), (statbuf))
#define SMB_VFS_FS_CAPABILITIES(conn, p_ts_res) \
smb_vfs_call_fs_capabilities((conn)->vfs_handles, (p_ts_res))
#define SMB_VFS_NEXT_FS_CAPABILITIES(handle, p_ts_res) \
smb_vfs_call_fs_capabilities((handle)->next, (p_ts_res))
/*
* Note: that "struct dfs_GetDFSReferral *r"
* needs to be a valid TALLOC_CTX
*/
#define SMB_VFS_GET_DFS_REFERRALS(conn, r) \
smb_vfs_call_get_dfs_referrals((conn)->vfs_handles, (r))
#define SMB_VFS_NEXT_GET_DFS_REFERRALS(handle, r) \
smb_vfs_call_get_dfs_referrals((handle)->next, (r))
/* Directory operations */
#define SMB_VFS_OPENDIR(conn, fname, mask, attr) \
smb_vfs_call_opendir((conn)->vfs_handles, (fname), (mask), (attr))
#define SMB_VFS_NEXT_OPENDIR(handle, fname, mask, attr) \
smb_vfs_call_opendir((handle)->next, (fname), (mask), (attr))
#define SMB_VFS_FDOPENDIR(fsp, mask, attr) \
smb_vfs_call_fdopendir((fsp)->conn->vfs_handles, (fsp), (mask), (attr))
#define SMB_VFS_NEXT_FDOPENDIR(handle, fsp, mask, attr) \
smb_vfs_call_fdopendir((handle)->next, (fsp), (mask), (attr))
#define SMB_VFS_READDIR(conn, dirp, sbuf) \
smb_vfs_call_readdir((conn)->vfs_handles, (dirp), (sbuf))
#define SMB_VFS_NEXT_READDIR(handle, dirp, sbuf) \
smb_vfs_call_readdir((handle)->next, (dirp), (sbuf))
#define SMB_VFS_SEEKDIR(conn, dirp, offset) \
smb_vfs_call_seekdir((conn)->vfs_handles, (dirp), (offset))
#define SMB_VFS_NEXT_SEEKDIR(handle, dirp, offset) \
smb_vfs_call_seekdir((handle)->next, (dirp), (offset))
#define SMB_VFS_TELLDIR(conn, dirp) \
smb_vfs_call_telldir((conn)->vfs_handles, (dirp))
#define SMB_VFS_NEXT_TELLDIR(handle, dirp) \
smb_vfs_call_telldir((handle)->next, (dirp))
#define SMB_VFS_REWINDDIR(conn, dirp) \
smb_vfs_call_rewind_dir((conn)->vfs_handles, (dirp))
#define SMB_VFS_NEXT_REWINDDIR(handle, dirp) \
smb_vfs_call_rewind_dir((handle)->next, (dirp))
#define SMB_VFS_MKDIR(conn, path, mode) \
smb_vfs_call_mkdir((conn)->vfs_handles,(path), (mode))
#define SMB_VFS_NEXT_MKDIR(handle, path, mode) \
smb_vfs_call_mkdir((handle)->next,(path), (mode))
#define SMB_VFS_RMDIR(conn, path) \
smb_vfs_call_rmdir((conn)->vfs_handles, (path))
#define SMB_VFS_NEXT_RMDIR(handle, path) \
smb_vfs_call_rmdir((handle)->next, (path))
#define SMB_VFS_CLOSEDIR(conn, dir) \
smb_vfs_call_closedir((conn)->vfs_handles, dir)
#define SMB_VFS_NEXT_CLOSEDIR(handle, dir) \
smb_vfs_call_closedir((handle)->next, (dir))
#define SMB_VFS_INIT_SEARCH_OP(conn, dirp) \
smb_vfs_call_init_search_op((conn)->vfs_handles, (dirp))
#define SMB_VFS_NEXT_INIT_SEARCH_OP(handle, dirp) \
smb_vfs_call_init_search_op((handle)->next, (dirp))
/* File operations */
#define SMB_VFS_OPEN(conn, fname, fsp, flags, mode) \
smb_vfs_call_open((conn)->vfs_handles, (fname), (fsp), (flags), (mode))
#define SMB_VFS_NEXT_OPEN(handle, fname, fsp, flags, mode) \
smb_vfs_call_open((handle)->next, (fname), (fsp), (flags), (mode))
#define SMB_VFS_CREATE_FILE(conn, req, root_dir_fid, smb_fname, access_mask, share_access, create_disposition, \
create_options, file_attributes, oplock_request, allocation_size, private_flags, sd, ea_list, result, pinfo) \
smb_vfs_call_create_file((conn)->vfs_handles, (req), (root_dir_fid), (smb_fname), (access_mask), (share_access), (create_disposition), \
(create_options), (file_attributes), (oplock_request), (allocation_size), (private_flags), (sd), (ea_list), (result), (pinfo))
#define SMB_VFS_NEXT_CREATE_FILE(handle, req, root_dir_fid, smb_fname, access_mask, share_access, create_disposition, \
create_options, file_attributes, oplock_request, allocation_size, private_flags, sd, ea_list, result, pinfo) \
smb_vfs_call_create_file((handle)->next, (req), (root_dir_fid), (smb_fname), (access_mask), (share_access), (create_disposition), \
(create_options), (file_attributes), (oplock_request), (allocation_size), (private_flags), (sd), (ea_list), (result), (pinfo))
#define SMB_VFS_CLOSE(fsp) \
smb_vfs_call_close((fsp)->conn->vfs_handles, (fsp))
#define SMB_VFS_NEXT_CLOSE(handle, fsp) \
smb_vfs_call_close((handle)->next, (fsp))
#define SMB_VFS_READ(fsp, data, n) \
smb_vfs_call_read((fsp)->conn->vfs_handles, (fsp), (data), (n))
#define SMB_VFS_NEXT_READ(handle, fsp, data, n) \
smb_vfs_call_read((handle)->next, (fsp), (data), (n))
#define SMB_VFS_PREAD(fsp, data, n, off) \
smb_vfs_call_pread((fsp)->conn->vfs_handles, (fsp), (data), (n), (off))
#define SMB_VFS_NEXT_PREAD(handle, fsp, data, n, off) \
smb_vfs_call_pread((handle)->next, (fsp), (data), (n), (off))
#define SMB_VFS_WRITE(fsp, data, n) \
smb_vfs_call_write((fsp)->conn->vfs_handles, (fsp), (data), (n))
#define SMB_VFS_NEXT_WRITE(handle, fsp, data, n) \
smb_vfs_call_write((handle)->next, (fsp), (data), (n))
#define SMB_VFS_PWRITE(fsp, data, n, off) \
smb_vfs_call_pwrite((fsp)->conn->vfs_handles, (fsp), (data), (n), (off))
#define SMB_VFS_NEXT_PWRITE(handle, fsp, data, n, off) \
smb_vfs_call_pwrite((handle)->next, (fsp), (data), (n), (off))
#define SMB_VFS_LSEEK(fsp, offset, whence) \
smb_vfs_call_lseek((fsp)->conn->vfs_handles, (fsp), (offset), (whence))
#define SMB_VFS_NEXT_LSEEK(handle, fsp, offset, whence) \
smb_vfs_call_lseek((handle)->next, (fsp), (offset), (whence))
#define SMB_VFS_SENDFILE(tofd, fromfsp, header, offset, count) \
smb_vfs_call_sendfile((fromfsp)->conn->vfs_handles, (tofd), (fromfsp), (header), (offset), (count))
#define SMB_VFS_NEXT_SENDFILE(handle, tofd, fromfsp, header, offset, count) \
smb_vfs_call_sendfile((handle)->next, (tofd), (fromfsp), (header), (offset), (count))
#define SMB_VFS_RECVFILE(fromfd, tofsp, offset, count) \
smb_vfs_call_recvfile((tofsp)->conn->vfs_handles, (fromfd), (tofsp), (offset), (count))
#define SMB_VFS_NEXT_RECVFILE(handle, fromfd, tofsp, offset, count) \
smb_vfs_call_recvfile((handle)->next, (fromfd), (tofsp), (offset), (count))
#define SMB_VFS_RENAME(conn, old, new) \
smb_vfs_call_rename((conn)->vfs_handles, (old), (new))
#define SMB_VFS_NEXT_RENAME(handle, old, new) \
smb_vfs_call_rename((handle)->next, (old), (new))
#define SMB_VFS_FSYNC(fsp) \
smb_vfs_call_fsync((fsp)->conn->vfs_handles, (fsp))
#define SMB_VFS_NEXT_FSYNC(handle, fsp) \
smb_vfs_call_fsync((handle)->next, (fsp))
#define SMB_VFS_STAT(conn, smb_fname) \
smb_vfs_call_stat((conn)->vfs_handles, (smb_fname))
#define SMB_VFS_NEXT_STAT(handle, smb_fname) \
smb_vfs_call_stat((handle)->next, (smb_fname))
#define SMB_VFS_FSTAT(fsp, sbuf) \
smb_vfs_call_fstat((fsp)->conn->vfs_handles, (fsp), (sbuf))
#define SMB_VFS_NEXT_FSTAT(handle, fsp, sbuf) \
smb_vfs_call_fstat((handle)->next, (fsp), (sbuf))
#define SMB_VFS_LSTAT(conn, smb_fname) \
smb_vfs_call_lstat((conn)->vfs_handles, (smb_fname))
#define SMB_VFS_NEXT_LSTAT(handle, smb_fname) \
smb_vfs_call_lstat((handle)->next, (smb_fname))
#define SMB_VFS_GET_ALLOC_SIZE(conn, fsp, sbuf) \
smb_vfs_call_get_alloc_size((conn)->vfs_handles, (fsp), (sbuf))
#define SMB_VFS_NEXT_GET_ALLOC_SIZE(conn, fsp, sbuf) \
smb_vfs_call_get_alloc_size((conn)->next, (fsp), (sbuf))
#define SMB_VFS_UNLINK(conn, path) \
smb_vfs_call_unlink((conn)->vfs_handles, (path))
#define SMB_VFS_NEXT_UNLINK(handle, path) \
smb_vfs_call_unlink((handle)->next, (path))
#define SMB_VFS_CHMOD(conn, path, mode) \
smb_vfs_call_chmod((conn)->vfs_handles, (path), (mode))
#define SMB_VFS_NEXT_CHMOD(handle, path, mode) \
smb_vfs_call_chmod((handle)->next, (path), (mode))
#define SMB_VFS_FCHMOD(fsp, mode) \
smb_vfs_call_fchmod((fsp)->conn->vfs_handles, (fsp), (mode))
#define SMB_VFS_NEXT_FCHMOD(handle, fsp, mode) \
smb_vfs_call_fchmod((handle)->next, (fsp), (mode))
#define SMB_VFS_CHOWN(conn, path, uid, gid) \
smb_vfs_call_chown((conn)->vfs_handles, (path), (uid), (gid))
#define SMB_VFS_NEXT_CHOWN(handle, path, uid, gid) \
smb_vfs_call_chown((handle)->next, (path), (uid), (gid))
#define SMB_VFS_FCHOWN(fsp, uid, gid) \
smb_vfs_call_fchown((fsp)->conn->vfs_handles, (fsp), (uid), (gid))
#define SMB_VFS_NEXT_FCHOWN(handle, fsp, uid, gid) \
smb_vfs_call_fchown((handle)->next, (fsp), (uid), (gid))
#define SMB_VFS_LCHOWN(conn, path, uid, gid) \
smb_vfs_call_lchown((conn)->vfs_handles, (path), (uid), (gid))
#define SMB_VFS_NEXT_LCHOWN(handle, path, uid, gid) \
smb_vfs_call_lchown((handle)->next, (path), (uid), (gid))
#define SMB_VFS_CHDIR(conn, path) \
smb_vfs_call_chdir((conn)->vfs_handles, (path))
#define SMB_VFS_NEXT_CHDIR(handle, path) \
smb_vfs_call_chdir((handle)->next, (path))
#define SMB_VFS_GETWD(conn) \
smb_vfs_call_getwd((conn)->vfs_handles)
#define SMB_VFS_NEXT_GETWD(handle) \
smb_vfs_call_getwd((handle)->next)
#define SMB_VFS_NTIMES(conn, path, ts) \
smb_vfs_call_ntimes((conn)->vfs_handles, (path), (ts))
#define SMB_VFS_NEXT_NTIMES(handle, path, ts) \
smb_vfs_call_ntimes((handle)->next, (path), (ts))
#define SMB_VFS_FTRUNCATE(fsp, offset) \
smb_vfs_call_ftruncate((fsp)->conn->vfs_handles, (fsp), (offset))
#define SMB_VFS_NEXT_FTRUNCATE(handle, fsp, offset) \
smb_vfs_call_ftruncate((handle)->next, (fsp), (offset))
#define SMB_VFS_FALLOCATE(fsp, mode, offset, len) \
smb_vfs_call_fallocate((fsp)->conn->vfs_handles, (fsp), (mode), (offset), (len))
#define SMB_VFS_NEXT_FALLOCATE(handle, fsp, mode, offset, len) \
smb_vfs_call_fallocate((handle)->next, (fsp), (mode), (offset), (len))
#define SMB_VFS_LOCK(fsp, op, offset, count, type) \
smb_vfs_call_lock((fsp)->conn->vfs_handles, (fsp), (op), (offset), (count), (type))
#define SMB_VFS_NEXT_LOCK(handle, fsp, op, offset, count, type) \
smb_vfs_call_lock((handle)->next, (fsp), (op), (offset), (count), (type))
#define SMB_VFS_KERNEL_FLOCK(fsp, share_mode, access_mask) \
smb_vfs_call_kernel_flock((fsp)->conn->vfs_handles, (fsp), (share_mode), (access_mask))
#define SMB_VFS_NEXT_KERNEL_FLOCK(handle, fsp, share_mode, access_mask) \
smb_vfs_call_kernel_flock((handle)->next, (fsp), (share_mode), (access_mask))
#define SMB_VFS_LINUX_SETLEASE(fsp, leasetype) \
smb_vfs_call_linux_setlease((fsp)->conn->vfs_handles, (fsp), (leasetype))
#define SMB_VFS_NEXT_LINUX_SETLEASE(handle, fsp, leasetype) \
smb_vfs_call_linux_setlease((handle)->next, (fsp), (leasetype))
#define SMB_VFS_GETLOCK(fsp, poffset, pcount, ptype, ppid) \
smb_vfs_call_getlock((fsp)->conn->vfs_handles, (fsp), (poffset), (pcount), (ptype), (ppid))
#define SMB_VFS_NEXT_GETLOCK(handle, fsp, poffset, pcount, ptype, ppid) \
smb_vfs_call_getlock((handle)->next, (fsp), (poffset), (pcount), (ptype), (ppid))
#define SMB_VFS_SYMLINK(conn, oldpath, newpath) \
smb_vfs_call_symlink((conn)->vfs_handles, (oldpath), (newpath))
#define SMB_VFS_NEXT_SYMLINK(handle, oldpath, newpath) \
smb_vfs_call_symlink((handle)->next, (oldpath), (newpath))
#define SMB_VFS_READLINK(conn, path, buf, bufsiz) \
smb_vfs_call_readlink((conn)->vfs_handles, (path), (buf), (bufsiz))
#define SMB_VFS_NEXT_READLINK(handle, path, buf, bufsiz) \
smb_vfs_call_readlink((handle)->next, (path), (buf), (bufsiz))
#define SMB_VFS_LINK(conn, oldpath, newpath) \
smb_vfs_call_link((conn)->vfs_handles, (oldpath), (newpath))
#define SMB_VFS_NEXT_LINK(handle, oldpath, newpath) \
smb_vfs_call_link((handle)->next, (oldpath), (newpath))
#define SMB_VFS_MKNOD(conn, path, mode, dev) \
smb_vfs_call_mknod((conn)->vfs_handles, (path), (mode), (dev))
#define SMB_VFS_NEXT_MKNOD(handle, path, mode, dev) \
smb_vfs_call_mknod((handle)->next, (path), (mode), (dev))
#define SMB_VFS_REALPATH(conn, path) \
smb_vfs_call_realpath((conn)->vfs_handles, (path))
#define SMB_VFS_NEXT_REALPATH(handle, path) \
smb_vfs_call_realpath((handle)->next, (path))
#define SMB_VFS_NOTIFY_WATCH(conn, ctx, path, filter, subdir_filter, callback, private_data, handle_p) \
smb_vfs_call_notify_watch((conn)->vfs_handles, (ctx), (path), (filter), (subdir_filter), (callback), (private_data), (handle_p))
#define SMB_VFS_NEXT_NOTIFY_WATCH(conn, ctx, path, filter, subdir_filter, callback, private_data, handle_p) \
smb_vfs_call_notify_watch((conn)->next, (ctx), (path), (filter), (subdir_filter), (callback), (private_data), (handle_p))
#define SMB_VFS_CHFLAGS(conn, path, flags) \
smb_vfs_call_chflags((conn)->vfs_handles, (path), (flags))
#define SMB_VFS_NEXT_CHFLAGS(handle, path, flags) \
smb_vfs_call_chflags((handle)->next, (path), (flags))
#define SMB_VFS_FILE_ID_CREATE(conn, sbuf) \
smb_vfs_call_file_id_create((conn)->vfs_handles, (sbuf))
#define SMB_VFS_NEXT_FILE_ID_CREATE(handle, sbuf) \
smb_vfs_call_file_id_create((handle)->next, (sbuf))
#define SMB_VFS_STREAMINFO(conn, fsp, fname, mem_ctx, num_streams, streams) \
smb_vfs_call_streaminfo((conn)->vfs_handles, (fsp), (fname), (mem_ctx), (num_streams), (streams))
#define SMB_VFS_NEXT_STREAMINFO(handle, fsp, fname, mem_ctx, num_streams, streams) \
smb_vfs_call_streaminfo((handle)->next, (fsp), (fname), (mem_ctx), (num_streams), (streams))
#define SMB_VFS_GET_REAL_FILENAME(conn, path, name, mem_ctx, found_name) \
smb_vfs_call_get_real_filename((conn)->vfs_handles, (path), (name), (mem_ctx), (found_name))
#define SMB_VFS_NEXT_GET_REAL_FILENAME(handle, path, name, mem_ctx, found_name) \
smb_vfs_call_get_real_filename((handle)->next, (path), (name), (mem_ctx), (found_name))
#define SMB_VFS_CONNECTPATH(conn, fname) \
smb_vfs_call_connectpath((conn)->vfs_handles, (fname))
#define SMB_VFS_NEXT_CONNECTPATH(conn, fname) \
smb_vfs_call_connectpath((conn)->next, (fname))
#define SMB_VFS_BRL_LOCK_WINDOWS(conn, br_lck, plock, blocking_lock, blr) \
smb_vfs_call_brl_lock_windows((conn)->vfs_handles, (br_lck), (plock), (blocking_lock), (blr))
#define SMB_VFS_NEXT_BRL_LOCK_WINDOWS(handle, br_lck, plock, blocking_lock, blr) \
smb_vfs_call_brl_lock_windows((handle)->next, (br_lck), (plock), (blocking_lock), (blr))
#define SMB_VFS_BRL_UNLOCK_WINDOWS(conn, msg_ctx, br_lck, plock) \
smb_vfs_call_brl_unlock_windows((conn)->vfs_handles, (msg_ctx), (br_lck), (plock))
#define SMB_VFS_NEXT_BRL_UNLOCK_WINDOWS(handle, msg_ctx, br_lck, plock) \
smb_vfs_call_brl_unlock_windows((handle)->next, (msg_ctx), (br_lck), (plock))
#define SMB_VFS_BRL_CANCEL_WINDOWS(conn, br_lck, plock, blr) \
smb_vfs_call_brl_cancel_windows((conn)->vfs_handles, (br_lck), (plock), (blr))
#define SMB_VFS_NEXT_BRL_CANCEL_WINDOWS(handle, br_lck, plock, blr) \
smb_vfs_call_brl_cancel_windows((handle)->next, (br_lck), (plock), (blr))
#define SMB_VFS_STRICT_LOCK(conn, fsp, plock) \
smb_vfs_call_strict_lock((conn)->vfs_handles, (fsp), (plock))
#define SMB_VFS_NEXT_STRICT_LOCK(handle, fsp, plock) \
smb_vfs_call_strict_lock((handle)->next, (fsp), (plock))
#define SMB_VFS_STRICT_UNLOCK(conn, fsp, plock) \
smb_vfs_call_strict_unlock((conn)->vfs_handles, (fsp), (plock))
#define SMB_VFS_NEXT_STRICT_UNLOCK(handle, fsp, plock) \
smb_vfs_call_strict_unlock((handle)->next, (fsp), (plock))
#define SMB_VFS_TRANSLATE_NAME(conn, name, direction, mem_ctx, mapped_name) \
smb_vfs_call_translate_name((conn)->vfs_handles, (name), (direction), (mem_ctx), (mapped_name))
#define SMB_VFS_NEXT_TRANSLATE_NAME(handle, name, direction, mem_ctx, mapped_name) \
smb_vfs_call_translate_name((handle)->next, (name), (direction), (mem_ctx), (mapped_name))
#define SMB_VFS_FSCTL(fsp, ctx, function, req_flags, in_data, in_len, out_data, max_out_len, out_len) \
smb_vfs_call_fsctl((fsp)->conn->vfs_handles, (fsp), (ctx), (function), (req_flags), (in_data), (in_len), (out_data), (max_out_len), (out_len))
#define SMB_VFS_NEXT_FSCTL(handle, fsp, ctx, function, req_flags, in_data, in_len, out_data, max_out_len, out_len) \
smb_vfs_call_fsctl((handle)->next, (fsp), (ctx), (function), (req_flags), (in_data), (in_len), (out_data), (max_out_len), (out_len))
#define SMB_VFS_FGET_NT_ACL(fsp, security_info, ppdesc) \
smb_vfs_call_fget_nt_acl((fsp)->conn->vfs_handles, (fsp), (security_info), (ppdesc))
#define SMB_VFS_NEXT_FGET_NT_ACL(handle, fsp, security_info, ppdesc) \
smb_vfs_call_fget_nt_acl((handle)->next, (fsp), (security_info), (ppdesc))
#define SMB_VFS_GET_NT_ACL(conn, name, security_info, ppdesc) \
smb_vfs_call_get_nt_acl((conn)->vfs_handles, (name), (security_info), (ppdesc))
#define SMB_VFS_NEXT_GET_NT_ACL(handle, name, security_info, ppdesc) \
smb_vfs_call_get_nt_acl((handle)->next, (name), (security_info), (ppdesc))
#define SMB_VFS_FSET_NT_ACL(fsp, security_info_sent, psd) \
smb_vfs_call_fset_nt_acl((fsp)->conn->vfs_handles, (fsp), (security_info_sent), (psd))
#define SMB_VFS_NEXT_FSET_NT_ACL(handle, fsp, security_info_sent, psd) \
smb_vfs_call_fset_nt_acl((handle)->next, (fsp), (security_info_sent), (psd))
#define SMB_VFS_CHMOD_ACL(conn, name, mode) \
smb_vfs_call_chmod_acl((conn)->vfs_handles, (name), (mode))
#define SMB_VFS_NEXT_CHMOD_ACL(handle, name, mode) \
smb_vfs_call_chmod_acl((handle)->next, (name), (mode))
#define SMB_VFS_FCHMOD_ACL(fsp, mode) \
smb_vfs_call_fchmod_acl((fsp)->conn->vfs_handles, (fsp), (mode))
#define SMB_VFS_NEXT_FCHMOD_ACL(handle, fsp, mode) \
smb_vfs_call_fchmod_acl((handle)->next, (fsp), (mode))
#define SMB_VFS_SYS_ACL_GET_ENTRY(conn, theacl, entry_id, entry_p) \
smb_vfs_call_sys_acl_get_entry((conn)->vfs_handles, (theacl), (entry_id), (entry_p))
#define SMB_VFS_NEXT_SYS_ACL_GET_ENTRY(handle, theacl, entry_id, entry_p) \
smb_vfs_call_sys_acl_get_entry((handle)->next, (theacl), (entry_id), (entry_p))
#define SMB_VFS_SYS_ACL_GET_TAG_TYPE(conn, entry_d, tag_type_p) \
smb_vfs_call_sys_acl_get_tag_type((conn)->vfs_handles, (entry_d), (tag_type_p))
#define SMB_VFS_NEXT_SYS_ACL_GET_TAG_TYPE(handle, entry_d, tag_type_p) \
smb_vfs_call_sys_acl_get_tag_type((handle)->next, (entry_d), (tag_type_p))
#define SMB_VFS_SYS_ACL_GET_PERMSET(conn, entry_d, permset_p) \
smb_vfs_call_sys_acl_get_permset((conn)->vfs_handles, (entry_d), (permset_p))
#define SMB_VFS_NEXT_SYS_ACL_GET_PERMSET(handle, entry_d, permset_p) \
smb_vfs_call_sys_acl_get_permset((handle)->next, (entry_d), (permset_p))
#define SMB_VFS_SYS_ACL_GET_QUALIFIER(conn, entry_d) \
smb_vfs_call_sys_acl_get_qualifier((conn)->vfs_handles, (entry_d))
#define SMB_VFS_NEXT_SYS_ACL_GET_QUALIFIER(handle, entry_d) \
smb_vfs_call_sys_acl_get_qualifier((handle)->next, (entry_d))
#define SMB_VFS_SYS_ACL_GET_FILE(conn, path_p, type) \
smb_vfs_call_sys_acl_get_file((conn)->vfs_handles, (path_p), (type))
#define SMB_VFS_NEXT_SYS_ACL_GET_FILE(handle, path_p, type) \
smb_vfs_call_sys_acl_get_file((handle)->next, (path_p), (type))
#define SMB_VFS_SYS_ACL_GET_FD(fsp) \
smb_vfs_call_sys_acl_get_fd((fsp)->conn->vfs_handles, (fsp))
#define SMB_VFS_NEXT_SYS_ACL_GET_FD(handle, fsp) \
smb_vfs_call_sys_acl_get_fd((handle)->next, (fsp))
#define SMB_VFS_SYS_ACL_CLEAR_PERMS(conn, permset) \
smb_vfs_call_sys_acl_clear_perms((conn)->vfs_handles, (permset))
#define SMB_VFS_NEXT_SYS_ACL_CLEAR_PERMS(handle, permset) \
smb_vfs_call_sys_acl_clear_perms((handle)->next, (permset))
#define SMB_VFS_SYS_ACL_ADD_PERM(conn, permset, perm) \
smb_vfs_call_sys_acl_add_perm((conn)->vfs_handles, (permset), (perm))
#define SMB_VFS_NEXT_SYS_ACL_ADD_PERM(handle, permset, perm) \
smb_vfs_call_sys_acl_add_perm((handle)->next, (permset), (perm))
#define SMB_VFS_SYS_ACL_TO_TEXT(conn, theacl, plen) \
smb_vfs_call_sys_acl_to_text((conn)->vfs_handles, (theacl), (plen))
#define SMB_VFS_NEXT_SYS_ACL_TO_TEXT(handle, theacl, plen) \
smb_vfs_call_sys_acl_to_text((handle)->next, (theacl), (plen))
#define SMB_VFS_SYS_ACL_INIT(conn, count) \
smb_vfs_call_sys_acl_init((conn)->vfs_handles, (count))
#define SMB_VFS_NEXT_SYS_ACL_INIT(handle, count) \
smb_vfs_call_sys_acl_init((handle)->next, (count))
#define SMB_VFS_SYS_ACL_CREATE_ENTRY(conn, pacl, pentry) \
smb_vfs_call_sys_acl_create_entry((conn)->vfs_handles, (pacl), (pentry))
#define SMB_VFS_NEXT_SYS_ACL_CREATE_ENTRY(handle, pacl, pentry) \
smb_vfs_call_sys_acl_create_entry((handle)->next, (pacl), (pentry))
#define SMB_VFS_SYS_ACL_SET_TAG_TYPE(conn, entry, tagtype) \
smb_vfs_call_sys_acl_set_tag_type((conn)->vfs_handles, (entry), (tagtype))
#define SMB_VFS_NEXT_SYS_ACL_SET_TAG_TYPE(handle, entry, tagtype) \
smb_vfs_call_sys_acl_set_tag_type((handle)->next, (entry), (tagtype))
#define SMB_VFS_SYS_ACL_SET_QUALIFIER(conn, entry, qual) \
smb_vfs_call_sys_acl_set_qualifier((conn)->vfs_handles, (entry), (qual))
#define SMB_VFS_NEXT_SYS_ACL_SET_QUALIFIER(handle, entry, qual) \
smb_vfs_call_sys_acl_set_qualifier((handle)->next, (entry), (qual))
#define SMB_VFS_SYS_ACL_SET_PERMSET(conn, entry, permset) \
smb_vfs_call_sys_acl_set_permset((conn)->vfs_handles, (entry), (permset))
#define SMB_VFS_NEXT_SYS_ACL_SET_PERMSET(handle, entry, permset) \
smb_vfs_call_sys_acl_set_permset((handle)->next, (entry), (permset))
#define SMB_VFS_SYS_ACL_VALID(conn, theacl) \
smb_vfs_call_sys_acl_valid((conn)->vfs_handles, (theacl))
#define SMB_VFS_NEXT_SYS_ACL_VALID(handle, theacl) \
smb_vfs_call_sys_acl_valid((handle)->next, (theacl))
#define SMB_VFS_SYS_ACL_SET_FILE(conn, name, acltype, theacl) \
smb_vfs_call_sys_acl_set_file((conn)->vfs_handles, (name), (acltype), (theacl))
#define SMB_VFS_NEXT_SYS_ACL_SET_FILE(handle, name, acltype, theacl) \
smb_vfs_call_sys_acl_set_file((handle)->next, (name), (acltype), (theacl))
#define SMB_VFS_SYS_ACL_SET_FD(fsp, theacl) \
smb_vfs_call_sys_acl_set_fd((fsp)->conn->vfs_handles, (fsp), (theacl))
#define SMB_VFS_NEXT_SYS_ACL_SET_FD(handle, fsp, theacl) \
smb_vfs_call_sys_acl_set_fd((handle)->next, (fsp), (theacl))
#define SMB_VFS_SYS_ACL_DELETE_DEF_FILE(conn, path) \
smb_vfs_call_sys_acl_delete_def_file((conn)->vfs_handles, (path))
#define SMB_VFS_NEXT_SYS_ACL_DELETE_DEF_FILE(handle, path) \
smb_vfs_call_sys_acl_delete_def_file((handle)->next, (path))
#define SMB_VFS_SYS_ACL_GET_PERM(conn, permset, perm) \
smb_vfs_call_sys_acl_get_perm((conn)->vfs_handles, (permset), (perm))
#define SMB_VFS_NEXT_SYS_ACL_GET_PERM(handle, permset, perm) \
smb_vfs_call_sys_acl_get_perm((handle)->next, (permset), (perm))
#define SMB_VFS_SYS_ACL_FREE_TEXT(conn, text) \
smb_vfs_call_sys_acl_free_text((conn)->vfs_handles, (text))
#define SMB_VFS_NEXT_SYS_ACL_FREE_TEXT(handle, text) \
smb_vfs_call_sys_acl_free_text((handle)->next, (text))
#define SMB_VFS_SYS_ACL_FREE_ACL(conn, posix_acl) \
smb_vfs_call_sys_acl_free_acl((conn)->vfs_handles, (posix_acl))
#define SMB_VFS_NEXT_SYS_ACL_FREE_ACL(handle, posix_acl) \
smb_vfs_call_sys_acl_free_acl((handle)->next, (posix_acl))
#define SMB_VFS_SYS_ACL_FREE_QUALIFIER(conn, qualifier, tagtype) \
smb_vfs_call_sys_acl_free_qualifier((conn)->vfs_handles, (qualifier), (tagtype))
#define SMB_VFS_NEXT_SYS_ACL_FREE_QUALIFIER(handle, qualifier, tagtype) \
smb_vfs_call_sys_acl_free_qualifier((handle)->next, (qualifier), (tagtype))
#define SMB_VFS_GETXATTR(conn,path,name,value,size) \
smb_vfs_call_getxattr((conn)->vfs_handles,(path),(name),(value),(size))
#define SMB_VFS_NEXT_GETXATTR(handle,path,name,value,size) \
smb_vfs_call_getxattr((handle)->next,(path),(name),(value),(size))
#define SMB_VFS_FGETXATTR(fsp,name,value,size) \
smb_vfs_call_fgetxattr((fsp)->conn->vfs_handles, (fsp), (name),(value),(size))
#define SMB_VFS_NEXT_FGETXATTR(handle,fsp,name,value,size) \
smb_vfs_call_fgetxattr((handle)->next,(fsp),(name),(value),(size))
#define SMB_VFS_LISTXATTR(conn,path,list,size) \
smb_vfs_call_listxattr((conn)->vfs_handles,(path),(list),(size))
#define SMB_VFS_NEXT_LISTXATTR(handle,path,list,size) \
smb_vfs_call_listxattr((handle)->next,(path),(list),(size))
#define SMB_VFS_FLISTXATTR(fsp,list,size) \
smb_vfs_call_flistxattr((fsp)->conn->vfs_handles, (fsp), (list),(size))
#define SMB_VFS_NEXT_FLISTXATTR(handle,fsp,list,size) \
smb_vfs_call_flistxattr((handle)->next,(fsp),(list),(size))
#define SMB_VFS_REMOVEXATTR(conn,path,name) \
smb_vfs_call_removexattr((conn)->vfs_handles,(path),(name))
#define SMB_VFS_NEXT_REMOVEXATTR(handle,path,name) \
smb_vfs_call_removexattr((handle)->next,(path),(name))
#define SMB_VFS_FREMOVEXATTR(fsp,name) \
smb_vfs_call_fremovexattr((fsp)->conn->vfs_handles, (fsp), (name))
#define SMB_VFS_NEXT_FREMOVEXATTR(handle,fsp,name) \
smb_vfs_call_fremovexattr((handle)->next,(fsp),(name))
#define SMB_VFS_SETXATTR(conn,path,name,value,size,flags) \
smb_vfs_call_setxattr((conn)->vfs_handles,(path),(name),(value),(size),(flags))
#define SMB_VFS_NEXT_SETXATTR(handle,path,name,value,size,flags) \
smb_vfs_call_setxattr((handle)->next,(path),(name),(value),(size),(flags))
#define SMB_VFS_FSETXATTR(fsp,name,value,size,flags) \
smb_vfs_call_fsetxattr((fsp)->conn->vfs_handles, (fsp), (name),(value),(size),(flags))
#define SMB_VFS_NEXT_FSETXATTR(handle,fsp,name,value,size,flags) \
smb_vfs_call_fsetxattr((handle)->next,(fsp),(name),(value),(size),(flags))
#define SMB_VFS_AIO_READ(fsp,aiocb) \
smb_vfs_call_aio_read((fsp)->conn->vfs_handles, (fsp), (aiocb))
#define SMB_VFS_NEXT_AIO_READ(handle,fsp,aiocb) \
smb_vfs_call_aio_read((handle)->next,(fsp),(aiocb))
#define SMB_VFS_AIO_WRITE(fsp,aiocb) \
smb_vfs_call_aio_write((fsp)->conn->vfs_handles, (fsp), (aiocb))
#define SMB_VFS_NEXT_AIO_WRITE(handle,fsp,aiocb) \
smb_vfs_call_aio_write((handle)->next,(fsp),(aiocb))
#define SMB_VFS_AIO_RETURN(fsp,aiocb) \
smb_vfs_call_aio_return((fsp)->conn->vfs_handles, (fsp), (aiocb))
#define SMB_VFS_NEXT_AIO_RETURN(handle,fsp,aiocb) \
smb_vfs_call_aio_return((handle)->next,(fsp),(aiocb))
#define SMB_VFS_AIO_CANCEL(fsp,aiocb) \
smb_vfs_call_aio_cancel((fsp)->conn->vfs_handles, (fsp), (aiocb))
#define SMB_VFS_NEXT_AIO_CANCEL(handle,fsp,aiocb) \
smb_vfs_call_aio_cancel((handle)->next,(fsp),(aiocb))
#define SMB_VFS_AIO_ERROR(fsp,aiocb) \
smb_vfs_call_aio_error((fsp)->conn->vfs_handles, (fsp),(aiocb))
#define SMB_VFS_NEXT_AIO_ERROR(handle,fsp,aiocb) \
smb_vfs_call_aio_error((handle)->next,(fsp),(aiocb))
#define SMB_VFS_AIO_FSYNC(fsp,op,aiocb) \
smb_vfs_call_aio_fsync((fsp)->conn->vfs_handles, (fsp), (op),(aiocb))
#define SMB_VFS_NEXT_AIO_FSYNC(handle,fsp,op,aiocb) \
smb_vfs_call_aio_fsync((handle)->next,(fsp),(op),(aiocb))
#define SMB_VFS_AIO_SUSPEND(fsp,aiocb,n,ts) \
smb_vfs_call_aio_suspend((fsp)->conn->vfs_handles, (fsp),(aiocb),(n),(ts))
#define SMB_VFS_NEXT_AIO_SUSPEND(handle,fsp,aiocb,n,ts) \
smb_vfs_call_aio_suspend((handle)->next,(fsp),(aiocb),(n),(ts))
#define SMB_VFS_AIO_FORCE(fsp) \
smb_vfs_call_aio_force((fsp)->conn->vfs_handles, (fsp))
#define SMB_VFS_NEXT_AIO_FORCE(handle,fsp) \
smb_vfs_call_aio_force((handle)->next,(fsp))
#define SMB_VFS_IS_OFFLINE(conn,fname,sbuf) \
smb_vfs_call_is_offline((conn)->vfs_handles,(fname),(sbuf))
#define SMB_VFS_NEXT_IS_OFFLINE(handle,fname,sbuf) \
smb_vfs_call_is_offline((handle)->next,(fname),(sbuf))
#define SMB_VFS_SET_OFFLINE(conn,fname) \
smb_vfs_call_set_offline((conn)->vfs_handles,(fname))
#define SMB_VFS_NEXT_SET_OFFLINE(handle,fname) \
smb_vfs_call_set_offline((handle)->next, (fname))
#endif /* _VFS_MACROS_H */
| amitay/samba | source3/include/vfs_macros.h | C | gpl-3.0 | 29,525 |
package com.example.jyheo.threadex;
import org.junit.Test;
import static org.junit.Assert.*;
/**
* Example local unit test, which will execute on the development machine (host).
*
* @see <a href="http://d.android.com/tools/testing">Testing documentation</a>
*/
public class ExampleUnitTest {
@Test
public void addition_isCorrect() throws Exception {
assertEquals(4, 2 + 2);
}
} | jyheo/AndroidTutorial | ThreadEx/app/src/test/java/com/example/jyheo/threadex/ExampleUnitTest.java | Java | gpl-3.0 | 404 |
/**
* [remove: removes an object from the DOM tree]
*/
Element.prototype.remove = function () {
this.parentNode.removeChild(this)
}
/**
* [remove: removes a series of objects from the DOM tree]
*/
NodeList.prototype.remove = HTMLCollection.prototype.remove = function () {
for (var i = this.length - 1; i >= 0; i--) {
if (this[i] && this[i].parentNode) {
this[i].parentNode.removeChild(this[i])
}
}
}
document.querySelectorAll('h1').remove()
// This can't be done quicker.. write a function DRY
let instruction = document.createTextNode('Toss the images around; if you see one you like, click on it!')
let header = document.createElement('h2')
header.appendChild(instruction)
let listItem = document.createElement('li')
listItem.appendChild(header)
document.querySelector('main section ul').appendChild(listItem)
// Hook the drag functions on the li elements
document.querySelectorAll('main section li').forEach(function (image) {
image.addEventListener('dragstart', function (event) {
console.log('start dragging..') // Closure!
})
image.addEventListener('dragend', function (event) {
console.log('stop dragging..') // Closure!
})
})
// TODO: functionality to move the dragged item to the new location when dragged
// Stop the default action when clicking a link
document.querySelectorAll('main section li a').forEach(function (link) {
link.addEventListener('click', function (event) {
event.preventDefault()
})
})
// Randomly place all images
document.querySelectorAll('main section li').forEach(function (image) {
let left = (window.innerWidth / 2 - image.offsetWidth / 2)
let top = (window.innerHeight / 2 - image.offsetHeight / 2)
image.style.position = 'absolute'
image.style.left = left + (-200 + Math.random() * 400) + 'px'
image.style.top = top + (-200 + Math.random() * 400) + 'px'
})
| CMDA/Frontend-2 | example/week4/main.js | JavaScript | gpl-3.0 | 1,862 |
/*
* Kendo UI Web v2013.1.319 (http://kendoui.com)
* Copyright 2013 Telerik AD. All rights reserved.
*
* Kendo UI Web commercial licenses may be obtained at
* https://www.kendoui.com/purchase/license-agreement/kendo-ui-web-commercial.aspx
* If you do not own a commercial license, this file shall be governed by the
* GNU General Public License (GPL) version 3.
* For GPL requirements, please review: http://www.gnu.org/copyleft/gpl.html
*/
(function( window, undefined ) {
kendo.cultures["yo-NG"] = {
name: "yo-NG",
numberFormat: {
pattern: ["-n"],
decimals: 2,
",": ",",
".": ".",
groupSize: [3],
percent: {
pattern: ["-n %","n %"],
decimals: 2,
",": ",",
".": ".",
groupSize: [3],
symbol: "%"
},
currency: {
pattern: ["$-n","$ n"],
decimals: 2,
",": ",",
".": ".",
groupSize: [3],
symbol: "N"
}
},
calendars: {
standard: {
days: {
names: ["Aiku","Aje","Isegun","Ojo\u0027ru","Ojo\u0027bo","Eti","Abameta"],
namesAbbr: ["Aik","Aje","Ise","Ojo","Ojo","Eti","Aba"],
namesShort: ["A","A","I","O","O","E","A"]
},
months: {
names: ["Osu kinni","Osu keji","Osu keta","Osu kerin","Osu karun","Osu kefa","Osu keje","Osu kejo","Osu kesan","Osu kewa","Osu kokanla","Osu keresi",""],
namesAbbr: ["kin.","kej.","ket.","ker.","kar.","kef.","kej.","kej.","kes.","kew.","kok.","ker.",""]
},
AM: ["Owuro","owuro","OWURO"],
PM: ["Ale","ale","ALE"],
patterns: {
d: "d/M/yyyy",
D: "dddd, MMMM dd, yyyy",
F: "dddd, MMMM dd, yyyy h:mm:ss tt",
g: "d/M/yyyy h:mm tt",
G: "d/M/yyyy h:mm:ss tt",
m: "MMMM dd",
M: "MMMM dd",
s: "yyyy'-'MM'-'dd'T'HH':'mm':'ss",
t: "h:mm tt",
T: "h:mm:ss tt",
u: "yyyy'-'MM'-'dd HH':'mm':'ss'Z'",
y: "MMMM, yyyy",
Y: "MMMM, yyyy"
},
"/": "/",
":": ":",
firstDay: 0
}
}
}
})(this);
| tatamizzz/kendoui.ext | src/js/cultures/kendo.culture.yo-NG.js | JavaScript | gpl-3.0 | 2,671 |
import { Component, EventEmitter, Input, OnInit, Output } from '@angular/core';
import { Side } from '../common/side';
@Component({
selector: 'ls-button',
template: `
<button
[attr.type]="type"
[class]="class"
[style]="style"
[disabled]="disabled"
(click)="onClick.emit($event)"
(focus)="onFocus.emit($event)"
(blur)="onBlur.emit($event)"
[ngClass]="{'ls-button ls-corner-all': true}">
<span
[ngClass]="{'ls-icon-right': (iconPos === 'right'),
'ls-icon-left': (iconPos === 'left')}"
[class]="icon">
</span>
<span>
{{label}}
</span>
</button>`,
styleUrls: ['./button.component.css']
})
export class ButtonComponent implements OnInit {
@Input() icon: string;
@Input() iconPos: Side = 'right';
@Input() disabled: boolean;
@Input() label: string;
@Input() class: string;
@Input() style: string;
@Input() type: string;
@Output() onClick: EventEmitter<any> = new EventEmitter();
@Output() onFocus: EventEmitter<any> = new EventEmitter();
@Output() onBlur: EventEmitter<any> = new EventEmitter();
constructor() {
}
ngOnInit() {
}
}
| Lusey77/finance-app-ui | src/app/button/button.component.ts | TypeScript | gpl-3.0 | 1,190 |
<!DOCTYPE html>
<!--[if IE 8]> <html class="no-js lt-ie9" lang="en" > <![endif]-->
<!--[if gt IE 8]><!--> <html class="no-js" lang="en" > <!--<![endif]-->
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta name="viewport" content="width=device-width">
<title>Acidentes em Rodovias</title>
<link rel="stylesheet" href="{{ STATIC_URL }}css/foundation.css">
<link rel="shortcut icon" href="{{ STATIC_URL }}img/Ar-icon.png" type="image/x-icon" />
<script src="{{ STATIC_URL }}js/vendor/custom.modernizr.js"></script>
<script src="{{ STATIC_URL }}js/vendor/jquery.js"></script>
<script src="{{ STATIC_URL }}js/foundation.min.js"></script>
<script src="{{ STATIC_URL }}js/highcharts.js"></script>
<script src="{{ STATIC_URL }}js/highcharts-more.js"></script>
<script src="{{ STATIC_URL }}js/modules/exporting.js"></script>
<script src="{{ STATIC_URL }}js/canvg/canvg.js"></script>
<script src="{{ STATIC_URL }}js/canvg/rgbcolor.js"></script>
<script src="http://maps.googleapis.com/maps/api/js?key=AIzaSyA6rh80aw6WdC6luxy00sJD05g5rOSS9Ek&sensor=false"></script>
<script src="{{ STATIC_URL }}js/gmap3.js"></script>
<script type="text/javascript">
(function (H) {
H.Chart.prototype.createCanvas = function (divId) {
var svg = this.getSVG(),
width = parseInt(svg.match(/width="([0-9]+)"/)[1]),
height = parseInt(svg.match(/height="([0-9]+)"/)[1]),
canvas = document.createElement('canvas');
canvas.setAttribute('width', width);
canvas.setAttribute('height', height);
if (canvas.getContext && canvas.getContext('2d')) {
canvg(canvas, svg);
var image = canvas.toDataURL("image/png")
.replace("image/png", "image/octet-stream");
// Save locally
window.location.href = image;
} else {
alert ("Your browser doesn't support this feature, please use a modern browser");
}
}
}(Highcharts));
</script>
</head>
<body>
<div class="fixed">
<nav class="top-bar fixed">
<ul class="title-area">
<li class="name">
<h1><a href="{% url 'app.controller.index_controller.index' %}">Acidentes em Rodovias</a></h1>
</li>
<li class="toggle-topbar menu-icon"><a href="#"><span>Menu</span></a>
</li>
</ul>
<section class="top-bar-section">
<ul class="left">
<li class="divider"></li>
<li class="has-dropdown"><a href="#">Consulta</a>
<ul class="dropdown">
<li><label>Selecione o tipo de consulta</label></li>
<li><a href="{% url 'app.controller.consultabasica_regiao_controller.consulta_por_regiao' %}">Região</a></li>
<li class="divider"></li>
<li><a href="{% url 'app.controller.consultabasica_periodo_controller.consulta_por_periodo' %}">Período</a></li>
</ul>
</li>
<li class="divider"></li>
<li class="has-dropdown"><a href="#">Estatísticas</a>
<ul class="dropdown">
<li><label>Selecione o tipo de estatística</label></li>
<li><a href="{% url 'app.controller.estatisticas_tipos_controller.tipos_acidentes' %}">Tipos de acidentes</a></li>
<li class="divider"></li>
<li><a href="{% url 'app.controller.estatisticas_causas_controller.causas_acidentes' %}">Causas de acidentes</a></li>
<li class="divider"></li>
<li><a href="{% url 'app.controller.estatisticas_envolvidos_controller.ocorrencias_e_envolvidos' %}">Número de ocorrências/envolvidos</a></li>
<li class="divider"></li>
<li><a href="{% url 'app.controller.estatisticas_envolvidos_controller.acidentes_sexo' %}">Homens/Mulheres envolvidos</a></li>
<li class="divider"></li>
<li><a href="{% url 'app.controller.estatisticas_br_controller.acidentes_br' %}">Acidentes por BR</a></li>
<li class="divider"></li>
<li><a href="{% url 'app.controller.estatisticas_uf_controller.acidentes_uf' %}">Acidentes por UF</a></li>
</ul>
</li>
</section>
</nav>
</div> | matheus-fonseca/acidentes-em-rodovias | acidentes_em_rodovias/app/views/header.html | HTML | gpl-3.0 | 4,756 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (version 1.7.0_25) on Wed Apr 30 15:42:11 EDT 2014 -->
<title>D-Index</title>
<meta name="date" content="2014-04-30">
<link rel="stylesheet" type="text/css" href="../stylesheet.css" title="Style">
</head>
<body>
<script type="text/javascript"><!--
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="D-Index";
}
//-->
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar_top">
<!-- -->
</a><a href="#skip-navbar_top" title="Skip navigation links"></a><a name="navbar_top_firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../overview-summary.html">Overview</a></li>
<li>Package</li>
<li>Class</li>
<li><a href="../overview-tree.html">Tree</a></li>
<li><a href="../deprecated-list.html">Deprecated</a></li>
<li class="navBarCell1Rev">Index</li>
<li><a href="../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="index-3.html">Prev Letter</a></li>
<li><a href="index-5.html">Next Letter</a></li>
</ul>
<ul class="navList">
<li><a href="../index.html?index-filesindex-4.html" target="_top">Frames</a></li>
<li><a href="index-4.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<a name="skip-navbar_top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<div class="contentContainer"><a href="index-1.html">A</a> <a href="index-2.html">B</a> <a href="index-3.html">C</a> <a href="index-4.html">D</a> <a href="index-5.html">E</a> <a href="index-6.html">F</a> <a href="index-7.html">G</a> <a href="index-8.html">H</a> <a href="index-9.html">I</a> <a href="index-10.html">L</a> <a href="index-11.html">M</a> <a href="index-12.html">N</a> <a href="index-13.html">O</a> <a href="index-14.html">P</a> <a href="index-15.html">R</a> <a href="index-16.html">S</a> <a href="index-17.html">T</a> <a href="index-18.html">U</a> <a href="index-19.html">V</a> <a href="index-20.html">W</a> <a href="index-21.html">X</a> <a href="index-22.html">Y</a> <a href="index-23.html">Z</a> <a name="_D_">
<!-- -->
</a>
<h2 class="title">D</h2>
<dl>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken.html#dataLiteral">dataLiteral</a></span> - Variable in class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken</a></dt>
<dd>
<div class="block">The value of the data literal.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#defaultForward">defaultForward</a></span> - Static variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">default forward vector</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#defaultLeft">defaultLeft</a></span> - Static variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">default left vector</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#defaultLocation">defaultLocation</a></span> - Static variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">default location vector</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#defaultRight">defaultRight</a></span> - Static variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">default right vector</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#defaultRotation">defaultRotation</a></span> - Static variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">default rotation vector</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#defaultScale">defaultScale</a></span> - Static variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">default scale vector</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#defaultTranslation">defaultTranslation</a></span> - Static variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">default translation vector</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#defaultUp">defaultUp</a></span> - Static variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">default up vector</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/command/Command.html#description">description</a></span> - Variable in class com.rayburn.engine.dew.command.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/command/Command.html" title="class in com.rayburn.engine.dew.command">Command</a></dt>
<dd>
<div class="block">The description contains information and usage for the command.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.html#DewInterpreter()">DewInterpreter()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewException</span></a> - Exception in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">Generic exception class for the lang interpreter.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html#DewInterpreter.DewException()">DewInterpreter.DewException()</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewException</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html#DewInterpreter.DewException(java.lang.String)">DewInterpreter.DewException(String)</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewException</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html#DewInterpreter.DewException(java.lang.Throwable)">DewInterpreter.DewException(Throwable)</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewException</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html#DewInterpreter.DewException(java.lang.String, java.lang.Throwable)">DewInterpreter.DewException(String, Throwable)</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewException</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.html#DewInterpreter.DewLexer()">DewInterpreter.DewLexer()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer</a></dt>
<dd>
<div class="block">Private void constructor prevents the initialization of more than one instance of the lexer.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class acts an internal container class for all Token classes critical to the lexical analysis process.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.html#DewInterpreter.DewLexer.LexicalTokens()">DewInterpreter.DewLexer.LexicalTokens()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens</a></dt>
<dd>
<div class="block">Do not initialize this class.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents a boolean literal.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.html#DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken(int, int, long, com.rayburn.engine.dew.lang.DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue)">DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken(int, int, long, DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue.html" title="enum in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue</span></a> - Enum in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">Boolean literal values</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue.html#DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue()">DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue()</a></span> - Constructor for enum com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue.html" title="enum in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.BooleanValueLiteralToken.BoolValue</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents a generic literal.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken.html#DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken(int, int, long, java.lang.String)">DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken(int, int, long, String)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.DataLiteralToken</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionLiteral.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionLiteral</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class holds the literal asserted by the asstertion token.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionLiteral.html#DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionLiteral(int, int, long, java.lang.String)">DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionLiteral(int, int, long, String)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionLiteral.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionLiteral</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents an interpreter assertion token.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionToken.html#DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionToken(int, int, long)">DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionToken(int, int, long)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.InterpreterAssertionToken</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.LexicalToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.LexicalToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This is the generic super-class of all lexical tokens.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.LexicalToken.html#DewInterpreter.DewLexer.LexicalTokens.LexicalToken(int, int, long)">DewInterpreter.DewLexer.LexicalTokens.LexicalToken(int, int, long)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.LexicalToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.LexicalToken</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents a directive to a resource.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.html#DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken(int, int, long, com.rayburn.engine.dew.lang.DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm)">DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken(int, int, long, DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken</a></dt>
<dd>
<div class="block">Default-Constructor</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm.html" title="enum in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm</span></a> - Enum in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">The types of resource paradigms.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm.html#DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm()">DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm()</a></span> - Constructor for enum com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm.html" title="enum in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.ResourceCallToken.ResourceParadigm</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceHierarchyIdentifier.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.ResourceHierarchyIdentifier</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents an period indicating a hierarchical relationship between two potential elements in
the object-property tree.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceHierarchyIdentifier.html#DewInterpreter.DewLexer.LexicalTokens.ResourceHierarchyIdentifier(int, int, long)">DewInterpreter.DewLexer.LexicalTokens.ResourceHierarchyIdentifier(int, int, long)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceHierarchyIdentifier.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.ResourceHierarchyIdentifier</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents an operation performed on a resource.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.html#DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken(int, int, long, com.rayburn.engine.dew.lang.DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation)">DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken(int, int, long, DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation.html" title="enum in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation</span></a> - Enum in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">The types of operations that can be performed on a resource.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation.html#DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation()">DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation()</a></span> - Constructor for enum com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation.html" title="enum in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.ResourceOperationToken.ResourceOperation</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourcePointerToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.ResourcePointerToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents the location of a resource in the object-property tree.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourcePointerToken.html#DewInterpreter.DewLexer.LexicalTokens.ResourcePointerToken(int, int, long, java.lang.String)">DewInterpreter.DewLexer.LexicalTokens.ResourcePointerToken(int, int, long, String)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.ResourcePointerToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.ResourcePointerToken</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.SyntaticToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents any syntactic symbol found during lexical analysis.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.html#DewInterpreter.DewLexer.LexicalTokens.SyntaticToken(int, int, long, com.rayburn.engine.dew.lang.DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement)">DewInterpreter.DewLexer.LexicalTokens.SyntaticToken(int, int, long, DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.SyntaticToken</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement.html" title="enum in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement</span></a> - Enum in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">The list of syntactic elements this class can represent.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement.html#DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement()">DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement()</a></span> - Constructor for enum com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement.html" title="enum in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.SyntaticToken.SyntaxElement</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents the declaration of a variable.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.html#DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken(int, int, long, com.rayburn.engine.dew.lang.DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType)">DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken(int, int, long, DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType.html" title="enum in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType</span></a> - Enum in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">The types of variable supported.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType.html#DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType()">DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType()</a></span> - Constructor for enum com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType.html" title="enum in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.VariableDeclarationToken.VariableType</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableNameToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLexer.LexicalTokens.VariableNameToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents the name a variable associated with its declaration.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableNameToken.html#DewInterpreter.DewLexer.LexicalTokens.VariableNameToken(int, int, long, java.lang.String)">DewInterpreter.DewLexer.LexicalTokens.VariableNameToken(int, int, long, String)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLexer.LexicalTokens.VariableNameToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLexer.LexicalTokens.VariableNameToken</a></dt>
<dd>
<div class="block">Default constructor</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLogicalOperatorFunctionSet.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewLogicalOperatorFunctionSet</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLogicalOperatorFunctionSet.html#DewInterpreter.DewLogicalOperatorFunctionSet()">DewInterpreter.DewLogicalOperatorFunctionSet()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewLogicalOperatorFunctionSet.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewLogicalOperatorFunctionSet</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewMathFunctionSet.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewMathFunctionSet</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class contains the interpreters functions for math operations.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewMathFunctionSet.html#DewInterpreter.DewMathFunctionSet()">DewInterpreter.DewMathFunctionSet()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewMathFunctionSet.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewMathFunctionSet</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParseException.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParseException</span></a> - Exception in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParseException.html#DewInterpreter.DewParseException(java.lang.String)">DewInterpreter.DewParseException(String)</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParseException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParseException</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.html#DewInterpreter.DewParser()">DewInterpreter.DewParser()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.AlgebraicExpressionBranch.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.AlgebraicExpressionBranch</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents a branch that can be attached to the abstract syntax tree, and be evaluated at runtime.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.AlgebraicExpressionBranch.html#DewInterpreter.DewParser.AlgebraicExpressionBranch(java.util.LinkedList, java.util.ArrayList, java.util.ArrayList, java.util.HashMap, java.util.HashMap)">DewInterpreter.DewParser.AlgebraicExpressionBranch(LinkedList<DewInterpreter.DewLexer.LexicalTokens.LexicalToken>, ArrayList<DewInterpreter.DewParser.ParseTokens.Variable>, ArrayList<DewInterpreter.DewParser.ParseTokens.Variable>, HashMap<String, Short>, HashMap<String, Short>)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.AlgebraicExpressionBranch.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser.AlgebraicExpressionBranch</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.BranchElement.html" title="interface in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.BranchElement</span></a> - Interface in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">Branch element interface.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.ParseTokens</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class is a container for all token used and passed on to the interpreter by the parser.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.html#DewInterpreter.DewParser.ParseTokens()">DewInterpreter.DewParser.ParseTokens()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser.ParseTokens</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.ExpressionValueContainer.html" title="interface in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.ParseTokens.ExpressionValueContainer</span></a> - Interface in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.ParseToken.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.ParseTokens.ParseToken</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.ParseToken.html#DewInterpreter.DewParser.ParseTokens.ParseToken()">DewInterpreter.DewParser.ParseTokens.ParseToken()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.ParseToken.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser.ParseTokens.ParseToken</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.SystemCall.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.ParseTokens.SystemCall</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents a token that will make a system call at runtime.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.SystemCall.html#DewInterpreter.DewParser.ParseTokens.SystemCall()">DewInterpreter.DewParser.ParseTokens.SystemCall()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.SystemCall.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser.ParseTokens.SystemCall</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.Variable.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.ParseTokens.Variable</span></a><<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.Variable.html" title="type parameter in DewInterpreter.DewParser.ParseTokens.Variable">E</a>> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class represents a declared and initialized variable.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.Variable.html#DewInterpreter.DewParser.ParseTokens.Variable(E, java.lang.Class, short)">DewInterpreter.DewParser.ParseTokens.Variable(E, Class<E>, short)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.Variable.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser.ParseTokens.Variable</a></dt>
<dd>
<div class="block">Instantiates a non final variable.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.Variable.html#DewInterpreter.DewParser.ParseTokens.Variable(E, java.lang.Class, short, boolean)">DewInterpreter.DewParser.ParseTokens.Variable(E, Class<E>, short, boolean)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.Variable.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser.ParseTokens.Variable</a></dt>
<dd>
<div class="block">Instantiates a non final variable.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.VariablePointer.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.ParseTokens.VariablePointer</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd>
<div class="block">This class hold a reference (pointer) to a variable.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.VariablePointer.html#DewInterpreter.DewParser.ParseTokens.VariablePointer(short)">DewInterpreter.DewParser.ParseTokens.VariablePointer(short)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.ParseTokens.VariablePointer.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser.ParseTokens.VariablePointer</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.SyntaxBranch.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewParser.SyntaxBranch</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.SyntaxBranch.html#DewInterpreter.DewParser.SyntaxBranch()">DewInterpreter.DewParser.SyntaxBranch()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewParser.SyntaxBranch.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewParser.SyntaxBranch</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRelationalOperatorFunctionSet.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewRelationalOperatorFunctionSet</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRelationalOperatorFunctionSet.html#DewInterpreter.DewRelationalOperatorFunctionSet()">DewInterpreter.DewRelationalOperatorFunctionSet()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRelationalOperatorFunctionSet.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewRelationalOperatorFunctionSet</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewRuntimeException</span></a> - Exception in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html#DewInterpreter.DewRuntimeException()">DewInterpreter.DewRuntimeException()</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewRuntimeException</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html#DewInterpreter.DewRuntimeException(java.lang.String)">DewInterpreter.DewRuntimeException(String)</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewRuntimeException</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html#DewInterpreter.DewRuntimeException(java.lang.Throwable)">DewInterpreter.DewRuntimeException(Throwable)</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewRuntimeException</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html#DewInterpreter.DewRuntimeException(java.lang.String, java.lang.Throwable)">DewInterpreter.DewRuntimeException(String, Throwable)</a></span> - Constructor for exception com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewRuntimeException.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewRuntimeException</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewStringAndCharFunctionSet.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.DewStringAndCharFunctionSet</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewStringAndCharFunctionSet.html#DewInterpreter.DewStringAndCharFunctionSet()">DewInterpreter.DewStringAndCharFunctionSet()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewStringAndCharFunctionSet.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewStringAndCharFunctionSet</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.Token.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewInterpreter.Token</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.Token.html#DewInterpreter.Token()">DewInterpreter.Token()</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.Token.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.Token</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewLanguageBindingInterface.html" title="interface in com.rayburn.engine.dew.lang"><span class="strong">DewLanguageBindingInterface</span></a> - Interface in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingBoolean.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingBoolean</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingBoolean.html#DewPropertyBindingBoolean(java.lang.String, boolean)">DewPropertyBindingBoolean(String, boolean)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingBoolean.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingBoolean</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingByte.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingByte</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingByte.html#DewPropertyBindingByte(java.lang.String, byte)">DewPropertyBindingByte(String, byte)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingByte.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingByte</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingChar.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingChar</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingChar.html#DewPropertyBindingChar(java.lang.String, char)">DewPropertyBindingChar(String, char)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingChar.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingChar</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingDouble.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingDouble</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingDouble.html#DewPropertyBindingDouble(java.lang.String, double)">DewPropertyBindingDouble(String, double)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingDouble.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingDouble</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingFloat.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingFloat</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingFloat.html#DewPropertyBindingFloat(java.lang.String, float)">DewPropertyBindingFloat(String, float)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingFloat.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingFloat</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingInt.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingInt</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingInt.html#DewPropertyBindingInt(java.lang.String, int)">DewPropertyBindingInt(String, int)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingInt.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingInt</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingLong.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingLong</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingLong.html#DewPropertyBindingLong(java.lang.String, long)">DewPropertyBindingLong(String, long)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingLong.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingLong</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingObject.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingObject</span></a><<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingObject.html" title="type parameter in DewPropertyBindingObject">E</a>> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingObject.html#DewPropertyBindingObject(java.lang.String, E, java.lang.Class)">DewPropertyBindingObject(String, E, Class<E>)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingObject.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingObject</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingShort.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingShort</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingShort.html#DewPropertyBindingShort(java.lang.String, short)">DewPropertyBindingShort(String, short)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingShort.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingShort</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingString.html" title="class in com.rayburn.engine.dew.binding"><span class="strong">DewPropertyBindingString</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/package-summary.html">com.rayburn.engine.dew.binding</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingString.html#DewPropertyBindingString(java.lang.String, java.lang.String)">DewPropertyBindingString(String, String)</a></span> - Constructor for class com.rayburn.engine.dew.binding.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/bindings/DewPropertyBindingString.html" title="class in com.rayburn.engine.dew.binding">DewPropertyBindingString</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewScript.html" title="class in com.rayburn.engine.dew.lang"><span class="strong">DewScript</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/package-summary.html">com.rayburn.engine.dew.lang</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewScript.html#DewScript(java.lang.String, com.rayburn.engine.dew.lang.DewInterpreter.DewParser.SyntaxBranch)">DewScript(String, DewInterpreter.DewParser.SyntaxBranch)</a></span> - Constructor for class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewScript.html" title="class in com.rayburn.engine.dew.lang">DewScript</a></dt>
<dd>
<div class="block">Default constructor.</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/Camera.html#direction">direction</a></span> - Variable in class com.rayburn.engine.<a href="../com.normalizedinsanity.com.rayburn/engine/Camera.html" title="class in com.rayburn.engine">Camera</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../test/gimballock/Camera.html#direction">direction</a></span> - Variable in class test.gimballock.<a href="../test/gimballock/Camera.html" title="class in test.gimballock">Camera</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewMathFunctionSet.html#div(java.lang.Object, java.lang.Object, java.lang.Class)">div(Object, Object, Class)</a></span> - Static method in class com.rayburn.engine.dew.lang.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/lang/DewInterpreter.DewMathFunctionSet.html" title="class in com.rayburn.engine.dew.lang">DewInterpreter.DewMathFunctionSet</a></dt>
<dd>
<div class="block">Divides two objects numerically, implicitly casts</div>
</dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html#divConst(org.lwjgl.util.vector.Vector3f, float)">divConst(Vector3f, float)</a></span> - Static method in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/MathUtil.html" title="class in com.rayburn.engine.util">MathUtil</a></dt>
<dd>
<div class="block">Divides a vector by a constant</div>
</dd>
<dt><span class="strong"><a href="../test/projectiontesting/VertexBufferEngine.html#dof">dof</a></span> - Variable in class test.projectiontesting.<a href="../test/projectiontesting/VertexBufferEngine.html" title="class in test.projectiontesting">VertexBufferEngine</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/game/util/geom/Cube.html#draw()">draw()</a></span> - Method in class com.normalizedinsanity.com.rayburn.game.util.geom.<a href="../com.normalizedinsanity.com.rayburn/game/util/geom/Cube.html" title="class in com.normalizedinsanity.com.rayburn.game.util.geom">Cube</a></dt>
<dd> </dd>
<dt><a href="../com.normalizedinsanity.com.rayburn/engine/dew/command/Drives.html" title="class in com.rayburn.engine.dew.command"><span class="strong">Drives</span></a> - Class in <a href="../com.normalizedinsanity.com.rayburn/engine/dew/command/package-summary.html">com.rayburn.engine.dew.command</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/dew/command/Drives.html#Drives()">Drives()</a></span> - Constructor for class com.rayburn.engine.dew.command.<a href="../com.normalizedinsanity.com.rayburn/engine/dew/command/Drives.html" title="class in com.rayburn.engine.dew.command">Drives</a></dt>
<dd> </dd>
<dt><span class="strong"><a href="../com.normalizedinsanity.com.rayburn/engine/util/Logger.html#duplicateLogToSystemOut">duplicateLogToSystemOut</a></span> - Variable in class com.rayburn.engine.util.<a href="../com.normalizedinsanity.com.rayburn/engine/util/Logger.html" title="class in com.rayburn.engine.util">Logger</a></dt>
<dd>
<div class="block">Is the logger logging to System.out as well</div>
</dd>
</dl>
<a href="index-1.html">A</a> <a href="index-2.html">B</a> <a href="index-3.html">C</a> <a href="index-4.html">D</a> <a href="index-5.html">E</a> <a href="index-6.html">F</a> <a href="index-7.html">G</a> <a href="index-8.html">H</a> <a href="index-9.html">I</a> <a href="index-10.html">L</a> <a href="index-11.html">M</a> <a href="index-12.html">N</a> <a href="index-13.html">O</a> <a href="index-14.html">P</a> <a href="index-15.html">R</a> <a href="index-16.html">S</a> <a href="index-17.html">T</a> <a href="index-18.html">U</a> <a href="index-19.html">V</a> <a href="index-20.html">W</a> <a href="index-21.html">X</a> <a href="index-22.html">Y</a> <a href="index-23.html">Z</a> </div>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar_bottom">
<!-- -->
</a><a href="#skip-navbar_bottom" title="Skip navigation links"></a><a name="navbar_bottom_firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../overview-summary.html">Overview</a></li>
<li>Package</li>
<li>Class</li>
<li><a href="../overview-tree.html">Tree</a></li>
<li><a href="../deprecated-list.html">Deprecated</a></li>
<li class="navBarCell1Rev">Index</li>
<li><a href="../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="index-3.html">Prev Letter</a></li>
<li><a href="index-5.html">Next Letter</a></li>
</ul>
<ul class="navList">
<li><a href="../index.html?index-filesindex-4.html" target="_top">Frames</a></li>
<li><a href="index-4.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<a name="skip-navbar_bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
| guyfleeman/rayburn | javadoc/index-files/index-4.html | HTML | gpl-3.0 | 65,716 |
/*
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Created by: Matthieu Pinard, Ecole des Mines de Saint-Etienne, matthieu.pinard@etu.emse.fr
15-05-2016: Initial release
*/
#pragma once
/*!
* \file AtomicLock.h
* \brief Thread Synchronization capabilities using C++11 <atomic>
* \author Matthieu Pinard
*/
#include <atomic>
#include <thread>
const bool AtomicLock_UNLOCKED = false, AtomicLock_LOCKED = true;
/*! \class AtomicLock
* \brief Class for locking objects.
*
* The class provides with lock, unlock, try_lock and wait capabilities.
*/
class AtomicLock {
private:
std::atomic<bool> ThisLock; /*!< The atomic variable containing the Lock state (LOCKED or UNLOCKED) */
public:
/*!
* \brief Acquire the AtomicLock.
*
* This methods spins while the AtomicLock is acquired by another thread.
* As soon as it is released, the lock() function tries to acquire it.
*
*/
inline void lock();
/*!
* \brief Immediatly release the AtomicLock.
*
* This methods release the AtomicLock by atomically storing UNLOCKED.
*/
inline void unlock();
/*!
* \brief Wait for the AtomicLock to be released.
*
* This method spins while the AtomicLock is acquired by a thread.
*/
inline void wait();
/*!
* \brief Try acquiring the AtomicLock.
*
* This method does an unique check on the AtomicLock : if
* it is unlocked, it tries to acquire it using CAS.
*
* \return true if the function has acquired the AtomicLock,
* false otherwise. (AtomicLock already acquired, or if another thread
* has locked it during the call)
*/
inline bool try_lock();
/*!
* \brief AtomicLock constructor.
*
* The contructor initializes the AtomicLock as freed.
*/
AtomicLock() : ThisLock(AtomicLock_UNLOCKED) {}
/*!
* \brief AtomicLock destructor.
*
* The destructor unlocks the AtomicLock.
*/
~AtomicLock() {
unlock();
}
};
inline bool AtomicLock::try_lock() {
auto _Unlocked = AtomicLock_UNLOCKED;
// First check the Lock status before trying to acquire it using a CAS operation.
return (!ThisLock.load(std::memory_order::memory_order_acquire) &&
ThisLock.compare_exchange_strong(_Unlocked, AtomicLock_LOCKED, std::memory_order::memory_order_acquire, std::memory_order::memory_order_relaxed));
}
inline void AtomicLock::wait() {
// Spin atomically while the Lock is acquired.
while (ThisLock.load(std::memory_order::memory_order_acquire)) {
// Wait by issuing a yield() call
std::this_thread::yield();
}
}
inline void AtomicLock::lock() {
do {
// Spin on atomic Load, and if the lock is free...
if (!ThisLock.load(std::memory_order::memory_order_acquire)) {
auto _Unlocked = AtomicLock_UNLOCKED;
// Try to lock it using a CAS operation...
if (ThisLock.compare_exchange_strong(_Unlocked, AtomicLock_LOCKED, std::memory_order::memory_order_acquire, std::memory_order::memory_order_relaxed)) {
return;
}
}
// Wait by issuing a yield() call
std::this_thread::yield();
} while (true);
}
inline void AtomicLock::unlock() {
// Simply unlock by storing the value atomically.
ThisLock.store(AtomicLock_UNLOCKED, std::memory_order::memory_order_release);
} | MatthieuPinard/LayeredHashMap | ThreadManager/AtomicLock.h | C | gpl-3.0 | 3,788 |
<body id="home">
<div ng-bind-html="head"></div>
<button ng-click="publish()">Publish</button>
<button ng-click="edit()">Edit</button>
<div id="Container" ></div>
<div>_________________________________________________________________________________</div>
<script type="text/javascript">
//.ready(function(){
// var $ace_inner = $('#ace_inner')
// var html = $('#ace_inner').html().slice(22)
// console.log(html)
// $('#epframeEditor').empty()
// $('#epframeEditor').html(html)
// $('#chatbox').empty() // sets the pad id and puts the pad in the div
// $('#editorcontainer').attr("right","44px")
//})
</script>
</body>
</html>
| thoma5B/Django-Wiki | wiki/static/templates/article_view.html | HTML | gpl-3.0 | 674 |
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/*
* Loader.java
* Copyright (C) 2000 Mark Hall
*
*/
package weka.core.converters;
import java.io.File;
import java.io.InputStream;
import java.io.IOException;
import java.io.Serializable;
import weka.core.Instances;
import weka.core.Instance;
/**
* Interface to something that can load Instances from an input source in some
* format.
*
* @author Mark Hall (mhall@cs.waikato.ac.nz)
* @version $Revision: 1.6.2.1 $
*/
public interface Loader extends Serializable {
/**
* Resets the Loader object ready to begin loading.
* If there is an existing source, implementations should
* attempt to reset in such a fashion as to be able to
* load from the beginning of the source.
* @exception if Loader can't be reset for some reason.
*/
void reset() throws Exception;
/*@ public model instance boolean model_structureDetermined
@ initially: model_structureDetermined == false;
@*/
/*@ public model instance boolean model_sourceSupplied
@ initially: model_sourceSupplied == false;
@*/
/**
* Resets the Loader object and sets the source of the data set to be
* the supplied File object.
*
* @param file the File
* @exception IOException if an error occurs
* support loading from a File.
*
* <pre><jml>
* public_normal_behavior
* requires: file != null
* && (* file exists *);
* modifiable: model_sourceSupplied, model_structureDetermined;
* ensures: model_sourceSupplied == true
* && model_structureDetermined == false;
* also
* public_exceptional_behavior
* requires: file == null
* || (* file does not exist *);
* signals: (IOException);
* </jml></pre>
*/
void setSource(File file) throws IOException;
/**
* Resets the Loader object and sets the source of the data set to be
* the supplied InputStream.
*
* @param input the source InputStream
* @exception IOException if this Loader doesn't
* support loading from a File.
*/
void setSource(InputStream input) throws IOException;
/**
* Determines and returns (if possible) the structure (internally the
* header) of the data set as an empty set of instances.
*
* @return the structure of the data set as an empty set of Instances
* @exception IOException if there is no source or parsing fails
*
* <pre><jml>
* public_normal_behavior
* requires: model_sourceSupplied == true
* && model_structureDetermined == false
* && (* successful parse *);
* modifiable: model_structureDetermined;
* ensures: \result != null
* && \result.numInstances() == 0
* && model_structureDetermined == true;
* also
* public_exceptional_behavior
* requires: model_sourceSupplied == false
* || (* unsuccessful parse *);
* signals: (IOException);
* </jml></pre>
*/
Instances getStructure() throws IOException;
/**
* Return the full data set. If the structure hasn't yet been determined
* by a call to getStructure then the method should do so before processing
* the rest of the data set.
*
* @return the full data set as an Instances object
* @exception IOException if there is an error during parsing or if
* getNextInstance has been called on this source (either incremental
* or batch loading can be used, not both).
*
* <pre><jml>
* public_normal_behavior
* requires: model_sourceSupplied == true
* && (* successful parse *);
* modifiable: model_structureDetermined;
* ensures: \result != null
* && \result.numInstances() >= 0
* && model_structureDetermined == true;
* also
* public_exceptional_behavior
* requires: model_sourceSupplied == false
* || (* unsuccessful parse *);
* signals: (IOException);
* </jml></pre>
*/
Instances getDataSet() throws IOException;
/**
* Read the data set incrementally---get the next instance in the data
* set or returns null if there are no
* more instances to get. If the structure hasn't yet been
* determined by a call to getStructure then method should do so before
* returning the next instance in the data set.
*
* If it is not possible to read the data set incrementally (ie. in cases
* where the data set structure cannot be fully established before all
* instances have been seen) then an exception should be thrown.
*
* @return the next instance in the data set as an Instance object or null
* if there are no more instances to be read
* @exception IOException if there is an error during parsing or if
* getDataSet has been called on this source (either incremental
* or batch loading can be used, not both).
*
* <pre><jml>
* public_normal_behavior
* {|
* requires: model_sourceSupplied == true
* && (* successful parse *);
* modifiable: model_structureDetermined;
* ensures: model_structureDetermined == true
* && \result != null;
* also
* requires: model_sourceSupplied == true
* && (* no further input *);
* modifiable: model_structureDetermined;
* ensures: model_structureDetermined == true
* && \result == null;
* |}
* also
* public_exceptional_behavior
* {|
* requires: model_sourceSupplied == false
* || (* unsuccessful parse *);
* signals: (IOException);
* also
* requires: (* unable to process data set incrementally *);
* signals: (IOException);
* |}
* </jml></pre>
*/
Instance getNextInstance() throws IOException;
}
| paolopavan/cfr | src/weka/core/converters/Loader.java | Java | gpl-3.0 | 6,624 |
// uvscpd - Minimalist VSCP Daemon
// Copyright (C) 2019 Maarten Zanders
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#include <errno.h>
#include <linux/can.h>
#include <linux/can/raw.h>
#include <net/if.h>
#include <stdio.h>
#include <string.h>
#include <sys/ioctl.h>
#include "tcpserver_commands.h"
#include "tcpserver_context.h"
#include "tcpserver_worker.h"
#include "unistd.h"
#include "version.h"
#include "vscp.h"
#include "vscp_buffer.h"
/* Global stuff */
char *cmd_user = NULL;
char *cmd_password = NULL;
static int do_noop(void *obj, int argc, char *argv[]);
static int do_quit(void *obj, int argc, char *argv[]);
static int do_test(void *obj, int argc, char *argv[]);
static int do_repeat(void *obj, int argc, char *argv[]);
static int do_user(void *obj, int argc, char *argv[]);
static int do_password(void *obj, int argc, char *argv[]);
static int do_restart(void *obj, int argc, char *argv[]);
static int do_send(void *obj, int argc, char *argv[]);
static int do_retrieve(void *obj, int argc, char *argv[]);
static int do_rcvloop(void *obj, int argc, char *argv[]);
static int do_quitloop(void *obj, int argc, char *argv[]);
static int do_checkdata(void *obj, int argc, char *argv[]);
static int do_clearall(void *obj, int argc, char *argv[]);
static int do_getguid(void *obj, int argc, char *argv[]);
static int do_setguid(void *obj, int argc, char *argv[]);
static int do_wcyd(void *obj, int argc, char *argv[]);
static int do_version(void *obj, int argc, char *argv[]);
static int do_stat(void *obj, int argc, char *argv[]);
static int do_chid(void *obj, int argc, char *argv[]);
static int do_setfilter(void *obj, int argc, char *argv[]);
static int do_setmask(void *obj, int argc, char *argv[]);
static int do_interface(void *obj, int argc, char *argv[]);
const cmd_interpreter_cmd_list_t command_descr[] = {
{"+", do_repeat},
{"noop", do_noop},
{"quit", do_quit},
{"user", do_user},
{"pass", do_password},
{"restart", do_restart},
{"shutdown", do_restart},
{"send", do_send},
{"retr", do_retrieve},
{"rcvloop", do_rcvloop},
{"quitloop", do_quitloop},
{"cdta", do_checkdata},
{"checkdata", do_checkdata},
{"clra", do_clearall},
{"ggid", do_getguid},
{"getguid", do_getguid},
{"sgid", do_setguid},
{"setguid", do_setguid},
{"wcyd", do_wcyd},
{"whatcanyoudo", do_wcyd},
{"vers", do_version},
{"version", do_version},
{"stat", do_stat},
{"chid", do_chid},
{"sflt", do_setfilter},
{"setfilter", do_setfilter},
{"smsk", do_setmask},
{"setmask", do_setmask},
{"interface", do_interface}};
const int command_descr_num =
sizeof(command_descr) / sizeof(cmd_interpreter_cmd_list_t);
static int access_ok(context_t *context) {
return context->password_ok && context->user_ok;
}
int do_noop(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
status_reply(context, 0, NULL);
return 0;
}
int do_quit(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
status_reply(context, 0, "bye");
context->stop_thread = 1;
return 0;
}
static int do_repeat(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc == 1) {
return cmd_interpreter_repeat(context->cmd_interpreter, obj);
}
return CMD_WRONG_ARGUMENT_COUNT;
}
static int do_user(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc > 2) {
return CMD_WRONG_ARGUMENT_COUNT;
}
if (cmd_user == NULL) {
context->user_ok = 1;
status_reply(context, 0, "no user configured");
return 0;
}
if (argc == 1) {
context->user_ok = 0;
status_reply(context, 1, "please supply username");
} else {
if (strcmp(argv[1], cmd_user) == 0) {
context->user_ok = 1;
status_reply(context, 0, NULL);
} else {
context->user_ok = 0;
status_reply(context, 1, "invalid user");
}
}
return 0;
}
static int do_password(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc > 2) {
return CMD_WRONG_ARGUMENT_COUNT;
}
if (cmd_password == NULL) {
context->password_ok = 1;
status_reply(context, 0, "no password configured");
return 0;
}
if (argc == 1) {
context->user_ok = 0;
status_reply(context, 1, "please supply password");
} else {
if (strcmp(argv[1], cmd_password) == 0) {
context->password_ok = 1;
status_reply(context, 0, NULL);
} else {
context->password_ok = 0;
status_reply(context, 1, "invalid password");
}
}
return 0;
}
static int do_restart(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
status_reply(context, 1, "uvscpd is not capable of restart/shutdown");
return 0;
}
// send head,class,type,obid,datetime,timestamp,GUID,data1,data2,data3....
static int do_send(void *obj, int argc, char *argv[]) {
vscp_msg_t msg;
struct can_frame tx;
context_t *context = (context_t *)obj;
if (argc != 2) {
return CMD_WRONG_ARGUMENT_COUNT;
}
if (vscp_parse_msg(argv[1], &msg, &(context->guid))) {
status_reply(context, 1, "format error in CAN frame");
return 0;
}
vscp_to_can(&msg, &tx);
context->stat_tx_data += 4 + tx.can_dlc;
context->stat_tx_frame++;
if (write(context->can_socket, &tx, sizeof(struct can_frame)) !=
sizeof(struct can_frame)) {
status_reply(context, 1, "problem when writing to CAN socket");
return 0;
}
status_reply(context, 0, NULL);
return 0;
}
static int do_retrieve(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
unsigned int num_msgs;
char guard;
int empty_buffer = 0;
vscp_msg_t msg;
char buf[120];
int n;
if (argc > 2) {
return CMD_WRONG_ARGUMENT_COUNT;
}
if (argc == 2) {
if (sscanf(argv[1], "%u%c", &num_msgs, &guard) != 1) {
return CMD_FORMAT_ERROR;
}
} else
num_msgs = 1;
while (num_msgs > 0 && !empty_buffer) {
empty_buffer = vscp_buffer_pop(context->rx_buffer, &msg);
if (!empty_buffer) {
n = print_vscp(&msg, buf, sizeof(buf));
writen(context, buf, n);
}
num_msgs--;
}
if (empty_buffer)
status_reply(context, 1, "No event(s) available");
else
status_reply(context, 0, NULL);
return 0;
}
static int do_rcvloop(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
int empty_buffer = 0;
char buf[120];
int n;
vscp_msg_t msg;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
context->mode = loop;
clock_gettime(CLOCK_MONOTONIC_RAW, &(context->last_keepalive));
status_reply(context, 0, NULL);
while (!empty_buffer) {
empty_buffer = vscp_buffer_pop(context->rx_buffer, &msg);
if (!empty_buffer) {
n = print_vscp(&msg, buf, sizeof(buf));
writen(context, buf, n);
}
}
return 0;
}
static int do_quitloop(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
context->mode = normal;
status_reply(context, 0, NULL);
return 0;
}
static int do_checkdata(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
char buf[20];
int n;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
n = snprintf(buf, 20, "%u \r\n", vscp_buffer_used(context->rx_buffer));
writen(context, buf, n);
status_reply(context, 0, NULL);
return 0;
}
static int do_clearall(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
vscp_buffer_flush(context->rx_buffer);
status_reply(context, 0, "All events cleared.");
return 0;
}
static int do_getguid(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
char buf[56];
int n;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
n = vscp_print_guid(buf, sizeof(buf), &(context->guid));
if (n >= sizeof(buf) - 2) {
status_reply(context, 1, "Buffer overflow");
return 0;
}
buf[n] = '\r';
buf[n + 1] = '\n';
writen(context, buf, n + 2);
status_reply(context, 0, NULL);
return 0;
}
static int do_setguid(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
vscp_guid_t guid;
if (argc != 2) {
return CMD_WRONG_ARGUMENT_COUNT;
}
if (vscp_strtoguid(argv[1], &guid)) {
status_reply(context, 1, "Invalid GUID");
} else {
context->guid = guid;
status_reply(context, 0, NULL);
}
return 0;
}
static int do_wcyd(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
const char string[] = "00-00-00-00-00-00-80-28\r\n";
writen(context, string, strlen(string));
status_reply(context, 0, NULL);
return 0;
}
static int do_version(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
char string[20];
snprintf(string, sizeof(string), "%s,%s,%s,%s\r\n", VERSION_MAJOR,
VERSION_MINOR, VERSION_SUBMINOR, VERSION_BUILD);
writen(context, string, strlen(string));
status_reply(context, 0, NULL);
return 0;
}
static int do_stat(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
char string[100];
snprintf(string, sizeof(string), "0,0,0,%u,%u,%u,%u\r\n",
context->stat_rx_data, context->stat_rx_frame, context->stat_tx_data,
context->stat_tx_frame);
writen(context, string, strlen(string));
status_reply(context, 0, NULL);
return 0;
}
static int do_chid(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (argc != 1) {
return CMD_WRONG_ARGUMENT_COUNT;
}
char string[] = "0\r\n";
writen(context, string, strlen(string));
status_reply(context, 0, NULL);
return 0;
}
static int do_setfilter(void *obj, int argc, char *argv[]) {
canid_t filter;
context_t *context = (context_t *)obj;
if (argc != 2) {
return CMD_WRONG_ARGUMENT_COUNT;
}
if (vscp_parse_filter(argv[1], &filter, &(context->guid))) {
status_reply(context, 1, "format error in filter frame");
return 0;
}
context->filter.can_id = filter;
setsockopt(context->can_socket, SOL_CAN_RAW, CAN_RAW_FILTER,
&(context->filter), sizeof(struct can_filter));
status_reply(context, 0, NULL);
return 0;
}
static int do_setmask(void *obj, int argc, char *argv[]) {
canid_t mask;
context_t *context = (context_t *)obj;
if (argc != 2) {
return CMD_WRONG_ARGUMENT_COUNT;
}
if (vscp_parse_filter(argv[1], &mask, &(context->guid))) {
status_reply(context, 1, "format error in mask frame");
return 0;
}
context->filter.can_mask = mask;
setsockopt(context->can_socket, SOL_CAN_RAW, CAN_RAW_FILTER,
&(context->filter), sizeof(struct can_filter));
status_reply(context, 0, NULL);
return 0;
}
static int do_interface(void *obj, int argc, char *argv[]) {
context_t *context = (context_t *)obj;
if (!strcmp(argv[1], "list")) {
char string[120];
char guid[64];
char timebuffer[64];
struct tm *tmp;
tmp = gmtime(&(context->started));
if (tmp != NULL)
strftime(timebuffer, sizeof(timebuffer), "%FT%H:%M:%S", tmp);
else
snprintf(timebuffer, sizeof(timebuffer), "");
vscp_print_guid(guid, 64, &(context->guid));
sprintf(string, "0,1,%s,%s|Started %s\r\n", guid, context->can_bus,
timebuffer);
writen(context, string, strlen(string));
status_reply(context, 0, NULL);
return 0;
}
return -1;
}
| mzanders/uvscpd | src/tcpserver_commands.c | C | gpl-3.0 | 12,485 |
<?php
class Activity extends ActionHandler {
protected $requireLogin = true;
public function indexHandler() {
$this->output("activity/list");
}
} | vavrecan/groups-social-network | www/app/include/actions/activity.php | PHP | gpl-3.0 | 167 |
/****************************************************************************
**
** Copyright (C) 2015 The Qt Company Ltd.
** Contact: http://www.qt.io/licensing
**
** This file is part of Qt Creator.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms and
** conditions see http://www.qt.io/terms-conditions. For further information
** use the contact form at http://www.qt.io/contact-us.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPLv3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
****************************************************************************/
#include "changeauxiliarycommand.h"
#include <QDebug>
namespace QmlDesigner {
ChangeAuxiliaryCommand::ChangeAuxiliaryCommand()
{
}
ChangeAuxiliaryCommand::ChangeAuxiliaryCommand(const QVector<PropertyValueContainer> &auxiliaryChangeVector)
: m_auxiliaryChangeVector (auxiliaryChangeVector)
{
}
QVector<PropertyValueContainer> ChangeAuxiliaryCommand::auxiliaryChanges() const
{
return m_auxiliaryChangeVector;
}
QDataStream &operator<<(QDataStream &out, const ChangeAuxiliaryCommand &command)
{
out << command.auxiliaryChanges();
return out;
}
QDataStream &operator>>(QDataStream &in, ChangeAuxiliaryCommand &command)
{
in >> command.m_auxiliaryChangeVector;
return in;
}
QDebug operator <<(QDebug debug, const ChangeAuxiliaryCommand &command)
{
return debug.nospace() << "ChangeAuxiliaryCommand(auxiliaryChanges: " << command.m_auxiliaryChangeVector << ")";
}
} // namespace QmlDesigner
| frostasm/qt-creator | share/qtcreator/qml/qmlpuppet/commands/changeauxiliarycommand.cpp | C++ | gpl-3.0 | 2,106 |
package cn.nukkit.event.player;
import cn.nukkit.AdventureSettings;
import cn.nukkit.Player;
import cn.nukkit.event.Cancellable;
import cn.nukkit.event.HandlerList;
public class PlayerGameModeChangeEvent extends PlayerEvent implements Cancellable {
private static final HandlerList handlers = new HandlerList();
public static HandlerList getHandlers() {
return handlers;
}
@Override
public HandlerList getHandlerList() {
return getHandlers();
}
protected final int gamemode;
protected AdventureSettings newAdventureSettings;
public PlayerGameModeChangeEvent(Player player, int newGameMode, AdventureSettings newAdventureSettings) {
this.player = player;
this.gamemode = newGameMode;
this.newAdventureSettings = newAdventureSettings;
}
public int getNewGamemode() {
return gamemode;
}
public AdventureSettings getNewAdventureSettings() {
return newAdventureSettings;
}
public void setNewAdventureSettings(AdventureSettings newAdventureSettings) {
this.newAdventureSettings = newAdventureSettings;
}
}
| boy0001/Nukkit | src/main/java/cn/nukkit/event/player/PlayerGameModeChangeEvent.java | Java | gpl-3.0 | 1,138 |
"""
Decode all-call reply messages, with downlink format 11
"""
from pyModeS import common
def _checkdf(func):
"""Ensure downlink format is 11."""
def wrapper(msg):
df = common.df(msg)
if df != 11:
raise RuntimeError(
"Incorrect downlink format, expect 11, got {}".format(df)
)
return func(msg)
return wrapper
@_checkdf
def icao(msg):
"""Decode transponder code (ICAO address).
Args:
msg (str): 14 hexdigits string
Returns:
string: ICAO address
"""
return common.icao(msg)
@_checkdf
def interrogator(msg):
"""Decode interrogator identifier code.
Args:
msg (str): 14 hexdigits string
Returns:
int: interrogator identifier code
"""
# the CRC remainder contains the CL and IC field. top three bits are CL field and last four bits are IC field.
remainder = common.crc(msg)
if remainder > 79:
IC = "corrupt IC"
elif remainder < 16:
IC="II"+str(remainder)
else:
IC="SI"+str(remainder-16)
return IC
@_checkdf
def capability(msg):
"""Decode transponder capability.
Args:
msg (str): 14 hexdigits string
Returns:
int, str: transponder capability, description
"""
msgbin = common.hex2bin(msg)
ca = common.bin2int(msgbin[5:8])
if ca == 0:
text = "level 1 transponder"
elif ca == 4:
text = "level 2 transponder, ability to set CA to 7, on ground"
elif ca == 5:
text = "level 2 transponder, ability to set CA to 7, airborne"
elif ca == 6:
text = "evel 2 transponder, ability to set CA to 7, either airborne or ground"
elif ca == 7:
text = "Downlink Request value is 0,or the Flight Status is 2, 3, 4 or 5, either airborne or on the ground"
else:
text = None
return ca, text
| junzis/pyModeS | pyModeS/decoder/allcall.py | Python | gpl-3.0 | 1,888 |
// Cytosim was created by Francois Nedelec. Copyright 2007-2017 EMBL.
#include "bicgstab.h"
/**
Here is defined which norm is used to measure the residual
*/
bool Solver::Monitor::finished(const unsigned int size, const real * x)
{
#if ( 0 )
// this is the standard Euclidian norm
mResid = blas_xnrm2(size, x, 1);
#else
// use the 'infinite' norm
mResid = blas_xnrm8(size, x);
#endif
#if ( 1 )
if ( mIter > mIterOld+31 )
{
if ( mResid >= mResidOld )
{
std::cerr << "Stagnant solver?";
std::cerr << " residuals: " << std::scientific << mResidOld << " at iteration " << mIterOld;
std::cerr << ", " << std::scientific << mResid << " at " << mIter << std::endl;
}
mIterOld = mIter;
mResidOld = mResid;
}
#endif
#if ( 0 )
if ( mIter > 64 )
std::cerr << "Solver step " << mIter << " residual " << mResid << std::endl;
#endif
if ( mResid != mResid )
{
std::cerr << "Solver diverged: step " << mIter << " resid = not-a-number" << std::endl;
mResid = INFINITY;
return true;
}
if ( mIter > mIterMax )
return true;
return ( mResid < mResidMax );
}
| nedelec/cytosim | src/math/bicgstab.cc | C++ | gpl-3.0 | 1,236 |
from typing import List
class Message(object):
class Origin(object):
servername: str
nickname: str
username: str
hostname: str
command: str
origin: Origin
params: List[str]
| LastAvenger/labots | labots/common/message.py | Python | gpl-3.0 | 223 |
#include <iostream>
#include <fstream>
#include <cstring>
#include <math.h>
using namespace std;
#include "glob.cpp"
#include "schnibbler.cpp"
void help()
{
printf("Syntax: time ./mesyread FILE.mdat 100");
}
int main(int argc, char** argv) {
char outputfile_trunc[512];
unsigned char byte;
TSchnibbler* schnibbler;
if (argc < 1) {
printf("usage: mesycut PathToListModeFile.mdat\n");
}
else {
strcpy(outputfile_trunc, argv[1]);
schnibbler = new TSchnibbler();
schnibbler->set_outputfile_trunc(outputfile_trunc);
schnibbler->open_outputfile();
while (!schnibbler->end_of_file()) {
byte = std::getchar();
schnibbler->add_byte(byte);
}
schnibbler->close_outputfile();
fprintf(stderr, "EOF \n");
delete(schnibbler);
}
}
| jonasstein/qm | mesycut/mesycut.cpp | C++ | gpl-3.0 | 881 |
/*
Copyright (C) 2017 docwho
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/*
Created on : 27-gen-2017, 13.19.33
Author : docwho
*/
.input-text {
display: inherit;
min-width: 10em;
}
.input-indicator {
display: inline-block;
min-width: 20px;
vertical-align: baseline;
margin-left: 10px;
border-radius: 2px;
border-left: 4px solid;
padding: .45em .35em .3em;
font-family: Helvetica, arial, sans-serif;
font-size: 12px;
font-weight: 400;
line-height: normal;
background: #e4f0f5;
border-color: #3f87a6;
color: #3f87a6;
} | tetravalence/essential-script | css/essentialscript-admin.css | CSS | gpl-3.0 | 1,172 |
<?php
/**
* @package Arastta eCommerce
* @copyright Copyright (C) 2015 Arastta Association. All rights reserved. (arastta.org)
* @license GNU General Public License version 3; see LICENSE.txt
*/
// Heading
$_['heading_title'] = 'Trên mỗi sản phẩm';
// Text
$_['text_shipping'] = 'vận chuyển';
$_['text_success'] = 'Chúc mừng: Bạn đã chỉnh sửa thành công giá trên mỗi sản phẩm!';
$_['text_edit'] = 'Chỉnh sửa vận chuyển trên mỗi sản phẩm';
// Entry
$_['entry_cost'] = 'Giá';
$_['entry_tax_class'] = 'Loại thuế';
$_['entry_geo_zone'] = 'Vùng địa lý';
$_['entry_status'] = 'Trạng thái';
$_['entry_sort_order'] = 'Thứ tự sắp xếp';
// Error
$_['error_permission'] = 'Cảnh báo: Bạn không có quyền chỉnh sửa giá trên mỗi sản phẩm!'; | interspiresource/interspire | admin/language/vi-VN/shipping/item.php | PHP | gpl-3.0 | 855 |
#ifndef SHARK_LINALG_BLAS_VECTOR_EXPRESSION_HPP
#define SHARK_LINALG_BLAS_VECTOR_EXPRESSION_HPP
#include <boost/type_traits/is_convertible.hpp>
#include "vector_proxy.hpp"
#include "kernels/dot.hpp"
namespace shark {
namespace blas {
/// \brief Vector expression representing a constant valued vector.
template<class T>
class scalar_vector:public vector_expression<scalar_vector<T> > {
typedef scalar_vector<T> self_type;
public:
typedef std::size_t size_type;
typedef std::ptrdiff_t difference_type;
typedef T value_type;
typedef T scalar_type;
typedef const T& const_reference;
typedef T& reference;
typedef T* pointer;
typedef const T *const_pointer;
typedef std::size_t index_type;
typedef index_type const* const_index_pointer;
typedef index_type index_pointer;
typedef const vector_reference<const self_type> const_closure_type;
typedef vector_reference<self_type> closure_type;
typedef unknown_storage_tag storage_category;
// Construction and destruction
scalar_vector()
:m_size(0), m_value() {}
explicit scalar_vector(size_type size, value_type value)
:m_size(size), m_value(value) {}
scalar_vector(const scalar_vector& v)
:m_size(v.m_size), m_value(v.m_value) {}
// Accessors
size_type size() const {
return m_size;
}
// Resizing
void resize(size_type size, bool /*preserve*/ = true) {
m_size = size;
}
// Element access
const_reference operator()(index_type /*i*/) const {
return m_value;
}
const_reference operator [](index_type /*i*/) const {
return m_value;
}
public:
typedef constant_iterator<T> iterator;
typedef constant_iterator<T> const_iterator;
const_iterator begin() const {
return const_iterator(0,m_value);
}
const_iterator end() const {
return const_iterator(m_size,m_value);
}
private:
size_type m_size;
value_type m_value;
};
///\brief Creates a vector having a constant value.
///
///@param scalar the value which is repeated
///@param elements the size of the resulting vector
template<class T>
typename boost::enable_if<boost::is_arithmetic<T>, scalar_vector<T> >::type
repeat(T scalar, std::size_t elements){
return scalar_vector<T>(elements,scalar);
}
///\brief Class implementing vector transformation expressions.
///
///transforms a vector Expression e of type E using a Function f of type F as an elementwise transformation f(e(i))
///This transformation needs f to be constant, meaning that applying f(x), f(y), f(z) yields the same results independent of the
///order of application. Also F must provide a type F::result_type indicating the result type of the functor.
template<class E, class F>
class vector_unary:
public vector_expression<vector_unary<E, F> > {
typedef vector_unary<E, F> self_type;
typedef E const expression_type;
public:
typedef F functor_type;
typedef typename E::const_closure_type expression_closure_type;
typedef typename E::size_type size_type;
typedef typename E::difference_type difference_type;
typedef typename F::result_type value_type;
typedef value_type scalar_type;
typedef value_type const_reference;
typedef value_type reference;
typedef value_type const * const_pointer;
typedef value_type const* pointer;
typedef typename E::index_type index_type;
typedef typename E::const_index_pointer const_index_pointer;
typedef typename index_pointer<E>::type index_pointer;
typedef self_type const const_closure_type;
typedef self_type closure_type;
typedef unknown_storage_tag storage_category;
// Construction and destruction
// May be used as mutable expression.
vector_unary(vector_expression<E> const &e, F const &functor):
m_expression(e()), m_functor(functor) {}
// Accessors
size_type size() const {
return m_expression.size();
}
// Expression accessors
expression_closure_type const &expression() const {
return m_expression;
}
public:
// Element access
const_reference operator()(index_type i) const {
return m_functor(m_expression(i));
}
const_reference operator[](index_type i) const {
return m_functor(m_expression[i]);
}
// Closure comparison
bool same_closure(vector_unary const &vu) const {
return expression().same_closure(vu.expression());
}
typedef transform_iterator<typename E::const_iterator,functor_type> const_iterator;
typedef const_iterator iterator;
// Element lookup
const_iterator begin() const {
return const_iterator(m_expression.begin(),m_functor);
}
const_iterator end() const {
return const_iterator(m_expression.end(),m_functor);
}
private:
expression_closure_type m_expression;
F m_functor;
};
#define SHARK_UNARY_VECTOR_TRANSFORMATION(name, F)\
template<class E>\
vector_unary<E,F<typename E::value_type> >\
name(vector_expression<E> const& e){\
typedef F<typename E::value_type> functor_type;\
return vector_unary<E, functor_type>(e, functor_type());\
}
SHARK_UNARY_VECTOR_TRANSFORMATION(operator-, scalar_negate)
SHARK_UNARY_VECTOR_TRANSFORMATION(abs, scalar_abs)
SHARK_UNARY_VECTOR_TRANSFORMATION(log, scalar_log)
SHARK_UNARY_VECTOR_TRANSFORMATION(exp, scalar_exp)
SHARK_UNARY_VECTOR_TRANSFORMATION(cos, scalar_cos)
SHARK_UNARY_VECTOR_TRANSFORMATION(sin, scalar_sin)
SHARK_UNARY_VECTOR_TRANSFORMATION(tanh,scalar_tanh)
SHARK_UNARY_VECTOR_TRANSFORMATION(atanh,scalar_atanh)
SHARK_UNARY_VECTOR_TRANSFORMATION(sqr, scalar_sqr)
SHARK_UNARY_VECTOR_TRANSFORMATION(abs_sqr, scalar_abs_sqr)
SHARK_UNARY_VECTOR_TRANSFORMATION(sqrt, scalar_sqrt)
SHARK_UNARY_VECTOR_TRANSFORMATION(sigmoid, scalar_sigmoid)
SHARK_UNARY_VECTOR_TRANSFORMATION(softPlus, scalar_soft_plus)
SHARK_UNARY_VECTOR_TRANSFORMATION(elem_inv, scalar_inverse)
#undef SHARK_UNARY_VECTOR_TRANSFORMATION
//operations of the form op(v,t)[i] = op(v[i],t)
#define SHARK_VECTOR_SCALAR_TRANSFORMATION(name, F)\
template<class T, class E> \
typename boost::enable_if< \
boost::is_convertible<T, typename E::value_type >,\
vector_unary<E,F<typename E::value_type,T> > \
>::type \
name (vector_expression<E> const& e, T scalar){ \
typedef F<typename E::value_type,T> functor_type; \
return vector_unary<E, functor_type>(e, functor_type(scalar)); \
}
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator+, scalar_add)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator-, scalar_subtract2)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator*, scalar_multiply2)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator/, scalar_divide)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator<, scalar_less_than)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator<=, scalar_less_equal_than)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator>, scalar_bigger_than)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator>=, scalar_bigger_equal_than)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator==, scalar_equal)
SHARK_VECTOR_SCALAR_TRANSFORMATION(operator!=, scalar_not_equal)
SHARK_VECTOR_SCALAR_TRANSFORMATION(min, scalar_min)
SHARK_VECTOR_SCALAR_TRANSFORMATION(max, scalar_max)
SHARK_VECTOR_SCALAR_TRANSFORMATION(pow, scalar_pow)
#undef SHARK_VECTOR_SCALAR_TRANSFORMATION
// operations of the form op(t,v)[i] = op(t,v[i])
#define SHARK_VECTOR_SCALAR_TRANSFORMATION_2(name, F)\
template<class T, class E> \
typename boost::enable_if< \
boost::is_convertible<T, typename E::value_type >,\
vector_unary<E,F<typename E::value_type,T> > \
>::type \
name (T scalar, vector_expression<E> const& e){ \
typedef F<typename E::value_type,T> functor_type; \
return vector_unary<E, functor_type>(e, functor_type(scalar)); \
}
SHARK_VECTOR_SCALAR_TRANSFORMATION_2(operator+, scalar_add)
SHARK_VECTOR_SCALAR_TRANSFORMATION_2(operator-, scalar_subtract1)
SHARK_VECTOR_SCALAR_TRANSFORMATION_2(operator*, scalar_multiply1)
SHARK_VECTOR_SCALAR_TRANSFORMATION_2(min, scalar_min)
SHARK_VECTOR_SCALAR_TRANSFORMATION_2(max, scalar_max)
#undef SHARK_VECTOR_SCALAR_TRANSFORMATION_2
template<class E1, class E2, class F>
class vector_binary:
public vector_expression<vector_binary<E1,E2, F> > {
typedef vector_binary<E1,E2, F> self_type;
typedef E1 const expression1_type;
typedef E2 const expression2_type;
public:
typedef std::size_t size_type;
typedef std::ptrdiff_t difference_type;
typedef typename F::result_type value_type;
typedef value_type scalar_type;
typedef value_type const_reference;
typedef value_type reference;
typedef value_type const * const_pointer;
typedef value_type const* pointer;
typedef typename E1::index_type index_type;
typedef typename E1::const_index_pointer const_index_pointer;
typedef typename index_pointer<E1>::type index_pointer;
typedef F functor_type;
typedef typename E1::const_closure_type expression_closure1_type;
typedef typename E2::const_closure_type expression_closure2_type;
typedef self_type const const_closure_type;
typedef self_type closure_type;
typedef unknown_storage_tag storage_category;
// Construction and destruction
explicit vector_binary (
expression_closure1_type e1,
expression_closure2_type e2,
F functor
):m_expression1(e1),m_expression2(e2), m_functor(functor) {
SIZE_CHECK(e1.size() == e2.size());
}
// Accessors
size_type size() const {
return m_expression1.size ();
}
// Expression accessors
expression_closure1_type const& expression1() const {
return m_expression1;
}
expression_closure2_type const& expression2() const {
return m_expression2;
}
// Element access
const_reference operator() (index_type i) const {
SIZE_CHECK(i < size());
return m_functor(m_expression1(i),m_expression2(i));
}
const_reference operator[] (index_type i) const {
SIZE_CHECK(i < size());
return m_functor(m_expression1(i),m_expression2(i));
}
// Closure comparison
bool same_closure (vector_binary const& vu) const {
return expression1 ().same_closure (vu.expression1())
&& expression2 ().same_closure (vu.expression2());
}
// Iterator types
// Iterator enhances the iterator of the referenced expressions
// with the unary functor.
typedef binary_transform_iterator<
typename E1::const_iterator,typename E2::const_iterator,functor_type
> const_iterator;
typedef const_iterator iterator;
const_iterator begin () const {
return const_iterator (m_functor,
m_expression1.begin(),m_expression1.end(),
m_expression2.begin(),m_expression2.end()
);
}
const_iterator end() const {
return const_iterator (m_functor,
m_expression1.end(),m_expression1.end(),
m_expression2.end(),m_expression2.end()
);
}
private:
expression_closure1_type m_expression1;
expression_closure2_type m_expression2;
F m_functor;
};
#define SHARK_BINARY_VECTOR_EXPRESSION(name, F)\
template<class E1, class E2>\
vector_binary<E1, E2, F<typename E1::value_type, typename E2::value_type> >\
name(vector_expression<E1> const& e1, vector_expression<E2> const& e2){\
typedef F<typename E1::value_type, typename E2::value_type> functor_type;\
return vector_binary<E1, E2, functor_type>(e1(),e2(), functor_type());\
}
SHARK_BINARY_VECTOR_EXPRESSION(operator+, scalar_binary_plus)
SHARK_BINARY_VECTOR_EXPRESSION(operator-, scalar_binary_minus)
SHARK_BINARY_VECTOR_EXPRESSION(operator*, scalar_binary_multiply)
SHARK_BINARY_VECTOR_EXPRESSION(element_prod, scalar_binary_multiply)
SHARK_BINARY_VECTOR_EXPRESSION(operator/, scalar_binary_divide)
SHARK_BINARY_VECTOR_EXPRESSION(element_div, scalar_binary_divide)
SHARK_BINARY_VECTOR_EXPRESSION(min, scalar_binary_min)
SHARK_BINARY_VECTOR_EXPRESSION(max, scalar_binary_max)
#undef SHARK_BINARY_VECTOR_EXPRESSION
template<class E1, class E2>
vector_binary<E1, E2,
scalar_binary_safe_divide<typename E1::value_type, typename E2::value_type>
>
safe_div(
vector_expression<E1> const& e1,
vector_expression<E2> const& e2,
typename promote_traits<
typename E1::value_type,
typename E2::value_type
>::promote_type defaultValue
){
typedef scalar_binary_safe_divide<typename E1::value_type, typename E2::value_type> functor_type;
return vector_binary<E1, E2, functor_type>(e1(),e2(), functor_type(defaultValue));
}
/////VECTOR REDUCTIONS
/// \brief sum v = sum_i v_i
template<class E>
typename E::value_type
sum(const vector_expression<E> &e) {
typedef typename E::value_type value_type;
vector_fold<scalar_binary_plus<value_type, value_type> > kernel;
return kernel(e,value_type());
}
/// \brief max v = max_i v_i
template<class E>
typename E::value_type
max(const vector_expression<E> &e) {
typedef typename E::value_type value_type;
vector_fold<scalar_binary_max<value_type, value_type> > kernel;
return kernel(e,e()(0));
}
/// \brief min v = min_i v_i
template<class E>
typename E::value_type
min(const vector_expression<E> &e) {
typedef typename E::value_type value_type;
vector_fold<scalar_binary_min<value_type, value_type> > kernel;
return kernel(e,e()(0));
}
/// \brief arg_max v = arg max_i v_i
template<class E>
std::size_t arg_max(const vector_expression<E> &e) {
SIZE_CHECK(e().size() > 0);
return std::max_element(e().begin(),e().end()).index();
}
/// \brief arg_min v = arg min_i v_i
template<class E>
std::size_t arg_min(const vector_expression<E> &e) {
SIZE_CHECK(e().size() > 0);
return arg_max(-e);
}
/// \brief soft_max v = ln(sum(exp(v)))
///
/// Be aware that this is NOT the same function as used in machine learning: exp(v)/sum(exp(v))
///
/// The function is computed in an numerically stable way to prevent that too high values of v_i produce inf or nan.
/// The name of the function comes from the fact that it behaves like a continuous version of max in the respect that soft_max v <= v.size()*max(v)
/// max is reached in the limit as the gap between the biggest value and the rest grows to infinity.
template<class E>
typename E::value_type
soft_max(const vector_expression<E> &e) {
typename E::value_type maximum = max(e);
return std::log(sum(exp(e-blas::repeat(maximum,e().size()))))+maximum;
}
////implement all the norms based on sum!
/// \brief norm_1 v = sum_i |v_i|
template<class E>
typename real_traits<typename E::value_type >::type
norm_1(const vector_expression<E> &e) {
return sum(abs(e));
}
/// \brief norm_2 v = sum_i |v_i|^2
template<class E>
typename real_traits<typename E::value_type >::type
norm_sqr(const vector_expression<E> &e) {
return sum(abs_sqr(e));
}
/// \brief norm_2 v = sqrt (sum_i |v_i|^2 )
template<class E>
typename real_traits<typename E::value_type >::type
norm_2(const vector_expression<E> &e) {
using std::sqrt;
return sqrt(norm_sqr(e));
}
/// \brief norm_inf v = max_i |v_i|
template<class E>
typename real_traits<typename E::value_type >::type
norm_inf(vector_expression<E> const &e){
return max(abs(e));
}
/// \brief index_norm_inf v = arg max_i |v_i|
template<class E>
std::size_t index_norm_inf(vector_expression<E> const &e){
return arg_max(abs(e));
}
// inner_prod (v1, v2) = sum_i v1_i * v2_i
template<class E1, class E2>
typename promote_traits<
typename E1::value_type,
typename E2::value_type
>::promote_type
inner_prod(
vector_expression<E1> const& e1,
vector_expression<E2> const& e2
) {
typedef typename promote_traits<
typename E1::value_type,
typename E2::value_type
>::promote_type value_type;
value_type result = value_type();
kernels::dot(e1,e2,result);
return result;
}
}
}
#endif
| CptCapy/Programming_Shark | include/shark/LinAlg/BLAS/vector_expression.hpp | C++ | gpl-3.0 | 15,033 |
<?php
require './cssmin-v3.0.1-minified.php';
$host = $_SERVER['HTTP_HOST'];
/* your css files */
echo CssMin::minify(file_get_contents("./font-awesome/css/font-awesome.min.tree.css"));
echo CssMin::minify(file_get_contents('./css/allfonts.css'));
echo CssMin::minify(file_get_contents("./css/bootstrap.min.css"));
echo CssMin::minify(file_get_contents("./css/font-awesome.min.css"));
echo CssMin::minify(file_get_contents("./plugins/animate/animate.css"));
echo CssMin::minify(file_get_contents("./plugins/creative-brands/creative-brands.css"));
echo CssMin::minify(file_get_contents("./plugins/vertical-carousel/vertical-carousel.css"));
echo CssMin::minify(file_get_contents("./css/custom.css"));
echo CssMin::minify(file_get_contents("./css/bootstrap-glyphicons.css"));
echo CssMin::minify(file_get_contents("./css/menu3d_libre.css"));
echo CssMin::minify(file_get_contents("./css/hover-min.css"));
echo CssMin::minify(file_get_contents("./css/main_web.css"));
echo CssMin::minify(file_get_contents("./css/timeline.css"));
?> | mcvela/miguelangelalacio | css/mcvela_css_inline_mini.php | PHP | gpl-3.0 | 1,037 |
/* MD5
converted to C++ class by Frank Thilo (thilo@unix-ag.org)
for bzflag (http://www.bzflag.org)
based on:
md5.h and md5.c
reference implementation of RFC 1321
Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
rights reserved.
License to copy and use this software is granted provided that it
is identified as the "RSA Data Security, Inc. MD5 Message-Digest
Algorithm" in all material mentioning or referencing this software
or this function.
License is also granted to make and use derivative works provided
that such works are identified as "derived from the RSA Data
Security, Inc. MD5 Message-Digest Algorithm" in all material
mentioning or referencing the derived work.
RSA Data Security, Inc. makes no representations concerning either
the merchantability of this software or the suitability of this
software for any particular purpose. It is provided "as is"
without express or implied warranty of any kind.
These notices must be retained in any copies of any part of this
documentation and/or software.
*/
#ifndef BZF_MD5_H
#define BZF_MD5_H
#include <string>
#include <iostream>
// a small class for calculating MD5 hashes of strings or byte arrays
// it is not meant to be fast or secure
//
// usage: 1) feed it blocks of uchars with update()
// 2) finalize()
// 3) get hexdigest() string
// or
// MD5(std::string).hexdigest()
//
// assumes that char is 8 bit and int is 32 bit
class MD5
{
public:
typedef unsigned int size_type; // must be 32bit
MD5();
MD5(const std::string& text);
void update(const unsigned char *buf, size_type length);
void update(const char *buf, size_type length);
MD5& finalize();
std::string hexdigest() const;
bool hexdigest(char * buf);
friend std::ostream& operator<<(std::ostream&, MD5 md5);
private:
void init();
typedef unsigned char uint1; // 8bit
typedef unsigned int uint4; // 32bit
enum {blocksize = 64}; // VC6 won't eat a const static int here
void transform(const uint1 block[blocksize]);
static void decode(uint4 output[], const uint1 input[], size_type len);
static void encode(uint1 output[], const uint4 input[], size_type len);
bool finalized;
uint1 buffer[blocksize]; // bytes that didn't fit in last 64 byte chunk
uint4 count[2]; // 64bit counter for number of bits (lo, hi)
uint4 state[4]; // digest so far
uint1 digest[16]; // the result
// low level logic operations
static inline uint4 F(uint4 x, uint4 y, uint4 z);
static inline uint4 G(uint4 x, uint4 y, uint4 z);
static inline uint4 H(uint4 x, uint4 y, uint4 z);
static inline uint4 I(uint4 x, uint4 y, uint4 z);
static inline uint4 rotate_left(uint4 x, int n);
static inline void FF(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac);
static inline void GG(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac);
static inline void HH(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac);
static inline void II(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac);
};
std::string md5(const std::string str);
bool md5(const char * input, char * output);
void MD5_Salt(unsigned int len, char* output);
#endif
| Fimbulwinter/Fimbulwinter | src/Common/md5.hpp | C++ | gpl-3.0 | 3,207 |
--[[
MISSION: Hot dogs from space
DESCRIPTION: An old man who owns a hot dog factory wants to go to space
The old man has elevated pressure in his cochlea so he can't go to space.
He's getting old and wants to go to space before he dies. He owns a hot dog
factory and will pay you in hot dogs (food). Because of his illness, you
can't land on any planet outside the system (the player doesn't know this).
NOTE: This mission is best suited in systems with 2 or more planets, but can
be used in any system with a planet.
--]]
-- Localization, choosing a language if naev is translated for non-english-speaking locales.
lang = naev.lang()
if lang == "es" then
else -- Default to English
-- This section stores the strings (text) for the mission.
-- Bar information, describes how he appears in the bar
bar_desc = "You see an old man with a cap on, on which the letters R-E-Y-N-I-R are im-- printed."
-- Mission details. We store some text for the mission with specific variables.
misn_title = "Rich reward from space!"
misn_reward = "Lots of cash"
misn_desc = "Reynir wants to travel to space and will reward you richly."
cargoname = "Generic Food"
-- Stage one
title = {} --Each dialog box has a title.
text = {} --We store mission text in tables. As we need them, we create them.
title[1] = "Spaceport Bar" --Each chunk of text is stored by index in the table.
text[1] = [["Do you like money?"]] --Use double brackets [[]] for block quotes over several lines.
text[2] = [["Ever since I was a kid I've wanted to go to space. However, my doctor says I can't go to space because I have an elevated pressure in my cochlea, a common disease around here.
"I am getting old now, as you can see. Before I die I want to travel to space, and I want you to fly me there! I own a hot dog factory, so I can reward you richly! Will you do it?"]]
text[3] = [["Thank you so much! Just fly me around in the system, preferably near %s."]]
title[4] = "Reynir"
text[4] = [[Reynir walks out of the ship. You notice that he's bleeding out of both ears. "Where have you taken me?! Get me back to %s right now!!"]]
text[5] = [["Thank you so much! Here's %s tons of hot dogs. They're worth more than their weight in gold, aren't they?"]]
text[7] = [[Reynir doesn't look happy when you meet him outside the ship.
"I lost my hearing out there! Damn you!! I made a promise, though, so I'd better keep it. Here's your reward, %d tons of hot dogs..."]]
text[6] = [[Reynir walks out of the ship, amazed by the view. "So this is how %s looks like! I've always wondered... I want to go back to %s now, please."]]
-- Comm chatter -- ??
talk = {}
talk[1] = ""
-- Other text for the mission -- ??
osd_msg = {}
osd_msg[1] = "Fly around in the system, preferably near %s."
osd_msg[2] = "Take Reynir home to %s."
msg_abortTitle = ""
msg_abort = [[]]
end
function create ()
-- Note: this mission does not make any system claims.
misn.setNPC( "Reynir", "neutral/unique/reynir" )
misn.setDesc( bar_desc )
-- Mission variables
misn_base, misn_base_sys = planet.cur()
misn_bleeding = false
end
function accept ()
-- make sure there are at least 2 inhabited planets
if (function ()
local count = 0
for i, p in ipairs (system.cur():planets()) do
if p:services()["inhabited"] then
count=count+1
end
end
return count > 1
end) ()
and tk.yesno( title[1], text[1] ) and tk.yesno( title[1], text[2] ) then
misn.accept() -- For missions from the Bar only.
misn.setTitle( misn_title )
misn.setReward( misn_reward )
misn.setDesc( misn_desc )
hook.land( "landed" )
tk.msg( title[4], string.format(text[3], misn_base:name()) )
misn.osdCreate(misn_title, {osd_msg[1]:format(misn_base:name())})
cargoID = misn.cargoAdd( "Civilians", 0 )
end
end
function landed()
-- If landed on misn_base then give reward
if planet.cur() == misn_base then
misn.cargoRm( cargoID )
if misn_bleeding then
reward = math.min(1, pilot.cargoFree(player.pilot()))
reward_text = text[7]
else
reward = pilot.cargoFree(player.pilot())
reward_text = text[5]
end
tk.msg( title[4], string.format(reward_text, reward) )
pilot.cargoAdd( player.pilot(), cargoname, reward )
misn.finish(true)
-- If we're in misn_base_sys but not on misn_base then...
elseif system.cur() == misn_base_sys then
tk.msg( title[4], string.format(text[6], planet.cur():name(), misn_base:name()) )
misn.osdCreate(misn_title, {osd_msg[2]:format(misn_base:name())})
-- If we're in another system then make Reynir bleed out his ears ;)
else
tk.msg( title[4], string.format(text[4], misn_base:name()) )
misn.osdCreate(misn_title, {osd_msg[2]:format(misn_base:name())})
misn_bleeding = true
end
end
-- TODO: There should probably be more here
function abort ()
-- Remove the passenger.
misn.cargoRm( cargoID )
misn.finish(false)
end
| Mutos/StarsOfCall-NAEV | dat/missions/neutral/reynir.lua | Lua | gpl-3.0 | 5,317 |
using UnityEngine;
using System.Collections;
public class CSol : MonoBehaviour {
float m_fScale = 100.0f;
// Use this for initialization
void Start ()
{
float fWidth = gameObject.renderer.material.GetTexture("_MainTex").width;
float fHeight = gameObject.renderer.material.GetTexture("_MainTex").height;
float fX = gameObject.transform.localScale.x;
float fY = gameObject.transform.localScale.z;
gameObject.renderer.material.SetTextureScale("_MainTex", new Vector2(fX*m_fScale/ fWidth, fY*m_fScale/ fHeight));
}
// Update is called once per frame
void Update ()
{
}
}
| Khoyo/mini_ld_48 | Assets/Code/CSol.cs | C# | gpl-3.0 | 603 |
"""pybackup - Backup Plugin for MySQL Database
"""
import os
from pybackup import errors
from pybackup import utils
from pybackup.logmgr import logger
from pybackup.plugins import BackupPluginBase
from pysysinfo.mysql import MySQLinfo
__author__ = "Ali Onur Uyar"
__copyright__ = "Copyright 2011, Ali Onur Uyar"
__credits__ = []
__license__ = "GPL"
__version__ = "0.5"
__maintainer__ = "Ali Onur Uyar"
__email__ = "aouyar at gmail.com"
__status__ = "Development"
class PluginMySQL(BackupPluginBase):
"""Class for backups of MySQL Database.
"""
_extOpts = {'filename_dump_db': 'Filename for MySQL dump files.',
'db_host': 'MySQL Database Server Name or IP.',
'db_port': 'MySQL Database Server Port.',
'db_user': 'MySQL Database Server User.',
'db_password': 'MySQL Database Server Password.',
'db_list': 'List of databases. (All databases by default.)',}
_extReqOptList = ()
_extDefaults = {'cmd_mysqldump': 'mysqldump',
'filename_dump_db': 'mysql_dump',}
def __init__(self, global_conf, job_conf):
"""Constructor
@param global_conf: Dictionary of general configuration options.
@param job_conf: Dictionary of job configuration options.
"""
BackupPluginBase.__init__(self, global_conf, job_conf)
self._connArgs = []
for (opt, key) in (('-h', 'db_host'),
('-P', 'db_port'),
('-u', 'db_user')):
val = self._conf.get(key)
if val is not None:
self._connArgs.extend([opt, val])
self._env = os.environ.copy()
db_password = self._conf.get('db_password')
if db_password is not None:
self._env['MYSQL_PWD'] = db_password
def dumpDatabase(self, db, data=True):
if data:
dump_type = 'data'
dump_desc = 'MySQL Database Contents'
else:
dump_type = 'db'
dump_desc = 'MySQL Database Container'
dump_filename = "%s_%s_%s.dump.%s" % (self._conf['filename_dump_db'],
db, dump_type,
self._conf['suffix_compress'])
dump_path = os.path.join(self._conf['job_path'], dump_filename)
args = [self._conf['cmd_mysqldump'],]
args.extend(self._connArgs)
if db in ('information_schema', 'mysql'):
args.append('--skip-lock-tables')
if not data:
args.extend(['--no-create-info', '--no-data' ,'--databases'])
args.append(db)
logger.info("Starting dump of %s: %s"
" Backup: %s", dump_desc, db, dump_path)
returncode, out, err = self._execBackupCmd(args, #@UnusedVariable
self._env,
out_path=dump_path,
out_compress=True)
if returncode == 0:
logger.info("Finished dump of %s: %s"
" Backup: %s", dump_desc, db, dump_path)
else:
raise errors.BackupError("Dump of %s for %s failed "
"with error code: %s"
% (dump_desc, db, returncode),
*utils.splitMsg(err))
def dumpDatabases(self):
if not self._conf.has_key('db_list'):
try:
my = MySQLinfo(host=self._conf.get('db_host'),
port=self._conf.get('db_port'),
user=self._conf.get('db_user'),
password=self._conf.get('db_password'))
self._conf['db_list'] = my.getDatabases()
del my
except Exception, e:
raise errors.BackupError("Connection to MySQL Server "
"for querying database list failed.",
"Error Message: %s" % str(e))
logger.info("Starting dump of %d MySQL Databases.",
len(self._conf['db_list']))
for db in self._conf['db_list']:
self.dumpDatabase(db, False)
self.dumpDatabase(db, True)
logger.info("Finished dump of MySQL Databases.")
def dumpFull(self):
self.dumpDatabases()
description = "Plugin for backups of MySQL Database."
methodList = (('mysql_dump_full', PluginMySQL, 'dumpFull'),
('mysql_dump_databases', PluginMySQL, 'dumpDatabases'),)
| aouyar/pybackup | pybackup/plugins/mysql.py | Python | gpl-3.0 | 4,714 |
/******************************************************************************
* *
* This file is part of Virtual Chess Clock, a chess clock software *
* *
* Copyright (C) 2010-2014 Yoann Le Montagner <yo35(at)melix(dot)net> *
* *
* This program is free software: you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation, either version 3 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program. If not, see <http://www.gnu.org/licenses/>. *
* *
******************************************************************************/
#ifndef BITIMERWIDGET_H_
#define BITIMERWIDGET_H_
#include <QWidget>
#include <memory>
#include <core/bitimer.h>
QT_BEGIN_NAMESPACE
class QTimer;
class QPainter;
QT_END_NAMESPACE
/**
* Display a BiTimer object.
*/
class BiTimerWidget : public QWidget
{
Q_OBJECT
public:
/**
* Constructor.
*/
BiTimerWidget(QWidget *parent=0);
/**
* Check whether a timer is binded to the widget or not.
*/
bool hasTimerBinded() const { return _biTimer!=nullptr; }
/**
* Return a reference to the binded bi-timer object.
* @throw std::invalid_argument If no timer is binded to the widget.
*/
const BiTimer &biTimer() const { ensureTimerBinded(); return *_biTimer; }
/**
* Bind a timer to the widget.
*/
void bindTimer(const BiTimer &biTimer);
/**
* Unbind the timer currently binded, if any.
*/
void unbindTimer();
/**
* Left or right label (typically the name of the corresponding player).
*/
const QString &label(Side side) const { return _label[side]; }
/**
* Set the left or right label.
*/
void setLabel(Side side, const QString &value);
/**
* Whether the labels are displayed or not.
*/
bool showLabels() const { return _showLabels; }
/**
* Set whether the labels are displayed or not.
*/
void setShowLabels(bool value);
/**
* Minimal remaining time before seconds is displayed.
*/
const TimeDuration &delayBeforeDisplaySeconds() const { return _delayBeforeDisplaySeconds; }
/**
* Set the minimal remaining time before seconds is displayed.
*/
void setDelayBeforeDisplaySeconds(const TimeDuration &value);
/**
* Whether the time should be displayed after timeout.
*/
bool displayTimeAfterTimeout() const { return _displayTimeAfterTimeout; }
/**
* Set whether the time should be displayed after timeout.
*/
void setDisplayTimeAfterTimeout(bool value);
/**
* Whether extra-information is displayed in Bronstein-mode.
*/
bool displayBronsteinExtraInfo() const { return _displayBronsteinExtraInfo; }
/**
* Set whether extra-information is displayed in Bronstein-mode.
*/
void setDisplayBronsteinExtraInfo(bool value);
/**
* Whether extra-information is displayed in byo-yomi-mode.
*/
bool displayByoYomiExtraInfo() const { return _displayByoYomiExtraInfo; }
/**
* Set whether extra-information is displayed in byo-yomi-mode.
*/
void setDisplayByoYomiExtraInfo(bool value);
/**
* @name Size hint methods.
* @{
*/
QSize minimumSizeHint() const override;
QSize sizeHint() const override;
/**@} */
protected:
/**
* Widget rendering method.
*/
void paintEvent(QPaintEvent *event) override;
private:
// Private functions
void ensureTimerBinded() const;
void onTimerStateChanged();
void onTimeoutEvent();
void drawText(double x, double y, double w, double h, Qt::Alignment flags, const QString &text);
void applyFontFactor(double factor);
double computeFontFactor(double w, double h, const QString &text) const;
QString timeDurationAsString(const TimeDuration &value) const;
// Private members
std::unique_ptr<sig::scoped_connection> _connection;
QTimer *_timer ;
const BiTimer *_biTimer ;
Enum::array<Side, QString> _label ;
bool _showLabels ;
TimeDuration _delayBeforeDisplaySeconds;
bool _displayTimeAfterTimeout ;
bool _displayBronsteinExtraInfo;
bool _displayByoYomiExtraInfo ;
// Temporary members used at rendering time
// (should not be used outside the `paintEvent` method).
QPainter *_painter;
};
#endif /* BITIMERWIDGET_H_ */
| yo35/vcc | src/gui/widgets/bitimerwidget.h | C | gpl-3.0 | 5,221 |
SUBROUTINE RDKEYM(KFILDO,KFILX,JREC,NOPREC,KEYREC,NWDS,NW,
1 KSIZE,CFROM,IER)
C
C NOVEMBER 1996 GLAHN TDL MOS-2000
C JANUARY 1997 GLAHN ADDED NW TO CALL TO CHECK RECORD SIZE
C AUGUST 1998 GLAHN CHANGED LOOP AT STATEMENT 136;
C COMMENTS IN PURPOSE REMOVED
C APRIL 2000 DALLAVALLE MODIFIED FORMAT STATEMENTS TO
C CONFORM TO FORTRAN 90 STANDARDS
C ON THE IBM SP
C DECEMBER 2006 GLAHN COMMENT CHANGE
C
C PURPOSE
C TO READ A KEY RECORD FROM MOS-2000 EXTERNAL DIRECT ACCESS
C FILE SYSTEM. THE LOGICAL RECORD CAN SPAN MORE THAN ONE
C PHYSICAL RECORD. CALLED BY FLOPNM, WRTDLM, AND RDTDLM.
C
C DATA SET USE
C KFILDO - UNIT NUMBER FOR OUTPUT (PRINT) FILE. (OUTPUT)
C KFILX - UNIT NUMBER FOR MOS-2000 FILE. (INPUT)
C
C VARIABLES
C
C KFILDO = UNIT NUMBER FOR OUTPUT (PRINT) FILE. (INPUT)
C KFILX = UNIT NUMBER FOR MOS-2000 FILE. (INPUT)
C JREC = RECORD NUMBER OF 1ST PHYSICAL RECORD
C TO READ FROM FILE NUMBER KFILX. (INPUT)
C NOPREC(J) = 6 WORDS (J=1,6) USED BY THE FILE SYSTEM. WORDS
C 3, 5, AND 6 ARE WRITTEN AS PART OF THE KEY RECORD.
C THE WORDS ARE:
C 1 = IS THE KEY RECORD IN KEYREC( , , )? IF NOT,
C THIS VALUE IS ZERO. OTHERWISE, LOCATION
C IN KEYREC( , ,N) OF THE KEY RECORD, RANGE OF
C 1 TO MAXOPN.
C 2 = LOCATION OF THIS KEY RECORD IN THE FILE.
C SET = JREC.
C 3 = NUMBER OF SLOTS FILLED IN THIS KEY.
C 4 = INDICATES WHETHER (1) OR NOT (0) THE KEY
C RECORD HAS BEEN MODIFIED AND NEEDS TO BE
C WRITTEN. ZERO INITIALLY.
C 5 = NUMBER OF PHYSICAL RECORDS IT TAKES TO HOLD
C THIS LOGICAL KEY RECORD. THIS IS FILLED BY
C WRKEYM.
C 6 = THE RECORD NUMBER OF THE NEXT KEY RECORD IN
C THE FILE. EQUALS 99999999 WHEN THIS IS THE
C LAST KEY RECORD IN THE FILE.
C (INPUT-OUTPUT)
C KEYREC(J) = NWDS WILL BE READ INTO KEYREC(J), (J=1,NWDS).
c (OUTPUT)
C NWDS = SIZE OF KEY RECORD, SANS THE LEADING 3 WORDS.
C SEE KEYREC( ). (INPUT)
C NW = THE MAXIMUM NUMBER OF ENTRIES IN ANY KEY RECORD
C BEING USED IN THIS RUN. (INPUT)
C KSIZE = SIZE OF PHYSICAL RECORD IN WORDS OF THIS FILE.
C ASSUMED TO BE GE 3. (INPUT)
C CFROM = 6 CHARACTERS TO IDENTIFY CALLING PROGRAM.
C (CHARACTER*6) (INPUT)
C IER = STATUS RETURN.
C 0 = GOOD RETURN.
C 152 = RECORD NUMBER OF PHYSICAL RECORD SIZE
C INCORRECT.
C 154 = SPACE FOR KEY RECORD NOT LARGE ENOUGH
C TO ACCOMMODATE FULL RECORDS FROM THE
C DIRECT ACCESS FILE SYSTEM.
C OTHER VALUES FROM SYSTEM.
C (OUTPUT)
C IOS = STATUS OF FILE ACCESS. (INTERNAL)
C STATE = VARIABLE USED IN DIAGNOSTIC TO TELL WHICH
C READ STATEMENT CAUSED AN ERROR. (CHARACTER*4)
C (INTERNAL)
C NWW = THE VALUE NW NEEDS TO BE TO READ THIS KEY RECORD,
C WHEN NW IS TOO SMALL. (INTERNAL)
C
C NONSYSTEM SUBROUTINES CALLED
C TDLPRM (/D ONLY)
C
CHARACTER*4 STATE
CHARACTER*6 CFROM
C
DIMENSION NOPREC(6),KEYREC(NWDS)
C
CD WRITE(KFILDO,120)CFROM,KFILX,JREC,NWDS,KSIZE
CD120 FORMAT(' ENTER RDKEYM FROM'2XA6,' KFILX ='I3,' JREC ='I5,
CD 1 ' NWDS ='I5,' KSIZE ='I5)
C
IER=0
C
IF(JREC.LE.0.OR.
1 KSIZE.LE.0)THEN
WRITE(KFILDO,110)JREC,KSIZE,KFILX,CFROM
110 FORMAT(/,' ****EITHER THE RECORD NUMBER = ',I4,
1 ' OR THE PHYSICAL RECORD SIZE =',I7,
2 ' IS IN ERROR IN RDKDYM FOR UNIT NO.',I3,'.',/,
3 ' RDKEYM CALLED FROM ',A6)
IER=152
GO TO 902
C
ENDIF
C
C CHECK TO SEE WHETHER THERE IS ROOM IN KEYREC( ) FOR THE
C VALUES TO BE READ.
C
IF(NWDS.GT.NW*6)THEN
NWW=(NWDS+5)/6
WRITE(KFILDO,112)NW,NWW
112 FORMAT(/' ****INSUFFICIENT SPACE IN KEYREC( ,NW, ) FOR',
1 ' MAXIMUM NUMBER OF KEYS IN THE KEY RECORD',
2 ' TO READ.'/
3 ' INCREASE NW FROM',I4,' TO',I4,
4 ' IN FLOPNM, RDTDLM, WRTDLM, CLFILM, AND TDLPRM.')
IER=154
GO TO 902
ENDIF
C
125 NOPREC(2)=JREC
C
C READ THE LOGICAL RECORD IN PHYSICAL RECORDS
C OF NWDS OR LESS.
C
NREMIN=NWDS
NEND=MIN(KSIZE-3,NWDS)
STATE='130 '
READ(KFILX,REC=JREC,IOSTAT=IOS,ERR=900)
1 NOPREC(3),NOPREC(5),NOPREC(6),(KEYREC(J),J=1,NEND)
NREMIN=NREMIN-NEND
CD WRITE(KFILDO,129)NWDS,KSIZE,NREMIN,NEND
CD129 FORMAT(/' AT 130 IN RDKEYM,NWDS,KSIZE,NREMIN,NEND'4I7)
IF(NOPREC(5).EQ.1)GO TO 150
C
136 DO 140 K=1,NOPREC(5)-1
C ABOVE STATEMENT CHANGED FROM [K=2,NOPRED(5)]
C AUGUST 28, 1998.
NSTART=K*KSIZE-3+1
NEND=NSTART-1+MIN(KSIZE,NREMIN)
STATE='140 '
READ(KFILX,REC=JREC+K,IOSTAT=IOS,ERR=900)
1 (KEYREC(J),J=NSTART,NEND)
NREMIN=NREMIN-KSIZE
CD WRITE(KFILDO,139)NWDS,KSIZE,NREMIN,NEND
CD139 FORMAT(/' AT 140 IN RDKEYM,NWDS,KSIZE,NREMIN,NEND'4I7)
140 CONTINUE
C
150 CONTINUE
CD CALL TDLPRM(KFILDO,'RDKEYM ')
CD WRITE(KFILDO,155)CFROM,NOPREC,KEYREC
CD155 FORMAT(' EXIT RDKEYM FROM'2XA6,' NOPREC ='6I5/
CD 1 (1X6I10))
GO TO 902
C
900 WRITE(KFILDO,901)KFILX,STATE,CFROM,IOS
901 FORMAT(/,' ****TROUBLE READING KEY RECORD ON UNIT NO. ',I3,
1 ' AT STATEMENT ',A4,' IN RDKEYM FROM ',A6,
2 '. IOSTAT = ',I4)
IER=IOS
C
902 RETURN
C
END
| eengl/pytdlpack | tdlpack/rdkeym.f | FORTRAN | gpl-3.0 | 6,499 |
/*
* Copyright 2007-2014 Katholieke Universiteit Leuven
*
* Use of this software is governed by the GNU LGPLv3.0 license
*
* Written by Broes De Cat and Maarten Marien, K.U.Leuven, Departement
* Computerwetenschappen, Celestijnenlaan 200A, B-3001 Leuven, Belgium
*/
#include "external/ConstraintVisitor.hpp"
#include "utils/Print.hpp"
using namespace std;
using namespace MinisatID;
template<typename S>
void MinisatID::printList(const litlist& list, const std::string& concat, S& stream, LiteralPrinter* solver) {
bool begin = true;
for (auto i = list.cbegin(); i < list.cend(); ++i) {
if (not begin) {
stream << concat;
}
begin = false;
stream << toString(*i, solver);
}
}
template void MinisatID::printList(const litlist&, const std::string&, std::ostream&, LiteralPrinter*);
| broesdecat/Minisatid | src/constraintvisitors/ConstraintVisitor.cpp | C++ | gpl-3.0 | 803 |
<?php
if(!defined('sugarEntry') || !sugarEntry) die('Not A Valid Entry Point');
/*********************************************************************************
* SugarCRM is a customer relationship management program developed by
* SugarCRM, Inc. Copyright (C) 2004 - 2009 SugarCRM Inc.
*
* This program is free software; you can redistribute it and/or modify it under
* the terms of the GNU General Public License version 3 as published by the
* Free Software Foundation with the addition of the following permission added
* to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED WORK
* IN WHICH THE COPYRIGHT IS OWNED BY SUGARCRM, SUGARCRM DISCLAIMS THE WARRANTY
* OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License along with
* this program; if not, see http://www.gnu.org/licenses or write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301 USA.
*
* You can contact SugarCRM, Inc. headquarters at 10050 North Wolfe Road,
* SW2-130, Cupertino, CA 95014, USA. or at email address contact@sugarcrm.com.
*
* The interactive user interfaces in modified source and object code versions
* of this program must display Appropriate Legal Notices, as required under
* Section 5 of the GNU General Public License version 3.
*
* In accordance with Section 7(b) of the GNU General Public License version 3,
* these Appropriate Legal Notices must retain the display of the "Powered by
* SugarCRM" logo. If the display of the logo is not reasonably feasible for
* technical reasons, the Appropriate Legal Notices must display the words
* "Powered by SugarCRM".
********************************************************************************/
require_once('modules/DynamicFields/DynamicField.php');
$module = $_REQUEST['module_name'];
$custom_fields = new DynamicField($module);
if(!empty($module)){
$class_name = $beanList[$module];
$class_file = $class_name;
if($class_file == 'aCase'){
$class_file = 'Case';
}
require_once("modules/$module/$class_file.php");
$mod = new $class_name();
$custom_fields->setup($mod);
}else{
echo "\nNo Module Included Could Not Save";
}
$name = $_REQUEST['field_label'];
$options = '';
if($_REQUEST['field_type'] == 'enum'){
$options = $_REQUEST['options'];
}
$default_value = '';
$custom_fields->addField($name,$name, $_REQUEST['field_type'],'255','optional', $default_value, $options, '', '' );
$html = $custom_fields->getFieldHTML($name, $_REQUEST['file_type']);
set_register_value('dyn_layout', 'field_counter', $_REQUEST['field_count']);
$label = $custom_fields->getFieldLabelHTML($name, $_REQUEST['field_type']);
require_once('modules/DynamicLayout/AddField.php');
$af = new AddField();
$af->add_field($name, $html,$label, 'window.opener.');
echo $af->get_script('window.opener.');
echo "\n<script>window.close();</script>";
?>
| mitani/dashlet-subpanels | modules/DynamicFields/Save.php | PHP | gpl-3.0 | 3,204 |
# How to build and run CoCeSo using docker
This is a guide to waive the installation of dependencies and using docker instead.
Inspect the scripts in this directory for the actual shell commands. Later,
let's use docker compose.
## Requirements
* Server
* Docker engine
* Client
* Web Browser (full features only in Mozilla Firefox and Google Chrome tested)
## Build the project using a maven container
NOTE: The result differs from the pristine build in two ways.
* It uses hard-coded database credentials - INSECURE.
* It does not compile the radio plugin because of missing dependencies.
These steps build the deployable .war-file and two docker images.
* Copy `main/view/src/main/webapp/WEB-INF/classes/coceso.properties.docker` to `coceso.properties` in that directory.
* `./build_war` builds the deployable; optional parameters are
* `./build_war_cached` (alternative command) keeps the cache after building for faster re-builds.
* `-Drequirejs.optimize.skip=true` skips lengthy uglify (requires `debug=true` in the properties).
* `clean` removes artefacts before compiling and packaging.
* `./build_app` builds `coceso-app`.
* `./build_db` builds `coceso-db`.
## Deployment
Run the following commands. Coceso is then available at http://localhost:8080.
docker network create coceso
docker run -d --network coceso --name coceso-db coceso-db
docker run -d --rm --network coceso -p 8080:8080 --name coceso-app coceso-app
Note that you likely want to keep the container `coceso-db`, but not necessarily `coceso-app`.
| wrk-fmd/CoCeSo | docker/README.md | Markdown | gpl-3.0 | 1,544 |
Steps to build
1. Install node
2. Install python 2.7
3. `npm install -g node-gyp`
4. `npm install`
5. Run this to download node-gyp dist for electron (ignore errors due to the missing binding.gyp file)
`node-gyp configure --target=0.33.7 --arch=x64 --dist-url=https://atom.io/download/atom-shell`
6. Set "ElectronGypHome" env var to where the node-gyp dist for electron was installed, e.g. C:\Users\Volodymyr\.node-gyp\0.33.7
7. Now you can build the project in MSVC normally
| Volodymyr-K/Skwarka | Source/NodeAPI/readme.md | Markdown | gpl-3.0 | 477 |
package greymerk.roguelike.treasure.loot;
import java.util.HashMap;
import java.util.Map;
import greymerk.roguelike.util.IWeighted;
import net.minecraft.item.ItemStack;
public class LootProvider implements ILoot {
Map<Integer, LootSettings> loot;
public LootProvider(){
loot = new HashMap<Integer, LootSettings>();
}
public void put(int level, LootSettings settings){
loot.put(level, settings);
}
@Override
public IWeighted<ItemStack> get(Loot type, int level){
if(level < 0)return loot.get(0).get(type);
if(level > 4)return loot.get(4).get(type);
return loot.get(level).get(type);
}
}
| Greymerk/minecraft-roguelike | src/main/java/greymerk/roguelike/treasure/loot/LootProvider.java | Java | gpl-3.0 | 614 |
.importListExclusion {
display: flex;
align-items: stretch;
margin-bottom: 10px;
height: 30px;
border-bottom: 1px solid $borderColor;
line-height: 30px;
}
.artistName {
flex: 0 0 300px;
}
.foreignId {
flex: 0 0 400px;
}
.actions {
display: flex;
justify-content: flex-end;
flex: 1 0 auto;
padding-right: 10px;
}
| lidarr/Lidarr | frontend/src/Settings/ImportLists/ImportListExclusions/ImportListExclusion.css | CSS | gpl-3.0 | 339 |
package com.lawek;
public class Copain {
public String name;
public String ip;
}
| mlkdru/nyloc | src/main/java/com/lawek/Copain.java | Java | gpl-3.0 | 85 |
//------------------------------------------------------------------------------
// <auto-generated>
// This code was generated by a tool.
// Runtime Version:4.0.30319.269
//
// Changes to this file may cause incorrect behavior and will be lost if
// the code is regenerated.
// </auto-generated>
//------------------------------------------------------------------------------
namespace Automate.Properties
{
/// <summary>
/// A strongly-typed resource class, for looking up localized strings, etc.
/// </summary>
// This class was auto-generated by the StronglyTypedResourceBuilder
// class via a tool like ResGen or Visual Studio.
// To add or remove a member, edit your .ResX file then rerun ResGen
// with the /str option, or rebuild your VS project.
[global::System.CodeDom.Compiler.GeneratedCodeAttribute("System.Resources.Tools.StronglyTypedResourceBuilder", "4.0.0.0")]
[global::System.Diagnostics.DebuggerNonUserCodeAttribute()]
[global::System.Runtime.CompilerServices.CompilerGeneratedAttribute()]
internal class Resources
{
private static global::System.Resources.ResourceManager resourceMan;
private static global::System.Globalization.CultureInfo resourceCulture;
[global::System.Diagnostics.CodeAnalysis.SuppressMessageAttribute("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
internal Resources()
{
}
/// <summary>
/// Returns the cached ResourceManager instance used by this class.
/// </summary>
[global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]
internal static global::System.Resources.ResourceManager ResourceManager
{
get
{
if ((resourceMan == null))
{
global::System.Resources.ResourceManager temp = new global::System.Resources.ResourceManager("Automate.Properties.Resources", typeof(Resources).Assembly);
resourceMan = temp;
}
return resourceMan;
}
}
/// <summary>
/// Overrides the current thread's CurrentUICulture property for all
/// resource lookups using this strongly typed resource class.
/// </summary>
[global::System.ComponentModel.EditorBrowsableAttribute(global::System.ComponentModel.EditorBrowsableState.Advanced)]
internal static global::System.Globalization.CultureInfo Culture
{
get
{
return resourceCulture;
}
set
{
resourceCulture = value;
}
}
}
}
| rhysthomas250/Automate | Automate/Properties/Resources.Designer.cs | C# | gpl-3.0 | 2,773 |
//------------------------------------------------------------------------------
// <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 Abide.HaloLibrary.Halo2.Retail.Tag.Generated
{
using System;
using Abide.HaloLibrary;
using Abide.HaloLibrary.Halo2.Retail.Tag;
/// <summary>
/// Represents the generated environment_object_nodes tag block.
/// </summary>
internal sealed class EnvironmentObjectNodes : Block
{
/// <summary>
/// Initializes a new instance of the <see cref="EnvironmentObjectNodes"/> class.
/// </summary>
public EnvironmentObjectNodes()
{
this.Fields.Add(new ShortIntegerField("reference frame index"));
this.Fields.Add(new CharIntegerField("projection axis"));
this.Fields.Add(new ByteFlagsField("projection sign", "projection sign"));
}
/// <summary>
/// Gets and returns the name of the environment_object_nodes tag block.
/// </summary>
public override string BlockName
{
get
{
return "environment_object_nodes";
}
}
/// <summary>
/// Gets and returns the display name of the environment_object_nodes tag block.
/// </summary>
public override string DisplayName
{
get
{
return "environment_object_nodes";
}
}
/// <summary>
/// Gets and returns the maximum number of elements allowed of the environment_object_nodes tag block.
/// </summary>
public override int MaximumElementCount
{
get
{
return 255;
}
}
/// <summary>
/// Gets and returns the alignment of the environment_object_nodes tag block.
/// </summary>
public override int Alignment
{
get
{
return 4;
}
}
}
}
| MikeMatt16/Abide | Abide Halo Library/Abide.HaloLibrary/Halo2/Retail/Tag/Generated/EnvironmentObjectNodes.Generated.cs | C# | gpl-3.0 | 2,287 |
/*
* OpenSplice DDS
*
* This software and documentation are Copyright 2006 to 2013 PrismTech
* Limited and its licensees. All rights reserved. See file:
*
* $OSPL_HOME/LICENSE
*
* for full copyright notice and license terms.
*
*/
package org.opensplice.cm.qos;
import org.opensplice.cm.Time;
/**
* Represents the set of policies that apply to a Message.
* @date Mar 29, 2005
*/
public class MessageQoS {
private static final int MQ_BYTE0_RELIABILITY_OFFSET = 0;
private static final int MQ_BYTE0_OWNERSHIP_OFFSET = 1;
private static final int MQ_BYTE0_ORDERBY_OFFSET = 2;
private static final int MQ_BYTE0_AUTODISPOSE_OFFSET = 3;
private static final int MQ_BYTE0_LATENCY_OFFSET = 4;
private static final int MQ_BYTE0_DEADLINE_OFFSET = 5;
private static final int MQ_BYTE0_LIVELINESS_OFFSET = 6;
private static final int MQ_BYTE0_LIFESPAN_OFFSET = 7;
private static final int MQ_BYTE1_DURABILITY_OFFSET = 0;
private static final int MQ_BYTE1_LIVELINESS_OFFSET = 2;
private static final int MQ_BYTE1_PRESENTATION_OFFSET = 4;
private static final int MQ_BYTE1_ORDERED_ACCESS_OFFSET = 6;
private static final int MQ_BYTE1_COHERENT_ACCESS_OFFSET = 7;
private static final int MQ_BYTE0_RELIABILITY_MASK = (0x01);
private static final int MQ_BYTE0_OWNERSHIP_MASK = (0x02);
private static final int MQ_BYTE0_ORDERBY_MASK = (0x04);
private static final int MQ_BYTE0_AUTODISPOSE_MASK = (0x08);
private static final int MQ_BYTE0_LATENCY_MASK = (0x10);
private static final int MQ_BYTE0_DEADLINE_MASK = (0x20);
private static final int MQ_BYTE0_LIVELINESS_MASK = (0x40);
private static final int MQ_BYTE0_LIFESPAN_MASK = (0x80);
private static final int MQ_BYTE1_DURABILITY_MASK = (0x03);
private static final int MQ_BYTE1_LIVELINESS_MASK = (0x0c);
private static final int MQ_BYTE1_PRESENTATION_MASK = (0x30);
private static final int MQ_BYTE1_ORDERED_ACCESS_MASK = (0x40);
private static final int MQ_BYTE1_COHERENT_ACCESS_MASK = (0x80);
private int[] value;
private int curElement = 0;
public MessageQoS(int[] value){
this.value = new int[value.length];
for(int i=0; i<value.length; i++){
this.value[i] = value[i];
}
this.curElement = 0;
}
public int[] getValue(){
int[] result = new int[this.value.length];
for(int i=0; i<value.length; i++){
result[i] = this.value[i];
}
return result;
}
public void addElement(int e){
if(curElement < value.length){
value[curElement++] = e;
}
}
private int lshift(int value, int offset){
return (value << offset);
}
private int rshift(int value, int offset){
return (value >> offset);
}
/**
* Provides access to reliability.
*
* @return Returns the reliability.
*/
public ReliabilityKind getReliabilityKind() {
ReliabilityKind reliability;
if(this.value.length > 0){
int rel = rshift(
(value[0] & MQ_BYTE0_RELIABILITY_MASK),
MQ_BYTE0_RELIABILITY_OFFSET);
if(rel == 0){
reliability = ReliabilityKind.from_int(
ReliabilityKind._BESTEFFORT);
} else {
reliability = ReliabilityKind.from_int(
ReliabilityKind._RELIABLE);
}
} else {
reliability = ReliabilityKind.from_int(ReliabilityKind._BESTEFFORT);
}
return reliability;
}
public MessageQoS copy(){
MessageQoS qos = new MessageQoS(this.value);
qos.curElement = this.curElement;
return qos;
}
}
| SanderMertens/opensplice | src/api/cm/java/code/org/opensplice/cm/qos/MessageQoS.java | Java | gpl-3.0 | 4,095 |
/**
* This file is part of alf.io.
*
* alf.io is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* alf.io is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with alf.io. If not, see <http://www.gnu.org/licenses/>.
*/
package alfio.manager.support;
import ch.digitalfondue.npjt.ConstructorAnnotationRowMapper.Column;
import lombok.Getter;
import java.util.Date;
@Getter
public class CheckInStatistics {
private final int totalAttendees;
private final int checkedIn;
private final long lastUpdate;
public CheckInStatistics(@Column("total_attendees") Integer totalAttendees,
@Column("checked_in") Integer checkedIn,
@Column("last_update") Date lastUpdate) {
this.totalAttendees = totalAttendees;
this.checkedIn = checkedIn;
this.lastUpdate = lastUpdate.getTime();
}
}
| exteso/alf.io | src/main/java/alfio/manager/support/CheckInStatistics.java | Java | gpl-3.0 | 1,327 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!--NewPage-->
<HTML>
<HEAD>
<TITLE>
Uses of Package com.google.gwt.core.linker (Google Web Toolkit Javadoc)
</TITLE>
<LINK REL ="stylesheet" TYPE="text/css" HREF="../../../../../stylesheet.css" TITLE="Style">
<SCRIPT type="text/javascript">
function windowTitle()
{
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="Uses of Package com.google.gwt.core.linker (Google Web Toolkit Javadoc)";
}
}
</SCRIPT>
<NOSCRIPT>
</NOSCRIPT>
</HEAD>
<BODY BGCOLOR="white" onload="windowTitle();">
<HR>
<!-- ========= START OF TOP NAVBAR ======= -->
<A NAME="navbar_top"><!-- --></A>
<A HREF="#skip-navbar_top" title="Skip navigation links"></A>
<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY="">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_top_firstrow"><!-- --></A>
<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">
<TR ALIGN="center" VALIGN="top">
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <FONT CLASS="NavBarFont1">Class</FONT> </TD>
<TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Use</B></FONT> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
</TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
GWT 2.4.0</EM>
</TD>
</TR>
<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
PREV
NEXT</FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../../../../../index.html?com/google/gwt/core/linker/package-use.html" target="_top"><B>FRAMES</B></A>
<A HREF="package-use.html" target="_top"><B>NO FRAMES</B></A>
<SCRIPT type="text/javascript">
<!--
if(window==top) {
document.writeln('<A HREF="../../../../../allclasses-noframe.html"><B>All Classes</B></A>');
}
//-->
</SCRIPT>
<NOSCRIPT>
<A HREF="../../../../../allclasses-noframe.html"><B>All Classes</B></A>
</NOSCRIPT>
</FONT></TD>
</TR>
</TABLE>
<A NAME="skip-navbar_top"></A>
<!-- ========= END OF TOP NAVBAR ========= -->
<HR>
<CENTER>
<H2>
<B>Uses of Package<br>com.google.gwt.core.linker</B></H2>
</CENTER>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2">
Packages that use <A HREF="../../../../../com/google/gwt/core/linker/package-summary.html">com.google.gwt.core.linker</A></FONT></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><A HREF="#com.google.gwt.core.linker"><B>com.google.gwt.core.linker</B></A></TD>
<TD>A package containing implementations of the GWT bootstrap linkers. </TD>
</TR>
</TABLE>
<P>
<A NAME="com.google.gwt.core.linker"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2">
Classes in <A HREF="../../../../../com/google/gwt/core/linker/package-summary.html">com.google.gwt.core.linker</A> used by <A HREF="../../../../../com/google/gwt/core/linker/package-summary.html">com.google.gwt.core.linker</A></FONT></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><B><A HREF="../../../../../com/google/gwt/core/linker/class-use/CrossSiteIframeLinker.html#com.google.gwt.core.linker"><B>CrossSiteIframeLinker</B></A></B>
<BR>
This linker uses an iframe to hold the code and a script tag to download the
code.</TD>
</TR>
</TABLE>
<P>
<HR>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<A NAME="navbar_bottom"><!-- --></A>
<A HREF="#skip-navbar_bottom" title="Skip navigation links"></A>
<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY="">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A>
<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">
<TR ALIGN="center" VALIGN="top">
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <FONT CLASS="NavBarFont1">Class</FONT> </TD>
<TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Use</B></FONT> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
</TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
GWT 2.4.0</EM>
</TD>
</TR>
<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
PREV
NEXT</FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../../../../../index.html?com/google/gwt/core/linker/package-use.html" target="_top"><B>FRAMES</B></A>
<A HREF="package-use.html" target="_top"><B>NO FRAMES</B></A>
<SCRIPT type="text/javascript">
<!--
if(window==top) {
document.writeln('<A HREF="../../../../../allclasses-noframe.html"><B>All Classes</B></A>');
}
//-->
</SCRIPT>
<NOSCRIPT>
<A HREF="../../../../../allclasses-noframe.html"><B>All Classes</B></A>
</NOSCRIPT>
</FONT></TD>
</TR>
</TABLE>
<A NAME="skip-navbar_bottom"></A>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
<HR>
</BODY>
</HTML>
| dandrocec/PaaSInterop | SemanticCloudClient/build/web/WEB-INF/lib/doc/javadoc/com/google/gwt/core/linker/package-use.html | HTML | gpl-3.0 | 6,892 |
<!DOCTYPE html>
<html xml:lang="en-GB" lang="en-GB" xmlns="http://www.w3.org/1999/xhtml">
<head lang="en-GB">
<title>Ross Gammon’s Family Tree - HODGETTS, Henry (Tim)</title>
<meta charset="UTF-8" />
<meta name ="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=1" />
<meta name ="apple-mobile-web-app-capable" content="yes" />
<meta name="generator" content="Gramps 4.2.8 http://gramps-project.org/" />
<meta name="author" content="" />
<link href="../../../images/favicon2.ico" rel="shortcut icon" type="image/x-icon" />
<link href="../../../css/narrative-screen.css" media="screen" rel="stylesheet" type="text/css" />
<link href="../../../css/narrative-print.css" media="print" rel="stylesheet" type="text/css" />
<link href="../../../css/ancestortree.css" media="screen" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="header">
<h1 id="SiteTitle">Ross Gammon’s Family Tree</h1>
</div>
<div class="wrapper" id="nav" role="navigation">
<div class="container">
<ul class="menu" id="dropmenu">
<li class = "CurrentSection"><a href="../../../individuals.html" title="Individuals">Individuals</a></li>
<li><a href="../../../index.html" title="Surnames">Surnames</a></li>
<li><a href="../../../families.html" title="Families">Families</a></li>
<li><a href="../../../events.html" title="Events">Events</a></li>
<li><a href="../../../places.html" title="Places">Places</a></li>
<li><a href="../../../sources.html" title="Sources">Sources</a></li>
<li><a href="../../../repositories.html" title="Repositories">Repositories</a></li>
<li><a href="../../../media.html" title="Media">Media</a></li>
<li><a href="../../../thumbnails.html" title="Thumbnails">Thumbnails</a></li>
</ul>
</div>
</div>
<div class="content" id="IndividualDetail">
<h3>HODGETTS, Henry (Tim)<sup><small></small></sup></h3>
<div id="summaryarea">
<table class="infolist">
<tr>
<td class="ColumnAttribute">Birth Name</td>
<td class="ColumnValue">
HODGETTS, Henry (Tim) <a href="#sref1a">1a</a>
</td>
</tr>
<tr>
<td class="ColumnAttribute">Gramps ID</td>
<td class="ColumnValue">I6140</td>
</tr>
<tr>
<td class="ColumnAttribute">Gender</td>
<td class="ColumnValue">male</td>
</tr>
<tr>
<td class="ColumnAttribute">Age at Death</td>
<td class="ColumnValue">91 years, 6 months, 12 days</td>
</tr>
</table>
</div>
<div class="subsection" id="events">
<h4>Events</h4>
<table class="infolist eventlist">
<thead>
<tr>
<th class="ColumnEvent">Event</th>
<th class="ColumnDate">Date</th>
<th class="ColumnPlace">Place</th>
<th class="ColumnDescription">Description</th>
<th class="ColumnNotes">Notes</th>
<th class="ColumnSources">Sources</th>
</tr>
</thead>
<tbody>
<tr>
<td class="ColumnEvent">
<a href="../../../evt/0/a/d15f5ffff03505e6db07220efa0.html" title="Birth">
Birth
<span class="grampsid"> [E6749]</span>
</a>
</td>
<td class="ColumnDate">1908-01-28</td>
<td class="ColumnPlace">
<a href="../../../plc/d/8/d15f5fe309670fbb5c14c2f668d.html" title="">
</a>
</td>
<td class="ColumnDescription"> </td>
<td class="ColumnNotes">
<div>
</div>
</td>
<td class="ColumnSources">
</td>
</tr>
<tr>
<td class="ColumnEvent">
<a href="../../../evt/a/f/d15f5ffff0d5775e936800cdffa.html" title="Death">
Death
<span class="grampsid"> [E6750]</span>
</a>
</td>
<td class="ColumnDate">1999-08-09</td>
<td class="ColumnPlace">
<a href="../../../plc/d/8/d15f5fe309670fbb5c14c2f668d.html" title="">
</a>
</td>
<td class="ColumnDescription"> </td>
<td class="ColumnNotes">
<div>
</div>
</td>
<td class="ColumnSources">
</td>
</tr>
</tbody>
</table>
</div>
<div class="subsection" id="parents">
<h4>Parents</h4>
<table class="infolist">
<thead>
<tr>
<th class="ColumnAttribute">Relation to main person</th>
<th class="ColumnValue">Name</th>
<th class="ColumnValue">Relation within this family (if not by birth)</th>
</tr>
</thead>
<tbody>
</tbody>
<tr>
<td class="ColumnAttribute">Father</td>
<td class="ColumnValue">
<a href="../../../ppl/a/b/d15f5fff7c16d896e6e83d4eaba.html">HODGETTS, Patrick James (Charles)<span class="grampsid"> [I6100]</span></a>
</td>
</tr>
<tr>
<td class="ColumnAttribute">Mother</td>
<td class="ColumnValue">
<a href="../../../ppl/c/2/d15f5fff8075f5060ff5bbf612c.html">JOHNSTONE, Susan<span class="grampsid"> [I6101]</span></a>
</td>
</tr>
<tr>
<td class="ColumnAttribute"> Brother</td>
<td class="ColumnValue"> <a href="../../../ppl/1/5/d15f5fff86130a0ad155e7e2351.html">HODGETTS, John<span class="grampsid"> [I6102]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Brother</td>
<td class="ColumnValue"> <a href="../../../ppl/b/7/d15f5fff8c840e4f97712e4de7b.html">HODGETTS, Thomas James<span class="grampsid"> [I6104]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Brother</td>
<td class="ColumnValue"> <a href="../../../ppl/d/c/d15f5fff9972a50050df728a1cd.html">HODGETTS, Charles<span class="grampsid"> [I6108]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Sister</td>
<td class="ColumnValue"> <a href="../../../ppl/9/1/d15f5fffaae21048dad81399019.html">HODGETTS, Eliza Jane (Ida)<span class="grampsid"> [I6116]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Brother</td>
<td class="ColumnValue"> <a href="../../../ppl/1/a/d15f5fffb5c5456b83697493da1.html">HODGETTS, Arthur<span class="grampsid"> [I6120]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Brother</td>
<td class="ColumnValue"> <a href="../../../ppl/1/2/d15f5fffb9218775175ca93be21.html">HODGETTS, Samuel<span class="grampsid"> [I6121]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Sister</td>
<td class="ColumnValue"> <a href="../../../ppl/5/1/d15f5fffbbe1b5accbaaa6ded15.html">HODGETTS, Elizabeth<span class="grampsid"> [I6122]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Brother</td>
<td class="ColumnValue"> <a href="../../../ppl/d/1/d15f5fffc0f6aba426affc1d91d.html">HODGETTS, Frederick<span class="grampsid"> [I6123]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Brother</td>
<td class="ColumnValue"> <a href="../../../ppl/4/c/d15f5fffc5a456e18d40c8ed7c4.html">HODGETTS, Frank<span class="grampsid"> [I6124]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> Brother</td>
<td class="ColumnValue"> <a href="../../../ppl/6/c/d15f5fffe643dad39775406adc6.html">HODGETTS, Walter<span class="grampsid"> [I6136]</span></a></td>
<td class="ColumnValue"></td>
</tr>
<tr>
<td class="ColumnAttribute"> </td>
<td class="ColumnValue"> <a href="../../../ppl/f/9/d15f5fffefb433a2f839ba27f9f.html">HODGETTS, Henry (Tim)<span class="grampsid"> [I6140]</span></a></td>
<td class="ColumnValue"></td>
</tr>
</table>
</div>
<div class="subsection" id="families">
<h4>Families</h4>
<table class="infolist">
<tr class="BeginFamily">
<td class="ColumnType"> </td>
<td class="ColumnAttribute"> </td>
<td class="ColumnValue"><a href="../../../fam/4/d/d15f5ffff251e64f94d250dcbd4.html" title="Family of HODGETTS, Henry (Tim) and SUMMER, Edith Isabel (Belle)">Family of HODGETTS, Henry (Tim) and SUMMER, Edith Isabel (Belle)<span class="grampsid"> [F2031]</span></a></td>
</tr>
<tr class="BeginFamily">
<td class="ColumnType">Unknown</td>
<td class="ColumnAttribute">Partner</td>
<td class="ColumnValue">
<a href="../../../ppl/5/d/d15f5ffff3e1004bd450b5476d5.html">SUMMER, Edith Isabel (Belle)<span class="grampsid"> [I6141]</span></a>
</td>
</tr>
<tr>
<td class="ColumnType"> </td>
<td class="ColumnAttribute"> </td>
<td class="ColumnValue">
<table class="infolist eventlist">
<thead>
<tr>
<th class="ColumnEvent">Event</th>
<th class="ColumnDate">Date</th>
<th class="ColumnPlace">Place</th>
<th class="ColumnDescription">Description</th>
<th class="ColumnNotes">Notes</th>
<th class="ColumnSources">Sources</th>
</tr>
</thead>
<tbody>
<tr>
<td class="ColumnEvent">
<a href="../../../evt/7/2/d15f60c8f8a6944706b4e276427.html" title="Family (Primary)">
Family (Primary)
<span class="grampsid"> [E23128]</span>
</a>
</td>
<td class="ColumnDate"> </td>
<td class="ColumnPlace"> </td>
<td class="ColumnDescription"> </td>
<td class="ColumnNotes">
<div>
</div>
</td>
<td class="ColumnSources">
<a href="#sref1b">1b</a>
</td>
</tr>
</tbody>
</table>
</td>
<tr>
<td class="ColumnType"> </td>
<td class="ColumnAttribute">Attributes</td>
<td class="ColumnValue">
<table class="infolist attrlist">
<thead>
<tr>
<th class="ColumnType">Type</th>
<th class="ColumnValue">Value</th>
<th class="ColumnNotes">Notes</th>
<th class="ColumnSources">Sources</th>
</tr>
</thead>
<tbody>
<tr>
<td class="ColumnType">_UID</td>
<td class="ColumnValue">595B4C1E5080704C8C3706EFAB24D6313884</td>
<td class="ColumnNotes"><div></div></td>
<td class="ColumnSources"> </td>
</tr>
</tbody>
</table>
</td>
</tr>
</tr>
</table>
</div>
<div class="subsection" id="attributes">
<h4>Attributes</h4>
<table class="infolist attrlist">
<thead>
<tr>
<th class="ColumnType">Type</th>
<th class="ColumnValue">Value</th>
<th class="ColumnNotes">Notes</th>
<th class="ColumnSources">Sources</th>
</tr>
</thead>
<tbody>
<tr>
<td class="ColumnType">_UID</td>
<td class="ColumnValue">476DC4152367B14FA269434F1E63FA215020</td>
<td class="ColumnNotes"><div></div></td>
<td class="ColumnSources"> </td>
</tr>
</tbody>
</table>
</div>
<div class="subsection" id="pedigree">
<h4>Pedigree</h4>
<ol class="pedigreegen">
<li>
<a href="../../../ppl/a/b/d15f5fff7c16d896e6e83d4eaba.html">HODGETTS, Patrick James (Charles)<span class="grampsid"> [I6100]</span></a>
<ol>
<li class="spouse">
<a href="../../../ppl/c/2/d15f5fff8075f5060ff5bbf612c.html">JOHNSTONE, Susan<span class="grampsid"> [I6101]</span></a>
<ol>
<li>
<a href="../../../ppl/1/5/d15f5fff86130a0ad155e7e2351.html">HODGETTS, John<span class="grampsid"> [I6102]</span></a>
</li>
<li>
<a href="../../../ppl/b/7/d15f5fff8c840e4f97712e4de7b.html">HODGETTS, Thomas James<span class="grampsid"> [I6104]</span></a>
</li>
<li>
<a href="../../../ppl/d/c/d15f5fff9972a50050df728a1cd.html">HODGETTS, Charles<span class="grampsid"> [I6108]</span></a>
</li>
<li>
<a href="../../../ppl/9/1/d15f5fffaae21048dad81399019.html">HODGETTS, Eliza Jane (Ida)<span class="grampsid"> [I6116]</span></a>
</li>
<li>
<a href="../../../ppl/1/a/d15f5fffb5c5456b83697493da1.html">HODGETTS, Arthur<span class="grampsid"> [I6120]</span></a>
</li>
<li>
<a href="../../../ppl/1/2/d15f5fffb9218775175ca93be21.html">HODGETTS, Samuel<span class="grampsid"> [I6121]</span></a>
</li>
<li>
<a href="../../../ppl/5/1/d15f5fffbbe1b5accbaaa6ded15.html">HODGETTS, Elizabeth<span class="grampsid"> [I6122]</span></a>
</li>
<li>
<a href="../../../ppl/d/1/d15f5fffc0f6aba426affc1d91d.html">HODGETTS, Frederick<span class="grampsid"> [I6123]</span></a>
</li>
<li>
<a href="../../../ppl/4/c/d15f5fffc5a456e18d40c8ed7c4.html">HODGETTS, Frank<span class="grampsid"> [I6124]</span></a>
</li>
<li>
<a href="../../../ppl/6/c/d15f5fffe643dad39775406adc6.html">HODGETTS, Walter<span class="grampsid"> [I6136]</span></a>
</li>
<li class="thisperson">
HODGETTS, Henry (Tim)
<ol class="spouselist">
<li class="spouse">
<a href="../../../ppl/5/d/d15f5ffff3e1004bd450b5476d5.html">SUMMER, Edith Isabel (Belle)<span class="grampsid"> [I6141]</span></a>
</li>
</ol>
</li>
</ol>
</li>
</ol>
</li>
</ol>
</div>
<div class="subsection" id="tree">
<h4>Ancestors</h4>
<div id="treeContainer" style="width:735px; height:602px;">
<div class="boxbg male AncCol0" style="top: 269px; left: 6px;">
<a class="noThumb" href="../../../ppl/f/9/d15f5fffefb433a2f839ba27f9f.html">
HODGETTS, Henry (Tim)
</a>
</div>
<div class="shadow" style="top: 274px; left: 10px;"></div>
<div class="bvline" style="top: 301px; left: 165px; width: 15px"></div>
<div class="gvline" style="top: 306px; left: 165px; width: 20px"></div>
<div class="boxbg male AncCol1" style="top: 119px; left: 196px;">
<a class="noThumb" href="../../../ppl/a/b/d15f5fff7c16d896e6e83d4eaba.html">
HODGETTS, Patrick James (Charles)
</a>
</div>
<div class="shadow" style="top: 124px; left: 200px;"></div>
<div class="bvline" style="top: 151px; left: 180px; width: 15px;"></div>
<div class="gvline" style="top: 156px; left: 185px; width: 20px;"></div>
<div class="bhline" style="top: 151px; left: 180px; height: 150px;"></div>
<div class="gvline" style="top: 156px; left: 185px; height: 150px;"></div>
<div class="bvline" style="top: 151px; left: 355px; width: 15px"></div>
<div class="gvline" style="top: 156px; left: 355px; width: 20px"></div>
<div class="boxbg male AncCol2" style="top: 44px; left: 386px;">
<a class="noThumb" href="../../../ppl/3/6/d15f5fe30804bbac86bc7508e63.html">
HODGETTS, John
</a>
</div>
<div class="shadow" style="top: 49px; left: 390px;"></div>
<div class="bvline" style="top: 76px; left: 370px; width: 15px;"></div>
<div class="gvline" style="top: 81px; left: 375px; width: 20px;"></div>
<div class="bhline" style="top: 76px; left: 370px; height: 75px;"></div>
<div class="gvline" style="top: 81px; left: 375px; height: 75px;"></div>
<div class="bvline" style="top: 76px; left: 545px; width: 15px"></div>
<div class="gvline" style="top: 81px; left: 545px; width: 20px"></div>
<div class="boxbg male AncCol3" style="top: 7px; left: 576px;">
<a class="noThumb" href="../../../ppl/a/2/d15f5fb9428139f93bda73ad82a.html">
HODGETTS, John
</a>
</div>
<div class="shadow" style="top: 12px; left: 580px;"></div>
<div class="bvline" style="top: 39px; left: 560px; width: 15px;"></div>
<div class="gvline" style="top: 44px; left: 565px; width: 20px;"></div>
<div class="bhline" style="top: 39px; left: 560px; height: 37px;"></div>
<div class="gvline" style="top: 44px; left: 565px; height: 37px;"></div>
<div class="boxbg female AncCol3" style="top: 81px; left: 576px;">
<a class="noThumb" href="../../../ppl/a/1/d15f5fb94512f92441f034a81a.html">
LUCAS, Olivia
</a>
</div>
<div class="shadow" style="top: 86px; left: 580px;"></div>
<div class="bvline" style="top: 113px; left: 560px; width: 15px;"></div>
<div class="gvline" style="top: 118px; left: 565px; width: 20px;"></div>
<div class="bhline" style="top: 76px; left: 560px; height: 37px;"></div>
<div class="gvline" style="top: 81px; left: 565px; height: 37px;"></div>
<div class="boxbg female AncCol2" style="top: 194px; left: 386px;">
<a class="noThumb" href="../../../ppl/a/4/d15f5ffca9bfd227b4dd98934a.html">
BRITT, Catherine
</a>
</div>
<div class="shadow" style="top: 199px; left: 390px;"></div>
<div class="bvline" style="top: 226px; left: 370px; width: 15px;"></div>
<div class="gvline" style="top: 231px; left: 375px; width: 20px;"></div>
<div class="bhline" style="top: 151px; left: 370px; height: 75px;"></div>
<div class="gvline" style="top: 156px; left: 375px; height: 75px;"></div>
<div class="boxbg female AncCol1" style="top: 419px; left: 196px;">
<a class="noThumb" href="../../../ppl/c/2/d15f5fff8075f5060ff5bbf612c.html">
JOHNSTONE, Susan
</a>
</div>
<div class="shadow" style="top: 424px; left: 200px;"></div>
<div class="bvline" style="top: 451px; left: 180px; width: 15px;"></div>
<div class="gvline" style="top: 456px; left: 185px; width: 20px;"></div>
<div class="bhline" style="top: 301px; left: 180px; height: 150px;"></div>
<div class="gvline" style="top: 306px; left: 185px; height: 150px;"></div>
</div>
</div>
<div class="subsection" id="sourcerefs">
<h4>Source References</h4>
<ol>
<li>
<a href="../../../src/2/9/d15f5fe3084138b56d1472a892.html" title="Frank Lee: GEDCOM File : JohnHODGETTS.ged" name ="sref1">
Frank Lee: GEDCOM File : JohnHODGETTS.ged
<span class="grampsid"> [S0243]</span>
</a>
<ol>
<li id="sref1a">
<ul>
<li>
Confidence: Low
</li>
</ul>
</li>
<li id="sref1b">
<ul>
<li>
Confidence: Low
</li>
</ul>
</li>
</ol>
</li>
</ol>
</div>
</div>
<div class="fullclear"></div>
<div id="footer">
<p id="createdate">
Generated by <a href="http://gramps-project.org/">Gramps</a> 4.2.8<br />Last change was the 2015-08-05 19:54:26<br />Created for <a href="../../../ppl/9/e/d15f5fb48902c4fc1b421d249e9.html">GAMMON, Francis</a>
</p>
<p id="copyright">
</p>
</div>
</body>
</html>
| RossGammon/the-gammons.net | RossFamilyTree/ppl/f/9/d15f5fffefb433a2f839ba27f9f.html | HTML | gpl-3.0 | 19,115 |
package cn.nukkit.item;
/**
* author: MagicDroidX
* Nukkit Project
*/
public class StonePickaxe extends Tool {
public StonePickaxe() {
this(0, 1);
}
public StonePickaxe(Integer meta) {
this(meta, 1);
}
public StonePickaxe(Integer meta, int count) {
super(STONE_PICKAXE, meta, count, "Stone Pickaxe");
}
@Override
public int getMaxDurability() {
return Tool.DURABILITY_STONE;
}
@Override
public boolean isPickaxe() {
return true;
}
@Override
public int getTier() {
return Tool.TIER_STONE;
}
}
| LinEvil/Nukkit | src/main/java/cn/nukkit/item/StonePickaxe.java | Java | gpl-3.0 | 610 |
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "DTD/xhtml1-transitional.dtd">
<html xml:lang="en" lang="en">
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<title>F-Spot Cloud Java Edition 0.12-alpha-02 Reference Package fspotcloud.shared.photo</title>
<link rel="stylesheet" type="text/css" href="../../../stylesheet.css" title="style" />
</head>
<body>
<div class="overview">
<ul>
<li>
<a href="../../../overview-summary.html">Overview</a>
</li>
<li class="selected">Package</li>
</ul>
</div>
<div class="framenoframe">
<ul>
<li>
<a href="../../../index.html" target="_top">FRAMES</a>
</li>
<li>
<a href="package-summary.html" target="_top">NO FRAMES</a>
</li>
</ul>
</div>
<h2>Package fspotcloud.shared.photo</h2>
<table class="summary">
<thead>
<tr>
<th>Class Summary</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<a href="PhotoInfo.html" target="classFrame">PhotoInfo</a>
</td>
</tr>
<tr>
<td>
<a href="PhotoInfoStore.html" target="classFrame">PhotoInfoStore</a>
</td>
</tr>
</tbody>
</table>
<div class="overview">
<ul>
<li>
<a href="../../../overview-summary.html">Overview</a>
</li>
<li class="selected">Package</li>
</ul>
</div>
<div class="framenoframe">
<ul>
<li>
<a href="../../../index.html" target="_top">FRAMES</a>
</li>
<li>
<a href="package-summary.html" target="_top">NO FRAMES</a>
</li>
</ul>
</div>
<hr />
Copyright © 2012. All Rights Reserved.
</body>
</html> | slspeek/FSpotCloudSite | xref/fspotcloud/shared/photo/package-summary.html | HTML | gpl-3.0 | 2,093 |
<?php
namespace App\Api\V1\Transformers;
use App\Api\V1\Models\Sleep;
use League\Fractal\TransformerAbstract;
class SleepTransformer extends TransformerAbstract
{
public function transform(Sleep $sleep)
{
return [
'id' => (int) $sleep->id,
'date' => $sleep->date,
'type' => [
'id' => $sleep->sleeptype->id,
'name' => $sleep->sleeptype->name
],
'created_at' => $sleep->created_at,
'updated_at' => $sleep->updated_at
];
}
} | ChibangLW/traindb-api | app/Api/V1/Transformers/SleepTransformer.php | PHP | gpl-3.0 | 556 |
<!DOCTYPE html>
<html class="um landscape min-width-240px min-width-320px min-width-480px min-width-768px min-width-1024px">
<head>
<title></title>
<meta charset="utf-8">
<meta name="viewport"
content="target-densitydpi=device-dpi, width=device-width, initial-scale=1, user-scalable=no, minimum-scale=1.0, maximum-scale=1.0">
<link rel="stylesheet" href="../vendor/appcan-fesdk/css/fonts/font-awesome.min.css">
<link rel="stylesheet" href="../vendor/appcan-fesdk/css/ui-box.css">
<link rel="stylesheet" href="../vendor/appcan-fesdk/css/ui-base.css">
<link rel="stylesheet" href="../vendor/appcan-fesdk/css/ui-color.css">
<link rel="stylesheet" href="../vendor/appcan-fesdk/css/appcan.icon.css">
<link rel="stylesheet" href="../vendor/appcan-fesdk/css/appcan.control.css">
<!---->
<link rel="stylesheet" href="../css/main.css"/>
</head>
<body class="um-vp vp-bg" ontouchstart>
<div id="page_0" class="up ub ub-ver bc-bg" tabindex="0">
<!--header开始-->
<div id="header" class="uh bc-text-head ub bc-head">
<div class="nav-btn" id="nav-left">
<div class="fa fa-angle-left fa-2x ub ub-ac"></div>
</div>
<h1 class="ut ub-f1 ulev-3 ut-s tx-c" tabindex="0">患者详情</h1>
<div class="nav-btn" id="nav-right">
<div class="ub ub-ac u-btn-cx z-disabled">撤消</div>
<div class="ub ub-ac u-btn-fc z-disabled">封存</div>
<div class="ub ub-ac u-btn-bj z-disabled">编辑</div>
</div>
</div>
<!--header结束-->
<!--content开始-->
<div id="content" class="ub-f1 tx-l ">
</div>
<!--content结束-->
</div>
<script src="../vendor/appcan-fesdk/js/appcan.js"></script>
<script src="../vendor/appcan-fesdk/js/appcan.control.js"></script>
<script src="../vendor/simcere/js/config.js"></script>
<script src="../js/lib.js"></script>
<script>
appcan.ready(function () {
var titHeight = $('#header').offset().height;
appcan.frame.open("content", "PatientDetail_content.html", 0, titHeight);
window.onorientationchange = window.onresize = function () {
appcan.frame.resize("content", 0, titHeight);
}
});
//关闭窗口
$('#nav-left').on('tap', function () {
qlib.closeCurrentWindow();
});
$('.u-btn-bj').on('tap', function () {
var patientId = localStorage.getItem('EDZY/PatientDetail.patientId');
localStorage.setItem('EDZY/PatientDetail.patientIdEdit', patientId);
appcan.window.open('EDZY_PatientEdit', 'PatientCreate.html', 0);
});
$('.u-btn-cx').on('tap', function () {
qlib.abortFlow();
});
$('.u-btn-fc').on('tap', function () {
qlib.deleteFlow();
});
</script>
</body>
</html> | Jerryisokay/enduranceDev | phone/html/PatientDetail.html | HTML | gpl-3.0 | 2,783 |
using System.Reflection;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
// 有关程序集的常规信息通过以下
// 特性集控制。更改这些特性值可修改
// 与程序集关联的信息。
[assembly: AssemblyTitle("PureCms.Services")]
[assembly: AssemblyDescription("")]
[assembly: AssemblyConfiguration("")]
[assembly: AssemblyCompany("")]
[assembly: AssemblyProduct("PureCms.Services")]
[assembly: AssemblyCopyright("Copyright © 2015")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
// 将 ComVisible 设置为 false 使此程序集中的类型
// 对 COM 组件不可见。 如果需要从 COM 访问此程序集中的类型，
// 则将该类型上的 ComVisible 特性设置为 true。
[assembly: ComVisible(false)]
// 如果此项目向 COM 公开，则下列 GUID 用于类型库的 ID
[assembly: Guid("a75c793b-4f2c-473b-b095-0858768553ce")]
// 程序集的版本信息由下面四个值组成:
//
// 主版本
// 次版本
// 生成号
// 修订号
//
// 可以指定所有这些值，也可以使用“生成号”和“修订号”的默认值，
// 方法是按如下所示使用“*”:
// [assembly: AssemblyVersion("1.0.*")]
[assembly: AssemblyVersion("1.0.0.0")]
[assembly: AssemblyFileVersion("1.0.0.0")]
| feilingdeng/PureCms | Libraries/PureCms.Services/Properties/AssemblyInfo.cs | C# | gpl-3.0 | 1,320 |
/*
Copyright 2014 Ilya Zhuravlev
This file is part of Acquisition.
Acquisition is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Acquisition is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Acquisition. If not, see <http://www.gnu.org/licenses/>.
*/
#include "util.h"
#include <QComboBox>
#include <QCryptographicHash>
#include <QString>
#include <QStringList>
#include <QLineEdit>
#include <QLabel>
#include <QFontMetrics>
#include <QNetworkReply>
#include <QTextDocument>
#include "rapidjson/document.h"
#include "rapidjson/writer.h"
#include <sstream>
#include "buyoutmanager.h"
#include "porting.h"
std::string Util::Md5(const std::string &value) {
QString hash = QString(QCryptographicHash::hash(value.c_str(), QCryptographicHash::Md5).toHex());
return hash.toUtf8().constData();
}
double Util::AverageDamage(const std::string &s) {
size_t x = s.find("-");
if (x == std::string::npos)
return 0;
return (std::stod(s.substr(0, x)) + std::stod(s.substr(x + 1))) / 2;
}
void Util::PopulateBuyoutTypeComboBox(QComboBox *combobox) {
combobox->addItems(QStringList({"Ignore", "Buyout", "Fixed price", "No price"}));
}
void Util::PopulateBuyoutCurrencyComboBox(QComboBox *combobox) {
for (auto ¤cy : CurrencyAsString)
combobox->addItem(QString(currency.c_str()));
}
int Util::TagAsBuyoutType(const std::string &tag) {
return std::find(BuyoutTypeAsTag.begin(), BuyoutTypeAsTag.end(), tag) - BuyoutTypeAsTag.begin();
}
int Util::TagAsCurrency(const std::string &tag) {
return std::find(CurrencyAsTag.begin(), CurrencyAsTag.end(), tag) - CurrencyAsTag.begin();
}
static std::vector<std::string> width_strings = {
"max#",
"R. Level",
"R##",
"Defense"
};
int Util::TextWidth(TextWidthId id) {
static bool calculated = false;
static std::vector<int> result;
if (!calculated) {
calculated = true;
result.resize(width_strings.size());
QLineEdit textbox;
QFontMetrics fm(textbox.fontMetrics());
for (size_t i = 0; i < width_strings.size(); ++i)
result[i] = fm.width(width_strings[i].c_str());
}
return result[static_cast<int>(id)];
}
void Util::ParseJson(QNetworkReply *reply, rapidjson::Document *doc) {
QByteArray bytes = reply->readAll();
doc->Parse(bytes.constData());
}
std::string Util::GetCsrfToken(const std::string &page, const std::string &name) {
std::string needle = "name=\"" + name + "\" value=\"";
if (page.find(needle) == std::string::npos)
return "";
return page.substr(page.find(needle) + needle.size(), 32);
}
std::string Util::FindTextBetween(const std::string &page, const std::string &left, const std::string &right) {
size_t first = page.find(left);
size_t last = page.find(right, first);
if (first == std::string::npos || last == std::string::npos || first > last)
return "";
return page.substr(first + left.size(), last - first - left.size());
}
std::string Util::BuyoutAsText(const Buyout &bo) {
if (bo.type != BUYOUT_TYPE_NO_PRICE) {
return BuyoutTypeAsTag[bo.type] + " " + QString::number(bo.value).toStdString() + " " + CurrencyAsTag[bo.currency];
} else {
return BuyoutTypeAsTag[bo.type];
}
}
std::string Util::RapidjsonSerialize(const rapidjson::Value &val) {
rapidjson::StringBuffer buffer;
rapidjson::Writer<rapidjson::StringBuffer> writer(buffer);
val.Accept(writer);
return buffer.GetString();
}
void Util::RapidjsonAddConstString(rapidjson::Value *object, const char *const name, const std::string &value, rapidjson::MemoryPoolAllocator<rapidjson::CrtAllocator> &alloc) {
rapidjson::Value rjson_name;
rjson_name.SetString(name, strlen(name));
rapidjson::Value rjson_val;
rjson_val.SetString(value.c_str(), value.size());
object->AddMember(rjson_name, rjson_val, alloc);
}
std::string Util::StringReplace(const std::string &haystack, const std::string &needle, const std::string &replace) {
std::string out = haystack;
for (size_t pos = 0; ; pos += replace.length()) {
pos = out.find(needle, pos);
if (pos == std::string::npos)
break;
out.erase(pos, needle.length());
out.insert(pos, replace);
}
return out;
}
std::string Util::StringJoin(const std::vector<std::string> &arr, const std::string &separator) {
std::string result;
for (size_t i = 0; i < arr.size(); ++i) {
if (i != 0)
result += separator;
result += arr[i];
}
return result;
}
std::vector<std::string> Util::StringSplit(const std::string &str, char delim) {
std::vector<std::string> elems;
std::stringstream ss(str);
std::string item;
while (std::getline(ss, item, delim)) {
elems.push_back(item);
}
return elems;
}
bool Util::MatchMod(const char *match, const char *mod, double *output) {
double result = 0.0;
auto pmatch = match;
auto pmod = mod;
int cnt = 0;
while (*pmatch && *pmod) {
if (*pmatch == '#') {
++cnt;
auto prev = pmod;
while ((*pmod >= '0' && *pmod <= '9') || *pmod == '.')
++pmod;
result += std::strtod(prev, NULL);
++pmatch;
} else if (*pmatch == *pmod) {
++pmatch;
++pmod;
} else {
return false;
}
}
*output = result / cnt;
return !*pmatch && !*pmod;
}
std::string Util::TimeAgoInWords(const QDateTime buyout_time){
QDateTime current_date = QDateTime::currentDateTime();
qint64 days = buyout_time.daysTo(current_date);
qint64 secs = buyout_time.secsTo(current_date);
qint64 hours = (secs / 60 / 60) % 24;
qint64 minutes = (secs / 60) % 60;
// YEARS
if (days > 365){
int years = (days / 365);
if (days % 365 != 0)
years++;
return QString("%1 %2 ago").arg(years).arg(years == 1 ? "year" : "years").toStdString();
}
// MONTHS
if (days > 30){
int months = (days / 365);
if (days % 30 != 0)
months++;
return QString("%1 %2 ago").arg(months).arg(months == 1 ? "month" : "months").toStdString();
// DAYS
}else if (days > 0){
return QString("%1 %2 ago").arg(days).arg(days == 1 ? "day" : "days").toStdString();
// HOURS
}else if (hours > 0){
return QString("%1 %2 ago").arg(hours).arg(hours == 1 ? "hour" : "hours").toStdString();
//MINUTES
}else if (minutes > 0){
return QString("%1 %2 ago").arg(minutes).arg(minutes == 1 ? "minute" : "minutes").toStdString();
// SECONDS
}else if (secs > 5){
return QString("%1 %2 ago").arg(secs).arg("seconds").toStdString();
}else if (secs < 5){
return QString("just now").toStdString();
}else{
return "";
}
}
std::string Util::Decode(const std::string &entity) {
QTextDocument text;
text.setHtml(entity.c_str());
return text.toPlainText().toStdString();
}
| thild42/acquisition | src/util.cpp | C++ | gpl-3.0 | 7,487 |
// Copied from https://github.com/PointCloudLibrary/pcl/blob/master/tools/pcd2ply.cpp
/*
* Software License Agreement (BSD License)
*
* Point Cloud Library (PCL) - www.pointclouds.org
* Copyright (c) 2011-2012, Willow Garage, Inc.
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the copyright holder(s) nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
* $Id$
*
*/
#include <pcl/io/pcd_io.h>
#include <pcl/io/ply_io.h>
#include <pcl/console/print.h>
#include <pcl/console/parse.h>
#include <pcl/console/time.h>
using namespace pcl;
using namespace pcl::io;
using namespace pcl::console;
void
printHelp (int, char **argv)
{
print_error ("Syntax is: %s [-format 0|1] [-use_camera 0|1] input.pcd output.ply\n", argv[0]);
}
bool
loadCloud (const std::string &filename, pcl::PCLPointCloud2 &cloud)
{
TicToc tt;
print_highlight ("Loading "); print_value ("%s ", filename.c_str ());
tt.tic ();
if (loadPCDFile (filename, cloud) < 0)
return (false);
print_info ("[done, "); print_value ("%g", tt.toc ()); print_info (" ms : "); print_value ("%d", cloud.width * cloud.height); print_info (" points]\n");
print_info ("Available dimensions: "); print_value ("%s\n", pcl::getFieldsList (cloud).c_str ());
return (true);
}
void
saveCloud (const std::string &filename, const pcl::PCLPointCloud2 &cloud, bool binary, bool use_camera)
{
TicToc tt;
tt.tic ();
print_highlight ("Saving "); print_value ("%s ", filename.c_str ());
pcl::PLYWriter writer;
writer.write (filename, cloud, Eigen::Vector4f::Zero (), Eigen::Quaternionf::Identity (), binary, use_camera);
print_info ("[done, "); print_value ("%g", tt.toc ()); print_info (" ms : "); print_value ("%d", cloud.width * cloud.height); print_info (" points]\n");
}
/* ---[ */
int
main (int argc, char** argv)
{
print_info ("Convert a PCD file to PLY format. For more information, use: %s -h\n", argv[0]);
if (argc < 3)
{
printHelp (argc, argv);
return (-1);
}
// Parse the command line arguments for .pcd and .ply files
std::vector<int> pcd_file_indices = parse_file_extension_argument (argc, argv, ".pcd");
std::vector<int> ply_file_indices = parse_file_extension_argument (argc, argv, ".ply");
if (pcd_file_indices.size () != 1 || ply_file_indices.size () != 1)
{
print_error ("Need one input PCD file and one output PLY file.\n");
return (-1);
}
// Command line parsing
bool format = true;
bool use_camera = true;
parse_argument (argc, argv, "-format", format);
parse_argument (argc, argv, "-use_camera", use_camera);
print_info ("PLY output format: "); print_value ("%s, ", (format ? "binary" : "ascii"));
print_value ("%s\n", (use_camera ? "using camera" : "no camera"));
// Load the first file
pcl::PCLPointCloud2 cloud;
if (!loadCloud (argv[pcd_file_indices[0]], cloud))
return (-1);
// Convert to PLY and save
saveCloud (argv[ply_file_indices[0]], cloud, format, use_camera);
return (0);
}
| kuri-kustar/nbv_exploration | src/utilities/pcd2ply.cpp | C++ | gpl-3.0 | 4,418 |
/******************************************************************************
* Filename: hal_spi_rf_trx.h
*
* Description: Implementation file for common spi access with the CCxxxx
* transceiver radios using trxeb. Supports CC1101/CC112X radios
*
* Copyright (C) 2013 Texas Instruments Incorporated - http://www.ti.com/
*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* Neither the name of Texas Instruments Incorporated nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*******************************************************************************/
/******************************************************************************
* INCLUDES
*/
#include "stdint.h"
#if defined (__MSP430G2553__)
#include "hal_spi_rf_exp430g2.h"
#endif
#if defined (__MSP430F5438A__)
#include "hal_spi_rf_trxeb.h"
#endif
#if defined (__MSP430F5529__)
#include "hal_spi_rf_exp5529.h"
#endif
#if defined NRF52810 || NRF52832 || NRF52840
#include "spi_rf_nrf52.h"
#endif
// CC Chip versions
#define DEV_UNKNOWN 10
#define DEV_CC1100 11
#define DEV_CC1101 12
#define DEV_CC2500 13
#define DEV_CC430x 14
#define DEV_CC1120 15
#define DEV_CC1121 16
#define DEV_CC1125 17
#define DEV_CC1200 18
#define DEV_CC1201 19
#define DEV_CC1175 20
#define RADIO_GENERAL_ERROR 0x00
#define RADIO_CRC_OK 0x80
#define RADIO_IDLE 0x81
#define RADIO_RX_MODE 0x82
#define RADIO_TX_MODE 0x83
#define RADIO_RX_ACTIVE 0x84
#define RADIO_TX_ACTIVE 0x85
#define RADIO_SLEEP 0x86
#define RADIO_TX_PACKET_RDY 0x87
#define RADIO_CHANNEL_NOT_CLR 0x88
#define RADIO_CHANNEL_IS_CLR 0x89
| Appiko/nrf5x-firmware | codebase/ti_radio_lib/hal_spi_rf.h | C | gpl-3.0 | 3,221 |
package edu.stanford.rsl.conrad.metric;
public class RootMeanSquareErrorMetric extends MeanSquareErrorMetric {
/**
*
*/
private static final long serialVersionUID = 332165924495213426L;
@Override
public double evaluate() {
return Math.sqrt(computeMeanSquareError());
}
@Override
public String toString() {
return "Root Mean Square Error";
}
}
/*
* Copyright (C) 2010-2014 Andreas Maier
* CONRAD is developed as an Open Source project under the GNU General Public License (GPL).
*/ | YixingHuang/CONRAD | src/edu/stanford/rsl/conrad/metric/RootMeanSquareErrorMetric.java | Java | gpl-3.0 | 509 |
/*
* jack_daemons.c
*
* Copyright 2020, Simon Price - simon@prichy.net
*
* This file is part of SoundDesk.
*
* SoundDesk is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* SoundDesk is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with SoundDesk. If not, see <http://www.gnu.org/licenses/>
*/
/*
* Contains the low-level run-time JACK routines
*
* The code here runs in the Jack process. This is only concerned with
* copying data from the ringbuffers of the decks to the output jack
* ports and for processing all of the mixer channels - again copying data
* from the input port to the output port with the necessary transformations.
* All other code should sit outside of this area where it is less critical.
* Delays here will cause XRUNs in Jack so there should be no blocking calls,
* no MALLOCS etc etc....
*/
#include "SoundDesk.h"
static void jack_dek(t_dek *, jack_nframes_t *);
static void jack_mxr(t_mxr *, jack_nframes_t *);
static void jack_dev(t_dev *, jack_nframes_t *);
static void process_midi_ip(t_dev *, jack_nframes_t);
static void process_midi_op(t_dev *, jack_nframes_t);
static bool send_midi_op(t_dev *, void *, jack_nframes_t);
static bool new_vu_period;
static int vu_samples = 0;
int
run_jack_processor( jack_nframes_t nframes,
void * dummy)
/*
* Top level function to do run-time JACK processing
* Note this is run as a JACK process so must be efficient!
*/
{
if(system_state_is(ss_live)) /* Things to do in live mode */
{
if(LOCKR(deks_lck)) /* Try to Lock decks list */
{
for_each_si(deks, (t_for_si)jack_dek, &nframes);
UNLOCKR(deks_lck);
}
if((vu_samples += nframes) >= vu_update_samples)
{
new_vu_period = TRUE;
vu_samples = 0;
}
else
new_vu_period = FALSE;
if(LOCKR(mxrs_lck)) /* Try to lock mixers list */
{
for_each_si(mxrs, (t_for_si)jack_mxr, &nframes);
UNLOCKR(mxrs_lck);
}
for_each_si(devices, (t_for_si)jack_dev, &nframes);
run_aut_update(nframes); /* Update all automators */
}
else /* Things to do when editing */
{
if(aud_dek) /* Audition deck? */
jack_dek(DEK(aud_dek), &nframes);
if(aud_mxr) /* Audition mixer? */
jack_mxr(MXR(aud_mxr), &nframes);
}
return 0;
} /* run_jack_processor() */
static void
jack_dek( t_dek * dek, /* Deck to use */
jack_nframes_t * frames) /* Frames to process */
/*
* Service the output from the ringbuffers for each sample stream
* to the appropriate JACK output channels
*/
{
void *port; /* JACK output port */
t_pos reqd; /* Bytes reqd */
t_pos read1; /* Bytes from 1st read */
t_pos read2; /* Bytes from 2nd read */
t_pos total; /* Total bytes read */
t_pos bytes; /* Bytes required */
t_chnno chn; /* Channel number */
bool ready; /* OK to stream ? */
if(FLAG_IS(dek->active, FALSE)) /* Deck not active? */
return; /* Nothing to do then! */
if(FLAG_IS(audio_active, TRUE)) /* If back-end is active */
ready = FLAG_GET(dek->ready);
else
ready = FALSE;
reqd = *frames;
bytes = reqd * sizeof(t_samval); /* bytes required */
if(!LOCKR(dek->lck)) /* Get read lock on deck */
return;
for(chn = 0; chn < dek->chns; chn++) /* For each channel */
{
port = jack_port_get_buffer(dek->port[chn], reqd);
if(!ready) /* Not ready to stream? */
{
memset(port, 0, bytes); /* Copy silence to port */
continue;
}
read1 = jack_ringbuffer_read(dek->rb[chn], port, bytes);
if((read1 > 0) && (read1 < reqd))/* Need more ?? */
read2 = jack_ringbuffer_read(dek->rb[chn],
port + read1, bytes - read1 );
else
read2 = 0L;
total = read1 + read2; /* Total bytes read */
if(total < bytes)
memset(port + total, 0, bytes - total);
}
UNLOCKR(dek->lck);
} /* jack_dek() */
static void
jack_mxr( t_mxr * mxr, /* Mixer to use */
jack_nframes_t * nframes) /* Frames to process */
/*
* Service the ports for the given channel. Copy all of the data
* from the input ports to the output ports performing all
* necessary transformations along the way.
*/
{
t_samval *ip_port; /* JACK input port */
t_samval *op_port; /* JACK output port */
t_pos reqd; /* Frames reqd */
t_pos frame; /* Frame counter */
t_pos bytes; /* Bytes required */
t_chnno chnno; /* Channel number */
t_chnno chns; /* Channels in stream */
t_aut_val vol; /* Volume level */
t_aut_val pan; /* Panning position */
int mute; /* Channel mute setting */
int solo; /* Channel solo setting */
t_aut_val rvol = 0.0; /* Right volume level */
t_aut_val lvol = 0.0; /* Left volume level */
bool muted; /* Is channel muted? */
t_samval vu; /* VU level for channel */
t_samval lvl; /* Sample level */
if(FLAG_IS(mxr->active, FALSE)) /* Is this mxr inactive? */
return;
reqd = *nframes; /* Frames required */
bytes = reqd * sizeof(t_samval); /* bytes required */
if(!LOCKR(mxr->lck)) /* Try to get lock */
return; /* Failed - ignore! */
chns = mxr->chns; /* Get no. of audio channels */
if(FLAG_IS(audio_active, TRUE)) /* If back-end is active */
{
vol = GET_AUT_PVAL(AUT(mxr->vol));
pan = GET_AUT_PVAL(AUT(mxr->pan));
mute = GET_AUT_PVAL_INT(AUT(mxr->mute));
solo = GET_AUT_PVAL_INT(AUT(mxr->solo));
/*
* Is this channel muted?
* It will be muted if either the MUTE button is pressed
* or if SOLO is (globally) active but this channel
* doesn't have it enabled
*/
muted = mute || (solos && !solo);
}
else
muted = TRUE;
if(!muted) /* Don't bother if muted */
{
/*
* We calculate 2 volume levels, left and right - according
* to the pan level
* Left affects all even numbered channels plus zero and
* Right affects all odd numbered channels.
* Normally though there'll probably be either 1 or 2!
*/
if(pan < 0.5) /* Ie - Pan left */
{
rvol = vol * (1.0 - ((0.5 - pan) * 2.0));
lvol = vol;
}
else /* Pan right */
{
rvol = vol;
lvol = vol * (1.0 - ((pan - 0.5) * 2));
}
/*
* We now have the volume level for each side
* set between 0 .. 1
* Now scale it to a proper 'user' value which will
* involve giving it a fairly rough log adjustment
*/
lvol = aut_nat2usr_dbl(lvol, AUT(mxr->vol)->ad);
rvol = aut_nat2usr_dbl(rvol, AUT(mxr->vol)->ad);
}
for(chnno = 0; chnno < chns; chnno++) /* For each channel */
{
op_port = jack_port_get_buffer(mxr->op_port[chnno], reqd);
if(muted) /* Mute on ? */
memset(op_port, 0, bytes);/* Copy silence to port */
else
{
ip_port = jack_port_get_buffer(mxr->ip_port[chnno],
reqd);
frame = reqd; /* Set starting frame */
vu = 0.0;
vol = ((chnno % 2) ? rvol : lvol);/* Right or left vol*/
while(frame--)
{
lvl = *op_port++ = *ip_port++ * vol;
if(lvl > vu)
vu = lvl;
}
if(vu > mxr->new_vu[chnno])/* VU > current VU ? ... */
mxr->new_vu[chnno] = vu;/* ... update it */
}
/*
* If we've reached the end of a sampling period for the
* VUs then move the working value into the value
* other routines will read from
*/
if(new_vu_period)
{
mxr->vu[chnno] = mxr->new_vu[chnno];
mxr->new_vu[chnno] = 0.0;/* Reset working value */
}
}
UNLOCKR(mxr->lck); /* Unlock the channel */
return;
} /* jack_mxr() */
static void
jack_dev( t_dev * dev, /* MIDI Device to use */
jack_nframes_t * nframes) /* Frames to process */
/*
* Process the MIDI data for the device given. This basically just involves
* sending any data available in the op_rb ringbuffer and pushing any
* incomming MIDI messages into ip_rb ringbuffer
*/
{
if(FLAG_IS(dev->active, FALSE)) /* Device is not active? */
return; /* Nothing to do then */
process_midi_ip(dev, *nframes);
process_midi_op(dev, *nframes);
} /* jack_dev() */
static void
process_midi_ip(t_dev * dev, /* MIDI device */
jack_nframes_t nframes) /* Number of JACK frames */
{
int reqd; /* Save reqd in ringbuffer */
int new_events; /* New MIDI events */
int left; /* Bytes left to write */
int out; /* Bytes written */
t_mdata_len len; /* Length of MIDI data */
unsigned char * byte; /* Byte to write from */
void * buf; /* Buffer for the MIDI port */
jack_nframes_t index;
jack_midi_event_t midi_ip_event;
t_rbuf * rb; /* Ring buffer for the device*/
midi_ip_event.size = 0;
buf = jack_port_get_buffer(dev->ip_port, nframes);
rb = dev->ip_rb;
new_events = jack_midi_get_event_count(buf);
index = 0;
while((index < new_events) || (midi_ip_event.size > 0))
{
/*
* Check if there is already something waiting in the event
* buffer, otherwise get the next event in the queue
* If both of these fail then there's nothing to do
*/
if(midi_ip_event.size == 0)
jack_midi_event_get(&midi_ip_event, buf, index++);
/*
* There is now a MIDI event to write to the ring buffer,
* so ensure there's enough room
*/
reqd = midi_ip_event.size + sizeof(t_mdata_len);
if(jack_ringbuffer_write_space(rb) < reqd)
{
E("MIDI I/P ringbuffer out of space");
return; /* Not enough room */
}
len = midi_ip_event.size;
left = sizeof(len);
byte = (unsigned char *)&len;
while(left)
{
out = jack_ringbuffer_write(rb, (char *)byte, left);
left -= out;
byte += out;
}
left = len;
byte = midi_ip_event.buffer;
D(7, "<<< MIDI IN [%s]", midi_as_string(byte, len));
while(left)
{
out = jack_ringbuffer_write(rb, (char *)byte, left);
left -= out;
byte += out;
}
midi_ip_event.size = 0;
}
} /* process_midi_ip() */
static void
process_midi_op(t_dev * dev, /* MIDI device */
jack_nframes_t nframes) /* JACK frames to process */
/*
* Send all events on the MIDI O/P ringbuffer to the MIDI port
*/
{
void * buf; /* Port buffer */
buf = jack_port_get_buffer(dev->op_port, nframes);
jack_midi_clear_buffer(buf); /* Clears the buffer */
while(send_midi_op(dev, buf, 0)); /* Send all MIDI data */
} /* Process_midi_op() */
static bool
send_midi_op( t_dev * dev, /* MIDI device ID */
void * buf, /* MIDI port buffer */
jack_nframes_t frame) /* JACK frame number */
/*
* Send the next event from the MIDI OP ringbuffer
* Returns TRUE if there was something to do, else FALSE
*/
{
t_mdata_len len; /* MIDI bytes in event */
size_t bytes = 0; /* Bytes read */
size_t len_sz = sizeof(len);
size_t buf_sz; /* Size of ringbuffer */
t_mdata * mbuf; /* Buffer for MIDI data */
char * ptr; /* Pointer into buffer */
size_t read; /* Bytes read */
t_rbuf * rb; /* Ring buffer */
rb = dev->op_rb;
/*
* Find the number of bytes waiting to be read on the ringbuffer
*/
buf_sz = jack_ringbuffer_read_space(rb);
if(buf_sz <= len_sz) /* No data available? */
return FALSE;
/*
* We know there's at least the data count field. So peek at what
* that is in order to know if the whole message is waiting
*/
ptr = (char *)&len;
while(bytes < len_sz)
bytes += jack_ringbuffer_peek(rb, ptr + bytes, len_sz - bytes);
/*
* We now have a count of the MIDI message bytes that follow.
* So, is that how much info we have available in the actual ringbuffer?
*/
buf_sz -= len_sz; /* MIDI message available */
if(buf_sz < len) /* Buffer smaller than count?*/
return FALSE; /* Bugger! */
mbuf = jack_midi_event_reserve(buf, frame, (size_t)len);
if(mbuf == NULL)
{
D(1, "JACK MIDI O/P buffer full");
return FALSE;
}
/*
* Excellent - we have a whole MIDI message available.
* So - read it out of the ringbuffer, into the JACK port
* First remember to skip over the byte(s) that were the
* actual count
*/
D(7, "<<< MIDI OUT [%s]", midi_as_string(mbuf, len));
jack_ringbuffer_read_advance(rb, len_sz);/* Skip over MIDI data size */
#ifdef DEBUG
if(!len)
D(1, "NULL MIDI message in buffer");
#endif
for(read = 0, ptr = (char *)mbuf; read < len; read += bytes)
bytes = jack_ringbuffer_read(rb, ptr + read, len - read);
return TRUE;
} /* send_midi_op() */
| Prichy/SoundDesk | src/jack_daemons.c | C | gpl-3.0 | 13,126 |
/*
* Generated by asn1c-0.9.29 (http://lionet.info/asn1c)
* From ASN.1 module "S1AP-PDU-Contents"
* found in "../support/s1ap-r16.1.0/36413-g10.asn"
* `asn1c -pdu=all -fcompound-names -findirect-choice -fno-include-deps`
*/
#include "S1AP_DownlinkUEAssociatedLPPaTransport.h"
asn_TYPE_member_t asn_MBR_S1AP_DownlinkUEAssociatedLPPaTransport_1[] = {
{ ATF_NOFLAGS, 0, offsetof(struct S1AP_DownlinkUEAssociatedLPPaTransport, protocolIEs),
(ASN_TAG_CLASS_CONTEXT | (0 << 2)),
-1, /* IMPLICIT tag at current level */
&asn_DEF_S1AP_ProtocolIE_Container_7327P73,
0,
{ 0, 0, 0 },
0, 0, /* No default value */
"protocolIEs"
},
};
static const ber_tlv_tag_t asn_DEF_S1AP_DownlinkUEAssociatedLPPaTransport_tags_1[] = {
(ASN_TAG_CLASS_UNIVERSAL | (16 << 2))
};
static const asn_TYPE_tag2member_t asn_MAP_S1AP_DownlinkUEAssociatedLPPaTransport_tag2el_1[] = {
{ (ASN_TAG_CLASS_CONTEXT | (0 << 2)), 0, 0, 0 } /* protocolIEs */
};
asn_SEQUENCE_specifics_t asn_SPC_S1AP_DownlinkUEAssociatedLPPaTransport_specs_1 = {
sizeof(struct S1AP_DownlinkUEAssociatedLPPaTransport),
offsetof(struct S1AP_DownlinkUEAssociatedLPPaTransport, _asn_ctx),
asn_MAP_S1AP_DownlinkUEAssociatedLPPaTransport_tag2el_1,
1, /* Count of tags in the map */
0, 0, 0, /* Optional elements (not needed) */
1, /* First extension addition */
};
asn_TYPE_descriptor_t asn_DEF_S1AP_DownlinkUEAssociatedLPPaTransport = {
"DownlinkUEAssociatedLPPaTransport",
"DownlinkUEAssociatedLPPaTransport",
&asn_OP_SEQUENCE,
asn_DEF_S1AP_DownlinkUEAssociatedLPPaTransport_tags_1,
sizeof(asn_DEF_S1AP_DownlinkUEAssociatedLPPaTransport_tags_1)
/sizeof(asn_DEF_S1AP_DownlinkUEAssociatedLPPaTransport_tags_1[0]), /* 1 */
asn_DEF_S1AP_DownlinkUEAssociatedLPPaTransport_tags_1, /* Same as above */
sizeof(asn_DEF_S1AP_DownlinkUEAssociatedLPPaTransport_tags_1)
/sizeof(asn_DEF_S1AP_DownlinkUEAssociatedLPPaTransport_tags_1[0]), /* 1 */
{ 0, 0, SEQUENCE_constraint },
asn_MBR_S1AP_DownlinkUEAssociatedLPPaTransport_1,
1, /* Elements count */
&asn_SPC_S1AP_DownlinkUEAssociatedLPPaTransport_specs_1 /* Additional specs */
};
| acetcom/cellwire | lib/asn1c/s1ap/S1AP_DownlinkUEAssociatedLPPaTransport.c | C | gpl-3.0 | 2,105 |
package com.taobao.api.request;
import java.util.Map;
import com.taobao.api.ApiRuleException;
import com.taobao.api.TaobaoRequest;
import com.taobao.api.internal.util.RequestCheckUtils;
import com.taobao.api.internal.util.TaobaoHashMap;
import com.taobao.api.response.LogisticsOrderShengxianConfirmResponse;
/**
* TOP API: taobao.logistics.order.shengxian.confirm request
*
* @author auto create
* @since 1.0, 2014-11-02 16:51:10
*/
public class LogisticsOrderShengxianConfirmRequest
implements TaobaoRequest<LogisticsOrderShengxianConfirmResponse> {
/**
* 卖家联系人地址库ID，可以通过taobao.logistics.address.search接口查询到地址库ID。<br>
* <font color='red'>如果为空，取的卖家的默认退货地址</font><br>
*/
private Long cancelId;
/**
* 1：冷链。0：常温
*/
private Long deliveryType;
private Map<String, String> headerMap = new TaobaoHashMap();
/**
* 物流订单ID 。同淘宝交易订单互斥，淘宝交易号存在，，以淘宝交易号为准<br />
* 支持最小值为：1000
*/
private Long logisId;
/**
* 运单号.具体一个物流公司的真实运单号码。支持多个运单号，多个运单号之间用英文分号（;）隔开，不能重复。淘宝官方物流会校验，请谨慎传入；
*/
private String outSid;
/**
* 商家的IP地址
*/
private String sellerIp;
/**
* 卖家联系人地址库ID，可以通过taobao.logistics.address.search接口查询到地址库ID。
* <font color='red'>如果为空，取的卖家的默认取货地址</font>
*
* 如果service_code不为空，默认使用service_code
* 如果service_code为空，sender_id不为空，使用sender_id对应的地址发货
* 如果service_code与sender_id都为空，使用默认地址发货
*/
private Long senderId;
/**
* 仓库的服务代码标示，代码一个仓库的实体。(可以通过taobao.wlb.stores.baseinfo.get接口查询)
*
* 如果service_code为空，默认通过sender_id来发货
*/
private String serviceCode;
/**
* 淘宝交易ID<br />
* 支持最小值为：1000
*/
private Long tid;
private Long timestamp;
private TaobaoHashMap udfParams; // add user-defined text parameters
@Override
public void check() throws ApiRuleException {
RequestCheckUtils.checkMinValue(logisId, 1000L, "logisId");
RequestCheckUtils.checkNotEmpty(outSid, "outSid");
RequestCheckUtils.checkMinValue(tid, 1000L, "tid");
}
@Override
public String getApiMethodName() {
return "taobao.logistics.order.shengxian.confirm";
}
public Long getCancelId() {
return this.cancelId;
}
public Long getDeliveryType() {
return this.deliveryType;
}
@Override
public Map<String, String> getHeaderMap() {
return headerMap;
}
public Long getLogisId() {
return this.logisId;
}
public String getOutSid() {
return this.outSid;
}
@Override
public Class<LogisticsOrderShengxianConfirmResponse> getResponseClass() {
return LogisticsOrderShengxianConfirmResponse.class;
}
public String getSellerIp() {
return this.sellerIp;
}
public Long getSenderId() {
return this.senderId;
}
public String getServiceCode() {
return this.serviceCode;
}
@Override
public Map<String, String> getTextParams() {
TaobaoHashMap txtParams = new TaobaoHashMap();
txtParams.put("cancel_id", this.cancelId);
txtParams.put("delivery_type", this.deliveryType);
txtParams.put("logis_id", this.logisId);
txtParams.put("out_sid", this.outSid);
txtParams.put("seller_ip", this.sellerIp);
txtParams.put("sender_id", this.senderId);
txtParams.put("service_code", this.serviceCode);
txtParams.put("tid", this.tid);
if (this.udfParams != null) {
txtParams.putAll(this.udfParams);
}
return txtParams;
}
public Long getTid() {
return this.tid;
}
@Override
public Long getTimestamp() {
return this.timestamp;
}
@Override
public void putOtherTextParam(String key, String value) {
if (this.udfParams == null) {
this.udfParams = new TaobaoHashMap();
}
this.udfParams.put(key, value);
}
public void setCancelId(Long cancelId) {
this.cancelId = cancelId;
}
public void setDeliveryType(Long deliveryType) {
this.deliveryType = deliveryType;
}
public void setLogisId(Long logisId) {
this.logisId = logisId;
}
public void setOutSid(String outSid) {
this.outSid = outSid;
}
public void setSellerIp(String sellerIp) {
this.sellerIp = sellerIp;
}
public void setSenderId(Long senderId) {
this.senderId = senderId;
}
public void setServiceCode(String serviceCode) {
this.serviceCode = serviceCode;
}
public void setTid(Long tid) {
this.tid = tid;
}
@Override
public void setTimestamp(Long timestamp) {
this.timestamp = timestamp;
}
}
| kuiwang/my-dev | src/main/java/com/taobao/api/request/LogisticsOrderShengxianConfirmRequest.java | Java | gpl-3.0 | 5,323 |
\chapter{Constraints}\label{chapter.constraints}
\section{Motivation}
\subsection{Equality}
In Chapter~\ref{chapter.fol}, terms are only considered equal if they
are syntactically equal. The question arises,
how can we reason in axiomatic theories. The most natural example
is first-order logic with equality, axiomitized by the following
equations
\[
\begin{array}{l}
\All x.~x = x
\\
\All x~y.~x = y \Imp y = x
\\
\All x~y~z.~x = y \Imp y = z\Imp x = z
\\
\All \vec{x}~\vec{y}.~
x_1=y_1'\And \ldots\And x_n=y_n'\Imp f(x_1,\ldots,x_n) = f(y_1,\ldots,y_n)
\end{array}
\]
\noindent
One approach is to add the axioms as premeses to a sequent, and prove the
sequent under the additional assumptions. This approach, however, may not lead
to a very efficient theorem prover. In the classical literature, many
specialized reasoning techniques, such as paramodulation, have been engineered
to be far more effective than adding axioms. Like resolution, paramodulation is
fundamentally classical, and investigating other strategies is of some interest.
Voronkov showed~\cite{Voronkov.1996.CADE} that intuitionistic logic with
equality can be reduced to simultaneous rigid E-unification, which Degtyarev and
Voronkov showed~\cite{Degtyarev.1996.TCS} undecidable.
\subsection{Unification}
The reduction from intuitionistic logic with equality to simultaneous rigid
E-unification depends on equalities being explicit atomic formulas, in
particular allowing negated equalities to occur as premeses. We
call interpreted atomic formulas \emph{extrinsic} constraints.
In one sense, equality is already a part of backward proof search,
in the form of unification.
This view is detailed, e.g., in Pfenning's notes on automated
deduction~\cite[Section 4.3-4.4]{Pfenning.2004.TheoremProvingLectureNotes}.
The backward rules are modified to account for unification variables.
\[
\begin{tabular}{cc}
\textbf{Ground} & \textbf{Unification}
\\
\Infer[$Init$]
{\CSeq{\Gamma, p}{p}}
{}
&
\hspace{2em}
\Infer[$Init$]
{\CSeq{\Phi}{\Gamma, p}{q}}
{\Entails p\Ueq q}
\\[2em]
\Infer[\All$-R$_a]
{\CSeq{\Gamma}{\All x.~A(x)}}
{\CSeq{\Gamma}{A(a)}}
&
\hspace{2em}
\Infer[\All$-R$_a]
{\CSeq{\Phi}{\Gamma}{\All x.~A(x)}}
{\CSeq{\Phi,a}{\Gamma}{A(a)}}
\\[2em]
\Infer[\All$-L$]
{\CSeq{\Gamma, \All x.~A(x)}{C}}
{\CSeq{\Gamma,A(t)}{C}}
&
\hspace{2em}
\Infer[\All$-L$]
{\CSeq{\Phi}{\Gamma, \All x.~A(x)}{C}}
{\CSeq{\Phi}{\Gamma,A(X_{\Phi})}{C}}
\end{tabular}
\]
\noindent
where in the $\All$-L rule, the variable $X_\Phi$ is a unification
variable that is allowed to depend on the parameters in $\Phi$.
A proof, then, is a derivation where the side-conditions on all
the initial sequents hold simultaneously. While formalizing
backward search in this way is beyond the scope of this thesis,
there are two lessons relevant for our work.
The first is that it is possible to defer computations
(here the choice of existential instantiations). The second is
that finding the solutions can take place in a totally different
logic than the one in which we are searching for proofs
(here encoded in the $\Entails$ relation).
\subsection{Most-general unifiers}
Backward proof search mainly works because the unification problem in the free
term algebra is particularly simple. In particular, the existence of most
general unifiers means that we never have to reconsider a choice of unifiers;
there is always a best choice! Adding interpreted function symbols to the term
language will in general break this property. We don't need to look far for
examples. Reasoning about a symmetric operator $\oplus$ with the axiom $\All
x~y.~x\oplus y=y\oplus x$ already lacks mgus; $\Set{x\to s,y\to
t}$ and $\Set{x\to t, y\to s}$ both unify $x\oplus y$ and $s\oplus t$ (assuming
$x,y\not\in\Vars s,t)$, but
neither is more general than the other. It is not necessary to allow equality
as an atomic predicate; we should certainly be able to prove the sequent
$\CSeq{p(c\oplus d)}{p(d\oplus c)}$.
\section{Natural deduction}
\input{constr/nd}
\begin{example}
Let $\xi=(\All x.~p(x)\Imp p(f(x)))\Imp c=d\Imp p(c)\Imp p(f(d))$.
The following are both proof terms for $\xi$:
\[
\begin{array}{cc}
\Lam H_1:(\All x.~p(x)\Imp p(f(x))).~
\Lam H_2:(c=d).~
\Lam H_3:(p(c)).~
H_1~c~H_3 : p(f(d))
\\
\Lam H_1:(\All x.~p(x)\Imp p(f(x))).~
\Lam H_2:(c=d).~
\Lam H_3:(p(c)).~
H_1~d~(H_3 : p(d))
\end{array}
\]
\end{example}
\section{Constraint Domains}
\begin{definition}[Constraint domain]
A \emph{constraint domain} is a tuple
$\ConDom = \ASet{\UFunc_{\ConDom},\UAtom_{\ConDom},\Entails_{\ConDom}}$
where $\UFunc_{\ConDom}\subseteq\UFunc$ is a set of function symbols and
$\UAtom_{\ConDom}\subseteq\UAtom$ is a subset of atomic formulas.
Constraint formulas are built from the following grammar.
\[
\mbox{Constraints } \Psi ::= t_1\Ueq t_2 \Sep p \Sep A \And A \Sep \Top \Sep A \Imp A \Sep \Bot
\]
where $\Funcs(t_i)\subseteq\UFunc_{\ConDom}, p\in\cA_\ConDom$.
Finally, $\Psi_1\Entails_{\ConDom}\Psi_2$ is a relation where
$\Psi_1$ and $\Psi_2$ are constraint formulas. If $p\not\in\UAtom_{\ConDom}$ then
the expression
$p(t_1,\ldots,t_n)\Ueq p(s_1,\ldots,s_n)$ is shorthand for the formula
Write $\Psi\CEquiv\Psi'$ if $\Psi\Entails\Psi'$ and $\Psi'\Entails\Psi$.
The entailment relation must satisfy the following properties.
\begin{enumerate}
\item
$\Psi\Entails\Psi$
\item
$\Psi\Entails\Top$
\item
If $\Psi_1\Entails\Psi_2$ and $\Psi_2\Entails\Psi_3$ then
$\Psi_1\Entails\Psi_3$.
\item
If $\Psi\Entails \Psi_1\And\Psi_2$ then $\Psi\Entails \Psi_1$ and $\Psi\Entails \Psi_2$.
\item
If $\Psi\Entails \Psi_1$ and $\Psi\Entails\Psi_2$ then
$\Psi\Entails \Psi_1\And\Psi_2$
\item
If $\Psi\Entails \All x.~\Psi'(x)$ then for any $t$, $\Psi\Entails\Psi'(t)$.
\item
If $\Psi\Entails \Ex x.~\Psi'(x)$ then for some $t$, $\Psi\Entails\Psi'(t)$.
\item
If $\Psi\Entails \Psi(x)$ and $x\not\in\Psi$ then $\Psi\Entails\All x.~\Psi(x)$.
\item
If $\Psi_1\Entails \Psi_1'$ and $\Psi_2\Entails \Psi_2'$
then $\Psi_1'\Imp\Psi_2\Entails \Psi_1\Imp\Psi_2'$.
\item\label{constr.def.equiv} $x = t\And \Psi \CEquiv \Psi\cdot\Set{x\to t}$
\end{enumerate}
\noindent
Rule~\ref{constr.def.equiv} ensures that entailment respects substitution.
We use the phrase ``by entailment reasoning'' to indicate reasoning from these
rules.
\end{definition}
\begin{theorem}
Some easy consequences of the entailment relaton are:
\begin{itemize}
\item[]
\item $\Psi_1\And\Psi_2 \CEquiv \Psi_2\And\Psi_1$
\item $(\Psi_1\And\Psi_2)\And\Psi_3 \CEquiv \Psi_1\And(\Psi_2\And\Psi_3)$
\end{itemize}
\end{theorem}
\section{Backward calculus}
\begin{definition}[Constraint sequents]
A sequent is a pair $\ASet{\Psi, \sigma}$
where $\Psi$ is a constraint formula and $\sigma$ is a first-order sequent.
We write backward sequents as $\CSeq{\Psi}{\Delta}{\delta}$ and
forward sequents as $\CFSeq{\Psi}{\Delta}{\delta}$.
$\Psi$ is called the \emph{constraint context}.
\end{definition}
\begin{definition}[Subsumption]
$\CSeq{\Psi}{\Delta}{\delta}$ \emph{subsumes}
$\CSeq{\Psi'}{\Delta'}{\delta'}$ if
$\Delta \subseteq \Delta'$, $\delta \subseteq \delta'$, and $\Psi'\Entails\Psi$.
\end{definition}
\noindent
The constraints on the subsuming sequent must be weaker than that of the
subsumed sequent. This is natural, since a sequent with $\Psi=\Bot$ is
trivial, so subsuming it should be easy.
\begin{definition}[Backward inference rules]
An inference rule is a tuple $\ASet{\psi, \cH, \cC}$ where
$\cH = \ASet{H_1,\ldots,H_n}$, the hypotheses, are first-order sequents,
$\cC$ is a first-order sequent, and $\psi~:~\cF\to\ASet{\cF}_n$.
We write
% \[
% \Infer{\cC}{\}
% \]
\end{definition}
\begin{definition}[Unification equations]
For formulas $A,B$, define
\[
A\Ueq B=
\begin{cases}
p\Ueq q & A=p,~B=q,~p,q\in\cA_{\ConDom}\\
t_1\Ueq t_1'\And\cdots\And t_n\Ueq t_n' & A = p(t_1,\ldots,t_n),~B=p(t_1',\ldots,t_n'),~ p\in\cA\\
(A_1\Ueq B_1) \And (A_2\Ueq B_2) & A=A_1*A_2,~B=B_1*B_2,~*\in\Set{\And,\Or,\Imp}\\
A'(c)\Ueq B'(c) & A=\All x.~A'(x),~B=\All y.~B'(y) \\
A'(c)\Ueq B'(c) & A=\Ex x.~A'(x),~B=\Ex y.~B'(y) \\
\Bot & \mbox{otherwise}\\
\end{cases}
\]
The first case is to allow unification of atomic formulas from the constraint
domain to be determined by the domain. For example, it should be possible to
unify $a < b$ and $b > a$ in an arithmetic theory, even though the predicates
are not syntactically equal.
The unification equations of quantified formulas should not be affected by
the bound variable. Using a constant symbol in place of the variable captures
this independence.
\end{definition}
\begin{theorem}[Strengthening]
\label{constr.thm.strengthen}
\begin{itemize}
\item[]
\item If $\CSeq{\Psi}{\Delta}{\delta}$ and $\Psi'\Entails\Psi$ then
$\CSeq{\Psi'}{\Delta}{\delta}$.
\item If $\CSeq{\Psi,a=b}{\Delta}{\delta}$ and $a\not\in\Delta,\delta$ then
$\CSeq{\Psi}{\Delta}{\delta}$
\end{itemize}
\end{theorem}
\begin{proof}
TODO
\end{proof}
\begin{theorem}[Substitution]
\label{constr.thm.subst}
\begin{itemize}
\item[]
\item
If there is a derivation of $\CSeq{\Psi}{\Gamma}{\gamma}$ and $\theta$
is a valid substitution then
there is a derivation of $(\CSeq{\Psi}{\Gamma}{\gamma})\theta$.
\item
If there is a derivation of $\CFSeq{\Psi}{\Gamma}{\gamma}$ and $\theta$
is a valid substitution then
there is a derivation of $(\CFSeq{\Psi}{\Gamma}{\gamma})\theta$.
\end{itemize}
\end{theorem}
\begin{proof}
Induction on the derivation, using the validity of the
substitution to avoid variable capture.
\end{proof}
\begin{theorem}[Weakening]
\begin{itemize}
\item[]
\item
If $\CSeq{\Psi}{\Delta}{\delta}$ then $\CSeq{\Psi}{\Delta,A}{\delta}$.
\item
If $\CSeq{\Psi}{\Delta}{\cdot}$ then $\CSeq{\Psi}{\Delta}{A}$.
\end{itemize}
\end{theorem}
\begin{proof} Induction. \end{proof}
\begin{proof} The leaves of any deduction are valid initial sequents. \end{proof}
\begin{definition}[Forward inference rules]
A forward inference rule is a triple $\ASet{\psi,\Delta,\delta}$
where $\psi~:~\ASet{\cF}_n\to\cF$.
\end{definition}
\begin{definition}[Backward matching]
\end{definition}
\begin{definition}[Forward matching]
\end{definition}
\input{constr/backward}
\begin{theorem}[Soundness]
If $\CSeq{\Psi}{\Gamma}{\gamma}$ then $\CNd{\Psi,\Gamma}{\gamma}$.
\end{theorem}
\begin{proof}
\end{proof}
\begin{theorem}[Completeness]
If $\CNd{\Gamma}{\gamma}$ then $\CSeq{\Psi}{\Gamma}{\gamma}$
\end{theorem}
\begin{proof}
\end{proof}
\section{Forward calculus}
\input{constr/forward}
\subsection{Soundness and completeness}
\begin{lemma}[Inversion lemma]
\begin{itemize}
\item[]
\item If $\CSeq{\Psi}{\Delta,A\And B}{\delta}$ then
$\CSeq{\Psi}{\Delta,A, B}{\delta}$.
\item If $\CSeq{\Psi}{\Delta,\Ex x.\ A(x)}{\delta}$ then
$\CSeq{\Psi}{\Delta,A(a)}{\delta}$ where $a\not\in\Psi,\Delta,\delta$.
\end{itemize}
\end{lemma}
\begin{proof} Easy inductions. \end{proof}
\begin{theorem}[Contraction]
\label{constr.thm.contract}
The rule
\[
\Infer[$Contract$]
{\CSeq{\Psi}{\Gamma,A}{\gamma}}
{\CSeq{\Psi}{\Gamma,A,A'}{\gamma} & \Psi\Entails A\Ueq A'}
\]
\noindent
is admissible in $\CB$.
\end{theorem}
\begin{definition}
We call a contraction step \emph{syntactic} if the formulas are
syntactically identical. In that case, the rule
\[
\Infer[$Contract$]
{\CFSeq{\Psi}{\Gamma, A}{\gamma}}
{\CFSeq{\Psi}{\Gamma, A, A}{\gamma}}
\]
holds, since there are no nontrivial equations arising from
$A\Ueq A$.
\end{definition}
\begin{proof}
Induction on the derivation of $\CSeq{\Psi}{\Gamma,A,A'}{\gamma}$.
If $A$ is not principal in the last rule applied, then use the
induction hypotheses and the same rule. Otherwise, $A$ is
principal. We show some representative cases.
\begin{description}
\item[Case:]
\[
\Infer
{\CSeq{\Psi}{\Gamma,A_1\And A_2,A_1'\And A_2'}{\gamma}}
{\CSeq{\Psi}{\Gamma,A_1, A_2,A_1'\And A_2'}{\gamma}}
\]
where $\Psi\Entails A_1\And A_2\Ueq A_1'\And A_2'$.
By the definition of an entailment relation, we have that
$\Psi\Entails A_1\And A_2\Ueq A_1'\And A_2'$
By the inversion lemma we have a derivation of
$\CSeq{\Psi}{\Gamma,A_1, A_2,A_1', A_2'}{\gamma}$.
Then use the induction hypothesis (twice). The side-conditions
are valid since if $\Psi\Entails A_1\And A_2$ then $\Psi\Entails A_i$
and the conjuncts of $A_1\Ueq A_1'$ are a subset of the conjuncts
of $A_1\And A_2\Ueq A_1'\And A_2'$.
\item[Case:]
\[
\Infer[\Ex$-L$_a]
{\CSeq{\Psi}{\Gamma,\Ex x.~A(x), B}{\gamma}}
{\CSeq{\Psi}{\Gamma, A(a), B}{\gamma}}
\]
where $\Psi\Entails\Ex x~.A(x)\Ueq B$ and $a\not\in B$. If $B$ is not an
existential, then $\Psi\Entails\Bot$ so $\Psi\Entails A(a)\Ueq B$
and we can use the IH directly, giving a derivation of
$\CSeq{\Psi}{\Gamma, A(a)}{\gamma}$ and we can use $\Ex$-L.
Otherwise $B=\Ex x.~B'(x)$ and we can use the inversion lemma for a
derivation of ${\CSeq{\Psi}{\Gamma, A(a), B(b)}{\gamma}}$ where
$a\neq b$, $b\not\in\Psi,\Gamma,A(a),\gamma$. Then we have
$\Psi\And a=b\Entails A(a)\Ueq B(b)$ and we have a derivation of
${\CSeq{\Psi\And a=b}{\Gamma, A(a)}{\gamma}}$ from which we can again use
$\Ex$-L to derive ${\CSeq{\Psi\And a=b}{\Gamma, \Ex x.~A(x)}{\gamma}}$.
Theorem \ref{constr.thm.strengthen} gives us a derivation of
${\CSeq{\Psi}{\Gamma, \Ex x.~A(x)}{\gamma}}$ since $a$ and $b$ do not
occur in $\Gamma, \Ex x.~A(x), \gamma$.
\end{description}
\end{proof}
\begin{lemma}
\label{constr.lem.exists}
If $\CSeq{\Psi(x)}{\Gamma}{\gamma}$ and $x\not\in\Gamma,\gamma$ then
$\CSeq{\Ex x.~\Psi(x)}{\Gamma}{\gamma}$.
\end{lemma}
\begin{proof}
This is an odd lemma, since in the rules currently given
for the backward calculus, no formulas ever enter the constraints,
and the proof is trivial. We will of course need to revisit this
proof when we introduce rules that add formulas to the constraint context.
\end{proof}
\begin{theorem}[Soundness]
If there is a derivation of $\CFSeq{\Psi}{\Delta}{\delta}$ then there is
a derivation of any $\CSeq{\Psi'}{\Delta'}{\delta'}$ where
$(\CFSeq{\Psi}{\Delta}{\delta})\Subsumes (\CSeq{\Psi'}{\Delta'}{\delta'})$
\end{theorem}
\begin{proof}
We have $\Psi'\Entails\Psi$, $\Delta \subseteq\Delta'$ and $\delta \subseteq\delta'$.
We proceed by induction on the derivation. We show some representative cases.
\begin{description}
\item[Case:]
\[
\Infer
{\CFSeq{p\Ueq p'}{p}{p'}}
{}
\]
Then $\Delta'=\Delta'', p$, $\delta=\delta'=p'$ and
$\Psi'\Entails p\Ueq p'$. Then the Init rule gives a derivation
of $\CSeq{\Psi'}{\Delta'', p}{p'}$ as required.
\item[Case:]
\[
\Infer[\And$-R$]
{\CFSeq{\Psi_1\And\Psi_2}{\Gamma_1\Union\Gamma_2}{A_1\And A_2}}
{ \CFSeq{\Psi_1}{\Gamma_1}{A_1} & \CSeq{\Psi_2}{\Gamma_2}{A_2} }
\]
We have that $\Gamma_1\Union\Gamma_2 \subseteq \Gamma$,
$\gamma_1\Union\gamma_2 \subseteq \gamma$ and
$\Phi\Entails\Phi_1\And\Phi_2$. Using multiset and entailment
reasoning, we can use the IH to derive
$\CSeq{\Psi}{\Gamma}{A_1}$ and $\CSeq{\Psi}{\Gamma}{A_2}$. Then
$\And$-R yields $\CSeq{\Psi}{\Gamma}{A_1\And A_2}$.
\item[Case:]
\[
\Infer[\All$-R$^x]
{\CFSeq{\All x.~\Psi(x)}{\Delta}{\All x.~A(x)}}
{\CFSeq{\Psi(x)}{\Delta}{A(x)}}
\]
Since $\Psi'\Entails\All x.~\Psi(x)$, $\Psi'\Entails\Psi(x)$,
so we can use the IH
to obtain $\CSeq{\Psi'}{\Delta}{A(x)}$. Then
\[
\Infere[$Weaken$]
{\CSeq{\Psi'}{\Delta'}{\All x.~A(x)}}
{
\Infer[\All$-R$]
{\CSeq{\Psi'}{\Delta}{\All x.~A(x)}}
{\CSeq{\Psi'}{\Delta}{A(x)}}
}
\]
\item[Case:]
\[
\Infer[\All$-L$]
{\CFSeq{\Psi}{\Delta, \All x.~A(x)}{\delta}}
{\CFSeq{\Psi}{\Delta, A(t)}{\delta}}
\]
By IH we have a derivation of $\CSeq{\Psi'}{\Delta, A(t)}{\delta}$.
If $\All x.~A(x)\in\Delta$ then we can use
$\All$-L directly. Otherwise weaken the derivation and use $\All$-L.
\item[Case:]
\[
\Infer[$Contract$]
{\CFSeq{\Psi \And A \doteq A'}{\Delta, A}{\delta}}
{\CFSeq{\Psi}{\Delta, A, A'}{\delta}}
\]
Since $\Psi'\Entails \Psi\And A\Ueq A'$, $\Psi'\Entails\Psi$. We can thus use the IH
to derive $\CSeq{\Psi'}{\Delta, A, A'}{\delta}$.
Since $\Psi'\Entails A\Ueq A'$ and contraction is admissible
(Theorem~\ref{constr.thm.contract})
we have a derivation of $\CSeq{\Psi'}{\Delta, A}{\delta}$. Weaken this
derivation to get $\CSeq{\Psi'}{\Delta', A}{\delta}$
\item[Case:]
\[
\Infer[\Ex$-C$]
{\CFSeq{\Ex x.~\Psi(x)}{\Delta}{\delta}}
{\CFSeq{\Psi(x)}{\Delta}{\delta} & x\not\in\Vars(\Delta,\delta)}
\]
Since $\Psi'\Entails \Ex x.~\Psi(x)$, there is some $t$ such that
$\Psi'\Entails \Psi(t)$.
By Theorem~\ref{constr.thm.subst} we have a derivation of
$(\CFSeq{\Psi(x)}{\Delta}{\delta})\Set{x\to t}$. Since
$x\not\in\Vars(\Delta,\delta)$ this is also a derivation of
$\CFSeq{\Psi(t)}{\Delta}{\delta}$. By IH, we have
$\CSeq{\Psi'}{\Delta}{\delta}$. Weakening gives the final result.
\end{description}
\end{proof}
\begin{theorem}[Completeness]
If $\CSeq{\Psi}{\Delta}{\delta}$ then there exists $\Psi',\Delta',\delta'$ such
that $(\CFSeq{\Psi'}{\Delta'}{\delta'})\Subsumes (\CSeq{\Psi}{\Delta}{\delta})$.
\end{theorem}
\begin{proof}
Induction on the derivation.
\begin{description}
\item[Case:]
\[
\Infer[$Init$]
{\CSeq{\Psi}{p}{p'}}
{\Psi \models p \doteq p'}
\]
$(\CFSeq{p\Ueq p'}{p}{p'})\Subsumes (\CSeq{\Psi}{\Delta, p}{p'})$ since
$\Psi \models p \doteq p'$.
\item[Case:]
\[
\Infer[\And$-R$]
{\CSeq{\Psi}{\Gamma}{A_1\And A_2}}
{ \CSeq{\Psi}{\Gamma}{A_1} & \CSeq{\Psi}{\Gamma}{A_2} }
\]
By IH, we have $q_1=\CFSeq{\Psi_1}{\Gamma_1}{\gamma_1}$ and
$q_2=\CFSeq{\Psi_2}{\Gamma_2}{\gamma_2}$ where $\Psi\Entails \Psi_1$ and
$\Psi\Entails \Psi_2$. If $A_i\not\in\gamma_i$ then $q_i$ will do. Otherwise
we use $\And$-R to get
$\CFSeq{\Psi_1\And\Psi_2}{\Gamma_1\Union\Gamma_2}{A_1\And A_2}$. By entailment
reasoning, $\Psi\Entails\Psi_1\And\Psi_2$. We may need to follow this
derivation by some number of syntatic contractions, yielding the result.
\item[Case:]
\[
\Infer[\All$-R$^a]
{\CSeq{\Psi}{\Gamma}{\All x.~A(x)}}
{\CSeq{\Psi}{\Gamma}{A(a)}}
\]
By IH, there is $q=(\CFSeq{\Psi'}{\Delta}{\delta})\Subsumes(\CSeq{\Psi}{\Gamma}{A(a)})$.
If $\delta=\emptyset$ then $q\Subsumes\CSeq{\Psi}{\Gamma}{\All x.~A(x)}$.
Otherwise we can use $\All$-R to yield
$\CFSeq{\All x.~\Psi'(x)}{\Delta}{\All x.~A(x)}$. Since
$\Psi\Entails\Psi'(a)$,
$\Psi\Entails\All x.~\Psi'(x)$ as required.
\item[Case:]
\[
\Infer[\All$-L$]
{\CSeq{\Psi}{\Gamma, \All x.~A(x)}{\gamma}}
{\CSeq{\Psi}{\Gamma, \All x.~A(x), A(t)}{\gamma}}
\]
By IH, there is $q=\CFSeq{\Psi'}{\Gamma'}{\gamma'}$ such that
$q\Subsumes(\CSeq{\Psi}{\Gamma, \All x.~A(x), A(t)}{\gamma})$.
If $A(t)\not\in\Gamma'$, then $q$ will do. Otherwise, use $\All$-L to
derive $\CFSeq{\Psi'}{\Gamma',\All x.~A(x)}{\gamma'}$. If the number of
occurrances of $\All x.~A(x)$ in $\Gamma'$ is the same as that in
$\Gamma$, we need a syntactic contraction step.
\end{description}
\end{proof}
\section{Free-variable calculus}
\input{constr/free}
\begin{theorem}[Simplify]
If $\CFSeq{\Psi}{\Gamma}{\gamma}$ and $\Psi'\Entails\Psi$ then
$\CFSeq{\Psi'}{\Gamma}{\gamma}$.
\end{theorem}
\begin{example}
Let $\xi=(\All x.~p(x)\Imp p(f(x)))\Imp c=d\Imp p(c)\Imp p(f(d))$.
\begin{itemize}
\item[]
\item Label the subformulas
\[
\begin{array}{l@{\hspace{2em}}l@{\hspace{2em}}l}
l_1^-(x) : p(x)\Imp p(f(x))
&
l_2^- : \All x.~l_1(x)
&
l_3^+ : p(c)\Imp p(f(d))
\\
l_4^+ : c=d\Imp l_3
&
l_5^+ : l_2\Imp l_4
\end{array}
\]
\item Calculate the initial rules
\[
\begin{array}{c}
\begin{array}{ccc}
\Infer[r_1]
{ \CFSeq{\Psi_1\And\Psi_2}{l_1(x)}{\cdot} }
{ \CFSeq{\Psi_1}{p(f(x))}{\cdot} & \CFSeq{\Psi_2}{\cdot}{p(x)} }
&
\hspace{2em}
\Infer[r_2]
{ \CFSeq{\Psi}{l_2}{\cdot} }
{ \CFSeq{\Psi}{ l_1(x) }{\cdot} }
&
\hspace{2em}
\Infer[r_3]
{ \CFSeq{\Psi}{\cdot}{l_3} }
{ \CFSeq{\Psi}{ p(c) }{p(f(d))} }
\end{array}
\\[2em]
\begin{array}{ccc}
\Infer[r_4]
{ \CFSeq{\Psi}{\cdot}{l_4} }
{ \CFSeq{\Psi}{ c=d }{l_3} }
&
\hspace{2em}
\Infer[r_5]
{ \CFSeq{\Psi}{\cdot}{l_5} }
{ \CFSeq{\Psi}{ l_2 }{l_4} }
&
\hspace{2em}
\Infer[r_6]
{ \CFSeq{\Psi\And c=d}{ c=d }{\cdot} }
{ \CFSeq{\Psi}{\cdot}{\cdot} }
\end{array}
\end{array}
\]
\item The goal is $\CFSeq{\Top}{\cdot}{l_5}$
\item Saturate the database
\renewcommand{\Sa}{x_1\Ueq c\And x_2\Ueq c}
\renewcommand{\Qa}{\infer{\FSeq{p(x_1)}{p(x_2)}}{\Sa}}
\renewcommand{\Sb}{\Ex x_5.~x_3\Ueq f(x_5)\And x_4\Ueq f(x_5)}
\renewcommand{\Qb}{\infer{\FSeq{p(x_3)}{p(x_4)}}{\Sb}}
\renewcommand{\Sc}{x_3\Ueq f(y_1)\And x_2 \Ueq y_1\And \Sa\And (\Sb)}
\renewcommand{\Qc}{\infer{\FSeq{p(x_1),l_1(y_1)}{p(x_4)}}{\Sc}}
\renewcommand{\Sd}{x_1\Ueq c\And y_1\Ueq c \And (\Ex x_5.~f(y_1)\Ueq f(x_5)\And x_4\Ueq f(x_5))}
\renewcommand{\Qd}{\Infer{\FSeq{p(x_1),l_1(y_1)}{p(x_4)}}{\Sd}}
\renewcommand{\Se}{x_1\Ueq c\And y_1\Ueq c \And (\Ex x_5.~f(c)\Ueq f(x_5)\And x_4\Ueq f(x_5))}
\renewcommand{\Qe}{\Infer{\FSeq{p(x_1),l_2}{p(x_4)}}{\Se}}
\renewcommand{\Sf}{\Ex y_1.~x_1\Ueq c\And y_1\Ueq c \And (\Ex x_5.~f(c)\Ueq f(x_5)\And x_4\Ueq f(x_5))}
\renewcommand{\Qf}{\Infer{\FSeq{p(x_1),l_2}{p(x_4)}}{\Sf}}
\renewcommand{\Sg}{x_1\Ueq c\And (\Ex x_5.~f(c)\Ueq f(x_5)\And x_4\Ueq f(x_5))}
\renewcommand{\Qg}{\Infer{\FSeq{p(x_1),l_2}{p(x_4)}}{\Sg}}
\renewcommand{\Sh}{x_1\Ueq c\And x_4\Ueq f(d)\And x_1\Ueq c\And (\Ex x_5.~f(c)\Ueq f(x_5)\And x_4\Ueq f(x_5))}
\renewcommand{\Qh}{\Infer{\FSeq{l_2}{l_3}}{\Sh}}
\renewcommand{\Si}{\Ex x_5.~f(c)\Ueq f(x_5)\And f(d)\Ueq f(x_5)}
\renewcommand{\Qi}{\Infer{\FSeq{l_2}{l_3}}{\Si}}
\renewcommand{\Sj}{c=d\And(\Ex x_5.~f(c)\Ueq f(x_5)\And f(d)\Ueq f(x_5))}
\renewcommand{\Qj}{\Infer{\FSeq{l_2,c=d}{l_3}}{\Sj}}
\renewcommand{\Sk}{c=d\And(\Ex x_5.~f(c)\Ueq f(x_5)\And f(d)\Ueq f(x_5))}
\renewcommand{\Qk}{\Infer{\FSeq{l_2}{l_4}}{\Sk}}
\renewcommand{\Sl}{c=d\And(\Ex x_5.~f(c)\Ueq f(x_5)\And f(d)\Ueq f(x_5))}
\renewcommand{\Ql}{\Infer{\FSeq{\cdot}{l_5}}{\Sl}}
\begin{tabbing}
$\Qa$ \` 1. Init\\[1em]
$\Qb$ \` 2. Init\\[1em]
$\Qc$ \` 3. $r_1[1, 2]$\\[1em]
$\Qd$ \` 4. $\Set{x_3\to f(y_1),x_2\to y_1}$\\[1em]
$\Qe$ \` 5. $r_2[4], \Set{y_1\to c}$\\[1em]
$\Qf$ \` 6. $\Ex$-C$[5]$\\[1em]
$\Qg$ \` 7. Simp.\\[1em]
$\Qh$ \` 8. $r_3[7]$\\[1em]
$\Qi$ \` 9. $\Set{x_1\to c,x_4\to f(d)}$\\[1em]
$\Qj$ \` 10. $r_6[9]$\\[1em]
$\Qk$ \` 11. $r_4[10]$\\[1em]
$\Ql$ \` 12. $r_5[11]$\\[1em]
\end{tabbing}
\end{itemize}
\noindent
The final sequent subsumes the goal because
$\Top\Entails c=d\And(\Ex x_5.~f(c)\Ueq f(x_5)\And f(d)\Ueq f(x_5))$
with $x_5\to d$. (If $f$ is uninterpreted by the domain, we
could have simplified the constraint of sequent 4 to
$x_1\Ueq c\And y_1\Ueq c \And x_4\Ueq c$ making the remaining derivation
simpler.)
\end{example}
\section{Focused derivations}
\begin{definition}[Formulas]
\[
\begin{array}{rrl}
\mbox{Sorts} &\sigma & ::= \SortI \Sep \ldots \\
\mbox{Domain Atoms} & e & ::= x < y \Sep x = y \Sep \ldots \\
\mbox{Positive Formulas} & A^+ & ::= e^+ \Sep p^+ \Sep A^+\AndP A^+\Sep \TopP \Sep A^+\Or A^+ \Sep \Down A^- \Sep \Ex x:\sigma.\ A^+ \\
\mbox{Negative Formulas} & A^- & ::= p^- \Sep A^-\AndN A^- \Sep \TopN \Sep A^+\Imp A^- \Sep \All x:\sigma.\ A^- \\
\end{array}
\]
\end{definition}
\begin{definition}[Erasure]
\[
\begin{array}{cc}
\begin{array}{rl}
\Erase{e^+}&=e^+\\
\Erase{p^+}&=p^+\\
\Erase{p^-}&=p^-\\
\Erase{A_1^+\AndP A_2^+} &= \Erase{A_1^+}\AndP\Erase{A_2^+} \\
\Erase{\TopP} &= \Top \\
\Erase{A_1^+\Or A_2^+} &= \Erase{A_1^+}\Or\Erase{A_2^+} \\
\Erase{\Ex x:\sigma.~A^+} &= \Ex x:\sigma.\Erase{A^+}\\
\Erase{A_1^-\AndN A_2^-} &= \Erase{A_1^-}\AndN\Erase{A_2^-} \\
\Erase{\TopN} &= \Top \\
\Erase{A_1^+\Imp A_2^-} &= \Erase{A_1^+}\Imp\Erase{A_2^-} \\
\Erase{\All x:\sigma.~A^-} &= \All x:\sigma.~\Erase{A^-}\\
\end{array}
&
\hspace{2em}
\begin{array}{rl}
\Erase{\CCSeq{\Psi}{\Gamma}{\gamma}}&=\CCSeq{\Psi}{\Erase{\Gamma}}{\Erase{\gamma}} \\
\Erase{\cdot}&=\cdot\\
\Erase{\Gamma,\gamma}&=\Erase{\Gamma},\Erase{\gamma}\\
\Erase{[A]}&=\Erase{A}\\
\Erase{\ASet{A}}&=\Erase{A}\\
\end{array}
\end{array}
\]
\end{definition}
\input{constr/focus}
\begin{theorem}[Focal substitution]
\begin{itemize}
\item[]
\item If $\CCSeq{\Psi_1}{\Gamma_1}{[A^+]}$ and $\CCSeq{\Psi_2}{\Gamma_2,\ASet{A^+}}{\gamma}$
then $\CCSeq{\Psi_1\And\Psi_2}{\Gamma_1,\Gamma_2}{\gamma}$
\item If $\CCSeq{\Psi_1}{\Gamma_1}{\ASet{A^-}}$ and $\CCSeq{\Psi_2}{\Gamma_2,[A^-]}{\gamma}$
then $\CCSeq{\Psi_1\And\Psi_2}{\Gamma_1,\Gamma_2}{\gamma}$
\end{itemize}
\end{theorem}
\begin{proof}
TODO
\end{proof}
\begin{theorem}[Cut admissibility]
\newcommand{\GammaF}{\PossFocus{\Gamma}}
\newcommand{\GammaI}{\PossInvert{\Gamma}}
\newcommand{\gammaF}{\PossFocus{\gamma}}
\newcommand{\gammaI}{\PossInvert{\gamma}}
\begin{enumerate}
\item[]
\item If $\CCSeq{\Psi}{\Gamma
}{[A^+]}$ and $\CCSeq{\Psi}{\GammaI,A^+}{\gammaI}$
then $\CCSeq{\Psi}{\Gamma}{\gamma}$.
\item If $\CCSeq{\Psi}{\Gamma}{A^-}$ and $\CCSeq{\Psi}{\Gamma,[A^-]}{\gamma}$
then $\CCSeq{\Psi}{\Gamma}{\gamma}$.
\item If $\CCSeq{\Psi}{\Gamma}{A^+}$ and $\CCSeq{\Psi}{\Gamma,A^+}{\gamma}$
then $\CCSeq{\Psi}{\Gamma}{\gamma}$.
\item If $\CCSeq{\Psi}{\Gamma}{A^-}$ and $\CCSeq{\Psi}{\Gamma,A^-}{\gamma}$
then $\CCSeq{\Psi}{\Gamma}{\gamma}$.
\end{enumerate}
\end{theorem}
\begin{theorem}[Identity expansion]
\begin{itemize}
\item[]
\item If $\CCSeq{\Psi}{\Gamma}{\ASet{A^-}}$ then $\CCSeq{\Psi_1}{\Gamma}{A^-}$.
\item If $\CCSeq{\Psi}{\Gamma, \ASet{A^+}}{\gamma}$ then
$\CCSeq{\Psi}{\Gamma,A^+}{\gamma}$
\end{itemize}
\end{theorem}
\begin{proof}
TODO
\end{proof}
\section{Related Work}
\section{Future Work}
\subsection{Non-convex domains}
DLO example
\input{constr/nonconvex}
\section{XXX Notes XXX}
\begin{itemize}
\item When we add rules that muck with $\Psi$ (e.g. in modal logic)
we must revisit all of the proofs to add the cases for the new
rules.
\item Example: contracting $\CFSeq{\Top}{p(x), p(y)}{p(y)}$
gives $\CFSeq{\Top\And x=y}{p(y)}{p(y)}$ from which you
need $\CFSeq{\Ex x.~\Top\And x=y}{p(y)}{p(y)}$.
\item Faced with a rule like
\Infer
{\CFSeq{\Psi}{x = y}{\cdot}}
{\CFSeq{x=y\Imp\Psi}{\cdot}{\cdot}}
we are in the position of repeatedly applying this rule.
It may be necessary of course (the situation is similar to
$\All$-L and $\Box$-L), but we should \emph{never
contract} two hypotheses arising this way.
\end{itemize}
\section{CURRENT}
\subsection{The unfocused rules are admissible.}
\input{constr/unfoc-admis}
%%% Local Variables:
%%% mode: latex
%%% TeX-master: "thesis"
%%% End:
| seanmcl/thesis | thesis.old/old/constr2.tex | TeX | gpl-3.0 | 27,872 |
/* GCompris - tangram.js
*
* Copyright (C) 2016 Bruno Coudoin <bruno.coudoin@gcompris.net>
*
* Authors:
* Yves Combe / Philippe Banwarth (GTK+ version)
* Bruno Coudoin <bruno.coudoin@gcompris.net> (Qt Quick port)
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <https://www.gnu.org/licenses/>.
*/
.pragma library
.import QtQuick 2.6 as Quick
var currentLevel = 0
var items
function start(items_) {
items = items_
currentLevel = 0
initLevel()
}
function stop() {
}
function initLevel() {
items.bar.level = currentLevel + 1
}
function nextLevel() {
if(items.numberOfLevel <= ++currentLevel ) {
currentLevel = 0
}
initLevel();
}
function previousLevel() {
if(--currentLevel < 0) {
currentLevel = items.numberOfLevel - 1
}
initLevel();
}
function getRandomInt(min, max) {
return Math.floor(Math.random() * (max - min + 1) + min);
}
// Determines the angle of a straight line drawn between point one and two.
// The number returned, which is a float in radian,
// tells us how much we have to rotate a horizontal line clockwise
// for it to match the line between the two points.
function getAngleOfLineBetweenTwoPoints(x1, y1, x2, y2) {
var xDiff = x2 - x1;
var yDiff = y2 - y1;
return Math.atan2(yDiff, xDiff);
}
function getDistance(ix, iy, jx, jy) {
return Math.sqrt(Math.pow((ix - jx), 2) + Math.pow((iy - jy), 2))
}
function dumpTans(tans) {
console.log("== tans ==")
for(var i = 0; i < tans.length; i++) {
console.log(tans[i].img, tans[i].x, tans[i].y, tans[i].rotation, tans[i].flipping)
}
}
/* Returns the [x, y] coordinate of the closest point */
function getClosest(point) {
var nbpiece = items.currentTans.pieces.length
var closestItem
var closestDist = 1
for(var i = 0; i < nbpiece; i++) {
var p1 = items.currentTans.pieces[i]
var dist = getDistance(p1.x, p1.y, point[0], point[1])
if(dist < closestDist) {
closestDist = dist
closestItem = p1
}
}
if(closestDist < 0.1)
return [closestItem.x, closestItem.y]
return
}
function check() {
var nbpiece = items.currentTans.pieces.length
var userTans = items.userList.asTans()
for(var i = 0; i < nbpiece; i++) {
var p1 = items.currentTans.pieces[i]
var ok = false
for(var j = 0; j < nbpiece; j++) {
var p2 = userTans[j]
// Check type distance and rotation are close enough
if(p1.img === p2.img &&
p1.flipping == p2.flipping &&
getDistance(p1.x, p1.y, p2.x, p2.y) < 0.01 &&
p1.rotation === p2.rotation ) {
ok = true
break
}
}
if(!ok)
return false
}
return true
}
function toDataset() {
var nbpiece = items.currentTans.pieces.length
var userTans = items.userList.asTans()
var tanss = ' {\n' +
" 'bg': '',\n" +
" 'name': '" + items.currentTans.name + "',\n" +
" 'colorMask': '#999',\n" +
" 'pieces': [\n"
for(var i = 0; i < nbpiece; i++) {
var p1 = items.currentTans.pieces[i]
var p2 = userTans[i]
tanss += ' {' + '\n' +
" 'img': '" + p1.img + "',\n" +
" 'flippable': " + p1.flippable + ',\n' +
" 'flipping': " + p2.flipping + ',\n' +
" 'height': " + p1.height + ',\n' +
" 'initFlipping': " + p1.initFlipping + ',\n' +
" 'initRotation': " + p1.initRotation + ',\n' +
" 'initX': " + p1.initX + ',\n' +
" 'initY': " + p1.initY + ',\n' +
" 'moduloRotation': " + p1.moduloRotation + ',\n' +
" 'rotation': " + p2.rotation + ',\n' +
" 'width': " + p1.width + ',\n' +
" 'x': " + p2.x + ',\n' +
" 'y': " + p2.y + '\n' +
" },\n";
}
tanss += ' ]\n' +
' },\n'
return(tanss)
}
/* In edition mode arrow keys allow the move by 1 pixels in any direction */
function processPressedKey(event) {
if ( items.editionMode && items.selectedItem && items.selectedItem.selected) {
/* Move the player */
switch (event.key) {
case Qt.Key_Right:
items.selectedItem.x += 1
event.accepted = true
break
case Qt.Key_Left:
items.selectedItem.x -= 1
event.accepted = true
break
case Qt.Key_Up:
items.selectedItem.y -= 1
event.accepted = true
break
case Qt.Key_Down:
items.selectedItem.y += 1
event.accepted = true
break
}
}
}
| bdoin/GCompris-qt | src/activities/tangram/tangram.js | JavaScript | gpl-3.0 | 5,852 |
/*
* Copyright 2015 (C) Karlsruhe Institute of Technology (KIT)
* Marc Rittinghaus
*
* Simutrace Client Library (libsimutrace) is part of Simutrace.
*
* libsimutrace is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* libsimutrace is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with libsimutrace. If not, see <http://www.gnu.org/licenses/>.
*/
#include "SimuStor.h"
#include "DynamicStream.h"
#include "ClientStream.h"
namespace SimuTrace
{
DynamicStream::DynamicStream(StreamId id, const DynamicStreamDescriptor& desc,
StreamBuffer& buffer,
ClientSession& session) :
ClientStream(id, desc.base, buffer, session),
_desc(desc)
{
ThrowOn(isVariableEntrySize(desc.base.type.entrySize), Exception,
"Variable entry size not supported for dynamic streams.");
ThrowOnNull(_desc.operations.getNextEntry, Exception,
"A dynamic stream must own a getNextEntry handler.");
// Give the caller a chance to initialize stream-local data.
if (_desc.operations.initialize != nullptr) {
int result = _desc.operations.initialize(&desc, id, &_desc.userData);
ThrowOn(result != 0, UserCallbackException, result);
}
}
DynamicStream::~DynamicStream()
{
if (_desc.operations.finalize != nullptr) {
_desc.operations.finalize(getId(), _desc.userData);
}
}
void DynamicStream::_initializeDynamicHandle(StreamHandle handle,
StreamStateFlags flags,
StreamAccessFlags aflags,
void* userData)
{
// ---------- This function must not throw (see _open()) --------------
assert(handle != nullptr);
handle->flags = flags | StreamStateFlags::SsfDynamic;
handle->accessFlags = aflags;
handle->stream = this;
handle->entrySize = _desc.base.type.entrySize;
// We set the values so that we will always fall in the segment load
// path in StGetNextEntry() and StGetPreviousEntry()
assert(getEntrySize(&_desc.base.type) >= 1);
handle->entry = nullptr;
handle->segment = INVALID_SEGMENT_ID;
handle->segmentStart = (byte*)1;
handle->segmentEnd = nullptr;
handle->dyn.operations = &_desc.operations;
handle->dyn.userData = userData;
}
StreamHandle DynamicStream::_append(StreamHandle handle)
{
Throw(InvalidOperationException);
}
StreamHandle DynamicStream::_open(QueryIndexType type, uint64_t value,
StreamAccessFlags flags, StreamHandle handle)
{
#ifdef _DEBUG
if (handle != nullptr) {
assert(handle->stream == this);
assert(IsSet(handle->flags, StreamStateFlags::SsfRead));
assert(IsSet(handle->flags, StreamStateFlags::SsfDynamic));
}
#endif
// Specifying no flags and a handle will lead us to copy the
// handle's flags. Otherwise, we use the specified flags.
if ((handle != nullptr) && (flags == StreamAccessFlags::SafNone)) {
flags = handle->accessFlags;
} else {
if (handle != nullptr) {
handle->accessFlags = flags;
}
}
void* userData = (handle != nullptr) ?
handle->dyn.userData : nullptr;
if (_desc.operations.open != nullptr) {
// The dynamic stream can define a custom open handler. If this
// handler fails, we will keep the handle intact and update the
// user data. It may contain information that lets the user
// retry the operation later.
try {
int result = _desc.operations.open(&_desc, getId(), type,
value, flags, &userData);
ThrowOn(result != 0, UserCallbackException, result);
} catch (...) {
// We do not need to call the close operation of the handle
// here, because:
// We can get here only if the user callback directly throwed
// an exception or if we ran into the ThrowOn. The first
// should never happen legitimately, because the public API
// does not throw. So the user throwed an exception and did
// not catch it. This is a bug. In the case that we throwed
// the UserCallbackException, the user reports us that the
// open call failed. A close is not necessary. However, the
// user might already updated (e.g., freed) the user data. We
// therefore update it here.
if (handle != nullptr) {
handle->dyn.userData = userData;
}
throw;
}
}
if (handle == nullptr) {
try {
std::unique_ptr<StreamStateDescriptor> desc(
new StreamStateDescriptor());
_initializeDynamicHandle(desc.get(), SsfRead, flags, userData);
handle = desc.get();
_addHandle(desc);
} catch (...) {
// The user possible saw the open operation, so we need to
// call the close operation here.
if (_desc.operations.close != nullptr) {
_desc.operations.close(getId(), &userData);
}
throw;
}
} else {
// Must not throw, or we would need to call close()!
_initializeDynamicHandle(handle, SsfRead, flags, userData);
}
LogDebug("Created new dynamic read handle for stream %d.", getId());
return handle;
}
void DynamicStream::_closeHandle(StreamHandle handle)
{
assert(handle != nullptr);
assert(handle->stream == this);
assert(IsSet(handle->flags, StreamStateFlags::SsfDynamic));
if (_desc.operations.close != nullptr) {
_desc.operations.close(getId(), &handle->dyn.userData);
}
}
void DynamicStream::queryInformation(StreamQueryInformation& informationOut) const
{
informationOut.descriptor = getDescriptor();
informationOut.stats = StreamStatistics();
}
} | simutrace/simutrace | simutrace/libsimutrace/DynamicStream.cpp | C++ | gpl-3.0 | 7,023 |
# Proxy-Checker
INSTALLER: setup.exe
INSTRUCTIONS: Download and follow on-screen prompts. Application will automatically update periodically.
Multi-threaded open source batch proxy checker.
Created by Eric904P
| Eric904P/Proxy-Checker | publish/README.md | Markdown | gpl-3.0 | 259 |
ModX Revolution 2.5.0 = 0e30bc951e5d219ec9f147da8e179542
| gohdan/DFC | known_files/hashes/core/model/modx/sqlsrv/modworkspace.map.inc.php | PHP | gpl-3.0 | 57 |
/*
* =====================================================================================
*
* Filename: dict.c
*
* Description: A Dict for me.
*
* Version: 1.0
* Created: 12/23/2015 01:47:17 PM
* Revision: none
* Compiler: gcc
*
* Author: Lee Sheen (leesheen@outlook.com),
* Organization:
*
* =====================================================================================
*/
#define _GNU_SOURCE
#include "dict.h"
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#undef _GNU_SOURCE
static void print_help()
{
printf("Usage: dict [options] [value] ...\n");
printf("<value> has to be either integral(raw mode) or decimal(percent mode) depending on the specified value mode.\n");
printf("<options> can be any of the following:\n\n");
printf("Operations:\n");
printf(" -H -h:\tPrints this help and exits\n");
printf("\n 请输出需要查询的关键字，比如\n\n ~ dict example\n");
printf("\n 如果英文段落中有“'”(单引号)等符号，可以在需要翻译的语句前后加半角双引号，比如\n\n ~ dict \"I'm a programmer.\"\n\n");
return ;
}
static void print_version()
{
printf("--------\n\n\n\n\n");
}
static DICT_BOOL dict_choose_api(DICT_STR *dict_str_tmp, char *optarg)
{
int i;
DICT_BOOL is_print_help = TRUE;
dict_str_tmp->is_vaild = FALSE;
for (i=0; i<DICT_API_NAME_NUM; i++)
{
if (NULL != strcasestr(g_dict_api_name_array[i], optarg))
{
dict_str_tmp->dict_api = i;
dict_str_tmp->is_vaild = TRUE;
is_print_help = FALSE;
}
}
return is_print_help;
}
static DICT_BOOL dict_arg_init(DICT_STR *dict_str_tmp,
int argc, char *argv[])
{
int i = 0;
int opt_res = 0;
int content_len = 0;
DICT_BOOL is_print_version = FALSE;
DICT_BOOL is_print_help = FALSE;
/* 可选参数默认选项 */
dict_str_tmp->is_vaild = TRUE;
dict_str_tmp->dict_api = API_YOUDAO; /* TODO 从配置文件中导入*/
dict_str_tmp->res_in = stdin;
dict_str_tmp->res_out = stdout;
while (-1 != (opt_res = getopt(argc, argv, DICT_OPTSTRING)))
{
switch (opt_res)
{
/* 版本 */
case 'v':
{
dict_str_tmp->is_vaild = FALSE;
is_print_version = TRUE;
break;
}
/* TODO 输入选项 */
case 'i':
{break;}
/* TODO 输出选项 */
case 'o':
{break;}
/* API选择 <baidu> <youdao> etc...*/
case 'a':
{
is_print_help = dict_choose_api(dict_str_tmp, optarg);
break;
}
/* 测试参数 */
case 'V':
{break;}
/* 帮助 */
case 'H':
case 'h':
default:
{
is_print_help = TRUE;
dict_str_tmp->is_vaild = FALSE;
break;
}
}
}
/* 填充content_location */
if ((optind == argc) && (is_print_version != TRUE))
{
is_print_help = TRUE;
dict_str_tmp->is_vaild = FALSE;
}
else
dict_str_tmp->content_location = optind;
/* 填充content_len */
for (i=optind; i<argc; i++)
{
content_len += strlen(argv[i]);
content_len += 1;
}
dict_str_tmp->content_len = content_len;
if (is_print_version == TRUE)
print_version();
if (is_print_help == TRUE)
print_help();
return dict_str_tmp->is_vaild;
}
static DICT_BOOL dict_str_add_content(DICT_STR * dict_str_tmp,
int argc, char *argv[])
{
int i;
int len = dict_str_tmp->content_len;
int location = dict_str_tmp->content_location;
unsigned char *content = (unsigned char *)malloc(len);
if (NULL == content)
return FALSE;
memset(content, 0, len);
/* Strcat what words needs translate */
for (i=location; i<argc; i++)
{
strncat(content, argv[i], strlen(argv[i]));
strncat(content, " ", 1);
}
content[len-1] = '\0';
dict_str_tmp->content = content;
return TRUE;
}
static int dict_init(DICT_STR **dict_str_pp, int argc, char *argv[])
{
int ret = ERRNO_INIT;
int trans_words_len = 0;
DICT_STR dict_str_tmp;
dict_arg_init(&dict_str_tmp, argc, argv);
if (dict_str_tmp.is_vaild == FALSE)
{
printf("[DICT]%s: DICT_STR is vaild.", __func__);
return ret;
}
if (dict_str_add_content(&dict_str_tmp, argc, argv) == FALSE)
{
free(dict_str_tmp.content);
printf("[DICT]%s: DICT_STR add content error.", __func__);
return ret;
}
if ((*dict_str_pp = (DICT_STR *)malloc(sizeof (DICT_STR))) == NULL)
{
free(dict_str_tmp.content);
printf("[DICT]%s: DICT_STR malloc failed.", __func__);
return ret;
}
memcpy(*dict_str_pp, &dict_str_tmp, sizeof (DICT_STR));
return (ret = ERRNO_SUCCESS);
}
static int dict_exec(DICT_STR *dict_str_p)
{
int ret = 0;
//baidu_translate(resout, trans_chars);
// youdao_translate(resout, trans_chars);
return ret;
}
static void dict_free(DICT_STR *dict_str_p)
{
free(dict_str_p->content);
free(dict_str_p);
return ;
}
int main(int argc, char *argv[])
{
int ret = 0;
DICT_STR *my_dict_str = NULL;
ret = dict_init(&my_dict_str, argc, argv);
if (ERRNO_INIT == ret)
{
/* 如果没有初始化此结构体，说明用户执行 --help ,
* 并没有出错，所有此处不打印出错信息，直接返回。
* 而对于程序来说，--help或者错误的参数也是程序
* 没有正确执行的一部分，所以main仍返回错误。*/
if (NULL != my_dict_str)
printf("[DICT]%s: Initialization Failed.", __func__);
return ret;
}
ret = dict_exec(my_dict_str);
if (ERRNO_EXEC == ret)
printf("[DICT]%s: Execution Failed.", __func__);
dict_free(my_dict_str);
return ret;
}
| leesheen/dict-c | src/dict.c | C | gpl-3.0 | 5,412 |
#ifndef __ENVIRONMENT_H
#define __ENVIRONMENT_H
#include <string>
#include <map>
#include "Selection.h"
#include "Vec3D.h"
class Environment
{
public:
static Environment* getInstance();
nameEntry get_clipboard();
void set_clipboard(nameEntry* entry);
bool view_holelines;
// values for areaID painting
int selectedAreaID;
std::map<int, Vec3D> areaIDColors; // List of all area IDs to draw them with different colors
// hold keys
bool ShiftDown;
bool AltDown;
bool CtrlDown;
bool SpaceDown;
bool paintMode;
int flagPaintMode;
int screenX;
int screenY;
float Pos3DX;
float Pos3DY;
float Pos3DZ;
float cursorColorR;
float cursorColorG;
float cursorColorB;
float cursorColorA;
int cursorType;
private:
Environment();
static Environment* instance;
nameEntry clipboard;
};
#endif
| axelsheva/noggit | src/Environment.h | C | gpl-3.0 | 810 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- NewPage -->
<html lang="de">
<head>
<!-- Generated by javadoc (1.8.0_92) on Tue Feb 28 05:24:56 CET 2017 -->
<title>MySQLConnection</title>
<meta name="date" content="2017-02-28">
<link rel="stylesheet" type="text/css" href="../../stylesheet.css" title="Style">
<script type="text/javascript" src="../../script.js"></script>
</head>
<body>
<script type="text/javascript"><!--
try {
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="MySQLConnection";
}
}
catch(err) {
}
//-->
var methods = {"i0":9,"i1":9,"i2":9};
var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],8:["t4","Concrete Methods"]};
var altColor = "altColor";
var rowColor = "rowColor";
var tableTab = "tableTab";
var activeTableTab = "activeTableTab";
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar.top">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.top.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="class-use/MySQLConnection.html">Use</a></li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../index-files/index-1.html">Index</a></li>
<li><a href="../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../mysql/DBM/MyObjectToSerialize.html" title="class in mysql.DBM"><span class="typeNameLink">Prev Class</span></a></li>
<li><a href="../../mysql/DBM/ObjectSerializationToMySQL.html" title="class in mysql.DBM"><span class="typeNameLink">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../index.html?mysql/DBM/MySQLConnection.html" target="_top">Frames</a></li>
<li><a href="MySQLConnection.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary: </li>
<li>Nested | </li>
<li>Field | </li>
<li>Constr | </li>
<li><a href="#method.summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li>Field | </li>
<li>Constr | </li>
<li><a href="#method.detail">Method</a></li>
</ul>
</div>
<a name="skip.navbar.top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<!-- ======== START OF CLASS DATA ======== -->
<div class="header">
<div class="subTitle">mysql.DBM</div>
<h2 title="Class MySQLConnection" class="title">Class MySQLConnection</h2>
</div>
<div class="contentContainer">
<ul class="inheritance">
<li>java.lang.Object</li>
<li>
<ul class="inheritance">
<li>mysql.DBM.MySQLConnection</li>
</ul>
</li>
</ul>
<div class="description">
<ul class="blockList">
<li class="blockList">
<hr>
<br>
<pre>public class <span class="typeNameLabel">MySQLConnection</span>
extends java.lang.Object</pre>
</li>
</ul>
</div>
<div class="summary">
<ul class="blockList">
<li class="blockList">
<!-- ========== METHOD SUMMARY =========== -->
<ul class="blockList">
<li class="blockList"><a name="method.summary">
<!-- -->
</a>
<h3>Method Summary</h3>
<table class="memberSummary" border="0" cellpadding="3" cellspacing="0" summary="Method Summary table, listing methods, and an explanation">
<caption><span id="t0" class="activeTableTab"><span>All Methods</span><span class="tabEnd"> </span></span><span id="t1" class="tableTab"><span><a href="javascript:show(1);">Static Methods</a></span><span class="tabEnd"> </span></span><span id="t4" class="tableTab"><span><a href="javascript:show(8);">Concrete Methods</a></span><span class="tabEnd"> </span></span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Method and Description</th>
</tr>
<tr id="i0" class="altColor">
<td class="colFirst"><code>static void</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../mysql/DBM/MySQLConnection.html#insertName-java.lang.String-java.lang.String-">insertName</a></span>(java.lang.String firstName,
java.lang.String lastName)</code>
<div class="block">Fügt einen neuen Datensatz hinzu</div>
</td>
</tr>
<tr id="i1" class="rowColor">
<td class="colFirst"><code>static void</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../mysql/DBM/MySQLConnection.html#printNameList--">printNameList</a></span>()</code>
<div class="block">Schreibt die Namensliste in die Konsole</div>
</td>
</tr>
<tr id="i2" class="altColor">
<td class="colFirst"><code>static void</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../mysql/DBM/MySQLConnection.html#updateName-java.lang.String-java.lang.String-int-">updateName</a></span>(java.lang.String firstName,
java.lang.String lastName,
int actorId)</code>
<div class="block">Aktualisiert den Datensatz mit der übergebenen actorId</div>
</td>
</tr>
</table>
<ul class="blockList">
<li class="blockList"><a name="methods.inherited.from.class.java.lang.Object">
<!-- -->
</a>
<h3>Methods inherited from class java.lang.Object</h3>
<code>equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait</code></li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
<div class="details">
<ul class="blockList">
<li class="blockList">
<!-- ============ METHOD DETAIL ========== -->
<ul class="blockList">
<li class="blockList"><a name="method.detail">
<!-- -->
</a>
<h3>Method Detail</h3>
<a name="printNameList--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>printNameList</h4>
<pre>public static void printNameList()</pre>
<div class="block">Schreibt die Namensliste in die Konsole</div>
</li>
</ul>
<a name="insertName-java.lang.String-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>insertName</h4>
<pre>public static void insertName(java.lang.String firstName,
java.lang.String lastName)</pre>
<div class="block">Fügt einen neuen Datensatz hinzu</div>
</li>
</ul>
<a name="updateName-java.lang.String-java.lang.String-int-">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>updateName</h4>
<pre>public static void updateName(java.lang.String firstName,
java.lang.String lastName,
int actorId)</pre>
<div class="block">Aktualisiert den Datensatz mit der übergebenen actorId</div>
</li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
</div>
<!-- ========= END OF CLASS DATA ========= -->
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar.bottom">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.bottom.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="class-use/MySQLConnection.html">Use</a></li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../index-files/index-1.html">Index</a></li>
<li><a href="../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../mysql/DBM/MyObjectToSerialize.html" title="class in mysql.DBM"><span class="typeNameLink">Prev Class</span></a></li>
<li><a href="../../mysql/DBM/ObjectSerializationToMySQL.html" title="class in mysql.DBM"><span class="typeNameLink">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../index.html?mysql/DBM/MySQLConnection.html" target="_top">Frames</a></li>
<li><a href="MySQLConnection.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary: </li>
<li>Nested | </li>
<li>Field | </li>
<li>Constr | </li>
<li><a href="#method.summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li>Field | </li>
<li>Constr | </li>
<li><a href="#method.detail">Method</a></li>
</ul>
</div>
<a name="skip.navbar.bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
| Blair79/ArduCopterGUI | ArduCopterGUI/doc/mysql/DBM/MySQLConnection.html | HTML | gpl-3.0 | 9,779 |
"use strict";
//Singleton pattern for things context
exports.emitter = (function () {
// Instance stores a reference to the Singleton
var instance;
function init() {
// Singleton
// Private methods and variables
var EventEmitter = require('events').EventEmitter;
var eventEmitter = new EventEmitter();
return {
// Public methods and variables
getEmitter: function(){
return eventEmitter;
}
};
};
return {
// Get the Singleton instance if one exists
// or create one if it doesn't
getInstance: function () {
if ( !instance ) {
instance = init();
}
return instance;
}
};
})(); | famargon/ubiquitous-things | ubiquitous-things/core/eventsEngine/eventSingelton.js | JavaScript | gpl-3.0 | 715 |
Install dependencies:
conda create -n debuggee -c dfroger python=3.5 cython debug
conda create -n debugger -c dfroger python=2.7 cython gdb
Get debugger path:
source activate debugger
DEBUGGER_PATH=$CONDA_PREFIX/bin
Build extension to debug and test:
source activate debuggee
make ext
make test
Debug extension:
$DEBUGGER_PATH/cygdb . -- --args python main.py
| dfroger/quickstart | cython/debug/README.md | Markdown | gpl-3.0 | 399 |
/*******************************************************************************
* Goggles Audio Player Library *
********************************************************************************
* Copyright (C) 2010-2021 by Sander Jansen. All Rights Reserved *
* --- *
* This program is free software: you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation, either version 3 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program. If not, see http://www.gnu.org/licenses. *
********************************************************************************/
#ifndef MEM_PACKET_H
#define MEM_PACKET_H
#include "ap_buffer.h"
#include "ap_event.h"
#include "ap_signal.h"
#include "ap_format.h"
namespace ap {
class Packet;
/*
class Stream {
FXint id;
FXlong length;
FXlong position;
};
*/
class PacketPool {
protected:
FXLFQueueOf<Packet> packets;
Semaphore semaphore;
public:
/// Constructor
PacketPool();
/// Initialize pool
FXbool init(FXival sz,FXival n);
/// free pool
void free();
/// Block until packet is available or signal is set
Packet * wait(const Signal &);
/// Put event back into pool
void push(Packet*);
/// Destructor
~PacketPool();
};
class Packet : public Event, public MemoryBuffer {
friend class PacketPool;
protected:
PacketPool* pool;
public:
AudioFormat af;
FXuchar flags;
FXlong stream_position;
FXlong stream_length;
protected:
Packet(PacketPool*,FXival sz);
virtual ~Packet();
public:
virtual void unref();
void reset();
FXbool full() const { return (af.framesize() > space()); }
FXint numFrames() const { return size() / af.framesize(); }
FXint availableFrames() const { return space() / af.framesize(); }
void wroteFrames(FXint nframes) { wroteBytes(nframes*af.framesize()); }
void appendFrames(const FXuchar * buf,FXival nframes) { append(buf,af.framesize()*nframes); }
FXint copyFrames(FXuchar *& buf, FXint & nframes) {
FXint n = FXMIN(nframes,availableFrames());
if (n) {
const FXint nbytes = af.framesize()*n;
append(buf,nbytes);
nframes-=n;
buf+=nbytes;
}
return n;
}
};
}
#endif
| gogglesmm/gogglesmm | gap/ap_packet.h | C | gpl-3.0 | 3,089 |
/*
This file is part of the OdinMS Maple Story Server
Copyright (C) 2008 Patrick Huy <patrick.huy@frz.cc>
Matthias Butz <matze@odinms.de>
Jan Christian Meyer <vimes@odinms.de>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as
published by the Free Software Foundation version 3 as published by
the Free Software Foundation. You may not use, modify or distribute
this program under any other version of the GNU Affero General Public
License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package server;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import client.IItem;
import client.MapleCharacter;
import client.MapleInventoryType;
import constants.InventoryConstants;
import java.util.ArrayList;
import tools.MaplePacketCreator;
/**
*
* @author Matze
*/
public class MapleTrade {
private MapleTrade partner = null;
private List<IItem> items = new ArrayList<IItem>();
private List<IItem> exchangeItems;
private int meso = 0;
private int exchangeMeso;
boolean locked = false;
private MapleCharacter chr;
private byte number;
public MapleTrade(byte number, MapleCharacter c) {
chr = c;
this.number = number;
}
private static int getFee(int meso) {
int fee = 0;
if (meso >= 100000000) {
fee = (int) Math.round(0.06 * meso);
} else if (meso >= 25000000) {
fee = meso / 20;
} else if (meso >= 10000000) {
fee = meso / 25;
} else if (meso >= 5000000) {
fee = (int) Math.round(.03 * meso);
} else if (meso >= 1000000) {
fee = (int) Math.round(.018 * meso);
} else if (meso >= 100000) {
fee = meso / 125;
}
return fee;
}
private void lock() {
locked = true;
partner.getChr().getClient().getSession().write(MaplePacketCreator.getTradeConfirmation());
}
private void complete1() {
exchangeItems = partner.getItems();
exchangeMeso = partner.getMeso();
}
private void complete2() {
items.clear();
meso = 0;
for (IItem item : exchangeItems) {
if ((item.getFlag() & InventoryConstants.KARMA) == InventoryConstants.KARMA) {
item.setFlag((byte) (item.getFlag() ^ InventoryConstants.KARMA)); //items with scissors of karma used on them are reset once traded
}
MapleInventoryManipulator.addFromDrop(chr.getClient(), item, true);
}
if (exchangeMeso > 0) {
int overflow = chr.updateMesosGetOverflow(exchangeMeso - getFee(exchangeMeso));
partner.chr.gainMeso(overflow, true);
}
exchangeMeso = 0;
if (exchangeItems != null) {
exchangeItems.clear();
}
chr.getClient().getSession().write(MaplePacketCreator.getTradeCompletion(number));
}
private void cancel() {
for (IItem item : items) {
MapleInventoryManipulator.addFromDrop(chr.getClient(), item, true);
}
if (meso > 0) {
chr.gainMeso(meso, true, true, true);
}
meso = 0;
if (items != null) {
items.clear();
}
exchangeMeso = 0;
if (exchangeItems != null) {
exchangeItems.clear();
}
chr.getClient().getSession().write(MaplePacketCreator.getTradeCancel(number));
}
private boolean isLocked() {
return locked;
}
private int getMeso() {
return meso;
}
public void setMeso(int meso) {
if (locked) {
throw new RuntimeException("Trade is locked.");
}
if (meso < 0) {
System.out.println("[h4x] " + chr.getName() + " Trying to trade < 0 mesos");
return;
}
if (chr.getMeso() >= meso) {
chr.gainMeso(-meso, false, true, false);
this.meso += meso;
chr.getClient().getSession().write(MaplePacketCreator.getTradeMesoSet((byte) 0, this.meso));
if (partner != null) {
partner.getChr().getClient().getSession().write(MaplePacketCreator.getTradeMesoSet((byte) 1, this.meso));
}
} else {
}
}
public void addItem(IItem item) {
items.add(item);
chr.getClient().getSession().write(MaplePacketCreator.getTradeItemAdd((byte) 0, item));
if (partner != null) {
partner.getChr().getClient().getSession().write(MaplePacketCreator.getTradeItemAdd((byte) 1, item));
}
}
public void chat(String message) {
chr.getClient().getSession().write(MaplePacketCreator.getTradeChat(chr, message, true));
if (partner != null) {
partner.getChr().getClient().getSession().write(MaplePacketCreator.getTradeChat(chr, message, false));
}
}
public MapleTrade getPartner() {
return partner;
}
public void setPartner(MapleTrade partner) {
if (locked) {
return;
}
this.partner = partner;
}
public MapleCharacter getChr() {
return chr;
}
public List<IItem> getItems() {
return new LinkedList<IItem>(items);
}
private boolean fitsInInventory() {
MapleItemInformationProvider mii = MapleItemInformationProvider.getInstance();
Map<MapleInventoryType, Integer> neededSlots = new LinkedHashMap<MapleInventoryType, Integer>();
for (IItem item : exchangeItems) {
MapleInventoryType type = mii.getInventoryType(item.getItemId());
if (neededSlots.get(type) == null) {
neededSlots.put(type, 1);
} else {
neededSlots.put(type, neededSlots.get(type) + 1);
}
}
for (Map.Entry<MapleInventoryType, Integer> entry : neededSlots.entrySet()) {
if (chr.getInventory(entry.getKey()).isFull(entry.getValue() - 1)) {
return false;
}
}
return true;
}
public static void completeTrade(MapleCharacter c) {
c.getTrade().lock();
MapleTrade local = c.getTrade();
MapleTrade partner = local.getPartner();
if (partner.isLocked()) {
local.complete1();
partner.complete1();
if (!local.fitsInInventory() || !partner.fitsInInventory()) {
cancelTrade(c);
c.message("There is not enough inventory space to complete the trade.");
partner.getChr().message("There is not enough inventory space to complete the trade.");
return;
}
if (local.getChr().getLevel() < 15) {
if (local.getChr().getMesosTraded() + local.exchangeMeso > 1000000) {
cancelTrade(c);
local.getChr().getClient().getSession().write(MaplePacketCreator.sendMesoLimit());
return;
} else {
local.getChr().addMesosTraded(local.exchangeMeso);
}
} else if (c.getTrade().getChr().getLevel() < 15) {
if (c.getMesosTraded() + c.getTrade().exchangeMeso > 1000000) {
cancelTrade(c);
c.getClient().getSession().write(MaplePacketCreator.sendMesoLimit());
return;
} else {
c.addMesosTraded(local.exchangeMeso);
}
}
local.complete2();
partner.complete2();
partner.getChr().setTrade(null);
c.setTrade(null);
}
}
public static void cancelTrade(MapleCharacter c) {
c.getTrade().cancel();
if (c.getTrade().getPartner() != null) {
c.getTrade().getPartner().cancel();
c.getTrade().getPartner().getChr().setTrade(null);
}
c.setTrade(null);
}
public static void startTrade(MapleCharacter c) {
if (c.getTrade() == null) {
c.setTrade(new MapleTrade((byte) 0, c));
c.getClient().getSession().write(MaplePacketCreator.getTradeStart(c.getClient(), c.getTrade(), (byte) 0));
} else {
c.message("You are already in a trade.");
}
}
public static void inviteTrade(MapleCharacter c1, MapleCharacter c2) {
if (c2.getTrade() == null) {
c2.setTrade(new MapleTrade((byte) 1, c2));
c2.getTrade().setPartner(c1.getTrade());
c1.getTrade().setPartner(c2.getTrade());
c2.getClient().getSession().write(MaplePacketCreator.getTradeInvite(c1));
} else {
c1.message("The other player is already trading with someone else.");
cancelTrade(c1);
}
}
public static void visitTrade(MapleCharacter c1, MapleCharacter c2) {
if (c1.getTrade() != null && c1.getTrade().getPartner() == c2.getTrade() && c2.getTrade() != null && c2.getTrade().getPartner() == c1.getTrade()) {
c2.getClient().getSession().write(MaplePacketCreator.getTradePartnerAdd(c1));
c1.getClient().getSession().write(MaplePacketCreator.getTradeStart(c1.getClient(), c1.getTrade(), (byte) 1));
} else {
c1.message("The other player has already closed the trade.");
}
}
public static void declineTrade(MapleCharacter c) {
MapleTrade trade = c.getTrade();
if (trade != null) {
if (trade.getPartner() != null) {
MapleCharacter other = trade.getPartner().getChr();
other.getTrade().cancel();
other.setTrade(null);
other.message(c.getName() + " has declined your trade request.");
}
trade.cancel();
c.setTrade(null);
}
}
} | am910021/YuriMS | src/server/MapleTrade.java | Java | gpl-3.0 | 10,325 |
/*
This file is part of Darling.
Copyright (C) 2021 Lubos Dolezel
Darling is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Darling is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with Darling. If not, see <http://www.gnu.org/licenses/>.
*/
#include <Foundation/Foundation.h>
@protocol AKWebKitControllerDelegate
@end
| darlinghq/darling | src/private-frameworks/AuthKitUI/include/AuthKitUI/AKWebKitControllerDelegate.h | C | gpl-3.0 | 760 |
window.utils = window.utils || {};
window.utils.files = (function() {
function getSize(size) {
var quantity, unit;
if (size < Math.pow(1024, 2)) {
quantity = size / 1024;
unit = "KB";
} else if (size < Math.pow(1024, 3)) {
quantity = size / Math.pow(1024, 2);
unit = "MB";
} else {
quantity = size / Math.pow(1024, 3);
unit = "GB";
}
return quantity.toFixed(2) + " " + unit;
}
function getMIME(ext) {
var returned = {actions: '', mime: ''};
for (var i = 0; i < MIME.length; i++) {
if (MIME[i].extensions.indexOf(ext) > -1) {
returned = MIME[i];
break;
}
}
if (!('labels' in returned)) {
returned.labels = [];
}
return returned;
}
function getType(file) {
var filename = file.split('/').pop();
var parts = filename.split('.');
if (parts.length > 1) {
var MIME = getMIME(parts.pop());
return MIME.mime;
}
return '';
}
function getIcon(type, ext) {
var name = 'unknown';
if (type.length > 0) {
for (var i = 0; i < MIME.length; i++) {
if (new RegExp(MIME[i].pattern) .test(type)) {
name = MIME[i].class;
break;
}
}
} else {
for (var j = 0; j < MIME.length; j++) {
if (MIME[j].extensions.indexOf(ext) > -1) {
name = MIME[j].class;
break;
}
}
}
return name;
}
return {
'size': getSize,
'mime': getMIME,
'icon': getIcon,
'type': getType
};
})();
var files = (function () {
var _ = window.navigator.mozL10n.get;
var microtime = 0;
var curDir = '';
var allFiles = [];
var allCards = [];
var curFile = null;
var curItem = null;
var fileList = document.querySelector('#index .files');
var tasks = [];
function addTask(action, source, target, onsuccess, onerror) {
source.type = source.type || 'file';
source.dir = source.dir || curDir;
source.file = source.file || curFile;
source.item = source.item || curItem;
switch (action) {
case 'delete':
if (source.type === 'file') {
deleteFile(source.file.blob.name, source.item, source.dir);
} else if (source.type === 'folder') {
source.type = 'files';
source.files = deleteFolder(source.dir);
}
break;
case 'rename':
if (source.type === 'file') {
var filename = '/' + source.dir + '/' + target.name;
replaceFile(source.file.blob.name, {
'name': filename,
'type': utils.files.type(filename),
'size': source.file.blob.size
}, filename, true);
showFileList();
} else if (source.type === 'folder') {
var response = replaceFolder(source.dir, target.name, true);
source.type = 'files';
source.files = response[0];
target.names = response[1];
}
break;
case 'copy':
if (target.replace) {
replaceFile(source.file.blob.name, source.file.blob, false, true);
} else {
pushFile({'name': target.name, 'blob': {
'name': target.name,
'type': source.file.blob.type,
'size': source.file.blob.size
}, 'disabled': true});
}
if (target.dir === curDir) {
showFileList();
}
break;
case 'move':
deleteFile(source.file.blob.name, source.item, source.dir);
if (target.replace) {
replaceFile(target.name, source.file.blob, false, true);
} else {
pushFile({'name': target.name, 'blob': {
'name': target.name,
'type': source.file.blob.type,
'size': source.file.blob.size
}, 'disabled': true});
}
break;
}
tasks.push({'action': action, 'source': source, 'target': target, 'onsuccess': onsuccess, 'onerror': onerror});
this.isExecuting = true;
}
function executeTasks() {
if (tasks.length > 0) {
var task = tasks.shift();
var action = task.action;
var source = task.source;
var target = task.target;
var onsuccess = task.onsuccess || false;
var onerror = task.onerror || false;
source.type = source.type || 'file';
source.dir = source.dir || curDir;
if (source.type === 'file') {
source.file = source.file || curFile;
switch (action) {
case 'delete':
storage.delete(source.file.blob.name, function () {
source.file.blob = null;
source.file = null;
if (onsuccess) onsuccess();
executeTasks();
}, function () {
if (onerror) onerror();
executeTasks();
});
break;
case 'rename':
var filename = '/' + source.dir + '/' + target.name;
storage.create(source.file.blob, filename, function () {
storage.delete(source.file.blob.name, function () {
storage.get(filename, function (e) {
source.file.blob = null;
source.file = null;
replaceFile(filename, e.target.result);
if (source.dir === curDir) {
showFileList();
}
if (onsuccess) onsuccess();
executeTasks();
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
break;
case 'copy':
var filename = target.name;
if (target.replace) {
storage.delete(filename, function () {
storage.create(source.file.blob, filename, function () {
storage.get(filename, function (e) {
replaceFile(filename, e.target.result);
if (target.dir === curDir) {
showFileList();
}
if (onsuccess) onsuccess();
executeTasks();
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
} else {
storage.create(source.file.blob, filename, function () {
storage.get(filename, function (e) {
replaceFile(filename, e.target.result);
if (target.dir === curDir) {
showFileList();
}
if (onsuccess) onsuccess();
executeTasks();
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
}
break;
case 'move':
var filename = target.name;
if (target.replace) {
storage.delete(filename, function () {
storage.create(source.file.blob, filename, function () {
storage.get(filename, function (e) {
var result = e.target.result;
storage.delete(source.file.blob.name, function () {
replaceFile(filename, result);
if (target.dir === curDir) {
showFileList();
}
if (onsuccess) onsuccess();
executeTasks();
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
} else {
storage.create(source.file.blob, filename, function () {
storage.get(filename, function (e) {
var result = this.result;
storage.delete(source.file.blob.name, function () {
replaceFile(filename, result);
if (target.dir === curDir) {
showFileList();
}
if (onsuccess) onsuccess();
executeTasks();
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
}, function () {
if (onerror) onerror();
executeTasks();
});
}
break;
}
} else if (source.type === 'files') {
for (var j = source.files.length - 1; j > -1; j--) {
var fileSource = {
'type': 'file',
'file': source.files[j],
'dir': source.dir
};
if (action === 'rename' && 'names' in target) {
var newFilename = target.names[j];
target = null;
target = {'name': newFilename};
}
if (j === source.files.length - 1) {
tasks.unshift({'action': action, 'source': fileSource, 'target': target, 'onsuccess': onsuccess, 'onerror': onerror});
} else {
tasks.unshift({'action': action, 'source': fileSource, 'target': target});
}
}
executeTasks();
}
} else {
files.isExecuting = false;
}
}
function pushFile(objFile) {
allFiles.push(objFile);
}
function pushCard(objCard) {
allCards.push(objCard);
}
function setFileList(arrList) {
allFiles.length = 0;
allFiles = arrList;
}
function clearFileList() {
allFiles.length = 0;
}
function getFolderName(dir) {
dir = dir || curDir;
return dir.split('/').pop();
}
function showFileList() {
fileList.innerHTML = '';
if (curDir.length > 0) {
var filesFound = [];
var foldersFound = [];
for (var i = 0; i < allFiles.length; i++) {
var file = allFiles[i];
if (file.name.indexOf('/' + curDir + '/') === 0) {
var parts = file.name.replace('/' + curDir + '/', '').split('/');
if (parts.length > 1) {
if (foldersFound.indexOf(parts[0]) < 0) {
foldersFound.push(parts[0]);
}
} else {
var extParts = parts[0].split('/').pop().split('.'), empty = false;
if (extParts.length > 1) {
if (extParts[0].length === 0 && extParts[1].toLowerCase() === 'empty') {
empty = true;
}
}
if (!empty) {
filesFound.push({'name': parts[0], 'blob': file.blob, 'ext': (extParts.length > 1 ? extParts.pop().toLowerCase() : ''), 'disabled': file.disabled});
}
}
}
}
foldersFound.sort(function (a, b) {
if (a.toLowerCase() < b.toLowerCase())
return -1;
if (a.toLowerCase() > b.toLowerCase())
return 1;
return 0;
});
filesFound.sort(function (a, b) {
if (a.name.toLowerCase() < b.name.toLowerCase())
return -1;
if (a.name.toLowerCase() > b.name.toLowerCase())
return 1;
return 0;
});
var liElem, asideElem, divElem, aElem, p1Elem, p2Elem;
for (var j = 0; j < foldersFound.length; j++) {
liElem = document.createElement('li');
liElem.className = 'folder';
asideElem = document.createElement('aside');
divElem = document.createElement('div');
aElem = document.createElement('a');
p1Elem = document.createElement('p');
asideElem.className = 'pack-start';
divElem.className = 'file-icon folder';
asideElem.appendChild(divElem);
aElem.href = '#';
aElem.onclick = function (folderName) {
return function (event) {
if (new Date() - microtime > 500) {
microtime = new Date();
var selector = '[name="side"]:not(.current):not(.left-to-current)';
var section = document.querySelector(selector);
var folder = document.querySelector('#folder');
fileList = document.querySelector(selector + ' .files');
curDir += '/' + folderName;
window.config.title = folderName;
showFileList();
document.querySelector('.current, .left-to-current').className = 'left';
section.className = 'current';
if (document.querySelector('#back')) {
if (!document.querySelector('#back').classList.contains('folder') && !window.isActivity) {
document.querySelector('#back').style.visibility = 'visible';
} else {
document.querySelector('#back').style.display = 'block';
document.querySelector('#close').style.display = 'none';
}
}
}
};
} (foldersFound[j]);
p1Elem.appendChild(document.createTextNode(foldersFound[j]));
aElem.appendChild(p1Elem);
liElem.appendChild(asideElem);
liElem.appendChild(aElem);
fileList.appendChild(liElem);
}
for (var k = 0; k < filesFound.length; k++) {
liElem = document.createElement('li');
liElem.className = 'file';
asideElem = document.createElement('aside');
divElem = document.createElement('div');
aElem = document.createElement('a');
p1Elem = document.createElement('p');
p2Elem = document.createElement('p');
asideElem.className = 'pack-start';
divElem.className = 'file-icon ' + utils.files.icon(filesFound[k].blob.type, filesFound[k].ext);
asideElem.appendChild(divElem);
aElem.href = '#';
aElem.onclick = function (fileName, fileBlob, fileExt) {
return function () {
if (!window.config.isActivity) {
var fileMime = utils.files.mime(fileExt);
console.log(fileMime);
var actions = {'allowed': fileMime.actions, 'labels': fileMime.labels};
curFile = {'name': fileName, 'blob': fileBlob, 'ext': fileExt, 'mime': fileMime.mime};
curItem = this.offsetParent;
utils.actions.show(fileName, actions);
} else if (window.config.activity === 'file') {
window.activity.postResult({
'type': fileBlob.type,
'blob': fileBlob
});
}
};
} (filesFound[k].name, filesFound[k].blob, filesFound[k].ext);
p1Elem.appendChild(document.createTextNode(filesFound[k].name));
p2Elem.appendChild(document.createTextNode(utils.files.size(filesFound[k].blob.size)));
aElem.appendChild(p1Elem);
aElem.appendChild(p2Elem);
liElem.appendChild(asideElem);
liElem.appendChild(aElem);
if (filesFound[k].disabled) {
liElem.dataset.disabled = 'true';
}
fileList.appendChild(liElem);
}
var folderHeader = document.querySelector('[data-type="sidebar"] > header > h1');
var valueHeader = curDir.split('/').pop();
if (folderHeader) {
folderHeader.innerHTML = '';
folderHeader.appendChild(document.createTextNode(valueHeader + '/'));
}
} else {
var liElem, asideElem, divElem, aElem, p1Elem, p2Elem;
if (!window.config.isActivity) {
document.querySelector('#drawer menu[type="toolbar"]').style.display = 'none';
}
for (var j = 0; j < allCards.length; j++) {
liElem = document.createElement('li');
liElem.className = 'folder';
asideElem = document.createElement('aside');
divElem = document.createElement('div');
aElem = document.createElement('a');
p1Elem = document.createElement('p');
p2Elem = document.createElement('p');
asideElem.className = 'pack-start';
divElem.className = 'file-icon card';
asideElem.appendChild(divElem);
aElem.href = '#';
aElem.onclick = function (cardName) {
return function (event) {
if (new Date() - microtime > 500) {
microtime = new Date();
var selector = '[name="side"]:not(.current):not(.left-to-current)';
var section = document.querySelector(selector);
var folder = document.querySelector('#folder');
fileList = document.querySelector(selector + ' .files');
curDir = cardName;
window.config.title = cardName;
storage.set(cardName);
if (!window.config.isActivity) {
document.querySelector('#drawer menu[type="toolbar"]').style.display = 'block';
}
showFileList();
document.querySelector('.current, .left-to-current').className = 'left';
section.className = 'current';
if (document.querySelector('#back')) {
if (!document.querySelector('#back').classList.contains('folder') && !window.config.isActivity) {
document.querySelector('#back').style.visibility = 'visible';
} else {
document.querySelector('#back').style.display = 'block';
document.querySelector('#close').style.display = 'none';
}
}
}
};
} (allCards[j].name);
p1Elem.appendChild(document.createTextNode(allCards[j].name));
p2Elem.appendChild(document.createTextNode(utils.files.size(allCards[j].space) + ' ' + _('of-free-space')));
aElem.appendChild(p1Elem);
aElem.appendChild(p2Elem);
liElem.appendChild(asideElem);
liElem.appendChild(aElem);
fileList.appendChild(liElem);
}
}
}
function deleteFile(strName, htmlItem, strDir) {
for (var i = 0; i < allFiles.length; i++) {
if (allFiles[i].name === strName) {
allFiles.splice(i, 1);
break;
}
}
htmlItem.parentNode.removeChild(htmlItem);
if (strDir !== undefined) {
if (!hasFiles(strDir)) {
var fileName = '/' + strDir + '/.empty';
var fileBlob = new Blob(['']);
storage.create(fileBlob, fileName, function () {
pushFile({'name': fileName, 'blob': fileBlob, 'disabled': false});
});
}
}
}
function changeFileName(strOld, strNew, objFile) {
for (var i = 0; i < allFiles.length; i++) {
if (allFiles[i].name === strOld) {
allFiles[i]['name'] = strNew;
allFiles[i]['blob'] = objFile;
break;
}
}
}
function replaceFile(oldFile, blobFile, newFile, disabled) {
newFile = newFile || oldFile;
disabled = disabled || false;
for (var i = 0; i < allFiles.length; i++) {
if (allFiles[i].name === oldFile) {
allFiles[i].name = newFile;
allFiles[i].blob = null;
allFiles[i].blob = blobFile;
allFiles[i].disabled = disabled;
break;
}
}
}
function callBack(funCallback) {
funCallback(curFile, curDir, curItem);
}
function deleteFolder(strDir, htmlItem) {
var deletedFiles = [];
for (var i = allFiles.length - 1; i > -1; i--) {
if (allFiles[i].name.indexOf('/' + strDir + '/') === 0) {
deletedFiles.push(allFiles.splice(i, 1)[0]);
}
}
if (htmlItem === undefined) {
if (strDir === curDir) {
location.href = '#';
goBack();
}
} else {
htmlItem.parentNode.removeChild(htmlItem);
}
return deletedFiles;
}
function replaceFolder(strDir, strName, disabled) {
var replacedFiles = [];
var addedFiles = [];
var parts = strDir.split('/');
if (parts.length > 0) {
var strOldName = parts.pop();
if (typeof strName === 'boolean') {
disabled = strName;
strName = strOldName;
}
parts.push(strName);
disabled = disabled || false;
for (var i = 0; i < allFiles.length; i++) {
if (allFiles[i].name.indexOf('/' + strDir + '/') === 0) {
replacedFiles.push({
'name': allFiles[i].name,
'blob': allFiles[i].blob,
'disabled': allFiles[i].disabled
});
var newFilename = '/' + parts.join('/') + '/' + allFiles[i].name.split('/').pop();
addedFiles.push(newFilename);
allFiles[i].name = newFilename;
allFiles[i].disabled = disabled;
}
}
if (strDir === curDir) {
location.href = '#';
goBack();
}
}
return [replacedFiles, addedFiles];
}
function goBack() {
var parts = curDir.split('/');
parts.splice(parts.length - 1, 1);
var folderName = parts.length > 0 ? parts[parts.length - 1] : '';
curDir = parts.join('/');
if ((allCards.length === 0 && parts.length > 1) || (allCards.length > 0 && parts.length > 0)) {
var selector = '[name="side"]:not(.current):not(.left-to-current)';
var section = document.querySelector(selector);
fileList = document.querySelector(selector + ' .files');
window.config.title = folderName;
files.show();
document.querySelector('.current, .left-to-current').className = 'right';
section.className = 'left-to-current';
} else if((allCards.length === 0 && parts.length === 1) || (allCards.length > 0 && parts.length === 0)) {
document.querySelector('.current, .left-to-current').className = 'right';
document.querySelector('section[data-position="current"]').className = 'current';
if (!document.querySelector('#back').classList.contains('folder') && !window.config.isActivity) {
document.querySelector('#back').style.visibility = 'hidden';
} else {
document.querySelector('#back').style.display = 'none';
document.querySelector('#close').style.display = 'block';
}
fileList = document.querySelector('section[data-position="current"] .files');
window.config.title = window.config.app;
files.show();
}
}
function isFile(strName) {
for (var i = 0; i < allFiles.length; i++) {
if (allFiles[i].name === strName) {
return true;
}
}
return false;
}
function hasFiles(strPath) {
for (var i = 0; i < allFiles.length; i++) {
if (allFiles[i].name.indexOf('/' + strPath + '/') === 0) {
return true;
}
}
return false;
}
if (document.querySelector('#back')) {
document.querySelector('#back').addEventListener('click', goBack);
}
if (window.config.isActivity) {
document.querySelector('#close').onclick = function (e) {
if (window.activity) {
window.activity.postError('Activity cancelled');
window.activity = null;
}
};
}
return {
get all() {
return allFiles;
},
get path() {
return curDir;
},
set path(strPath) {
curDir = strPath;
},
get isExecuting() {
if ('state' in document.querySelector('#refresh').dataset) {
return document.querySelector('#refresh').dataset.state === 'executing';
}
return false;
},
set isExecuting(state) {
if (state) {
var exec = !this.isExecuting;
document.querySelector('#refresh').dataset.state = 'executing';
if (exec) {
executeTasks();
}
} else {
document.querySelector('#refresh').dataset.state = '';
}
return state;
},
'call': callBack,
'card': pushCard,
'change': changeFileName,
'delete': deleteFile,
'isFile': isFile,
'hasFiles': hasFiles,
'folder': getFolderName,
'push': pushFile,
'replace': replaceFile,
'reset': clearFileList,
'set': setFileList,
'show': showFileList,
'task': addTask
};
})();
var folders = (function () {
var allFolders = [];
function removePath(dir) {
}
function pushFolder(action, source, target) {
switch (action) {
case 'rename':
removePath(source);
break;
}
}
function existsFolder() {
}
return {
'exists': existsFolder,
'push': pushFolder
};
})(); | FabianOvrWrt/files | js/files.js | JavaScript | gpl-3.0 | 22,469 |
{% extends "common/base.html" %}
{% load static from staticfiles %}
{% block title %}
Articles
{% endblock %}
{% block content %}
<script type="text/javascript">
$(document).ready(function() {
var minDate = new Date({{ dateRange.minDate.year }}, {{ dateRange.minDate.month }} - 1, {{ dateRange.minDate.day }});
var maxDate = new Date({{ dateRange.maxDate.year }}, {{ dateRange.maxDate.month }} - 1, {{ dateRange.maxDate.day }});
$( "#id_startDate" ).datepicker({ minDate: minDate, maxDate: maxDate });
$( "#id_endDate" ).datepicker({ minDate: minDate, maxDate: maxDate });
});
</script>
<div class="panel panel-default">
<div class="panel-heading">
<h3 class="panel-title">Search Articles</h3>
</div>
<div class="panel-body">
{% if form.non_field_errors %}
<div class="alert alert-danger" role="alert">{{ form.non_field_errors }}</div>
{% endif %}
{% if form.showAll.errors %}
<div class="alert alert-danger" role="alert">{{ form.showAll.errors }}</div>
{% endif %}
{% if form.news_source.errors %}
<div class="alert alert-danger" role="alert">{{ form.news_source.errors }}</div>
{% endif %}
{% if form.startDate.errors %}
<div class="alert alert-danger" role="alert">{{ form.startDate.errors }}</div>
{% endif %}
{% if form.endDate.errors %}
<div class="alert alert-danger" role="alert">{{ form.endDate.errors }}</div>
{% endif %}
{% if form.searchTerms.errors %}
<div class="alert alert-danger" role="alert">{{ form.searchTerms.errors }}</div>
{% endif %}
<form class="form-horizontal" action="{% url 'mainArticleView' %}" method="post">
{% csrf_token %}
<div class="form-inline text-center">
<label for="showAll">{{ form.showAll.label }}</label>
{{ form.showAll }}
<label for="news_source">{{ form.news_source.label }}</label>
{{ form.news_source }}
<label for="searchTerms">{{ form.searchTerms.label }}</label>
{{ form.searchTerms }}
</div>
<div class="form-inline text-center">
<label for="category">{{ form.category.label }}</label>
{{ form.category }}
<label for="startDate">{{ form.startDate.label }}</label>
{{ form.startDate }}
<label for="endDate">{{ form.endDate.label }}</label>
{{ form.endDate }}
</div>
<div class="form-inline text-center">
<input type="hidden" name="newSearch" value="True" />
<input type="hidden" name="clearSearch" value="False" />
<button class="btn btn-default">Search</button>
<button class="btn btn-default" onclick="this.form.reset(); return false;">Reset</button>
<button class="btn btn-default" onclick="this.form.clearSearch.value='True'; this.form.submit(); return false; ">Clear</button>
</div>
</form>
</div>
</div>
{% if articles %}
{% include "common/pagination_inc.html" with objectList=articles showExtra=1 objectLabel="Article(s)" %}
<table id="articleTable" class="table table-bordered">
<tr>
<th>Title</th>
<th>Source</th>
<th>Crime Related</th>
<th>Categories</th>
<th>Load Date</th>
<th>Last Updated</th>
<th></th>
<th>Original URL</th>
</tr>
{% for article in articles.object_list %}
<tr>
<td>{{ article.title|safe }}</td>
<td>{{ article.news_source }}</td>
<td class="text-center">
{% if article.is_relevant %}
<img src="{% static "good_checkmark.png" %}" alt="crime related" />
{% elif article.is_coded %}
<img src="{% static "bad_x.png" %}" alt="not crime related" />
{% endif %}
</td>
<td>
{% for category in article.get_categories %}
{{ category.abbreviation }}<br />
{% endfor %}
</td>
<td>{{ article.created }}</td>
<td>{{ article.last_modified }}</td>
<td>
{% if user.is_authenticated %}
<a href="{% url 'code-article' article.id %}">Code Article</a>
</td>
{% else %}
<a href="{% url 'view-article' article.id %}">View Article</a>
</td>
{% endif %}
<td><a href="{{ article.url }}">{{ article.url }}</a></td>
</tr>
{% endfor %}
</table>
{% else %}
<div class="alert alert-danger" role="alert">No articles are available.</div>
{% endif %}
{% endblock %}
| meshulam/chicago-justice | cjp/templates/newsarticles/articleList.html | HTML | gpl-3.0 | 4,406 |
using Client.Logic.Attributes;
using Client.Logic.Resources;
namespace Client.Logic.Enums
{
public enum CardStat
{
[LocalizedDescription(nameof(Texts.Defense))]
Defense = 1,
[LocalizedDescription(nameof(Texts.Damage))]
Damage,
[LocalizedDescription(nameof(Texts.Health))]
Health,
[LocalizedDescription(nameof(Texts.Mana))]
Mana
}
}
| Arcidev/Card-Game | Client.Logic/Enums/CardStats.cs | C# | gpl-3.0 | 415 |
// Copyright (C) 2006-2007 Regis COSNIER
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Text;
using System.Runtime.InteropServices;
using System.Runtime.InteropServices.ComTypes;
using DirectShowLib;
namespace DirectShowLib.Sample
{
class PSISection
{
private byte tableId; // 8 bits
private bool sectionSyntaxIndicator; // 1 bit
private bool privateIndicator; // 1 bit
private byte reserved; // 2 bits
private ushort sectionLength; // 12 bits
public virtual void Parse(byte[] data)
{
this.tableId = data[0];
this.sectionSyntaxIndicator = (data[1] >> 7) != 0;
this.privateIndicator = ((data[1] >> 6) & 0x01) != 0;
this.reserved = (byte)((data[1] >> 4) & 0x03);
this.sectionLength = (ushort)(((data[2] & 0x0F) << 8) | data[1]);
}
public byte TableId { get { return this.tableId; } set { this.tableId = value; } }
public bool SectionSyntaxIndicator { get { return this.sectionSyntaxIndicator; } set { this.sectionSyntaxIndicator = value; } }
public bool PrivateIndicator { get { return this.privateIndicator; } set { this.privateIndicator = value; } }
public byte Reserved { get { return this.reserved; } set { this.reserved = value; } }
public ushort SectionLength { get { return this.sectionLength; } set { this.sectionLength = value; } }
public virtual string ToStringSectionOnly(string prefix)
{
string result = "";
result += prefix + "TableId: " + this.tableId + "\r\n";
result += prefix + "SectionSyntaxIndicator: " + this.sectionSyntaxIndicator + "\r\n";
result += prefix + "PrivateIndicator: " + privateIndicator + "\r\n";
result += prefix + "Reserved: " + reserved + "\r\n";
result += prefix + "SectionLength: " + sectionLength + "\r\n";
return result;
}
public override string ToString()
{
return "PSISection\r\n{\r\n" + ToStringSectionOnly("\t") + "}";
}
public static PSISection ParseTable(int tableId, byte[] data)
{
PSISection table;
switch ((TABLE_IDS)tableId)
{
case TABLE_IDS.PAT:
table = new PSIPAT(); break;
case TABLE_IDS.SDT_ACTUAL:
table = new PSISDT(); break;
case TABLE_IDS.PMT:
table = new PSIPMT(); break;
default:
table = new PSISection();
break;
}
table.Parse(data);
return table;
}
public static PSISection[] GetPSITable(int pid, int tableId, IMpeg2Data mpeg2Data)
{
ArrayList al = new ArrayList();
ISectionList ppSectionList;
int hr = mpeg2Data.GetTable((short)pid, (byte)tableId, null, 5000, out ppSectionList);
if (ppSectionList != null)
{
short pidFound = -1;
ppSectionList.GetProgramIdentifier(out pidFound);
if (pidFound == (short)pid)
{
byte tableIdFound = 0;
ppSectionList.GetTableIdentifier(out tableIdFound);
if (tableIdFound == (byte)tableId)
{
short sectionCount = -1;
ppSectionList.GetNumberOfSections(out sectionCount);
short sectionNumber = 0;
for (sectionNumber=0; sectionNumber < sectionCount; sectionNumber++)
{
try
{
int pdwRawPacketLength;
IntPtr ppSection;
ppSectionList.GetSectionData(sectionNumber, out pdwRawPacketLength, out ppSection);
byte[] data = new byte[pdwRawPacketLength];
Marshal.Copy(ppSection, data, 0, pdwRawPacketLength);
PSISection table = ParseTable(tableId, data);
Marshal.ReleaseComObject(ppSectionList);
al.Add(table);
}
catch { }
}
}
}
Marshal.ReleaseComObject(ppSectionList);
}
return (PSISection[])al.ToArray(typeof(PSISection));
}
public static string ToStringByteArray(byte[] pData, int start, int size, int width, string prefix)
{
string result = "";
string lineHex = "";
string lineASCII = "";
int iter = 0, iter2 = 0;
for (; iter < size; iter++)
{
byte b = pData[iter + start];
lineHex += String.Format("{0:X2} ", b);
lineASCII += (b < 32 || b > 127 ? '.' : (char)b);
if (iter % width == width - 1)
{
result += prefix + string.Format("0x{0:X8} ", iter2) + lineHex + " " + lineASCII + "\r\n";
lineHex = "";
lineASCII = "";
iter2 += width;
}
}
if (iter % width != width - 1)
{
string padding = " ";
int paddingSize = 3 * (width - (iter % width));
for(int i = 0; i < paddingSize; i++) padding += " ";
result += prefix + string.Format("0x{0:X8} ", iter2) + lineHex + padding + lineASCII + "\r\n";
}
return result;
}
}
class PSILongSection : PSISection
{
private ushort transportStreamId; //TableIdExtension;
private byte reserved2; // 2 bits
private byte versionNumber; // 5 bits
private bool currentNextIndicator; // 1 bit
private byte sectionNumber;
private byte lastSectionNumber;
public override void Parse(byte[] data)
{
base.Parse(data);
this.transportStreamId = (ushort)((data[4] << 8) | data[3]);
this.reserved2 = (byte)(data[5] >> 6);
this.VersionNumber = (byte)((data[5] >> 1) & 0x1F);
this.currentNextIndicator = (data[5] & 0x01) != 0;
this.sectionNumber = data[6];
this.lastSectionNumber = data[7];
}
public ushort TransportStreamId { get { return this.transportStreamId; } set { this.transportStreamId = value; } }
public byte Reserved2 { get { return this.reserved2; } set { this.reserved2 = value; } }
public byte VersionNumber { get { return this.versionNumber; } set { this.versionNumber = value; } }
public bool CurrentNextIndicator { get { return this.currentNextIndicator; } set { this.currentNextIndicator = value; } }
public byte SectionNumber { get { return this.sectionNumber; } set { this.sectionNumber = value; } }
public byte LastSectionNumber { get { return this.lastSectionNumber; } set { this.lastSectionNumber = value; } }
public override string ToStringSectionOnly(string prefix)
{
string result = "";
result += base.ToStringSectionOnly(prefix);
result += prefix + string.Format("TransportStreamId: 0x{0:x4} ({1})\r\n", this.transportStreamId, this.transportStreamId);
result += prefix + "Reserved2: " + this.reserved2 + "\r\n";
result += prefix + "VersionNumber: " + this.versionNumber + "\r\n";
result += prefix + "CurrentNextIndicator: " + this.currentNextIndicator + "\r\n";
result += prefix + "SectionNumber: " + this.sectionNumber + "\r\n";
result += prefix + "LastSectionNumber: " + this.lastSectionNumber + "\r\n";
return result;
}
public override string ToString()
{
return "PSILongSection\r\n{\r\n" + ToStringSectionOnly("\t") + "}";
}
}
class PSIDSMCCSection : PSILongSection
{
private byte protocolDiscriminator;
private byte dsmccType;
private ushort messageId;
private uint transactionId;
private byte reserved3;
private byte adaptationLength;
private ushort messageLength;
public override void Parse(byte[] data)
{
}
public byte ProtocolDiscriminator { get { return this.protocolDiscriminator; } set { this.protocolDiscriminator = value; } }
public byte DsmccType { get { return this.dsmccType; } set { this.dsmccType = value; } }
public ushort MessageId { get { return this.messageId; } set { this.messageId = value; } }
public uint TransactionId { get { return this.transactionId; } set { this.transactionId = value; } }
public byte Reserved3 { get { return this.reserved3; } set { this.reserved3 = value; } }
public byte AdaptationLength { get { return this.adaptationLength; } set { this.adaptationLength = value; } }
public ushort MessageLength { get { return this.messageLength; } set { this.messageLength = value; } }
public override string ToStringSectionOnly(string prefix)
{
string result = "";
result += base.ToStringSectionOnly(prefix);
result += prefix + "ProtocolDiscriminator: " + this.protocolDiscriminator + "\r\n";
result += prefix + "DsmccType: " + this.dsmccType + "\r\n";
result += prefix + "MessageId: " + this.messageId + "\r\n";
result += prefix + "TransactionId: " + this.transactionId + "\r\n";
result += prefix + "Reserved3: " + this.reserved3 + "\r\n";
result += prefix + "AdaptationLength: " + this.adaptationLength + "\r\n";
result += prefix + "MessageLength: " + this.messageLength + "\r\n";
return result;
}
public override string ToString()
{
return "PSILongSection\r\n{\r\n" + ToStringSectionOnly("\t") + "}";
}
}
class PSIPAT : PSILongSection
{
public class Data
{
private ushort programNumber;
private byte reserved;
private ushort pid;
private bool isNetworkPID;
public ushort ProgramNumber { get { return this.programNumber; } set { this.programNumber = value; } }
public byte Reserved { get { return this.reserved; } set { this.reserved = value; } }
public ushort Pid { get { return this.pid; } set { this.pid = value; } }
public bool IsNetworkPID { get { return this.isNetworkPID; } set { this.isNetworkPID = value; } }
public string ToStringSectionOnly(string prefix)
{
string result = "";
result += prefix + string.Format("ProgramNumber: 0x{0:x4} ({1})\r\n", this.programNumber, this.programNumber);
result += prefix + "Reserved: " + this.reserved + "\r\n";
result += prefix + string.Format("Pid: 0x{0:x4} ({1})\r\n", this.pid, this.pid);
result += prefix + "IsNetworkPID: " + this.isNetworkPID + "\r\n";
return result;
}
public override string ToString()
{
return "PATData\r\n{\r\n" + ToStringSectionOnly("\t") + "}";
}
}
private ArrayList programIds = new ArrayList();
private Hashtable programIdsByProgramNumber = new Hashtable();
public ArrayList ProgramIds { get { return this.programIds; } }
public Data GetProgramIdsByProgramNumber(int programNumber)
{
return (Data)programIdsByProgramNumber[programNumber];
}
public override void Parse(byte[] data)
{
// for (i = 0; i < N; i++) {
// program_number // 16
// reserved // 3
// if (program_number == 0)
// network_PID // 13
// else
// program_map_PID // 13
// }
// CRC_32
base.Parse(data);
programIds.Clear();
for (int offset = 8; offset < this.SectionLength - 1; offset += 4)
{
Data patData = new Data();
patData.ProgramNumber = (ushort)((data[offset] << 8) | data[offset+1]);
patData.Reserved = (byte)(data[offset+2] >> 5);
patData.Pid = (ushort)(((data[offset+2] & 0x1F) << 8) | data[offset+3]);
patData.IsNetworkPID = (patData.ProgramNumber == 0);
programIds.Add(patData);
programIdsByProgramNumber[patData.ProgramNumber] = patData;
}
}
public override string ToStringSectionOnly(string prefix)
{
string result = "";
result += base.ToStringSectionOnly(prefix);
result += prefix + "for (i = 0; i < " + ProgramIds.Count + ")\r\n";
foreach (Data pat in ProgramIds)
{
result += prefix + "{\r\n";
result += pat.ToStringSectionOnly(prefix + "\t");
result += prefix + "}\r\n";
}
return result;
}
public override string ToString()
{
return "PSIPAT\r\n{\r\n" + ToStringSectionOnly("\t") + "}\r\n";
}
}
class PSIPMT : PSILongSection
{
// From Recommendation H.222.0 - ISO/IEC 13818-1
// 2.4.4.8 Program Map Table - Table 2.29
// TS_program_map_section() {
// table_id // 8
// section_syntax_indicator // 1
// '0' // 1
// reserved // 2
// section_length // 12
// program_number // 16
// reserved // 2
// version_number // 5
// current_next_indicator // 1
// section_number // 8
// last_section_number // 8
// reserved // 3
// PCR_PID // 13
// reserved // 4
// program_info_length // 12
// for (i = 0; i < N; i++) {
// descriptor()
// }
// for (i = 0; i < N1; i++) {
// stream_type // 8
// reserved // 3
// elementary_PID // 13
// reserved // 4
// ES_info_length // 12
// for (i = 0; i < N2; i++) {
// descriptor()
// }
// }
// CRC_32
// }
public class Data
{
private STREAM_TYPES streamType;
private byte reserved;
private ushort pid;
private byte reserved2;
private ushort esInfoLen;
private PSIDescriptor[] descriptors;
public STREAM_TYPES StreamType { get { return this.streamType; } set { this.streamType = value; } }
public byte Reserved { get { return this.reserved; } set { this.reserved = value; } }
public ushort Pid { get { return this.pid; } set { this.pid = value; } }
public byte Reserved2 { get { return this.reserved2; } set { this.reserved2 = value; } }
public ushort EsInfoLen { get { return this.esInfoLen; } set { this.esInfoLen = value; } }
public PSIDescriptor[] Descriptors { get { return this.descriptors; } set { this.descriptors = value; } }
public string ToStringSectionOnly(string prefix)
{
string result = "";
result += prefix + "StreamType: " + this.streamType.ToString() + string.Format(" 0x{0:x4} ({1})\r\n", (int)this.streamType, (int)this.streamType);
result += prefix + "Reserved: " + this.reserved + "\r\n";
result += prefix + string.Format("Pid: 0x{0:x4} ({1})\r\n", this.pid, this.pid);
result += prefix + "Reserved2: " + this.reserved2 + "\r\n";
result += prefix + "EsInfoLen: " + this.esInfoLen + "\r\n";
result += prefix + "for (i = 0; i < " + this.descriptors.Length + ")\r\n";
foreach (PSIDescriptor descriptor in this.descriptors)
{
result += prefix + "{\r\n";
result += descriptor.ToStringDescriptorOnly(prefix + "\t");
result += prefix + "}\r\n";
}
return result;
}
public override string ToString()
{
return "PMTData\r\n{\r\n" + ToStringSectionOnly("\t") + "}\r\n";
}
}
private byte reserved3;
private ushort pcrPid;
private byte reserved4;
private ushort programInfoLength;
private PSIDescriptor[] descriptors;
private ArrayList streams = new ArrayList();
private Hashtable streamsByType = new Hashtable();
public byte Reserved3 { get { return this.reserved3; } set { this.reserved3 = value; } }
public ushort PcrPid { get { return this.pcrPid; } set { this.pcrPid = value; } }
public byte Reserved4 { get { return this.reserved4; } set { this.reserved4 = value; } }
public ushort ProgramInfoLength { get { return this.programInfoLength; } set { this.programInfoLength = value; } }
public PSIDescriptor[] Descriptors { get { return this.descriptors; } set { this.descriptors = value; } }
public ArrayList Streams { get { return this.streams; } }
public Data GetStreamByType(STREAM_TYPES streamType)
{
return (Data)streamsByType[streamType];
}
public override void Parse(byte[] data)
{
base.Parse(data);
this.reserved3 = (byte)(data[8] >> 5);
this.pcrPid = (ushort)((data[8] & 0x1F) << 8 | data[9]);
this.reserved4 = (byte)(data[10] >> 4);
this.programInfoLength = (byte)((data[10] & 0x0F) << 8 | data[11]);
int offset = 12;
if (this.programInfoLength > 0)
{
// Parse program descriptors
this.descriptors = PSIDescriptor.ParseDescriptors(data, offset, this.programInfoLength);
}
offset += this.programInfoLength;
int streamLen = data.Length - this.programInfoLength - 16;
while (streamLen >= 5)
{
Data pmtData = new Data();
pmtData.StreamType = (STREAM_TYPES)data[offset];
pmtData.Pid = (ushort)(((data[offset + 1] & 0x1F) << 8) + data[offset + 2]);
pmtData.EsInfoLen = (ushort)(((data[offset + 3] & 0x0F) << 8) + data[offset + 4]);
pmtData.Descriptors = PSIDescriptor.ParseDescriptors(data, offset + 5, pmtData.EsInfoLen);
this.streams.Add(pmtData);
this.streamsByType[pmtData.StreamType] = pmtData;
offset += pmtData.EsInfoLen + 5;
streamLen -= pmtData.EsInfoLen + 5;
}
}
public override string ToStringSectionOnly(string prefix)
{
string result = "";
result += base.ToStringSectionOnly(prefix);
result += prefix + "Reserved3: " + this.reserved3 + "\r\n";
result += prefix + string.Format("PcrPid: 0x{0:x4} ({1})\r\n", this.pcrPid, this.pcrPid);
result += prefix + "Reserved4: " + this.reserved4 + "\r\n";
result += prefix + "ProgramInfoLength: " + this.programInfoLength + "\r\n";
if (this.descriptors != null)
{
result += prefix + "for (i = 0; i < " + this.descriptors.Length + ")\r\n";
foreach (PSIDescriptor descriptor in this.descriptors)
{
result += prefix + "{\r\n";
result += descriptor.ToStringDescriptorOnly(prefix + "\t");
result += prefix + "}\r\n";
}
}
result += prefix + "for (i = 0; i < " + this.streams.Count + ")\r\n";
foreach (Data stream in this.streams)
{
result += prefix + "{\r\n";
result += stream.ToStringSectionOnly(prefix + "\t");
result += prefix + "}\r\n";
}
return result;
}
public override string ToString()
{
return "PSIPMT\r\n{\r\n" + ToStringSectionOnly("\t") + "}\r\n";
}
}
class PSISDT : PSILongSection
{
// From ETSI EN 300 468 V1.5.1 (2003-5)
// 5.2.3 Service Description Table - Table 5
// service_description_section() {
// table_id // 8
// section_syntax_indicator // 1
// '0' // 1
// reserved // 2
// section_length // 12
// transport_stream_id // 16
// reserved // 2
// version_number // 5
// current_next_indicator // 1
// section_number // 8
// last_section_number // 8
// original_network_id // 16
// reserved // 8
// for (i = 0; i < N; i++) {
// service_id // 16
// reserved // 6
// EIT_schedule_flag // 1
// EIT_present_following_flag // 1
// running_status // 3
// free_CA_mode // 1
// descriptors_loop_length // 12
// for (i = 0; i < N1; i++) {
// descriptor()
// }
// }
// CRC_32
// }
public class Data
{
public enum RUNNING_STATUS
{
UNDEFINED = 0,
NOT_RUNNING = 1,
STARTS_IN_FEW_SECONDS = 2,
PAUSING = 3,
RUNNING = 4,
RESERVED_1 = 5,
RESERVED_2 = 6,
RESERVED_3 = 7,
}
private ushort serviceId;
private byte reserved;
private bool eitScheduleFlag;
private bool eitPresentFollowingFlag;
private RUNNING_STATUS runningStatus;
private bool freeCaMode;
private ushort descriptorsLoopLength;
private PSIDescriptor[] descriptors;
public ushort ServiceId { get { return this.serviceId; } set { this.serviceId = value; } }
public byte Reserved { get { return this.reserved; } set { this.reserved = value; } }
public bool EitScheduleFlag { get { return this.eitScheduleFlag; } set { this.eitScheduleFlag = value; } }
public bool EitPresentFollowingFlag { get { return this.eitPresentFollowingFlag; } set { this.eitPresentFollowingFlag = value; } }
public RUNNING_STATUS RunningStatus { get { return this.runningStatus; } set { this.runningStatus = value; } }
public bool FreeCaMode { get { return this.freeCaMode; } set { this.freeCaMode = value; } }
public ushort DescriptorsLoopLength { get { return this.descriptorsLoopLength; } set { this.descriptorsLoopLength = value; } }
public PSIDescriptor[] Descriptors { get { return this.descriptors; } set { this.descriptors = value; } }
public string GetServiceName()
{
foreach(PSIDescriptor descriptor in this.Descriptors)
{
if(descriptor is PSIDescriptorService)
{
PSIDescriptorService descriptorService = descriptor as PSIDescriptorService;
return descriptorService.ServiceName;
}
}
return "";
}
public string ToStringSectionOnly(string prefix)
{
string result = "";
result += prefix + "ServiceId: " + string.Format(" 0x{0:x4} ({1})\r\n", this.serviceId, this.serviceId);
result += prefix + "Reserved: " + string.Format(" 0x{0:x4} ({1})\r\n", this.reserved, this.reserved);
result += prefix + "EitScheduleFlag: " + this.eitScheduleFlag + "\r\n";
result += prefix + "EitPresentFollowingFlag: " + this.eitPresentFollowingFlag + "\r\n";
result += prefix + "RunningStatus: " + this.runningStatus + " " + string.Format(" 0x{0:x4} ({1})\r\n", (byte)this.runningStatus, (byte)this.runningStatus);
result += prefix + "FreeCaMode: " + this.freeCaMode + "\r\n";
result += prefix + "DescriptorsLoopLength: " + string.Format(" 0x{0:x4} ({1})\r\n", this.descriptorsLoopLength, this.descriptorsLoopLength);
result += prefix + "for (i = 0; i < " + this.descriptors.Length + ")\r\n";
foreach (PSIDescriptor descriptor in this.descriptors)
{
result += prefix + "{\r\n";
result += descriptor.ToStringDescriptorOnly(prefix + "\t");
result += prefix + "}\r\n";
}
return result;
}
public override string ToString()
{
return "STDData\r\n{\r\n" + ToStringSectionOnly("\t") + "}\r\n";
}
}
private ushort originalNetworkId;
private byte reserved3;
private ArrayList services = new ArrayList();
public ushort OriginalNetworkId { get { return this.originalNetworkId; } set { this.originalNetworkId = value; } }
public byte Reserved3 { get { return this.reserved3; } set { this.reserved3 = value; } }
public ArrayList Services { get { return this.services; } }
public override void Parse(byte[] data)
{
base.Parse(data);
this.originalNetworkId = (ushort)(data[8] << 8 | data[9]);
this.reserved3 = data[10];
int offset = 11;
while (offset < SectionLength - 1)
{
Data sdtData = new Data();
sdtData.ServiceId = (ushort)((data[offset] << 8) + data[offset + 1]);
sdtData.Reserved = (byte)(data[offset + 2] >> 2);
sdtData.EitScheduleFlag = ((data[offset + 2] & 0x02) != 0);
sdtData.EitPresentFollowingFlag = ((data[offset + 2] & 0x01) != 0);
sdtData.RunningStatus = (Data.RUNNING_STATUS)((data[offset + 3] >> 5) & 0x07);
sdtData.FreeCaMode = (((data[offset + 3] >> 4) & 0x01) != 0);
sdtData.DescriptorsLoopLength = (ushort)(((data[offset + 3] & 0x0F) << 8) | data[offset + 4]);
sdtData.Descriptors = PSIDescriptor.ParseDescriptors(data, offset + 5, sdtData.DescriptorsLoopLength);
this.services.Add(sdtData);
offset += sdtData.DescriptorsLoopLength + 5;
}
}
public override string ToStringSectionOnly(string prefix)
{
string result = "";
result += base.ToStringSectionOnly(prefix);
result += prefix + "OriginalNetworkId: " + string.Format(" 0x{0:x4} ({1})\r\n", this.originalNetworkId, this.originalNetworkId);
result += prefix + "Reserved3: " + string.Format(" 0x{0:x4} ({1})\r\n", this.reserved3, this.reserved3);
result += prefix + "for (i = 0; i < " + this.services.Count + ")\r\n";
foreach (Data service in this.services)
{
result += prefix + "{\r\n";
result += service.ToStringSectionOnly(prefix + "\t");
result += prefix + "}\r\n";
}
return result;
}
public override string ToString()
{
return "PSILongSection\r\n{\r\n" + ToStringSectionOnly("\t") + "}\r\n";
}
}
// pour le decodage des ECM regarder dans _mainForm_OnECMFilterData
}
| takyonxxx/Capture-DVB | Turkay_DTV/PSI.cs | C# | gpl-3.0 | 24,015 |
local ADDON_NAME, ADDON = ...
ADDON:RegisterUISetting('showShopButton', true, ADDON.L.SETTING_SHOP_BUTTON)
local function ToggleShopButton()
if (MountJournal) then
local frame = MountJournal.MountDisplay.InfoButton.Shop
if (frame) then
if (ADDON.settings.ui.showShopButton and MountJournal.selectedMountID) then
local _, _, _, _, _, sourceType, _, _, _, _, isCollected = C_MountJournal.GetMountInfoByID(MountJournal.selectedMountID)
if not isCollected and sourceType == 10 then
frame:Show()
return
end
end
frame:Hide()
end
end
end
local function CreateShopButton()
local frame = CreateFrame("Button", nil, MountJournal.MountDisplay.InfoButton)
frame:ClearAllPoints()
frame:SetPoint("BOTTOMRIGHT", MountJournal.MountDisplay, -15, 15)
frame:SetSize(28, 36)
frame:SetNormalAtlas('hud-microbutton-BStore-Up', true)
frame:SetPushedAtlas('hud-microbutton-BStore-Down', true)
frame:SetDisabledAtlas('hud-microbutton-BStore-Disabled', true)
frame:SetHighlightAtlas('hud-microbutton-highlight', true)
frame:SetScript("OnClick", function()
SetStoreUIShown(true)
end)
MountJournal.MountDisplay.InfoButton.Shop = frame
hooksecurefunc("MountJournal_UpdateMountDisplay", function(sender, level)
ToggleShopButton()
end)
end
ADDON:RegisterLoadUICallback(CreateShopButton)
| exochron/mount-journal-enhanced | UI/ShopButton.lua | Lua | gpl-3.0 | 1,489 |
package silhouette
trait SecuredUser extends com.mohiva.play.silhouette.api.Identity
| fredericoramos78/play-scala-angularjs | app/silhouette/SecuredUser.scala | Scala | gpl-3.0 | 86 |
#!/usr/bin/python
import os
import glob
import cgi
import PrintPages_test as pt
address = cgi.escape(os.environ["REMOTE_ADDR"])
script = "Main Model Form"
pt.write_log_entry(script, address)
pt.print_header('GrowChinook', 'Std')
pt.print_full_form(None, None, 'in', 'RunModel.py')
extension = 'csv'
os.chdir('uploads')
result = [i for i in glob.glob('*.csv')]
print('''
{}
</div>
</body>
'''.format(result))
print ('</html>')
| ReservoirWebs/GrowChinook | Test_test.py | Python | gpl-3.0 | 429 |
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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.17"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>BlenderFDS: blenderfds28x.lang.SP_config_default_voxel_size Class Reference</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>
<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="projectlogo"><img alt="Logo" src="blenderfds_128.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">BlenderFDS
</div>
<div id="projectbrief">BlenderFDS, the open user interface for NIST Fire Dynamics Simulator (FDS), as an addon for Blender 2.8x</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.17 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></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"><b>blenderfds28x</b></li><li class="navelem"><b>lang</b></li><li class="navelem"><a class="el" href="classblenderfds28x_1_1lang_1_1_s_p__config__default__voxel__size.html">SP_config_default_voxel_size</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="summary">
<a href="#pub-static-attribs">Static Public Attributes</a> |
<a href="classblenderfds28x_1_1lang_1_1_s_p__config__default__voxel__size-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">blenderfds28x.lang.SP_config_default_voxel_size Class Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Blender representation for the default voxel/pixel resolution.
<a href="classblenderfds28x_1_1lang_1_1_s_p__config__default__voxel__size.html#details">More...</a></p>
<div class="dynheader">
Inheritance diagram for blenderfds28x.lang.SP_config_default_voxel_size:</div>
<div class="dyncontent">
<div class="center"><img src="classblenderfds28x_1_1lang_1_1_s_p__config__default__voxel__size__inherit__graph.png" border="0" usemap="#blenderfds28x_8lang_8_s_p__config__default__voxel__size_inherit__map" alt="Inheritance graph"/></div>
<map name="blenderfds28x_8lang_8_s_p__config__default__voxel__size_inherit__map" id="blenderfds28x_8lang_8_s_p__config__default__voxel__size_inherit__map">
<area shape="rect" title="Blender representation for the default voxel/pixel resolution." alt="" coords="17,80,193,121"/>
<area shape="rect" href="classblenderfds28x_1_1types_1_1_b_f_param.html" title="Blender representation of an FDS parameter." alt="" coords="5,5,204,32"/>
</map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
<div class="dynheader">
Collaboration diagram for blenderfds28x.lang.SP_config_default_voxel_size:</div>
<div class="dyncontent">
<div class="center"><img src="classblenderfds28x_1_1lang_1_1_s_p__config__default__voxel__size__coll__graph.png" border="0" usemap="#blenderfds28x_8lang_8_s_p__config__default__voxel__size_coll__map" alt="Collaboration graph"/></div>
<map name="blenderfds28x_8lang_8_s_p__config__default__voxel__size_coll__map" id="blenderfds28x_8lang_8_s_p__config__default__voxel__size_coll__map">
<area shape="rect" title="Blender representation for the default voxel/pixel resolution." alt="" coords="17,80,193,121"/>
<area shape="rect" href="classblenderfds28x_1_1types_1_1_b_f_param.html" title="Blender representation of an FDS parameter." alt="" coords="5,5,204,32"/>
</map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-static-attribs"></a>
Static Public Attributes</h2></td></tr>
<tr class="memitem:a59a086804ebb267463f28bbb86ec8448"><td class="memItemLeft" align="right" valign="top"><a id="a59a086804ebb267463f28bbb86ec8448"></a>
string </td><td class="memItemRight" valign="bottom"><b>label</b> = "Voxel/Pixel Size"</td></tr>
<tr class="separator:a59a086804ebb267463f28bbb86ec8448"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9af27491cdae0b53913bff3e52c39bde"><td class="memItemLeft" align="right" valign="top"><a id="a9af27491cdae0b53913bff3e52c39bde"></a>
string </td><td class="memItemRight" valign="bottom"><b>description</b> = "Default voxel/pixel resolution"</td></tr>
<tr class="separator:a9af27491cdae0b53913bff3e52c39bde"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2578010aa2c2a0da62e7c0f4e0bd15ac"><td class="memItemLeft" align="right" valign="top"><a id="a2578010aa2c2a0da62e7c0f4e0bd15ac"></a>
 </td><td class="memItemRight" valign="bottom"><b>bpy_type</b> = Scene</td></tr>
<tr class="separator:a2578010aa2c2a0da62e7c0f4e0bd15ac"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a35d3bfe6a1d5417e5d8f4d07ff1bfb75"><td class="memItemLeft" align="right" valign="top"><a id="a35d3bfe6a1d5417e5d8f4d07ff1bfb75"></a>
string </td><td class="memItemRight" valign="bottom"><b>bpy_idname</b> = "bf_default_voxel_size"</td></tr>
<tr class="separator:a35d3bfe6a1d5417e5d8f4d07ff1bfb75"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a640edaa59ba91a79dbc7bb8aad02de4c"><td class="memItemLeft" align="right" valign="top"><a id="a640edaa59ba91a79dbc7bb8aad02de4c"></a>
 </td><td class="memItemRight" valign="bottom"><b>bpy_prop</b> = FloatProperty</td></tr>
<tr class="separator:a640edaa59ba91a79dbc7bb8aad02de4c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3fdace719ce9a9e361e21c83c5c3a701"><td class="memItemLeft" align="right" valign="top"><a id="a3fdace719ce9a9e361e21c83c5c3a701"></a>
float </td><td class="memItemRight" valign="bottom"><b>bpy_default</b> = 0.1</td></tr>
<tr class="separator:a3fdace719ce9a9e361e21c83c5c3a701"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aec142f39d84a7945fa2fdba610cd093c"><td class="memItemLeft" align="right" valign="top"><a id="aec142f39d84a7945fa2fdba610cd093c"></a>
dictionary </td><td class="memItemRight" valign="bottom"><b>bpy_other</b> = {"unit": "LENGTH", "step": 1.0, "precision": 3}</td></tr>
<tr class="separator:aec142f39d84a7945fa2fdba610cd093c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="inherit_header pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td colspan="2" onclick="javascript:toggleInherit('pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param')"><img src="closed.png" alt="-"/> Static Public Attributes inherited from <a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html">blenderfds28x.types.BFParam</a></td></tr>
<tr class="memitem:aa1f6f0ab11c8d498eab38870211859b4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="aa1f6f0ab11c8d498eab38870211859b4"></a>
string </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#aa1f6f0ab11c8d498eab38870211859b4">label</a> = "No Label"</td></tr>
<tr class="memdesc:aa1f6f0ab11c8d498eab38870211859b4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Object label. <br /></td></tr>
<tr class="separator:aa1f6f0ab11c8d498eab38870211859b4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af15d64c12b1044bd2b9169b608811810 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="af15d64c12b1044bd2b9169b608811810"></a>
 </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#af15d64c12b1044bd2b9169b608811810">description</a> = None</td></tr>
<tr class="memdesc:af15d64c12b1044bd2b9169b608811810 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Object description. <br /></td></tr>
<tr class="separator:af15d64c12b1044bd2b9169b608811810 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae521391e5cb05ad2ab304190b1e576a0 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="ae521391e5cb05ad2ab304190b1e576a0"></a>
 </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#ae521391e5cb05ad2ab304190b1e576a0">enum_id</a> = None</td></tr>
<tr class="memdesc:ae521391e5cb05ad2ab304190b1e576a0 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Unique integer id for EnumProperty. <br /></td></tr>
<tr class="separator:ae521391e5cb05ad2ab304190b1e576a0 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a66beccc7c29293f44c858461302baa62 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="a66beccc7c29293f44c858461302baa62"></a>
dictionary </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a66beccc7c29293f44c858461302baa62">bf_other</a> = {}</td></tr>
<tr class="memdesc:a66beccc7c29293f44c858461302baa62 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Other BlenderFDS parameters, eg: {'draw_type': 'WIRE', ...}. <br /></td></tr>
<tr class="separator:a66beccc7c29293f44c858461302baa62 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a12bc8b4ec835c5a9d721963d7c9b38f7 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="a12bc8b4ec835c5a9d721963d7c9b38f7"></a>
 </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a12bc8b4ec835c5a9d721963d7c9b38f7">bf_params</a> = tuple()</td></tr>
<tr class="memdesc:a12bc8b4ec835c5a9d721963d7c9b38f7 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">My sub params, tuple of classes of type <a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html" title="Blender representation of an FDS parameter.">BFParam</a>. <br /></td></tr>
<tr class="separator:a12bc8b4ec835c5a9d721963d7c9b38f7 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6ef98ac87cd62c320178cfa6e4402627 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a6ef98ac87cd62c320178cfa6e4402627">fds_label</a> = None</td></tr>
<tr class="memdesc:a6ef98ac87cd62c320178cfa6e4402627 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">FDS label, eg. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a6ef98ac87cd62c320178cfa6e4402627">More...</a><br /></td></tr>
<tr class="separator:a6ef98ac87cd62c320178cfa6e4402627 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5f3d6542fbe27797d910ee8fa8e04ff4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="a5f3d6542fbe27797d910ee8fa8e04ff4"></a>
 </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a5f3d6542fbe27797d910ee8fa8e04ff4">fds_default</a> = None</td></tr>
<tr class="memdesc:a5f3d6542fbe27797d910ee8fa8e04ff4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">FDS default value. <br /></td></tr>
<tr class="separator:a5f3d6542fbe27797d910ee8fa8e04ff4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3c9e16d71139a4dbe53551ea0526d160 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a3c9e16d71139a4dbe53551ea0526d160">bpy_type</a> = None</td></tr>
<tr class="memdesc:a3c9e16d71139a4dbe53551ea0526d160 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">type in bpy.types for Blender property, eg. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a3c9e16d71139a4dbe53551ea0526d160">More...</a><br /></td></tr>
<tr class="separator:a3c9e16d71139a4dbe53551ea0526d160 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6fcc37b221e26e4616f9df43532c3ee3 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a6fcc37b221e26e4616f9df43532c3ee3">bpy_idname</a> = None</td></tr>
<tr class="memdesc:a6fcc37b221e26e4616f9df43532c3ee3 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">idname of related bpy.types Blender property, eg. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a6fcc37b221e26e4616f9df43532c3ee3">More...</a><br /></td></tr>
<tr class="separator:a6fcc37b221e26e4616f9df43532c3ee3 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2a2b2bc95351a7731fb07c1a563595c4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a2a2b2bc95351a7731fb07c1a563595c4">bpy_prop</a> = None</td></tr>
<tr class="memdesc:a2a2b2bc95351a7731fb07c1a563595c4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">prop in bpy.props of Blender property, eg. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a2a2b2bc95351a7731fb07c1a563595c4">More...</a><br /></td></tr>
<tr class="separator:a2a2b2bc95351a7731fb07c1a563595c4 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a18430cc42f28654684550f350dd9a8bf inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="a18430cc42f28654684550f350dd9a8bf"></a>
 </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a18430cc42f28654684550f350dd9a8bf">bpy_default</a> = None</td></tr>
<tr class="memdesc:a18430cc42f28654684550f350dd9a8bf inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Blender property default. <br /></td></tr>
<tr class="separator:a18430cc42f28654684550f350dd9a8bf inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a211719404867f7599db3ba74d3a65722 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">dictionary </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a211719404867f7599db3ba74d3a65722">bpy_other</a> = {}</td></tr>
<tr class="memdesc:a211719404867f7599db3ba74d3a65722 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Other optional Blender property parameters, eg. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a211719404867f7599db3ba74d3a65722">More...</a><br /></td></tr>
<tr class="separator:a211719404867f7599db3ba74d3a65722 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a795d61dfa90d6821e7edb4c2c9d8fa48 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="a795d61dfa90d6821e7edb4c2c9d8fa48"></a>
 </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a795d61dfa90d6821e7edb4c2c9d8fa48">bpy_export</a> = None</td></tr>
<tr class="memdesc:a795d61dfa90d6821e7edb4c2c9d8fa48 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">idname of export toggle Blender property <br /></td></tr>
<tr class="separator:a795d61dfa90d6821e7edb4c2c9d8fa48 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad8a46f67ce9ff39a5552c92125dbaaa5 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="ad8a46f67ce9ff39a5552c92125dbaaa5"></a>
 </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#ad8a46f67ce9ff39a5552c92125dbaaa5">bpy_export_default</a> = None</td></tr>
<tr class="memdesc:ad8a46f67ce9ff39a5552c92125dbaaa5 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">default value for export toggle Blender property <br /></td></tr>
<tr class="separator:ad8a46f67ce9ff39a5552c92125dbaaa5 inherit pub_static_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="inherited"></a>
Additional Inherited Members</h2></td></tr>
<tr class="inherit_header pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classblenderfds28x_1_1types_1_1_b_f_param')"><img src="closed.png" alt="-"/> Public Member Functions inherited from <a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html">blenderfds28x.types.BFParam</a></td></tr>
<tr class="memitem:a8efc7ab9fffcdd0d835ea917b1924be6 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a8efc7ab9fffcdd0d835ea917b1924be6">__init__</a> (self, <a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a1499112e560d84365ab6c9e2f1d31c2d">element</a>)</td></tr>
<tr class="memdesc:a8efc7ab9fffcdd0d835ea917b1924be6 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Class constructor. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a8efc7ab9fffcdd0d835ea917b1924be6">More...</a><br /></td></tr>
<tr class="separator:a8efc7ab9fffcdd0d835ea917b1924be6 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae0c66c5c12a1b4c72bc93f74a84abe20 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="ae0c66c5c12a1b4c72bc93f74a84abe20"></a>
def </td><td class="memItemRight" valign="bottom"><b>__str__</b> (self)</td></tr>
<tr class="separator:ae0c66c5c12a1b4c72bc93f74a84abe20 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ab5852cd70335554f85806fcefef0d771 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#ab5852cd70335554f85806fcefef0d771">register</a> (cls)</td></tr>
<tr class="memdesc:ab5852cd70335554f85806fcefef0d771 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Register related Blender properties. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#ab5852cd70335554f85806fcefef0d771">More...</a><br /></td></tr>
<tr class="separator:ab5852cd70335554f85806fcefef0d771 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0ee61af37cdd1b0bb30b3dce209cda0e inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a0ee61af37cdd1b0bb30b3dce209cda0e">unregister</a> (cls)</td></tr>
<tr class="memdesc:a0ee61af37cdd1b0bb30b3dce209cda0e inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Unregister related Blender properties. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a0ee61af37cdd1b0bb30b3dce209cda0e">More...</a><br /></td></tr>
<tr class="separator:a0ee61af37cdd1b0bb30b3dce209cda0e inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae9f8b07a71271cb2898d153738ecda23 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#ae9f8b07a71271cb2898d153738ecda23">value</a> (self)</td></tr>
<tr class="memdesc:ae9f8b07a71271cb2898d153738ecda23 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Return value from element instance. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#ae9f8b07a71271cb2898d153738ecda23">More...</a><br /></td></tr>
<tr class="separator:ae9f8b07a71271cb2898d153738ecda23 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a51e5ded728a4314395ba4bae92b30ca7 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a51e5ded728a4314395ba4bae92b30ca7">set_value</a> (self, context, <a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#ae9f8b07a71271cb2898d153738ecda23">value</a>=None)</td></tr>
<tr class="memdesc:a51e5ded728a4314395ba4bae92b30ca7 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Set element instance value. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a51e5ded728a4314395ba4bae92b30ca7">More...</a><br /></td></tr>
<tr class="separator:a51e5ded728a4314395ba4bae92b30ca7 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a737fbb0cc450d97cd6b48a2bf8b4574e inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="a737fbb0cc450d97cd6b48a2bf8b4574e"></a>
def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a737fbb0cc450d97cd6b48a2bf8b4574e">exported</a> (self)</td></tr>
<tr class="memdesc:a737fbb0cc450d97cd6b48a2bf8b4574e inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Return True if self is exported to FDS. <br /></td></tr>
<tr class="separator:a737fbb0cc450d97cd6b48a2bf8b4574e inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa82dd597f64a88b0682a6be0c636f38f inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#aa82dd597f64a88b0682a6be0c636f38f">set_exported</a> (self, context, <a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#ae9f8b07a71271cb2898d153738ecda23">value</a>=None)</td></tr>
<tr class="memdesc:aa82dd597f64a88b0682a6be0c636f38f inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Set if self is exported to FDS. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#aa82dd597f64a88b0682a6be0c636f38f">More...</a><br /></td></tr>
<tr class="separator:aa82dd597f64a88b0682a6be0c636f38f inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2e8bc8bae595dbae2f7882e3cfb02d72 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a2e8bc8bae595dbae2f7882e3cfb02d72">check</a> (self, context)</td></tr>
<tr class="memdesc:a2e8bc8bae595dbae2f7882e3cfb02d72 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Check self validity for FDS, in case of error raise BFException. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a2e8bc8bae595dbae2f7882e3cfb02d72">More...</a><br /></td></tr>
<tr class="separator:a2e8bc8bae595dbae2f7882e3cfb02d72 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad70cbf4f9f17fd93a8c53321fae15c24 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#ad70cbf4f9f17fd93a8c53321fae15c24">draw_operators</a> (self, context, layout)</td></tr>
<tr class="memdesc:ad70cbf4f9f17fd93a8c53321fae15c24 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Draw my operators on layout. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#ad70cbf4f9f17fd93a8c53321fae15c24">More...</a><br /></td></tr>
<tr class="separator:ad70cbf4f9f17fd93a8c53321fae15c24 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a54c1a5639924d9d6a9e72af39d50a364 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a54c1a5639924d9d6a9e72af39d50a364">draw</a> (self, context, layout)</td></tr>
<tr class="memdesc:a54c1a5639924d9d6a9e72af39d50a364 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Draw my UI on layout. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a54c1a5639924d9d6a9e72af39d50a364">More...</a><br /></td></tr>
<tr class="separator:a54c1a5639924d9d6a9e72af39d50a364 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a82ab718911681a65dffbfc50a446ea9c inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a82ab718911681a65dffbfc50a446ea9c">to_fds_param</a> (self, context)</td></tr>
<tr class="memdesc:a82ab718911681a65dffbfc50a446ea9c inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Return the <a class="el" href="classblenderfds28x_1_1types_1_1_f_d_s_param.html" title="Datastructure representing an FDS parameter.">FDSParam</a> representation of element instance. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#a82ab718911681a65dffbfc50a446ea9c">More...</a><br /></td></tr>
<tr class="separator:a82ab718911681a65dffbfc50a446ea9c inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aa5840aa7c47163adb3c4f3a575a91abe inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#aa5840aa7c47163adb3c4f3a575a91abe">from_fds</a> (self, context, <a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#ae9f8b07a71271cb2898d153738ecda23">value</a>)</td></tr>
<tr class="memdesc:aa5840aa7c47163adb3c4f3a575a91abe inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Set self.value from py value, on error raise BFException. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#aa5840aa7c47163adb3c4f3a575a91abe">More...</a><br /></td></tr>
<tr class="separator:aa5840aa7c47163adb3c4f3a575a91abe inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:adca91de2412fadd1dd630c8c692ee801 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top">def </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#adca91de2412fadd1dd630c8c692ee801">copy_to</a> (self, dest_element)</td></tr>
<tr class="memdesc:adca91de2412fadd1dd630c8c692ee801 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">Copy self values to destination element. <a href="classblenderfds28x_1_1types_1_1_b_f_param.html#adca91de2412fadd1dd630c8c692ee801">More...</a><br /></td></tr>
<tr class="separator:adca91de2412fadd1dd630c8c692ee801 inherit pub_methods_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="inherit_header pub_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td colspan="2" onclick="javascript:toggleInherit('pub_attribs_classblenderfds28x_1_1types_1_1_b_f_param')"><img src="closed.png" alt="-"/> Public Attributes inherited from <a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html">blenderfds28x.types.BFParam</a></td></tr>
<tr class="memitem:a1499112e560d84365ab6c9e2f1d31c2d inherit pub_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memItemLeft" align="right" valign="top"><a id="a1499112e560d84365ab6c9e2f1d31c2d"></a>
 </td><td class="memItemRight" valign="bottom"><a class="el" href="classblenderfds28x_1_1types_1_1_b_f_param.html#a1499112e560d84365ab6c9e2f1d31c2d">element</a></td></tr>
<tr class="memdesc:a1499112e560d84365ab6c9e2f1d31c2d inherit pub_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="mdescLeft"> </td><td class="mdescRight">FDS element represented by this class instance. <br /></td></tr>
<tr class="separator:a1499112e560d84365ab6c9e2f1d31c2d inherit pub_attribs_classblenderfds28x_1_1types_1_1_b_f_param"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Blender representation for the default voxel/pixel resolution. </p>
</div><hr/>The documentation for this class was generated from the following file:<ul>
<li>/home/egissi/github/firetools/blenderfds28x/lang.py</li>
</ul>
</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.17
</small></address>
</body>
</html>
| firetools/blenderfds | docs/html/classblenderfds28x_1_1lang_1_1_s_p__config__default__voxel__size.html | HTML | gpl-3.0 | 34,988 |
package com.mari;
import org.springframework.context.annotation.AnnotationConfigApplicationContext;
public class ChallengeDemoApp {
public static void main(String[] args) {
AnnotationConfigApplicationContext context = new AnnotationConfigApplicationContext(ChallengeConfig.class);
Coach theCoach = context.getBean("FootballCoach",FootballCoach.class);
System.out.println(theCoach.getDailyWorkout());
System.out.println(theCoach.getDailyFortune());
context.close();
}
}
| rejmar/Java | Spring/SpringAnnotations/src/com/mari/ChallengeDemoApp.java | Java | gpl-3.0 | 519 |
/*
Copyright (C) 2012 Harald Klein <hari@vt100.at>
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
See the GNU General Public License for more details.
*/
#include <iostream>
#include <sstream>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/socket.h>
#include <netdb.h>
#include <fcntl.h>
#include <string.h>
#include <termios.h>
#include <stdio.h>
#include <unistd.h>
#include <errno.h>
#include <stdlib.h>
#include "kwikwai.h"
#include "agolog.h"
using namespace std;
kwikwai::Kwikwai::Kwikwai(const char *hostname, const char *port) {
struct addrinfo host_info;
struct addrinfo *host_info_list;
memset(&host_info, 0, sizeof host_info);
host_info.ai_family = AF_UNSPEC;
host_info.ai_socktype = SOCK_STREAM;
int status = getaddrinfo(hostname, port, &host_info, &host_info_list);
if (status != 0) {
AGO_ERROR() << "getaddrinfo error: " << gai_strerror(status);
AGO_FATAL() << "can't get address for " << hostname << " - aborting";
return;
}
socketfd = socket(host_info_list->ai_family, host_info_list->ai_socktype, host_info_list->ai_protocol);
if (socketfd == -1) {
AGO_FATAL() << "socket error";
return;
}
AGO_DEBUG() << "Connect()ing...";
status = connect(socketfd, host_info_list->ai_addr, host_info_list->ai_addrlen);
if (status == -1) {
AGO_FATAL() << "connect error";
return;
}
this->read();
}
int kwikwai::Kwikwai::write(std::string data) {
unsigned int bytes_sent = send(socketfd, data.c_str(), data.size(), 0);
if (bytes_sent != data.size()) {
AGO_ERROR() << "error sending data";
}
return bytes_sent;
}
std::string kwikwai::Kwikwai::read() {
std::string result;
char incoming_data_buffer[1000];
int bytes_received;
bytes_received = recv(socketfd, incoming_data_buffer,1000, 0);
if (bytes_received == 0) {
AGO_ERROR() << "host shut down.";
return "";
}
if (bytes_received == -1) {
AGO_ERROR() << "receive error!";
return "";
}
result = string(incoming_data_buffer);
result.erase(result.begin() + result.find("\r"),result.end());
return result;
}
std::string kwikwai::Kwikwai::getVersion() {
this->write("version:get\r\n");
return this->read();
}
bool kwikwai::Kwikwai::cecSend(const char *command) {
std::string tmpcommand = "cec:send A ";
tmpcommand += command;
tmpcommand += "\r\n";
this->write(tmpcommand);
std::string response = this->read();
return response.size() ? true : false;
}
| mce35/agocontrol | devices/kwikwai/kwikwai.cpp | C++ | gpl-3.0 | 2,855 |
<?php
/**
* Default configuration for Xhgui
*/
return array(
'debug' => false,
'mode' => 'development',
// Can be either mongodb or file.
//'save.handler' => 'file',
//'save.handler.filename' => dirname(__DIR__) . '/cache/' . 'xhgui.data.' . microtime(true) . '_' . substr(md5($url), 0, 6),
'save.handler' => 'mongodb',
// Needed for file save handler. Beware of file locking. You can adujst this file path
// to reduce locking problems (eg uniqid, time ...)
//'save.handler.filename' => __DIR__.'/../data/xhgui_'.date('Ymd').'.dat',
'db.host' => 'mongodb://base_mongo:27017',
'db.db' => 'xhprof',
// Allows you to pass additional options like replicaSet to MongoClient.
// 'username', 'password' and 'db' (where the user is added)
'db.options' => array(),
'templates.path' => dirname(__DIR__) . '/src/templates',
'date.format' => 'M jS H:i:s',
'detail.count' => 6,
'page.limit' => 25,
// Profile 1 in 100 requests.
// You can return true to profile every request.
'profiler.enable' => function() {
return isset($_GET['_profile']) && $_GET['_profile'] == '1';
},
'profiler.simple_url' => function($url) {
return preg_replace('/\=\d+/', '', $url);
}
); | n0v3xx/docker-ubuntu-nginx-php7 | docker/ubuntu/template/xhgui/xhgui.config.php | PHP | gpl-3.0 | 1,321 |
package com.linux.sudoku.fx;
import java.util.HashSet;
import java.util.Set;
/**
* This is copied verbatim from http://stackoverflow.com/questions/15690254/how-to-generate-a-complete-sudoku-board-algorithm-error
*
* @author Guruprasad Kulkarni <guru@linux.com>
*/
public class SudokuCell {
private int value;
private boolean filled;
private Set<Integer> tried;
public SudokuCell() {
filled = false;
tried = new HashSet<>();
}
public boolean isFilled() {
return filled;
}
public void set(final int number) {
tried.add(number);
filled = true;
value = number;
}
public void clear() {
value = 0;
filled = false;
}
public void reset() {
clear();
tried.clear();
}
public void show() {
filled = true;
}
public void hide() {
filled = false;
}
public boolean isTried(final int number) {
return tried.contains(number);
}
public void tryNumber(final int number) {
tried.add(number);
}
public int numberOfTries() {
return tried.size();
}
public int get() {
return value;
}
}
| comdotlinux/SudokuFX | src/main/java/com/linux/sudoku/fx/SudokuCell.java | Java | gpl-3.0 | 1,244 |
<!-- APP MAIN ==========-->
<main id="app-main" class="app-main">
<div class="wrap">
<section class="app-content">
<div class="row">
<?php
if($_SESSION["systemSucces"]<>""){
?>
<div class="alert alert-success" role="alert">
<strong><i class="fa fa-check"></i></strong>
<span><?=$_SESSION["systemSucces"]?></span>
</div>
<?php $_SESSION["systemSucces"]=""; ?>
<?php } ?>
<?php
if($_SESSION["systemError"]<>""){
?>
<div class="alert alert-danger" role="alert">
<strong><i class="fa fa-check"></i></strong>
<span><?=$_SESSION["systemError"]?></span>
</div>
<?php $_SESSION["systemError"]=""; ?>
<?php } ?>
<header class="widget-header">
<a href="?page=<?=$page?>&cate=<?=$cate?>">
<button type="button" class="close">×</button>
</a>
<h4 class="widget-title">Slider Management</h4>
</header><!-- .widget-header -->
<hr class="widget-separator">
<div class="widget-body">
<?php include("includes/index.php") ?>
</div><!-- .widget-body -->
</form>
</div><!-- .row -->
</section><!-- #dash-content -->
</div><!-- .wrap -->
<!-- APP FOOTER -->
<div class="wrap p-t-0">
<footer class="app-footer">
<div class="clearfix">
<div class="copyright pull-left">Copyright <?=$Year?> ©</div>
</div>
</footer>
</div>
<!-- /#app-footer -->
</main>
<!--========== END app main --> | brandonccy/SmartNano | admincp/modules/sliders/index.php | PHP | gpl-3.0 | 1,416 |
package com.Soro300.lets_mod.reference;
public class Reference {
public static final String MOD_ID = "Lets_Mod";
public static final String MOD_NAME = "Lets Mod";
public static final String VERSION = "1.7.10-1.0";
public static final String CLIENT_PROXY_CLASS = "com.Soro300.lets_mod.proxy.ClientProxy";
public static final String SERVER_PROXY_CLASS = "com.Soro300.lets_mod.proxy.ServerProxy";
public static final String GUI_FACTORY_CLASS = "com.Soro300.lets_mod.client.gui.GuiFactory";
}
| Soro300/Lets_Mod | src/main/java/com/Soro300/lets_mod/reference/Reference.java | Java | gpl-3.0 | 497 |
package edu.berkeley.nlp.util;
import java.util.Collection;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import fig.basic.Pair;
//import fig.basic.Pair;
/**
* Maintains counts of (key, value) pairs. The map is structured so that for
* every key, one can get a counter over values. Example usage: keys might be
* words with values being POS tags, and the count being the number of
* occurences of that word/tag pair. The sub-counters returned by
* getCounter(word) would be count distributions over tags for that word.
*
* @author Dan Klein
*/
public class CounterMap<K, V> implements java.io.Serializable {
private static final long serialVersionUID = 1L;
MapFactory<V, Double> mf;
Map<K, Counter<V>> counterMap;
double defltVal = 0.0;
protected Counter<V> ensureCounter(K key) {
Counter<V> valueCounter = counterMap.get(key);
if (valueCounter == null) {
valueCounter = buildCounter(mf);
valueCounter.setDeflt(defltVal);
counterMap.put(key, valueCounter);
}
return valueCounter;
}
public Collection<Counter<V>> getCounters() {
return counterMap.values();
}
/**
* @return
*/
protected Counter<V> buildCounter(MapFactory<V, Double> mf)
{
return new Counter<V>(mf);
}
/**
* Returns the keys that have been inserted into this CounterMap.
*/
public Set<K> keySet() {
return counterMap.keySet();
}
/**
* Sets the count for a particular (key, value) pair.
*/
public void setCount(K key, V value, double count) {
Counter<V> valueCounter = ensureCounter(key);
valueCounter.setCount(value, count);
}
// public void setCount(Pair<K,V> pair) {
//
// }
/**
* Increments the count for a particular (key, value) pair.
*/
public void incrementCount(K key, V value, double count) {
Counter<V> valueCounter = ensureCounter(key);
valueCounter.incrementCount(value, count);
}
/**
* Gets the count of the given (key, value) entry, or zero if that entry is
* not present. Does not create any objects.
*/
public double getCount(K key, V value) {
Counter<V> valueCounter = counterMap.get(key);
if (valueCounter == null) return defltVal;
return valueCounter.getCount(value);
}
/**
* Gets the sub-counter for the given key. If there is none, a counter is
* created for that key, and installed in the CounterMap. You can, for
* example, add to the returned empty counter directly (though you shouldn't).
* This is so whether the key is present or not, modifying the returned
* counter has the same effect (but don't do it).
*/
public Counter<V> getCounter(K key) {
return ensureCounter(key);
}
public Counter<V> getCounterPossiblyNull(K key) {
return counterMap.get(key);
}
public Counter<V> getCounterNoInsert(K key) {
Counter<V> counter = counterMap.get(key);
return counter == null ? new Counter<V>() : counter;
}
public void incrementAll(Map<K, V> map, double count) {
for (Map.Entry<K, V> entry : map.entrySet()) {
incrementCount(entry.getKey(), entry.getValue(), count);
}
}
public void incrementAll(CounterMap<K, V> cMap) {
for (Map.Entry<K,Counter<V>> entry: cMap.counterMap.entrySet()) {
K key = entry.getKey();
Counter<V> innerCounter = entry.getValue();
for (Map.Entry<V, Double> innerEntry: innerCounter.entrySet()) {
V value = innerEntry.getKey();
incrementCount(key,value,innerEntry.getValue());
}
}
}
/**
* Gets the total count of the given key, or zero if that key is
* not present. Does not create any objects.
*/
public double getCount(K key) {
Counter<V> valueCounter = counterMap.get(key);
if (valueCounter == null) return 0.0;
return valueCounter.totalCount();
}
/**
* Returns the total of all counts in sub-counters. This implementation is
* linear; it recalculates the total each time.
*/
public double totalCount() {
double total = 0.0;
for (Map.Entry<K, Counter<V>> entry : counterMap.entrySet()) {
Counter<V> counter = entry.getValue();
total += counter.totalCount();
}
return total;
}
/**
* Returns the total number of (key, value) entries in the CounterMap (not
* their total counts).
*/
public int totalSize() {
int total = 0;
for (Map.Entry<K, Counter<V>> entry : counterMap.entrySet()) {
Counter<V> counter = entry.getValue();
total += counter.size();
}
return total;
}
/**
* The number of keys in this CounterMap (not the number of key-value entries
* -- use totalSize() for that)
*/
public int size() {
return counterMap.size();
}
/**
* True if there are no entries in the CounterMap (false does not mean
* totalCount > 0)
*/
public boolean isEmpty() {
return size() == 0;
}
/**
* Finds the key with maximum count. This is a linear operation, and ties are broken arbitrarily.
*
* @return a key with minumum count
*/
public Pair<K, V> argMax() {
double maxCount = Double.NEGATIVE_INFINITY;
Pair<K, V> maxKey = null;
for (Map.Entry<K, Counter<V>> entry : counterMap.entrySet()) {
Counter<V> counter = entry.getValue();
V localMax = counter.argMax();
if (counter.getCount(localMax) > maxCount || maxKey == null) {
maxKey = new Pair<K, V>(entry.getKey(), localMax);
maxCount = counter.getCount(localMax);
}
}
return maxKey;
}
public String toString(int maxValsPerKey) {
StringBuilder sb = new StringBuilder("[\n");
for (Map.Entry<K, Counter<V>> entry : counterMap.entrySet()) {
sb.append(" ");
sb.append(entry.getKey());
sb.append(" -> ");
sb.append(entry.getValue().toString(maxValsPerKey));
sb.append("\n");
}
sb.append("]");
return sb.toString();
}
@Override
public String toString() {
return toString(20);
}
public String toString(Collection<String> keyFilter) {
StringBuilder sb = new StringBuilder("[\n");
for (Map.Entry<K, Counter<V>> entry : counterMap.entrySet()) {
if (keyFilter != null && !keyFilter.contains(entry.getKey())) {
continue;
}
sb.append(" ");
sb.append(entry.getKey());
sb.append(" -> ");
sb.append(entry.getValue().toString(20));
sb.append("\n");
}
sb.append("]");
return sb.toString();
}
public CounterMap(CounterMap<K,V> cm)
{
this();
incrementAll(cm);
}
public CounterMap() {
this(false);
}
public boolean isEqualTo(CounterMap<K,V> map)
{
boolean tmp = true;
CounterMap<K,V> bigger = map.size() > size() ? map : this;
for (K k : bigger.keySet())
{
tmp &= map.getCounter(k).isEqualTo(getCounter(k));
}
return tmp;
}
public CounterMap(MapFactory<K, Counter<V>> outerMF, MapFactory<V, Double> innerMF) {
mf = innerMF;
counterMap = outerMF.buildMap();
}
public CounterMap(boolean identityHashMap) {
this(identityHashMap ? new MapFactory.IdentityHashMapFactory<K, Counter<V>>()
: new MapFactory.HashMapFactory<K, Counter<V>>(),
identityHashMap ? new MapFactory.IdentityHashMapFactory<V, Double>()
: new MapFactory.HashMapFactory<V, Double>());
}
public static void main(String[] args) {
CounterMap<String, String> bigramCounterMap = new CounterMap<String, String>();
bigramCounterMap.incrementCount("people", "run", 1);
bigramCounterMap.incrementCount("cats", "growl", 2);
bigramCounterMap.incrementCount("cats", "scamper", 3);
System.out.println(bigramCounterMap);
System.out.println("Entries for cats: " + bigramCounterMap.getCounter("cats"));
System.out.println("Entries for dogs: " + bigramCounterMap.getCounter("dogs"));
System.out.println("Count of cats scamper: "
+ bigramCounterMap.getCount("cats", "scamper"));
System.out.println("Count of snakes slither: "
+ bigramCounterMap.getCount("snakes", "slither"));
System.out.println("Total size: " + bigramCounterMap.totalSize());
System.out.println("Total count: " + bigramCounterMap.totalCount());
System.out.println(bigramCounterMap);
}
public void normalize() {
for (K key : keySet()) {
getCounter(key).normalize();
}
}
public void normalizeWithDiscount(double discount) {
for (K key : keySet()) {
Counter<V> ctr = getCounter(key);
double totalCount = ctr.totalCount();
for (V value : ctr.keySet()) {
ctr.setCount(value, (ctr.getCount(value) - discount) / totalCount);
}
}
}
/**
* Constructs reverse CounterMap where the count of a pair (k,v)
* is the count of (v,k) in the current CounterMap
* @return
*/
public CounterMap<V,K> invert() {
CounterMap<V,K> invertCounterMap = new CounterMap<V, K>();
for (K key: this.keySet()) {
Counter<V> keyCounts = this.getCounter(key);
for (V val: keyCounts.keySet()) {
double count = keyCounts.getCount(val);
invertCounterMap.setCount(val, key, count);
}
}
return invertCounterMap;
}
/**
* Scale all entries in <code>CounterMap</code>
* by <code>scaleFactor</code>
* @param scaleFactor
*/
public void scale(double scaleFactor) {
for (K key: keySet()) {
Counter<V> counts = getCounter(key);
counts.scale(scaleFactor);
}
}
public boolean containsKey(K key) {
return counterMap.containsKey(key);
}
public Iterator<Pair<K,V>> getPairIterator() {
class PairIterator implements Iterator<Pair<K,V>> {
Iterator<K> outerIt ;
Iterator<V> innerIt ;
K curKey ;
public PairIterator() {
outerIt = keySet().iterator();
}
private boolean advance() {
if (innerIt == null || !innerIt.hasNext()) {
if (!outerIt.hasNext()) {
return false;
}
curKey = outerIt.next();
innerIt = getCounter(curKey).keySet().iterator();
}
return true;
}
public boolean hasNext() {
return advance();
}
public Pair<K, V> next() {
advance();
assert curKey != null;
return Pair.newPair(curKey, innerIt.next());
}
public void remove() {
// TODO Auto-generated method stub
}
};
return new PairIterator();
}
public Set<Map.Entry<K, Counter<V>>> getEntrySet() {
// TODO Auto-generated method stub
return counterMap.entrySet();
}
public void removeKey(K oldIndex)
{
counterMap.remove(oldIndex);
}
public void setCounter(K newIndex, Counter<V> counter)
{
counterMap.put(newIndex, counter);
}
public void setDefault(double defltVal) {
this.defltVal = defltVal;
for (Counter<V> vCounter : counterMap.values()) {
vCounter.setDeflt(defltVal);
}
}
public boolean containsKey(K s1, V s2)
{
Counter<V> valueCounter = counterMap.get(s1);
if (valueCounter == null) { return false; }
return valueCounter.containsKey(s2);
}
public CounterMap<K, V> copy()
{
CounterMap<K, V> c = new CounterMap<K, V>();
c.incrementAll(this);
return c;
}
public Set<Entry<K, Counter<V>>> entrySet()
{
return counterMap.entrySet();
}
public void pruneKeysBelowThreshold(double d)
{
for (Iterator<Entry<K, Counter<V>>> iterator = entrySet().iterator(); iterator.hasNext();)
{
Entry<K, Counter<V>> entry = iterator.next();
final Counter<V> counter = entry.getValue();
counter.pruneKeysBelowThreshold(d);
if (counter.isEmpty()) iterator.remove();
}
}
public void removeKey(K k, V v)
{
Counter<V> valueCounter = counterMap.get(k);
if (valueCounter == null) return;
valueCounter.removeKey(v);
if (valueCounter.isEmpty()) counterMap.remove(k);
}
}
| timfeu/berkeleycoref-bansalklein | code/edu/berkeley/nlp/util/CounterMap.java | Java | gpl-3.0 | 11,359 |
# coding: utf-8
class Solution(object):
@staticmethod
def dfs(candidates, target, vis, res, cur_idx, sum):
if sum > target:
return
if sum == target:
ans = [candidates[i] for i in cur_idx if i >= 0]
res.append(ans)
return
if sum < target:
for i, v in enumerate(candidates):
if sum + v > target:
break
if i != cur_idx[-1] + 1 and candidates[i] == candidates[i-1]:
continue
if i >= cur_idx[-1] and (not vis[i]):
vis[i] = 1
cur_idx.append(i)
Solution.dfs(candidates, target, vis, res, cur_idx, sum+v)
vis[i] = 0
cur_idx.pop()
def combinationSum2(self, candidates, target):
"""
:type candidates: List[int]
:type target: int
:rtype: List[List[int]]
"""
candidates = sorted(candidates)
n = len(candidates)
res = []
cur_idx = [-1]
vis = [0 for _ in candidates]
Solution.dfs(candidates, target, vis, res, cur_idx, 0)
# return map(list, list(res))
return res
s = Solution()
print s.combinationSum2([10,1,2,7,6,1,5], 8)
print s.combinationSum2([2,5,2,1,2], 5)
| ShengRang/c4f | leetcode/combination-sum-ii.py | Python | gpl-3.0 | 1,342 |
package sortingalgorithms;
public class Introsort {
/*this method should be called first*/
public static void sort(int[] arr) {
final int maxDepth = 2 * (int)Math.floor(Math.log(arr.length) / Math.log(2));
introsort(arr, 0, arr.length - 1, maxDepth);
}
/*main loop of introsort*/
/*
* INPUT arr: data to be sorted
* INPUT low: index of first element of arr to be sorted (inclusive)
* INPUT hihg: index of last element of arr to be sorted (inclusive)
* INPUT maxDepth: level of recusion reached before switching from quicksort to heapsort
*/
private static void introsort(int[] arr, int low, int high, final int maxDepth) {
if(maxDepth == 0) {
Heapsort.heapsort(arr, low, high);
}
else if(low < high) {
final int THRESH_HOLD = 5;//when to switch from introsort to insertion sort
if(high - low <= THRESH_HOLD) {
InsertionSort.doSort(arr);//using insertionsort on small arrays is more efficent
}
int pivot = partition(arr, low, high);
/*recursivley sort two subarrays*/
introsort(arr, low, pivot, maxDepth - 1);
introsort(arr, pivot + 1, high, maxDepth - 1);
}//else base case reached as length is 1
}
/*Hoare's partition scheme*/
private static int partition(int[] arr, int low, int high) {
int pivot = medianOf3(arr, low, high);
if(high - low <= 3)//median already sorts 3 so no need to continue
return high - 1;//not having this here may result in index out of range
/*after first iterration of do while, i = low and j = high hence the -1/+1 */
int i = low - 1 + 1;//+1 b/c first element is on correct side of pivot
int j = high + 1 - 1 - 1;//-2 b/c last 2 elements are on correct side of pivot
for(;;) {//infinte loop
do {
i++;
} while (arr[i] < pivot);
do {
j--;
} while (arr[j] > pivot);
if(i >= j) {
return j;
}
swap(arr, i, j);
}
}
/*sorts the first, last and middle elements of subarray [start, end]
* places median value at position end - 1
* returns median value
*/
private static int medianOf3(int[] data, int start, int end) {
if(end - start == 0) {
return data[start];
}else if(end - start == 1) {
if(data[start] > data[end]) {
swap(data, start, end);
}
return data[end];//return higher value for arrays of length 2
}
int middle = (start + end) >>> 1;//preventing integer overflow in (start + end) / 2
if (data[start] > data[end])
swap(data, start, end);
if (data[start] > data[middle])
swap(data, start, middle);
if (data[middle] > data[end])
swap(data, middle, end);
swap(data, middle, end - 1);//know middle will end up on right partition
return data[end - 1];//return the middle value
}
/*swam values in array*/
private static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
| readysetlearn/Sorting-Algorithms | Introsort.java | Java | gpl-3.0 | 3,371 |
AAScriptCompiler.exe S102.SRC S102.SRP | cabbruzzese/AmuletsAndArmorUserMaps | l102/buildscript.bat | Batchfile | gpl-3.0 | 38 |
export class MapPort {
adapterNumber: number;
linkType: string;
name: string;
portNumber: number;
shortName: string;
}
| GNS3/gns3-web-ui | src/app/cartography/models/map/map-port.ts | TypeScript | gpl-3.0 | 129 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.