<button id="slideAwayButton">Slide block away</button>
<button id="slideBackButton">Slide block back</button>

<div id="slideTarget" class="red-block slide">
	A red block
</div>
<script>
	dojo.require("dojo.fx");

	dojo.ready(function(){
		var slideAwayButton = dojo.byId("slideAwayButton"),
			slideBackButton = dojo.byId("slideBackButton"),
			slideTarget = dojo.byId("slideTarget");

		dojo.connect(slideAwayButton, "onclick", function(evt){
			dojo.fx.slideTo({ node: slideTarget, left: "200", top: "200" }).play();
		});
		dojo.connect(slideBackButton, "onclick", function(evt){
			dojo.fx.slideTo({ node: slideTarget, left: "0", top: "100" }).play();
		});
	});
</script>

Py之slidingwindow&sliding_window：slidingwindow、sliding_window的简介、安装、使用方法之详细攻略
 
 
 
目录
 
sliding_window的简介
 
sliding_window的安装
 
sliding_window的使用方法
 

 
 
 
 
slidingwindow、sliding_window的简介
 
 
 
sliding_window
 
参考文章：http://stackoverflow.com/a/6822761
 
 
 
slidingwindow
 
       这是一个简单的小Python库，用于将一组窗口计算成一个较大的数据集，设计用于图像处理算法，该算法使用滑动窗口将处理分解为一系列较小的块。此外，还可以指定一组可选转换，以应用于每个窗口。
        还包括用于计算窗口距离矩阵的功能，用于需要考虑窗口中每个像素（相对于其中心）的位置的用例，以及用于批处理窗口和合并应用于窗口的处理结果的功能。
        对于在生成窗口边界后需要修改它们的用例，可以将窗口对象转换为（x，y，w，h）元组表示的矩形。还提供了转换矩形的功能（填充、裁剪、强制方形宽高比等）。
        还提供了创建NumPy数组的功能，如果可用的系统内存不足，该功能将回退到使用内存映射临时文件作为下划线数组缓冲区，以及确定生成窗口时可以使用的最大方形窗口大小。
 
 
 
 
 
 
 
 
 
sliding_window的安装
 
pip install sliding_window
 
 
pip install slidingwindow
 
 
 
 
 
 
sliding_window的使用方法
 
更新……
 
import slidingwindow as sw
import numpy as np

# Load our input image here
# data = load(...)

# Generate the set of windows, with a 256-pixel max window size and 50% overlap
windows = sw.generate(data, sw.DimOrder.HeightWidthChannel, 256, 0.5)

# Do stuff with the generated windows
for window in windows:
	subset = data[ window.indices() ]
	# ...

# Or, using some transformation functions
tranforms = [
	lambda m: np.fliplr(m),
	lambda m: np.flipud(m),
	lambda m: np.rot90(m, k=1, axes=(0, 1)),
	lambda m: np.rot90(m, k=3, axes=(0, 1))
]
windows = sw.generate(data, sw.DimOrder.HeightWidthChannel, 256, 0.5, tranforms)
for window in windows:
	transformed = window.apply(data)
	# ...

# Alternatively, if we want to modify each window
windows = sw.generate(data, sw.DimOrder.HeightWidthChannel, 256, 0.5)
for window in windows:
	rect = window.getRect()
	transformed = sw.padRectEqually(rect, 100, data.shape)
	window.setRect(transformed)
	# ...
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

An array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:
 The array is [1 3 -1 -3 5 3 6 7], and k is 3.
 
Window position
Minimum value
Maximum value
[1 3 -1] -3 5 3 6 7
-1
3
1 [3 -1 -3] 5 3 6 7
-3
3
1 3 [-1 -3 5] 3 6 7
-3
5
1 3 -1 [-3 5 3] 6 7
-3
5
1 3 -1 -3 [5 3 6] 7
3
6
1 3 -1 -3 5 [3 6 7]
3
7
Your task is to determine the maximum and minimum values in the sliding window at each position.
 
输入描述:
 The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line.
 
输出描述:
 There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.
 示例1
 输入
 8 3
 1 3 -1 -3 5 3 6 7
 输出
 -1 -3 -3 -3 3 3
 3 3 5 5 6 7
 
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 117;
int n, k, a[MAXN];
deque<int> de;
int main()
{
    scanf("%d%d", &n, &k);
    for(int i = 1; i <= n; i++)
	{
        scanf("%d", &a[i]);
        while(!de.empty() && de.front() + k - 1 < i) de.pop_front();
        while(!de.empty() && a[de.back()] > a[i]) de.pop_back();
        de.push_back(i);
        if(i >= k) printf("%d%c", a[de.front()], i == n ? 10 : 32);
    }
    de.clear();
    for(int i = 1; i <= n; i++)
	{
        while(!de.empty() && de.front() + k - 1 < i) de.pop_front();
        while(!de.empty() && a[de.back()] < a[i]) de.pop_back();
        de.push_back(i);
        if(i >= k) printf("%d%c", a[de.front()], i == n ? 10 : 32);
    }
    return 0;
}

sliding-panel
 
项目地址：PierfrancescoSoffritti/sliding-panel 
 
简介：Android sliding panel that is part of the view hierarchy, not above it.
 
更多：作者   提 Bug   
 
标签：
 
 
 
 
 
 
 
A ViewGroup that implements a sliding panel that is part of the view hierarchy, not above it.
 
Difference from other libraries
 
All other implementations of the bottom sheet pattern and sliding panel patternimplement a panel that sits above all the other Views of the app. When the panel is collapsed (but visible) the only way to set its position is by using a peek factor (its distance from the bottom of the screen).
 
With this library the sliding panel is placed exactly where it is supposed to be in the view hierarchy, just like it would be in a vertical (or horizontal) LinearLayout. It doesn't sit above other Views.
 
Overview
 
SlidingPanel is a ViewGroup exending FrameLayout.
 
It has exacly two children: a non sliding view and a sliding view.
 
The non sliding view is just a view that doesn't move, positioned as if SlidingPanel was a LinearLayout.
The sliding view is a View that can be dragged by the user. It slides over the non sliding view, both vertically and horizontally.
The sliding view can be collapsed or expanded.
 
When collapsed, the sliding view is exactly where it would be if SlidingPanel was a LinearLayout.
When expanded, the sliding view is positioned to exactly cover the non sliding view. (Therefore the maximum amount of movement allowed to the sliding view is equal to the height (or width) of the non sliding view)