简洁而强大的 web 框架。
Toa 修改自 Koa，基本架构原理与 Koa 相似，context
、request
、response
三大基础对象几乎一样。
Toa 是基于 thunks 组合业务逻辑，来实现异步流程控制和异常处理。thunks
是一个比 co
更强大的异步流程控制工具，支持所有形式的异步控制，包括 callback，promise，generator，async/await 等。
Toa 支持 Node.js v0.12
以上，但在高版本中将有更好的体验和性能，如 >=v4
的版本支持 generator 函数，>=v7
的版本支持 async/await 函数，这些特性支持用同步逻辑编写非阻塞的异步程序。
Toa 与 Koa 学习成本和编程体验是一致的，两者之间几乎是无缝切换。但 Toa 去掉了 Koa 的 级联（Cascading）
逻辑，强化中间件，尽量削弱第三方组件访问应用的能力，使得编写大型应用的结构逻辑更简洁明了，也更安全。
npm install toa
一个 Toa Application（以下简称 app）由一系列 中间件 组成。中间件 是指通过 app.use
加载的同步函数、thunk 函数、generator 函数或 async/await 函数。
对于 web server 的一次访问请求，app 会按照顺序先运行中间件，然后再运行业务逻辑中 context.after(hook)
动态添加的 hooks，最后运行内置的 respond
函数，将请求结果自动响应的客户端。由于 Toa 没有 级联（Cascading）
，这些中间件或模块的运行不会有任何交叉，它们总是先运行完一个，再运行下一个。
Toa 只有一个极简的内核，提供快捷的 HTTP 操作和异步流程控制能力。具体的业务功能逻辑则由中间件和模块组合实现。用户则可根据自己的业务需求，以最轻量级的方式组合自己的应用。
让我们来看看 Toa 极其简单的 Hello World 应用程序：
const Toa = require('toa')
const app = new Toa()
app.use(function () {
this.body = 'Hello World!\n-- toa'
})
app.listen(3000)
server
: {Object}, http server 或 https server 实例。options
: {Object} 类似 thunks
的 options，对于 server 的每一个 client request，toa app 均会用 thunks
生成一个的 thunk
，挂载到 context.thunk
，该 thunk
的作用域对该 client request 的整个生命周期生效。
options.onerror
: {Function} 其 this
为 client request 的 context
对象。当 client request 处理流程出现异常时，会抛出到 onerror
，原有处理流程会终止，onerror
运行完毕后再进入 toa 内置的异常处理流程，最后 respond
客户端。如果 onerror
返回 true
，则会忽略该异常，异常不会进入内置异常处理流程，然后直接 respond
客户端。// with full arguments
const app = new Toa(server, {
onerror: function (error) {}
})
设置 cookie 签名密钥，参考 Keygrip。
注意，签名密钥只在配置项 signed
参数为真时才会生效：
this.cookies.set('name', 'test', {signed: true})
config 会被 context.config
继承，但 context.config
不会修改 app.config
。
app.config = config
app.config 默认值：
{
proxy: false, // 决定了哪些 `proxy header` 参数会被加到信任列表中
env: process.env.NODE_ENV || 'development', // node 执行环境
subdomainOffset: 2,
poweredBy: 'Toa'
}
加载中间件，返回 app
，fn
必须是 thunk
函数或 generator
函数，函数中的 this
值为 context
。
app.use(function (callback) {
// task
// this === context
callback(err, result)
})
app.use(function * () {
// task
// this === context
yield result
})
设置 onerror
函数，当 app 捕捉到程序运行期间的错误时，会先使用 options.onerror
（若提供）处理，再使用内置的 onResError
函数处理响应给客户端，最后抛出给 app.onerror
处理，应用通常可以在这里判断错误类型，根据情况将错误写入日志系统。
// default
app.onerror = function (err) {
// ignore null and response error
if (err == null || (err.status && err.status < 500)) return
if (!util.isError(err)) err = new Error('non-error thrown: ' + err)
// catch system error
let msg = err.stack || err.toString()
console.error(msg.replace(/^/gm, ' '))
}
返回 app request listener。
const http = require('http')
const toa = require('toa')
const app = toa()
const server = http.createServer(app.toListener())
server.listen(3000)
等效于：
const toa = require('toa')
const app = toa()
app.listen(3000)
返回 server
，用法与 httpServer.listen
一致。
// 与 httpServer.listen 一致
app.listen(3000)
Similar to Koa’s Context
ctx.app
ctx.thunk
method, it is thunk function that bound a scope with onerror
.ctx.end
method, use to stopping request process and respond immediately.ctx.after
method, use to add hooks that run after middlewares and before respond.ctx.catchStream
method, used to catch stream’s error or clean stream when some error.ctx.ended
property, indicates that the response ended.ctx.finished
property, indicates that the response finished successfully.ctx.closed
property, indicates that the response closed unexpectedly.EventEmitter
instanceContext
object encapsulates node’s request
and response
objects into a single object which provides many helpful methods for writing web applications and APIs. These operations are used so frequently in HTTP server development that they are added at this level instead of a higher level framework, which would force middleware to re-implement this common functionality.
A Context
is created per request, and is referenced in middleware as the receiver, or the this
identifier, as shown in the following snippet:
const app = Toa(function * () {
this // is the Context
this.request // is a toa Request
this.response // is a toa Response
})
app.use(function * () {
this // is the Context
this.request // is a toa Request
this.response // is a toa Response
})
Many of the context’s accessors and methods simply delegate to their ctx.request
or ctx.response
equivalents for convenience, and are otherwise identical. For example ctx.type
and ctx.length
delegate to the response
object, and ctx.path
and ctx.method
delegate to the request
.
Emitted after a HTTP request closed, indicates that the socket has been closed, and context.closed
will be true
.
Emitted after respond() was called, indicates that body was sent. and context.ended
will be true
Emitted after a HTTP response finished. and context.finished
will be true
.
A context always listen 'error'
event by ctx.onerror
. ctx.onerror
is a immutable error handle. So you can use ctx.emit('error', error)
to deal with your exception or error.
Context
specific methods and accessors.
A thunk function that bound a scope.
thunkable
thunkable value, see: https://github.com/thunks/thunksUse to stopping request process and respond immediately. It should not run in try catch
block, otherwise onstop
will not be trigger.
message
String, see: https://github.com/thunks/thunksAdd hooks dynamicly. Hooks will be executed in LIFO order after middlewares, but before respond
.
Node’s request
object.
Node’s response
object.
Bypassing Toa’s response handling is not supported. Avoid using the following node properties:
res.statusCode
res.writeHead()
res.write()
res.end()
A Toa Request
object.
A Toa Response
object.
The recommended namespace for passing information through middleware and to your frontend views.
this.state.user = yield User.find(id)
Get cookie name
with options
:
signed
the cookie requested should be signedToa uses the cookies module where options are simply passed.
Set cookie name
to value
with options
:
signed
sign the cookie valueexpires
a Date
for cookie expirationpath
cookie path, /'
by defaultdomain
cookie domainsecure
secure cookiehttpOnly
server-accessible cookie, true by defaultToa uses the cookies module where options are simply passed.
Helper method to throw an error with a .status
property defaulting to 500
that will allow Toa to respond appropriately. The following combinations are allowed:
this.throw(403)
this.throw('name required', 400)
this.throw(400, 'name required')
this.throw('something exploded')
For example this.throw('name required', 400)
is equivalent to:
let err = new Error('name required')
err.status = 400
throw err
Note that these are user-level errors and are flagged with err.expose
meaning the messages are appropriate for client responses, which is typically not the case for error messages since you do not want to leak failure details.
You may optionally pass a properties
object which is merged into the error as-is, useful for decorating machine-friendly errors which are reported to the requester upstream.
this.throw(401, 'access_denied', {user: user})
this.throw('access_denied', {user: user})
Toa uses http-errors to create errors.
Similar to ctx.throw
, create a error object, but don’t throw.
Helper method to throw an error similar to .throw()
when !value
. Similar to node’s assert() method.
this.assert(this.state.user, 401, 'User not found. Please login!')
Toa uses http-assert for assertions.
To bypass Toa’s built-in response handling, you may explicitly set this.respond = false
. Use this if you want to write to the raw res
object instead of letting Toa handle the response for you.
Note that using this is not supported by Toa. This may break intended functionality of Toa middleware and Toa itself. Using this property is considered a hack and is only a convenience to those wishing to use traditional fn(req, res)
functions and middleware within Toa.
Catch a stream
's error, if ‘error’ event emit from the stream, the error will be throw to Thunk’s onerror
and response it.
The following accessors and alias Request equivalents:
ctx.header
ctx.headers
ctx.method
ctx.method=
ctx.url
ctx.url=
ctx.origin
ctx.originalUrl
ctx.href
ctx.path
ctx.path=
ctx.query
ctx.query=
ctx.querystring
ctx.querystring=
ctx.host
ctx.hostname
ctx.fresh
ctx.stale
ctx.socket
ctx.protocol
ctx.secure
ctx.ip
ctx.ips
ctx.idempotent
ctx.subdomains
ctx.is()
ctx.accepts()
ctx.acceptsEncodings()
ctx.acceptsCharsets()
ctx.acceptsLanguages()
ctx.get()
ctx.search()
The following accessors and alias Response equivalents:
ctx.body
ctx.body=
ctx.status
ctx.status=
ctx.message
ctx.message=
ctx.length=
ctx.length
ctx.type=
ctx.type
ctx.headerSent
ctx.redirect()
ctx.attachment()
ctx.set()
ctx.append()
ctx.remove()
ctx.vary()
ctx.lastModified=
ctx.etag=
The same as Koa’s Request
Request
object is an abstraction on top of node’s vanilla request object, providing additional functionality that is useful for every day HTTP server development.
Request header object.
Request header object. Alias as request.header
.
Request method.
Set request method, useful for implementing middleware such as methodOverride()
.
Return request Content-Length as a number when present, or undefined
.
Get request URL.
Set request URL, useful for url rewrites.
Get origin of URL.
Get request original URL.
Get full request URL, include protocol
, host
and url
.
this.request.href
// => http://example.com/foo/bar?q=1
Get request pathname.
Set request pathname and retain query-string when present.
Get raw query string void of ?
.
Set raw query string.
Get raw query string with the ?
.
Set raw query string.
Get host (hostname:port) when present. Supports X-Forwarded-Host
when app.proxy
is true, otherwise Host
is used.
Get hostname when present. Supports X-Forwarded-Host
when app.proxy
is true, otherwise Host
is used.
Get request Content-Type
void of parameters such as "charset".
let ct = this.request.type
// => "image/png"
Get request charset when present, or undefined
:
this.request.charset
// => "utf-8"
Get parsed query-string, returning an empty object when no query-string is present. Note that this getter does not support nested parsing.
For example "color=blue&size=small":
{
color: 'blue',
size: 'small'
}
Set query-string to the given object. Note that this setter does not support nested objects.
this.query = {next: '/login'}
Check if a request cache is "fresh", aka the contents have not changed. This method is for cache negotiation between If-None-Match
/ ETag
, and If-Modified-Since
and Last-Modified
. It should be referenced after setting one or more of these response headers.
this.status = 200
this.set('ETag', '123')
// cache is ok
if (this.fresh) {
this.status = 304
return
}
// cache is stale
// fetch new data
this.body = yield db.find('something')
Inverse of request.fresh
.
Return request protocol, “https” or "http". Supports X-Forwarded-Proto
when app.proxy
is true.
Shorthand for this.protocol == "https"
to check if a request was issued via TLS.
Request remote address. Supports X-Forwarded-For
when app.proxy
is true.
When X-Forwarded-For
is present and app.proxy
is enabled an array of these ips is returned, ordered from upstream -> downstream. When disabled an empty array is returned.
Return subdomains as an array.
Subdomains are the dot-separated parts of the host before the main domain of the app. By default, the domain of the app is assumed to be the last two parts of the host. This can be changed by setting app.subdomainOffset
.
For example, if the domain is "tobi.ferrets.example.com":
If app.subdomainOffset
is not set, this.subdomains is ["ferrets", "tobi"]
.
If app.subdomainOffset
is 3, this.subdomains is ["tobi"]
.
Check if the incoming request contains the “Content-Type” header field, and it contains any of the give mime type
s. If there is no request body, null
is returned. If there is no content type, or the match fails false
is returned. Otherwise, it returns the matching content-type.
// With Content-Type: text/html; charset=utf-8
this.is('html') // => 'html'
this.is('text/html') // => 'text/html'
this.is('text/*', 'text/html') // => 'text/html'
// When Content-Type is application/json
this.is('json', 'urlencoded') // => 'json'
this.is('application/json') // => 'application/json'
this.is('html', 'application/*') // => 'application/json'
this.is('html') // => false
For example if you want to ensure that only images are sent to a given route:
if (this.is('image/*')) {
// process
} else {
this.throw(415, 'images only!')
}
Request
object includes helpful content negotiation utilities powered by accepts and negotiator. These utilities are:
request.accepts(types)
request.acceptsEncodings(types)
request.acceptsCharsets(charsets)
request.acceptsLanguages(langs)
If no types are supplied, all acceptable types are returned.
If multiple types are supplied, the best match will be returned. If no matches are found, a false
is returned, and you should send a 406 "Not Acceptable"
response to the client.
In the case of missing accept headers where any type is acceptable, the first type will be returned. Thus, the order of types you supply is important.
Check if the given type(s)
is acceptable, returning the best match when true, otherwise false
. The type
value may be one or more mime type string such as "application/json", the extension name such as "json", or an array ["json", "html", "text/plain"]
.
// Accept: text/html
this.accepts('html')
// => "html"
// Accept: text/*, application/json
this.accepts('html')
// => "html"
this.accepts('text/html')
// => "text/html"
this.accepts('json', 'text')
// => "json"
this.accepts('application/json')
// => "application/json"
// Accept: text/*, application/json
this.accepts('image/png')
this.accepts('png')
// => false
// Accept: text/*;q=.5, application/json
this.accepts(['html', 'json'])
this.accepts('html', 'json')
// => "json"
// No Accept header
this.accepts('html', 'json')
// => "html"
this.accepts('json', 'html')
// => "json"
You may call this.accepts()
as many times as you like, or use a switch:
switch (this.accepts('json', 'html', 'text')) {
case 'json': break
case 'html': break
case 'text': break
default: this.throw(406, 'json, html, or text only')
}
Check if encodings
are acceptable, returning the best match when true, otherwise false
. Note that you should include identity
as one of the encodings!
// Accept-Encoding: gzip
this.acceptsEncodings('gzip', 'deflate', 'identity')
// => "gzip"
this.acceptsEncodings(['gzip', 'deflate', 'identity'])
// => "gzip"
When no arguments are given all accepted encodings are returned as an array:
// Accept-Encoding: gzip, deflate
this.acceptsEncodings()
// => ["gzip", "deflate", "identity"]
Note that the identity
encoding (which means no encoding) could be unacceptable if the client explicitly sends identity;q=0
. Although this is an edge case, you should still handle the case where this method returns false
.
Check if charsets
are acceptable, returning the best match when true, otherwise false
.
// Accept-Charset: utf-8, iso-8859-1;q=0.2, utf-7;q=0.5
this.acceptsCharsets('utf-8', 'utf-7')
// => "utf-8"
this.acceptsCharsets(['utf-7', 'utf-8'])
// => "utf-8"
When no arguments are given all accepted charsets are returned as an array:
// Accept-Charset: utf-8, iso-8859-1;q=0.2, utf-7;q=0.5
this.acceptsCharsets()
// => ["utf-8", "utf-7", "iso-8859-1"]
Check if langs
are acceptable, returning the best match when true, otherwise false
.
// Accept-Language: en;q=0.8, es, pt
this.acceptsLanguages('es', 'en')
// => "es"
this.acceptsLanguages(['en', 'es'])
// => "es"
When no arguments are given all accepted languages are returned as an array:
// Accept-Language: en;q=0.8, es, pt
this.acceptsLanguages()
// => ["es", "pt", "en"]
Check if the request is idempotent.
Return the request socket.
Return request header.
The same as Koa’s Response
Response
object is an abstraction on top of node’s vanilla response object, providing additional functionality that is useful for every day HTTP server development.
Response header object.
Response header object. Alias as response.header
.
Request socket.
Get response status. By default, response.status
is not set unlike node’s res.statusCode
which defaults to 200
.
Set response status via numeric code:
NOTE: don’t worry too much about memorizing these strings,
if you have a typo an error will be thrown, displaying this list
so you can make a correction.
Get response status message. By default, response.message
is associated with response.status
.
Set response status message to the given value.
Set response Content-Length to the given value.
Return response Content-Length as a number when present, or deduce from this.body
when possible, or undefined
.
Get response body.
Set response body to one of the following:
string
writtenBuffer
writtenStream
pipedObject
json-stringifiednull
no content responseIf response.status
has not been set, Toa will automatically set the status to 200
or 204
.
The Content-Type is defaulted to text/html or text/plain, both with a default charset of utf-8. The Content-Length field is also set.
The Content-Type is defaulted to application/octet-stream, and Content-Length is also set.
The Content-Type is defaulted to application/octet-stream.
The Content-Type is defaulted to application/json.
Get a response header field value with case-insensitive field
.
let etag = this.get('etag')
Set response header field
to value
:
this.set('Cache-Control', 'no-cache')
Append additional header field
with value val
.
this.append('Link', '<http://<IP_ADDRESS>/>')
Set several response header fields
with an object:
this.set({
'ETag': '1234',
'Last-Modified': date
})
Remove header field
.
Get response Content-Type
void of parameters such as "charset".
let ct = this.type
// => "image/png"
Set response Content-Type
via mime string or file extension.
this.type = 'text/plain; charset=utf-8'
this.type = 'image/png'
this.type = '.png'
this.type = 'png'
Note: when appropriate a charset
is selected for you, for example response.type = 'html'
will default to "utf-8", however when explicitly defined in full as response.type = 'text/html'
no charset is assigned.
Very similar to this.request.is()
. Check whether the response type is one of the supplied types. This is particularly useful for creating middleware that manipulate responses.
Perform a [302] redirect to url
.
The string “back” is special-cased to provide Referrer support, when Referrer is not present alt
or “/” is used.
this.redirect('back')
this.redirect('back', '/index.html')
this.redirect('/login')
this.redirect('http://google.com')
To alter the default status of 302
, simply assign the status before or after this call. To alter the body, assign it after this call:
this.status = 301
this.redirect('/cart')
this.body = 'Redirecting to shopping cart'
Set Content-Disposition
to “attachment” to signal the client to prompt for download. Optionally specify the filename
of the download.
Check if a response header has already been sent. Useful for seeing if the client may be notified on error.
Return the Last-Modified
header as a Date
, if it exists.
Set the Last-Modified
header as an appropriate UTC string. You can either set it as a Date
or date string.
this.response.lastModified = new Date()
Set the ETag of a response including the wrapped "
s. Note that there is no corresponding response.etag
getter.
this.response.etag = crypto.createHash('md5').update(this.body).digest('hex')
Vary on field
.


Find REST service at this host and port and path "http://localhost:port/api/v1".
Find swagger at "http://localhost:port/swagger-ui.html".


The Benelli M2 is a semi-automatic shotgun manufactured by Benelli Armi SpA,
and one of the "Benelli Super 90" series of semi-auto shotguns.
it is available in several versions for civilian, law enforcement and military use.
It features the proprietary Benelli inertia system of operation.
Specifications
The Benelli Nova is a pump action shotgun, used for hunting and self-defense. It has a one-piece receiver and buttstock, made of steel-reinforced polymer. This model is intended for defensive purposes. With an 18½" barrel, and rifle or ghost- ring (diopter) sights, it is easier to wield and quicker to sight than hunting models.
Specifications
The Remington Model 870 is a pump-action shotgun manufactured by Remington Arms Company, LLC. It is widely used by the public for sport shooting, hunting, and self-defense and used by law enforcement and military organizations worldwide.
Specifications
The A400 will shoot any shell, from light 24-gram Olympic loads through heavy 3 ½-inch magnums, interchangeably without adjustment. The exterior has laser checkering and engraving. The high-strength aluminum action is anodized in colors–green, blue, bronze, or black–or camo-clad for its various specialized applications.
One of the first features incorporated was a detachable trigger group for easy replacement in the heat of a match. The MX8 is available in multiple configurations and gauges for various sporting clays, trap, and skeet disciplines.
Specifications
The Beretta DT10 is an over and under shotgun. It is manufactured, marketed, and distributed by Fabbrica d'Armi Pietro Beretta, in Gardone Val Trompia, Italy. It is one of the few Beretta shotguns that has a trigger unit that is detachable in the field, the DT in its name standing for detachable trigger. It combines features between the older Beretta ASE and the newer Beretta 682 model and is targeted at their competition market.
Specifications
Copyright @ 2020 F&F House OF Guns.CO. All Rights Reserved


| Detach | Open Channel | ID |
{{peer?.id | slice:0:10}}...
|
Alias | {{peer?.alias}} | Connected | {{peer?.connected}} | Network Address |
{{ addr}}, |
Global Features | {{peer?.globalfeatures}} | Local Features | {{peer?.localfeatures}} |
|---|


{% include head.html %}
{% include header.html %} {% include top_story.html %} {% include services.html %} {% include portfolio_grid.html %} {% include about.html %} {% include team.html %} {% include clients.html %} {% include footer.html %} {% include js.html %} {% if jekyll.environment == 'production' %} {% include analytics.html %} {% endif %}


Problem 3. Occurrences of word
Write a function that finds all the occurrences of word in a text. The search can be case sensitive or case insensitive. Use function overloading.
Print
Insensitive


POP
Menu
About Us
Health
COVID-19 Symptoms
Contact
menu
POP
This is where the map will be.
Get Started
dashboard
Dashboard
accessibility
Population Density
fact_check
Policy Checker


Design principles
10 principles for designing user centred public services
Design patterns
Service patterns, interaction patterns and design guides
Prototype kit
Make HTML prototypes using GOV.UK styles and patterns
Content style guide
Create content with a consistent style and tone of voice
Front end style guide
Grids, typography, colours, forms, icons, tables, pages and more


--- layout: post date: 2009-01-10 time: "09:00:00" authors: ["Greg Wilson"] title: I *Want* To Be A Number tags: ["Noticed"] ---
Via Science in the Open's summary of the workshop on open science at PSB'09, a link to a paper explaining why scientists will want to identify themselves with unique serial numbers.


Processing function for floating-point LMS filter.
| [in] | *S | points to an instance of the floating-point LMS filter structure. |
| [in] | *pSrc | points to the block of input data. |
| [in] | *pRef | points to the block of reference data. |
| [out] | *pOut | points to the block of output data. |
| [out] | *pErr | points to the block of error data. |
| [in] | blockSize | number of samples to process. |
| void arm_lms_init_f32 | ( | arm_lms_instance_f32 * | S, |
| uint16_t | numTaps, | ||
| float32_t * | pCoeffs, | ||
| float32_t * | pState, | ||
| float32_t | mu, | ||
| uint32_t | blockSize | ||
| ) |
Initialization function for floating-point LMS filter.
| [in] | *S | points to an instance of the floating-point LMS filter structure. |
| [in] | numTaps | number of filter coefficients. |
| [in] | *pCoeffs | points to the coefficient buffer. |
| [in] | *pState | points to state buffer. |
| [in] | mu | step size that controls filter coefficient updates. |
| [in] | blockSize | number of samples to process. |
| void arm_lms_init_q15 | ( | arm_lms_instance_q15 * | S, |
| uint16_t | numTaps, | ||
| q15_t * | pCoeffs, | ||
| q15_t * | pState, | ||
| q15_t | mu, | ||
| uint32_t | blockSize, | ||
| uint32_t | postShift | ||
| ) |
Initialization function for the Q15 LMS filter.
| [in] | *S | points to an instance of the Q15 LMS filter structure. |
| [in] | numTaps | number of filter coefficients. |
| [in] | *pCoeffs | points to the coefficient buffer. |
| [in] | *pState | points to the state buffer. |
| [in] | mu | step size that controls filter coefficient updates. |
| [in] | blockSize | number of samples to process. |
| [in] | postShift | bit shift applied to coefficients. |
| void arm_lms_init_q31 | ( | arm_lms_instance_q31 * | S, |
| uint16_t | numTaps, | ||
| q31_t * | pCoeffs, | ||
| q31_t * | pState, | ||
| q31_t | mu, | ||
| uint32_t | blockSize, | ||
| uint32_t | postShift | ||
| ) |
Initialization function for Q31 LMS filter.
| [in] | *S | points to an instance of the Q31 LMS filter structure. |
| [in] | numTaps | number of filter coefficients. |
| [in] | *pCoeffs | points to coefficient buffer. |
| [in] | *pState | points to state buffer. |
| [in] | mu | step size that controls filter coefficient updates. |
| [in] | blockSize | number of samples to process. |
| [in] | postShift | bit shift applied to coefficients. |
| void arm_lms_norm_f32 | ( | arm_lms_norm_instance_f32 * | S, |
| float32_t * | pSrc, | ||
| float32_t * | pRef, | ||
| float32_t * | pOut, | ||
| float32_t * | pErr, | ||
| uint32_t | blockSize | ||
| ) |
Processing function for floating-point normalized LMS filter.
| [in] | *S | points to an instance of the floating-point normalized LMS filter structure. |
| [in] | *pSrc | points to the block of input data. |
| [in] | *pRef | points to the block of reference data. |
| [out] | *pOut | points to the block of output data. |
| [out] | *pErr | points to the block of error data. |
| [in] | blockSize | number of samples to process. |
| void arm_lms_norm_init_f32 | ( | arm_lms_norm_instance_f32 * | S, |
| uint16_t | numTaps, | ||
| float32_t * | pCoeffs, | ||
| float32_t * | pState, | ||
| float32_t | mu, | ||
| uint32_t | blockSize | ||
| ) |
Initialization function for floating-point normalized LMS filter.
| [in] | *S | points to an instance of the floating-point LMS filter structure. |
| [in] | numTaps | number of filter coefficients. |
| [in] | *pCoeffs | points to coefficient buffer. |
| [in] | *pState | points to state buffer. |
| [in] | mu | step size that controls filter coefficient updates. |
| [in] | blockSize | number of samples to process. |
| void arm_lms_norm_init_q15 | ( | arm_lms_norm_instance_q15 * | S, |
| uint16_t | numTaps, | ||
| q15_t * | pCoeffs, | ||
| q15_t * | pState, | ||
| q15_t | mu, | ||
| uint32_t | blockSize, | ||
| uint8_t | postShift | ||
| ) |
Initialization function for Q15 normalized LMS filter.
| [in] | *S | points to an instance of the Q15 normalized LMS filter structure. |
| [in] | numTaps | number of filter coefficients. |
| [in] | *pCoeffs | points to coefficient buffer. |
| [in] | *pState | points to state buffer. |
| [in] | mu | step size that controls filter coefficient updates. |
| [in] | blockSize | number of samples to process. |
| [in] | postShift | bit shift applied to coefficients. |
| void arm_lms_norm_init_q31 | ( | arm_lms_norm_instance_q31 * | S, |
| uint16_t | numTaps, | ||
| q31_t * | pCoeffs, | ||
| q31_t * | pState, | ||
| q31_t | mu, | ||
| uint32_t | blockSize, | ||
| uint8_t | postShift | ||
| ) |
Initialization function for Q31 normalized LMS filter.
| [in] | *S | points to an instance of the Q31 normalized LMS filter structure. |
| [in] | numTaps | number of filter coefficients. |
| [in] | *pCoeffs | points to coefficient buffer. |
| [in] | *pState | points to state buffer. |
| [in] | mu | step size that controls filter coefficient updates. |
| [in] | blockSize | number of samples to process. |
| [in] | postShift | bit shift applied to coefficients. |
| void arm_lms_norm_q15 | ( | arm_lms_norm_instance_q15 * | S, |
| q15_t * | pSrc, | ||
| q15_t * | pRef, | ||
| q15_t * | pOut, | ||
| q15_t * | pErr, | ||
| uint32_t | blockSize | ||
| ) |
Processing function for Q15 normalized LMS filter.
| [in] | *S | points to an instance of the Q15 normalized LMS filter structure. |
| [in] | *pSrc | points to the block of input data. |
| [in] | *pRef | points to the block of reference data. |
| [out] | *pOut | points to the block of output data. |
| [out] | *pErr | points to the block of error data. |
| [in] | blockSize | number of samples to process. |
| void arm_lms_norm_q31 | ( | arm_lms_norm_instance_q31 * | S, |
| q31_t * | pSrc, | ||
| q31_t * | pRef, | ||
| q31_t * | pOut, | ||
| q31_t * | pErr, | ||
| uint32_t | blockSize | ||
| ) |
Processing function for Q31 normalized LMS filter.
| [in] | *S | points to an instance of the Q31 normalized LMS filter structure. |
| [in] | *pSrc | points to the block of input data. |
| [in] | *pRef | points to the block of reference data. |
| [out] | *pOut | points to the block of output data. |
| [out] | *pErr | points to the block of error data. |
| [in] | blockSize | number of samples to process. |
| void arm_lms_q15 | ( | const arm_lms_instance_q15 * | S, |
| q15_t * | pSrc, | ||
| q15_t * | pRef, | ||
| q15_t * | pOut, | ||
| q15_t * | pErr, | ||
| uint32_t | blockSize | ||
| ) |
Processing function for Q15 LMS filter.
| [in] | *S | points to an instance of the Q15 LMS filter structure. |
| [in] | *pSrc | points to the block of input data. |
| [in] | *pRef | points to the block of reference data. |
| [out] | *pOut | points to the block of output data. |
| [out] | *pErr | points to the block of error data. |
| [in] | blockSize | number of samples to process. |
| void arm_lms_q31 | ( | const arm_lms_instance_q31 * | S, |
| q31_t * | pSrc, | ||
| q31_t * | pRef, | ||
| q31_t * | pOut, | ||
| q31_t * | pErr, | ||
| uint32_t | blockSize | ||
| ) |
Processing function for Q31 LMS filter.
| [in] | *S | points to an instance of the Q15 LMS filter structure. |
| [in] | *pSrc | points to the block of input data. |
| [in] | *pRef | points to the block of reference data. |
| [out] | *pOut | points to the block of output data. |
| [out] | *pErr | points to the block of error data. |
| [in] | blockSize | number of samples to process. |
| arm_status arm_mat_add_f32 | ( | const arm_matrix_instance_f32 * | pSrcA, |
| const arm_matrix_instance_f32 * | pSrcB, | ||
| arm_matrix_instance_f32 * | pDst | ||
| ) |
Floating-point matrix addition.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_add_q15 | ( | const arm_matrix_instance_q15 * | pSrcA, |
| const arm_matrix_instance_q15 * | pSrcB, | ||
| arm_matrix_instance_q15 * | pDst | ||
| ) |
Q15 matrix addition.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_add_q31 | ( | const arm_matrix_instance_q31 * | pSrcA, |
| const arm_matrix_instance_q31 * | pSrcB, | ||
| arm_matrix_instance_q31 * | pDst | ||
| ) |
Q31 matrix addition.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_cmplx_mult_f32 | ( | const arm_matrix_instance_f32 * | pSrcA, |
| const arm_matrix_instance_f32 * | pSrcB, | ||
| arm_matrix_instance_f32 * | pDst | ||
| ) |
Floating-point, complex, matrix multiplication.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_cmplx_mult_q15 | ( | const arm_matrix_instance_q15 * | pSrcA, |
| const arm_matrix_instance_q15 * | pSrcB, | ||
| arm_matrix_instance_q15 * | pDst, | ||
| q15_t * | pScratch | ||
| ) |
Q15, complex, matrix multiplication.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_cmplx_mult_q31 | ( | const arm_matrix_instance_q31 * | pSrcA, |
| const arm_matrix_instance_q31 * | pSrcB, | ||
| arm_matrix_instance_q31 * | pDst | ||
| ) |
Q31, complex, matrix multiplication.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | void arm_mat_init_f32 | ( | arm_matrix_instance_f32 * | S, |
| uint16_t | nRows, | ||
| uint16_t | nColumns, | ||
| float32_t * | pData | ||
| ) |
Floating-point matrix initialization.
| [in,out] | *S | points to an instance of the floating-point matrix structure. |
| [in] | nRows | number of rows in the matrix. |
| [in] | nColumns | number of columns in the matrix. |
| [in] | *pData | points to the matrix data array. |
| void arm_mat_init_q15 | ( | arm_matrix_instance_q15 * | S, |
| uint16_t | nRows, | ||
| uint16_t | nColumns, | ||
| q15_t * | pData | ||
| ) |
Q15 matrix initialization.
| [in,out] | *S | points to an instance of the floating-point matrix structure. |
| [in] | nRows | number of rows in the matrix. |
| [in] | nColumns | number of columns in the matrix. |
| [in] | *pData | points to the matrix data array. |
| void arm_mat_init_q31 | ( | arm_matrix_instance_q31 * | S, |
| uint16_t | nRows, | ||
| uint16_t | nColumns, | ||
| q31_t * | pData | ||
| ) |
Q31 matrix initialization.
| [in,out] | *S | points to an instance of the floating-point matrix structure. |
| [in] | nRows | number of rows in the matrix. |
| [in] | nColumns | number of columns in the matrix. |
| [in] | *pData | points to the matrix data array. |
| arm_status arm_mat_inverse_f32 | ( | const arm_matrix_instance_f32 * | src, |
| arm_matrix_instance_f32 * | dst | ||
| ) |
end of PID group
Floating-point matrix inverse.
| [in] | *src | points to the instance of the input floating-point matrix structure. |
| [out] | *dst | points to the instance of the output floating-point matrix structure. |
| arm_status arm_mat_inverse_f64 | ( | const arm_matrix_instance_f64 * | src, |
| arm_matrix_instance_f64 * | dst | ||
| ) |
Floating-point matrix inverse.
| [in] | *src | points to the instance of the input floating-point matrix structure. |
| [out] | *dst | points to the instance of the output floating-point matrix structure. |
| arm_status arm_mat_mult_f32 | ( | const arm_matrix_instance_f32 * | pSrcA, |
| const arm_matrix_instance_f32 * | pSrcB, | ||
| arm_matrix_instance_f32 * | pDst | ||
| ) |
Floating-point matrix multiplication.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_mult_fast_q15 | ( | const arm_matrix_instance_q15 * | pSrcA, |
| const arm_matrix_instance_q15 * | pSrcB, | ||
| arm_matrix_instance_q15 * | pDst, | ||
| q15_t * | pState | ||
| ) |
Q15 matrix multiplication (fast variant) for Cortex-M3 and Cortex-M4.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
| [in] | *pState | points to the array for storing intermediate results |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_mult_fast_q31 | ( | const arm_matrix_instance_q31 * | pSrcA, |
| const arm_matrix_instance_q31 * | pSrcB, | ||
| arm_matrix_instance_q31 * | pDst | ||
| ) |
Q31 matrix multiplication (fast variant) for Cortex-M3 and Cortex-M4.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_mult_q15 | ( | const arm_matrix_instance_q15 * | pSrcA, |
| const arm_matrix_instance_q15 * | pSrcB, | ||
| arm_matrix_instance_q15 * | pDst, | ||
| q15_t * | pState | ||
| ) |
Q15 matrix multiplication.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
| [in] | *pState | points to the array for storing intermediate results |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_mult_q31 | ( | const arm_matrix_instance_q31 * | pSrcA, |
| const arm_matrix_instance_q31 * | pSrcB, | ||
| arm_matrix_instance_q31 * | pDst | ||
| ) |
Q31 matrix multiplication.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_scale_f32 | ( | const arm_matrix_instance_f32 * | pSrc, |
| float32_t | scale, | ||
| arm_matrix_instance_f32 * | pDst | ||
| ) |
Floating-point matrix scaling.
| [in] | *pSrc | points to the input matrix |
| [in] | scale | scale factor |
| [out] | *pDst | points to the output matrix |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_scale_q15 | ( | const arm_matrix_instance_q15 * | pSrc, |
| q15_t | scaleFract, | ||
| int32_t | shift, | ||
| arm_matrix_instance_q15 * | pDst | ||
| ) |
Q15 matrix scaling.
| [in] | *pSrc | points to input matrix |
| [in] | scaleFract | fractional portion of the scale factor |
| [in] | shift | number of bits to shift the result by |
| [out] | *pDst | points to output matrix |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_scale_q31 | ( | const arm_matrix_instance_q31 * | pSrc, |
| q31_t | scaleFract, | ||
| int32_t | shift, | ||
| arm_matrix_instance_q31 * | pDst | ||
| ) |
Q31 matrix scaling.
| [in] | *pSrc | points to input matrix |
| [in] | scaleFract | fractional portion of the scale factor |
| [in] | shift | number of bits to shift the result by |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_sub_f32 | ( | const arm_matrix_instance_f32 * | pSrcA, |
| const arm_matrix_instance_f32 * | pSrcB, | ||
| arm_matrix_instance_f32 * | pDst | ||
| ) |
Floating-point matrix subtraction.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_sub_q15 | ( | const arm_matrix_instance_q15 * | pSrcA, |
| const arm_matrix_instance_q15 * | pSrcB, | ||
| arm_matrix_instance_q15 * | pDst | ||
| ) |
Q15 matrix subtraction.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_sub_q31 | ( | const arm_matrix_instance_q31 * | pSrcA, |
| const arm_matrix_instance_q31 * | pSrcB, | ||
| arm_matrix_instance_q31 * | pDst | ||
| ) |
Q31 matrix subtraction.
| [in] | *pSrcA | points to the first input matrix structure |
| [in] | *pSrcB | points to the second input matrix structure |
| [out] | *pDst | points to output matrix structure |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_trans_f32 | ( | const arm_matrix_instance_f32 * | pSrc, |
| arm_matrix_instance_f32 * | pDst | ||
| ) |
Floating-point matrix transpose.
| [in] | *pSrc | points to the input matrix |
| [out] | *pDst | points to the output matrix |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_trans_q15 | ( | const arm_matrix_instance_q15 * | pSrc, |
| arm_matrix_instance_q15 * | pDst | ||
| ) |
Q15 matrix transpose.
| [in] | *pSrc | points to the input matrix |
| [out] | *pDst | points to the output matrix |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. | arm_status arm_mat_trans_q31 | ( | const arm_matrix_instance_q31 * | pSrc, |
| arm_matrix_instance_q31 * | pDst | ||
| ) |
Q31 matrix transpose.
| [in] | *pSrc | points to the input matrix |
| [out] | *pDst | points to the output matrix |
ARM_MATH_SIZE_MISMATCH
or ARM_MATH_SUCCESS
based on the outcome of size checking. Maximum value of a floating-point vector.
| [in] | *pSrc | points to the input buffer |
| [in] | blockSize | length of the input vector |
| [out] | *pResult | maximum value returned here |
| [out] | *pIndex | index of maximum value returned here |
Maximum value of a Q15 vector.
| [in] | *pSrc | points to the input buffer |
| [in] | blockSize | length of the input vector |
| [out] | *pResult | maximum value returned here |
| [out] | *pIndex | index of maximum value returned here |
Maximum value of a Q31 vector.
| [in] | *pSrc | points to the input buffer |
| [in] | blockSize | length of the input vector |
| [out] | *pResult | maximum value returned here |
| [out] | *pIndex | index of maximum value returned here |
Maximum value of a Q7 vector.
| [in] | *pSrc | points to the input buffer |
| [in] | blockSize | length of the input vector |
| [out] | *pResult | maximum value returned here |
| [out] | *pIndex | index of maximum value returned here |
Mean value of a floating-point vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Mean value of a Q15 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Mean value of a Q31 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Mean value of a Q7 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Minimum value of a floating-point vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output pointer |
| [out] | *pIndex | is the array index of the minimum value in the input buffer. |
Minimum value of a Q15 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output pointer |
| [in] | *pIndex | is the array index of the minimum value in the input buffer. |
Minimum value of a Q31 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output pointer |
| [out] | *pIndex | is the array index of the minimum value in the input buffer. |
Minimum value of a Q7 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *result | is output pointer |
| [in] | index | is the array index of the minimum value in the input buffer. |
Floating-point vector multiplication.
| [in] | *pSrcA | points to the first input vector |
| [in] | *pSrcB | points to the second input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in each vector |
Q15 vector multiplication.
| [in] | *pSrcA | points to the first input vector |
| [in] | *pSrcB | points to the second input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in each vector |
Q31 vector multiplication.
| [in] | *pSrcA | points to the first input vector |
| [in] | *pSrcB | points to the second input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in each vector |
Q7 vector multiplication.
| [in] | *pSrcA | points to the first input vector |
| [in] | *pSrcB | points to the second input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in each vector |
Negates the elements of a floating-point vector.
| [in] | *pSrc | points to the input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Negates the elements of a Q15 vector.
| [in] | *pSrc | points to the input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Negates the elements of a Q31 vector.
| [in] | *pSrc | points to the input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Negates the elements of a Q7 vector.
| [in] | *pSrc | points to the input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Adds a constant offset to a floating-point vector.
| [in] | *pSrc | points to the input vector |
| [in] | offset | is the offset to be added |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Adds a constant offset to a Q15 vector.
| [in] | *pSrc | points to the input vector |
| [in] | offset | is the offset to be added |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Adds a constant offset to a Q31 vector.
| [in] | *pSrc | points to the input vector |
| [in] | offset | is the offset to be added |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Adds a constant offset to a Q7 vector.
| [in] | *pSrc | points to the input vector |
| [in] | offset | is the offset to be added |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
| void arm_pid_init_f32 | ( | arm_pid_instance_f32 * | S, |
| int32_t | resetStateFlag | ||
| ) |
Initialization function for the floating-point PID Control.
| [in,out] | *S | points to an instance of the PID structure. |
| [in] | resetStateFlag | flag to reset the state. 0 = no change in state 1 = reset the state. |
| void arm_pid_init_q15 | ( | arm_pid_instance_q15 * | S, |
| int32_t | resetStateFlag | ||
| ) |
Initialization function for the Q15 PID Control.
| [in,out] | *S | points to an instance of the Q15 PID structure. |
| [in] | resetStateFlag | flag to reset the state. 0 = no change in state 1 = reset the state. |
| void arm_pid_init_q31 | ( | arm_pid_instance_q31 * | S, |
| int32_t | resetStateFlag | ||
| ) |
Initialization function for the Q31 PID Control.
| [in,out] | *S | points to an instance of the Q15 PID structure. |
| [in] | resetStateFlag | flag to reset the state. 0 = no change in state 1 = reset the state. |
| void arm_pid_reset_f32 | ( | arm_pid_instance_f32 * | S | ) |
Reset function for the floating-point PID Control.
| [in,out] | *S | is an instance of the floating-point PID Control structure |
| void arm_pid_reset_q15 | ( | arm_pid_instance_q15 * | S | ) |
Reset function for the Q15 PID Control.
| [in,out] | *S | points to an instance of the q15 PID Control structure |
| void arm_pid_reset_q31 | ( | arm_pid_instance_q31 * | S | ) |
Reset function for the Q31 PID Control.
| [in,out] | *S | points to an instance of the Q31 PID Control structure |
Sum of the squares of the elements of a floating-point vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Sum of the squares of the elements of a Q15 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Sum of the squares of the elements of a Q31 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Sum of the squares of the elements of a Q7 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Converts the elements of the Q15 vector to floating-point vector.
| [in] | *pSrc | is input pointer |
| [out] | *pDst | is output pointer |
| [in] | blockSize | is the number of samples to process |
Converts the elements of the Q15 vector to Q31 vector.
| [in] | *pSrc | is input pointer |
| [out] | *pDst | is output pointer |
| [in] | blockSize | is the number of samples to process |
Converts the elements of the Q15 vector to Q7 vector.
| [in] | *pSrc | is input pointer |
| [out] | *pDst | is output pointer |
| [in] | blockSize | is the number of samples to process |
end of Inverse park group
Converts the elements of the Q31 vector to floating-point vector.
| [in] | *pSrc | is input pointer |
| [out] | *pDst | is output pointer |
| [in] | blockSize | is the number of samples to process |
Converts the elements of the Q31 vector to Q15 vector.
| [in] | *pSrc | is input pointer |
| [out] | *pDst | is output pointer |
| [in] | blockSize | is the number of samples to process |
Converts the elements of the Q31 vector to Q7 vector.
| [in] | *pSrc | is input pointer |
| [out] | *pDst | is output pointer |
| [in] | blockSize | is the number of samples to process |
end of park group
Converts the elements of the Q7 vector to floating-point vector.
| [in] | *pSrc | is input pointer |
| [out] | *pDst | is output pointer |
| [in] | blockSize | is the number of samples to process |
end of inv_clarke group
Converts the elements of the Q7 vector to Q15 vector.
| [in] | *pSrc | input pointer |
| [out] | *pDst | output pointer |
| [in] | blockSize | number of samples to process |
end of clarke group
Converts the elements of the Q7 vector to Q31 vector.
| [in] | *pSrc | input pointer |
| [out] | *pDst | output pointer |
| [in] | blockSize | number of samples to process |
Function to Calculates 1/in (reciprocal) value of Q15 Data type.
Function to Calculates 1/in (reciprocal) value of Q31 Data type.
| void arm_rfft_f32 | ( | const arm_rfft_instance_f32 * | S, |
| float32_t * | pSrc, | ||
| float32_t * | pDst | ||
| ) |
| void arm_rfft_fast_f32 | ( | arm_rfft_fast_instance_f32 * | S, |
| float32_t * | p, | ||
| float32_t * | pOut, | ||
| uint8_t | ifftFlag | ||
| ) |
| arm_status arm_rfft_fast_init_f32 | ( | arm_rfft_fast_instance_f32 * | S, |
| uint16_t | fftLen | ||
| ) |
| arm_status arm_rfft_init_f32 | ( | arm_rfft_instance_f32 * | S, |
| arm_cfft_radix4_instance_f32 * | S_CFFT, | ||
| uint32_t | fftLenReal, | ||
| uint32_t | ifftFlagR, | ||
| uint32_t | bitReverseFlag | ||
| ) |
| arm_status arm_rfft_init_q15 | ( | arm_rfft_instance_q15 * | S, |
| uint32_t | fftLenReal, | ||
| uint32_t | ifftFlagR, | ||
| uint32_t | bitReverseFlag | ||
| ) |
| arm_status arm_rfft_init_q31 | ( | arm_rfft_instance_q31 * | S, |
| uint32_t | fftLenReal, | ||
| uint32_t | ifftFlagR, | ||
| uint32_t | bitReverseFlag | ||
| ) |
| void arm_rfft_q15 | ( | const arm_rfft_instance_q15 * | S, |
| q15_t * | pSrc, | ||
| q15_t * | pDst | ||
| ) |
| void arm_rfft_q31 | ( | const arm_rfft_instance_q31 * | S, |
| q31_t * | pSrc, | ||
| q31_t * | pDst | ||
| ) |
Root Mean Square of the elements of a floating-point vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Root Mean Square of the elements of a Q15 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Root Mean Square of the elements of a Q31 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Multiplies a floating-point vector by a scalar.
| [in] | *pSrc | points to the input vector |
| [in] | scale | scale factor to be applied |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
| void arm_scale_q15 | ( | q15_t * | pSrc, |
| q15_t | scaleFract, | ||
| int8_t | shift, | ||
| q15_t * | pDst, | ||
| uint32_t | blockSize | ||
| ) |
Multiplies a Q15 vector by a scalar.
| [in] | *pSrc | points to the input vector |
| [in] | scaleFract | fractional portion of the scale value |
| [in] | shift | number of bits to shift the result by |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
| void arm_scale_q31 | ( | q31_t * | pSrc, |
| q31_t | scaleFract, | ||
| int8_t | shift, | ||
| q31_t * | pDst, | ||
| uint32_t | blockSize | ||
| ) |
Multiplies a Q31 vector by a scalar.
| [in] | *pSrc | points to the input vector |
| [in] | scaleFract | fractional portion of the scale value |
| [in] | shift | number of bits to shift the result by |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Multiplies a Q7 vector by a scalar.
| [in] | *pSrc | points to the input vector |
| [in] | scaleFract | fractional portion of the scale value |
| [in] | shift | number of bits to shift the result by |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Shifts the elements of a Q15 vector a specified number of bits.
| [in] | *pSrc | points to the input vector |
| [in] | shiftBits | number of bits to shift. A positive value shifts left; a negative value shifts right. |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Shifts the elements of a Q31 vector a specified number of bits.
| [in] | *pSrc | points to the input vector |
| [in] | shiftBits | number of bits to shift. A positive value shifts left; a negative value shifts right. |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
Shifts the elements of a Q7 vector a specified number of bits.
| [in] | *pSrc | points to the input vector |
| [in] | shiftBits | number of bits to shift. A positive value shifts left; a negative value shifts right. |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in the vector |
end of LinearInterpolate group
Fast approximation to the trigonometric sine function for floating-point data.
| [in] | x | input value in radians. |
Fast approximation to the trigonometric sine function for Q15 data.
| [in] | x | Scaled input value in radians. |
Fast approximation to the trigonometric sine function for Q31 data.
| [in] | x | Scaled input value in radians. |
Standard deviation of the elements of a floating-point vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Standard deviation of the elements of a Q15 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Standard deviation of the elements of a Q31 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Floating-point vector subtraction.
| [in] | *pSrcA | points to the first input vector |
| [in] | *pSrcB | points to the second input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in each vector |
Q15 vector subtraction.
| [in] | *pSrcA | points to the first input vector |
| [in] | *pSrcB | points to the second input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in each vector |
Q31 vector subtraction.
| [in] | *pSrcA | points to the first input vector |
| [in] | *pSrcB | points to the second input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in each vector |
Q7 vector subtraction.
| [in] | *pSrcA | points to the first input vector |
| [in] | *pSrcB | points to the second input vector |
| [out] | *pDst | points to the output vector |
| [in] | blockSize | number of samples in each vector |
Variance of the elements of a floating-point vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Variance of the elements of a Q15 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Variance of the elements of a Q31 vector.
| [in] | *pSrc | is input pointer |
| [in] | blockSize | is the number of samples to process |
| [out] | *pResult | is output value. |
Clips Q31 to Q15 values.
Clips Q63 to Q31 values.


November 2019
Radix sort is a non-comparative sorting algorithm that uses a stable sort subroutine to sort digits by the 1's place, then 10's place, etc up to the most significant digit. The parallelized algorithm was inspired by Jordy Ajanohoun from the PRACE Summer of HPC. In the parallelized implementation, the input array is divided up into smaller arrays of size N/P where N is the size of the input and P is the number of available processors. With each processor starting with its own subarray of size N/P, the following algorithm is performed:
Each processor receives a subarray of size N/P. For each digit i where i goes from least significant digit to most:
1. Each processor stable sorts (this implementation uses counting sort) its subinput by digit i.
2. Processors exchange their data such that the aggregate array across all processors is sorted by digit i.
The subarrays are gathered in order of processor index and the aggregate array is returned sorted. An example of this can be found below.
The parallelized algorithm was tested for performance alongside the serial algorithm and C's standard library quicksort "qsort". Each algorithm was tested on random arrays of size 1, 2, 4 ... 224. For each array size, the performance of each algorithm was averaged over 10 random inputs seeded by 10 pregenerated random seeds following in the practice of the mentioned HPC article.
For the largest input array size, the parallel algorithm ran in an average of 1.566 seconds while the serial and qsort algorithms ran in 3.854 and 6.144 seconds respectively.


|
lwIP
2.1.3
Lightweight IP stack
|
Modules | |
| Options | |
Data Structures | |
| struct | tCGI |
Typedefs | |
| typedef const char *(* | tCGIHandler) (int iIndex, int iNumParams, char *pcParam[], char *pcValue[]) |
| typedef u16_t(* | tSSIHandler) (const char *ssi_tag_name, char *pcInsert, int iInsertLen) |
Functions | |
| void | httpd_post_data_recved (void *connection, u16_t recved_len) |
| void | httpd_init (void) |
| void | httpd_inits (struct altcp_tls_config *conf) |
| void | http_set_ssi_handler (tSSIHandler ssi_handler, const char **tags, int num_tags) |
| void | http_set_cgi_handlers (const tCGI *cgis, int num_handlers) |
| err_t | httpd_post_begin (void *connection, const char *uri, const char *http_request, u16_t http_request_len, int content_len, char *response_uri, u16_t response_uri_len, u8_t *post_auto_wnd) |
| err_t | httpd_post_receive_data (void *connection, struct pbuf *p) |
| void | httpd_post_finished (void *connection, char *response_uri, u16_t response_uri_len) |
This httpd supports for a rudimentary server-side-include facility which will replace tags of the form in any file whose extension is .shtml, .shtm or .ssi with strings provided by an include handler whose pointer is provided to the module via function http_set_ssi_handler(). Additionally, a simple common gateway interface (CGI) handling mechanism has been added to allow clients to hook functions to particular request URIs.
To enable SSI support, define label LWIP_HTTPD_SSI in lwipopts.h. To enable CGI support, define label LWIP_HTTPD_CGI in lwipopts.h.
By default, the server assumes that HTTP headers are already present in each file stored in the file system. By defining LWIP_HTTPD_DYNAMIC_HEADERS in lwipopts.h, this behavior can be changed such that the server inserts the headers automatically based on the extension of the file being served. If this mode is used, be careful to ensure that the file system image used does not already contain the header information.
File system images without headers can be created using the makefsfile tool with the -h command line option.
The following assumptions are made about tags used in SSI markers:
The simple CGI support offered here works with GET method requests only and can handle up to 16 parameters encoded into the URI. The handler function may not write directly to the HTTP output but must return a filename that the HTTP server will send to the browser as a response to the incoming CGI request.
The list of supported file types is quite short, so if makefsdata complains about an unknown extension, make sure to add it (and its doctype) to the 'g_psHTTPHeaders' list.
| typedef const char*(* tCGIHandler) (int iIndex, int iNumParams, char *pcParam[], char *pcValue[]) |
Function pointer for a CGI script handler.
This function is called each time the HTTPD server is asked for a file whose name was previously registered as a CGI function using a call to http_set_cgi_handlers. The iIndex parameter provides the index of the CGI within the cgis array passed to http_set_cgi_handlers. Parameters pcParam and pcValue provide access to the parameters provided along with the URI. iNumParams provides a count of the entries in the pcParam and pcValue arrays. Each entry in the pcParam array contains the name of a parameter with the corresponding entry in the pcValue array containing the value for that parameter. Note that pcParam may contain multiple elements with the same name if, for example, a multi-selection list control is used in the form generating the data.
The function should return a pointer to a character string which is the path and filename of the response that is to be sent to the connected browser, for example "/thanks.htm" or "/response/error.ssi".
The maximum number of parameters that will be passed to this function via iNumParams is defined by LWIP_HTTPD_MAX_CGI_PARAMETERS. Any parameters in the incoming HTTP request above this number will be discarded.
Requests intended for use by this CGI mechanism must be sent using the GET method (which encodes all parameters within the URI rather than in a block later in the request). Attempts to use the POST method will result in the request being ignored.
| typedef u16_t(* tSSIHandler) (const char *ssi_tag_name, char *pcInsert, int iInsertLen) |
Function pointer for the SSI tag handler callback.
This function will be called each time the HTTPD server detects a tag of the form in files with extensions mentioned in the g_pcSSIExtensions array (currently .shtml, .shtm, .ssi, .xml, .json) where "name" appears as one of the tags supplied to http_set_ssi_handler in the tags array. The returned insert string, which will be appended after the the string "<!--#name-->" in file sent back to the client, should be written to pointer pcInsert. iInsertLen contains the size of the buffer pointed to by pcInsert. The iIndex parameter provides the zero-based index of the tag as found in the tags array and identifies the tag that is to be processed.
The handler returns the number of characters written to pcInsert excluding any terminating NULL or HTTPD_SSI_TAG_UNKNOWN when tag is not recognized.
Note that the behavior of this SSI mechanism is somewhat different from the "normal" SSI processing as found in, for example, the Apache web server. In this case, the inserted text is appended following the SSI tag rather than replacing the tag entirely. This allows for an implementation that does not require significant additional buffering of output data yet which will still offer usable SSI functionality. One downside to this approach is when attempting to use SSI within JavaScript. The SSI tag is structured to resemble an HTML comment but this syntax does not constitute a comment within JavaScript and, hence, leaving the tag in place will result in problems in these cases. In order to avoid these problems, define LWIP_HTTPD_SSI_INCLUDE_TAG as zero in your lwip options file, or use JavaScript style block comments in the form / * # name * / (without the spaces).
| void http_set_cgi_handlers | ( | const tCGI * | cgis, |
| int | num_handlers | ||
| ) |
Set an array of CGI filenames/handler functions
| cgis | an array of CGI filenames/handler functions |
| num_handlers | number of elements in the 'cgis' array |
| void http_set_ssi_handler | ( | tSSIHandler | ssi_handler, |
| const char ** | tags, | ||
| int | num_tags | ||
| ) |
Set the SSI handler function.
| ssi_handler | the SSI handler function |
| tags | an array of SSI tag strings to search for in SSI-enabled files |
| num_tags | number of tags in the 'tags' array |
| void httpd_init | ( | void | ) |
Initialize the httpd: set up a listening PCB and bind it to the defined port
| void httpd_inits | ( | struct altcp_tls_config * | conf | ) |
Initialize the httpd: set up a listening PCB and bind it to the defined port. Also set up TLS connection handling (HTTPS).
| err_t httpd_post_begin | ( | void * | connection, |
| const char * | uri, | ||
| const char * | http_request, | ||
| u16_t | http_request_len, | ||
| int | content_len, | ||
| char * | response_uri, | ||
| u16_t | response_uri_len, | ||
| u8_t * | post_auto_wnd | ||
| ) |
Called when a POST request has been received. The application can decide whether to accept it or not.
| connection | Unique connection identifier, valid until httpd_post_end is called. |
| uri | The HTTP header URI receiving the POST request. |
| http_request | The raw HTTP request (the first packet, normally). |
| http_request_len | Size of 'http_request'. |
| content_len | Content-Length from HTTP header. |
| response_uri | Filename of response file, to be filled when denying the request |
| response_uri_len | Size of the 'response_uri' buffer. |
| post_auto_wnd | Set this to 0 to let the callback code handle window updates by calling 'httpd_post_data_recved' (to throttle rx speed) default is 1 (httpd handles window updates automatically) |
| void httpd_post_data_recved | ( | void * | connection, |
| u16_t | recved_len | ||
| ) |
A POST implementation can call this function to update the TCP window. This can be used to throttle data reception (e.g. when received data is programmed to flash and data is received faster than programmed).
| connection | A connection handle passed to httpd_post_begin for which httpd_post_finished has NOT been called yet! |
| recved_len | Length of data received (for window update) |
| void httpd_post_finished | ( | void * | connection, |
| char * | response_uri, | ||
| u16_t | response_uri_len | ||
| ) |
Called when all data is received or when the connection is closed. The application must return the filename/URI of a file to send in response to this POST request. If the response_uri buffer is untouched, a 404 response is returned.
| connection | Unique connection identifier. |
| response_uri | Filename of response file, to be filled when denying the request |
| response_uri_len | Size of the 'response_uri' buffer. |
Called for each pbuf of data that has been received for a POST. ATTENTION: The application is responsible for freeing the pbufs passed in!
| connection | Unique connection identifier. |
| p | Received data. |


M (****** out of ******)
A review from the Stockholm Film Review http://www.reviewfilm.com/
Fritz Lang's M (1931) tells the story of a child killer who is terrorising a small German city. The film opens with a group of children playing and singing a nursery rhyme, the lyrics of which tell of a man in black who will take children who are naughty and chop them up. As they play, they bounce a ball against a street lamp, on which there is a Wanted poster, for the killer.
The next scene is in a fairground - a man buys a balloon for a small girl while whistling a jaunty tune. Meanwhile, her mother is busy preparing dinner for her return. Soon, the balloon is seen tangled in overhead power-lines - the child is the latest victim of the killer, while, at home, her mother becomes more and more frantic.
The latest killing causes outrage - parents are afraid to let their children go to school and even the most innocuous gestures by men towards children lead to suspicion and accusations. The police are under pressure - the city council, the press and the public are screaming for results.
The police inspector Lohmann (Otto Wernicke) in charge of the Investigation is a clever man, and he is methodical in his methods of detection. The killer is Franz Becker (Peter Lorre), who has been sending letters to the press and the police manage to track down his apartment. However, the police are not the only people looking for the killer - the criminal underworld has offered their own reward for his capture. This is not because of philanthropy - the police searches have caused so much interference to their activities, they decide that it is better for them if they catch the killer.
Lang's superb film contrasts the gentle, almost child-like manner of the killer, as he gradually gains the trust of his victims, with the frantic nature of the police and criminal investigations. When Becker attempts to lure another child away, he is patient and meticulous. He is a charming fellow, and he easily seduces his latest target, plying the young girl with cakes and bringing her to a funfair.
The pace of the chase is far more frantic. Though the police quickly discover the identity of the killer, it is the criminals who find the killer first. Becker is betrayed by his trademark tune. He buys a balloon from the same vendor as he had done when he murdered his previous victim. The vendor is blind but remembers the tune (Edvard Grieg's Peer Gynt Suite 1 Op. 46, "In the Hall of the Mountain King") and sends a young helper to follow Becker. The boy chalks the letter 'M' on his hand and, walking past Becker, pats him on the shoulder, leaving the 'M' imprinted on the back of his coat. In a delicious irony, the child with him (his prospective victim) notices the smudge on his coat, and tries to wipe it off. Becker realises that he has been marked, and attempts to escape. He is now in a dilemma - both the police and the criminal underworld hunt him. As night falls, he takes refuge in an office building. The criminals surround the building, seize him and hold their own mock trial.
Lang's movie constantly jolts our expectations - the criminal boss who organises the hunt for the killer is a sharply dressed and well-organised man. In contrast, Lohmann (the police inspector) is sloppily dressed, drinks and smokes too much, and exhibits the characteristics normally associated with a movie villain. He is, however, a clever detective, and his methodical approach, and his ingenious interrogation techniques lead him to both Becker's apartment and to the office building where the criminals are hunting Becker.
What is most impressive about M is how relevant and modern the film appears. The depiction of the hard-pressed police and also Lorre's portrayal of a baby-faced killer have not been surpassed by filmmakers since. There isn't a superfluous frame in the movie - Lang cuts between the hunt for the killer, and the killer's own hunt for his next victim to build the tension unbearably towards an exciting and fascinating climax.  Every time a child arrives in the apartment block, she rushes out to see if it is her daughter. Each time, she grows a little more worried. We, the audience, know the child is never coming back, which makes the mother's anxiety even more poignant. Another outstanding scene is when the criminals are hunting for Becker in the office building. The alarm has been sounded, so the criminals have only a limited amount of time in which to search for Becker - of course, Becker does not know this. He cowers like a caged rat, in a storage locker, hoping the criminals will not find him.
Again, Lang skilfully manipulates the audience - we want justice, but do we want it to occur at the hands of the criminals (amongst whom are killers and other undesirables) or at the hands of the upright and resourceful police inspector? His use of music is also skilful - we need only hear the tune to know that the killer is active and another child is in mortal danger. It's hard to believe that this was Lang's first 'talkie' - he was already well known for his silent classic, Metropolis (1926).
It is interesting to compare M to movies released in the United States around the same time. Both The Public Enemy (1931) and Little Caesar (1930)featured strong criminal personalities (breakthrough roles for James Cagney and Edward G. Robinson respectively). However, both films were studies of misused power. Though both Cesare 'Little Caesar' Bandello (Robinson) and Tom Powers (Cagney) were both capable of murder and viciousness, they were evil in a conventional sense. Two classic horror movies were also released at that time - Frankenstein (1931) and Dracula (1931). Both movies featured a monster, and scared audiences but in each case, the monster conformed to conventional mythology - it looked terribly scary and had an inhuman conception. The power of M derives from the fact that the monster had a human, almost angelic face, but his crimes were beyond comprehension.
Though most reviews of M describe Lorre as the main star, it is really an ensemble performance. Lorre's performance is outstanding - his portrayal of the truly multidimensional - his inability to see himself as anything other than a victim makes him seem even more evil. His terror at the prospect of receiving summary justice from the criminals is palpable. Lorre seems far heavier, even chubby, in this role than he would for later roles in Hollywood, such as The Maltese Falcon (1941) and Casablanca (1942).
The original title for M was The Murderer among Us, but it was changed in case the Nazi party inferred a reference to them. In fact, the story was based on a real-life murderer, but since M featured a dark parody of law and order (when the criminals hold their own 'trial' of Becker) and examined the power of mob-rule, it may have caused discomfort amongst the followers of the Nazi party. One could argue, with the benefit of hindsight that the portrayal of 'unspeakable evil with an ordinary face' in M could be seen as an allegory of the Nazis during World War 2, but it is unlikely that Lang intended such a comparison. In fact, Hitler and other high-level members of the Nazi party were fans of Lang's work. They wanted Lang to make propaganda films, but Lang escaped to America, fearing the consequences of having Jewish relations. Lorre, who was Jewish, also left for America during the Thirties.
Directed by Fritz Lang. Made in Black and White. In German.
Get Your Private, Free Email at http://www.hotmail.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Error #25: WRITE ERROR (write-verify error),TT,SS This message is generated if the controller detects a mismatch between the written data and the data in the DOS memory.


.
html, body
should have basic ligatures
should not have discretionary ligatures
Different Gastown flowers
should have kerning turned on
control
AVATAR LT.
AVATAR LT.
should have oldstyle numbers turned on (opinionated)
should have proportional numbers turned on
should have contextual alternates turned on
should not have an opinion on text-rendering
h1
, h2
, h3
, h4
, h5
, h6
h1
, h2
, h3
should have discretionary ligatures in headings (opinionated)
dist
dist
dist
h4
, h5
, h6
should not have discretionary ligatures in headings
dist
dist
dist
abbr
should sub lowercase letters for small caps
should sub capitals for small caps
should not use faux small
time
should use oldstyle figures
control June 24 2014, 19:00■.
should use proportional figures
control
June 24 2014, 19:00.
sub
and sup
should use proper superscript and subscript characters
control.
control. sub.
control. sup.
code
, kbd
, pre
, samp
should not use kerning
span: abcdefghijklmnopqrstuvwxyz.
code: abcdefghijklmnopqrstuvwxyz.
kbd: abcdefghijklmnopqrstuvwxyz.
samp: abcdefghijklmnopqrstuvwxyz.
pre: abcdefghijklmnopqrstuvwxyz.
should not use ligatures
span: ffl fl fk st.
code: ffl fl fk st.
kbd: ffl fl fk st.
samp: ffl fl fk st.
pre: ffl fl fk st.
ol
should use oldstyle numbers on ordered list items
- Dude Hank Pro
- Fairview
- Klinic Slab
should use tabular numbers on ordered list items
- Dude Hank Pro
- Fairview
- Klinic Slab
inputs
should use lining, proportional numerals for color input fallbacks
should use lining, proportional numerals on date inputs
should use lining, proportional numerals on number inputs
should use lining, proportional numerals on range inputs’ tooltip
should use lining, proportional numerals on telephone inputs
should use lining, proportional numerals on week inputs
table
should use lining, tabular numerals
Blur – albums
| Album |
Year |
Price |
| Album |
Year |
Price |
| Leisure |
1991 |
$10.00 |
| Modern Life Is Rubbish |
1993 |
$12.00 |
| Parklife |
1994 |
$10.00 |
::selection
different flowers. Try selecting this text using the cursor (Command + A won’t cut it).


Home
Pollution
How to help
Get Involved
City:
State:
Choose an Option
Alabama
Alaska
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
Florida
Georgia
Hawaii
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maine
Maryland
Massachussetts
Michigan
Minnestoa
Mississipi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Ohio
Oklahama
Oregon
Pennsylvania
Rhode Island
South Carolina
South Dakota
Texas
Utah
Virginia
Washington
West Virginia
Wisconsin
Wyoming
Submit
Air Quality Index Scale
0 - 50 Good
51 - 100 Moderate
101 - 150 UnHealthy For Sensitive Groups
151 - 200 Unhealthy
200 - 300 Very Unhealthy
301 - 500 Hazardous
Pollutant Abbreviations
Particulate Matter 10 (p1)
Particulate Matter 2.5 (p2)
Ozone (o3)
Nitrogen (n2)
Carbon Monoxide (co)
Sulphur Dioxide (so2)