content
stringlengths 228
999k
| pred_label
stringclasses 1
value | pred_score
float64 0.5
1
|
|---|---|---|
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other.
Join them; it only takes a minute:
Sign up
Join the Stack Overflow community to:
1. Ask programming questions
2. Answer and help your peers
3. Get recognized for your expertise
Find the shortest path from source to destination in a directed graph with positive and negative edges, such that at no point in the path the sum of edges coming before it is negative. If no such path exists report that too.
I tried to use modified Bellman Ford, but could not find the correct solution.
I would like to clarify a few points :
1. yes there can be negative weight cycles.
2. n is the number of edges.
3. Assume that a O(n) length path exists if the problem has a solution.
4. +1/-1 edge weights.
share|improve this question
3
smells like homework... – Felix Yan Mar 1 '12 at 2:03
6
Also, do you want the length of the path, or the path itself? If you want the path itself, you can't get an efficient algorithm in all cases, since the length of this path might be exponentially long (think about a hugely negative edge with a long cycle before it; you have to go around the cycle a lot before you can cross the edge.) – templatetypedef Mar 1 '12 at 2:19
1
@templatetypedef, I think is better to rewrite question as the format you like it (by too many answered and unanswered comments is not clear what's your goal). – Saeed Amiri Mar 12 '12 at 21:28
2
Even with "assume that a O(n) length path exists if the problem has a solution" (where n is the number of edges) it's at least as hard as the binary/discrete knapsack problems. The graph illustrated in that case has O(n) vertices, O(n) edges, and all paths from start to end are of length O(n). In other words, those requirements make it difficult to see how the problem at hand is NP-Hard (like TSP) but it's still NP. Not O(n^3). – Kaganar Mar 15 '12 at 13:54
1
After all this time, the OP hasn't managed to make the question clear. I do not believe any more that the OP knows what the question is. -1 – WolframH Mar 17 '12 at 22:13
up vote 14 down vote accepted
+500
Admittedly this isn't a constructive answer, however it's too long to post in a comment...
It seems to me that this problem contains the binary as well as discrete knapsack problems, so its worst-case-running-time is at best pseudo-polynomial. Consider a graph that is connected and weighted as follows:
Graph with initial edge with weight x and then a choice of -a(i) or 0 at each step
Then the equivalent binary knapsack problem is trying to choose weights from the set {a0, ..., an} that maximizes Σ ai where Σ ai < X.
As a side note, if we introduce weighted loops it's easy to construct the unbounded knapsack problem instead.
Therefore, any practical algorithm you might choose has a running time that depends on what you consider the "average" case. Is there a restriction to the problem that I've either not considered or not had at my disposal? You seem rather sure it's an O(n3) problem. (Although what's n in this case?)
share|improve this answer
1
Brilliant, thanks for the edit Gareth. :) What software did you use to generate the graph? – Kaganar Mar 12 '12 at 21:48
2
You're welcome. I used OmniGraffle. – Gareth Rees Mar 12 '12 at 21:51
2
Similarly, I think for an undirected graph with n vertices you can construct a n^2 directed graph with weights of -2i for vertex i (plus a starting weight of 2n-1) and get a solution to the NP-complete Hamiltonian path problem. (The minimum cost flow will go through every vertex once to get a total cost of 0) – Peter de Rivaz Mar 12 '12 at 21:59
@PeterdeRivaz- Can you elaborate on this? I tried to make that work, but you could always take some weird cyclic path and end up not actually finding the Hamiltonian cycle. – templatetypedef Mar 13 '12 at 0:48
1
Although the OP has since changed the question so that this doesn't directly answer the question, this answers the original question I was interested in by providing a proof of the NP-hardness of the original question. Thanks for a simple, elegant reduction! – templatetypedef Mar 18 '12 at 18:54
Peter de Rivaz pointed out in a comment that this problem includes HAMILTONIAN PATH as a special case. His explanation was a bit terse, and it took me a while to figure out the details, so I've drawn some diagrams for the benefit of others who might be struggling. I've made this post community wiki.
I'll use the following graph with six vertices as an example. One of its Hamiltonian paths is shown in bold.
Graph with six vertices and seven edges; one of its Hamiltonian paths shown in bold
Given an undirected graph with n vertices for which we want to find a Hamiltonian path, we construct a new weighted directed graph with n2 vertices, plus START and END vertices. Label the original vertices vi and the new vertices wik for 0 ≤ ik < n. If there is an edge between vi and vj in the original graph, then for 0 ≤ k < n−1 there are edges in the new graph from wik to wj(k+1) with weight −2j and from wjk to wi(k+1) with weight −2i. There are edges from START to wi0 with weight 2n − 2i − 1 and from wi(n−1) to END with weight 0.
It's easiest to think of this construction as being equivalent to starting with a score of 2n − 1 and then subtracting 2i each time you visit wij. (That's how I've drawn the graph below.)
Each path from START to END must visit exactly n + 2 vertices (one from each row, plus START and END), so the only way for the sum along the path to be zero is for it to visit each column exactly once.
So here's the original graph with six vertices converted to a new graph with 38 vertices. The original Hamiltonian path corresponds to the path drawn in bold. You can verify that the sum along the path is zero.
Same graph converted to shortest-weighted path format as described.
share|improve this answer
It's also not too hard to imagine using this technique to solve the travelling salesman problem -- In this example, start with 64 instead and have weights with small fractions that represent the original TSP graph weights while still having the power-of-two integer part values for enforcing visitation of every node. Making it a cycle can be brute forced by replicating the graph for each potential starting node. (There may be a nicer way.) – Kaganar Mar 13 '12 at 13:51
Thanks Gareth! I love your diagrams! (I think this at least answers why the question has resisted efforts to solve it...) – Peter de Rivaz Mar 13 '12 at 20:12
UPDATE: The OP now has had several rounds of clarifications, and it is a different problem now. I'll leave this here for documenting my ideas for the first version of the problem (or rather my understanding of it). I'll try a new answer for the current version of the problem. End of UPDATE
It's a pity that the OP hasn't clarified some of the open questions. I'll assume the following:
1. The weights are +/- 1.
2. n is the number of vertices
The first assumption is no loss of generality, obviously, but it has great impact on the value of n (via the second assumption). Without the first assumption, even a tiny (fixed) graph can have arbitrary long solutions by varying the weights without limits.
The algorithm I propose is quite simple, and similar to well-known graph algorithms. I'm no graph expert though, so I may use the wrong words in some places. Feel free to correct me.
1. For the source vertex, remember cost 0. Add (source, 0) to the todo list.
2. Pop an item from the todo list. Follow all outgoing edges of the vertex, computing the new cost c to reach the new vertex v. If the new cost is valid (c >= 0 and c <= n ^ 2, see below) and not remembered for v, add it to the remembered cost values of v, and add (v, c) to your todo list.
3. If the todo list is not empty, continue with step 2. (Or break early if the destination can be reached with cost 0).
It's clear that each "step" that's not an immediate dead end creates a new (vertex, cost) combination. There will be stored at most n * n ^2 = n ^ 3 of these combinations, and thus, in a certain sense, this algorithm is O(n^3).
Now, why does this find the optimal path? I don't have a real proof, but I think it the following ideas justify why I think this suffices, and it may be possible that they can be turned into a real proof.
I think it is clear that the only thing we have to show is that the condition c <= n ^ 2 is sufficient.
First, let's note that any (reachable) vertex can be reached with cost less than n.
Let (v, c) be part of an optimal path and c > n ^ 2. As c > n, there must be some cycle on the path before reaching (v, c), where the cost of the cycle is 0 < m1 < n, and there must be some cycle on the path after reaching (v, c), where the cost of the cycle is 0 > m2 > -n.
Furthermore, let v be reachable from the source with cost 0 <= c1 < n, by a path that touches the first cycle mentioned above, and let the destination be reachable from v with cost 0 <= c2 < n, by a path that touches the other cycle mentioned above.
Then we can construct paths from source to v with costs c1, c1 + m1, c1 + 2 * m1, ..., and paths from v to destination with costs c2, c2 + m2, c2 + 2 * m2, ... . Choose 0 <= a <= m2 and 0 <= b <= m1 such that c1 + c2 + a * m1 + b * m2 is minimal and thus the cost of an optimal path. On this optimal path, v would have the cost c1 + a * m1 < n ^ 2.
If the gcd of m1 and m2 is 1, then the cost will be 0. If the gcd is > 1, then it might be possible to choose other cycles such that the gcd becomes 1. If that is not possible, it's also not possible for the optimal solution, and there will be a positive cost for the optimal solution.
(Yes, I can see several problems with this attempt of a proof. It might be necessary to take the gcd of several positive or negative cycle costs etc. I would be very interested in a counterexample, though.)
Here's some (Python) code:
def f(vertices, edges, source, dest):
# vertices: unique hashable objects
# edges: mapping (u, v) -> cost; u, v in vertices, cost in {-1, 1}
#vertex_costs stores the possible costs for each vertex
vertex_costs = dict((v, set()) for v in vertices)
vertex_costs[source].add(0) # source can be reached with cost 0
#vertex_costs_from stores for each the possible costs for each vertex the previous vertex
vertex_costs_from = dict()
# vertex_gotos is a convenience structure mapping a vertex to all ends of outgoing edges and their cost
vertex_gotos = dict((v, []) for v in vertices)
for (u, v), c in edges.items():
vertex_gotos[u].append((v, c))
max_c = len(vertices) ** 2 # the crucial number: maximal cost that's possible for an optimal path
todo = [(source, 0)] # which vertices to look at
while todo:
u, c0 = todo.pop(0)
for v, c1 in vertex_gotos[u]:
c = c0 + c1
if 0 <= c <= max_c and c not in vertex_costs[v]:
vertex_costs[v].add(c)
vertex_costs_from[v, c] = u
todo.append((v, c))
if not vertex_costs[dest]: # destination not reachable
return None # or raise some Exception
cost = min(vertex_costs[dest])
path = [(dest, cost)] # build in reverse order
v, c = dest, cost
while (v, c) != (source, 0):
u = vertex_costs_from[v, c]
c -= edges[u, v]
v = u
path.append((v, c))
return path[::-1] # return the reversed path
And the output for some graphs (edges and their weight / path / cost at each point of the path; sorry, no nice images):
AB+ BC+ CD+ DA+ AX+ XY+ YH+ HI- IJ- JK- KL- LM- MH-
A B C D A X Y H I J K L M H
0 1 2 3 4 5 6 7 6 5 4 3 2 1
AB+ BC+ CD+ DE+ EF+ FG+ GA+ AX+ XY+ YH+ HI- IJ- JK- KL- LM- MH-
A B C D E F G A B C D E F G A B C D E F G A X Y H I J K L M H I J K L M H I J K L M H I J K L M H
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
AB+ BC+ CD+ DE+ EF+ FG+ GA+ AX+ XY+ YH+ HI- IJ- JK- KL- LM- MN- NH-
A X Y H
0 1 2 3
AB+ BC+ CD+ DE+ EF+ FG+ GA+ AX+ XY+ YH+ HI- IJ- JK- KL- LM- MN- NO- OP- PH-
A B C D E F G A B C D E F G A B C D E F G A B C D E F G A B C D E F G A B C D E F G A X Y H I J K L M N O P H I J K L M N O P H I J K L M N O P H I J K L M N O P H I J K L M N O P H
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0
Here's the code to produce that output:
def find_path(edges, source, path):
from itertools import chain
print(edges)
edges = dict(((u, v), 1 if c == "+" else -1) for u, v, c in edges.split())
vertices = set(chain(*edges))
path = f(vertices, edges, source, dest)
path_v, path_c = zip(*path)
print(" ".join("%2s" % v for v in path_v))
print(" ".join("%2d" % c for c in path_c))
source, dest = "AH"
edges = "AB+ BC+ CD+ DA+ AX+ XY+ YH+ HI- IJ- JK- KL- LM- MH-"
# uv+ means edge from u to v exists and has cost 1, uv- = cost -1
find_path(edges, source, path)
edges = "AB+ BC+ CD+ DE+ EF+ FG+ GA+ AX+ XY+ YH+ HI- IJ- JK- KL- LM- MH-"
find_path(edges, source, path)
edges = "AB+ BC+ CD+ DE+ EF+ FG+ GA+ AX+ XY+ YH+ HI- IJ- JK- KL- LM- MN- NH-"
find_path(edges, source, path)
edges = "AB+ BC+ CD+ DE+ EF+ FG+ GA+ AX+ XY+ YH+ HI- IJ- JK- KL- LM- MN- NO- OP- PH-"
find_path(edges, source, path)
share|improve this answer
Algorithm's complexity cannot be O(n^3), it is more likely O(n^5): imagine process of increasing cost for each node up to n^2 in a long cycle of cost 1. Proof for c <= n ^ 2 is not very convincing. Anyway, I like this answer. – Evgeny Kluev Mar 14 '12 at 15:45
@EvgenyKluev: There can't be more than n * n ^ 2 (vertex, cost) pairs, if cost is kept below n ^ 2. How can this result in O (n ^ 5)? Each step in a path belongs to exactly one of these pairs, and each of these pairs belongs to each (shortest) path at most once. You are right, the attempt of a proof is a layout of some ideas, nothing more. – WolframH Mar 14 '12 at 21:17
You have up to n^3 (vertex, cost) pairs, for each of them you call todo.append, then in while todo you iterate through all the edges (up to n times). Which gives n^4. (Not n^5 - that's my mistake). – Evgeny Kluev Mar 15 '12 at 7:15
@EvgenyKluev: You are right; I "cheated" in that respect. However, we now know that n is the number of edges; I think that helps. Unfortunately, I don't have time to do any more work on this :-( – WolframH Mar 15 '12 at 9:13
You can change it to c <= 2*n. Look at my answer below. – kilotaras Mar 18 '12 at 13:20
As Kaganar notes, we basically have to make some assumption in order to get a polytime algorithm. Let's assume that the edge lengths are in {-1, 1}. Given the graph, construct a weighted context-free grammar that recognizes valid paths from source to destination with weight equal to the number of excess 1 edges (it generalizes the grammar for balanced parentheses). Compute, for each nonterminal, the cost of the cheapest production by initializing everything to infinity or 1, depending on whether there is a production whose RHS has no nonterminal, and then relaxing n - 1 times, where n is the number of nonterminals.
share|improve this answer
(Why does this work? No nonterminal can produce with negative weight, so the minimum-weight production is not recursive and thus has height at most n - 1.) – rap music Mar 12 '12 at 21:58
I would use recursion brute forcing here: something like (pseudo code to make sure it's not language specific)
you will need:
• 2D array of bools showing where you CAN and where you CAN'T go, this should NOT include "forbidden values", like before negative edge, you can choose to add a vertical and horizontal 'translation' to make sure it starts at [0][0]
• an integer (static) containing the shortest path
• a 1D array of 2 slots, showing the goal. [0] = x, [1] = y
you will do:
function(int xPosition, int yPosition, int steps)
{
if(You are at target AND steps < Shortest Path)
Shortest Path = steps
if(This Position is NOT legal)
/*exit function*/
else
/*try to move in every legal DIRECTION, not caring whether the result is legal or not
but always adding 1 to steps, like using:*/
function(xPosition+1, yPosition, steps+1);
function(xPosition-1, yPosition, steps+1);
function(xPosition, yPosition+1, steps+1);
function(xPosition, yPosition-1, steps+1);
}
then just run it with function(StartingX, StartingY, 0);
the shortest path will be contained in the static external int
share|improve this answer
3
This is an exponential-time algorithm that does an enormous amount of work. Moreover, this only works in 2-D grids rather than arbitrary graphs. On top of this, it doesn't take the edge costs into account. – templatetypedef Mar 1 '12 at 2:15
I realize that, it never was meant to be a perfect solution, but more of a nudge in the direction. I'm just a student right now (read bio if you're curious) and I don't know any better way of doing something similar, the OP doesn't seem to know ANY way, so I though some way is better then none. If you know a better one please post it so both I and the OP can learn a better method. – SpaceToast Mar 1 '12 at 2:17
I need something like O(n^3). – anirudh Mar 1 '12 at 2:19
O(n^3) is very big! then again, my solution is O(n^x) x being amount of legal moves, please correct me if I'm mistaken – SpaceToast Mar 1 '12 at 2:20
It can be done in O(n^3). – anirudh Mar 1 '12 at 2:23
I would like to clarify a few points :
1. yes there can be negative weight cycles.
2. n is the number of edges.
3. weights are arbitrary not just +1/-1.
4. Assume that a O(n) length path exists if the problem has a solution. (n is number of edges)
share|improve this answer
1
weights are arbitrary not just +1/-1 Then there's no O(n^3) algorithm unless P = NP. – rap music Mar 14 '12 at 23:21
@anirudh those clarifications should be made in the question text - I will edit it – Zac Thompson Mar 15 '12 at 7:21
Is the path referred to in 4. an optimal path, or just some path? Anyway, 4 is an extreme change to the prerequisites; it excludes many graphs. – WolframH Mar 15 '12 at 9:10
Note that the problem has been updated again... – WolframH Mar 15 '12 at 22:23
Although people have shown that no fast solution exists (unless P=NP)..
I think for most graphs (95%+) you should be able to find a solution fairly quickly.
I take advantage of the fact that if there are cycles then there are usually many solutions and we only need to find one of them. There are probably some glaring holes in my ideas so please let me know.
Ideas:
1. find the negative cycle that is closest to the destination. denote the shortest distance between the cycle and destination as d(end,negC)
(I think this is possible, one way might be to use floyds to detect (i,j) with a negative cycle, and then breadth first search from the destination until you hit something that is connected to a negative cycle.)
2. find the closest positive cycle to the start node, denote the distance from the start as d(start,posC)
(I argue in 95% of graphs you can find these cycles easily)
Now we have cases:
a) there is both the positive and negative cycles were found:
The answer is d(end,negC).
b) no cycles were found:
simply use shortest path algorithm?
c) Only one of the cycles was found. We note in both these cases the problem is the same due to symmetry (e.g. if we swap the weights and start/end we get the same problem). I'll just consider the case that there was a positive cycle found.
find the shortest path from start to end without going around the positive cycle. (perhaps using modified breadth first search or something). If no such path exists (without going positive).. then .. it gets a bit tricky.. we have to do laps of the positive cycle (and perhaps some percentage of a lap).
If you just want an approximate answer, work out shortest path from positive cycle to end node which should usually be some negative number. Calculate number of laps required to overcome this negative answer + the distance from the entry point to the cycle to the exit point of the cycle. Now to do better perhaps there was another node in the cycle you should have exited the cycle from... To do this you would need to calculate the smallest negative distance of every node in the cycle to the end node.. and then it sort of turns into a group theory/ random number generator type problem... do as many laps of the cycle as you want till you get just above one of these numbers.
good luck and hopefully my solutions would work for most cases.
share|improve this answer
The current assumptions are:
1. yes there can be negative weight cycles.
2. n is the number of edges.
3. Assume that a O(n) length path exists if the problem has a solution.
4. +1/-1 edge weights.
We may assume without loss of generality that the number of vertices is at most n. Recursively walk the graph and remember the cost values for each vertex. Stop if the cost was already remembered for the vertex, or if the cost would be negative.
After O(n) steps, either the destination has not been reached and there is no solution. Otherwise, for each of the O(n) vertices we have remembered at most O(n) different cost values, and for each of these O(n ^ 2) combinations there might have been up to n unsuccessful attempts to walk to other vertices. All in all, it's O(n ^ 3). q.e.d.
Update: Of course, there is something fishy again. What does assumption 3 mean: an O(n) length path exists if the problem has a solution? Any solution has to detect that, because it also has to report if there is no solution. But it's impossible to detect that, because that's not a property of the individual graph the algorithm works on (it is asymptotic behaviour).
(It is also clear that not all graphs for which the destination can be reached have a solution path of length O(n): Take a chain of m edges of weight -1, and before that a simple cycle of m edges and total weight +1).
[I now realize that most of the Python code from my other answer (attempt for the first version of the problem) can be reused.]
share|improve this answer
Step 1: Note that your answer will be at most 2*n (if it exists).
Step 2: Create a new graph with vertexes that are a pairs of [vertex][cost]. (2*n^2 vertexes)
Step 3: Note that new graph will have all edges equal to one, and at most 2*n for each [vertex][cost] pair.
Step 4: Do a dfs over this graph, starting from [start][0]
Step 5: Find minimum k, such that [finish][k] is accesible.
Total complexity is at most O(n^2)*O(n) = O(n^3)
EDIT: Clarification on Step 1.
If there is a positive cycle, accesible from start, you can go all the way up to n. Now you can walk to any accesible vertex, over no more than n edges, each is either +1 or -1, leaving you with [0;2n] range. Otherwise you'll walk either through negative cycles, or no more than n +1, that aren't in negative cycle, leaving you with [0;n] range.
share|improve this answer
1) How do you get Step 1? We are only told that O(n) path exists (what ever that means). (Also, the OP hasn't clarified if that refers to an optimal path, or just any path.) 2) How does that differ from the algorithm in my answer from yesterday? – WolframH Mar 17 '12 at 22:10
Thanks for the clarification. OK, the minimal total weight will be at most 2*n. However, intermediate steps of the optimal solution might have much higher weight, so the graph of Step 2 does not necessarily allow for the optimal solution. – WolframH Mar 18 '12 at 19:34
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.874206 |
This site uses cookies. By continuing to browse the ConceptDraw site you are agreeing to our Use of Site Cookies.
Pyramid Diagram
A five level pyramid model of different types of Information Systems based on the information processing requirement of different levels in the organization.
five level pyramid example is included in the Pyramid Diagrams solution from Marketing area of ConceptDraw Solution Park.
Pyramid Diagram
A four level pyramid model of different types of Information Systems based on the different levels of hierarchy in an organization.
A five level pyramid model of different types of Information Systems based on the information processing requirement of different levels in the organization. The first level represents transaction processing systems to process basic data. The second level represents office support systems to process information in office. The third level represents management information systems to process information by managers. The fourth level represents decision support systems to process explicit knowledge. The fifth level represents executive information systems to process tacit knowledge.
"A Computer(-Based) Information System is essentially an IS using computer technology to carry out some or all of its planned tasks. The basic components of computer based information system are:
(1) Hardware - these are the devices like the monitor, processor, printer and keyboard, all of which work together to accept, process, show data and information.
(2) Software - are the programs that allow the hardware to process the data.
(3) Databases - are the gathering of associated files or tables containing related data.
(4) Networks - are a connecting system that allows diverse computers to distribute resources.
(5) Procedures - are the commands for combining the components above to process information and produce the preferred output.
The first four components (hardware, software, database and network) make up what is known as the information technology platform. Information technology workers could then use these components to create information systems that watch over safety measures, risk and the management of data. These actions are known as information technology services." [Information systems. Wikipedia]
This pyramid diagram was redesigned using the ConceptDraw PRO diagramming and vector drawing software from Wikimedia Commons file Five-Level-Pyramid-model.png. [commons.wikimedia.org/ wiki/ File:Five-Level-Pyramid-model.png]
This file is licensed under the Creative Commons Attribution 3.0 Unported license. [creativecommons.org/ licenses/ by/ 3.0/ deed.en]
The triangle chart example "Information systems types" is included in the Pyramid Diagrams solution from the Marketing area of ConceptDraw Solution Park.
Pyramid diagram
Pyramid diagram, pyramid, triangle,
How to Create Flowcharts for an Accounting Information System
Accounting information is a system of processes to represent financial and accounting data that is used by decision makers. To represent accounting processes there are special symbols which are used to create accounting flowcharts.
Flowcharts help users of Accounting Information System to understand the step sequences of accounting processes. Use ConceptDraw DIAGRAM with Accounting Flowcharts solution to document and communicate visually how accounting processes work, and how each operation is done.
Venn Diagram Examples for Problem Solving. Computer Science. Chomsky Hierarchy
A Venn diagram, sometimes referred to as a set diagram, is a diagramming style used to show all the possible logical relations between a finite amount of sets. In mathematical terms, a set is a collection of distinct objects gathered together into a group, which can then itself be termed as a single object. Venn diagrams represent these objects on a page as circles or ellipses, and their placement in relation to each other describes the relationships between them.
The Venn diagram example below visualizes the the class of language inclusions described by the Chomsky hierarchy.
hierarchy pyramid Pyramid Diagrams
hierarchy pyramid
Pyramid Diagrams solution extends ConceptDraw DIAGRAM software with templates, samples and library of vector stencils for drawing the marketing pyramid diagrams.
Pyramid Diagram
Triangle diagram example of DIKW pyramid has 4 levels: data, information, knowledge and wisdom.
Local area network (LAN). Computer and Network Examples
A local area network (LAN) is a devices network that connect with each other in the scope of a home, school, laboratory, or office. Usually, a LAN comprise computers and peripheral devices linked to a local domain server. All network appliances can use a shared printers or disk storage. A local area network serve for many hundreds of users. Typically, LAN includes many wires and cables that demand a previously designed network diagram. They are used by IT professionals to visually document the LANs physical structure and arrangement.
ConceptDraw - Perfect Network Diagramming Software with examples of LAN Diagrams. ConceptDraw Network Diagram is ideal for network engineers and network designers who need to draw Local Area Network diagrams.
How to Draw a Computer Network
How to Draw a Computer Network
Types of Flowcharts
A Flowchart is a graphically representation of the process, algorithm or the step-by-step solution of the problem. There are ten types of Flowcharts. Using the Flowcharts solution from the Diagrams area of ConceptDraw Solution Park you can easy and quickly design the Flowchart of any of these types.
How to Simplify Flow Charting
How to Simplify Flow Charting
Managing the task list
Four lessons explaining how to manage your task list in a Gantt chart. You will learn how to adjust your Gantt chart view, how to add/delete tasks or subtasks, how to change tasks hierarchy, how to show/hide subtasks.
Organizational Structure Types
There are three main types of organizational structures which can be adopted by organizations depending on their objectives: functional structure, divisional structure, matrix structure.
ConceptDraw DIAGRAM diagramming and vector drawing software enhanced with 25 Typical Orgcharts solution from the Management area of ConceptDraw Solution Park is ideal for designing diagrams and charts of any organizational structure types.
Cross Functional Flowchart for Business Process Mapping
Start your business process mapping with conceptDraw DIAGRAM and its Arrows10 Technology. Creating a process map, also called a flowchart, is a major component of Six Sigma process management and improvement. Use Cross-Functional Flowchart drawing software for business process mapping (BPM).
Use a variety of drawing tools, smart connectors and shape libraries to create flowcharts of complex processes, procedures and information exchange. Define and document basic work and data flows, financial, production and quality management processes to increase efficiency of you business.
Fishbone Diagram Example
Fishbone Diagram, also referred as Cause and Effect diagram or Ishikawa diagram, is a fault finding and problem solving tool. Construction of Ishikawa diagrams is quite complicated process and has a number of features.
Fishbone Diagrams solution included to ConceptDraw Solution Park contains powerful drawing tools and a lot of examples, samples and templates. Each Fishbone diagram example is carefully thought-out by experts and is perfect source of inspiration for you.
Organizational Charts with ConceptDraw DIAGRAM
With ConceptDraw DIAGRAM, you can quickly and easily create any type of orgchart professional. ConceptDraw DIAGRAM includes numerous organizational chart templates for the simple to complex multi-page charts.
Process Flowchart
ConceptDraw is Professional business process mapping software for making process flow diagram, workflow diagram, general flowcharts and technical illustrations for business documents. It is includes rich examples, templates, process flowchart symbols. ConceptDraw flowchart maker allows you to easier create a process flowchart. Use a variety of drawing tools, smart connectors, flowchart symbols and shape libraries to create flowcharts of complex processes, process flow diagrams, procedures and information exchange.
How To Create a Process Flow Chart (business process modelling techniques)
How To Create a Process Flow Chart (business process modelling techniques)
Pyramid Diagram
Zooko's triangle is known to be a trilemma which is a concept in international economics which states that it is impossible to have a fixed foreign exchange rate, a free capital movement and an independent monetary policy at the same time.
Organizational Chart
Use the advantages of hierarchical tree structure of mind map while developing the organizational structure of your organization. Create an Organizational Chart from your map. Double click the icon to create an Organizational Chart.
The diagram is created automatically from the active page of your map by ConceptDraw DIAGRAM and will be opened in Slideshow mode.
Internet solutions with ConceptDraw DIAGRAM
ConceptDraw is a good means of visualization of information of any kind as it features powerful graphic capabilities. The conception of using ConceptDraw and open formats by the programs that work with Internet can be used for displaying any data and any structure in Internet.
ERD Symbols and Meanings
Crow's foot notation is used in Barker's Notation, Structured Systems Analysis and Design Method (SSADM) and information engineering. Crow's foot diagrams represent entities as boxes, and relationships as lines between the boxes. Different shapes at the ends of these lines represent the cardinality of the relationship.
The Chen's ERD notation is still used and is considered to present a more detailed way of representing entities and relationships.
To create an ERD, software engineers mainly turn to dedicated drawing software, which contain the full notation resources for their specific database design - ERD symbols and meanings. CS Odessa has released an all-inclusive Entity-Relationship Diagram (ERD) solution for their powerful drawing program, ConceptDraw DIAGRAM.
How to Build an Entity Relationship Diagram (ERD)
How to Build an Entity Relationship Diagram (ERD)
HelpDesk
How to Draw a Pyramid Diagram
Pyramid diagram (triangle diagram) is used to represent data, which have hierarchy and basics. Due to the triangular form of a diagram, each pyramid section has a different width. The width of the segment shows the level of its hierarchy. Typically, the top of the pyramid is the data that are more important than the base data. A pyramid scheme can be used to show proportional and hierarchical relationships between some logically related items, such as departments within an organization, or successive elements of any process. This type of diagram is often used in marketing to display hierarchically related data, but it can be used in a variety of situations. ConceptDraw DIAGRAM allows you to make a pyramid diagram, quickly and easily using special libraries.
|
__label__pos
| 0.634247 |
Custom Fields - Documentation topics on: content,cookbook,custom content fields,fields,integration,.
Custom Fields
Custom fields allow developers to create unique and domain specific form controls and interactions that can be used by content editors. These fields then store the resulting values in dotCMS on the content object for use when the content is accessed or rendered. Custom fields are simple to write, made up of HTML, Velocity, Javascript, and can add powerful interaction to your content editing screens.
Simple Custom Field Example
Below is a simple example of a custom field. To use it, you need to add a Custom Field to a content object and name this field "Test". Place the code below in the "value" textbox for the custom field. (Pro Tip: Make your custom fields a .vtl file and then put a in the value textbox of the custom field. This allows you to edit the custom field via webdav and it is versionable, etc..) Because custom fields are just HTML/JS/Velocity, you have access to all the velocity tools provided by dotCMS, including custom ones that you can provide.
## This example uses a custom field that is called "test" and has the variable name "test"
## first we get the content (we have access to all our
## velocity tools, including any custom ones that have been written
#set($content = $dotcontent.find($request.getParameter("inode")))
## then we write some ugly js to get and set the values on the edit content form -
## the dom.id of the hidden field that stores the value is just the velocity variable name
## so watch out for js variable scope issues
<script>
function myButtonClick(){
var x = document.getElementById('test').value;
if(x==undefined || x.length==0){
x=0;
}
else{
x=parseInt(x)+1;
}
document.getElementById('test').value=x;
document.getElementById('customValue').innerHTML=x;
}
</script>
## then we write out our user controls, displaying the value stored in the content object by default
## with a button (dojo styled) that calls our js
Custom Value: <span id="customValue">$!content.test</span>
<button dojoType="dijit.form.Button" id="myButton" onclick="myButtonClick">Click me!</button>
Google Maps Example
The demo site of dotCMS offers a few demonstrations of how custom fields can be leveraged. For example, if you edit a "News" content item from the demo site's admin screen, you can see a button control that pops up a Google Maps window. This widget allows you to select a geographic location for your news content. The location you select sets the latitude and longitude, which is stored in the "News" content object and makes the news geo-locatable.
YouTube Widget Example
Another example on the demo site is the Youtube Widget. This content type allows users to search Google's YouTube library and select a video. The custom field stores the YouTube ID and then populates the rest of the contents fields with the video's metadata (from Google).
Other Examples
For more examples of custom fields, see our codeshare site:
http://dotcms.com/codeshare/?codeSearch=custom+field
|
__label__pos
| 0.632119 |
common-lisp ASDF - Another System Definition Facility Simple ASDF system with a flat directory structure
Example
Consider this simple project with a flat directory structure:
example
|-- example.asd
|-- functions.lisp
|-- main.lisp
|-- packages.lisp
`-- tools.lisp
The example.asd file is really just another Lisp file with little more than an ASDF-specific function call. Assuming your project depends on the drakma and clsql systems, its contents can be something like this:
(asdf:defsystem :example
:description "a simple example project"
:version "1.0"
:author "TheAuthor"
:depends-on (:clsql
:drakma)
:components ((:file "packages")
(:file "tools" :depends-on ("packages"))
(:file "functions" :depends-on ("packages"))
(:file "main" :depends-on ("packages"
"functions"))))
When you load this Lisp file, you tell ASDF about your :example system, but you're not loading the system itself yet. That is done either by (asdf:require-system :example) or (ql:quickload :example).
And when you load the system, ASDF will:
1. Load the dependencies - in this case the ASDF systems clsql and drakma
2. Compile and load the components of your system, i.e. the Lisp files, based on the given dependencies
1. packages first (no dependencies)
2. functions after packages (as it only depends on packages), but before main (which depends on it)
3. main after functions (as it depends on packages and functions)
4. tools anytime after packages
Keep in mind:
• Enter the dependencies as they are needed (e.g. macro definitions are needed before usage). If you don't, ASDF will error when loading your system.
• All files listed end on .lisp but this postfix should be dropped in the asdf script
• If your system is named the same as its .asd file, and you move (or symlink) its folder into quicklisp/local-projects/ folder, you can then load the project using (ql:quickload "example").
• Libraries your system depends on have to be known to either ASDF (via the ASDF:*CENTRAL-REGISTRY variable) or Quicklisp (either via the QUICKLISP-CLIENT:*LOCAL-PROJECT-DIRECTORIES* variable or available in any of its dists)
|
__label__pos
| 0.985824 |
Results for: Value-system-1
In Science
What is the value of Pi on a duodecimal system?
The first 101 digits are 3.18480 9493B 91866 4573A 6211B B1515 51A05 72929 0A780 9A492 74214 0A60A 55256 A0661 A0375 3A3AA 54805 64688 0181A 36830. It is, of course still (MORE)
What is value of 1 Dubai dihram?
the exchange rate would come into play? It also depends which currency you want the answer in? 1 UAE Dihram currently equals around 15.5 pence sterling @ an exchange rate of (MORE)
What is Indian Value System?
Irrespective of the cultural or social diversity, a common value system is one of the binding ingredients that give Indians a common identity.. Traditionally, Indians have la (MORE)
Solve the following system of equations What is the value of y when x - 3y equals 11 4x 3y equals -1?
x - 3y = 11 So x = 11 + 3y Then, by the other equation, 4x + 3y = -1 becaomes 4(11+3y) + 3y = -1 or 44 + 12y + 3y = -1 or 15y = -45 so that y = -3
Thanks for the feedback!
What is the answer to 20c plus 5 equals 5c plus 65?
20c + 5 = 5c + 65 Divide through by 5: 4c + 1 = c + 13 Subtract c from both sides: 3c + 1 = 13 Subtract 1 from both sides: 3c = 12 Divide both sides by 3: c = 4
Thanks for the feedback!
In Science
What are value systems?
A value system is a set of consistent ethical values (more specifically the personal and cultural values) and measures used for the purpose of ethical or ideological integ (MORE)
|
__label__pos
| 0.999982 |
1
\$\begingroup\$
First off, this is a Uni assignment, but the lecturer is stumped too.
With the shader active, I get nothing, just black. With the shader disabled (fixed function pipeline) I get a rainbow pattern which is not the texture. Uncommenting the code block labeled with the comment //this does the texturing correctly but can't be used by the shader does as the comment states. My friends and I believe that I'm not loading the texture into OpenGL correctly, what am I doing wrong?
Here is the fragment shader:
const float lightWeighting = 0.75;
const float textureWeighting = 0.25;
const float PI = 3.14;
const float lightIntensity = 1.0;
const float constFudge = 0.025;
const float linearFudge = 0.025;
const float quadraticFudge = 0.05;
float rend = 250.0;
float rstart = 50.0;
uniform float Intensity;
uniform sampler2D grabTexture;
//varying sampler2D HeatValues
varying vec3 Normal;
varying vec3 Vertex;
varying vec2 texCoord;
void main(void)
{
vec3 pigPos = Vertex;
vec3 normPigPos = normalize(pigPos);
vec3 lightPos = vec3(gl_LightSource[0].position.xyz);
vec3 normLightPos = normalize(lightPos);
float effectiveIntesity;
vec3 normNormal = normalize(vec3(Normal.xyz));
vec3 t = vec3(pigPos - lightPos);
float distToLight = length(t);
float d = dot(normNormal.xyz, normLightPos.xyz);
if(d > 0.0)//facing the light
{
float falloff;
if( distToLight < rstart )
falloff = 1.0;
else
if( distToLight > rend )
falloff = 0.0;
else
{
falloff = rend-distToLight / rend-rstart;
}
effectiveIntesity = d*lightIntensity * falloff;
effectiveIntesity = d*lightIntensity * (1.0/(constFudge + (linearFudge*distToLight) +(quadraticFudge*distToLight*distToLight)));
}
else
{
effectiveIntesity = 0.0;
}
//TODO: change the colour of the pixel
vec4 lightingColour = vec4(vec4( 1.0 ) * effectiveIntesity); //TODO: improve
//gl_FragColor = lightingColour;
//texturing stuff
//http://www.opengl-tutorial.org/beginners-tutorials/tutorial-5-a-textured-cube/
vec4 textureColour = vec4(texture2D(grabTexture, texCoord.xy)); // TODO: why is this blank?
vec4 col = vec4(textureColour.rgb, 1.0);
col.r *= 1.0;
col.g *= 1.0;
gl_FragColor = (col);
//gl_FragColor = (lightingColour * lightWeighting) + (textureColour.rgb * textureWeighting);
//simple check to make sure that shader compiles
vec3 lP = vec3(abs(gl_LightSource[0].position.x/100), abs(gl_LightSource[0].position.y/100), abs(gl_LightSource[0].position.z/100));
vec4 r = vec4( lP.x, lP.y, lP.z, 1.0 );
gl_FragColor = r;
gl_FragColor = (lightingColour * lightWeighting) + (r * textureWeighting);
}
Here is what I do to load textures:
GLuint tex;
glGenTextures(1, &tex);
glBindTexture(GL_TEXTURE_2D, tex);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);
float color[] = { 1.0f, 1.0f, 1.0f, 1.0f };
glTexParameterfv(GL_TEXTURE_2D, GL_TEXTURE_BORDER_COLOR, color);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);
glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, x, y, 0, GL_RGB, GL_UNSIGNED_BYTE, rawLoadedTexture);
glBindTexture(GL_TEXTURE_2D, tex);
Using the texture:
glEnable(GL_TEXTURE_2D);
//this does the texturing correctly but can't be used by the shader
/*glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);
glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);
glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);
glTexEnvf(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_DECAL);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, 4, 4, 0, GL_RGBA, GL_UNSIGNED_BYTE, rawLoadedTexture);*/
glActiveTexture(pigObj.id_texture); //the shader can use this texture
glBindTexture(GL_TEXTURE_2D, pigObj.id_texture);
cShader *pList = graphics.ShaderInfo.getList();
glUseProgram( pList[1].program()); //shader on: no pig // fixed, was vertex shader being empty, replaced it with intensity.vert
//shader off: ambient light only (tiny amount of diffuse or an illusion?)
extern NA_MathsLib na_maths;
float intensity = (float) na_maths.dice(100);
glUniform1i(pList[1].get_grabLoc(), pigObj.id_texture);
glUniform1f(pList[1].intensity(), intensity);
//glUniform1f(pList[1].get_heatValues(), heatValuesPsudoTexture);
//glutSolidSphere(2, 15, 2);
pigObj.render();
glDisable(GL_TEXTURE_2D);
glUseProgram(0); //disable pig heatlamp shader
\$\endgroup\$
5
• 2
\$\begingroup\$ please ask one question per question you submit to the site. \$\endgroup\$
– Almo
Jul 15, 2017 at 14:37
• 1
\$\begingroup\$ Also, please include the code in your question rather than linking to it. The link will eventually be stale and future users won't understand the question. \$\endgroup\$ Jul 15, 2017 at 15:27
• \$\begingroup\$ Fixed both issues \$\endgroup\$
– Lupus590
Jul 15, 2017 at 16:16
• \$\begingroup\$ fixed the above \$\endgroup\$
– Lupus590
Jul 15, 2017 at 19:08
• \$\begingroup\$ You shouldn't add any kind of "Solved" marks to the title. The site already has a way to indicate that a question has an accepted answer. \$\endgroup\$ Jul 15, 2017 at 21:13
1 Answer 1
1
\$\begingroup\$
Your problem is here:
glActiveTexture(pigObj.id_texture); //the shader can use this texture
glActiveTexture() takes a value of GL_TEXTURE*, not the ID of your texture. It's the texture unit in which your texture is going to be bound (or is already bound). So for texture unit 0, you'd do:
glActiveTexture(GL_TEXTURE0);
You then need to also pass the texture unit index as the uniform for the sampler, rather than your texture ID.
This is by far one of the most confusing aspects of texturing in OpenGL! And because all OpenGL constants are #defines instead of proper named types, it's really hard to have the compiler catch this type of error. See the docs for glActiveTexture() for more info.
\$\endgroup\$
3
• \$\begingroup\$ Thank you, I also had to uncomment the block (erroniously) labelled //this does the texturing correctly but can't be used by the shader. \$\endgroup\$
– Lupus590
Jul 15, 2017 at 19:43
• \$\begingroup\$ Can you explain, when you say, "it's the texture unit in which your texture is going to be bound", do you mean literally the GLSL texture unit retrieved from the fragment shader? If so, are you implying that GL_TEXTURE0 somehow is aware of the first texture unit specified in shader program, and that GL_TEXTURE1 will somehow be the second? \$\endgroup\$
– netpoetica
Oct 24, 2019 at 2:10
• \$\begingroup\$ There are several things at play here. When you call glBindTexture(), OpenGL uses the active texture unit as the one that you'll bind to. It uses the target of that texture unit that you passed in to glBindTexture() In your shader you'll have some uniform, usually, like uniform sampler2D myTexture. In your CPU code, you need to set the shader's myTexture uniform by calling glUniform1i(myTextureLocation, 0) for example. The 0 is GL_TEXTURE0, the 1st texture unit. \$\endgroup\$ Oct 24, 2019 at 2:17
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
__label__pos
| 0.796276 |
siskat siskat - 1 month ago 19
C++ Question
list::back() causes stack overflow
My application compiles without any error/warning. At runntime I'm getting a strange stack overflow when calling the list::back() function (@std::_Iterator_base12::_Orphan_me() Line 193).
class Stock
{
public:
bool falling = false;
list<int> peaks;
list<int> bottoms;
void ProcessOption(int value)
{
if (falling)
{
if (bottoms.empty()) {
bottoms.push_back(value);
return;
}
int& lastValue = bottoms.back(); //<- Error
if (value < lastValue) {
bottoms.pop_back();
bottoms.push_back(value);
}
else if (value > lastValue) {
falling = false;
ProcessOption(value);
}
}
else
{
if (peaks.empty()) {
peaks.push_back(value);
return;
}
int& lastValue = peaks.back(); //<- Error
if (value > lastValue) {
peaks.pop_back();
peaks.push_back(value);
}
else if (value < lastValue) {
falling = true;
ProcessOption(value);
}
}
}
};
The debugger confirms that both lists including one (valid) element when calling the function. I've tested it with up-to-date MSVC++ 2013 and 2015 compiler.
NPE NPE
Answer
The exact line where you get the error is not the root cause. The underlying issue is that ProcessOption() keeps calling itself until you run out of stack space.
To confirm this, use your debugger to examine the call stack at the point of the crash.
|
__label__pos
| 0.994861 |
Lost in scopes
Welcome Forums Pester Lost in scopes
This topic contains 5 replies, has 4 voices, and was last updated by
Participant
9 months, 4 weeks ago.
• Author
Posts
• #105454
Participant
Topics: 10
Replies: 16
Points: 1
Rank: Member
testmodule.psm1
function Invoke-Public ($param)
{
Invoke-Private -param $param
}
function Invoke-Private ($param)
{
try
{
$Res = Resolve-DnsName -Name $param -DnsOnly -ErrorAction Stop
return $Res
}
catch
{
return $_
}
}
Export-ModuleMember -Function Invoke-Public
testmodule.Tests.ps1
Import-Module testmodule
InModuleScope testmodule {
$FQDN = "fqdn.domain.com"
$Netbios = "hostname"
Mock Resolve-DnsName {
if ($Name -eq $FQDN)
{
return "true Name $Name. FQDN - $FQDN"
}
elseif ($Name -eq $Netbios)
{
return "false Name $Name. Netbios - $Netbios"
}
else
{
return "3rd Name $Name. FQDN - $FQDN. Netbios - $Netbios"
}
}
Describe 'Private function test' {
It 'Passes Invoke-Private with ' -TestCases @(
@{Value = $FQDN; Expected = "true Name $FQDN. FQDN - $FQDN"}
@{Value = $Netbios; Expected = "false Name $Netbios. Netbios - $Netbios"}
) {
param ($Value, $Expected)
Invoke-Private -param $Value | Should -Be $Expected
}
}
}
Describe 'Public function test' {
$FQDN = "fqdn.domain.com"
It 'Passes Invoke-Public' {
Invoke-Public -param $FQDN | Should -Be "true Name $FQDN. FQDN - $FQDN"
}
}
tests result:
Executing Test
Executing all tests in '..\test'
Executing script C:\Temp\test\testmodule.Tests.ps1
Describing Private function test
[+] Passes Invoke-Private with 'fqdn.domain.com' 4.04s
[+] Passes Invoke-Private with 'hostname' 284ms
Describing Public function test
[-] Passes Invoke-Public 1.21s
Expected strings to be the same, but they were different.
Expected length: 49
Actual length: 45
Strings differ at index 0.
Expected: 'true Name fqdn.domain.com. FQDN – fqdn.domain.com'
But was: '3rd Name fqdn.domain.com. FQDN – . Netbios – '
———–^
32: Invoke-Public -param $FQDN | Should -Be "true Name $FQDN. FQDN – $FQDN"
at , C:\Temp\test\testmodule.Tests.ps1: line 32
Tests completed in 5.54s
Tests Passed: 2, Failed: 1, Skipped: 0, Pending: 0, Inconclusive: 0
Why the $FQDN and $Netbios variables are not available for mocked Resolve-DnsName function? How should I make them available, or what would be the recommended way to test in this scenario?
• #105467
Keymaster
Topics: 13
Replies: 4872
Points: 1,842
Helping HandTeam Member
Rank: Community Hero
(Apologies for the spurious incorrect forum post you may have received; that was a bot that didn't catch the right keywords)
Gimme a sec to try this on my own!
• #105470
Keymaster
Topics: 13
Replies: 4872
Points: 1,842
Helping HandTeam Member
Rank: Community Hero
Yeah, so the problem is just that you've passed out of scope for the mock. Mocks are really designed to mock a function that is being run in a test; they're not designed to mock functions that exist elsewhere in a module. The module's "local" definition of the function or command "wins," because it's more local. Because you're calling a function, which is calling a function, the mock gets "lost," if you will.
Struggling to explain, but maybe think of it this way: you've seen that you can go "one level" deep with Invoke-Private. What you can't do is go "deeper." Does that make sense?
• #105629
Participant
Topics: 10
Replies: 16
Points: 1
Rank: Member
I am not sure I understand, to me it seems that the mock is working, it returns the mocked string just with empty variables. My observation is that the variables defined InModuleScope are available when calling mocked function in that same scope, but they are not available when calling in public scope (from within a public function).
Now I'm on my phone and can't double check, but I think I was getting the expected result if I just used strings in if checks in mocked function, instead of using $fqdn and $netbios variables.
• #105754
Participant
Topics: 0
Replies: 1
Points: -19
Rank: Member
Your observation is correct. The public function will not have access to those variables because it it outside the scope of where the mock is defined. If you move the public function test into that scope(InModuleScope testmodule) then the mocked outputs will be available to your public function.
• #112183
Participant
Topics: 0
Replies: 28
Points: -8
Rank: Member
I am getting a different result than you do. The last Describe is placed outside of the InModuleScope, correct?
Because in that case the Mock should not apply to the last describe, and that is what I am seeing. The real Resolve-DnsName is called.
— In general about the scopes, mock is designed to mock stuff in different scopes, not just the one in the test. So what you are doing is correct. You are reaching into the TestModule scope, and shadowing Resolve-DnsName there. That means that any call to Resolve-DnsName within that scope will call the mock an not the real function. Even if you call Invoke-Public, it will reach into the TestModule module scope, and invoke Invoke-Private there. Inside it invokes Resolve-DnsName which is the mock.
What would not work, and what people sometimes find confusing, is that we cannot overwrite the function directly – that is inject mock to the DnsClient module from which the Resolve-DnsName originates, because your module already got link to the functions from that module, and shadowing the functions in that module does not overwrite the link. So you are correctly mocking it in the scope of your mock, not in the scope of DnsClient.
The topic ‘Lost in scopes’ is closed to new replies.
|
__label__pos
| 0.53326 |
Swift: Apple's Swift Language and Its Impact on iOS Development
Swift: Apple's Swift Language and Its Impact on iOS Development
Play this article
Introduction
In 2014, Apple introduced Swift, a new programming language for iOS, macOS, watchOS, and tvOS development. Swift was designed to be powerful, efficient, and modern, replacing Apple's older programming language, Objective-C. Since its release, Swift has gained significant popularity among developers worldwide and has had a transformative impact on iOS development. In this blog post, we'll explore the key features of Swift and delve into its impact on iOS development.
1. Modern and Intuitive Syntax
One of the main reasons for Swift's widespread adoption is its modern and intuitive syntax. Swift was designed to be easy to read and write, making it more accessible to developers, including those who are new to iOS development. The syntax of Swift resembles more natural English language, with a simplified and streamlined structure. This reduces the likelihood of errors and improves code readability, making it easier to maintain and collaborate on projects.
2. Safety and Performance
Swift was built with a strong emphasis on safety and performance. It introduced numerous features to prevent common programming errors and eliminate entire categories of bugs that were prevalent in Objective-C. Optionals, for example, provide a safe way to handle nil values, reducing crashes caused by null pointer exceptions. Additionally, Swift's type system enforces strict type checking, leading to fewer runtime errors and improved code reliability.
In terms of performance, Swift was designed to be fast and efficient. It incorporates modern compiler optimization techniques and features such as automatic memory management, reducing the burden on developers and making their code run more efficiently.
3. Interoperability with Objective-C
Apple recognized the importance of supporting existing Objective-C codebases when introducing Swift. Swift can seamlessly interoperate with Objective-C, allowing developers to use both languages within the same project. This feature enabled a smooth transition for developers, enabling them to adopt Swift gradually without the need for a complete rewrite of their existing codebases. It also opened up a vast ecosystem of existing libraries and frameworks written in Objective-C that can be easily utilized in Swift projects.
4. Swift Package Manager
Swift Package Manager (SPM) is a powerful tool that simplifies dependency management in Swift projects. It provides a unified approach for managing and distributing Swift libraries and dependencies. SPM eliminates the need for third-party tools and streamlines the integration of external libraries into projects. It has greatly improved the development workflow, making it easier to share and reuse code across different projects.
5. Playgrounds for Interactive Development
Swift Playgrounds is an interactive development environment that allows developers to experiment with Swift code and see the results in real-time. It provides a sandbox environment where developers can quickly prototype, test algorithms, and visualize their code. Playgrounds are particularly useful for learning Swift and exploring new concepts without the need for setting up a full project.
6. Open Source and Community Support
In 2015, Apple made Swift an open-source language, inviting developers from around the world to contribute to its development. The open-source nature of Swift has led to a vibrant community that actively contributes to its growth. This has resulted in the creation of numerous open-source libraries, frameworks, and tools that extend Swift's capabilities and provide additional functionality. The community support for Swift has been instrumental in its rapid evolution and widespread adoption.
Conclusion
Swift has emerged as a game-changer for iOS development since its introduction. With its modern syntax, safety features, performance optimizations, and interoperability with Objective-C, Swift has significantly improved the development experience for iOS app developers. The introduction of Swift Package Manager and Swift Playgrounds has further enhanced the development workflow, making it more efficient and productive. As an open-source language with a thriving community, Swift's future looks promising, with continuous advancements and innovations in iOS development on the horizon
Did you find this article valuable?
Support Techlearnindia by becoming a sponsor. Any amount is appreciated!
|
__label__pos
| 0.996557 |
ALERT
Cisco CloudCenter: Get the Hybrid IT Advantage
Moniker
Definition - What does Moniker mean?
A moniker is a nickname, pseudonym, cognomen or name. In computing, a moniker is an object linking method derived from Microsoft's technology for Object Linking and Embedding (OLE). It refers to an object or component in Microsoft's Component Object Model (COM) that is used to identify another object instance.
A moniker is also known as an intelligent name because it retains key linked object data.
Techopedia explains Moniker
In Microsoft COM, a moniker is an object that provides a pointer to the object it identifies. A moniker client uses a moniker to obtain pointers to objects. A moniker provider provides pointers to its object to moniker clients.
Several types of monikers are implemented in OLE, including file monikers, item monikers and composite monikers. Monikers may be used to start up or connect to objects on the same computer or over a network. Monikers are often used to create network connections.
Share this:
|
__label__pos
| 0.998643 |
Contact Us!
Please get in touch with us if you:
1. Have any suggestions
2. Have any questions
3. Have found an error/bug
4. Anything else ...
To contact us, please .
GCD of 78 and 112
You have reached us maybe looking for answers to the questions like: GCD of 78 and 112 or what is the highest common factor (HCF) of 78 and 112?
What is the GCF of 78 and 112?
The first step to find the gcf of 78 and 112 is to list the factors of each number. The factors of 78 are 1, 2, 3, 6, 13, 26, 39 and 78. The factors of 112 are 1, 2, 4, 7, 8, 14, 16, 28, 56 and 112. So, the Greatest Common Factor for these numbers is 2 because it divides all them without a remainder. Read more about Common Factors below.
To use the GCD / GCF / HCF Calculator below just enter a set of numbers separated by commas (,).
GCF Calculator
Enter values separeted by commas:
Ex.: 2,4,8; 3,6 etc.
Short Answer:
Result here
Detailed Answer:
Greatest Common Divisor explained here
How to find the Greatest Common Factor
GCF example:
The first step is to find all divisors of each number. For instance, let us find the gcf(78, 112).
In this case we have:
• The factors of 78 (all the whole numbers that can divide the number without a remainder) are 1, 2, 3, 6, 13, 26, 39 and 78;
• The factors of 112 are 1, 2, 4, 7, 8, 14, 16, 28, 56 and 112.
The second step is to analyze which are the common divisors. It is not difficult to see that the 'Greatest Common Factor' or 'Divisor' for 78 and 112 is 2. The GCF is the largest common positive integer that divides all the numbers (78, 112) without a remainder.
The GCF is also known as:
• Greatest common divisor (gcd);
• Highest common factor (hcf);
• Greatest common measure (gcm), or
• Highest common divisor
To learn more about GCF/GCD, watch this video from Khan Academy or/and read this arcticle.
Greatest Common Factor Calculator
Greatest Common Factor Calculator
Please link to this page! Just right click on the above image, choose copy link address, then past it in your HTML.
Disclaimer
While every effort is made to ensure the accuracy of the information provided on this website, we offer no warranties in relation to these informations.
|
__label__pos
| 0.9748 |
Why Not Charge By The Byte?
Once you’ve aced these aspects, you may then analysis the other SEO tactics and methods. I get it. Like, sure, there are just balls of JavaScript you can download on the internet and have a dynamic graphics editor. 3. Add a listing of all search term requests which have been rejected. What’s a search engine? The idea is to begin with the Chinese language search engine Baidu. The search engine algorithms don’t know your content material strategy. To bring more key phrases to the highest (for larger visibility and to reach all subsets of your audience), you want to deal with every area of your web site and incorporate extra than just content material creation and keyword research into your advertising strategy. First, Google seems on the wording of hyperlinks in content to find out what key phrases are related to the hyperlink getting used. Hyperlink bait is content that is so useful, high quality, or powerful that people are compelled to share it naturally. You would write a thousand articles however if they don’t get hyperlinks (exterior in addition to internal), not many people will discover them, making all of the writing you’ve carried out a waste of time.
Online, links are the infrastructure that individuals depend on to achieve you. Linkable assets are pieces of content material meant to draw links. Finally, you want to restrict the number of hyperlinks that you simply include in a single piece of content material. Once you start constructing links to your site, you’re going to see the power of the compound impact. See that spike? It means that it all of the sudden took Google Quite a bit longer to download every little thing. To see the bigger picture, please find beneath the positions of the highest 10 programming languages of many years again. In the screenshot beneath, you possibly can see that it clearly reveals the web sites that are linking to all the sites that compete carefully with me. In October, Google announced that it may now index not solely pages but additionally passages within the page. Software program high quality providers supplier Tiobe believes Python might surpass C at any time, which would make it solely the third language ever to guide the index in its more than 20 years of existence. The index can be utilized to examine whether or not your programming skills are nonetheless updated or to make a strategic choice about what programming language ought to be adopted when beginning to construct a new software system.
Java, ranked third this month, additionally has led the index. The scores are based on the number of skilled engineers world-large, programs and third party vendors. Wikipedia, Amazon, YouTube and Baidu are used to calculate the rankings. If you take the sum then the rankings will rise 10%. So taking the sum will likely be an incentive for some to give you all kinds of obscure terms for a language. They use the tactic once, get mediocre results, after which create their case study. What this examine found is that the typical click on-through price for a search result in the primary position (at the very top of the primary web page of search outcomes) on Google is 28.5%. More importantly, it found that while you go beyond the first place, this quantity tends to drop dramatically. In that very same month, Java had to give up its first place to C. Later on, in 2021, Python grew to become unstoppable and surpassed Java as properly. From that second on, SQL is part of the TIOBE index. The definition of the TIOBE index will be discovered here.
It doesn’t matter what, mini sites can still be skillfully employed in your corporation. In April 2020, Java was still no 1 on the TIOBE index. Python is inching its method to the highest spot within the monthly Tiobe index of language recognition, ending just 0.16 share factors behind the leader, the C language, in the September edition of the index. Let’s look at every one of these Google Analytics Conversions information factors in more element. YouTube co-founder Jawed Karim uploaded the video service’s very first video on April 23, 2005. The video on the San Diego Zoo has since been watched greater than 10 million times. It first climbed to the quantity two spot final November. Python has held second place for 2 months running. Python already leads the Pypl Popularity of Programming Language index, which analyzes how typically language tutorials are searched in Google. The programming language SQL has not been within the TIOBE index for a long time. It is vital to notice that the TIOBE index shouldn’t be about the perfect programming language or the language wherein most lines of code have been written. You probably have a huge variety of web pages, Google might need bother determining that are the most important pages to index.
|
__label__pos
| 0.52094 |
Misra’s blog
What is 2-phase commit?
Posted by mtwinkle on July 11, 2007
A commit operation is an all-or-nothing affair. If a transaction cannot be completed, the rollback must restore the system to the pre-transaction state.
In order to ensure that a transaction can be rolled back, a software system typically logs each operation, including the commit operation itself. A recovery manager uses the log records to undo (and possibly redo) a partially completed transaction.
When a transaction involves multiple distributed resources, for example, a database server on two different network hosts, the commit process is somewhat complex because the transaction includes operations that span two distinct software systems, each with its own resource manager, log records, and so on.
With a two-phase commit protocol, the distributed transaction manager employs a coordinator to manage the individual resource managers.
The commit process proceeds as follows:
• Phase 1
• Each participating resource manager coordinates local operations and forces all log records out:
• If successful, respond “OK”
• If unsuccessful, either allow a time-out or respond “OOPS”
• Phase 2
• If all participants respond “OK”:
• Coordinator instructs participating resource managers to “COMMIT”
• Participants complete operation writing the log record for the commit
• Otherwise:
• Coordinator instructs participating resource managers to “ROLLBACK”
• Participants complete their respective local undos
In order for the scheme to work reliably, both the coordinator and the participating resource managers independently must be able to guarantee proper completion, including any necessary restart/redo operations. The algorithms for guaranteeing success by handling failures at any stage are provided in advanced database texts.
Advertisements
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
w
Connecting to %s
%d bloggers like this:
|
__label__pos
| 0.83177 |
12 Integrating ICF with Oracle Identity Manager
Oracle Identity Manager's goal is to manage the business logic of Identity administration, and delegate the execution of provisioning and reconciliation operations to Identity Connector Framework (ICF). ICF with Oracle Identity Manager (OIM) unites all the scheduled tasks and the provisioning tasks for all ICF based connectors.
This chapter contains conceptual information about ICF-OIM integration in the sections:
12.1 ICF Common
OIM ICF Integration Layer is an implementation of ICF API on one side and invokes OIM APIs (icf-oim-intg.jar) on the other side. This reduces the complexity of the connector developer as it provides API abstraction. It also support provisioning and reconciliation operations. See Section 12.5, "Provisioning" and Section 12.6, "Concepts of Reconciliation in ICF Common" for more information about provisioning and reconciliation using ICF Common.
12.2 Integration Architecture
The following is the ICF-OIM integration architecture.
Figure 12-1 OIM-ICF Connector Development Architecture
Surrounding text describes Figure 12-1 .
12.3 Global Oracle Identity Manager Lookups
Lookups is used to store OIM configuration metadata. IT Resource parameter Configuration Lookup points to main Configuration Lookup that encapsulates all the Oracle Identity Manager specific configuration information.
Based on the lookup configuration, you can classify your properties into the following three classes:
• IT Resource: connectivity properties: contains all properties that are used for making a connection to the target system.
• Main Configuration Lookup Configuration Properties: contains non-connectivity properties that alter the mode of reconciliation or provisioning, and are not required for connection. There is a thin line of difference between connectivity and configuration properties, therefore one property can be assigned to both of them.
• Object Type: specific lookups (for example, user management configuration), mapping lookups for specific object type (for example, User, Group, Organizational Unit).
Note:
LOADFROMURL flag can be used in IT Resource or Main Configuration Lookup in the code (key) field, for example, sampleProperty[LOADFROMURL]. For properties marked as this, the value (decode value) is a URL. ICF integration will read the contents of the file stored in the given URL and use it as the value of given property at runtime. This is useful for large values that cannot fit directly into a lookup.
Figure 12-2 illustrates the global Oracle Identity Manager lookups from which most of the Connectors use the User Management Lookups.
Figure 12-2 Oracle Identity Manager Connector Lookup Hierarchy
Surrounding text describes Figure 12-2 .
This section discusses the following topics:
12.3.1 Main Lookup Configuration
IT Resource parameter Configuration Lookup points to Main Configuration Lookup, which encapsulates all the OIM specific configuration information.
Configuration lookup, denoted as Lookup.CONNECTOR_NAME.Configuration, is the top level entry that refers to subordinate lookups for reconciliation and provisioning. The configuration lookup has the following structure:
Table 12-1 Lookup Configuration for Connector
Configuration Key Value Description
Connector Name
org.identityconnectors.CONNECTOR_NAME.Connector
Identity Connector Main Class. This is the class that implements SPI operations of ICF framework.
Bundle Name
org.identityconnectors.CONNECTOR_NAME
Identity Connector bundle name
Bundle Version
11.1.1.5.x
Identity Connector bundle version
User Configuration Lookup
Note: Other object types may be defined, for example, for Generic LDAP connector: Group Configuration Lookup, OU Configuration Lookup.
Lookup.CONNECTOR_NAME.UM.Configuration
Link to User specific configuration lookup. Note: User should be the object type. If you need to support any other object type, you can use OBJECT_TYPE Configuration Lookup as the key.
12.3.2 User Management Configuration
These lookups control the mapping for provisioning and reconciliation. In addition, these lookups might also configure transformation and validation.
This lookup contains the following keys:
• Before Create Action Language: This key if present in the Lookup.CONNECTOR_NAME.UM.Configuration, which informs ICF that there is a script whose language is the value of this key. The value of this key (Groovy/cmd ) informs the language of the script that needs to be executed by ICF before create operation.
• Before Create Action File: This key if present in the Lookup.CONNECTOR_NAME.UM.Configuration, informs ICF that a script represented by the value of this key needs to be executed by ICF before create action. This script must be accessible to Oracle Identity Manager Server.
• Before Create Action Target: This key if present in the Lookup.CONNECTOR_NAME.UM.Configuration, informs ICF that script as defined by previous two keyes needs to be executed either on resource or on connector. Depending on this configuration the ICF API runScriptOnConnector or runScriptOnResource will be exectuted.
Table 12-1 describes the User Management lookup configuration.
Table 12-2 User Management Lookup Configuration for Connector
Configuration Key Value Mandatory Field Type Description
Provisioning Attribute Map
Lookup.CONNECTOR_NAME.UM.ProvAttrMap
Y
This lookup contains the mapping between Oracle Identity Manager fields and identity connector attributes. The mapping is used during provisioning.
Recon Attribute Map
Lookup.CONNECTOR_NAME.UM.ReconAttrMap
Y
This lookup contains the mapping between Oracle Identity Manager reconciliation fields and identity connector attributes. The mapping is used during reconciliation.
Recon Attribute Defaults
Lookup.CONNECTOR_NAME.UM.ReconDefaults
N
This mapping contains the default values for OIM attributes, that are substituted, if no value is provided by connector during reconciliation.
Recon Transformation Lookup
Lookup.CONNECTOR_NAME.UM.ReconTransformation
N
Lookup for Transformation by doing Reconciliation Task. Transformation is used in all Reconciliation Tasks except LookupReconTask.
Recon Validation Lookup
Lookup.CONNECTOR_NAME.UM.ReconValidation
N
Lookup used for Validation by running Reconciliation Task. Validation is used in all Reconciliation Tasks except LookupReconTask.
Recon Exclusion List
Lookup.CONNECTOR_NAME.UM.ReconExclusionList
N
Exclusion list is a way to address un-managed accounts for the connector. While reconciliation/provisioning. Any match from the exclusion list will not be processed by OIM.
There are two types of rules supported by the exclusion list:
• Matching rules
Direct Matching Rule
Code Key: Reconciliation field name
Decode Key: Excluded field value
• Pattern Matching Rule
Suffix with [PATTERN] tag to enable pattern matching
Code Key: ReconFieldName[PATTERN]
Decode Key: Exclusion pattern
Exclusion patterns should follow the nomenclature defined in java.util.regex.Pattern
See the Recon Exclusion List key in this table.
Provisioning Exclusion List
Lookup.CONNECTOR_NAME.UM.ProvExclusionList
N
In provisioning, code key is the Form label name, and decode key is the excluded value/pattern.
Provisioning Validation Lookup
Lookup.CONNECTOR_NAME.UM.ProvValidation
N
Lookup for Validation by Provisioning.
ICF defines the concept of OperationOption, it is an extra parameter list, that can be sent to any operation. It is up to the connector implementation to define the use of these operation options.
Operation Options Map
Lookup.CONNECTOR_NAME.UM.OperationOptions
N
The code key is a constant Operation Options Map. The decode value name of lookup that will be used as a map of operation options.
For example, in Lookup.Domino.UM.OperationOptions the code key is CACertifier[UPDATE,DELETE] and the decode value is CACertifier, which means that this attribute will be sent to calls of Update and Delete operations as an extra operation option.
If you want to configure the action run, then you need to provide three parameters for scripting:
• Language
• File
• Target
Scripting Attributes
The triggering time of the script is controlled by these labels in your lookup key:
• Before
• After
The provisioning operation type that the script is attached on is controlled by these labels:
• Create
• Update
• Delete
Before Create Action Language
SCRIPTING_LANGUAGE_NAME
N
Language of the Action which will be executed, for example, Groovy/cmd. If you want to configure the action run, then you need to provide three options, Language/File/Target You can configure Before/After actions for the following provisioning operations: Create/Update/Delete.
Before Create Action File
FILE_PATH
N
File containing script which needs to be executed. This file needs to be accessible to Oracle Identity Manager Server.
Before Create Action Target
Connector or Resource
N
Target of the action, can be Connector or Resource. Depending on this configuration the ICF API runScriptOnConnector or runScriptOnResource will be used.
12.3.3 Recon Transformation Lookup (Lookup.CONNECTOR_NAME.UM.ReconTransformation)
Transformation code is in an external Oracle Identity Manager Java Task, used in all Reconciliation Tasks except LookupReconTask. It is a Java class uploaded (transforming data coming from Target System during reconciliation) to Oracle Identity Manager repository.
The Java class performing transformation needs to have a method with the signature public Object transform(HashMap arg0, HashMap arg1, String arg2) implemented. ICF would look for this method with the exact signature.
Transform java class template is as follows:
public class MyTransformer implements oracle.iam.connectors.common.transform.Transformation {
public Object transform(java.util.HashMap hmUserDetails, java.util.HashMap hmEntitlementDetails, String sField) {
String sFirstName= (String)hmUserDetails.get("First Name");
String sLastName= (String)hmUserDetails.get("Last Name");
String sFullName=sFirstName+"."+sLastName;
return sFullName;
}
}
The name of lookup storing the Recon Transformation Lookup is defined in Main Configuration Lookup (Lookup.CONNECTOR_NAME.Configuration) as shown in Table 12-3.
Table 12-3 Reconciliation Transformation Lookup
Key Value Description
Recon Field Name
<transformationClassName>
com.validationexample.MyTransform
Java class which performs transformation for this recon field.
12.3.4 Recon Validation Lookup (Lookup.CONNECTOR_NAME.UM.ReconValidation)
Validation code is in an external Oracle Identity Manager Java task, Used for validating data coming from Target System during Reconciliation. It is a Java class uploaded (transforming data coming from Target System during reconciliation) to Oracle Identity Manager repository.
The Java class performing validation needs to have a method with the signature public boolean validate (HashMap arg0, HashMap arg1, String arg2) implemented. ICF would look for this method with the exact signature.
The validation Java class template is as follows:
public class MyValidator implements oracle.iam.connectors.common.validate.Validator {
public boolean validate(java.util.HashMap hmUserDetails, java.util.HashMap hmEntitlementDetails,String sField) throws oracle.iam.connectors.common.ConnectorException {
boolean isValid = false;
// validation code goes HERE
return isValid;
}
}
The name of lookup storing the Recon Validation Lookup is defined in main configuration lookup (Lookup.CONNECTOR_NAME.Configuration) as shown in Table 12-4.
Table 12-4 Reconciliation Validation Lookup
Key Value Description
Recon Field Name
<transformationClassName>
com.validationexample.MyValidator
Java class which performs validation for this recon field.
12.3.5 Optional Defaults Lookup
Missing values for reconciliation are substituted by default values defined in the following table. User Type is a required OIM attribute, that typically is not contained on the target resource. You can set the default value in here.
For example, trusted reconciliation requires a set of attributes from the connector to have a non-empty value. However, not all resources can supply all of these attribute types, so we need to provide some default values. Table 12-5 lists all required attributes for reconciliation, and possible default values for them.
If connector can supply all attributes needed in reconciliation, then this table becomes optional.
Table 12-5 Lookup.CONNECTOR_NAME.UM.Recon.Defaults.Trusted Attriburtes
Key Value
Last Name
CONNECTOR_DEPENDENT_VALUE
Organization
Xellerate users
User Type
End-User
Employee Type
Full-Time
First Name
CONNECTOR_DEPENDENT_VALUE
Note:
These default values are supported only for single valued fields, which means the multivalued or child table attributes are not supported.
12.4 IT Resource
IT Resource contains connectivity parameters for Target System. These parameters are required for all the connectors using ICF integration.
Table 12-6 describes the common IT Resource parameters.
See Also:
The documentation for the connector you are deploying for information about the IT Resource parameters of the target system and the Connector Server
Table 12-6 IT Resource Parameter
Parameter Description
Connector Server Name
IT Resource name of Connector Server. The IT Resource needs to be of type Connector Server. This field is a mandatory field, but the value is optional.
Configuration Lookup
Name of the main configuration lookup. This field is a mandatory field
12.5 Provisioning
The section contains the following topics:
12.5.1 ICF Provisioning Manager
ICF Provisioning Manager unites the access to provisioning methods of connectors into one Java Task that serves all connectors.
The public methods are divided into four groups:
12.5.1.1 APIs for Provisioning
The following are the single-valued CRUD object types.
createObject
Creates object of a specified type on the target resource, the values are taken from the current Form.
Signature: public String createObject(String objectType)l
deleteObject
Deletes object of a specified type on the target resource.
Signature: public String deleteObject(String objectType)
updateAttributeValue
Updates object on target resource, only the attribute with the provided label is updated.
Signature: public String updateAttributeValue(String objectType, String attrFieldName)
updatePassword
Use this method in Adapter ONLY if you need to provide old password value, currently there is no way to get the old value using the formAPI. If you don't need old password value to change the password, use #updateAttributeValue(String, String) method instead.
Signature: public String updatePassword(String objectType, String pswdFieldLabel, String oldPassword)
12.5.1.2 Account Related Operations
The following are the account related provisioning operations.
enableUser
Deprecated, use enableObject() instead.
Signature: public String enableUser()
disableUser
Deprecated, use disableObject() instead.
Signature: public String disableUser()
enableObject
Example usage for User: enableObject("User").
Signature: public String enableObject(String objectType)
disableObject
Signature: public String disableObject(String objectType)
12.5.1.3 Multivalued Operations
The following are the multivalued operations used in provisioning.
updateAttributeValues
Use this method if there is a group update of fields. This will be useful when a set of attributes have to updated together.
Signature: public String updateAttributeValues(String objectType, String[] labels) public String updateAttributeValues(String objectType, Map<String, String> fields) public String updateAttributeValues(String objectType, Map<String, String> fields, Map<String, String> oldFields)}}}
addChildTableValue
Updates the target by adding the newly added row in child table.
Signature: public String addChildTableValue(String objectType, String childTableName, long childPrimaryKey)
removeChildTableValue
Updates the target by removing the row which was just deleted from child table.
Signature: public String removeChildTableValue(String objectType, String childTableName, Integer taskInstanceKey)
updateChildTableValue
Updates the target by removing the deleted row and adding the newly created row.
Signature: public String updateChildTableValue(String objectType, String childTableName, Integer taskInstanceKey, long childPrimaryKey)
updateChildTableValue
Updates values provided in child table on target resource.
Signature: public String updateChildTableValues(String objectType, String childTableName)
12.5.1.4 Other operations
The following is the other operation used in provisioning.
setEffectiveITResourceName
If the connector needs to use different IT Resource for provisioning operations, it can be set by this method.
Signature: public void setEffectiveITResourceName(String itResourceName)
12.5.2 Provisioning Lookup
Lookup.CONNECTOR_NAME.UM.ProvAttrMap contains basic attribute mapping for two classes of attributes:
• Single valued attributes: simple string key + value pairs.
• Multivalued attributes (Child tables in Oracle Identity Manager): These are further divided by the depth of hierarchy:
• Simple multivalued attributes: represent records of data stored in child table, see second row in Table 12-7.
• Complex multivalued attributes: multiple levels of embedded objects, see last row in Table 12-7.
Table 12-7 Provisioning Lookup Attributes
Key Value Description
Form Field Label
ConnectorAttributeName
This is a basic mapping type, simple Form Label Name to single value Connector Attribute Name
Child Form Name>~<Child Form Field Label
ConnectorAttributeName
This maps child form field to multivalued ConnectorAttributeName
Child Form Name>~<Child Form Field Label
ConnectorAttributeName>~<EmbeddedObjectClass>~<EmbeddedAttributeName
This maps child form field to EmbeddedAttribute of the embedded object, which object class is EmbeddedObjectClass and it is included in ConnectorAttributeName
12.5.3 Non-User Object Types
There are number of other entities that can be provisioned for example LDAP Organizational Unit (also called OU), or LDAP Group or Group. In this case you need to fill in the OBJECT_TYPE in the following examples:
Main Configuration Lookup Lookup.CONNECTOR_NAME.Configuration
Table 12-8 Configuration Lookup for Connector
Key Value Description
objectType Configuration Lookup
Lookup.<ConnectorName>.<objectType>.ProvAttrMap
Group Configuration Lookup
Lookup.LDAP.Group.ProvAttrMap
Example for LDAP Group
Provisioning Lookup Lookup.CONNECTOR_NAME.OBJECT_TYPE.ProvAttrMap
Key Value Description
FORM_FIELD_LABEL_ON_THE_PROCESS_FORM Target system attribute name Attribute mapping between Oracle Identity Manager and the connector.
12.5.4 Optional Lookups for Provisioning
Key Value Description
FORM_FIELD_NAME [Create, Update, Delete] ConnectorOperationOptionName This field is used for generic definition.
For example, where the field is mapped to operation option for CreateOp that is sent to connector named as myOperationOption.
myField[Create] myOperationOption
12.5.4.1 Provisioning Validation Lookup
Validation code is in an external OIM Java Task, it is a Java class uploaded to OIM repository. Validation java class template:
public class MyValidator implements oracle.iam.connectors.common.validate.Validator {
public boolean validate(java.util.HashMap hmUserDetails, java.util.HashMap hmEntitlementDetails,String sField) throws oracle.iam.connectors.common.ConnectorException {
boolean isValid = false;
// validation code goes HERE
return isValid;
}
}
The name of lookup storing the Recon Validation Lookup is defined in Main Configuration Lookup (Lookup.CONNECTOR_NAME.Configuration).
Key Value Description
Form Field Label validatorClassName
com.validationexample.MyValidator
Java class which performs validation for this recon field.
12.5.5 Optional Flags in Lookups for Provisioning Attribute Map
ICF-OIM Integration offers some advanced flags that modify the way provisioning is done. The following is the example for formats of flags in look up key:
<key value>[<flag>]
<key value>[<flag1, flag2, flag3>]
Let us assume we have a Group OIM attribute that is mapped to UnixGroup Connector attribute. This OIM attribute is populated by a UI lookup. The correct row in Provisioning lookup will be:
nullLookup key: Group[LOOKUP]
Lookup value: UnixGroup }}}
The following is the list of flags and their effects.
Provisioning Lookup Flag: TRUSTED
For some attributes (for example trusted reconciliation of __ENABLE__ attribute), you need to pass on different values for trusted and target mode of operation. For most of the connectors which support status Reconciliation use code key: Status[Trusted], and decode value: __ENABLE__.
Provisioning Lookup Flag: IGNORE
An attribute marked as IGNORE, will be ignored during provisioning.
Provisioning Lookup Flag: WRITEBACK
If a field has WRITEBACK property, then update of that form field is:
1. update the value on the target system
2. query the value back from the target system (in order to get a normalized value)
3. update this normalized value on the user form.
Provisioning Lookup Flag: DATE
Use this flag to mark date fields. Oracle Identity Manager will apply the localized date format to these fields.
Provisioning Lookup Flag: PROVIDEONPSWDCHANGE
Use this flag to mark additional attributes that are needed for password change operation. By default only __PASSWORD__ attribute is sent, if no flag is applied.
12.5.6 Compound attributes in Provisioning Attribute Map
ICF Common enables to use Groovy expressions on the right hand side, so that provisioned attribute can be computed based on multiple fields. For example, in Active Directory Connector, decode value for the name field is: .
__NAME__=CN=${Common_Name},${Organization_Name}
12.6 Concepts of Reconciliation in ICF Common
ICF Common leverages the definition and types of reconciliation defined by Oracle Identity Manager server. IT Resource Name / Resource Object Name and Object Type are mandatory attributes reconciliation using ICF Common. Any target system attribute can be used as Latest Token Attribute.
This section contains the following topics:
12.6.1 Types of Reconciliation
Reconciliation involves pulling identities from resource (also referred as target) to destination (Oracle Identity Manager). Reconciliation can be classified based on following criteria:
• Destination type: trusted, target recon.
• Scope: full, incremental recon.
Table 12-9 illustrates the common reconciliation parameters.
Table 12-9 ICF Common Reconciliation Parameters
Parameter Field Setting Description
Filter
Optional
Filter to limit the number of reconciled accounts, or to select specific set of users.
IT Resource Name
Mandatory
Name of IT Resource instance to reconciliation.
Object Type
Constant
User object class
Resource Object Name
Constant
Determines what OIM Resource Object to use for reconciliation.
12.6.1.1 Target and Trusted Reconciliation
Scheduled task name include keywords such as trusted, target, to determine the type of destination. By choosing the scheduled task, it is determined whether trusted or target reconciliation is launched.
12.6.1.2 Full, Incremental Reconciliation
Full reconciliation involves reconciling all existing user records from the target system into Oracle Identity Manager. During Full Reconciliation, scheduled task is launched for the first time, it is run in full reconciliation mode and from next runs happen in incremental mode. It is possible to switch manually between full/incremental reconciliation modes by emptying the Latest Token field on the scheduled task.
If no value is supplied in Incremental Recon Date Attribute and Incremental Recon Attribute, reconciliation is considered as Target Recon.
The following scheduled tasks offer optional incremental reconciliation:
• Connector Target User Reconciliation
• Connector Trusted User Reconciliation
12.6.1.3 Advanced Incremental Reconciliation
The format of Latest Token is altered by setting the Recon Date Format scheduled task parameter. The formatting string needs to follow standard pattern used in Java. For more information about formatting string used in Java, see Java Doc on Oracle Technology Network.
By default the Latest Token is long value that holds Unix/POSIX time.
12.6.1.4 Delete Reconciliation
Some connectors supports both trusted and target reconciliation of deleted accounts. Target reconciliation evaluate which OIM users have lost their account on the resource, and unassign this resource in Oracle Identity Manager. Trusted Delete Reconciliation goes further, and deletes the OIM User.
12.6.1.5 Group Lookup Reconciliation
Some connectors may support reconciliation of Groups, or other object classes to Lookups.
Before the first use of provisioning with the connector, it is advised to launch Lookup reconciliation. This reconciliation populate the Lookup.CONNECTOR_NAME.ObjectType table with groups available on an IT Resource that is being reconciled. The reconciliation is performed by the Connector Lookup Reconciliation scheduled task.
You need to set the IT resource parameter name, the rest of the parameters are constant as shown in Table 12-9.
Table 12-10 illustrates the common reconciliation parameters.
Table 12-10 Common Group Lookup Parameters
Code Key Decode Key Object Type
Form field name
Connector attribute
Group, or other
For example, the list of names returned by the connector is used to populate the lookup for provisioning. When a new user is provisioned, the group field can display the list of available groups.
12.6.2 List of Reconciliation Artifacts in Oracle Identity Manager
In Oracle Identity Manager, there are two methods of control over reconciliation:
• Lookups for Reconciliation: they define mapping, transformation of the attributes.
• Scheduled tasks - they define the way reconciliation is executed on connector side, or determine account/lookup mode of reconciliation.
12.6.2.1 Lookups for Reconciliation
The following are the lookups for reconciliation:
Reconciliation Attribute Map Lookup
The reconciliation attribute map contains the following pairs:
• Code key: Resource Object reconciliation field name
• Decode: Target system attribute name
Table 12-11 illustrates this mapping (Lookup.CONNECTOR_NAME.UM.ReconAttrMap ) used by Scheduled tasks that perform reconciliation.
Note:
Resource Objects are different for Trusted and Target mode of reconciliation.
Table 12-11 Attribute Mapping for Lookup.CONNECTOR_NAME.UM.ReconAttrMap
Key Value Description
Recon Field Name
ConnectorAttributeName
This is a basic mapping type, single value Connector Attribute Name to simple Recon Field.
Recon Field Name~Child Recon Field Name
ConnectorAttributeName
This maps multivalued ConnectorAttributeName to child recon field.
Recon Field Name~Child Recon Field Name
ConnectorAttributeName~EmbeddedObjectClass~EmbeddedAttribute
This maps embedded attribute to child recon field
Example showing Design Console updates to setup reconciliation with child table
The following is the example showing Design Console updates to setup reconciliation with child table:
• Child table name: UD_FF_CHILD
• Column name: UD_FF_CHILD_ROLE
• Field label: Role
To set up reconciliation with the above child table:
1. Open Resource Object under Resource Management.
2. Create a new Reconciliation Data field under Object Reconciliation tab.
Note:
While creating a new Reconciliation Data field, you must ensure that the field name be Roles and Field Type be Multi-Valued Attribute. This represents the child table as a whole UD_FF_CHILD.
3. Right click on the newly created Reconciliation Data Field and define a new property field as Role. This represents the actual column of the child table UD_FF_CHILD_ROLE.
4. Open Reconciliation Field Mapping under Process Definition.
5. Click on Add Table Map.
6. Select Field Name as Roles.
7. Select Table Name as UD_FF_CHILD.
8. Right click on the newly created field name Roles, click on Define proper field name.
9. Select Role for field name.
10. Select Process data field as UD_FF_CHILD_ROLE.
11. Update Lookup.CONNECTOR_NAME.UM.ReconAttrMap to include new lookup field with code key = Roles~Role and decode = Role (this should be connector side attribute name).
12. Go back to Resource Object and create reconciliation profile.
13. Clear cache.
12.7 Predefined Scheduled Tasks
ICF-OIM integration provides the following list of predefined scheduled tasks that a connector supports:
12.7.1 LookupReconTask
This scheduled task is based on ICF SearchOp based reconciliation. Oracle Identity Manager form field of type lookup stores a set of predefined values. These values originate from the connector's search query. The Code Key Attribute is the form field's name, and the Decode Attribute is the name of attribute on the target system (also called Connector).
Internally, this task invokes a search operation on the connector for the given Object Type that is translated to ICF Object Class eventually.
Table 12-12 Identity Connector Lookup Reconciliation Attributes
Key Value
IT Resource Name
Specifies the name of the IT resource for target system installation.
Object Type
User
Lookup Name
This attribute holds the name of the lookup definition that maps each lookup definition with the data source from which values must be fetched.
Decode Attribute
Specifies the Decode Key column of the lookup definition.
Code Key Attribute
Specifies the Code Key column of the lookup definition.
Filter
Allows to create sophosticated filtration expressions in order to speed up/refine scheduled task execution.
12.7.2 SearchReconTask
The following is the ICF SearchOp based reconciliation.
Table 12-13 Identity Connector Target Search Reconciliation Attributes
Key Value
IT Resource Name
Specifies the name of the IT resource for target system installation.
Resource Object Name
Specifies the name of the Resource Object used for reconciliation.
Object Type
User
Filter
Allows to create sophisticated filtration expressions in order to speed up/refine scheduled task execution.
Latest Token
Used in Filter as one of the criteria in incremental reconciliation. Any target system attribute can be used as Latest Token Attribute. This value is calculated as follows:
If a reconciliation has fetched 100 records and Timestamp is chosen as a Incremental Recon Attribute, then Latest Token = Max Timestamp of all 100 records. It is not the Schedule task execution end timestamp.
Incremental Recon Date Attribute (optional, type Date)
Attribute used to update Latest Token.
Note: If no value is supplied in Incremental Recon Date Attribute, then reconciliation is considered as Target Reconciliation.
Incremental Recon Attribute (optional, type long)
Attribute used to update Latest Token.
Note: If no value is supplied in Incremental Recon Attribute , then reconciliation is considered as Target Reconciliation.
12.7.3 SearchReconDeleteTask
This scheduled task is used for ICF SearchOp based reconciliation.
Table 12-14 Identity Connector Target Search Delete Reconciliation Attributes
Key Value
IT Resource Name
Specifies the name of the IT resource for target system installation.
Resource Object Name
Specifies the name of the Resource Object used for reconciliation
Object Type
User
Filter
Allows to create sophisticated filtration expressions in order to speed up/refine scheduled task execution.
12.7.4 SyncReconTask
This scheduled task is used for ICF SyncOp based reconciliation. The Sync Token field persists the token of last synchronization.
Table 12-15 Identity Connector Target Sync Reconciliation Attributes
Key Value
IT Resource Name
Specifies the name of the IT resource for target system installation.
Resource Object Name
Specifies the name of the Resource Object used for reconciliation
Object Type
User
Filter
Allows to create sophisticated filtration expressions in order to speed up/refine scheduled task execution.
Sync Token
Token of last synchronization.
12.8 ICF Filter Syntax
GroovyFilterBuilder allows to create sophisticated filtration expressions in order to speed up/refine scheduled task execution.
WARNING:
The GroovyFilterBuilder uses the connector attribute name for filtration. See Connector documentation for the attribute name.
Examples
The following example could limit the number of reconciled accounts to only those, where account name starts with letter "a", this filter is denoted by the following expression:
startsWith('__NAME__', 'a')
Some more advanced search could require to filter only those account names, which end with "z" letter, therefore the filter is:
startsWith('__NAME__', 'a') & endsWith('__NAME__', 'z')
Figure 12-3 shows the graphical scheme of Filter Syntax.
Figure 12-3 Graphical Representation of Filter Syntax
Surrounding text describes Figure 12-3 .
It is also possible to use a shortcut for and/or operators.
For example, <filter1> & <filter2> instead of and (<filter1>, <filter2>) , analogically replace or with |.
Definition in EBNF format:
The following is the Extended Backus–Naur Form (EBNF) description of the expression language used for Search Filters in reconciliation.
syntax = expression ( operator expression )*
operator = 'and' | 'or'
expression = ( 'not' )? filter
filter = ('equalTo' | 'contains' | 'containsAllValues' | 'startsWith' | 'endsWith' | 'greaterThan' | 'greaterThanOrEqualTo' | 'lessThan' | 'lessThanOrEqualTo' ) '(' 'attributeName' ',' attributeValue ')'
attributeValue = singleValue | multipleValues
singleValue = 'value'
multipleValues = '[' 'value_1' (',' 'value_n')* ']'
|
__label__pos
| 0.749968 |
Skip to main content
Configuring an Effect
Example Effect Config
id: spawn_particle
args:
amount: 10
chance: 25
particle: soul
triggers:
- mine_block
filters:
blocks:
- diamond_ore
- ancient_debris
conditions: []
mutators:
- id: translate_location
args:
add_x: 0.5
add_y: 0.5
add_z: 0.5
This is an effect that gives you a 10% chance to spawn 10 soul particles in the middle of a block of diamond ore or ancient debris when it's mined
Placeholders
Any numeric value (integer, decimal) can be a mathematical expression involving placeholders!
For example, you can specify the chance to be dependent on your y level: as in chance: 100 - %player_y% - permanent effects will evaluate the expression on activation, and triggered effects will evaluate it on each trigger. Make sure you only use placeholders with numeric values, as you will get weird behaviour otherwise.
There are also extra placeholders passed in that you can use:
%trigger_value%, %triggervalue%, %trigger%, %value%, %tv%, %v%, and %t%: The value passed by the trigger (e.g. the amount of damage dealt; see here).
%victim_health%: The victim's health
%victim_max_health%: The victim's max health
%distance%: The distance between the player and the victim
%victim_level%: The victim's level Requires LevelledMobs
If the victim is a player, you can supply any placeholder prefixed with victim_ (e.g. %victim_player_y%) as well.
%hits%: The amount of times the player has hit the victim
The Sections
id: The effect ID. A list of ID's and their corresponding arguments can be found here
args: The arguments. All (triggerable) effects have optional arguments (see below) git add triggers: The list of triggers that activate this effect. If the effect is permanent (see next page) then this section is not applicable
filters: The list of filters against arguments created by the trigger, ie mine_block will provide blocks to be filtered, melee_attack will provide entities to be filtered.
conditions: As well as each effect holder (eg Talisman, Reforge, Enchant) having its own conditions, you can specify a list of effect-specific conditions that work in exactly the same way
mutators: Mutate the data sent to the effect: you can change parameters such as the victim, the location, et cetera. A mutator, like an effect or condition, consists of an ID and arguments.
Optional Arguments
chance
The chance of this effect activating, as a percentage. (defaults to 100)
args:
chance: 50
cooldown
The cooldown between effect activations, in seconds. (defaults to 0)
args:
cooldown: 10
send_cooldown_message: true # If the cooldown message should be sent
cost
The cost required to use or activate this effect. Requires Vault. (defaults to 0)
args:
cost: 200
every
Specify the effect to activate every x times. (defaults to always)
args:
every: 3
mana_cost
The mana cost required to use or activate this effect. Requires Aurelium Skills. (defaults to 0)
args:
mana_cost: 10
delay
The amount of ticks to wait before executing the effect. (defaults to 0)
args:
delay: 20
filters_before_mutation
By default, filters are ran after mutation - set this to true if filters should be ran on the un-mutated data. (defaults to false)
args:
filters_before_mutation: true
disable_antigrief_check
By default, the antigrief plugins on your server are checked. Set this to true to disable that. (defaults to false)
args:
disable_antigrief_check: true
point_cost
The point cost required to use or activate this effect, looks like this in config:
args:
point_cost:
cost: 100 * %player_y%
type: g_souls
price
The price required to use or activate this effect.
This supports all known prices: supports money, items, points, second currencies, etc. Read more about the system here: https://plugins.auxilor.io/all-plugins/prices
Looks like this in config:
args:
price:
value: 100 * %player_y%
type: crystals
display: "&b%value% Crystals ❖"
Effect Chains
Effect chains are groups of effects that can be executed together. This is very useful if you want to create a chance-based effect with several components: chance is calculated independently on each trigger, so without chains, particles and messages could send when the effects don't activate, and vice-versa.
Effect chains are also useful to re-use more complex logic, via custom arguments that you can specify. These work like regular placeholders, and you reference them in your chains with %<id>%, for example %size% if you had a size argument.
You can create a chain in config, under the 'chains' section - which should look like this:
chains:
- id: <chain id>
effects:
- <effect 1>
- <effect 2>
- <effect 3>
Effects in chains do not need to specify triggers as they are triggered by the run_chain effect
You can add or remove as many chains as you want. Then, if you want to call a chain, use the run_chain effect, like this:
id: run_chain
args:
chance: 50 * (%player_health% / 20) # Example to demonstrate placeholders in config
cooldown: 2
chain: <chain id>
triggers:
- melee_attack
- bow_attack
- trident_attack
filters:
entities:
- zombie
- creeper charged
- skeleton
Custom arguments can be specified like this:
id: run_chain
args:
chain: <chain id>
chain_args:
strength: %player_y% * 100 # You can put anything you want, doesn't only have to be numbers - you can use strings too!
... add whichever arguments you use in your chain
If you don't want to re-use chains, or if you prefer having them specified directly under the effect, you can use the run_chain_inline effect instead, like this:
id: run_chain_inline
args:
every: 3
chain:
- effects:
- <effect 1>
- <effect 2>
- <effect 3>
triggers:
- mine_block
Inline chains also support custom arguments, just like regular chains.
Effects in chains run isolated, so applying a mutator to one effect in the chain will apply it only to that effect - however, you can specify a mutator to the parent effect (run_chain or run_chain_inline) which will be applied to all effects in the chain. The same works for delays, e.g. if an effect in a chain has a delay of 2, it won't hold up other effects down the chain.
Effect chains also support several run types:
• normal: All effects in the chain will be ran, one after another
• cycle: Only one effect will be ran, and it cycles through each effect each time the chain is ran
• random: Only one effect will be ran, chosen at random on each execution
To specify the run type, add the run-type argument into config:
id: run_chain_inline
args:
run-type: cycle
chain:
- effects:
- <effect 1>
- <effect 2>
- <effect 3>
triggers:
- alt_click
So in this example, effect 1 will be ran the first time, next time effect 2, then effect 3, then back to effect 1 (and so on).
Shorthand inline chains
It can be feel quite cumbersome to have a lot of inline chains filling up your configs. To fix this, there's a shorthand syntax:
triggers:
- alt_click
effects:
- <effect 1>
- <effect 2>
- <effect 3>
args:
run-type: random
chance: 30
... filters, mutators, etc
This is an alternative way of configuring your effects; you don't specify a top-level effect ID, instead you specify a list of effects to be called. This can be thought of as being more trigger-centric; multiple triggers to multiple effects straight away, no worrying about the underlying inline chain.
These work exactly like inline chains (they are inline chains), so everything is still supported; run-type, custom arguments, et cetera.
|
__label__pos
| 0.788566 |
123
Pen Settings
CSS Base
Vendor Prefixing
Add External Stylesheets/Pens
Any URL's added here will be added as <link>s in order, and before the CSS in the editor. If you link to another Pen, it will include the CSS from that Pen. If the preprocessor matches, it will attempt to combine them before processing.
+ add another resource
You're using npm packages, so we've auto-selected Babel for you here, which we require to process imports and make it all work. If you need to use a different JavaScript preprocessor, remove the packages in the npm tab.
Add External Scripts/Pens
Any URL's added here will be added as <script>s in order, and run before the JavaScript in the editor. You can use the URL of any other Pen and it will include the JavaScript from that Pen.
+ add another resource
Use npm Packages
We can make npm packages available for you to use in your JavaScript. We use webpack to prepare them and make them available to import. We'll also process your JavaScript with Babel.
⚠️ This feature can only be used by logged in users.
Code Indentation
Save Automatically?
If active, Pens will autosave every 30 seconds after being saved once.
Auto-Updating Preview
If enabled, the preview panel updates automatically as you code. If disabled, use the "Run" button to update.
HTML Settings
Here you can Sed posuere consectetur est at lobortis. Donec ullamcorper nulla non metus auctor fringilla. Maecenas sed diam eget risus varius blandit sit amet non magna. Donec id elit non mi porta gravida at eget metus. Praesent commodo cursus magna, vel scelerisque nisl consectetur et.
<div class="align-center">
<h1 class="heading">Brainymo</h1>
<p class="desc">Frontend Arsenal Memory Game</p>
<button class="btn" id="btn-start">
Start
</button>
<div class="cards-container">
<div class="flip-container hide" id="card-template">
<div class="flipper">
<div class="front">
<label>frontend technologies</label>
</div>
<div class="back">
<label></label>
</div>
</div>
</div>
</div>
<div class="timer">
<label id="minutes"></label>:
<label id="seconds"></label>
<div class="time">
MY BEST TIME: <span id="bestTime"></span>
</div>
</div>
</div>
!
/* Colors */
$white: #FFFFEA;
$red: #FF5E5B;
$blue: #00CECB;
$yellow: #FFED66;
/* Fonts */
$abel: 'Abel', sans-serif;
$lobster: 'Lobster', cursive;
/* Background images */
$bgPattern: "https://www.transparenttextures.com/patterns/inspiration-geometry.png";
@mixin transform($transforms) {
-moz-transform: $transforms;
-o-transform: $transforms;
-ms-transform: $transforms;
-webkit-transform: $transforms;
transform: $transforms;
}
/* General */
body {
background-color: $white;
background-image: url($bgPattern);
font-family: $abel;
color: $red;
}
/* Main page */
.heading {
font-size: 52px;
font-family: $lobster;
color: $red;
margin-bottom: 0;
}
p.desc {
letter-spacing: 0.5px;
margin-top: 0;
margin-bottom: 60px;
}
/* Cards */
.cards-container {
display: block;
margin: 40px;
}
.flip-container {
position: relative;
display: inline-block;
margin: 15px;
perspective: 1000px;
cursor: pointer;
.flipper {
position: relative;
-webkit-transform-style: preserve-3d;
-webkit-transition: 0.5s;
-moz-transform-style: preserve-3d;
-moz-transition: 0.5s;
-ms-transform-style: preserve-3d;
-ms-transition: 0.5s;
-o-transform-style: preserve-3d;
-o-transition: 0.5s;
}
&.active .flipper {
@include transform(rotateY(180deg));
}
}
.flip-container,
.front,
.back {
border-radius: 5px;
color: $white;
width: 180px;
height: 220px;
}
.front,
.back {
-webkit-backface-visibility: hidden;
-moz-backface-visibility: hidden;
-ms-backface-visibility: hidden;
position: absolute;
top: 0;
left: 0;
}
.front {
background-color: $red;
z-index: 2;
@include transform(rotateY(0));
label {
cursor: pointer;
display: inline-block;
font-size: 22px;
padding-top: 15px;
}
}
.back {
background-color: $blue;
text-align: center;
vertical-align: middle;
display: table-cell;
@include transform(rotateY(180deg));
label {
display: block;
width: 100%;
font-size: 24px;
margin-top: 10px;
}
}
/* Timer */
.timer {
display: none;
position: fixed;
pointer-events: none;
left: 30px;
top: 30px;
label#minutes,
label#seconds {
display: inline-block;
font-size: 20px;
}
.time {
display: none;
font-size: 13px;
}
}
/* Buttons */
.btn {
display: inline-block;
background-color: $yellow;
padding: 15px 40px;
border: none;
border-radius: 30px;
font-family: $abel;
font-size: 20px;
text-decoration: none;
text-transform: uppercase;
color: $red;
box-shadow: 0 3px 0 $red;
cursor: pointer;
transition: all 100ms linear;
&:hover {
@include transform(translateY(-4px));
box-shadow: 0 7px 0 $red;
}
&:focus { outline: 0; }
}
/* Github ribbon */
#github {
position: absolute;
top: 0;
right: 0;
border: 0;
}
/* Helpers */
.align-center {
text-align: center;
}
.hide {
display: none !important;
}
.cursor-default {
cursor: default !important;
}
/* Reponsive Rules */
@media screen and (max-width: 1200px) {
.flip-container, .front, .back {
width: 140px;
height: 180px;
}
.timer {
padding: 10px;
border-radius: 5px;
background-color: $white;
}
}
@media screen and (max-width: 992px) {
.flip-container, .front, .back {
width: 100px;
height: 140px;
}
.front label {
display: inline-block;
font-size: 16px;
padding-top: 10px;
}
.cards-container {
margin: 40px 10px;
}
.timer {
top: 10px;
left: 10px;
}
}
@media screen and (max-width: 768px) {
.flip-container, .front, .back {
width: 80px;
height: 120px;
}
}
/* Animations */
@keyframes wobble {
from { transform: none; }
15% { transform: translate3d(-10%, 0, 0) rotate3d(0, 0, 1, -5deg); }
30% { transform: translate3d(10%, 0, 0) rotate3d(0, 0, 1, 3deg); }
45% { transform: translate3d(-5%, 0, 0) rotate3d(0, 0, 1, -3deg); }
60% { transform: translate3d(5%, 0, 0) rotate3d(0, 0, 1, 2deg); }
75% { transform: translate3d(-10%, 0, 0) rotate3d(0, 0, 1, -1deg); }
to { transform: none; }
}
.wobble {
animation: wobble 600ms ease-in-out;
}
!
var BRAINYMO = BRAINYMO || {};
BRAINYMO.Game = (function() {
var activeCards = [];
var numOfCards;
var cardHitCounter = 0;
var card;
var timer;
var storage;
/**
* Method that will be invoked on card click
*/
function handleCardClick() {
var connection = $(this).data('connection');
var hit;
// Set card in active state
// 'this' needs to be attached to context of card which is clicked
if ( !$(this).hasClass('active') ) {
$(this).addClass('active');
activeCards.push($(this));
// If user click on two cards then check
if (activeCards.length == 2) {
hit = checkActiveCards(activeCards);
}
if (hit === true) {
cardHitCounter++;
activeCards[0].add(activeCards[1]).unbind().addClass('wobble cursor-default');
activeCards = [];
// Game End
if(cardHitCounter === (numOfCards / 2)) {
// Reset active cards
activeCards = [];
// Reset counter
cardHitCounter = 0;
// End game
endGame();
}
}
// In case when user open more then 2 cards then automatically close first two
else if(activeCards.length === 3) {
for(var i = 0; i < activeCards.length - 1; i++) {
activeCards[i].removeClass('active');
}
activeCards.splice(0, 2);
}
}
}
function endGame() {
timer.stopTimer();
// Retrieve current time
var time = timer.retrieveTime();
// Retrieve time from storage
var timeFromStorage = storage.retrieveBestTime();
// if there's already time saved in storage check if it's better than current one
if (timeFromStorage != undefined && timeFromStorage != '') {
// if current game time is better than one saved in store then save new one
if (time.minutes < timeFromStorage.minutes || (time.minutes == timeFromStorage.minutes && time.seconds < timeFromStorage.seconds) ) {
storage.setBestTime(time);
}
}
// else if time is not saved in storage save it
else {
storage.setBestTime(time);
}
// Update best time
timer.updateBestTime();
}
function checkActiveCards(connections) {
return connections[0].data('connection') === connections[1].data('connection');
}
return function(config) {
/**
* Main method for game initialization
*/
this.startGame = function() {
card = new BRAINYMO.Card();
timer = new BRAINYMO.Timer();
storage = new BRAINYMO.Storage();
numOfCards = config.cards.length;
card.attachCardEvent(handleCardClick, config);
};
/**
* After game initialization call this method in order to generate cards
*/
this.generateCardSet = function() {
// Generate new card set
card.generateCards(config.cards);
// Reset active cards array
activeCards = [];
// Reset timer
timer.stopTimer();
// Set timer
timer.startTimer();
};
this.startGame();
}
})();
BRAINYMO.Card = (function () {
// Private variables
var $cardsContainer = $('.cards-container');
var $cardTemplate = $('#card-template');
/**
* Private method
* Take card template from DOM and update it with card data
* @param {Object} card - card object
* @return {Object} template - jquery object
*/
function prepareCardTemplate (card) {
var template = $cardTemplate
.clone()
.removeAttr('id')
.removeClass('hide')
.attr('data-connection', card.connectionID);
// If card has background image
if (card.backImg != '' && card.backImg != undefined) {
template.find('.back').css({
'background': 'url(' + card.backImg + ') no-repeat center center',
'background-size': 'cover'
});
}
// Else if card has no background image but has text
else if (card.backTxt != '' && card.backTxt != undefined) {
template.find('.back > label').html(card.backTxt);
}
return template;
}
/**
* Private method
* Method for random shuffling array
* @param {Object} cardsArray - array of card objects
* @return {Object} returns random shuffled array
*/
function shuffleCards(cardsArray) {
var currentIndex = cardsArray.length, temporaryValue, randomIndex;
while (0 !== currentIndex) {
randomIndex = Math.floor(Math.random() * currentIndex);
currentIndex -= 1;
temporaryValue = cardsArray[currentIndex];
cardsArray[currentIndex] = cardsArray[randomIndex];
cardsArray[randomIndex] = temporaryValue;
}
return cardsArray;
}
return function() {
/**
* Public method
* Prepare all cards and insert them into DOM
* Before inserting new set of cards method will erase all previous cards
* @param {Object} cards - array of card objects
*/
this.generateCards = function(cards) {
var templates = [];
var preparedTemplate;
// Prepare every card and push it to array
cards.forEach(function (card) {
preparedTemplate = prepareCardTemplate(card);
templates.push(preparedTemplate);
});
// Shuffle card array
templates = shuffleCards(templates);
// Hide and empty card container
$cardsContainer.hide().empty();
// Append all cards to cards container
templates.forEach(function(card) {
$cardsContainer.append(card);
});
// Show card container
$cardsContainer.fadeIn('slow');
};
/**
* Public method
* Attach click event on every card
* Before inserting new set of cards method will erase all previous cards
* @param {Function} func - function that will be invoked on card click
*/
this.attachCardEvent = function(func) {
$cardsContainer.unbind().on('click', '.flip-container', function() {
func.call(this);
});
}
}
})();
BRAINYMO.Timer = (function() {
var $timer = $('.timer');
var $seconds = $timer.find('#seconds');
var $minutes = $timer.find('#minutes');
var $bestTimeContainer = $timer.find('.time');
var minutes, seconds;
function decorateNumber(value) {
return value > 9 ? value : '0' + value;
}
return function() {
var interval;
var storage = new BRAINYMO.Storage();
this.startTimer = function() {
var sec = 0;
var bestTime;
// Set timer interval
interval = setInterval( function() {
seconds = ++sec % 60;
minutes = parseInt(sec / 60, 10);
$seconds.html(decorateNumber(seconds));
$minutes.html(decorateNumber(minutes));
}, 1000);
// Show timer
$timer.delay(1000).fadeIn();
this.updateBestTime();
};
this.updateBestTime = function() {
// Check if user have saved best game time
bestTime = storage.retrieveBestTime();
if(bestTime != undefined && bestTime != '') {
$bestTimeContainer
.find('#bestTime')
.text(bestTime.minutes + ':' + bestTime.seconds)
.end()
.fadeIn();
}
};
this.stopTimer = function() {
clearInterval(interval);
};
this.retrieveTime = function() {
return {
minutes: decorateNumber(minutes),
seconds: decorateNumber(seconds)
}
};
}
})();
BRAINYMO.Storage = (function() {
return function() {
/**
* Save best time to localStorage
* key = 'bestTime'
* @param {Object} time - object with keys: 'minutes', 'seconds'
*/
this.setBestTime = function(time) {
localStorage.setItem('bestTime', JSON.stringify(time));
};
/**
* Retrieve best time from localStorage
*/
this.retrieveBestTime = function() {
return JSON.parse(localStorage.getItem('bestTime'));
};
}
})();
// Game init
$(function() {
var brainymo = new BRAINYMO.Game({
cards: [
{
backImg: 'https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcSexUDniZ8qYHFpbK4Xyjd4Vs_Fx60Zwe7_5INiYN5H5dNNWiJZ',
connectionID: 1
},
{
backTxt: 'GRUNT',
connectionID: 1
},
{
backImg: 'https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcQS13Kjh3SeT8Fmcy73l5FKRiH8Tcq9w9SIAddixX-XHwODxe5C',
connectionID: 2
},
{
backTxt: 'REACT',
connectionID: 2
},
{
backImg: 'https://gravatar.com/avatar/5a224f121f96bd037bf6c1c1e2b686fb?s=512&d=https://codepen.io/assets/avatars/user-avatar-512x512-6e240cf350d2f1cc07c2bed234c3a3bb5f1b237023c204c782622e80d6b212ba.png',
connectionID: 3
},
{
backTxt: 'GSAP',
connectionID: 3
},
{
backImg: 'http://richardgmartin.me/wp-content/uploads/2014/11/ember-mascot.jpeg',
connectionID: 4
},
{
backTxt: 'EMBER',
connectionID: 4
},
{
backImg: 'https://odoruinu.files.wordpress.com/2014/11/3284117.png',
connectionID: 5
},
{
backTxt: 'KARMA',
connectionID: 5
},
{
backImg: 'https://cdn.auth0.com/blog/webpack/logo.png',
connectionID: 6
},
{
backTxt: 'WEBPACK',
connectionID: 6
},
{
backImg: 'https://res.cloudinary.com/teepublic/image/private/s--JnfxjOP1--/t_Resized%20Artwork/c_fit,g_north_west,h_1054,w_1054/co_ffffff,e_outline:53/co_ffffff,e_outline:inner_fill:53/co_bbbbbb,e_outline:3:1000/c_mpad,g_center,h_1260,w_1260/b_rgb:eeeeee/c_limit,f_jpg,h_630,q_90,w_630/v1509564403/production/designs/2016815_1.jpg',
connectionID: 7
},
{
backTxt: 'ANGULAR',
connectionID: 7
},
{
backImg: 'https://smyl.es/wurdp/assets/mongodb.png',
connectionID: 8
},
{
backTxt: 'MONGO DB',
connectionID: 8
},
]
});
$('#btn-start').click(function() {
brainymo.generateCardSet();
$(this).text('Restart');
});
});
!
999px
🕑 One or more of the npm packages you are using needs to be built. You're the first person to ever need it! We're building it right now and your preview will start updating again when it's ready.
Console
|
__label__pos
| 0.978731 |
1 Star 0 Fork 0
白一梓 / async-tutorial-code
Create your Gitee Account
Explore and code with more than 6 million developers，Free private repositories ！：）
Sign up
This repository doesn't specify license. Without author's permission, this code is only for learning and cannot be used for other purposes.
Clone or Download
hello.cc 4.15 KB
Copy Edit Web IDE Raw Blame History
白一梓 authored 2015-05-14 17:39 . 增加对于node0.12.x的扩展支持
#include <node.h>
#include <string>
#ifdef WINDOWS_SPECIFIC_DEFINE
#include <windows.h>
typedef DWORD ThreadId;
#else
#include <unistd.h>
#include <pthread.h>
typedef unsigned int ThreadId;
#endif
using namespace v8;
Handle<Value> async_hello(const Arguments& args);
//不在js主线程，，在uv线程池内被调用
void call_work(uv_work_t* req);
//回调函数
void call_work_after(uv_work_t* req);
static ThreadId __getThreadId() {
ThreadId nThreadID;
#ifdef WINDOWS_SPECIFIC_DEFINE
nThreadID = GetCurrentProcessId();
nThreadID = (nThreadID << 16) + GetCurrentThreadId();
#else
nThreadID = getpid();
nThreadID = (nThreadID << 16) + pthread_self();
#endif
return nThreadID;
}
static void __tsleep(unsigned int millisecond) {
#ifdef WINDOWS_SPECIFIC_DEFINE
::Sleep(millisecond);
#else
usleep(millisecond*1000);
#endif
}
//定义一个结构体，存储异步请求信息
struct Baton {
//存储回调函数，使用Persistent来声明，让系统不会在函数结束后自动回收
//当回调成功后，需要执行dispose释放空间
Persistent<Function> callback;
// 错误控制，保护错误信息和错误状态
bool error;
std::string error_message;
//存储js传入的参数，字符串
std::string input_string;
//存放返回参数，字符串
std::string result;
};
Handle<Value> async_hello(const Arguments& args) {
printf("\n%s Thread id : gettid() == %d\n",__FUNCTION__,__getThreadId());
HandleScope scope;
if(args.Length() < 2) {
ThrowException(Exception::TypeError(String::New("Wrong number of arguments")));
return scope.Close(Undefined());
}
if (!args[0]->IsString() || !args[1]->IsFunction()) {
return ThrowException(Exception::TypeError(
String::New("Wrong number of arguments")));
}
// 强制转换成函数变量
Local<Function> callback = Local<Function>::Cast(args[1]);
Baton* baton = new Baton();
baton->error = false;
baton->callback = Persistent<Function>::New(callback);
v8::String::Utf8Value param1(args[0]->ToString());
baton->input_string = std::string(*param1);
uv_work_t *req = new uv_work_t();
req->data = baton;
int status = uv_queue_work(uv_default_loop(), req, call_work,
(uv_after_work_cb)call_work_after);
assert(status == 0);
return Undefined();
}
//在该函数内模拟处理过程 ，如i/o阻塞或者cpu高消耗情形的处理。
// 注意不能使用v8 api,这个线程不是在js主线程内
void call_work(uv_work_t* req) {
printf("\n%s Thread id : gettid() == %d\n",__FUNCTION__,__getThreadId());
Baton* baton = static_cast<Baton*>(req->data);
for (int i=0;i<15;i++) {
__tsleep(1000);
printf("sleep 1 seconds in uv_work\n");
}
baton->result = baton->input_string+ "--->hello world from c++";
}
//执行完任务，进行回调的时候，返回到 js主线程
void call_work_after(uv_work_t* req) {
printf("\n%s Thread id : gettid() == %d\n",__FUNCTION__,__getThreadId());
HandleScope scope;
Baton* baton = static_cast<Baton*>(req->data);
if (baton->error) {
Local<Value> err = Exception::Error(String::New(baton->error_message.c_str()));
// 准备回调函数的参数
const unsigned argc = 1;
Local<Value> argv[argc] = { err };
//捕捉回调中的错误，在Node环境中可利用process.on('uncaughtException')捕捉错误
TryCatch try_catch;
baton->callback->Call(Context::GetCurrent()->Global(), argc, argv);
if (try_catch.HasCaught()) {
node::FatalException(try_catch);
}
} else {
const unsigned argc = 2;
Local<Value> argv[argc] = {
Local<Value>::New(Null()),
Local<Value>::New(String::New(baton->result.c_str()))
};
TryCatch try_catch;
baton->callback->Call(Context::GetCurrent()->Global(), argc, argv);
if (try_catch.HasCaught()) {
node::FatalException(try_catch);
}
}
//注意一定释放
baton->callback.Dispose();
// 处理完毕，清除对象和空间
delete baton;
delete req;
}
void RegisterModule(Handle<Object> target) {
target->Set(String::NewSymbol("async_hello"),FunctionTemplate::New(async_hello)->GetFunction());
}
NODE_MODULE(binding, RegisterModule);
Comment ( 0 )
Sign in to post a comment
JavaScript
1
https://git.oschina.net/yunnysunny/async-tutorial-code.git
[email protected]:yunnysunny/async-tutorial-code.git
yunnysunny
async-tutorial-code
async-tutorial-code
master
Search
|
__label__pos
| 0.980339 |
Image for post
Image for post
On counting and Cantor’s Theorem
Recently I’ve been studying discrete mathematics and one of the things that amazed me was how difficult is for humans (at least this one) to get a grasp of the concept of infinity. The discovery made by Cantor was really groundbreaking at the time and it’s amazing to think about how he was able to come up with it, seeing beyond a concept so complex as infinity.
I decided to give a try explaining this in order to consolidate my understanding and hoping that somebody finds my explanation useful.
Before jumping right into the theorem itself, let me give you a little bit of background on set theory.
The cardinality of a set is a measure of the set’s size, meaning, the number of elements that belong to it. We can obtain the cardinality of a set A by counting each of the elements. Let’s say that set A = {9, 2, 5}, we would then proceed to count the number of elements in A.
Image for post
Image for post
In this case, we say the cardinality of A, expressed as |A|, is equal to 3.
When comparing the cardinality of two sets, say set A and set B, we can obtain each of them individually and then compare them.
Alternatively, we can pair each element in the sets in a 1 to 1 relationship, where each element in set A is paired with one and only one element in set B and vice versa, if we are able to come up with such a relationship we know both sets have the same cardinality.
Image for post
Image for post
We can think of this pairing process as a generalization of counting, if you think about it when counting elements in a set A with |A| = n we are trying to match each of the elements of A with the elements of a subset of the set of natural numbers N, namely the set of numbers from 1 to n.
This technique to compare sets is powerful because it allows us to compare the size of sets which sizes are unknown; imagine you are at the theater and you notice all the seats are taken and there is no person standing up you know the cardinality of the set of seats is the same as the cardinality of the set of people in the theater.
Infinite Sets
Think about the process of counting I mentioned above, there are some sets for which we simply cannot choose a natural number n to pair its elements to the set of numbers from 1 to n. Think about the set of ALL natural numbers N; it doesn’t matter which n you choose, the set N will always contain an element to pair with n + 1, so we say that a given set A is infinite if there is no number n for which we can establish a 1 to 1 relationship between the elements in A and the elements in the set of numbers between 1 and n. Of course, there are many of these infinite sets out there: the set Z of integers, the set Q of rational numbers, to name a few.
It’s interesting to observe that even subsets of one of these infinite sets are infinite themselves, let’s take for example the set of even natural numbers, we know that this set must be a proper subset of N, but actually, we can easily pair the set N with the set of even natural numbers in such a way that proves they actually have the same cardinality!
We just need to pair each element n in N with an element that is equal to 2n:
Image for post
Image for post
Sets that can be paired in this way with the set N of natural numbers are called appropriately countable sets, some authors may use countable set to mean infinite countable alone. To avoid this ambiguity, the term at most countable may be used when finite sets are included and countably infinite, enumerable, denumerable otherwise.
The Powerset
The last concept I want to talk you about before jumping in Cantor’s Theorem is the powerset, the powerset of a set A, denoted by P(A), is the set of all the subsets of A. Let’s say we got a set A = { 1, 2, 3 }, then P(A) = { ∅, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3} }.
Cantor’s Theorem
Let’s imagine Bob & Alice are immortal, Bob offers Alice a great prize if she can guess the integer he is thinking about (either negative or positive), but she has only one single guess per day. Take a moment to think about a strategy that guarantees Alice to eventually get the prize.
Given that we know that the set Z of integers is denumerable, we definitely can come up with such a strategy: On day one Alice will try with 1, on day two with -1, on day three with 2, on day four she tries with -2 and so on, alternating the numbers in this way guarantees that Alice eventually will guess Bob’s number.
Notice that it is important to alternate between positive and negative numbers, if we try with positive (or negative) numbers first Alice will never guess the number in case it’s negative (or positive) because both sets are infinite.
What Cantor discovered is that for any set A the cardinality of its powerset P(A) is strictly greater than the set A itself. On finite sets this is easily proven by enumerating the elements of P(A), if n is the size of A then |P(A)| = 2ⁿ.
Cantor’s theorem is of fundamental importance because it holds for any set A whether finite or infinite. This has the implication that the powerset of the set of natural numbers P(N) is uncountable; there is no way we can pair P(N) with N in such a way that all elements of P(N) are paired with an element of N simply because |P(N)| > |N|. We can easily prove this with another imaginary experiment:
Think about a book with infinite enumerated pages and on each of these pages we write down one of the subsets of N, without even looking at any attempt of this we know there is a subset of N which cannot possibly be listed in ANY page of the book; let’s say that for each page number b of the book we call it extraordinary if b is contained in the subset of N listed on page b and ordinary if it’s not. Now we can construct a set B of all ordinary numbers since all the subsets of N must be in the book this subset clearly must exist somewhere in the book. If b ∉ B then b is ordinary and should be contained in B, but on the other hand if b ∈ B it means that b is extraordinary and should not be present in B.
With this paradox we prove that is not possible to count P(N) because it’s cardinality is strictly larger than N’s, P(P(N)) being greater than P(N) and P(P(P(N))) greater than P(P(N)) and so on to the infinite.
For me, it’s really amazing to discover this kind of stuff because it makes me just wonder how little we actually know about math and in a sense about our reality and just motivates me to learn a little bit more. Hopefully, this helps you understand Cantor’s theorem better.
Android & Blockchain Engineer, amateur Body Builder and full time animal lover.
Get the Medium app
A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
|
__label__pos
| 0.975716 |
Gyata.ai Logo
Python (513) Javascript (1034) HTML5 (615) CSS (534) PHP (861) Object-oriented Programming (120) SQL (455) React (280) Java (286) C++ (384) C (240) Node.js (542) Data Structure (172) WordPress (226) jQuery (326) Angular (395) Google Ads (172) .NET (268) Django (253) Digital Marketing (281) TypeScript (372) Redux (268) C# (214) Kotlin (290) MongoDB (389) Laravel (303) Swift (172) Git (248) Cloud Computing (286) Agile/Scrum (208) ASP.NET (414) UI/UX Design (170) Analytics (258) Linux (252) AWS (128) Search Engine Optimization (936) Github (240) Bootstrap (264) Machine Learning (237) Project Management (393) REST API (270) Oracle (264) Excel (276) Adobe Photoshop (232) Data Science (235) Artificial Intelligence (262) Vue.js (360) Hadoop (244) GoLang (349) Rust (316) Scala (262) R (226) Perl (258) Solidity (252) Ruby on Rails (246) Augmented Reality (218) VidGenesis (1320) Virtual Reality (88) Unreal Engine (78) Branding (89) Entrepreneurship (66) Product Management (83) Prompt Engineer (53)
Home / React / API de React JS
API de React JS
By Team Gyata | Updated on Feb 19, 2024
React JS API
Introducción
React es una popular biblioteca de JavaScript para construir interfaces de usuario, especialmente para aplicaciones de una sola página. Se utiliza para manejar la capa de vista en aplicaciones web y móviles. React te permite diseñar vistas simples para cada estado en tu aplicación, y actualizará y renderizará eficientemente los componentes correctos cuando tus datos cambien.
Una de las características clave de React es la capacidad para crear componentes, tanto componentes funcionales como de clase, para construir tu aplicación. Estos componentes son reutilizables, lo que hace que tu código sea más legible y mantenible. Además, React proporciona una serie de APIs para trabajar con estos componentes y manejar su ciclo de vida, estado y props.
API de Componente de React
• Los componentes son los bloques de construcción de cualquier aplicación de React, y una sola aplicación generalmente consta de varios componentes. Estos componentes pueden ser componentes de clase o componentes funcionales. Los componentes de clase son clases ES6 que se extienden desde React.Component, lo que significa que heredan métodos de él. Los componentes funcionales son más simples y se definen utilizando una simple función de JavaScript o una función de flecha.
•
// Componente de Clase
class Welcome extends React.Component {
render() {
return
Hola, {this.props.name}
; } } // Componente Funcional function Welcome(props) { return
Hola, {props.name}
; }
Estado y Props
• En React, tanto las props como el estado son objetos de JavaScript simples. Mientras ambos contienen información que influye en la salida de render, son diferentes en su funcionalidad con respecto al componente. Las props se pasan al componente similar a los parámetros de función, mientras que el estado se gestiona dentro del componente similar a las variables declaradas dentro de una función.
•
class Welcome extends React.Component {
constructor(props) {
super(props);
this.state = { name: 'John' };
}
render() {
return
Hola, {this.state.name}
; } }
Métodos del Ciclo de Vida
• Cada componente en React tiene un ciclo de vida que puedes monitorear y manipular durante sus tres fases principales: Montaje, Actualización y Desmontaje. Los métodos que puedes usar durante estas fases se llaman métodos del ciclo de vida.
•
class Welcome extends React.Component {
constructor(props) {
super(props);
this.state = { name: 'John' };
}
componentDidMount() {
console.log('El componente se montó');
}
componentDidUpdate() {
console.log('El componente se actualizó');
}
componentWillUnmount() {
console.log('El componente se desmontará');
}
render() {
return
Hola, {this.state.name}
; } }
Casos propensos a errores comunes y consejos para evitarlos
• No usar claves al renderizar varios componentes: Cuando renderizas varios componentes como una lista, React necesita una clave para diferenciar cada componente. No usar claves puede llevar a un comportamiento inesperado en tu aplicación.
•
// Mal
{this.state.users.map(user => )}
// Bien
{this.state.users.map(user => )}
• Mutar el estado directamente: En React, no debes mutar el estado directamente. En su lugar, usa el método setState para actualizar el estado.
•
// Mal
this.state.name = 'John';
// Bien
this.setState({ name: 'John' });
• No vincular métodos en componentes de clase: Si estás utilizando componentes de clase y estás utilizando métodos que usan 'this', debes vincular el método en el constructor. De lo contrario, 'this' será indefinido.
•
constructor(props) {
super(props);
this.state = { name: 'John' };
this.handleClick = this.handleClick.bind(this);
}
handleClick() {
console.log(this.state.name);
}
Estas son las características básicas y las trampas comunes de React. Al entender estos, puedes construir aplicaciones potentes y eficientes con React.
|
__label__pos
| 0.887 |
You are viewing documentation for version 3 of the AWS SDK for Ruby. Version 2 documentation can be found here.
Class: Aws::Glue::Types::DeletePartitionRequest
Inherits:
Struct
• Object
show all
Defined in:
gems/aws-sdk-glue/lib/aws-sdk-glue/types.rb
Overview
Note:
When making an API call, you may pass DeletePartitionRequest data as a hash:
{
catalog_id: "CatalogIdString",
database_name: "NameString", # required
table_name: "NameString", # required
partition_values: ["ValueString"], # required
}
Instance Attribute Summary collapse
Instance Attribute Details
#catalog_idString
The ID of the Data Catalog where the partition to be deleted resides. If none is supplied, the AWS account ID is used by default.
Returns:
• (String)
2371
2372
2373
2374
2375
2376
2377
# File 'gems/aws-sdk-glue/lib/aws-sdk-glue/types.rb', line 2371
class DeletePartitionRequest < Struct.new(
:catalog_id,
:database_name,
:table_name,
:partition_values)
include Aws::Structure
end
#database_nameString
The name of the catalog database in which the table in question resides.
Returns:
• (String)
2371
2372
2373
2374
2375
2376
2377
# File 'gems/aws-sdk-glue/lib/aws-sdk-glue/types.rb', line 2371
class DeletePartitionRequest < Struct.new(
:catalog_id,
:database_name,
:table_name,
:partition_values)
include Aws::Structure
end
#partition_valuesArray<String>
The values that define the partition.
Returns:
• (Array<String>)
2371
2372
2373
2374
2375
2376
2377
# File 'gems/aws-sdk-glue/lib/aws-sdk-glue/types.rb', line 2371
class DeletePartitionRequest < Struct.new(
:catalog_id,
:database_name,
:table_name,
:partition_values)
include Aws::Structure
end
#table_nameString
The name of the table where the partition to be deleted is located.
Returns:
• (String)
2371
2372
2373
2374
2375
2376
2377
# File 'gems/aws-sdk-glue/lib/aws-sdk-glue/types.rb', line 2371
class DeletePartitionRequest < Struct.new(
:catalog_id,
:database_name,
:table_name,
:partition_values)
include Aws::Structure
end
|
__label__pos
| 0.990342 |
Workflow-0.5.8.1: library for transparent execution of interruptible computations
Control.Workflow.Text.Patterns
Contents
Description
This module contains monadic combinators that express some workflow patterns. see the docAprobal.hs example included in the package
Here the constraint `DynSerializer w r a` is equivalent to `Data.Refserialize a` This version permits optimal (de)serialization if you store in the queue different versions of largue structures, for example, documents. You must define the right RefSerialize instance however. See an example in docAprobal.hs incuded in the paclkage. Alternatively you can use Data.Binary serlializatiion with Control.Workflow.Binary.Patterns
EXAMPLE:
This fragment below describes the approbal procedure of a document. First the document reference is sent to a list of bosses trough a queue. ithey return a boolean in a return queue ( askUser) the booleans are summed up according with a monoid instance (sumUp)
if the resullt is false, the correctWF workflow is executed If the result is True, the pipeline continues to the next stage (checkValidated)
the next stage is the same process with a new list of users (superbosses). This time, there is a timeout of 7 days. the result of the users that voted is summed up according with the same monoid instance
if the result is true the document is added to the persistent list of approbed documents if the result is false, the document is added to the persistent list of rejectec documents (checlkValidated1)
docApprobal :: Document -> Workflow IO ()
docApprobal doc = getWFRef >>= docApprobal1
docApprobal1 rdoc=
return True >>=
log "requesting approbal from bosses" >>=
sumUp 0 (map (askUser doc rdoc) bosses) >>=
checkValidated >>=
log "requesting approbal from superbosses or timeout" >>=
sumUp (7*60*60*24) (map(askUser doc rdoc) superbosses) >>=
checkValidated1
askUser _ _ user False = return False
askUser doc rdoc user True = do
step $ push (quser user) rdoc
logWF (wait for any response from the user: ++ user)
step . pop $ qdocApprobal (title doc)
log txt x = logWF txt >> return x
checkValidated :: Bool -> Workflow IO Bool
checkValidated val =
case val of
False -> correctWF (title doc) rdoc >> return False
_ -> return True
checkValidated1 :: Bool -> Workflow IO ()
checkValidated1 val = step $ do
case val of
False -> push qrejected doc
_ -> push qapproved doc
mapM (u ->deleteFromQueue (quser u) rdoc) superbosses
Synopsis
Low level combinators
split :: (Typeable b, DynSerializer w r (Maybe b), HasFork io, MonadCatchIO io) => [a -> Workflow io b] -> a -> Workflow io [ActionWF b]Source
spawn a list of independent workflows (the first argument) with a seed value (the second argument). Their results are reduced by merge or select
merge :: (MonadIO io, Typeable a, Typeable b, TwoSerializer w r (Maybe a) b) => ([a] -> io b) -> [ActionWF a] -> Workflow io bSource
wait for the results and apply the cond to produce a single output in the Workflow monad
select :: (TwoSerializer w r (Maybe a) [a], Typeable a, HasFork io, MonadCatchIO io) => Integer -> (a -> io Select) -> [ActionWF a] -> Workflow io [a]Source
select the outputs of the workflows produced by split constrained within a timeout. The check filter, can select , discard or finish the entire computation before the timeout is reached. When the computation finalizes, it stop all the pending workflows and return the list of selected outputs the timeout is in seconds and is no limited to Int values, so it can last for years.
This is necessary for the modelization of real-life institutional cycles such are political elections timeout of 0 means no timeout.
High level conbinators
vote :: (TwoSerializer w r (Maybe b) [b], Typeable b, HasFork io, MonadCatchIO io) => Integer -> [a -> Workflow io b] -> ([b] -> Workflow io c) -> a -> Workflow io cSource
spawn a list of workflows and reduces the results according with the comp parameter within a given timeout
vote timeout actions comp x=
split actions x >>= select timeout (const $ return Select) >>= comp
sumUp :: (TwoSerializer w r (Maybe b) [b], Typeable b, Monoid b, HasFork io, MonadCatchIO io) => Integer -> [a -> Workflow io b] -> a -> Workflow io bSource
sum the outputs of a list of workflows according with its monoid definition
sumUp timeout actions = vote timeout actions (return . mconcat)
|
__label__pos
| 0.769114 |
A WordPress-centric search engine for devs and theme authors
wp_add_dashboard_widget ›
Since2.7.0
Deprecatedn/a
wp_add_dashboard_widget ( $widget_id, $widget_name, $callback, $control_callback = null, $callback_args = null )
Parameters: (5)
• (string) $widget_id Widget ID (used in the 'id' attribute for the widget).
Required: Yes
• (string) $widget_name Title of the widget.
Required: Yes
• (callable) $callback Function that fills the widget with the desired content. The function should echo its output.
Required: Yes
• (callable) $control_callback Optional. Function that outputs controls for the widget. Default null.
Required: No
Default: null
• (array) $callback_args Optional. Data that should be set as the $args property of the widget array (which is the second parameter passed to your callback). Default null.
Required: No
Default: null
Defined at:
Codex:
Adds a new dashboard widget.
Source
function wp_add_dashboard_widget( $widget_id, $widget_name, $callback, $control_callback = null, $callback_args = null ) {
$screen = get_current_screen();
global $wp_dashboard_control_callbacks;
$private_callback_args = array( '__widget_basename' => $widget_name );
if ( is_null( $callback_args ) ) {
$callback_args = $private_callback_args;
} elseif ( is_array( $callback_args ) ) {
$callback_args = array_merge( $callback_args, $private_callback_args );
}
if ( $control_callback && current_user_can( 'edit_dashboard' ) && is_callable( $control_callback ) ) {
$wp_dashboard_control_callbacks[ $widget_id ] = $control_callback;
if ( isset( $_GET['edit'] ) && $widget_id == $_GET['edit'] ) {
list($url) = explode( '#', add_query_arg( 'edit', false ), 2 );
$widget_name .= ' <span class="postbox-title-action"><a href="' . esc_url( $url ) . '">' . __( 'Cancel' ) . '</a></span>';
$callback = '_wp_dashboard_control_callback';
} else {
list($url) = explode( '#', add_query_arg( 'edit', $widget_id ), 2 );
$widget_name .= ' <span class="postbox-title-action"><a href="' . esc_url( "$url#$widget_id" ) . '" class="edit-box open-box">' . __( 'Configure' ) . '</a></span>';
}
}
$side_widgets = array( 'dashboard_quick_press', 'dashboard_primary' );
$location = 'normal';
if ( in_array( $widget_id, $side_widgets ) ) {
$location = 'side';
}
$high_priority_widgets = array( 'dashboard_browser_nag', 'dashboard_php_nag' );
$priority = 'core';
if ( in_array( $widget_id, $high_priority_widgets, true ) ) {
$priority = 'high';
}
add_meta_box( $widget_id, $widget_name, $callback, $screen, $location, $priority, $callback_args );
}
|
__label__pos
| 0.994583 |
symmetry
symmetry
In geometry, the property by which the sides of a figure or object reflect each other across a line (axis of symmetry) or surface; in biology, the orderly repetition of parts of an animal or plant; in chemistry, a fundamental property of orderly arrangements of atoms in molecules or crystals; in physics, a concept of balance illustrated by such fundamental laws as the third of Newton's laws of motion. Symmetry in nature underlies one of the most fundamental concepts of beauty. It connotes balance, order, and thus, to some, a type of divine principle.
This entry comes from Encyclopædia Britannica Concise.
For the full entry on symmetry, visit Britannica.com.
Seen & Heard
What made you look up symmetry? Please tell us what you were reading, watching or discussing that led you here.
|
__label__pos
| 0.791338 |
Jeroen Demeyer on Tue, 24 Mar 2009 11:23:06 +0100
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
Re: factor_add_primes logic
Bill Allombert wrote:
The point of factor_add_primes as you described, scenarii 1 and 2.
But my question remains: why would you only want to support scenarios 1 and 2 and NOT scenario 3?
I agree that the current implementation is not perfect, but that is a different issue, independent from the above question.
Jeroen.
|
__label__pos
| 0.695551 |
blob: ee02b30878ed4bec733af6cbd9aa152eefe22d0f [file] [log] [blame]
/*
* Copyright (C) 2011. Freescale Inc. All rights reserved.
*
* Authors:
* Alexander Graf <[email protected]>
* Paul Mackerras <[email protected]>
*
* Description:
*
* Hypercall handling for running PAPR guests in PR KVM on Book 3S
* processors.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License, version 2, as
* published by the Free Software Foundation.
*/
#include <linux/anon_inodes.h>
#include <asm/uaccess.h>
#include <asm/kvm_ppc.h>
#include <asm/kvm_book3s.h>
static unsigned long get_pteg_addr(struct kvm_vcpu *vcpu, long pte_index)
{
struct kvmppc_vcpu_book3s *vcpu_book3s = to_book3s(vcpu);
unsigned long pteg_addr;
pte_index <<= 4;
pte_index &= ((1 << ((vcpu_book3s->sdr1 & 0x1f) + 11)) - 1) << 7 | 0x70;
pteg_addr = vcpu_book3s->sdr1 & 0xfffffffffffc0000ULL;
pteg_addr |= pte_index;
return pteg_addr;
}
static int kvmppc_h_pr_enter(struct kvm_vcpu *vcpu)
{
long flags = kvmppc_get_gpr(vcpu, 4);
long pte_index = kvmppc_get_gpr(vcpu, 5);
unsigned long pteg[2 * 8];
unsigned long pteg_addr, i, *hpte;
pte_index &= ~7UL;
pteg_addr = get_pteg_addr(vcpu, pte_index);
copy_from_user(pteg, (void __user *)pteg_addr, sizeof(pteg));
hpte = pteg;
if (likely((flags & H_EXACT) == 0)) {
pte_index &= ~7UL;
for (i = 0; ; ++i) {
if (i == 8)
return H_PTEG_FULL;
if ((*hpte & HPTE_V_VALID) == 0)
break;
hpte += 2;
}
} else {
i = kvmppc_get_gpr(vcpu, 5) & 7UL;
hpte += i * 2;
}
hpte[0] = kvmppc_get_gpr(vcpu, 6);
hpte[1] = kvmppc_get_gpr(vcpu, 7);
copy_to_user((void __user *)pteg_addr, pteg, sizeof(pteg));
kvmppc_set_gpr(vcpu, 3, H_SUCCESS);
kvmppc_set_gpr(vcpu, 4, pte_index | i);
return EMULATE_DONE;
}
static int kvmppc_h_pr_remove(struct kvm_vcpu *vcpu)
{
unsigned long flags= kvmppc_get_gpr(vcpu, 4);
unsigned long pte_index = kvmppc_get_gpr(vcpu, 5);
unsigned long avpn = kvmppc_get_gpr(vcpu, 6);
unsigned long v = 0, pteg, rb;
unsigned long pte[2];
pteg = get_pteg_addr(vcpu, pte_index);
copy_from_user(pte, (void __user *)pteg, sizeof(pte));
if ((pte[0] & HPTE_V_VALID) == 0 ||
((flags & H_AVPN) && (pte[0] & ~0x7fUL) != avpn) ||
((flags & H_ANDCOND) && (pte[0] & avpn) != 0)) {
kvmppc_set_gpr(vcpu, 3, H_NOT_FOUND);
return EMULATE_DONE;
}
copy_to_user((void __user *)pteg, &v, sizeof(v));
rb = compute_tlbie_rb(pte[0], pte[1], pte_index);
vcpu->arch.mmu.tlbie(vcpu, rb, rb & 1 ? true : false);
kvmppc_set_gpr(vcpu, 3, H_SUCCESS);
kvmppc_set_gpr(vcpu, 4, pte[0]);
kvmppc_set_gpr(vcpu, 5, pte[1]);
return EMULATE_DONE;
}
/* Request defs for kvmppc_h_pr_bulk_remove() */
#define H_BULK_REMOVE_TYPE 0xc000000000000000ULL
#define H_BULK_REMOVE_REQUEST 0x4000000000000000ULL
#define H_BULK_REMOVE_RESPONSE 0x8000000000000000ULL
#define H_BULK_REMOVE_END 0xc000000000000000ULL
#define H_BULK_REMOVE_CODE 0x3000000000000000ULL
#define H_BULK_REMOVE_SUCCESS 0x0000000000000000ULL
#define H_BULK_REMOVE_NOT_FOUND 0x1000000000000000ULL
#define H_BULK_REMOVE_PARM 0x2000000000000000ULL
#define H_BULK_REMOVE_HW 0x3000000000000000ULL
#define H_BULK_REMOVE_RC 0x0c00000000000000ULL
#define H_BULK_REMOVE_FLAGS 0x0300000000000000ULL
#define H_BULK_REMOVE_ABSOLUTE 0x0000000000000000ULL
#define H_BULK_REMOVE_ANDCOND 0x0100000000000000ULL
#define H_BULK_REMOVE_AVPN 0x0200000000000000ULL
#define H_BULK_REMOVE_PTEX 0x00ffffffffffffffULL
#define H_BULK_REMOVE_MAX_BATCH 4
static int kvmppc_h_pr_bulk_remove(struct kvm_vcpu *vcpu)
{
int i;
int paramnr = 4;
int ret = H_SUCCESS;
for (i = 0; i < H_BULK_REMOVE_MAX_BATCH; i++) {
unsigned long tsh = kvmppc_get_gpr(vcpu, paramnr+(2*i));
unsigned long tsl = kvmppc_get_gpr(vcpu, paramnr+(2*i)+1);
unsigned long pteg, rb, flags;
unsigned long pte[2];
unsigned long v = 0;
if ((tsh & H_BULK_REMOVE_TYPE) == H_BULK_REMOVE_END) {
break; /* Exit success */
} else if ((tsh & H_BULK_REMOVE_TYPE) !=
H_BULK_REMOVE_REQUEST) {
ret = H_PARAMETER;
break; /* Exit fail */
}
tsh &= H_BULK_REMOVE_PTEX | H_BULK_REMOVE_FLAGS;
tsh |= H_BULK_REMOVE_RESPONSE;
if ((tsh & H_BULK_REMOVE_ANDCOND) &&
(tsh & H_BULK_REMOVE_AVPN)) {
tsh |= H_BULK_REMOVE_PARM;
kvmppc_set_gpr(vcpu, paramnr+(2*i), tsh);
ret = H_PARAMETER;
break; /* Exit fail */
}
pteg = get_pteg_addr(vcpu, tsh & H_BULK_REMOVE_PTEX);
copy_from_user(pte, (void __user *)pteg, sizeof(pte));
/* tsl = AVPN */
flags = (tsh & H_BULK_REMOVE_FLAGS) >> 26;
if ((pte[0] & HPTE_V_VALID) == 0 ||
((flags & H_AVPN) && (pte[0] & ~0x7fUL) != tsl) ||
((flags & H_ANDCOND) && (pte[0] & tsl) != 0)) {
tsh |= H_BULK_REMOVE_NOT_FOUND;
} else {
/* Splat the pteg in (userland) hpt */
copy_to_user((void __user *)pteg, &v, sizeof(v));
rb = compute_tlbie_rb(pte[0], pte[1],
tsh & H_BULK_REMOVE_PTEX);
vcpu->arch.mmu.tlbie(vcpu, rb, rb & 1 ? true : false);
tsh |= H_BULK_REMOVE_SUCCESS;
tsh |= (pte[1] & (HPTE_R_C | HPTE_R_R)) << 43;
}
kvmppc_set_gpr(vcpu, paramnr+(2*i), tsh);
}
kvmppc_set_gpr(vcpu, 3, ret);
return EMULATE_DONE;
}
static int kvmppc_h_pr_protect(struct kvm_vcpu *vcpu)
{
unsigned long flags = kvmppc_get_gpr(vcpu, 4);
unsigned long pte_index = kvmppc_get_gpr(vcpu, 5);
unsigned long avpn = kvmppc_get_gpr(vcpu, 6);
unsigned long rb, pteg, r, v;
unsigned long pte[2];
pteg = get_pteg_addr(vcpu, pte_index);
copy_from_user(pte, (void __user *)pteg, sizeof(pte));
if ((pte[0] & HPTE_V_VALID) == 0 ||
((flags & H_AVPN) && (pte[0] & ~0x7fUL) != avpn)) {
kvmppc_set_gpr(vcpu, 3, H_NOT_FOUND);
return EMULATE_DONE;
}
v = pte[0];
r = pte[1];
r &= ~(HPTE_R_PP0 | HPTE_R_PP | HPTE_R_N | HPTE_R_KEY_HI |
HPTE_R_KEY_LO);
r |= (flags << 55) & HPTE_R_PP0;
r |= (flags << 48) & HPTE_R_KEY_HI;
r |= flags & (HPTE_R_PP | HPTE_R_N | HPTE_R_KEY_LO);
pte[1] = r;
rb = compute_tlbie_rb(v, r, pte_index);
vcpu->arch.mmu.tlbie(vcpu, rb, rb & 1 ? true : false);
copy_to_user((void __user *)pteg, pte, sizeof(pte));
kvmppc_set_gpr(vcpu, 3, H_SUCCESS);
return EMULATE_DONE;
}
static int kvmppc_h_pr_put_tce(struct kvm_vcpu *vcpu)
{
unsigned long liobn = kvmppc_get_gpr(vcpu, 4);
unsigned long ioba = kvmppc_get_gpr(vcpu, 5);
unsigned long tce = kvmppc_get_gpr(vcpu, 6);
long rc;
rc = kvmppc_h_put_tce(vcpu, liobn, ioba, tce);
if (rc == H_TOO_HARD)
return EMULATE_FAIL;
kvmppc_set_gpr(vcpu, 3, rc);
return EMULATE_DONE;
}
int kvmppc_h_pr(struct kvm_vcpu *vcpu, unsigned long cmd)
{
switch (cmd) {
case H_ENTER:
return kvmppc_h_pr_enter(vcpu);
case H_REMOVE:
return kvmppc_h_pr_remove(vcpu);
case H_PROTECT:
return kvmppc_h_pr_protect(vcpu);
case H_BULK_REMOVE:
return kvmppc_h_pr_bulk_remove(vcpu);
case H_PUT_TCE:
return kvmppc_h_pr_put_tce(vcpu);
case H_CEDE:
vcpu->arch.shared->msr |= MSR_EE;
kvm_vcpu_block(vcpu);
clear_bit(KVM_REQ_UNHALT, &vcpu->requests);
vcpu->stat.halt_wakeup++;
return EMULATE_DONE;
}
return EMULATE_FAIL;
}
|
__label__pos
| 0.945828 |
Parcel Parser
On the last episode, I described how to label chunks of code for processing through a parser. Strings are labeled as ‘STRING’, class definitions as ‘A’ + ‘CONSTANT’, etc.
What is a parser?
A parser separates and analyzes a piece of text according to a set of rules specified by a formal grammar. The analysis is performed by assembling the tokenized code into an Abstract Syntax Tree (AST) – a tree of nodes that represent what the code means to the language. The AST evaluates the nodes in a similar manner to order of operations in math: each token is placed on the evaluation tree, and expressions are evaluated by reducing each branch in order.
The parser itself is can be written by hand, but I am using RACC: an LALR (Look Ahead, Left to right, Reverse) parser written by tenderlove to generate Ruby programs. How do we specify a grammar that RACC will understand?
Each rule is formatted in the following way:
RuleName:
OtherRule TOKEN AnotherRule { code to run }
| OtherRule { ... }
;
It is similar to an if/else statement that captures all possible expressions beginning with the most specific (ie: an expression with TWO rules matches line 2) to more general (all other single expressions are captured on line 3). When a token matches a rule, the code in the attached code block is run.
The code blocks correspond to instructions on how to treat matching tokens. For example, the grammar should specify what happens when the code contains a class definition, labeled with ‘A’ + ‘CONSTANT’.
...
# Class definition
Class:
A CONSTANT Block { result = ClassNode.new(val[1], val[2]) }
;
...
When the parser catches a class token it will create a new ClassNode with the class name (CONSTANT) and the block as arguments. The val[] array refers to the grammar rule [A, CONSTANT, Block].
Some tokens are parsed very close to AS IS:
Literal:
NUMBER { result = LiteralNode.new(val[0]) }
| STRING { result = LiteralNode.new(val[0]) }
| TRUE { result = LiteralNode.new(true) }
| FALSE { result = LiteralNode.new(false) }
| NIL { result = LiteralNode.new(nil) }
;
Each literal triggers the creation of a new LiteralNode with its value as the only argument.
The Nodes are outlined in a Nodes class, where the rules of evaluation are defined.
...
class ClassNode
def initialize(name, body)
@name = name
@body = body
end
def eval(context)
eh_class = CanadianClass.new
context[@name] = eh_class
@body.eval(Context.new(eh_class, eh_class))
eh_class
end
end
...
A ClassNode is initialized with two params (recall from the grammar: ClassNode.new(val[1], val[2])), the class name and its code block. The context is like scope – it can hold modules, classes, methods, attributes, aliases, requires, and includes. Classes, modules, and files are all Contexts (definition from Rdocs). Evaluation of a ClassNode begins by assigning the class to a context and evaluating the code block, which adds more contexts. In this way, a tree structure is formed – an AST – which does all the interpreting work for the new language.
When the grammar and node definitions are complete, RACC will generate a parser:
$ racc -vo parser.rb grammar.y
The parser is a relatively obtuse set of methods and state transition tables, and when you run code through the parser you get an AST that follows the grammar you have defined.
So, now I have a lexer and a parser, but I still can’t run my code. I need to define a runner class that will put all these parts together, but first, I need a break.
Awesome.
|
__label__pos
| 0.999455 |
Monday, September 21
Home/Computer/Successful Approaches For Computer As Possible Use Starting Today
Computer
Successful Approaches For Computer As Possible Use Starting Today
Upgrading the memory of the computer is another strategy to enhance the pace. In case your PC is more than a 12 months old then probably it isn’t capable of meet anymore the memory necessities. So, it is recommended that a computer should contain minimum of 1 GB reminiscence for the newest updates of software.
Another advantage is in the classes themselves. Since they’re finding out on-line, the scholars would not have to present in a selected location to receive the lectures. Therefore there isn’t a time cramp on this. The students obtain their tutoring via a digital atmosphere they usually get their lectures both by means of downloading the files or just by way of stay streaming. This means that you could obtain and take your on-line computer courses from anywhere on the earth.
Computer News
Nonetheless that is not all the time the case.
There are clearly many varieties of wooden desks, and the perfect are hardwoods, as they have an inclination to last the longest. Additionally they are available many different kinds, because the type of wooden obviously impacts the colour. Nevertheless, many individuals are beginning to go with glass high desks, and this is positively something to consider. It definitely helps give the workplace a extra fashionable
As a computer professional for a few years, many people ask the query find out how to velocity up the computer startup. It takes too long to begin and there is no error message. What is the detailed trigger and methods to deal with that? I’ll talk about a number of methods to hurry up computer startup.
They’ll trigger so much bother and inconvenience.
One more reason on your computer to run gradual is due to overheated processor. Therefore, it is advisable to ensure that the processor isn’t overheated. Extreme heat results in substantial reduction of the performance of the computer. Some processors have the potential to mechanically lower the pace as a compensation for heat associated issues. This can be one of the reasons for your question: why is my computer running so slow and how you can velocity up computer.
If you happen to’re a non-technical day trader, then you definately doubtless don’t know one motherboard from the following. Briefly, all it’s good to know is that there are crap motherboards and there are superior motherboards. Having one in your computer for day trading that is army-grade licensed is like having the luxury sedan of the bunch. It could be the difference between you having a top quality working machine and one that’s too quirky to meet your requirements. With a military-grade certified motherboard in your trading computer, you may assure that you’re getting a top notch system that’s constructed to last by way of whatever situations are thrown at it.
Conclusion
Carry up questions like these when talking to your IT director: How lengthy does it take us to change operating programs on all our computers? And for some reason there could be a microwave within the dashboard. These are suspicious packages that try to get your private info like account particulars, passwords, and confidential information.
Leave a Reply
|
__label__pos
| 0.746861 |
Indie game storeFree gamesFun gamesHorror games
Game developmentAssetsComics
SalesBundles
Jobs
TIC-80
Fantasy computer for making, playing and sharing tiny games. · By Nesbox
Newer versions run slowly
A topic by sammy6 created Nov 05, 2019 Views: 201 Replies: 3
Viewing posts 1 to 4
So on versions after I believe 0.60.3, TIC-80 will run at half-speed and the audio will be choppy. This also happens on the browser version, and on multiple computers I tried with. Does this happen for you?
What are your PC's specs?
Sorry I got back so late. I have a 64 bit AMD processor with 8 GB of RAM. Is there anything specific you need?
It also doesn't show sync when it lags
|
__label__pos
| 0.941192 |
#! /usr/bin/python2.6 # # CDDL HEADER START # # The contents of this file are subject to the terms of the # Common Development and Distribution License (the "License"). # You may not use this file except in compliance with the License. # # You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE # or http://www.opensolaris.org/os/licensing. # See the License for the specific language governing permissions # and limitations under the License. # # When distributing Covered Code, include this CDDL HEADER in each # file and include the License file at usr/src/OPENSOLARIS.LICENSE. # If applicable, add the following below this CDDL HEADER, with the # fields enclosed by brackets "[]" replaced with your own identifying # information: Portions Copyright [yyyy] [name of copyright owner] # # CDDL HEADER END # # Copyright (c) 2009, 2010, Oracle and/or its affiliates. All rights reserved. # """Implements the Dataset class, providing methods for manipulating ZFS datasets. Also implements the Property class, which describes ZFS properties.""" import zfs.ioctl import zfs.util import errno _ = zfs.util._ class Property(object): """This class represents a ZFS property. It contains information about the property -- if it's readonly, a number vs string vs index, etc. Only native properties are represented by this class -- not user properties (eg "user:prop") or userspace properties (eg "userquota@joe").""" __slots__ = "name", "number", "type", "default", "attr", "validtypes", \ "values", "colname", "rightalign", "visible", "indextable" __repr__ = zfs.util.default_repr def __init__(self, t): """t is the tuple of information about this property from zfs.ioctl.get_proptable, which should match the members of zprop_desc_t (see zfs_prop.h).""" self.name = t[0] self.number = t[1] self.type = t[2] if self.type == "string": self.default = t[3] else: self.default = t[4] self.attr = t[5] self.validtypes = t[6] self.values = t[7] self.colname = t[8] self.rightalign = t[9] self.visible = t[10] self.indextable = t[11] def delegatable(self): """Return True if this property can be delegated with "zfs allow".""" return self.attr != "readonly" proptable = dict() for name, t in zfs.ioctl.get_proptable().iteritems(): proptable[name] = Property(t) del name, t def getpropobj(name): """Return the Property object that is identified by the given name string. It can be the full name, or the column name.""" try: return proptable[name] except KeyError: for p in proptable.itervalues(): if p.colname and p.colname.lower() == name: return p raise class Dataset(object): """Represents a ZFS dataset (filesystem, snapshot, zvol, clone, etc). Generally, this class provides interfaces to the C functions in zfs.ioctl which actually interface with the kernel to manipulate datasets. Unless otherwise noted, any method can raise a ZFSError to indicate failure.""" __slots__ = "name", "__props" __repr__ = zfs.util.default_repr def __init__(self, name, props=None, types=("filesystem", "volume"), snaps=True): """Open the named dataset, checking that it exists and is of the specified type. name is the string name of this dataset. props is the property settings dict from zfs.ioctl.next_dataset. types is an iterable of strings specifying which types of datasets are permitted. Accepted strings are "filesystem" and "volume". Defaults to accepting all types. snaps is a boolean specifying if snapshots are acceptable. Raises a ZFSError if the dataset can't be accessed (eg doesn't exist) or is not of the specified type. """ self.name = name e = zfs.util.ZFSError(errno.EINVAL, _("cannot open %s") % name, _("operation not applicable to datasets of this type")) if "@" in name and not snaps: raise e if not props: props = zfs.ioctl.dataset_props(name) self.__props = props if "volume" not in types and self.getprop("type") == 3: raise e if "filesystem" not in types and self.getprop("type") == 2: raise e def getprop(self, propname): """Return the value of the given property for this dataset. Currently only works for native properties (those with a Property object.) Raises KeyError if propname does not specify a native property. Does not raise ZFSError. """ p = getpropobj(propname) try: return self.__props[p.name]["value"] except KeyError: return p.default def parent(self): """Return a Dataset representing the parent of this one.""" return Dataset(self.name[:self.name.rindex("/")]) def descendents(self): """A generator function which iterates over all descendent Datasets (not including snapshots.""" cookie = 0 while True: # next_dataset raises StopIteration when done (name, cookie, props) = \ zfs.ioctl.next_dataset(self.name, False, cookie) ds = Dataset(name, props) yield ds for child in ds.descendents(): yield child def userspace(self, prop): """A generator function which iterates over a userspace-type property. prop specifies which property ("userused@", "userquota@", "groupused@", or "groupquota@"). returns 3-tuple of domain (string), rid (int), and space (int). """ d = zfs.ioctl.userspace_many(self.name, prop) for ((domain, rid), space) in d.iteritems(): yield (domain, rid, space) def userspace_upgrade(self): """Initialize the accounting information for userused@... and groupused@... properties.""" return zfs.ioctl.userspace_upgrade(self.name) def set_fsacl(self, un, d): """Add to the "zfs allow"-ed permissions on this Dataset. un is True if the specified permissions should be removed. d is a dict specifying which permissions to add/remove: { "whostr" -> None # remove all perms for this entity "whostr" -> { "perm" -> None} # add/remove these perms } """ return zfs.ioctl.set_fsacl(self.name, un, d) def get_fsacl(self): """Get the "zfs allow"-ed permissions on the Dataset. Return a dict("whostr": { "perm" -> None }).""" return zfs.ioctl.get_fsacl(self.name) def get_holds(self): """Get the user holds on this Dataset. Return a dict("tag": timestamp).""" return zfs.ioctl.get_holds(self.name) def snapshots_fromcmdline(dsnames, recursive): for dsname in dsnames: if not "@" in dsname: raise zfs.util.ZFSError(errno.EINVAL, _("cannot open %s") % dsname, _("operation only applies to snapshots")) try: ds = Dataset(dsname) yield ds except zfs.util.ZFSError, e: if not recursive or e.errno != errno.ENOENT: raise if recursive: (base, snapname) = dsname.split('@') parent = Dataset(base) for child in parent.descendents(): try: yield Dataset(child.name + "@" + snapname) except zfs.util.ZFSError, e: if e.errno != errno.ENOENT: raise
|
__label__pos
| 0.961708 |
The officially supported Scala driver for Mongo is Casbah. Cashbah is a thin wrapper around the Java MongoDB driver that gives it a Scala like feel. As long as you ignore all the MongoDBObjects then it feels much more like being in the Mongo shell or working in Python that working with Java/Mongo.
All the examples are copied from a Scala REPL launched from an SBT project with Casbah added as a dependency.
So lets get started by importing the Casbah package:
scala> import com.mongodb.casbah.Imports._
import com.mongodb.casbah.Imports._
Now lets create a connection to a locally running Mongo and use the "test" database:
scala> val mongoClient = MongoClient()
mongoClient: com.mongodb.casbah.MongoClient = com.mongodb.casbah.MongoClient@2acf0276
scala> val database = mongoClient("test")
database: com.mongodb.casbah.MongoDB = test
And now lets get a reference to the messages collections:
scala> val collection = database("messages")
collection: com.mongodb.casbah.MongoCollection = messages
As you can see Casbah makes heavy use of the apply method to give relatively nice boiler plate connection code. To print all the rows for a collection you can use the find method which returns an iterator (there is none at the moment):
scala> collection.find().foreach(row => println(row) )
Now lets insert some data the using the insert method and then find and print it:
scala> collection.insert(MongoDBObject("message" -> "Hello world"))
res2: com.mongodb.casbah.Imports.WriteResult = { "serverUsed" : "/127.0.0.1:27017" , "n" : 0 , "connectionId" : 225 , "err" : null , "ok" : 1.0}
scala> collection.find().foreach(row => println(row) )
{ "_id" : { "$oid" : "523aa69a30048ee48f49c333"} , "message" : "Hello world"}
And adding another document:
scala> collection.insert(MongoDBObject("message" -> "Hello London"))
res4: com.mongodb.casbah.Imports.WriteResult = { "serverUsed" : "/127.0.0.1:27017" , "n" : 0 , "connectionId" : 225 , "err" : null , "ok" : 1.0}
scala> collection.find().foreach(row => println(row) )
{ "_id" : { "$oid" : "523aa69a30048ee48f49c333"} , "message" : "Hello world"}
{ "_id" : { "$oid" : "523aa6bf30048ee48f49c334"} , "message" : "Hello London"}
The familiar findone method is there. Rather than an Iterable object returned from find, findOne returns an Option so you can use a basic pattern match to handle the document being there or not:
scala> val singleResult = collection.findOne()
singleResult: Option[collection.T] = Some({ "_id" : { "$oid" : "523aa69a30048ee48f49c333"} , "message" : "Hello world"})
scala> singleResult match {
| case None => println("No messages found")
| case Some(message) => println(message)
| }
{ "_id" : { "$oid" : "523aa69a30048ee48f49c333"} , "message" : "Hello world"}
Now lets query using the ID of an object we've inserted (querying by any other field is the same):
scala> val query = MongoDBObject("_id" -> helloWorld.get("_id"))
id: com.mongodb.casbah.commons.Imports.DBObject = { "_id" : { "$oid" : "523aa69a30048ee48f49c333"}}
scala> collection.findOne(query)
res12: Option[collection.T] = Some({ "_id" : { "$oid" : "523aa69a30048ee48f49c333"} , "message" : "Hello world"})
We can also update the document in the database and then get it again to prove it has changed:
scala> collection.update(query, MongoDBObject("message" -> "Hello Planet"))
res13: com.mongodb.WriteResult = { "serverUsed" : "/127.0.0.1:27017" , "updatedExisting" : true , "n" : 1 , "connectionId" : 225 , "err" : null , "ok" : 1.0}
scala> collection.findOne(query)
res14: Option[collection.T] = Some({ "_id" : { "$oid" : "523aa69a30048ee48f49c333"} , "message" : "Hello Planet"})
The remove method works in the same way, just pass in a MongoDBObject for the selection criterion.
Not look Scalary enough for you? You can also insert using the += method:
scala> collection += MongoDBObject("message"->"Hello England")
res15: com.mongodb.WriteResult = { "serverUsed" : "/127.0.0.1:27017" , "n" : 0 , "connectionId" : 225 , "err" : null , "ok" : 1.0}
scala> collection.find().foreach(row => println(row))
{ "_id" : { "$oid" : "523aa69a30048ee48f49c333"} , "message" : "Hello Planet"}
{ "_id" : { "$oid" : "523aa6bf30048ee48f49c334"} , "message" : "Hello London"}
{ "_id" : { "$oid" : "523c911230048ee48f49c335"} , "message" : "Hello England"}
How do you build more complex document in Scala? Simply use the MongoDBObject ++ method, for example we can create an object with multiple fields, insert it, then view it by printing all the documents in the collection:
scala> val moreThanOneField = MongoDBObject("message" -> "I'm coming") ++ ("time" -> "today") ++ ("Name" -> "Chris")
moreThanOneField: com.mongodb.casbah.commons.Imports.DBObject = { "message" : "I'm coming" , "time" : "today" , "Name" : "Chris"}
scala> collection.insert(moreThanOneField)
res6: com.mongodb.casbah.Imports.WriteResult = { "serverUsed" : "/127.0.0.1:27017" , "n" : 0 , "connectionId" : 234 , "err" : null , "ok" : 1.0}
scala> collection.find().foreach(println(_) )
{ "_id" : { "$oid" : "523aa69a30048ee48f49c333"} , "message" : "Hello Planet"}
{ "_id" : { "$oid" : "523aa6bf30048ee48f49c334"} , "message" : "Hello London"}
{ "_id" : { "$oid" : "523c911230048ee48f49c335"} , "message" : "Hello England"}
{ "_id" : { "$oid" : "523c96b530041dae32fd04d6"} , "message" : "I'm coming" , "time" : "today" , "Name" : "Chris"}
|
__label__pos
| 0.930175 |
Application Name DatabaseRouter
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
from django.conf import settings
class AppNameDatabaseRouter(object):
"""
Per application database. Use the database named like the app or fall
back to default.
"""
def db_for_read(self, model, **hints):
if model._meta.app_label in settings.DATABASES:
return model._meta.app_label
return None
def db_for_write(self, model, **hints):
if model._meta.app_label in settings.DATABASES:
return model._meta.app_label
return None
def allow_relation(self, obj1, obj2, **hints):
return obj1._meta.app_label == obj2._meta.app_label
More like this
1. list of all app_label, model of existing contentTypes by vijay.shanker 4 months, 1 week ago
2. Model-driven multiple database router by tga 1 year, 4 months ago
3. Database Routing by URL by dcwatson 3 years ago
4. App Display Label Template Filter Workaround by programmerDan 1 year, 9 months ago
5. extends_default by daniellindsley 4 years, 7 months ago
Comments
(Forgotten your password?)
|
__label__pos
| 0.970983 |
Dan Dan - 16 days ago 5x
Python Question
Bidrectional node/python communication
I'm trying to implement simple bidirectional communication between node and a spawned Python process.
Python:
import sys
for l in sys.stdin:
print "got: %s" % l
Node:
var spawn = require('child_process').spawn;
var child = spawn('python', ['-u', 'ipc.py']);
child.stdout.on('data', function(data){console.log("stdout: " + data)});
var i = 0;
setInterval(function(){
console.log(i);
child.stdin.write("i = " + i++ + "\n");
}, 1000);
Using
-u
on Python forces unbuffered I/O so I would expect to see the output (I've also tried
sys.stdout.flush()
) but don't. I know I can use
child.stdout.end()
but that prevents me from writing data later.
Answer
Your Python code crashes with TypeError: not all arguments converted during string formatting at line
print "got: " % l
You ought to write
print "got: %s" % l
You can see the errors that Python outputs by doing:
var child = spawn('python', ['-u', 'ipc.py'],
{ stdio: [ 'pipe', 'pipe', 2 ] });
on Node.js, that is, pipe only standard output but let the standard error go to Node's stderr.
Even with these fixes, and even accounting for -u the sys.stdin.__iter__ will be buffered. To work around it, use .readline instead:
for line in iter(sys.stdin.readline, ''):
print "got: %s" % line
sys.stdout.flush()
Comments
|
__label__pos
| 0.923273 |
Free Trial
IVR
What is Interactive Voice Response?
IVR or Interactive Voice Response is a technology that allows callers to navigate a phone system before talking to a customer support representative. The function of an IVR system is to route callers to appropriate departments within call centers. To operate an IVR, callers must use DTMF tones (dial pad key inputs) or voice commands.
IVR
Visualization of how IVR works
What functions should an IVR be able to perform?
IVR software should be able to perform the following functions:
Record custom IVR messages
IVR software should allow you to record custom messages, personalized greetings, and prompts. The system should allow you to record complex IVR trees, also known as menus, regardless of their length.
IVR
IVR message recording in LiveAgent
Use pre-recorded IVR messages
Your IVR system should allow you to upload generic pre-recorded messages in multiple formats (mp3, WAV, au). This feature is a must-have. Why?
For two reasons. Firstly, not everyone is comfortable recording their voice. Second, not everyone can speak slowly, clearly, and without an accent. Thus, being able to upload pre-recorded messages is very useful.
Collect information about callers
Collecting information about callers is the most important function an IVR can have. The system needs to be able to recognize voice commands and the dial pad inputs that callers make. If the system isn’t able to do this, callers won’t be routed to appropriate agents and departments.
Route the caller to the appropriate department or agent
IVR software needs to be able to recognize which customer support agents have had the longest downtime since their last call or be able to recognize which agent has spoken to the caller previously. This will ensure that callers are routed to the agents that are most knowledgeable about their issue, and thus most equipped to help them.
IVR advanced example of script
Example of IVR script that routes callers to appropriate departments
Prioritize calls
IVR systems need to be able to recognize high-value callers. Once the system recognizes the caller, it needs to be able to put them at the front of the queue or route them to their designated customer success manager.
Who uses IVR?
Businesses, organizations, and government agencies
IVR software is primarily used by large businesses, organizations, and government agencies that have multiple customer support departments within their call center.
Some examples of IVR users are telco companies, banks, internet, and TV providers, airlines, large corporations, and ministries.
Customers
Customers that contact businesses that use IVR systems are IVR users as well. They interact with IVR technology before they’re connected to a customer support representative.
Why is phone support without IVR ineffective?
Having an IVR system in place helps businesses improve their phone support. Without it, customer support wouldn’t be as effective and customers wouldn’t be as satisfied. Here’s why:
High probability of being routed to the wrong department or agent
Without an IVR system in place, customers have to be routed to the appropriate agent or department manually. This means that a customer service representative, or a receptionist, has to physically press a button on their phone or computer to route the customer’s call.
However, whenever a human operator has to route calls, there’s a higher chance of error. This is simply because of the human factor. For example, the support rep could simply press the wrong button because they got distracted.
No prioritization options
Without IVR, all callers have to wait in a queue, regardless of their status. This could mean that you don’t adhere to SLA standards, which could affect your relationships with your most valued customers.
If you don’t prioritize your most valued customers, you’re likely to lose their business and tarnish your reputation. As an example, if SLA standards aren’t met, the customer won’t be inclined to recommend your business to others because they know you don’t adhere to agreed-upon service standards.
Great customer service doesn't mean that the customer is always right, it means that the customer is always honored.
Chris LoCurto - Leadership and business coach
No callback options
Without IVR, callers won’t have the opportunity to request a callback option. Instead, they’ll have to wait on hold which can result in customer frustration. If you provide your customers with a callback option, it shows that you value their time and business.
Long hold queues
IVR eliminates long hold queues and waiting times. Because callers are able to decide which department they want to be routed to, queues are shorter for initial contact and each department.
What problems does IVR solve?
Low first contact resolution rates
IVR
IVR helps improve first contact resolution rates because it routes callers to the agents that are most equipped to help them. Without it, callers have to explain their problem to an agent that routes them to another agent. This can happen multiple times before the customer is routed to someone that will actually help them resolve their problem.
Inefficient customer service
IVR
IVR improves customer service efficiency because agents don’t have to waste each other’s time by transferring callers left and right.
Low customer satisfaction
IVR
Customers can get easily frustrated if they keep being juggled around by customer service agents. We’ve all been there — trying to resolve a simple problem, yet no agent can seem to help.
By constantly re-routing callers to different agents, customer satisfaction decreases.
High operational costs
Reports
IVR systems eliminate the need for a customer service agent whose sole purpose is to direct calls to appropriate agents. This can save businesses money which can be invested in bettering customer service.
Lack of professionalism
End user
IVR can help businesses look more professional and established than they actually are. How? When a customer calls your business and is greeted with an IVR message, they’ll assume your business is much larger than it actually is.
Because IVR systems make it appear like your business has multiple departments and employees, it can be perceived as more trustworthy in the eyes of consumers.
Benefits of using IVR
IVR improves service quality, and in turn, improves customer satisfaction.
Improves service quality
By using an IVR system, you’ll be able to improve your service by:
• Decreasing hold times
• Adhering to service level agreements (SLAs)
• Routing callers to appropriate departments and agents
• Providing callers with callback options
• Giving your agents additional time before a call during which they can review the CRM information about the caller, their purchases, and previous interactions
• Adding custom messages about new offers, changes of service, etc into your IVR menu
Improves customer satisfaction
IVR software improves customer experience and customer satisfaction. By using this software, customer service representatives can provide speedy, knowledgeable, and personalized service. Agents are more likely to provide options for problem resolution on the first contact, which is exactly what customers want and expect.
66% of customers say that valuing their time is the most important thing a company can do to provide them with good customer service.
Forrester Research
How can IVR help you?
IVR software can be used to improve marketing, sales, and customer service efforts
Use case #1: IVR for marketing
Marketers can use IVR for generating leads and qualifying them for future marketing campaigns.
Generating leads
IVR
Instead of sending out email surveys, marketers can utilize IVR to collect answers from their customers. One way to do it is to give customers an IVR connected number to call, in which they simply answer questions by using their voice, or by pressing the dial keys.
Another way to do it is to insert a survey directly into your already existing IVR menu. For example, when a customer calls your support department, prior to being connected they can be asked if they want to participate in a survey that can give them a chance to win a gift card or a discount.
Qualifying leads
IVR
Marketers can use IVR systems to ask customers questions and qualify them as leads. For example, if a caller answers questions about their willingness to try a product, they can be automatically routed to the sales department after they’ve completed the survey.
Use case #2: IVR for sales
Customer experience bag
IVR can help you automate calls related to recurring orders. With outbound IVR surveys, customers can answer questions about which products they need to reorder, when, and the amount. The surveys can also ask customers to confirm their address and contact details to ensure all CRM information is up to date.
Automating outbound calls for recurring orders is not only a time-saver but also decreases operational costs, as it doesn’t require any human resources.
Use case #3: IVR for support
Sad face and a happy face
Apart from the use cases mentioned above, IVR software can be used to measure and improve customer support through IVR surveys. At the end of each call, customers can indicate how they’d rate the service they’ve received.
Receiving immediate feedback like this also gives you the chance to make things right if your team didn’t perform up to par. For example, if the customer rated their service experience as poor, they could be asked if they’d like to be re-routed to an agent to speak about their experience in more detail.
If the customer agrees, they could be re-routed to a custom success manager that prevents churn and tries to make the experience right — either by apologizing, or offering incentives such as discounts or gifts.
How to choose an IVR system
Choosing an IVR system can be a challenge, just like with any software or tool. The software needs to be intuitive, user-friendly, affordable, and have all the essential features an IVR system needs to perform.
Step #1: Write down your requirements
IVR
The first step is to write down your requirements. Ask yourself questions like this to determine what features you want your IVR software to have, and what functions you want it to perform.
• Do I want the software for outbound calls also or only inbound calls?
• Do I want to offer callback options?
• Do I want a sole IVR software, or a call center software that also has IVR capabilities?
• Do I want to be able to upload and record custom messages?
• How complex do I want my IVR trees to be?
• Do I want my software to recognize both speech and DTMF tones?
By thinking about these questions, you’ll start to have a pretty good idea of what you want out of your solution. Once you know your requirements, you can start researching potential software solutions.
Step #2: Research potential software
IVR
The next step is to research IVR software on the Internet. Take your time to look at software review portals, YouTube videos, and professional Facebook groups. Don’t be afraid to ask for advice on Quora, LinkedIn, or Product Hunt.
Look at review portal comparisons and user testimonials
If you want to compare different kinds of software based on user-friendliness, price, features, and ease of use, your best bet is to look at the following review portals:
Each review portal provides both written and video user testimonials. Check them out to get an idea of how existing customers are satisfied with the software and the service each vendor provides.
Watch YouTube videos
YouTube videos are a great way to see how each software works in real-time. Look at tutorials posted by official accounts associated with each software as well as reviews by independent YouTubers. This will give you an idea of what the UI looks like and if the software is easy to use.
Ask your peers on professional Facebook groups, LinkedIn, Quora, or Product Hunt
Asking others for their opinion about which IVR software is best is also a great way to find new suggestions. Other professional marketers, customer service representatives, and sales reps that have tried different software can help you eliminate the systems that seem promising but don’t deliver.
Step #3: Request a free trial
Resolution time
After you’ve narrowed down your list of software, try them out by requesting a free trial.
Record messages and test them in real-time
Once your free trial is up and running, test as many functions and integrations as possible to ensure the software works properly and is up to your standards. Try recording and uploading different IVR messages as well as calling your IVR connected phone numbers.
If you have any questions about how the software works, don’t hesitate to reach out to customer support. When you do, make note of how they respond to you. It’s important to know that the support received alongside the software is up to par. Why?
If the software you choose has a service outage or is buggy, you should be certain that the vendor will do everything in their power to bring the system back up online. If you can count on them, you won’t have to worry about losing valuable leads, dropping calls, and frustrating your customers.
Request trial extension as needed
If the free trial period isn’t long enough for you to test out all features and make up your mind about the software, request a free trial extension. Most software providers will be happy to extend your trial in hopes of converting you into a paying customer.
Step #4: Book a demo
Write down a list of questions
Personalized email replies
The next step is to book a demo. Before the demo, write down a list of questions that you want answered. They can be about the functionality of the software, pricing options, feature add-ons, and existing customers in the same industry as you.
Ask questions and take notes
Once the demo is in session, ask your prepared questions. Take notes and pay close attention to the use cases presented by the sales rep. If they don’t align with your business goals, ask the rep how their software can help you with your current pain points.
If you’re satisfied with the responses, the presentation, and the service, you can purchase the subscription to the software. If you’re not satisfied, book a demo with another software provider until you find one you’re satisfied with.
Step #5: Integrate the software with your phone numbers and existing systems
IVR
The next step is to integrate your software with the systems you already have in place (call center, helpdesk) and connect your existing phone numbers. Once you’ve done that, you can start recording and uploading your custom messages and building IVR trees.
Test everything before your system goes live, to ensure there aren’t any mistakes that can lead to customer frustration or churn. Make sure your trees have an endpoint, and that your messages are easy to understand.
Step #6: Start using your software
Phone ticketing
The last step is to start using your software. As you get comfortable using it, feel free to get creative and branch out. Use the software for outbound calling, marketing surveys, and more.
Agent Attended Transfer Average Handle Time Business Hours Call Center App Contact Center Software Customer Database Customer Satisfaction Survey Customer Customer Experience Customer Service Tools Customer Support Customer Interaction Customer Representative First Response Time Hold Time IT Service Desk Priority Remote Authentication Resolution Time SLA Talk Tel Link protocol Voice Voice of Customer
Try LiveAgent Today
LiveAgent is the most reviewed and #1 rated call center software for small and medium sized businesses. Try our IVR functionality today.
Free Trial
FAQ
What does IVR stand for?
IVR stands for Interactive Voice Response.
What is IVR?
IVR or Interactive Voice Response is a technology that allows callers to navigate a phone system before talking to a customer support representative. The function of an IVR system is to route callers to appropriate departments within call centers. To operate an IVR, callers must use DTMF tones (dial pad key inputs) or voice commands.
How does IVR work?
Typical IVR works with a telephony board to understand the DTMF signals produced by a phone. It requires a computer hooked up to a phone line through a telephony board as well as an IVR software. More modern IVR systems simply require advanced IVR software that is capable of speech and DTMF recognition.
How to set up IVR system?
To set up an IVR software you need to create IVR trees. However, every software is different so the setup is different for each solution. Generally, you need to select the phone number that will use the IVR. Next, use a script to create scenarios. For example, if a caller presses 1, route them to sales. Create as many scenarios as you want. Upload or record your audio messages and add their file names into your script. Here’s how your script can look like: - choice: 1: name: Sales department play: [voice recording 1] do: - transfer: to: salesDepartmentID
How to use IVR?
To operate an IVR, callers must use DTMF tones (dial pad key inputs) or voice commands.
What is IVR format?
IVR recordings can be uploaded in mp3, WAV, and au formats.
Why do most organizations force customers to experience a menu-based IVR system?
Most organizations use IVR menus because it leaves little room for error when transferring calls. It also decreases the amount of time customers have to wait on hold, and improves service because it gives agents more time to review details about the customer such as their previous interactions, purchases, and contact details.
What prompts are asked for IVR?
Generally IVR prompts ask callers to press a number on their dial pad to reach a certain department within an organization. As an example, an IVR system may prompt a caller to press 1 for sales, 2 for billing, 3 for tech support, etc.
What is IVR troubleshooting?
IVR troubleshooting allows callers to troubleshoot problems with software or hardware by answering questions through the IVR. The IVR might ask questions like”Is the green light on? Press 1 for yes, 2 for no.” Based on the caller’s inputs, the IVR can direct them to a solution or route their call to a tech support agent that is most equipped to help them.
What to include in my IVR prompts?
Make sure that your IVR prompts start with a greeting. Next, proceed to a menu selection, and end the IVR prompts with a message that confirms that the caller is being connected to a customer support agent.
Back to Glossary
Our website uses cookies. By continuing we assume your permission to deploy cookies as detailed in our privacy and cookies policy.
|
__label__pos
| 0.633214 |
[Tutor] putting accent on letters while user is typing in Entrybox (Tkinter)
Ali M adeadmarshal at gmail.com
Mon Jul 16 13:29:55 EDT 2018
The accents which i want to be automatically converted and put upon letters
is circumflex and another one which shape is like the opposite of
circumflex.
the user types in entrybox and it searches in db which i've created before
and has no problem. the words in my db have unicode characters and they are
accented. the user himself can type accented characters too, but i want to
make it automatically converted so the user doesn't have to have a special
keyboard to write.
when x is pressed after these letters (g,j,c,h,u), i want that x to be
removed and replaced with a circumflex above those letters.
here is the full code if needed:
import sqlite3 as sqlite
import tkinter as tk
from tkinter import ttk
#GUI Widgets
class EsperantoDict:
def __init__(self, master):
master.title("EsperantoDict")
master.iconbitmap("Esperanto.ico")
master.resizable(False, False)
master.configure(background='#EAFFCD')
self.style = ttk.Style()
self.search_var = tk.StringVar()
self.search_var.trace("w", lambda name, index, mode:
self.update_list())
self.style = ttk.Style()
self.style.configure("TFrame", background='#EAFFCD')
self.style.configure("TButton", background='#C6FF02')
self.style.configure("TLabel", background='#EAFFCD')
self.frame_header = ttk.Frame(master, relief=tk.FLAT)
self.frame_header.config(style="TFrame")
self.frame_header.pack(side=tk.TOP, padx=5, pady=5)
self.logo = tk.PhotoImage(file=r'C:\EsperantoDict\eo.png')
self.small_logo = self.logo.subsample(10, 10)
ttk.Label(self.frame_header, image=self.small_logo).grid(row=0,
column=0, stick="ne", padx=5, pady=5, rowspan=2)
ttk.Label(self.frame_header, text='EsperantoDict', font=('Arial',
18, 'bold')).grid(row=0, column=1)
self.frame_content = ttk.Frame(master)
self.frame_content.config(style="TFrame")
self.frame_content.pack()
self.entry_search = ttk.Entry(self.frame_content,
textvariable=self.search_var, width=30)
self.entry_search.bind('<FocusIn>', self.entry_delete)
self.entry_search.bind('<FocusOut>', self.entry_insert)
self.entry_search.grid(row=0, column=0, padx=5)
self.entry_search.focus()
self.button_search = ttk.Button(self.frame_content, text="Search")
self.photo_search =
tk.PhotoImage(file=r'C:\EsperantoDict\search.png')
self.small_photo_search = self.photo_search.subsample(3, 3)
self.button_search.config(image=self.small_photo_search,
compound=tk.LEFT, style="TButton")
self.button_search.grid(row=0, column=2, columnspan=1, sticky='nw',
padx=5)
self.listbox = tk.Listbox(self.frame_content, height=30, width=30)
self.listbox.grid(row=1, column=0, padx=5)
self.scrollbar = ttk.Scrollbar(self.frame_content,
orient=tk.VERTICAL, command=self.listbox.yview)
self.scrollbar.grid(row=1, column=1, sticky='nsw')
self.listbox.config(yscrollcommand=self.scrollbar.set)
self.listbox.bind('<<ListboxSelect>>', self.enter_meaning)
self.textbox = tk.Text(self.frame_content, relief=tk.GROOVE,
width=60, height=30, borderwidth=2)
self.textbox.config(wrap='word')
self.textbox.grid(row=1, column=2, sticky='w', padx=5)
# SQLite
self.db = sqlite.connect(r'C:\EsperantoDict\test.db')
self.cur = self.db.cursor()
self.cur.execute('SELECT Esperanto FROM Words')
for row in self.cur:
self.listbox.insert(tk.END, row)
for row in range(0, self.listbox.size(), 2):
self.listbox.itemconfigure(row, background="#f0f0ff")
self.update_list()
def update_list(self):
search_term = self.search_var.get()
for item in self.listbox.get(0, tk.END):
if search_term.lower() in item:
self.listbox.delete(0, tk.END)
self.listbox.insert(tk.END, item)
# SQLite
def enter_meaning(self, tag):
for index in self.listbox.curselection():
esperanto = self.listbox.get(index)
results = self.cur.execute("SELECT English FROM Words WHERE
Esperanto = ?", (esperanto))
for row in results:
self.textbox.delete(1.0, tk.END)
self.textbox.insert(tk.END, row)
def entry_delete(self, tag):
self.entry_search.delete(0, tk.END)
return None
def entry_insert(self, tag):
self.entry_search.delete(0, tk.END)
self.entry_search.insert(0, "Type to Search")
return None
def main():
root = tk.Tk()
esperantodict = EsperantoDict(root)
root.mainloop()
if __name__ == '__main__': main()
More information about the Tutor mailing list
|
__label__pos
| 0.971397 |
Do you know that? 38% are now earning more than they did as an employee in the same field next
Explain the use of DataAdapter.
-DataAdapter provides the bridge to connect command objects to a dataset object.
-It populates the table in the dataset from the data store and also pushes the changes in the dataset back into the data store.
Methods of DataAdapter:
Fill - Populates the dataset object with data from the data source
FillSchema - Extracts the schema for a table from the data source
Update - It is use to update the data source with the changes made to the content of the dataset
|
__label__pos
| 0.80723 |
Permalink
Switch branches/tags
Nothing to show
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
672 lines (560 sloc) 22.6 KB
<?php
/**
* Phockito - Mockito for PHP
*
* Mocking framework based on Mockito for Java
*
* (C) 2011 Hamish Friedlander / SilverStripe. Distributable under the same license as SilverStripe.
*
* Example usage:
*
* // Create the mock
* $iterator = Phockito.mock('ArrayIterator);
*
* // Use the mock object - doesn't do anything, functions return null
* $iterator->append('Test');
* $iterator->asort();
*
* // Selectively verify execution
* Phockito::verify($iterator)->append('Test');
* // 1 is default - can also do 2, 3 for exact numbers, or 1+ for at least one, or 0 for never
* Phockito::verify($iterator, 1)->asort();
*
* Example stubbing:
*
* // Create the mock
* $iterator = Phockito.mock('ArrayIterator);
*
* // Stub in a value
* Phockito::when($iterator->offsetGet(0))->return('first');
*
* // Prints "first"
* print_r($iterator->offsetGet(0));
*
* // Prints null, because get(999) not stubbed
* print_r($iterator->offsetGet(999));
*
*
* Note that several functions are declared as public so that builder classes can access them. Anything
* starting with an "_" is for internal consumption only
*/
class Phockito {
const MOCK_PREFIX = '__phockito_';
/* ** Static Configuration *
Feel free to change these at any time.
*/
/** @var bool - If true, don't warn when doubling classes with final methods, just ignore the methods. If false, throw warnings when final methods encountered */
public static $ignore_finals = true;
/** @var string - Class name of a class with a static "register_double" method that will be called with any double to inject into some other type tracking system */
public static $type_registrar = null;
/* ** INTERNAL INTERFACES START **
These are declared as public so that mocks and builders can access them,
but they're for internal use only, not actually for consumption by the general public
*/
/** Each mock instance needs a unique string ID, which we build by incrementing this counter @var int */
public static $_instanceid_counter = 0;
/** Array of most-recent-first calls. Each item is an array of (instance, method, args) named hashes. @var array */
public static $_call_list = array();
/**
* Array of stubs responses
* Nested as [instance][method][0..n], each item is an array of ('args' => the method args, 'responses' => stubbed responses)
* @var array
*/
public static $_responses = array();
/**
* Array of defaults for a given class and method
* @var array
*/
public static $_defaults = array();
/**
* Records whether a given class is an interface, to avoid repeatedly generating reflection objects just to re-call type registrar
* @var array
*/
public static $_is_interface = array();
/*
* Should we attempt to support namespaces? Is PHP >= 5.3, basically
*/
public static function _has_namespaces() {
return version_compare(PHP_VERSION, '5.3.0', '>=');
}
/**
* Checks if the two argument sets (passed as arrays) match. Simple serialized check for now, to be replaced by
* something that can handle anyString etc matchers later
*/
public static function _arguments_match($mockclass, $method, $a, $b) {
// See if there are any defaults for the given method
if (isset(self::$_defaults[$mockclass][$method])) {
// If so, get them
$defaults = self::$_defaults[$mockclass][$method];
// And merge them with the passed args
$a = $a + $defaults; $b = $b + $defaults;
}
// If two argument arrays are different lengths, automatic fail
if (count($a) != count($b)) return false;
// Step through each item
$i = count($a);
while($i--) {
$u = $a[$i]; $v = $b[$i];
// If the argument in $a is a hamcrest matcher, call match on it. WONTFIX: Can't check if function was passed a hamcrest matcher
if (interface_exists('Hamcrest_Matcher') && ($u instanceof Hamcrest_Matcher || isset($u->__phockito_matcher))) {
// The matcher can either be passed directly, or wrapped in a mock (for type safety reasons)
$matcher = null;
if ($u instanceof Hamcrest_Matcher) {
$matcher = $u;
} elseif (isset($u->__phockito_matcher)) {
$matcher = $u->__phockito_matcher;
}
if ($matcher != null && !$matcher->matches($v)) return false;
}
// Otherwise check for equality by checking the equality of the serialized version
else {
if (serialize($u) != serialize($v)) return false;
}
}
return true;
}
/**
* Called by the mock instances when a method is called. Records the call and returns a response if one has been
* stubbed in
*/
public static function __called($class, $instance, $method, $args) {
// Record the call as most recent first
array_unshift(self::$_call_list, array(
'class' => $class,
'instance' => $instance,
'method' => $method,
'args' => $args
));
// Look up any stubbed responses
if (isset(self::$_responses[$instance][$method])) {
// Find the first one that matches the called-with arguments
foreach (self::$_responses[$instance][$method] as $i => &$matcher) {
if (self::_arguments_match($class, $method, $matcher['args'], $args)) {
// Consume the next response - except the last one, which repeats indefinitely
if (count($matcher['steps']) > 1) return array_shift($matcher['steps']);
else return reset($matcher['steps']);
}
}
}
}
public static function __perform_response($response, $args) {
if ($response['action'] == 'return') return $response['value'];
else if ($response['action'] == 'throw') {
/** @var Exception $class */
$class = $response['value'];
throw (is_object($class) ? $class : new $class());
}
else if ($response['action'] == 'callback') return call_user_func_array($response['value'], $args);
else user_error("Got unknown action {$response['action']} - how did that happen?", E_USER_ERROR);
}
/* ** INTERNAL INTERFACES END ** */
/**
* Passed a class as a string to create the mock as, and the class as a string to mock,
* create the mocking class php and eval it into the current running environment
*
* @static
* @param bool $partial - Should test double be a partial or a full mock
* @param string $mockedClass - The name of the class (or interface) to create a mock of
* @return string The name of the mocker class
*/
protected static function build_test_double($partial, $mockedClass) {
// Bail if we were passed a classname that doesn't exist
if (!class_exists($mockedClass) && !interface_exists($mockedClass)) user_error("Can't mock non-existent class $mockedClass", E_USER_ERROR);
// How to get a reference to the Phockito class itself
$phockito = self::_has_namespaces() ? '\\Phockito' : 'Phockito';
// Reflect on the mocked class
$reflect = new ReflectionClass($mockedClass);
if ($reflect->isFinal()) user_error("Can't mock final class $mockedClass", E_USER_ERROR);
// Build up an array of php fragments that make the mocking class definition
$php = array();
// Get the namespace & the shortname of the mocked class
if (self::_has_namespaces()) {
$mockedNamespace = $reflect->getNamespaceName();
$mockedShortName = $reflect->getShortName();
}
else {
$mockedNamespace = '';
$mockedShortName = $mockedClass;
}
// Build the short name of the mocker class based on the mocked classes shortname
$mockerShortName = self::MOCK_PREFIX.$mockedShortName.($partial ? '_Spy' : '_Mock');
// And build the full class name of the mocker by prepending the namespace if appropriate
$mockerClass = (self::_has_namespaces() ? $mockedNamespace.'\\' : '') . $mockerShortName;
// If we've already built this test double, just return it
if (class_exists($mockerClass, false)) return $mockerClass;
// If the mocked class is in a namespace, the test double goes in the same namespace
$namespaceDeclaration = $mockedNamespace ? "namespace $mockedNamespace;" : '';
// The only difference between mocking a class or an interface is how the mocking class extends from the mocked
$extends = $reflect->isInterface() ? 'implements' : 'extends';
$marker = $reflect->isInterface() ? ", {$phockito}_MockMarker" : "implements {$phockito}_MockMarker";
// When injecting the class as a string, need to escape the "\" character.
$mockedClassString = "'".str_replace('\\', '\\\\', $mockedClass)."'";
// Add opening class stanza
$php[] = <<<EOT
$namespaceDeclaration
class $mockerShortName $extends $mockedShortName $marker {
public \$__phockito_class;
public \$__phockito_instanceid;
function __construct() {
\$this->__phockito_class = $mockedClassString;
\$this->__phockito_instanceid = $mockedClassString.':'.(++{$phockito}::\$_instanceid_counter);
}
EOT;
// And record the defaults at the same time
self::$_defaults[$mockedClass] = array();
// And whether it's an interface
self::$_is_interface[$mockedClass] = $reflect->isInterface();
// Track if the mocked class defines either of the __call and/or __toString magic methods
$has__call = $has__toString = false;
// Step through every method declared on the object
foreach ($reflect->getMethods() as $method) {
// Skip private methods. They shouldn't ever be called anyway
if ($method->isPrivate()) continue;
// Either skip or throw error on final methods.
if ($method->isFinal()) {
if (self::$ignore_finals) continue;
else user_error("Class $mockedClass has final method {$method->name}, which we can\'t mock", E_USER_WARNING);
}
// Get the modifiers for the function as a string (static, public, etc) - ignore abstract though, all mock methods are concrete
$modifiers = implode(' ', Reflection::getModifierNames($method->getModifiers() & ~(ReflectionMethod::IS_ABSTRACT)));
// See if the method is return byRef
$byRef = $method->returnsReference() ? "&" : "";
// PHP fragment that is the arguments definition for this method
$defparams = array(); $callparams = array();
// Array of defaults (sparse numeric)
self::$_defaults[$mockedClass][$method->name] = array();
foreach ($method->getParameters() as $i => $parameter) {
// Turn the method arguments into a php fragment that calls a function with them
$callparams[] = '$'.$parameter->getName();
// Get the type hint of the parameter
if ($parameter->isArray()) $type = 'array ';
else if ($parameterClass = $parameter->getClass()) $type = '\\'.$parameterClass->getName().' ';
else $type = '';
try {
$defaultValue = $parameter->getDefaultValue();
}
catch (ReflectionException $e) {
$defaultValue = null;
}
// Turn the method arguments into a php fragment the defines a function with them, including possibly the by-reference "&" and any default
$defparams[] =
$type .
($parameter->isPassedByReference() ? '&' : '') .
'$'.$parameter->getName() .
($parameter->isOptional() ? '=' . var_export($defaultValue, true) : '')
;
// Finally cache the default value for matching against later
if ($parameter->isOptional()) self::$_defaults[$mockedClass][$method->name][$i] = $defaultValue;
}
// Turn that array into a comma seperated list
$defparams = implode(', ', $defparams); $callparams = implode(', ', $callparams);
// What to do if there's no stubbed response
if ($partial && !$method->isAbstract()) {
$failover = "call_user_func_array(array($mockedClassString, '{$method->name}'), \$args)";
}
else {
$failover = "null";
}
// Constructor is handled specially. For spies, we do call the parent's constructor. For mocks we ignore
if ($method->name == '__construct') {
if ($partial) {
$php[] = <<<EOT
function __phockito_parent_construct( $defparams ){
parent::__construct( $callparams );
}
EOT;
}
}
elseif ($method->name == '__call') {
$has__call = true;
}
elseif ($method->name == '__toString') {
$has__toString = true;
}
// Build an overriding method that calls Phockito::__called, and never calls the parent
else {
$php[] = <<<EOT
$modifiers function $byRef {$method->name}( $defparams ){
\$args = func_get_args();
\$backtrace = debug_backtrace();
\$instance = \$backtrace[0]['type'] == '::' ? ('::'.$mockedClassString) : \$this->__phockito_instanceid;
\$response = {$phockito}::__called($mockedClassString, \$instance, '{$method->name}', \$args);
\$result = \$response ? {$phockito}::__perform_response(\$response, \$args) : ($failover);
return \$result;
}
EOT;
}
}
// Always add a __call method to catch any calls to undefined functions
$failover = ($partial && $has__call) ? "parent::__call(\$name, \$args)" : "null";
$php[] = <<<EOT
function __call(\$name, \$args) {
\$response = {$phockito}::__called($mockedClassString, \$this->__phockito_instanceid, \$name, \$args);
if (\$response) return {$phockito}::__perform_response(\$response, \$args);
else return $failover;
}
EOT;
// Always add a __toString method
if ($partial) {
if ($has__toString) $failover = "parent::__toString()";
else $failover = "user_error('Object of class '.$mockedClassString.' could not be converted to string', E_USER_ERROR)";
}
else $failover = "''";
$php[] = <<<EOT
function __toString() {
\$args = array();
\$response = {$phockito}::__called($mockedClassString, \$this->__phockito_instanceid, "__toString", \$args);
if (\$response) return {$phockito}::__perform_response(\$response, \$args);
else return $failover;
}
EOT;
// Close off the class definition and eval it to create the class as an extant entity.
$php[] = '}';
// Debug: uncomment to spit out the code we're about to compile to stdout
// echo "\n" . implode("\n\n", $php) . "\n";
eval(implode("\n\n", $php));
return $mockerClass;
}
/**
* Given a class name as a string, return a new class name as a string which acts as a mock
* of the passed class name. Probably not useful by itself until we start supporting static method stubbing
*
* @static
* @param string $class - The class to mock
* @return string - The class that acts as a Phockito mock of the passed class
*/
static function mock_class($class) {
$mockClass = self::build_test_double(false, $class);
// If we've been given a type registrar, call it (we need to do this even if class exists, since PHPUnit resets globals, possibly de-registering between tests)
$type_registrar = self::$type_registrar;
if ($type_registrar) $type_registrar::register_double($mockClass, $class, self::$_is_interface[$class]);
return $mockClass;
}
/**
* Given a class name as a string, return a new instance which acts as a mock of that class
*
* @static
* @param string $class - The class to mock
* @return Object - A mock of that class
*/
static function mock_instance($class) {
$mockClass = self::mock_class($class);
return new $mockClass();
}
/**
* Aternative name for mock_instance
*/
static function mock($class) {
return self::mock_instance($class);
}
static function spy_class($class) {
$spyClass = self::build_test_double(true, $class);
// If we've been given a type registrar, call it (we need to do this even if class exists, since PHPUnit resets globals, possibly de-registering between tests)
$type_registrar = self::$type_registrar;
if ($type_registrar) $type_registrar::register_double($spyClass, $class, self::$_is_interface[$class]);
return $spyClass;
}
const DONT_CALL_CONSTRUCTOR = '__phockito_dont_call_constructor';
static function spy_instance($class /*, $constructor_arg_1, ... */) {
$spyClass = self::spy_class($class);
$res = new $spyClass();
// Find the constructor args
$constructor_args = func_get_args();
array_shift($constructor_args);
// Call the constructor (maybe)
if (count($constructor_args) != 1 || $constructor_args[0] !== self::DONT_CALL_CONSTRUCTOR) {
$constructor = array($res, '__phockito_parent_construct');
if (!is_callable($constructor)) {
if ($constructor_args) user_error("Tried to create spy of $class with constructor args, but that $class doesn't have a constructor defined", E_USER_ERROR);
}
else {
call_user_func_array($constructor, $constructor_args);
}
}
// And done
return $res;
}
static function spy() {
$args = func_get_args();
return call_user_func_array(array(__CLASS__, 'spy_instance'), $args);
}
/**
* When builder. Starts stubbing the method called to build the argument passed to when
*
* @static
* @return Phockito_WhenBuilder
*/
static function when($arg = null) {
if ($arg instanceof Phockito_MockMarker) {
return new Phockito_WhenBuilder($arg->__phockito_instanceid);
}
else {
$method = array_shift(self::$_call_list);
return new Phockito_WhenBuilder($method['instance'], $method['method'], $method['args']);
}
}
/**
* Verify builder. Takes a mock instance and an optional number of times to verify against. Returns a
* DSL object that catches the method to verify
*
* @static
* @param Phockito_Mock $mock - The mock instance to verify
* @param string $times - The number of times the method should be called, either a number, or a number followed by "+"
* @return Phockito_VerifyBuilder
*/
static function verify($mock, $times = 1) {
return new Phockito_VerifyBuilder($mock->__phockito_class, $mock->__phockito_instanceid, $times);
}
/**
* Reset a mock instance. Forget all calls and stubbed responses for a given instance
* @static
* @param Phockito_Mock $mock - The mock instance to reset
*/
static function reset($mock, $method = null) {
// Get the instance ID. Only resets instance-specific info ATM
$instance = $mock->__phockito_instanceid;
// Remove any stored returns
if ($method) unset(self::$_responses[$instance][$method]);
else unset(self::$_responses[$instance]);
// Remove all call history
foreach (self::$_call_list as $i => $call) {
if ($call['instance'] == $instance && ($method == null || $call['method'] == $method)) array_splice(self::$_call_list, $i, 1);
}
}
/**
* Includes the Hamcrest matchers. You don't have to, but if you don't you can't to nice generic stubbing and verification
* @static
* @param bool $as_globals - When true (the default) the hamcrest matchers are available as global functions. If false, they're only available as static methods on Hamcrest_Matchers
*/
static function include_hamcrest($include_globals = true) {
set_include_path(get_include_path().PATH_SEPARATOR.dirname(__FILE__).'/hamcrest-php/hamcrest');
if ($include_globals) {
require_once('Hamcrest.php');
require_once('HamcrestTypeBridge_Globals.php');
} else {
require_once('Hamcrest/Matchers.php');
require_once('HamcrestTypeBridge.php');
}
}
}
/**
* Marks all mocks for easy identification
*/
interface Phockito_MockMarker {
}
/**
* A builder than is returned by Phockito::when to capture the methods that specify the stubbed responses
* for a particular mocked method / arguments set
*
* @method Phockito_WhenBuilder return($value) thenReturn($value)
* @method Phockito_WhenBuilder throw($exception) thenThrow($exception)
* @method Phockito_WhenBuilder callback($callback) thenCallback($callback)
* @method Phockito_WhenBuilder then($arg)
*/
class Phockito_WhenBuilder {
protected $instance;
protected $method;
protected $i;
protected $lastAction = null;
/**
* Store the method and args we're stubbing
*/
private function __phockito_setMethod($method, $args) {
$instance = $this->instance;
$this->method = $method;
if (!isset(Phockito::$_responses[$instance])) Phockito::$_responses[$instance] = array();
if (!isset(Phockito::$_responses[$instance][$method])) Phockito::$_responses[$instance][$method] = array();
$this->i = count(Phockito::$_responses[$instance][$method]);
Phockito::$_responses[$instance][$method][] = array(
'args' => $args,
'steps' => array()
);
}
function __construct($instance, $method = null, $args = null) {
$this->instance = $instance;
if ($method) $this->__phockito_setMethod($method, $args);
}
/**
* Either record the method we're stubbing, or record the next stubbed response in the sequence if we know the stubbed method already
*
* To be as flexible as possible, we accept _any_ method with "return" in it as a return response, and anything with
* throw in it as a throw response.
*/
function __call($called, $args) {
if (!$this->method) {
$this->__phockito_setMethod($called, $args);
}
else {
if (count($args) !== 1) user_error("$called requires exactly one argument", E_USER_ERROR);
$value = $args[0]; $action = null;
if (preg_match('/return/i', $called)) $action = 'return';
else if (preg_match('/throw/i', $called)) $action = 'throw';
else if (preg_match('/callback/i', $called)) $action = 'callback';
else if ($called == 'then') {
if ($this->lastAction) {
$action = $this->lastAction;
} else {
user_error(
"Cannot use then without previously invoking a \"return\", \"throw\", or \"callback\" action",
E_USER_ERROR
);
}
}
else user_error(
"Unknown when action $called - should contain \"return\", \"throw\" or \"callback\" somewhere in method name",
E_USER_ERROR
);
Phockito::$_responses[$this->instance][$this->method][$this->i]['steps'][] = array(
'action' => $action,
'value' => $value
);
$this->lastAction = $action;
}
return $this;
}
}
/**
* A builder than is returned by Phockito::verify to capture the method that specifies the verified method
* Throws an exception if the verified method hasn't been called "$times" times, either a PHPUnit exception
* or just an Exception if PHPUnit doesn't exist
*/
class Phockito_VerifyBuilder {
static $exception_class = null;
protected $class;
protected $instance;
protected $times;
function __construct($class, $instance, $times) {
$this->class = $class;
$this->instance = $instance;
$this->times = $times;
if (self::$exception_class === null) {
if (class_exists('PHPUnit_Framework_AssertionFailedError')) self::$exception_class = "PHPUnit_Framework_AssertionFailedError";
else self::$exception_class = "Exception";
}
}
function __call($called, $args) {
$count = 0;
foreach (Phockito::$_call_list as $call) {
if ($call['instance'] == $this->instance && $call['method'] == $called && Phockito::_arguments_match($this->class, $called, $args, $call['args'])) {
$count++;
}
}
if (preg_match('/([0-9]+)\+/', $this->times, $match)) {
if ($count >= (int)$match[1]) return;
}
else {
if ($count == $this->times) return;
}
$message = "Failed asserting that method $called was called {$this->times} times - actually called $count times.\n";
$message .= "Wanted call:\n";
$message .= print_r($args, true);
$message .= "Calls:\n";
foreach (Phockito::$_call_list as $call) {
if ($call['instance'] == $this->instance && $call['method'] == $called) {
$message .= print_r($call['args'], true);
}
}
$exceptionClass = self::$exception_class;
throw new $exceptionClass($message);
}
}
|
__label__pos
| 0.99779 |
blob: cbac8e608dc4df7c01a351ef1178ef3697b01209 [file] [log] [blame]
# -*- coding: utf-8; mode: python -*-
# pylint: disable=W0141,C0113,C0103,C0325
u"""
cdomain
~~~~~~~
Replacement for the sphinx c-domain.
:copyright: Copyright (C) 2016 Markus Heiser
:license: GPL Version 2, June 1991 see Linux/COPYING for details.
List of customizations:
* Moved the *duplicate C object description* warnings for function
declarations in the nitpicky mode. See Sphinx documentation for
the config values for ``nitpick`` and ``nitpick_ignore``.
* Add option 'name' to the "c:function:" directive. With option 'name' the
ref-name of a function can be modified. E.g.::
.. c:function:: int ioctl( int fd, int request )
:name: VIDIOC_LOG_STATUS
The func-name (e.g. ioctl) remains in the output but the ref-name changed
from 'ioctl' to 'VIDIOC_LOG_STATUS'. The function is referenced by::
* :c:func:`VIDIOC_LOG_STATUS` or
* :any:`VIDIOC_LOG_STATUS` (``:any:`` needs sphinx 1.3)
* Handle signatures of function-like macros well. Don't try to deduce
arguments types of function-like macros.
"""
from docutils import nodes
from docutils.parsers.rst import directives
import sphinx
from sphinx import addnodes
from sphinx.domains.c import c_funcptr_sig_re, c_sig_re
from sphinx.domains.c import CObject as Base_CObject
from sphinx.domains.c import CDomain as Base_CDomain
__version__ = '1.0'
# Get Sphinx version
major, minor, patch = sphinx.version_info[:3]
def setup(app):
if (major == 1 and minor < 8):
app.override_domain(CDomain)
else:
app.add_domain(CDomain, override=True)
return dict(
version = __version__,
parallel_read_safe = True,
parallel_write_safe = True
)
class CObject(Base_CObject):
"""
Description of a C language object.
"""
option_spec = {
"name" : directives.unchanged
}
def handle_func_like_macro(self, sig, signode):
u"""Handles signatures of function-like macros.
If the objtype is 'function' and the the signature ``sig`` is a
function-like macro, the name of the macro is returned. Otherwise
``False`` is returned. """
if not self.objtype == 'function':
return False
m = c_funcptr_sig_re.match(sig)
if m is None:
m = c_sig_re.match(sig)
if m is None:
raise ValueError('no match')
rettype, fullname, arglist, _const = m.groups()
arglist = arglist.strip()
if rettype or not arglist:
return False
arglist = arglist.replace('`', '').replace('\\ ', '') # remove markup
arglist = [a.strip() for a in arglist.split(",")]
# has the first argument a type?
if len(arglist[0].split(" ")) > 1:
return False
# This is a function-like macro, it's arguments are typeless!
signode += addnodes.desc_name(fullname, fullname)
paramlist = addnodes.desc_parameterlist()
signode += paramlist
for argname in arglist:
param = addnodes.desc_parameter('', '', noemph=True)
# separate by non-breaking space in the output
param += nodes.emphasis(argname, argname)
paramlist += param
return fullname
def handle_signature(self, sig, signode):
"""Transform a C signature into RST nodes."""
fullname = self.handle_func_like_macro(sig, signode)
if not fullname:
fullname = super(CObject, self).handle_signature(sig, signode)
if "name" in self.options:
if self.objtype == 'function':
fullname = self.options["name"]
else:
# FIXME: handle :name: value of other declaration types?
pass
return fullname
def add_target_and_index(self, name, sig, signode):
# for C API items we add a prefix since names are usually not qualified
# by a module name and so easily clash with e.g. section titles
targetname = 'c.' + name
if targetname not in self.state.document.ids:
signode['names'].append(targetname)
signode['ids'].append(targetname)
signode['first'] = (not self.names)
self.state.document.note_explicit_target(signode)
inv = self.env.domaindata['c']['objects']
if (name in inv and self.env.config.nitpicky):
if self.objtype == 'function':
if ('c:func', name) not in self.env.config.nitpick_ignore:
self.state_machine.reporter.warning(
'duplicate C object description of %s, ' % name +
'other instance in ' + self.env.doc2path(inv[name][0]),
line=self.lineno)
inv[name] = (self.env.docname, self.objtype)
indextext = self.get_index_text(name)
if indextext:
if major == 1 and minor < 4:
# indexnode's tuple changed in 1.4
# https://github.com/sphinx-doc/sphinx/commit/e6a5a3a92e938fcd75866b4227db9e0524d58f7c
self.indexnode['entries'].append(
('single', indextext, targetname, ''))
else:
self.indexnode['entries'].append(
('single', indextext, targetname, '', None))
class CDomain(Base_CDomain):
"""C language domain."""
name = 'c'
label = 'C'
directives = {
'function': CObject,
'member': CObject,
'macro': CObject,
'type': CObject,
'var': CObject,
}
|
__label__pos
| 0.971625 |
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
Dirac writes down the following formula on page 61 of his "Principles of quantum mechanics": $\frac{d}{dx}\log x = \frac{1}{x} -i\pi\delta(x)$, see http://adsabs.harvard.edu/abs/1947pqm..book.....D for the exact reference (but no text). What is the best way of formalizing this to a mathematician's satisfaction?
share|cite|improve this question
8
I'm sure Dirac was thinking that ln(x)=ln|x|+i H(-x)π, where H(x) is the Heavside step function. – Tom Copeland Apr 15 '13 at 10:27
2
@Tom, in the text surrounding that formula, Dirac states precisely that (though less explicitly). – Igor Khavkine Apr 15 '13 at 11:21
6
Your information seems to be out of date. We mathematicians have been satisfied with $H$ and its derivatives for over 60 years. Also, the last equation in your comment has a spurious absolute value sign. – S. Carnahan Apr 15 '13 at 12:40
3
Is the logic tag used as a pun? – Andrés Caicedo Apr 15 '13 at 18:42
6
I would write Dirac's formula as $\log(x+i0^+)= p.v.\frac{1}{x}−i\pi \delta(x)$, and this is now a perfectly rigorous equation in the space of distributions (using whatever branch of the logarithm one wishes which does not cut ${\bf R}+i0^+$), indeed it is just the Plemelj formula given in the answers below, written in distributional form. – Terry Tao Apr 15 '13 at 21:50
up vote 13 down vote accepted
In integral form, this amounts to the Sokhotski-Plemelj theorem:
$\lim_{\epsilon\rightarrow 0^{+}}\int_{-\infty}^{\infty}dx f(x) \frac{d}{dx}\log (x+i\epsilon)=-i\pi f(0)+{\cal P}\int_{-\infty}^{\infty}dx f(x)\frac{1}{x}$.
The symbol ${\cal P}$ indicates that the Cauchy principal value of the integral is to be taken. Formalization then amounts to stating the conditions on $f$ so that the principal value integral exists.
The logarithm for $x<0$ is defined as $\log x= \log(-x) + i\pi$. You can avoid the delta function by including the absolute value signs in the logarithm:
$\int_{-\infty}^{\infty}dx f(x) \frac{d}{dx}\log|x|={\cal P}\int_{-\infty}^{\infty}dx f(x)\frac{1}{x}$.
share|cite|improve this answer
Thanks, but somehow that looks less elegant than Dirac's formula. – Mikhail Katz Apr 15 '13 at 9:07
2
less elegant, perhaps, but you do need to specify that the principal value is to be taken, otherwise the formula is not correct (or not complete). – Carlo Beenakker Apr 15 '13 at 9:16
Thanks for the reference. I think it should be "Plemelj". One can specify a branch of log and still hope for a more direct formalisation with functions having local values. – Mikhail Katz Apr 15 '13 at 12:54
typo corrected. – Carlo Beenakker Apr 15 '13 at 13:21
2
You may cirticize this as "less elegant" but others can criticize the original Dirac formula as "less rigorous". – Gerald Edgar Apr 15 '13 at 20:47
Questions about distributions, usually involving the $\delta$ distribution ("function"), are of frequent occurrence on this and related sites. Since they are often treated in a rather cavalier fashion, I would like to attempt to answer this query in some detail. The basic problem lies in the interpretation of the functions $\frac 1 x$ and $\log x$ (notabene not $\log |x| $) as distributions. As a preliminary remark, it is not surprising that theoretical physicists are guided by their physical intuition and not by mathematical rigour in dealing with such questions and it is perfectly acceptable for mathematicians to proceed in the same way in formulating such conjectures. However, since this is a mathematical forum, one does have the right to expect that the final formulation of the solution conforms to the usual standards of mathematical rigour (as is implied in the OP). In fact it is rather disquieting that this is often not the case, since this task can be achieved by elementary methods which have been on record in the primary and secondary literature for at least 50 years.
For the example in question (and, indeed, for most of the examples in such forums), one need only be cognisant of the following simple facts about distributions.
$1$. Every continuous function on the reals, better, every locally integrable function, determines in a natural way a distribution.
$2$. There is a notion of convergence for distributions. For our purposes, it suffices to know that if a sequence of continuous functions converges uniformly on compacts, then it converges in the sense of distributions. In fact, local $L^1$ convergence suffices.
$3$. The dream theorem of every freshman calculus student holds---if a sequence of distributions converges, then the sequence obtained by differentiating term by term also converges.
We can now turn to the above query. Note that the problem lies in the fact that while the function $\log |x|$, being locally integrable, determines a distribution, the same is not true a priori for $\frac 1 x$ and $\log x $. In these two cases, we have to proceed in a more delicate manner.
Firstly, note that the function $\log |x|$ is locally integrable and so is a distribution. More importantly the same is true for its derivative in the distributional sense. It is then rather natural to define this derivative to be the distribution $\frac 1 x$.
The case of the distribution $\log x$ is rather more subtle. In this case we resort to the complex logarithm. y thus we define, for non-zero $\epsilon $, the distribution $\log(x+i\epsilon)$ to be $\log|x|+i \arctan \frac \epsilon x$ (i.e., we are using the principal branch of the complex logarithm). We now define the distribution $\log x $ to be the limit of this distribution as $\epsilon$ tends to zero. At this point, we see that we get different values, depending on whether we consider the limit $\epsilon \to 0_+$ or $\epsilon \to 0_-$. If we now differentiate this equation we obtain the required formula.
To conclude, a few remarks.
The above approach is due to the portuguese mathematician J. Sebastião e Silva who developed it in the context of his axiomatic approach to the theory of distributions.
Sadly, the definitive monograph on his approach that he was preparing 40 years ago was never completed, due to his premature passing.
However, the elementary part has been presented in the book "An introduction to the theory of distributions" by Campos Ferreira which is based on lectures at the University of Lisbon (ca. 1970) and this contains the material described here.
The above is a special case of the family of distributions $x^\lambda$ for general $\lambda$ (even complex) which is developed in detail in the above reference. They are also described in the standard four volume text of Gelfand and Silov.
The distribution $\frac 1 x$ is also treated by Laurent Schwartz who used the Hadamard principal value (the latter was his great uncle by marriage). The connection with the above approach can easily be established by considering the truncated function $\log_\epsilon$ (which is set equal to zero on the interval $]-\epsilon,\epsilon[$), letting $\epsilon$ tend to zero and differentiating.
The ambiguity in the definition of the distribution $\log x$ is no more disconcerting than that in the definition of the logarithm function for complex arguments. In a more sophisticated approach this distribution would not be defined on the real line but on the natural domain of definition of the latter, i.e., on the unversal covering of the punctured plane.
share|cite|improve this answer
1
Really, weren't the results for the limiting case of the derivative of the log worked out fairly rigorously by Cauchy and Poisson in their work on potential theory long before 20'th century mathematicians put a formal dress on them? – Tom Copeland Apr 15 '13 at 23:49
$$ \lim_{\epsilon \rightarrow0} \int_{-\epsilon}^{+\epsilon}\frac{d\ln x}{dx} dx = \lim_{\epsilon \rightarrow0}[\ln \epsilon-\ln(-\epsilon)] \\ \ln(-\epsilon)= \ln\epsilon+ i\Theta \\ $$ choose the principle value for the angle$$ \Theta=\theta= \pi \\ \lim_{\epsilon \rightarrow0} \int_{-\epsilon}^{+\epsilon}d\ln x = \lim_{\epsilon \rightarrow0}[\ln \epsilon-\ln(-\epsilon)] =\lim_{\epsilon \rightarrow0}[\ln \epsilon-\ln(\epsilon)-i\pi]=-i\pi $$
$$\lim_{\epsilon \rightarrow0} \int_{-\epsilon}^{+\epsilon}\frac{1}{x}dx =0$$ Because 1/x is a odd function, thus its integral vanished.
The left hand side equals to $-i\pi$, thus we need add $-i\pi$ to the right hand side.
Above all, we can obtain
$$ \lim_{\epsilon \rightarrow0} \int_{-\epsilon}^{+\epsilon}\frac{d\ln x}{dx} dx = \lim_{\epsilon \rightarrow0} \int_{-\epsilon}^{+\epsilon}\frac{1}{x}dx -i\pi= \lim_{\epsilon \rightarrow0} \int_{-\epsilon}^{+\epsilon}\frac{1}{x}- i\pi\delta(x)\ dx$$
According to the inside parts of integrals, we finally got $$ \frac{d\ln x}{dx} =\frac{1}{x}- i\pi\delta(x) $$
share|cite|improve this answer
The question is not meaningful since $\ln x$ is not defined for $x\le 0$. You may define, with derivatives in the distribution sense $$ f(x)=\ln\vert x\vert\text{ (even)},\quad f'(x)=pv\frac1{x} \text{ (odd, homogeneous degree -1)} $$ $$ g(x)=\ln(x+i0)=\lim_{\epsilon\rightarrow 0_+}\ln(x+i\epsilon),\quad g'(x)=\frac{1}{x+i0}= pv\frac1{x}-i\pi \delta, \text{(homogeneous degree -1)} $$ where the latter formula follows from $$ \ln(z)=\oint_{[1,z]}\frac{d\xi}{\xi},\quad z\in \mathbb C\backslash \mathbb R_-. $$ By analytic continuation we have (for $z\in \mathbb C\backslash \mathbb R_-$) $e^{\ln z}=z$ and with $H=\mathbf 1_{\mathbb R_+}$ $$ \ln(x+i0)=\ln\vert x\vert +i\pi H(-x)\Longrightarrow g'(x)=\frac{1}{x+i0}= pv\frac1{x}-i\pi \delta. $$ Taking the complex conjugate of $g$ gives you the definition of $\frac{1}{x-i0}$.
share|cite|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.932858 |
normals not behaving on generic un-mod'd objects,
hey all
those pesky normals are at it again!
I created a circle. extruded it on the z axis then extruded again and sized it in some to create a ring (for a circus). then hit smooth shading, as per usual.
when the smooth shading is introduced the normals just go crazy. ive hit flip and recalculate several times but it barely does anything.
i had this problem yesterday on a resized cube. all i did was resize it and hit smooth again.
these are just basic shapes. whats going on?
It would be helpful if you could tell us which version of blender you are using, and if you could upload the blend files with objects acting strange. When you extrude a circle, the normals will act a bit strange, but When I tested it in Blender 2.56, recalculating normals fixed the problem.
Ctrl-N fixed it for me too. However try also Ctrl-A in object mode, then apply the Loc Rot & Scale.
|
__label__pos
| 0.907798 |
Inline admin forms with admin site links in Django
I have a somewhat difficult relationship with Django's admin site. It's a very useful feature, but I haven't really done enough with it to know when I'm going to hit a wall, if that wall's in the code or in my understanding, and how hard it's going to be to climb over the wall.
This time I wanted to have inline admin forms, except that I didn't actually want to have the forms there, I just wanted to have links to the objects — and not their views on the actual site, but on the admin site. As far as I can tell, there's no built-in support for this.
According to the admin docs, there are two subclasses of InlineModelAdmin: TabularInline and StackedInline. Looking at django/contrib/admin/options.py confirms this. And as the docs say, the only difference is the template they use. The stacked version comes pretty close when we add all the fields to an InlineModelAdmin subclass's exclude array, but it doesn't have the link.
To solve this we first create a new subclass:
class LinkedInline(admin.options.InlineModelAdmin):
template = "admin/edit_inline/linked.html"
When you want to create inline links to a model, you subclass this new LinkedInline class. So to use a slightly contrived example, if we have a Flight with Passengers:
class PassengerInline(LinkedInline):
model = models.Passenger
extra = 0
exclude = [ "name", "sex" ] # etc
class FlightAdmin(admin.ModelAdmin):
inlines = [ PassengerInline ]
And yes, we have to exclude all the fields explicitly: an empty fields tuple or list is ignored.
The new template is easiest to create by cutting down aggressively the stacked template. Like this:
{% load i18n %}
<div class="inline-group">
<h2>{{ inline_admin_formset.opts.verbose_name_plural|title}}</h2>
{{ inline_admin_formset.formset.management_form }}
{{ inline_admin_formset.formset.non_form_errors }}
{% for inline_admin_form in inline_admin_formset %}
<div class="inline-related {% if forloop.last %}last-related{% endif %}">
<h3><b>{{ inline_admin_formset.opts.verbose_name|title }}:</b> {% if inline_admin_form.original %}{{ inline_admin_form.original }}{% else %} #{{ forloop.counter }}{% endif %}
{% if inline_admin_formset.formset.can_delete and inline_admin_form.original %}<span class="delete">{{ inline_admin_form.deletion_field.field }} {{ inline_admin_form.deletion_field.label_tag }}</span>{% endif %}
</h3>
{{ inline_admin_form.pk_field.field }}
{{ inline_admin_form.fk_field.field }}
</div>
{% endfor %}
</div>
The primary/foreign key fields are necessary to keep Django happy.
The result looks about right, it just lacks the links. It seems that Django doesn't give the template all the information we need to make them work: there's root_path that gives us /admin/, app_label contains the application's name and inline_admin_form.original.id contains the id of the inline object. What is lacking is the path component that names the model. I don't think it's available by default (is there a clean way to ask Django what's available in a template's context?), so we need to add it. Amend LinkedInline to look like this:
class LinkedInline(admin.options.InlineModelAdmin):
template = "admin/edit_inline/linked.html"
admin_model_path = None
def __init__(self, *args):
super(LinkedInline, self).__init__(*args)
if self.admin_model_path is None:
self.admin_model_path = self.model.__name__.lower()
Now inline_admin_formset.opts.admin_model_path will be bound to the lowercase name of the inline object's model, which is what the admin site uses in its paths.
With this, we can now replace the inline-related div in the template with this:
<div class="inline-related {% if forloop.last %}last-related{% endif %}">
<h3><b>{{ inline_admin_formset.opts.verbose_name|title }}:</b> <a href="{{ root_path }}{{ app_label }}/{{ inline_admin_formset.opts.admin_model_path }}/{{ inline_admin_form.original.id }}/">{% if inline_admin_form.original %}{{ inline_admin_form.original }}{% else %} #{{ forloop.counter }}{% endif %}</a>
{% if inline_admin_formset.formset.can_delete and inline_admin_form.original %}<span class="delete">{{ inline_admin_form.deletion_field.field }} {{ inline_admin_form.deletion_field.label_tag }}</span>{% endif %}
</h3>
{{ inline_admin_form.pk_field.field }}
{{ inline_admin_form.fk_field.field }}
</div>
That's it. Now Flights get links to Passengers without big forms cluttering up the page.
© Juri Pakaste 2021
|
__label__pos
| 0.652411 |
4
votes
1answer
9k views
Are there any downsides to leaving personal hotspot perpetually on?
I am primarily concerned if this will drain my battery if I leave personal hotspot on. Is it worth the mental time to turn off the hotspot in order to conserve battery? I run iOS 6 on an iPhone 4s.
2
votes
3answers
5k views
Does personal hotspot always use cellular data?
If I have my iPhone connected to a wifi connection, then put it on personal hotspot, is the device I'm connecting to my iPhone with using cellular data bandwidth, or the wifi bandwidth? You'd think ...
1
vote
1answer
1k views
iPhone 4S crashed, Wifi crashed, Personal Hotspot gone
My iPhone 4S, which i got in October, just crashed out of the blue and wouldn't restart. After reading other people's blogs I managed to restart by holding the main button and on/off button together. ...
|
__label__pos
| 0.745325 |
Andy Wardley > Badger > Badger::URL
Download:
Badger-0.09.tar.gz
Dependencies
Annotate this POD
CPAN RT
New 1
Open 0
View/Report Bugs
Source
NAME ^
Badger::URL - representation of a Uniform Resource Locator (URL)
SYNOPSIS ^
use Badger::URL;
# all-in-one URL string
my $url = Badger::URL->new(
'http://[email protected]:8080/under/ground?animal=badger#stripe'
);
# named parameters
my $url = Badger::URL->new(
scheme => 'http',
user => 'abw',
host => 'badgerpower.com',
port => '8080',
path => '/under/ground',
query => 'animal=badger',
fragment => 'stripe',
);
# methods to access standard W3C parts of URL
print $url->scheme; # http
print $url->authority; # [email protected]:8080
print $url->user; # abw
print $url->host; # badgerpower.com
print $url->port; # 8080
print $url->path; # /under/ground
print $url->query; # animal=badger
print $uri->fragment; # stripe
# additional composite methods:
print $url->server;
# http://[email protected]:8080
print $url->service;
# http://[email protected]:8080/under/ground
print $url->request;
# http://[email protected]:8080/under/ground?animal=badger
# method to return the whole URL
print $url->url();
# http://[email protected]:8080/under/ground?animal=badger#stripe
# overloaded stringification operator calls url() method
print $url;
# http://[email protected]:8080/under/ground?animal=badger#stripe
DESCRIPTION ^
This module implements an object for representing URLs. It can parse existing URLs to break them down into their constituent parts, and also to generate new or modified URLs.
The emphasis is on simplicity and convenience for tasks related to web programming (e.g. dispatching web applications based on the URL, generating URLs for redirects or embedding as links in HTML pages). If you want more generic URI functionality then you should consider using the URI module.
A URL looks like this:
http://[email protected]:8080/under/ground?animal=badger#stripe
\__/ \______________________/\___________/ \___________/ \____/
| | | | |
scheme authority path query fragment
The authority part can be broken down further:
[email protected]:8080
\_/ \_____________/ \__/
| | |
user host port
A Badger::URL object will parse a URL and store the component parts internally. You can then change any of the individual parts and regenerate the URL.
my $url = Badger::URL->new(
'http://badgerpower.com/'
);
$url->port('8080');
$url->path('/under/ground');
$url->query('animal=badger');
print $url; # http://badgerpower.com:8080/under/ground?animal=badger
METHODS ^
new($url)
This constructor method is used to create a new URL object.
my $url = Badger::URL->new(
'http://[email protected]:8080/under/ground?animal=badger#stripe'
);
You can also specify the individual parts of the URL using named paramters.
my $url = Badger::URL->new(
scheme => 'http',
user => 'abw',
host => 'badgerpower.com',
port => '8080',
path => '/under/ground',
query => 'animal=badger',
fragment => 'stripe',
);
copy()
This method creates and returns a new Badger::URL object as a copy of the current one.
my $copy = $url->copy;
url()
Method to return the complete URL.
print $url->url;
# http://[email protected]:8080/under/ground?animal=badger#stripe
This method is called automatically whenever the URL object is stringified.
print $url; # same as above
text()
An alias for the url() method.
scheme()
Method to get or set the scheme part of the URL.
$url = Badger::URL->new('http://badgerpower.com/);
print $url->scheme(); # http
$url->scheme('ftp');
print $url->scheme(); # ftp
authority()
Method to get or set the authority part of the URL. This is comprised of a host with optional user and/or port.
$url->authority('badgerpower.com');
$url->authority('[email protected]');
$url->authority('badgerpower.com:8080');
$url->authority('[email protected]:8080');
print $url->authority(); # [email protected]:8080
user()
Method to get or set the optional user in the authority part of the URL.
$url->user('fred');
print $url->user(); # fred
print $url->authority(); # [email protected]:8080
host()
Get or set the host in the authority part of the URL.
$url->host('example.org');
print $url->host(); # example.org
print $url->authority(); # [email protected]:8080
port()
Get or set the port in the authority part of the URL.
$url->port(1234);
print $url->port(); # 1234
print $url->authority(); # [email protected]:1234
path()
Get or set the path part of the URL.
$url->path('/right/here');
print $url->path(); # /right/here
query()
Get or set the query part of the URL. The leading '?' is not considered part of the query and should be should not be included when setting a new query.
$url->query('animal=ferret');
print $url->query(); # animal=ferret
params()
Get or set the query parameters.
# get params
my $params = $url->params;
# set params
$url->params(
x => 10
);
fragment()
Get or set the fragment part of the URL. The leading '#' is not considered part of the fragment and should be should not be included when setting a new fragment.
$url->fragment('feet');
print $url->fragment(); # feet
server()
Returns a composite of the scheme and authority.
print $url->server();
# http://[email protected]:1234
service()
Returns a composite of the server (scheme and authority) and path (in other words, everything up to the query or fragment).
print $url->server();
# http://[email protected]:1234/right/here
request()
Returns a composite of the service (scheme, authority and path) and query (in other words, everything except the fragment).
print $url->request();
# http://[email protected]:1234/right/here?animal=badger
relative($path)
Returns a new URL with the relative path specified.
my $base = Badger::URL->new('http://badgerpower.com/example');
my $rel = $base->relative('foo/bar');
print $rel; # http://badgerpower.com/example/foo/bar
absolute($path)
Returns a new URL with the absolute path specified. The leading / on the path provided as an argument is option. It will be assumed if not present.
my $base = Badger::URL->new('http://badgerpower.com/example');
my $rel = $base->absolute('foo/bar');
print $rel; # http://badgerpower.com/foo/bar
INTERNAL METHODS ^
set($items)
This method is used to set internal values.
join_authority()
This method reconstructs the authority from the host, port and user.
join_query()
This method reconstructs the query from the query parameters.
join_url()
This method reconstructs the complete URL from its constituent parts.
split_authority()
This method splits the authority into host, port and user.
split_query()
This method splits the query string into query parameters.
dump()
Return a text representation of the structure of the URL object, for debugging purposes.
EXPORTABLE SUBROUTINES ^
URL($url)
This constructor function can be used to create a new URL. If the argument is already a Badger::URL object then it is copied to create a new object. Otherwise a new Badger::URL object is created from scratch.
use Badger::URL 'URL';
my $url1 = URL('http://example.com/foo');
my $url2 = URL($url1);
AUTHOR ^
Andy Wardley http://wardley.org/
COPYRIGHT ^
Copyright (C) 2001-2010 Andy Wardley. All Rights Reserved.
This module is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
SEE ALSO ^
URI
syntax highlighting:
|
__label__pos
| 0.880927 |
How to load data?
There are several different ways of writing data into the system, optimized for different use cases.
Inline queries
For ad-hoc experimenting, it is usually enough to create individual nodes and edges directly with Cypher queries.
CREATE
(lilysr: Person { name: "Lily Potter", gender: "female", birth_year: 1960 }),
(jamessr:Person { name: "James Potter", gender: "male", birth_year: 1960 }),
(molly:Person { name: "Molly Weasley", gender: "female", birth_year: 1949 }),
(arthur:Person { name: "Arthur Weasley", gender: "male", birth_year: 1950 }),
(harry:Person { name: "Harry Potter", gender: "male", birth_year: 1980 }),
(ginny:Person { name: "Ginny Weasley", gender: "female", birth_year: 1981 }),
(ron:Person { name: "Ron Weasley", gender: "male", birth_year: 1980 }),
(hermione:Person { name: "Hermione Granger", gender: "female", birth_year: 1979 }),
(jamesjr:Person { name: "James Sirius Potter", gender: "male", birth_year: 2003 }),
(albus:Person { name: "Albus Severus Potter", gender: "male", birth_year: 2005 }),
(lilyjr:Person { name: "Lily Luna", gender: "female", birth_year: 2007 }),
(rose:Person { name: "Rose Weasley", gender: "female", birth_year: 2005 }),
(hugo:Person { name: "Hugo Weasley", gender: "male", birth_year: 2008 }),
(jamessr)<-[:has_father]-(harry)-[:has_mother]->(lilysr),
(arthur)<-[:has_father]-(ginny)-[:has_mother]->(molly),
(arthur)<-[:has_father]-(ron)-[:has_mother]->(molly),
(harry)<-[:has_father]-(jamesjr)-[:has_mother]->(ginny),
(harry)<-[:has_father]-(albus)-[:has_mother]->(ginny),
(harry)<-[:has_father]-(lilyjr)-[:has_mother]->(ginny),
(ron)<-[:has_father]-(rose)-[:has_mother]->(hermione),
(ron)<-[:has_father]-(hugo)-[:has_mother]->(hermione);
This sort of query can be entered in the Exploration UI, through cypher-shell, or directly via the REST API (see the “Cypher query language” section). Entering the above graph in the Exploration UI and then querying MATCH (n) RETURN n produces the following graph.
harry potter graph
Queries that read from files
For larger static datasets, it isn’t always feasible or convenient to be constructing large Cypher queries. If these datasets are CSVs or line-based JSON files that are publicly available on the web, it is is possible to write Cypher queries that will iterate through the records in the file, executing some query action for each entry.
For instance, consider the same Harry Potter dataset in a JSON file. Using the custom loadJsonLines procedure to load data from either a file or web URL, we can iterate over each record and create a node for it along with edges to its children.
CALL loadJsonLines("https://docs.thatdot.com/tutorials/harry_potter.json.log") YIELD value AS person
MATCH (p) WHERE id(p) = idFrom('name', person.name)
SET p = { name: person.name, gender: person.gender, birth_year: person.birth_year }
SET p: Person
WITH person.children AS childrenNames, p
UNWIND childrenNames AS childName
MATCH (c) WHERE id(c) = idFrom('name', childName)
CREATE (c)-[:has_parent]->(p)
If the data is in a CSV format, you can use the LOAD CSV clause.
Note
idFrom is a function that hashes its arguments into a valid ID. It takes an arbitrary number of arguments, so that multiple bits of data can factor into the deterministic ID. By convention, the first of these arguments is a string describing a namespace for the IDs being generated. This is important to avoid accidentally producing collisions in IDs that exist in different namespaces: idFrom('year', 2000) is different from idFrom('part number', 2000).
Streaming Data Ingest
Connect is engineered first and foremost as a stream processing system. Data ingest pipelines are almost always streams, and batch processing is something done for want of streaming capabilities. Batch processing is often used to work around other limitations of an ingest system (eg. slow query times and inability to properly trigger computation on new data). These are problems which we believe can be avoided entirely in Connect through judicious use of standing queries.
Connect supports defining ingest streams that connect to existing industry streaming systems such as Kafka and Kinesis. Since it is expected that ingest streams will run for long-periods of time, the REST API is designed to make it easy to
• list or lookup the configuration of currently running streams as well as their ingest progress
• create fresh new ingest streams
• halt currently running ingest streams
See the “Ingest streams” section of the REST API for more details.
|
__label__pos
| 0.954404 |
Metaverse – The future we are walking into
Metaverse – The future we are walking into
The Metaverse is one of the coolest things science fiction has ever thought up. The metaverse is a term coined by Neal Stephenson in 1992 in his science fiction novel “Snow Crash”. It was another way of saying virtual reality. Metaverse is a digital world driven by the same rules as the physical one we inhabit.
It’s a digital space that is replicated infinitely, and it includes everything from our everyday lives to the most remote galaxies. The metaverse is an ever-growing area of research that is still in its early stages. But with so much potential for exploration and growth, it’s important that we understand what it means for our world and our future.
What is the metaverse?
The Metaverse is a digital universe that lives completely inside a web browser, mobile app, or a gaming console. It is the virtual space, where you can work, communicate, socialize, stay connected with friends, play games or even travel the world without leaving your home physically.
The metaverse is still being developed, but there is an underlying theme of what a better future can be with the power of technology. Some of the core technologies like blockchain, AI/ML, virtual and augmented reality and advanced audio-visual techniques make the metaverse applications immersive and capable of replicating almost any place that exists in the traditional world. And with the ever-growing research and evolution of metaverse, it will open new realms of virtual coexistence.
Greate developments are made towards a virtual social environment that goes beyond the limitations of just interacting with people you know in a physical environment. It’s great to just be able to send a quick message to a friend or have some private communication with them through chat or messaging app, but a better metaverse would allow you to really interact with other people as if you are there with them. The metaverse gives you an ability to connect with people from all over the world and even have a sense of existence in an entirely different environment that otherwise wouldn’t be possible in the physical world.
Recently the social media giant Facebook changed its name to ‘Meta’ and that is a decisive move towards the future that we all are walking into, the metaverse.
Meta CEO, Mark Zuckerberg believes that while the key features of the metaverse are not yet widely available, they will become mainstream in the next five to ten years. Just like many other elements of the metaverse that exist today, lightning-fast internet speeds and network redundancy, VR headsets and smartglasses are already up and running, however not accessible to everyone.
How would it look like to be in the metaverse
Let’s take an example of how online shopping in the metaverse may look like.
It is expected that every consumer product these days will have some sort of app available for it, mobile and web apps, TV apps and so on. We expect that any physical product will have a digital counterpart that will help us understand the dimensions, features and applications of that product in a much better way.
For example, you want to buy a dishwasher. You put on your VR headset and visit the company’s digital store where you can see the machines as if they are there in front of you. Select the model that you want and the digital replica of the product will be there for you to check in every detail. You can check the dimensions and also see how it will actually work. You can ask questions to the sales executive face to face without leaving your home. The sales executive might be a real human being on the other side or an AI-powered bot who looks like a real human being and is capable of answering any level of technical queries.
This is one of the examples of the millions of possibilities that the metaverse may offer in the future. Right now, we live in a world where we can virtually explore almost any place and time. The metaverse is a way of exploring all those places which are difficult to visit physically.
How can we explore the metaverse?
We have already started to live in the metaverse by using virtual meetings to communicate and collaborate. With the recent lockdowns, travel bans and other restrictions due to the COVID pandemic, almost everyone from schools to multinational organizations has started using virtual meetings on Zoom, MS Teams or Google meet.
In the near term, some companies and projects that we have been watching are exploring ways to connect the physical and digital worlds. We have seen a lot of projects that let you use a VR headset to virtually visit the workplace, view the museums and the wonders of the world closely and even visit the grave of your beloved.
There are applications to use the virtual reality headsets from watching movies and playing video games to remote assistance and consultation. These headsets let you experience immersive 3D worlds and take part in interactive tasks.
One of the most popular playable metaverse is Second Life which started as a game and is now being played by over 1 million people worldwide. You can create an avatar, enter an environment of your choice, do jobs, buy a home, make friends and socialize all in the virtual world as if you are living a second life completely different from the life you are living in reality.
What are some potential applications of the metaverse?
There are many elements that can be considered parts of the metaverse: online spaces, virtual worlds, online casinos and games… even avatar creation systems like Second Life or MOOs.
With the advent of technology and the metaverse, we can explore different universes. We can travel to far-off planets, travel back through time, visit exotic locations like Mars or create holograms in our homes.
Through various video game consoles and VR headsets, there is a huge gaming community that is connecting and interacting with other gamers inside the virtual environment of the game. These kinds of games and applications are becoming more and more popular which clearly shows that the metaverse is starting to grow so rapidly. With the development of applications for gaming, shopping and even virtual travels, this digital space could be also used for education, entertainment, research and exploration.
What are some of the future implications of the metaverse?
A big problem with the metaverse is that if one were to accept the concept of a world where everything was simulated it could pose some big challenges to how we live our lives today. For example, one popular worry is that people in this world will become addicted to metaverse activities. This has the potential to affect our lives in a similar way that screens have today.
Our everyday lives are now being replicated digitally and exist in digital spaces with millions of users at any one time, which raises privacy and security concerns to another level.
With so much dependency on digital tools and applications, our everyday lives have evolved into something larger than just “our life”: they’ve become a part of the virtual space called the metaverse.
Conclusion
The potential of the metaverse is so huge, it’s hard to wrap our minds around. But if we take a look at some applications that are currently available, like Second Life and Snapchat filters, we can start to see how immersive technologies might change our lives in ways we never would have imagined before. We should be excited for what’s coming next because these changes will undoubtedly affect us on an individual level as well as society on a global scale.
|
__label__pos
| 0.598465 |
wiki:OpenWrt/webserver
Adding a Webserver To OpenWrt
Gateworks provides an OpenWrt board support package. By default, the LUCI admin has a default webserver uhttpd running on port 80
However, if one wants to add their own webserver for hosting custom content (with even CGI scripts...), it is best to install and configure one's own. OpenWrt makes it easy to add and install packages.
For this project, we chose the webserver lighthttpd. On this page we will show how to install the webserver lighthttpd and CGI-mod if desired, configure it, create an HTML file and create a CGI script.
References:
Basic Configuration
Please get familiar with building the OpenWrt BSP located here
Please also be familiar with using the make menuconfig command discussed in OpenWrt Configuration
1. In the make menuconfig turn on libprce (lighthttpd depends on it)
2. Turn on lighthttpd (Network -> Webservers -> LightHttpd)
3. Turn on lighthttpd-mod-cgi (If CGI is desired) (Network -> Webservers -> LightHttpd -> lighthttpd-mod-cgi)
4. Exit and save
5. From the trunk directory, compile with the command: make -j8 V=99 && make package/index
6. Find the IPK files located in the /trunk/bin/cns3xxx/packages/ directory
7. Install via IPK method as discussed here: ipkupload
8. Configure the webserver on the Gateworks board by editing /etc/lighttpd/lighttpd.conf and making the following changes:
• server.document-root = "/www1/" where www1 is the root directory of the web server. Then create the www1 directory
• server.port=8000 where 8000 is the port you want your webserver on (This is very important as by default the LUCI Web Admin is running on port 80. If you want to use port 80, you must re-configure LUCI to use something different)
9. Create a simple index.html file in the www1 directory (example down towards bottom of this page)
10. Start the lighthttpd server with the command
/usr/sbin/lighttpd -f /etc/lighttpd/lighttpd.conf
11. Access the server at an address like so: http://192.168.1.1:8000/index.html
Common Gateway Interface (CG)
If a Common Gateway Interface (CGI) is desired, it can be configured.
Modify the lighthttpd config file as noted above and make sure these lines are in the file:
server.modules = (
"mod_cgi"
)
#### CGI module
cgi.assign = ( ".pl" => "/usr/bin/perl", ".cgi" => "/usr/bin/perl", ".sh" => "" )
Once configured, write a script to access the desired function and an appropriate index.html
CGI Script
Here is a script that reads the voltage on a Laguna board: (Find more commands on the GSC page gsc)
root@OpenWrt:/www1# cat voltage.sh
#!/bin/sh
CAT=/bin/cat
header() {
echo Content-type: text/html
echo ""
}
getvalue() {
val="$(cat /sys/class/hwmon/hwmon0/device/in0_input)"
let "vin = val/1000"
echo -e "$vin"
}
footer() {
echo ""
}
header
case "$REQUEST_METHOD" in
GET) getvalue;;
esac
footer
Index html file
Here is a sample index.html file that is used in the above image. Note the library jquery is used for the javascript ajax calls to the cgi scripts:
root@OpenWrt:/www1# cat index.html
<html>
<head>
<script src="jquery.js"></script>
</head>
<body style="font-family:arial;bgcolor="#BDBDBD">
<style>
table, th , td,tr
{
border: 1px solid black;
border-collapse:collapse;
text-align:center;
}
</style>
<script>
function getTemp()
{
$.ajax({
url:"temp.sh",
type: "GET",
success: function(data)
{
$('#temperature').html(data+"° C");
}
});
}
function getVoltage()
{
$.ajax({
url:"voltage.sh",
type: "GET",
success: function(data)
{
$('#voltage').html(data+" Volts");
}
});
}
$(document).ready(function() {
getVoltage();
getTemp();
});
</script>
<center>
<div style="background-color:white;border: 5px solid red; width:600px;min-height:600px;">
<br>
<img alt="Gateworks" style="width:75%" src="images/gateworks.jpg"/>
<br>
<h1 style="font-family:arial">
Gateworks M2M Demo
</h1>
<br>
<div style="border: 0px solid blue;text-align:left; width:98%;">
<h3>GSC Values:</h3><br>
<table style="width:98%">
<tr>
<th>
Property
</th>
<th>
Value
</th>
</tr>
<tr>
<td>
Vin
</td>
<td>
<span id="voltage"/>
</td>
</tr>
<tr>
<td>
Processor Temperature
</td>
<td>
<span id="temperature"/>
</td>
</tr>
</table>
</div>
</div>
</center>
</body>
</html>
Troubleshooting
To see if the server is listening on a port, use the netstat command:
root@OpenWrt:/www1# netstat -a
Active Internet connections (servers and established)
Proto Recv-Q Send-Q Local Address Foreign Address State
tcp 0 0 0.0.0.0:8000 0.0.0.0:* LISTEN
tcp 0 0 0.0.0.0:www 0.0.0.0:* LISTEN
tcp 0 0 0.0.0.0:domain 0.0.0.0:* LISTEN
tcp 0 0 :::domain :::* LISTEN
tcp 0 0 :::ssh :::* LISTEN
tcp 0 0 :::telnet :::* LISTEN
tcp 0 0 ::ffff:192.168.1.73:telnet ::ffff:192.168.1.22:38861 ESTABLISHED
udp 0 0 0.0.0.0:domain 0.0.0.0:*
udp 0 0 192.168.1.73:ntp 0.0.0.0:*
udp 0 0 localhost:ntp 0.0.0.0:*
udp 0 0 0.0.0.0:ntp 0.0.0.0:*
udp 0 0 :::domain :::*
udp 0 0 ::1:ntp :::*
udp 0 0 fe80::2d0:12ff:fe9b:ede0:ntp :::*
udp 0 0 :::ntp :::*
Active UNIX domain sockets (servers and established)
Proto RefCnt Flags Type State I-Node Path
unix 2 [ ] DGRAM 1314 /var/run/hostapd-phy0/wlan0
unix 8 [ ] DGRAM 254 /dev/log
unix 2 [ ] DGRAM 1966
unix 2 [ ] DGRAM 1912
unix 2 [ ] DGRAM 1907
unix 2 [ ] DGRAM 1729
unix 2 [ ] DGRAM 1397
unix 2 [ ] DGRAM 305
Verify the process is running with the ps command:
root@OpenWrt:/www1# ps -aef | grep light
2541 root 2680 S /usr/sbin/lighttpd -f /etc/lighttpd/lighttpd.conf
2557 root 1140 S grep light
root@OpenWrt:/www1#
Last modified 13 months ago Last modified on 03/12/2018 08:16:51 AM
|
__label__pos
| 0.754294 |
Using wildcard to match hostnames
With both Apache and Nginx, *.example.com matches both foo.example.com and foo.bar.example.com.
With Caddy it does not, it only matches foo.example.com
Is there any rationale behind this decision? Or is there a way in Caddy to accomplish the same result? Adding *.*.example.com, *.*.*.example.com and so on becomes just ridiculous.
Caddy is following this RFC:
Also, the concept of wildcard labels was in an RFC from as early as 1987:
Do you really need this though? Why would you ever need more than 2 or 3 levels?
2 Likes
Caddy is following this RFC:
RFC 6125 - Representation and Verification of Domain-Based Application Service Identity within Internet Public Key Infrastructure Using X.509 (PKIX) Certificates in the Context of Transport Layer Security (TLS)
That’s for certificates, not general domain-names.
Also, the concept of wildcard labels was in an RFC from as early as 1987:
RFC 1034 - Domain names - concepts and facilities
1034 was updated in 4592:
*.example. 3600 TXT "this is a wildcard"
QNAME=foo.bar.example. QTYPE=TXT, QCLASS=IN
the answer will be "foo.bar.example. IN TXT ..."
because bar.example. does not exist, but the wildcard
does.
Caddy’s domain rules need to follow from certificate rules, because it does the extra job of managing certificates automatically. Other web servers don’t do that.
1 Like
So creating a definition like the one below and have it respond to foo.bar.example.com shouldn’t be a problem?
http://*.example.com {
file_server /tmp
}
Also… since you allow for *.*.example.com which isn’t allowed as per 6125, you’re already not really following the RFC…
You can do it with a header_regexp matcher.
http:// {
@allSubdomains header_regexp sub Host (.*)\.example.com
handle @allSubdomains {
respond "Handling {re.sub.1}" 200
}
handle {
# Fallback for anything not otherwise matched
}
}
Won’t that example break http->https redirection?
It looks like it catches all http-traffic and then uses header_regexp to do the logic?
Yes it will. So pick your poison. If you still need HTTP->HTTPS redirects alongside this, then you need to do it yourself for the domains you still need redirects for. It’s really just redir https://<domain>{uri} 308, and fill in <domain> however you need. You could use map (Caddyfile directive) — Caddy Documentation to match the domains you need.
1 Like
Okay…just trying to figure out things here… This is a heck of a lot more complicated than how it’s done in Nginx or Apache :slight_smile:
I still don’t see why *.example.com, or something else, like maybe **.example.com can’t match foo.bar.example.com
RFC6125 can’t really be the reason, since you support *.*.example.com, which 6125 explicitly forbids…
And you even have a on-demand feature for getting certificates, so allow *.example.com to match whatever, then you combine it with on_demand and everything should work fine?
Where, exactly?
1. The client SHOULD NOT attempt to match a presented identifier in
which the wildcard character comprises a label other than the
left-most label (e.g., do not match bar.*.example.net).
2. If the wildcard character is the only character of the left-most
label in the presented identifier, the client SHOULD NOT compare
against anything but the left-most label of the reference
identifier (e.g., *.example.com would match foo.example.com but
not bar.foo.example.com or example.com).
Ah, well:
This is about the client, not the server; and a “SHOULD NOT” phrase is weaker than a “MUST NOT” – you’ll find that most major web browsers do accept certificates like *.*.foo.com (but not *.* – individual implementations are nuanced like that). Also, in *.*.foo.com, the wildcard does comprise the left-most label, so there is an argument this does not apply anyway (see example).
While I believe publicly-trusted CAs are generally forbidden from issuing wildcard certificates with multiple wildcard labels by the BRs, this does not prevent servers from serving certificates with such subjects; and this is often in fact useful.
Is irrelevant, again, as it describes what the client “SHOULD NOT” do (i.e. is a recommendation), not saying what is forbidden by servers or X.509 Certificate issuers. See the example – it’s saying that the wildcard in a label does not apply to incongruent labels when comparing the identifier, i.e. the domains must have the same number of labels.
1 Like
I still think it’s a really weird stance to take.
Apache and Nginx both follows RFC4592, Caddy does not.
And I see no reason why Caddy doesn’t. You even have a fancy on-demand feature that would take care of all the certificate-problems.
Set up *.example.com, create a letsencrypt for *.example.com, and if some option is set, create one on the fly when foo.bar.example.com is accessed.
You probably want to use a catch-all site address like :443, then, rather than enumerating all possible subdomains, when using on-demand TLS.
There’s a lot of things Caddy does differently than other servers. :slight_smile: That’s the whole point. Francis already explained why this one is.
There’s a lot of things Caddy does differently than other servers. :slight_smile: That’s the whole point. Francis already explained why this one is.
Not really… since you can set up on-demand certs there is zero reason for it.
If it’s just a matter of not wanting to support it, fine, but referring to RFCs doesn’t really work, since we have established that Caddy doesn’t follow 4562 already.
And the issue with certificates is easily taken care of with on demand certs, which would keep Caddy compliant with 6125
I’m not sure we have. What about this part, which follows on immediately after the area you quoted?
The final example highlights one common misconception about
wildcards. A wildcard “blocks itself” in the sense that a wildcard
does not match its own subdomains. That is, “*.example.” does not
match all names in the “example.” zone; it fails to match the names
below “*.example.”. To cover names under “*.example.”, another
wildcard domain name is needed–"*.*.example."–which covers all but
its own subdomains.
RFC 4592 - The Role of Wildcards in the Domain Name System
2 Likes
I’m not sure what you mean… That text refers to
QNAME=ghost.*.example., QTYPE=MX, QCLASS=IN
because *.example. exists
And since there is the line
*.example. 3600 MX 10 host1.example.
It matches on that
If you look at the list of examples, you’ll find that the second set of examples (including that last example) are
responses [that] would not be synthesized from any of the wildcards in the zone
(emphasis mine), whereas the example you cited above is from the list of responses that would be synthesized from one of the wildcards.
The wording itself seems quite explicit and very much seems to be against your point; I’m not sure how the two can be reconciled.
1 Like
|
__label__pos
| 0.97358 |
Wap in c to find determinant of matrix order 3x3 , C/C++ Programming
WAP in C to find determinant of matrix order 3x3
#include
#include
void main()
{
int i, j,cal;
int det[3][3];
printf("\n Enter Elements of Matric 3x3\n");
for (i=0; i<3; i++)
{
for(j=0;j<3; j++)
{
scanf("%d",&det[i][j]);
}
}
printf("\n Enter matrix is:\n");
for (i=0;i<3;i++)
{
for(j=0;j<3; j++)
printf("%d\t",det[i][j]);
printf("\n");
}
// Determinants of the matrix
cal=(det[0][0])*(cal=(det[1][1]*det[2][2])-(det[2][1]*det[1][2]))-det[0][1]*((det[1][0]*det[2][2])-(det[2][0]*det[1][2]))+det[0][2]*((det[1][0]*det[2][1])-(det[2][0]*det[1][1]));
printf("\n the Determinant of the matrix=%d\n",cal);
}
OUTPUT
1053_WAP in C to find determinant of matrix order 3x3.jpg
Posted Date: 9/29/2012 2:51:34 AM | Location : United States
Related Discussions:- Wap in c to find determinant of matrix order 3x3 , Assignment Help, Ask Question on Wap in c to find determinant of matrix order 3x3 , Get Answer, Expert's Help, Wap in c to find determinant of matrix order 3x3 Discussions
Write discussion on Wap in c to find determinant of matrix order 3x3
Your posts are moderated
Related Questions
Static Class Members As we already know all the objects of the class have dissimilar data members but invoke the similar member functions. Though, there is an exception to this
Project Description: Online game development Online Live Baccarat Game is needed - client program. - server program(IOCP or ect..). - web program(ASP or PHP or etc..
Program to calculate tax: float tax (float) ; int main() { float purchase, tax_amt, total; cout cin >> purchase
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b
write a program that would accept the radius of the sphere and return its surface area.
(a) Write a procedure called (area-of-rectangle h w) that computes the area of a rectangle of height h and width w. (b) Write a procedure called (area-of-circle r) that computes
Expected output of the program: 1. Consider the following programs. For each, indicate whether the program is correct. If yes, what is the expected output? If not, what is the
Write a Program to illustrate Array? int x[100]; char text[80]; float temp[30]; static int marks[5]; We are able to use symbolic constants instead of expression. The valu
Train Station C++ Program A C++ program that provides a simple text based interface that will allow a user to create, edit, search, or delete a train schedule. The program will m
Structures A structure is a derived data type. It is a combination of logically related data items. Unlike arrays, which are a collection of such as data types, structures can
|
__label__pos
| 0.982621 |
how to connect iphone to tv with usb only
Welcome to our guide on how to connect iPhone to TV with USB only. In today’s digital age, there are many ways to leverage the fantastic features of Apple’s iconic smartphone and make them accessible on a larger screen for a better viewing experience. With the right know-how, connecting your iPhone to a TV with just USB is easy and straightforward. Here at How To Connects Friends, we’ve got you covered with a step-by-step guide to help you connect your iPhone to your TV using just a USB cable. So, let’s get started!
Prepare Your Devices
🔌 To get started, you need to make sure that your devices are properly prepped for the connection process. Here’s what you need to do:
Step 1: Ensure Your TV Supports USB Connection
📺 Before you get started on the process of connecting your iPhone to your TV through USB, you need to make sure that your TV supports USB connectivity. Most modern TV models allow for this, but older models may not. To check whether your TV supports USB, look out for USB ports on the TV itself. If you find one or several, proceed to the next step.
Step 2: Check Your iPhone’s Compatibility
📱 Make sure that your iPhone has a lightning connector and that its operating system is iOS 11 or later. Also, ensure that you have the appropriate cables, such as a USB-to-Lightning cable, and an HDMI adapter if your TV doesn’t support USB input.
Connect Your iPhone to Your TV
🔌 Now that you’ve ensured that your devices are compatible and are ready for connection, it’s time to connect them. Follow these steps:
Step 1: Plug in Your USB Cable
🔌 Start by plugging in one end of your USB cable into the USB port on your TV.
Step 2: Connect Your Lightning Cable to iPhone
🔌 Next, plug the lightning connector of your USB-to-Lightning cable into your iPhone’s charging port.
Step 3: Connect Your iPhone to Your TV
🔌 Finally, connect the other end of your USB cable to the USB-to-HDMI adapter. If your TV doesn’t have a USB port, connect the adapter to the TV’s HDMI port.
Step 4: Configure Your TV Settings
🎛 Once your devices are connected, configure your TV input settings to display the content from your iPhone. You may need to select the input source on your TV and switch to the HDMI output port to access your iPhone’s content.
Frequently Asked Questions (FAQs)
1. Can I connect my iPhone to the TV with just a USB cable?
Yes, you can, as long as your TV supports USB connectivity, and your iPhone has a lightning connector, and its operating system is iOS 11 or later.
2. Do I need an HDMI adapter to connect my iPhone to my TV with USB?
Not necessarily. If your TV has a USB input port, you can connect your iPhone to your TV through USB without using an HDMI adapter. However, if your TV does not have a USB port, an HDMI adapter is required to connect the two devices.
3. Can I charge my iPhone while it is connected to the TV?
Yes, using a USB-to-Lightning cable allows you to charge your iPhone while it is connected to your TV through USB.
4. Why won’t my iPhone connect to my TV through USB?
Several factors may contribute to this issue. Ensure that your iPhone and TV are compatible, and that you have the appropriate cables. You should also check your TV input settings to ensure that your TV is configured to receive content from your iPhone.
5. Why is there no sound when I connect my iPhone to my TV through USB?
There are several reasons why you may not hear sound from your TV speakers. Check your TV’s audio settings to ensure that the speakers are turned on, and the volume is not muted. You may also need to adjust the sound output settings on your iPhone.
6. What is the maximum distance between my iPhone and the TV for a USB connection?
There is no defined maximum distance for a USB connection. However, it is recommended to keep your devices no more than 16 feet apart for optimal connectivity.
7. Can I connect my iPhone to a non-smart TV with just USB?
Yes, modern TVs with USB ports and HDMI inputs allow you to connect your iPhone to your TV using just a USB cable. Older TVs may not have these capabilities, requiring you to use an HDMI adapter to connect the devices.
Strengths and Weaknesses of Connecting iPhone to TV with USB Only
Strengths
Connecting your iPhone to your TV using a USB cable offers several advantages:
1. Cost-Effective
Unlike other options such as AirPlay, connecting your iPhone to your TV using a USB cable is a cost-effective option that doesn’t require any additional hardware.
2. Reliable
USB connections are known for providing stable and reliable connections, ensuring that your content plays smoothly on your TV.
Weaknesses
While USB connections offer several advantages, they also have a few drawbacks. Here are some of the disadvantages of connecting your iPhone to your TV using a USB cable:
1. Limited Compatibility
Not all TVs support USB connections, and not all iPhones have USB connectivity. To connect your iPhone to your TV using USB, you need a TV with a USB input port, and your iPhone must have a lightning connector.
2. Limited Viewing Distance
USB cables have a maximum length of 16 feet, which limits the distance between your iPhone and TV. This may be a problem if you have a large room or need to place your iPhone far away from your TV.
The Complete Guide to Connecting iPhone to TV with USB
S/N Step Description
1 Check TV Compatibility Make sure your TV supports USB connectivity.
2 Check iPhone Compatibility Ensure your iPhone has a lightning connector and is running iOS 11 or later.
3 Gather Materials Get all the necessary cables, including USB-to-Lightning and HDMI if required.
4 Plug in USB Cable Connect one end of your USB cable to the TV USB input.
5 Connect Lightning Cable to iPhone Attach the USB-to-Lightning cable to your iPhone’s charging port.
6 Connect Adapter to TV Connect the USB-to-HDMI adapter to your TV HDMI input.
7 Configure TV Settings Use your TV remote to navigate to the HDMI input you used and select it to display your iPhone content on your TV.
Take Action Today!
Now that you know how to connect your iPhone to your TV with just a USB cable, what are you waiting for? Get started today and enjoy a better viewing experience from the comfort of your home.
1. Invest in High-Quality Cables
To ensure the best connectivity between your iPhone and your TV, it’s recommended to invest in high-quality cables that support your devices’ requirements.
2. Check Your TV Manual
If you’re not sure if your TV supports USB connectivity, or if you need more guidance on connecting your devices, consult your TV manual or seek guidance from a professional.
3. Enjoy Your Content
Now that you’ve connected your iPhone to your TV, sit back, relax, and enjoy your favorite content on a larger, more vibrant screen.
4. Share Your Experience
If you found this guide helpful, share it with your friends and family so they too can enjoy the ultimate viewing experience on their TVs from their iPhones.
5. Keep Your Devices Updated
You can avoid compatibility issues in the future by ensuring that your devices are regularly updated with the latest software and security updates.
6. Enjoy!
That’s all there is to it. We hope you found this guide helpful and informative. Enjoy your iPhone content on your TV with just a USB cable today!
Disclaimer
Connecting your iPhone to your TV through USB may not be suitable for all TV models, iPhone devices, or user needs. While we have provided detailed instructions and steps above, the process may not work for everyone, or there may be other factors that affect usability. Therefore, we are not responsible for any damages you may incur while attempting to connect your iPhone to your TV through USB. Please refer to your device manuals or seek professional assistance if you’re unsure about the process or have any questions.
|
__label__pos
| 0.932315 |
2
$\begingroup$
For a Lie group $G$ with compact Lie subgroup $K$, we say that $(G,K)$ is a pair of Gelfand type if the representation $L^2(G/K)$ of $G$ is multiplicity free, that is, if it is a direct integral of distinct irreducible representations.
Can there exist a pair of dual representations in $L^2(G/K)$ for a Gelfand pair $(G,K)$?
Or do there exist non-self dual irreducible representations in $L^2(G/K)$?
$\endgroup$
• 3
$\begingroup$ What about $(G,K) = (\mathbf R/\mathbf Z,0)$? $\endgroup$ – Mikael de la Salle Mar 23 '18 at 21:21
3
+100
$\begingroup$
I gave in the comments the example of the Gelfand pair $(G,K) = (\mathbf R/\mathbf Z,0)$ for which every non-trivial irreducible representation arises together with its (distinct) dual representation. But actually this is completely general, at least when $G$ is compact: the representation $L^2(G/K)$ is self-dual. So by uniqueness of the decomposition into irreducible representations (here I use compactness), for every irreducible representation appearing in this decomposition, its dual representation also appears. Of course, the self-dual irreducible representations in $L^2(G/K)$ appear only once. This is for example the case for $(G,K)=(SO(3),SO(2))$, where all the irreducible representations of $SO(3)$ are self-dual.
$\endgroup$
• $\begingroup$ If in addition we assume that $K$ is a maximal compact subgroup, then do we still get non-self dual irreps in $L^2(G/K)$? $\endgroup$ – Alesandro Levi Mar 26 '18 at 11:19
• $\begingroup$ @AlesandroLevi Yes, essentially same example with $(G,K) = (\mathbf R,0)$. Almost every character of $\mathbf R$ is not self dual. $\endgroup$ – Mikael de la Salle Mar 26 '18 at 13:10
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.965245 |
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMike Blumenkrantz <[email protected]>2016-03-03 09:52:38 -0500
committerMike Blumenkrantz <[email protected]>2016-03-04 14:34:53 -0500
commitf65d5d6b3f784f14583e126a9ecf48da819067f8 (patch)
treedb8e3a50a0327aea40297483179f5496fc5b9fae
parentda6f1644bf32c2704155f3dda8c8cd474e4e3464 (diff)
theme: add new time gadget themes
-rw-r--r--data/themes/Makefile.am15
-rw-r--r--data/themes/default.edc1
-rw-r--r--data/themes/edc/time.edc1379
-rw-r--r--data/themes/img/digit_0.pngbin0 -> 2526 bytes
-rw-r--r--data/themes/img/digit_1.pngbin0 -> 577 bytes
-rw-r--r--data/themes/img/digit_2.pngbin0 -> 2443 bytes
-rw-r--r--data/themes/img/digit_3.pngbin0 -> 2236 bytes
-rw-r--r--data/themes/img/digit_4.pngbin0 -> 1563 bytes
-rw-r--r--data/themes/img/digit_5.pngbin0 -> 2335 bytes
-rw-r--r--data/themes/img/digit_6.pngbin0 -> 2588 bytes
-rw-r--r--data/themes/img/digit_7.pngbin0 -> 1542 bytes
-rw-r--r--data/themes/img/digit_8.pngbin0 -> 2669 bytes
-rw-r--r--data/themes/img/digit_9.pngbin0 -> 2663 bytes
-rw-r--r--data/themes/img/digit_am.pngbin0 -> 1347 bytes
-rw-r--r--data/themes/img/digit_na.pngbin0 -> 2014 bytes
-rw-r--r--data/themes/img/digit_nm.pngbin0 -> 533 bytes
-rw-r--r--data/themes/img/digit_pm.pngbin0 -> 1224 bytes
17 files changed, 1395 insertions, 0 deletions
diff --git a/data/themes/Makefile.am b/data/themes/Makefile.am
index c026ac43a..319125631 100644
--- a/data/themes/Makefile.am
+++ b/data/themes/Makefile.am
@@ -86,6 +86,7 @@ edc/systray.edc \
86edc/tasks.edc \ 86edc/tasks.edc \
87edc/temperature.edc \ 87edc/temperature.edc \
88edc/textblock.edc \ 88edc/textblock.edc \
89edc/time.edc \
89edc/toolbar.edc \ 90edc/toolbar.edc \
90edc/transitions.edc \ 91edc/transitions.edc \
91edc/wallpaper.edc \ 92edc/wallpaper.edc \
@@ -237,6 +238,20 @@ img/day_single_normal.png \
237img/day_single_press.png \ 238img/day_single_press.png \
238img/day_single_selected.png \ 239img/day_single_selected.png \
239img/diagonal_stripes.png \ 240img/diagonal_stripes.png \
241img/digit_0.png \
242img/digit_1.png \
243img/digit_2.png \
244img/digit_3.png \
245img/digit_4.png \
246img/digit_5.png \
247img/digit_6.png \
248img/digit_7.png \
249img/digit_8.png \
250img/digit_9.png \
251img/digit_am.png \
252img/digit_na.png \
253img/digit_nm.png \
254img/digit_pm.png \
240img/O/digit_0.png \ 255img/O/digit_0.png \
241img/O/digit_1.png \ 256img/O/digit_1.png \
242img/O/digit_2.png \ 257img/O/digit_2.png \
diff --git a/data/themes/default.edc b/data/themes/default.edc
index bab92ba10..2ba757d02 100644
--- a/data/themes/default.edc
+++ b/data/themes/default.edc
@@ -143,6 +143,7 @@ collections {
143#include "edc/bluez4.edc" 143#include "edc/bluez4.edc"
144#include "edc/packagekit.edc" 144#include "edc/packagekit.edc"
145#include "edc/wireless.edc" 145#include "edc/wireless.edc"
146#include "edc/time.edc"
146 147
147// icons 148// icons
148#include "edc/icons.edc" 149#include "edc/icons.edc"
diff --git a/data/themes/edc/time.edc b/data/themes/edc/time.edc
new file mode 100644
index 000000000..31852f3c6
--- /dev/null
+++ b/data/themes/edc/time.edc
@@ -0,0 +1,1379 @@
1color_classes {
2 color_class { "e.clock_color_fg";
3 color: FN_COL_HIGHLIGHT;
4 desc: "Foreground color of the digital clock";
5 }
6 color_class { "e.clock_color_bg";
7 color: 31 31 31 255;
8 desc: "Backgound color of the digital clock";
9 }
10}
11
12group { "e/gadget/clock/digital/advanced"; nomouse;
13 script {
14 public message(Msg_Type:type, id, ...) {
15#define CUSTOM(NAME) \
16 custom_state(PART:NAME, "default", 0.0); \
17 set_state_val(PART:NAME, STATE_COLOR_CLASS, str); \
18 set_state(PART:NAME, "custom", 0.0)
19
20 if ((type == MSG_STRING_INT) && (id == 3)) {
21 new str[128];
22 new on;
23
24 getsarg(2, str, sizeof(str));
25 on = getarg(3);
26 if (on) {
27 CUSTOM("clip");
28 } else {
29 set_state(PART:"clip", "default", 0.0);
30 }
31#undef CUSTOM
32 }
33 }
34 }
35 parts {
36 rect { "clip";
37 desc {
38 color_class: "e.clock_color_fg";
39 }
40 }
41 text { "e.text"; scale; clip: "clip";
42 effect: GLOW;
43 desc { "default";
44 align: 0.5 0;
45 rel1.offset: 2 0;
46 rel2.relative: 1 0;
47 rel2.offset: -3 -1;
48 color: FN_COL_DEFAULT_BASIC;
49 text {
50 font: FN;
51 size: 12;
52 min: 1 1;
53 text_class: "module_normal";
54 ellipsis: -1;
55 }
56 }
57 desc { "only"; inherit;
58 align: 0.5 0.5;
59 rel2.relative: 1 1;
60 text.fit: 0 1;
61 text.font: FNBD;
62 text.text_class: "module_large";
63 }
64 }
65 text { "e.text.sub"; scale; clip: "clip";
66 effect: GLOW;
67 desc { "default";
68 align: 0.5 0;
69 rel1.relative: 0 1;
70 rel1.offset: 2 0;
71 rel1.to_y: "e.text";
72 rel2.offset: -3 -1;
73 color: FN_COL_DEFAULT_BASIC;
74 text {
75 font: FN;
76 size: 9;
77 min: 1 1;
78 text_class: "module_small";
79 ellipsis: -1;
80 }
81 }
82 desc { "only"; hid;
83 max: 0 0;
84 }
85 }
86 spacer { "e.sizer";
87 desc {
88 rel1.to: "e.text";
89 rel2.to: "e.text.sub";
90 }
91 desc { "only";
92 rel.to: "e.text";
93 }
94 }
95 rect { "eventarea"; mouse;
96 desc { color: 0 0 0 0; }
97 }
98 program { signal: "e,state,date,on"; source: "e";
99 action: STATE_SET "default";
100 targets: "e.text" "e.text.sub" "e.sizer";
101 }
102 program { signal: "e,state,date,off"; source: "e";
103 action: STATE_SET "only";
104 targets: "e.text" "e.text.sub" "e.sizer";
105 }
106 }
107}
108group { name: "e/gadget/clock/digital";
109 min: 64 16;
110 max: 512 128;
111 images.image: "digit_na.png" COMP;
112 images.image: "digit_nm.png" COMP;
113 images.image: "digit_0.png" COMP;
114 images.image: "digit_1.png" COMP;
115 images.image: "digit_2.png" COMP;
116 images.image: "digit_3.png" COMP;
117 images.image: "digit_4.png" COMP;
118 images.image: "digit_5.png" COMP;
119 images.image: "digit_6.png" COMP;
120 images.image: "digit_7.png" COMP;
121 images.image: "digit_8.png" COMP;
122 images.image: "digit_9.png" COMP;
123 images.image: "digit_am.png" COMP;
124 images.image: "digit_pm.png" COMP;
125 images.image: "hole_tiny.png" COMP;
126 script {
127 public do_seconds, do_24h, do_date, tick_timer, timezone;
128
129 public message(Msg_Type:type, id, ...) {
130 if ((type == MSG_STRING) && (id == 1)) {
131 new str[128];
132
133 getsarg(2, str, sizeof(str));
134 set_str(timezone, str);
135 reset();
136 } else if ((type == MSG_STRING_INT) && (id == 2)) {
137 new str[128];
138 new on;
139
140 getsarg(2, str, sizeof(str));
141 on = getarg(3);
142 if (on) {
143#define CUSTOM(NAME) \
144 custom_state(PART:NAME, "default", 0.0); \
145 set_state_val(PART:NAME, STATE_COLOR_CLASS, str); \
146 set_state(PART:NAME, "custom", 0.0)
147
148 CUSTOM("bg_color");
149 CUSTOM("bg_color_secclip");
150 CUSTOM("bg_color_ampmclip");
151 } else {
152 set_state(PART:"bg_color", "default", 0.0);
153 set_state(PART:"bg_color_secclip", "default", 0.0);
154 set_state(PART:"bg_color_ampmclip", "default", 0.0);
155 }
156 } else if ((type == MSG_STRING_INT) && (id == 3)) {
157 new str[128];
158 new on;
159
160 getsarg(2, str, sizeof(str));
161 on = getarg(3);
162 if (on) {
163 CUSTOM("fg_color");
164 CUSTOM("fg_color_secclip");
165 CUSTOM("fg_color_ampmclip");
166 } else {
167 set_state(PART:"fg_color", "default", 0.0);
168 set_state(PART:"fg_color_secclip", "default", 0.0);
169 set_state(PART:"fg_color_ampmclip", "default", 0.0);
170 }
171#undef CUSTOM
172 }
173 }
174 evalsize() {
175 new do24h, dosec, v[14], i, tot, mul;
176 new parts[] = {
177 PART:"hours1", PART:"hours1",
178 PART:"hours2", PART:"hours2",
179 PART:"mins1", PART:"mins1",
180 PART:"mins2", PART:"mins2",
181 PART:"secs1", PART:"secs1",
182 PART:"secs2", PART:"secs2",
183 PART:"ampm", PART:"ampm"
184 };
185
186 mul = 4;
187 if (get_int(do_date)) {
188 mul = 3;
189 }
190
191 for (i = 0; i < 14; i += 2) {
192 custom_state(parts[i], "default", 0.0);
193 }
194 v[0] = 0; v[1] = 2; v[2] = 2; v[3] = 4; // hrs
195 v[4] = 5; v[5] = 7; v[6] = 7; v[7] = 9; // mins
196 tot = 9;
197
198 dosec = get_int(do_seconds);
199 do24h = get_int(do_24h);
200 if ((dosec) && (!do24h)) { // sec + ampm
201 tot += 7;
202 v[8] = 10; v[9] = 12; v[10] = 12; v[11] = 14;
203 v[12] = 14; v[13] = 16;
204 }
205 else if ((dosec) && (do24h)) { // sec + -
206 tot += 5;
207 v[8] = 10; v[9] = 12; v[10] = 12; v[11] = 14;
208 v[12] = 0; v[13] = 0;
209 }
210 else if ((!dosec) && (!do24h)) { // - + ampm
211 tot += 2;
212 v[8] = 0; v[9] = 0; v[10] = 0; v[11] = 0;
213 v[12] = 9; v[13] = 11;
214 }
215 else if ((!dosec) && (do24h)) { // - + -
216 tot += 0;
217 v[8] = 0; v[9] = 0; v[10] = 0; v[11] = 0;
218 v[12] = 0; v[13] = 0;
219 }
220 for (i = 0; i < 14; i += 2) {
221 set_state_val(parts[i], STATE_REL1,
222 float(v[i]) / float(tot), 0.0);
223 set_state_val(parts[i + 1], STATE_REL2,
224 float(v[i + 1]) / float(tot), 1.0);
225 }
226 for (i = 0; i < 14; i += 2) {
227 set_state(parts[i], "custom", 0.0);
228 }
229 set_min_size(tot * mul, 16);
230 set_max_size(tot * 8 * mul, 128);
231 emit("e,state,sizing,changed", "");
232 }
233 reset() {
234 new tim;
235
236 evalsize();
237 tim = get_int(tick_timer);
238 if (tim) {
239 cancel_timer(tim);
240 set_int(tick_timer, 0);
241 }
242 clock_cb(0);
243 }
244 valset(name[], v) {
245 new buf[20], i;
246
247 for (i = 0; i < 10; i++) {
248 if (i == v) {
249 snprintf(buf, 20, "show,%s-%i", name, i);
250 }
251 else {
252 snprintf(buf, 20, "hide,%s-%i", name, i);
253 }
254 emit(buf, "c");
255 }
256 }
257 apvalset(id, pm) {
258 if (pm) set_state(id, "active", 0.0);
259 else set_state(id, "default", 0.0);
260 }
261 public clock_cb(val) {
262 new year, month, day, yearday, weekday, hour, minute;
263 new Float:second;
264 new v, dosec, do24h, tim;
265#ifdef EFL_VERSION_1_18
266 new tz[128];
267
268 get_str(timezone, tz, 128);
269 tzdate(tz, year, month, day, yearday, weekday, hour, minute, second);
270#else
271 date(year, month, day, yearday, weekday, hour, minute, second);
272#endif
273 dosec = get_int(do_seconds);
274 if (dosec) {
275 v = round(second);
276 tim = timer(1.0 - (second - v), "clock_cb", 1);
277 // set seconds to v
278 valset("s0", v / 10);
279 valset("s1", v % 10);
280 }
281 else {
282 tim = timer(60.0 - (second), "clock_cb", 1);
283 }
284 set_int(tick_timer, tim);
285
286 // set minutes to minute
287 valset("m0", minute / 10);
288 valset("m1", minute % 10);
289
290 // set hours to hour
291 do24h = get_int(do_24h);
292 if (do24h) {
293 valset("h0", hour / 10);
294 valset("h1", hour % 10);
295 }
296 else {
297 new pm;
298
299 // if 12 or later, its pm
300 if (hour >= 12) {
301 pm = 1;
302 // if we are after 12 (1, 2, 3 etc.) then mod by 12
303 if (hour > 12) hour = hour % 12;
304 }
305 else {
306 pm = 0;
307 // make after midnight be 12:XX AM :)
308 if (hour == 0) hour = 12;
309 }
310 valset("h0", hour / 10);
311 valset("h1", hour % 10);
312 apvalset(PART:"ap", pm);
313 }
314 }
315 }
316
317 parts {
318 rect { "fg_color";
319 desc {
320 color_class: "e.clock_color_fg";
321 }
322 }
323 rect { "bg_color";
324 desc {
325 color_class: "e.clock_color_bg";
326 }
327 }
328 rect { "fg_color_secclip"; clip: "secclip";
329 desc {
330 color_class: "e.clock_color_fg";
331 }
332 }
333 rect { "bg_color_secclip"; clip: "secclip";
334 desc {
335 color_class: "e.clock_color_bg";
336 }
337 }
338 rect { "fg_color_ampmclip"; clip: "ampmclip";
339 desc {
340 color_class: "e.clock_color_fg";
341 }
342 }
343 rect { "bg_color_ampmclip"; clip: "ampmclip";
344 desc {
345 color_class: "e.clock_color_bg";
346 }
347 }
348 part { name: "secclip"; type: RECT;
349 description { state: "default" 0.0;
350 }
351 description { state: "hidden" 0.0;
352 visible: 0;
353 }
354 }
355 part { name: "ampmclip"; type: RECT;
356 description { state: "default" 0.0;
357 }
358 description { state: "hidden" 0.0;
359 visible: 0;
360 }
361 }
362 // XXX: hours1/2, mins1/2, secs1/2 and ampm SHOULD be spacers... but
363 // if they are calculations go weird. this shouldnt happen, but does.
364 part { name: "timearea"; type: RECT;
365 description { state: "default" 0.0;
366 visible: 0;
367 }
368 description { state: "date" 0.0;
369 inherit: "default" 0.0;
370 rel2.relative: 1.0 0.0;
371 rel2.offset: -1 4;
372 rel2.to_y: "e.text.sub";
373 }
374 }
375 part { name: "hours1"; type: RECT;
376 description { state: "default" 0.0;
377 rel1.relative: (0/16) 0.0;
378 rel2.relative: (2/16) 1.0;
379 rel1.to: "timearea";
380 rel2.to: "timearea";
381 visible: 0;
382 }
383 }
384 part { name: "hours2"; type: RECT;
385 description { state: "default" 0.0;
386 rel1.relative: (2/16) 0.0;
387 rel2.relative: (4/16) 1.0;
388 rel1.to: "timearea";
389 rel2.to: "timearea";
390 visible: 0;
391 }
392 }
393 part { name: "mins1"; type: RECT;
394 description { state: "default" 0.0;
395 rel1.relative: (5/16) 0.0;
396 rel2.relative: (7/16) 1.0;
397 rel1.to: "timearea";
398 rel2.to: "timearea";
399 visible: 0;
400 }
401 }
402 part { name: "mins2"; type: RECT;
403 description { state: "default" 0.0;
404 rel1.relative: (7/16) 0.0;
405 rel2.relative: (9/16) 1.0;
406 rel1.to: "timearea";
407 rel2.to: "timearea";
408 visible: 0;
409 }
410 }
411 part { name: "secs1"; type: RECT;
412 description { state: "default" 0.0;
413 rel1.relative: (10/16) 0.0;
414 rel2.relative: (12/16) 1.0;
415 rel1.to: "timearea";
416 rel2.to: "timearea";
417 visible: 0;
418 }
419 }
420 part { name: "secs2"; type: RECT;
421 description { state: "default" 0.0;
422 rel1.relative: (12/16) 0.0;
423 rel2.relative: (14/16) 1.0;
424 rel1.to: "timearea";
425 rel2.to: "timearea";
426 visible: 0;
427 }
428 }
429 part { name: "ampm"; type: RECT;
430 description { state: "default" 0.0;
431 rel1.relative: (14/16) 0.0;
432 rel2.relative: (16/16) 1.0;
433 rel1.to: "timearea";
434 rel2.to: "timearea";
435 visible: 0;
436 }
437 }
438 part { name: "c00";
439 description { state: "default" 0.0;
440 rel1.to: "hours2";
441 rel1.relative: 1.0 0.5;
442 rel1.offset: 0 -2;
443 rel2.to: "mins1";
444 rel2.relative: 0.0 0.5;
445 rel2.offset: 0 -2;
446 align: 0.5 1.0;
447 FIXED_SIZE(4, 4)
448 image.normal: "hole_tiny.png";
449 }
450 }
451 part { name: "c01";
452 description { state: "default" 0.0;
453 rel1.to: "hours2";
454 rel1.relative: 1.0 0.5;
455 rel1.offset: 0 1;
456 rel2.to: "mins1";
457 rel2.relative: 0.0 0.5;
458 rel2.offset: 0 1;
459 align: 0.5 0.0;
460 FIXED_SIZE(4, 4)
461 image.normal: "hole_tiny.png";
462 }
463 }
464 part { name: "c10";
465 clip_to: "secclip";
466 description { state: "default" 0.0;
467 rel1.to: "mins2";
468 rel1.relative: 1.0 0.5;
469 rel1.offset: 0 -2;
470 rel2.to: "secs1";
471 rel2.relative: 0.0 0.5;
472 rel2.offset: 0 -2;
473 align: 0.5 1.0;
474 FIXED_SIZE(4, 4)
475 image.normal: "hole_tiny.png";
476 }
477 }
478 part { name: "c11";
479 clip_to: "secclip";
480 description { state: "default" 0.0;
481 rel1.to: "mins2";
482 rel1.relative: 1.0 0.5;
483 rel1.offset: 0 1;
484 rel2.to: "secs1";
485 rel2.relative: 0.0 0.5;
486 rel2.offset: 0 1;
487 align: 0.5 0.0;
488 FIXED_SIZE(4, 4)
489 image.normal: "hole_tiny.png";
490 }
491 }
492#define ELEM(_NAME, _TO, _DIGIT) \
493 part { name: _NAME; clip: "fg_color"; \
494 description { state: "default" 0.0; \
495 rel1.to: _TO; rel2.to: _TO; \
496 aspect: (52/72) (52/72); aspect_preference: BOTH; \
497 image.normal: "digit_"_DIGIT".png"; \
498 visible: 0; \
499 color: 255 255 255 0; \
500 } \
501 description { state: "active" 0.0; \
502 inherit: "default" 0.0; \
503 visible: 1; \
504 color: 255 255 255 255; \
505 } \
506 }
507#define DIGIT(_NAME, _TO) \
508 ELEM(_NAME"-0", _TO, "0") \
509 ELEM(_NAME"-1", _TO, "1") \
510 ELEM(_NAME"-2", _TO, "2") \
511 ELEM(_NAME"-3", _TO, "3") \
512 ELEM(_NAME"-4", _TO, "4") \
513 ELEM(_NAME"-5", _TO, "5") \
514 ELEM(_NAME"-6", _TO, "6") \
515 ELEM(_NAME"-7", _TO, "7") \
516 ELEM(_NAME"-8", _TO, "8") \
517 ELEM(_NAME"-9", _TO, "9")
518#define ELEMC(_NAME, _TO, _DIGIT, _CLIP) \
519 part { name: _NAME; \
520 clip_to: _CLIP; \
521 description { state: "default" 0.0; \
522 rel1.to: _TO; rel2.to: _TO; \
523 aspect: (52/72) (52/72); aspect_preference: BOTH; \
524 image.normal: "digit_"_DIGIT".png"; \
525 visible: 0; \
526 color: 255 255 255 0; \
527 } \
528 description { state: "active" 0.0; \
529 inherit: "default" 0.0; \
530 visible: 1; \
531 color: 255 255 255 255; \
532 } \
533 }
534#define DIGITC(_NAME, _TO, _CLIP) \
535 ELEMC(_NAME"-0", _TO, "0", _CLIP) \
536 ELEMC(_NAME"-1", _TO, "1", _CLIP) \
537 ELEMC(_NAME"-2", _TO, "2", _CLIP) \
538 ELEMC(_NAME"-3", _TO, "3", _CLIP) \
539 ELEMC(_NAME"-4", _TO, "4", _CLIP) \
540 ELEMC(_NAME"-5", _TO, "5", _CLIP) \
541 ELEMC(_NAME"-6", _TO, "6", _CLIP) \
542 ELEMC(_NAME"-7", _TO, "7", _CLIP) \
543 ELEMC(_NAME"-8", _TO, "8", _CLIP) \
544 ELEMC(_NAME"-9", _TO, "9", _CLIP)
545
546#define TAG(_NAME, _TO, _CLIP) \
547 part { name: _NAME; \
548 clip_to: _CLIP; \
549 description { state: "default" 0.0; \
550 rel1.to: _TO; rel2.to: _TO; \
551 aspect: (48/31) (48/31); aspect_preference: BOTH; \
552 image.normal: "digit_am.png"; \
553 } \
554 description { state: "active" 0.0; \
555 inherit: "default" 0.0; \
556 image.normal: "digit_pm.png"; \
557 } \
558 }
559#define BASE(_NAME, _BASE, _IMG) \
560 part { name: _NAME; clip: "bg_color"; \
561 description { state: "default" 0.0; \
562 rel1.to: _BASE; \
563 rel2.to: _BASE; \
564 image.normal: _IMG; \
565 color: 255 255 255 128; \
566 } \
567 }
568#define BASEC(_NAME, _CLIP, _BASE, _IMG) \
569 part { name: _NAME; \
570 clip_to: _CLIP; \
571 description { state: "default" 0.0; \
572 rel1.to: _BASE; \
573 rel2.to: _BASE; \
574 image.normal: _IMG; \
575 color: 255 255 255 128; \
576 } \
577 }
578
579 BASE ("ha", "h0-0", "digit_na.png")
580 BASE ("hb", "h1-0", "digit_na.png")
581 BASE ("ma", "m0-0", "digit_na.png")
582 BASE ("mb", "m1-0", "digit_na.png")
583
584 BASEC("sa", "bg_color_secclip", "s0-0", "digit_na.png")
585 BASEC("sb", "bg_color_secclip", "s1-0", "digit_na.png")
586 BASEC("aa", "bg_color_ampmclip", "ap", "digit_nm.png")
587
588 DIGIT ("h0", "hours1")
589 DIGIT ("h1", "hours2")
590 DIGIT ("m0", "mins1")
591 DIGIT ("m1", "mins2")
592 DIGITC("s0", "secs1", "fg_color_secclip")
593 DIGITC("s1", "secs2", "fg_color_secclip")
594 TAG("ap", "ampm", "fg_color_ampmclip")
595#undef TAG
596#undef TAG
597#undef ELEM
598#undef ELEMC
599#undef BASE
600#undef BASEC
601#undef DIGIT
602#undef DIGITC
603
604 part { name: "e.text.sub"; type: TEXT;
605 effect: GLOW;
606 scale: 1;
607 description { state: "default" 0.0;
608 rel1.relative: 0.0 1.0;
609 rel1.offset: 0 1;
610 rel2.offset: -1 1;
611 align: 0.5 1.0;
612 color: FN_COL_HIGHLIGHT;
613 text { font: FN; size: 8;
614 text_class: "module_small";
615 align: 0.5 0.5;
616 min: 0 1;
617 }
618 fixed: 0 1;
619 visible: 0;
620 }
621 description { state: "date" 0.0;
622 inherit: "default" 0.0;
623 visible: 1;
624 fixed: 1 1;
625 text.min: 1 1;
626 text.ellipsis: -1;
627 }
628 }
629
630 part { name: "event"; type: RECT;
631 description { state: "default" 0.0;
632 color: 0 0 0 0;
633 }
634 }
635 }
636 programs {
637 program {
638 signal: "load"; source: "";
639 script {
640 reset();
641 }
642 }
643 program {
644 signal: "e,state,date,on"; source: "e";
645 script {
646 set_int(do_date, 1);
647 set_state(PART:"timearea", "date", 0.0);
648 set_state(PART:"e.text.sub", "date", 0.0);
649 reset();
650 }
651 }
652 program {
653 signal: "e,state,date,off"; source: "e";
654 script {
655 set_int(do_date, 0);
656 set_state(PART:"timearea", "default", 0.0);
657 set_state(PART:"e.text.sub", "default", 0.0);
658 reset();
659 }
660 }
661 program {
662 signal: "e,state,seconds,on"; source: "e";
663 script {
664 set_int(do_seconds, 1);
665 set_state(PART:"secclip", "default", 0.0);
666 reset();
667 }
668 }
669 program {
670 signal: "e,state,seconds,off"; source: "e";
671 script {
672 set_int(do_seconds, 0);
673 set_state(PART:"secclip", "hidden", 0.0);
674 reset();
675 }
676 }
677 program {
678 signal: "e,state,24h,on"; source: "e";
679 script {
680 set_int(do_24h, 1);
681 set_state(PART:"ampmclip", "hidden", 0.0);
682 reset();
683 }
684 }
685 program {
686 signal: "e,state,24h,off"; source: "e";
687 script {
688 set_int(do_24h, 0);
689 set_state(PART:"ampmclip", "default", 0.0);
690 reset();
691 }
692 }
693#define DIGPRG(_NAME) \
694 program { \
695 signal: "show,"_NAME; source: "c"; \
696 action: STATE_SET "active" 0.0; \
697 transition: BOUNCE 0.3 0.5 2; \
698 target: _NAME; \
699 } \
700 program { \
701 signal: "hide,"_NAME; source: "c"; \
702 action: STATE_SET "default" 0.0; \
703 transition: DECELERATE 0.3; \
704 target: _NAME; \
705 }
706#define DIGPRGS(_NAME) \
707 DIGPRG(_NAME"-0") \
708 DIGPRG(_NAME"-1") \
709 DIGPRG(_NAME"-2") \
710 DIGPRG(_NAME"-3") \
711 DIGPRG(_NAME"-4") \
712 DIGPRG(_NAME"-5") \
713 DIGPRG(_NAME"-6") \
714 DIGPRG(_NAME"-7") \
715 DIGPRG(_NAME"-8") \
716 DIGPRG(_NAME"-9")
717
718 DIGPRGS("h0")
719 DIGPRGS("h1")
720 DIGPRGS("m0")
721 DIGPRGS("m1")
722 DIGPRGS("s0")
723 DIGPRGS("s1")
724#undef DIGPRG
725#undef DIGPRGS
726 }
727}
728
729group { name: "e/gadget/clock/analog";
730 images.image: "clock_base.png" COMP;
731 images.image: "inset_round_hilight.png" COMP;
732 images.image: "inset_round_shadow.png" COMP;
733 images.image: "inset_round_shading.png" COMP;
734 set { name: "tacho_hand_big";
735 image { image: "tacho_hand_big.png" COMP; size: 73 73 99999 99999; }
736 image { image: "tacho_hand_big2.png" COMP; size: 37 37 72 72; }
737 image { image: "tacho_hand_big3.png" COMP; size: 19 19 36 36; }
738 image { image: "tacho_hand_big4.png" COMP; size: 0 0 18 18; }
739 }
740 images.image: "tacho_hand_big_shadow.png" COMP;
741 images.image: "tacho_hand_small_shadow.png" COMP;
742 set { name: "tacho_hand_small_min";
743 image { image: "tacho_hand_small_min.png" COMP; size: 73 73 99999 99999; }
744 image { image: "tacho_hand_small_min2.png" COMP; size: 37 37 72 72; }
745 image { image: "tacho_hand_small_min3.png" COMP; size: 19 19 36 36; }
746 image { image: "tacho_hand_small_min4.png" COMP; size: 0 0 18 18; }
747 }
748 set { name: "knob";
749 image { image: "knob_sz_24.png" COMP; size: 31 31 32 32; }
750 image { image: "knob_sz_22.png" COMP; size: 29 29 30 30; }
751 image { image: "knob_sz_20.png" COMP; size: 27 27 28 28; }
752 image { image: "knob_sz_18.png" COMP; size: 25 25 26 26; }
753 image { image: "knob_sz_16.png" COMP; size: 23 23 24 24; }
754 image { image: "knob_sz_14.png" COMP; size: 21 21 22 22; }
755 image { image: "knob_sz_12.png" COMP; size: 19 19 20 20; }
756 image { image: "knob_sz_10.png" COMP; size: 17 17 18 18; }
757 image { image: "knob_sz_08.png" COMP; size: 15 15 16 16; }
758 image { image: "knob_sz_06.png" COMP; size: 13 13 14 14; }
759 image { image: "knob_sz_04.png" COMP; size: 0 0 12 12; }
760 }
761 min: 16 16;
762 max: 160 160;
763 script {
764 public do_seconds, tick_timer, timezone;
765 public message(Msg_Type:type, id, ...) {
766 if ((type == MSG_STRING) && (id == 1)) {
767 new str[128];
768
769 getsarg(2, str, sizeof(str));
770 set_str(timezone, str);
771 }
772 }
773
774 public clock_cb(val) {
775 new year, month, day, yearday, weekday, hour, minute;
776 new Float:second;
777 new v, dosec, tim;
778#ifdef EFL_VERSION_1_18
779 new tz[128];
780
781 get_str(timezone, tz, 128);
782 tzdate(tz, year, month, day, yearday, weekday, hour, minute, second);
783#else
784 date(year, month, day, yearday, weekday, hour, minute, second);
785#endif
786 dosec = get_int(do_seconds);
787 if (dosec) {
788 v = round(second);
789 tim = timer(1.0 - (second - v), "clock_cb", 1);
790
791 custom_state(PART:"seconds", "default", 0.0);
792 set_state_val(PART:"seconds", STATE_MAP_ROT_Z, (v * 360.0) / 60.0);
793 set_state(PART:"seconds", "custom", 0.0);
794
795 custom_state(PART:"seconds-sh", "default", 0.0);
796 set_state_val(PART:"seconds-sh", STATE_MAP_ROT_Z, (v * 360.0) / 60.0);
797 set_state(PART:"seconds-sh", "custom", 0.0);
798 }
799 else {
800 tim = timer(60.0 - (second), "clock_cb", 1);
801 }
802 set_int(tick_timer, tim);
803
804 custom_state(PART:"minutes", "default", 0.0);
805 set_state_val(PART:"minutes", STATE_MAP_ROT_Z, (float(minute) * 360.0) / 60.0);
806 set_state(PART:"minutes", "custom", 0.0);
807
808 custom_state(PART:"minutes-sh", "default", 0.0);
809 set_state_val(PART:"minutes-sh", STATE_MAP_ROT_Z, (float(minute) * 360.0) / 60.0);
810 set_state(PART:"minutes-sh", "custom", 0.0);
811
812 custom_state(PART:"hours", "default", 0.0);
813 set_state_val(PART:"hours", STATE_MAP_ROT_Z, ((float(hour) + (float(minute) / 60.0)) * 360.0) / 12.0);
814 set_state(PART:"hours", "custom", 0.0);
815
816 custom_state(PART:"hours-sh", "default", 0.0);
817 set_state_val(PART:"hours-sh", STATE_MAP_ROT_Z, ((float(hour) + (float(minute) / 60.0)) * 360.0) / 12.0);
818 set_state(PART:"hours-sh", "custom", 0.0);
819 }
820 }
821 parts {
822 part { name: "event"; type: RECT;
823 description { state: "default" 0.0;
824 color: 0 0 0 0;
825 }
826 }
827 part { name: "base-sh";
828 description { state: "default" 0.0;
829 rel1.to: "base";
830 rel1.offset: 0 -1;
831 rel2.to: "base";
832 rel2.offset: -1 -2;
833 image.normal: "inset_round_shadow.png";
834 }
835 }
836 part { name: "base-hi";
837 description { state: "default" 0.0;
838 rel1.to: "base";
839 rel1.offset: 0 1;
840 rel2.to: "base";
841 rel2.offset: -1 0;
842 image.normal: "inset_round_hilight.png";
843 }
844 }
845 part { name: "base";
846 description { state: "default" 0.0;
847 rel1.relative: (25/380) (25/380);
848 rel2.relative: (365/380) (365/380);
849 aspect: 1.0 1.0; aspect_preference: BOTH;
850 image.normal: "clock_base.png";
851 }
852 }
853 part { name: "seconds-sh"; mouse_events: 0;
854 description { state: "default" 0.0;
855 image.normal: "tacho_hand_big_shadow.png";
856 rel1.to: "hours-sh";
857 rel2.to: "hours-sh";
858 map {
859 on: 1;
860 rotation.center: "seconds-sh";
861 }
862 }
863 description { state: "hidden" 0.0;
864 inherit: "default" 0.0;
865 visible: 0;
866 }
867 }
868 part { name: "seconds"; mouse_events: 0;
869 description { state: "default" 0.0;
870 image.normal: "tacho_hand_big";
871 color: 255 0 0 255;
872 rel1.to: "base";
873 rel2.to: "base";
874 map {
875 on: 1;
876 rotation.center: "base";
877 }
878 }
879 description { state: "hidden" 0.0;
880 inherit: "default" 0.0;
881 visible: 0;
882 }
883 }
884 part { name: "minutes-sh"; mouse_events: 0;
885 description { state: "default" 0.0;
886 image.normal: "tacho_hand_big_shadow.png";
887 rel1.to: "hours-sh";
888 rel2.to: "hours-sh";
889 map {
890 on: 1;
891 rotation.center: "minutes-sh";
892 }
893 }
894 }
895 part { name: "minutes"; mouse_events: 0;
896 description { state: "default" 0.0000;
897 color: 255 255 255 255;
898 image.normal: "tacho_hand_big";
899 rel1.to: "base";
900 rel2.to: "base";
901 map {
902 on: 1;
903 rotation.center: "base";
904 }
905 }
906 }
907 part { name: "hours-sh"; mouse_events: 0;
908 description { state: "default" 0.0;
909 image.normal: "tacho_hand_small_shadow.png";
910 rel1.to: "hours";
911 rel1.relative: 0.0 (15/380);
912 rel1.offset: 0 1;
913 rel2.to: "hours";
914 rel2.relative: 1.0 (395/380);
915 rel2.offset: -1 0;
916 map {
917 on: 1;
918 rotation.center: "hours-sh";
919 }
920 }
921 }
922 part { name: "hours"; mouse_events: 0;
923 description { state: "default" 0.0;
924 image.normal: "tacho_hand_small_min";
925 color: 255 255 255 255;
926 rel1.to: "base";
927 rel2.to: "base";
928 map {
929 on: 1;
930 rotation.center: "base";
931 }
932 }
933 }
934 part { name: "over"; mouse_events: 0;
935 description { state: "default" 0.0;
936 rel1.to: "base";
937 rel2.to: "base";
938 image.normal: "inset_round_shading.png";
939 }
940 }
941 part { name: "knob"; type: SPACER;
942 description { state: "default" 0.0;
943 rel1.relative: (140/340) (140/340);
944 rel1.to: "base";
945 rel2.relative: (205/340) (205/340);
946 rel2.to: "base";
947 min: 4 4;
948 step: 2 2;
949 max: 24 24;
950 }
951 }
952 part { name: "knob2";
953 description { state: "default" 0.0;
954 rel1.offset: -4 -4;
955 rel1.to: "knob";
956 rel2.offset: 3 3;
957 rel2.to: "knob";
958 min: 12 12;
959 max: 32 32;
960 image.normal: "knob";
961 }
962 }
963 }
964 programs {
965 program {
966 signal: "load"; source: "";
967 script {
968 clock_cb(0);
969 }
970 }
971 program {
972 signal: "e,state,seconds,on"; source: "e";
973 action: STATE_SET "default" 0.0;
974 target: "seconds";
975 target: "seconds-sh";
976 after: "sec2";
977 }
978 program { name: "sec2";
979 script {
980 new tim;
981
982 set_int(do_seconds, 1);
983 tim = get_int(tick_timer);
984 if (tim) {
985 cancel_timer(tim);
986 set_int(tick_timer, 0);
987 }
988 clock_cb(0);
989 }
990 }
991 program {
992 signal: "e,state,seconds,off"; source: "e";
993 action: STATE_SET "hidden" 0.0;
994 target: "seconds";
995 target: "seconds-sh";
996 after: "sec3";
997 }
998 program { name: "sec3";
999 script {
1000 new tim;
1001
1002 set_int(do_seconds, 0);
1003 tim = get_int(tick_timer);
1004 if (tim) {
1005 cancel_timer(tim);
1006 set_int(tick_timer, 0);
1007 }
1008 clock_cb(0);
1009 }
1010 }
1011 }
1012}
1013
1014group { name: "e/gadget/clock/calendar/dayname";
1015 parts {
1016 part { name: "e.text.label"; type: TEXT; mouse_events: 0;
1017 effect: SHADOW BOTTOM;
1018 scale: 1;
1019 description { state: "default" 0.0;
1020 color: FN_COL_DISABLE;
1021 text { font: FN; size: 8;
1022 text: "WWe";
1023 min: 1 1;
1024 ellipsis: -1;
1025 align: 0.5 0.5;
1026 text_class: "module_small";
1027 }
1028 }
1029 description { state: "weekend" 0.0;
1030 inherit: "default" 0.0;
1031 color: 48 48 48 255;
1032 }
1033 }
1034 }
1035 programs {
1036 program {
1037 signal: "e,state,weekend"; source: "e";
1038 action: STATE_SET "weekend" 0.0;
1039 target: "e.text.label";
1040 }
1041 program {
1042 signal: "e,state,weekday"; source: "e";
1043 action: STATE_SET "default" 0.0;
1044 target: "e.text.label";
1045 }
1046 }
1047}
1048
1049group { name: "e/gadget/clock/calendar/day";
1050 script {
1051 public day_state = 0;
1052 evalstate() {
1053 new vv = get_int(day_state);
1054
1055 if (vv & 2)
1056 {
1057 set_state(PART:"e.text.label", "today", 0.0);
1058 set_state(PART:"label2", "today", 0.0);
1059 }
1060 else if (vv & 4)
1061 {
1062 set_state(PART:"e.text.label", "hidden", 0.0);
1063 set_state(PART:"label2", "default", 0.0);
1064 }
1065 else if (vv & 1)
1066 {
1067 set_state(PART:"e.text.label", "weekend", 0.0);
1068 set_state(PART:"label2", "default", 0.0);
1069 }
1070 else
1071 {
1072 set_state(PART:"e.text.label", "default", 0.0);
1073 set_state(PART:"label2", "default", 0.0);
1074 }
1075 }
1076 }
1077 parts {
1078 part { name: "e.text.label"; type: TEXT; mouse_events: 0;
1079 effect: SHADOW BOTTOM;
1080 scale: 1;
1081 description { state: "default" 0.0;
1082 color: FN_COL_DEFAULT;
1083 text { font: FN; size: 10;
1084 text: "00";
1085 min: 1 1;
1086 ellipsis: -1;
1087 align: 0.5 0.5;
1088 }
1089 }
1090 description { state: "today" 0.0;
1091 inherit: "default" 0.0;
1092 visible: 0;
1093 }
1094 description { state: "weekend" 0.0;
1095 inherit: "default" 0.0;
1096 color: FN_COL_MID_GREY;
1097 }
1098 description { state: "hidden" 0.0;
1099 inherit: "default" 0.0;
1100 color: FN_COL_DISABLE;
1101 }
1102 }
1103 part { name: "label2"; type: TEXT; mouse_events: 0;
1104 effect: GLOW;
1105 scale: 1;
1106 description { state: "default" 0.0;
1107 rel1.offset: -3 -3;
1108 rel1.to: "e.text.label";
1109 rel2.offset: 2 1;
1110 rel2.to: "e.text.label";
1111 color: FN_COL_HIGHLIGHT;
1112 text { font: FN; size: 10;
1113 text_source: "e.text.label";
1114 min: 1 1;
1115 ellipsis: -1;
1116 align: 0.5 0.5;
1117 }
1118 visible: 0;
1119 }
1120 description { state: "today" 0.0;
1121 inherit: "default" 0.0;
1122 visible: 1;
1123 }
1124 }
1125 }
1126 programs {
1127 program {
1128 signal: "e,state,weekend"; source: "e";
1129 script {
1130 new vv = get_int(day_state);
1131 set_int(day_state, vv | 1);
1132 evalstate();
1133 }
1134 }
1135 program {
1136 signal: "e,state,weekday"; source: "e";
1137 script {
1138 new vv = get_int(day_state);
1139 set_int(day_state, vv & (~1));
1140 evalstate();
1141 }
1142 }
1143
1144 program {
1145 signal: "e,state,today"; source: "e";
1146 script {
1147 new vv = get_int(day_state);
1148 set_int(day_state, vv | 2);
1149 evalstate();
1150 }
1151 }
1152 program {
1153 signal: "e,state,someday"; source: "e";
1154 script {
1155 new vv = get_int(day_state);
1156 set_int(day_state, vv & (~2));
1157 evalstate();
1158 }
1159 }
1160
1161 program {
1162 signal: "e,state,hidden"; source: "e";
1163 script {
1164 new vv = get_int(day_state);
1165 set_int(day_state, vv | 4);
1166 evalstate();
1167 }
1168 }
1169 program {
1170 signal: "e,state,visible"; source: "e";
1171 script {
1172 new vv = get_int(day_state);
1173 set_int(day_state, vv & (~4));
1174 evalstate();
1175 }
1176 }
1177 }
1178}
1179
1180group { name: "e/gadget/clock/calendar";
1181 images.image: "separator_horiz.png" COMP;
1182 images.image: "sym_left_light_normal.png" COMP;
1183 images.image: "sym_right_light_normal.png" COMP;
1184 images.image: "sym_left_glow_normal.png" COMP;
1185 images.image: "sym_right_glow_normal.png" COMP;
1186 parts {
1187 part { name: "e.text.month"; type: TEXT;
1188 effect: SHADOW BOTTOM;
1189 mouse_events: 1;
1190 scale: 1;
1191 description { state: "default" 0.0;
1192 fixed: 0 1;
1193 align: 0.0 0.0;
1194 rel1.to_x: "prev";
1195 rel1.relative: 1.0 0.0;
1196 rel2.relative: 1.0 0.0;
1197 color: FN_COL_DEFAULT;
1198 text { font: FNBD; size: 10;
1199 text: "000000000000";
1200 align: 0.0 0.5;
1201 min: 0 1;
1202 text_class: "module_normal";
1203 }
1204 }
1205 }
1206 part { name: "e.text.year"; type: TEXT; mouse_events: 0;
1207 effect: SHADOW BOTTOM;
1208 scale: 1;
1209 description { state: "default" 0.0;
1210 fixed: 0 1;
1211 align: 1.0 0.0;
1212 rel1.relative: 0.0 0.0;
1213 rel2.to_x: "next";
1214 rel2.relative: 0.0 0.0;
1215 color: FN_COL_DEFAULT;
1216 text { font: FNBD; size: 10;
1217 text: "0000";
1218 align: 1.0 0.5;
1219 min: 0 1;
1220 text_class: "module_normal";
1221 }
1222 }
1223 }
1224 part { name: "previm"; mouse_events: 0;
1225 description { state: "default" 0.0;
1226 min: 15 15;
1227 max: 15 15;
1228 rel1.to: "prev";
1229 rel2.to: "prev";
1230 image.normal: "sym_left_light_normal.png";
1231 }
1232 description { state: "pressed" 0.0;
1233 inherit: "default" 0.0;
1234 image.normal: "sym_left_glow_normal.png";
1235 }
1236 }
1237 part { name: "prev"; type: RECT;
1238 description { state: "default" 0.0;
1239 align: 0.0 0.5;
1240 color: 0 0 0 0;
1241 aspect: 1.0 1.0; aspect_preference: VERTICAL;
1242 rel1.to_y: "e.text.month";
1243 rel1.relative: 0.0 0.0;
1244 rel2.to_y: "e.text.month";
1245 rel2.relative: 0.0 1.0;
1246 }
1247 program { name: "prev_down";
1248 signal: "mouse,down,1*"; source: "prev";
1249 action: STATE_SET "pressed" 0.0;
1250 target: "previm";
1251 }
1252 program { name: "prev_up";
1253 signal: "mouse,up,1"; source: "prev";
1254 action: STATE_SET "default" 0.0;
1255 target: "previm";
1256 }
1257 program { name: "prev_clicked";
1258 signal: "mouse,clicked,1*"; source: "prev";
1259 action: SIGNAL_EMIT "e,action,prev" "";
1260 }
1261 }
1262 part { name: "nextim"; mouse_events: 0;
1263 description { state: "default" 0.0;
1264 min: 15 15;
1265 max: 15 15;
1266 rel1.to: "next";
1267 rel2.to: "next";
1268 image.normal: "sym_right_light_normal.png";
1269 }
1270 description { state: "pressed" 0.0;
1271 inherit: "default" 0.0;
1272 image.normal: "sym_right_glow_normal.png";
1273 }
1274 }
1275 part { name: "next"; type: RECT;
1276 description { state: "default" 0.0;
1277 align: 1.0 0.5;
1278 color: 0 0 0 0;
1279 aspect: 1.0 1.0; aspect_preference: VERTICAL;
1280 rel1.to_y: "e.text.month";
1281 rel1.relative: 1.0 0.0;
1282 rel2.to_y: "e.text.month";
1283 rel2.relative: 1.0 1.0;
1284 }
1285 program { name: "next_down";
1286 signal: "mouse,down,1"; source: "next";
1287 action: STATE_SET "pressed" 0.0;
1288 target: "nextim";
1289 }
1290 program { name: "next_up";
1291 signal: "mouse,up,1"; source: "next";
1292 action: STATE_SET "default" 0.0;
1293 target: "nextim";
1294 }
1295 program { name: "next_clicked";
1296 signal: "mouse,clicked,1"; source: "next";
1297 action: SIGNAL_EMIT "e,action,next" "";
1298 }
1299 }
1300 part { name: "sel";
1301 description { state: "default" 0.0;
1302 image.normal: "separator_horiz.png";
1303 rel1.relative: 0.0 1.0;
1304 rel1.offset: 0 0;
1305 rel1.to: "e.table.daynames";
1306 rel2.offset: -1 1;
1307 rel2.to: "e.table.daynames";
1308 min: 0 2;
1309 fill.smooth: 0;
1310 }
1311 }
1312
1313 part { name: "e.table.daynames"; type: TABLE;
1314 description { state: "default" 0.0;
1315 fixed: 0 1;
1316 align: 0.5 0.0;
1317 rel1.to_y: "e.text.month";
1318 rel1.relative: 0.0 1.0;
1319 rel1.offset: 2 2;
1320 rel2.to_y: "e.text.month";
1321 rel2.relative: 1.0 1.0;
1322 rel2.offset: -3 2;
1323 step: 7 1;
1324 table { homogeneous: TABLE;
1325 padding: 1 1;
1326 align: 0.5 0.5;
1327 min: 1 1;
1328 }
1329 }
1330 table {
1331 items {
1332#define D(x) \
1333item { \
1334 position: x 0; \
1335 span: 1 1; \
1336 source: "e/gadget/clock/calendar/dayname"; \
1337 weight: 1.0 1.0; \
1338 align: -1.0 -1.0; \
1339}
1340 D(0) D(1) D(2) D(3) D(4) D(5) D(6)
1341#undef D
1342 }
1343 }
1344 }
1345 part { name: "e.table.days"; type: TABLE;
1346 description { state: "default" 0.0;
1347 rel1.to_y: "e.table.daynames";
1348 rel1.relative: 0.0 1.0;
1349 rel1.offset: 2 2;
1350 rel2.offset: -3 -3;
1351 step: 7 5;
1352 table { homogeneous: TABLE;
1353 padding: 1 1;
1354 align: 0.5 0.5;
1355 min: 1 1;
1356 }
1357 }
1358 table {
1359 items {
1360#define D(x, y) \
1361item { \
1362 position: x y; \
1363 span: 1 1; \
1364 source: "e/gadget/clock/calendar/day"; \
1365 weight: 1.0 1.0; \
1366 align: -1.0 -1.0; \
1367}
1368 D(0, 0) D(1, 0) D(2, 0) D(3, 0) D(4, 0) D(5, 0) D(6, 0)
1369 D(0, 1) D(1, 1) D(2, 1) D(3, 1) D(4, 1) D(5, 1) D(6, 1)
1370 D(0, 2) D(1, 2) D(2, 2) D(3, 2) D(4, 2) D(5, 2) D(6, 2)
1371 D(0, 3) D(1, 3) D(2, 3) D(3, 3) D(4, 3) D(5, 3) D(6, 3)
1372 D(0, 4) D(1, 4) D(2, 4) D(3, 4) D(4, 4) D(5, 4) D(6, 4)
1373 D(0, 5) D(1, 5) D(2, 5) D(3, 5) D(4, 5) D(5, 5) D(6, 5)
1374#undef D
1375 }
1376 }
1377 }
1378 }
1379}
diff --git a/data/themes/img/digit_0.png b/data/themes/img/digit_0.png
new file mode 100644
index 000000000..c4c8d093d
--- /dev/null
+++ b/data/themes/img/digit_0.png
Binary files differ
diff --git a/data/themes/img/digit_1.png b/data/themes/img/digit_1.png
new file mode 100644
index 000000000..d79d752b5
--- /dev/null
+++ b/data/themes/img/digit_1.png
Binary files differ
diff --git a/data/themes/img/digit_2.png b/data/themes/img/digit_2.png
new file mode 100644
index 000000000..2e022b2a4
--- /dev/null
+++ b/data/themes/img/digit_2.png
Binary files differ
diff --git a/data/themes/img/digit_3.png b/data/themes/img/digit_3.png
new file mode 100644
index 000000000..6585e721e
--- /dev/null
+++ b/data/themes/img/digit_3.png
Binary files differ
diff --git a/data/themes/img/digit_4.png b/data/themes/img/digit_4.png
new file mode 100644
index 000000000..8a01e4f90
--- /dev/null
+++ b/data/themes/img/digit_4.png
Binary files differ
diff --git a/data/themes/img/digit_5.png b/data/themes/img/digit_5.png
new file mode 100644
index 000000000..254d87122
--- /dev/null
+++ b/data/themes/img/digit_5.png
Binary files differ
diff --git a/data/themes/img/digit_6.png b/data/themes/img/digit_6.png
new file mode 100644
index 000000000..82b7cb4f3
--- /dev/null
+++ b/data/themes/img/digit_6.png
Binary files differ
diff --git a/data/themes/img/digit_7.png b/data/themes/img/digit_7.png
new file mode 100644
index 000000000..90570ee55
--- /dev/null
+++ b/data/themes/img/digit_7.png
Binary files differ
diff --git a/data/themes/img/digit_8.png b/data/themes/img/digit_8.png
new file mode 100644
index 000000000..ff08c92bd
--- /dev/null
+++ b/data/themes/img/digit_8.png
Binary files differ
diff --git a/data/themes/img/digit_9.png b/data/themes/img/digit_9.png
new file mode 100644
index 000000000..b5aceb205
--- /dev/null
+++ b/data/themes/img/digit_9.png
Binary files differ
diff --git a/data/themes/img/digit_am.png b/data/themes/img/digit_am.png
new file mode 100644
index 000000000..fad1bd9f7
--- /dev/null
+++ b/data/themes/img/digit_am.png
Binary files differ
diff --git a/data/themes/img/digit_na.png b/data/themes/img/digit_na.png
new file mode 100644
index 000000000..5b9fc59e2
--- /dev/null
+++ b/data/themes/img/digit_na.png
Binary files differ
diff --git a/data/themes/img/digit_nm.png b/data/themes/img/digit_nm.png
new file mode 100644
index 000000000..8b81f23a0
--- /dev/null
+++ b/data/themes/img/digit_nm.png
Binary files differ
diff --git a/data/themes/img/digit_pm.png b/data/themes/img/digit_pm.png
new file mode 100644
index 000000000..da7c8fdfb
--- /dev/null
+++ b/data/themes/img/digit_pm.png
Binary files differ
|
__label__pos
| 0.984545 |
Back to top
IZEAx V1 API (Beta)
The IZEAx API allows you to connect to your IZEAx Campaigns programmatically. Using this API you can enumerate your Campaigns and then retrieve information and metrics about the Offers in each one.
Authentication
In order to successfully call the IZEAx API you will need an Authentication Token. You can create an Authentication Token in the Account Settings tab of IZEAx. This token must be passed in the Authentication header of your request as follows.
Please note that, as this is a Beta program, we may need to enable the API Token tab for your account. Please reach out to your customer success representative for access.
Authorization: Bearer: <token>
Authorization
You must also pass the ID of the Account that you are working with through the X-IZEA-Account-ID header. Your Account ID can be found on the API Token tab in IZEAx. Please reach out to your customer success representative for access.
X-IZEA-Account-ID: <accountid>
Campaigns
Campaigns
Get Campaigns
GET/campaigns
Use this request to retrieve information about, and enumerate all of your Campaigns in IZEAx. In order to call the /metrics endpoint, you must have a campaign id, so use this endpoint to start.
Example URI
GET https://api-v1.izea.com/campaigns
Response 200
HideShow
Headers
Content-Type: application/json
Body
{
"data": [
{
"id": "6",
"campaign_type": "sponsorship",
"name": "My Campaign"
}
]
}
Schema
{
"$schema": "http://json-schema.org/draft-04/schema#",
"type": "object",
"properties": {
"data": {
"type": "array"
}
}
}
Metrics
Metrics
Get Metrics
GET/metrics{?campaignid,page}
Once you have a campaign ID, use this endpoint to retrieve a paginated set of Offers for the Campaign. Each Offer will come with the last 30 days of metrics.
This endpoint is paginated with a page size of 10. If your campaign has more Offers than that, a link to the next page will be provided in the response.
The platform_data field in the response will vary depending on what platform the Offer was published on. The values will be as follows:
• blogs:
• comments
• facebook
• comments
• likes
• shares
• views
• instagram:
• comments
• likes
• views
• twitter
• likes
• replies
• retweets
• youtube
• comments
• likes
• views
Example URI
GET https://api-v1.izea.com/metrics?campaignid=6&page=1
URI Parameters
HideShow
campaignid
string (required) Example: 6
The ID of the campaign to retrieve metrics for.
page
number (optional) Example: 1
The page of offers to retrieve. 1 if not specified.
Response 200
HideShow
Body
{
"data": {
"offers": [
{
"id": "10000",
"published_at": "2018-01-01T02:45:90.000-05:00",
"published_url": "http://twitter.com/izea/",
"reach_when_published": 3000,
"connection_name": "@izea",
"platform": "twitter",
"connection_url": "http://twitter.com/izea",
"metrics": [
{
"metric_on": "2018-01-01",
"platform_data": {
"comments": 2,
"likes": 312,
"loops": 77,
"reblogs": 436,
"shares": 12,
"replies": 8,
"retweets": 1,
"views": 234
},
"total_clicks_to_date": 76,
"total_views_to_date": 400
}
]
}
]
},
"links": {
"_next": "https://api-v1.izea.com/metrics?campaignif=6&page=4",
"_prev": "https://api-v1.izea.com/metrics?campaignif=6&page=2"
}
}
Schema
{
"type": "object",
"properties": {
"data": {
"type": "object",
"properties": {
"offers": {
"type": "array",
"items": {
"type": "object",
"properties": {
"id": {
"type": "string"
},
"published_at": {
"type": "string"
},
"published_url": {
"type": "string"
},
"reach_when_published": {
"type": "number"
},
"connection_name": {
"type": "string"
},
"platform": {
"type": "string"
},
"connection_url": {
"type": "string"
},
"metrics": {
"type": "array",
"items": {
"type": "object",
"properties": {
"metric_on": {
"type": "string"
},
"platform_data": {
"type": "object",
"properties": {
"comments": {
"type": "number"
},
"likes": {
"type": "number"
},
"loops": {
"type": "number"
},
"reblogs": {
"type": "number"
},
"shares": {
"type": "number"
},
"replies": {
"type": "number"
},
"retweets": {
"type": "number"
},
"views": {
"type": "number"
}
}
},
"total_clicks_to_date": {
"type": "number"
},
"total_views_to_date": {
"type": "number"
}
}
}
}
}
}
}
}
},
"links": {
"type": "object",
"properties": {
"_next": {
"type": "string"
},
"_prev": {
"type": "string"
}
}
}
},
"$schema": "http://json-schema.org/draft-04/schema#"
}
Generated by aglio on 19 Mar 2019
|
__label__pos
| 0.997213 |
summaryrefslogtreecommitdiff
path: root/lib/crc64.c
blob: 9f852a89ee2a1e4858b40d04373395e385a1d66c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
// SPDX-License-Identifier: GPL-2.0
/*
* Normal 64-bit CRC calculation.
*
* This is a basic crc64 implementation following ECMA-182 specification,
* which can be found from,
* https://www.ecma-international.org/publications/standards/Ecma-182.htm
*
* Dr. Ross N. Williams has a great document to introduce the idea of CRC
* algorithm, here the CRC64 code is also inspired by the table-driven
* algorithm and detail example from this paper. This paper can be found
* from,
* http://www.ross.net/crc/download/crc_v3.txt
*
* crc64table[256] is the lookup table of a table-driven 64-bit CRC
* calculation, which is generated by gen_crc64table.c in kernel build
* time. The polynomial of crc64 arithmetic is from ECMA-182 specification
* as well, which is defined as,
*
* x^64 + x^62 + x^57 + x^55 + x^54 + x^53 + x^52 + x^47 + x^46 + x^45 +
* x^40 + x^39 + x^38 + x^37 + x^35 + x^33 + x^32 + x^31 + x^29 + x^27 +
* x^24 + x^23 + x^22 + x^21 + x^19 + x^17 + x^13 + x^12 + x^10 + x^9 +
* x^7 + x^4 + x + 1
*
* Copyright 2018 SUSE Linux.
* Author: Coly Li <[email protected]>
*/
#include <linux/module.h>
#include <linux/types.h>
#include <linux/crc64.h>
#include "crc64table.h"
MODULE_DESCRIPTION("CRC64 calculations");
MODULE_LICENSE("GPL v2");
/**
* crc64_be - Calculate bitwise big-endian ECMA-182 CRC64
* @crc: seed value for computation. 0 or (u64)~0 for a new CRC calculation,
* or the previous crc64 value if computing incrementally.
* @p: pointer to buffer over which CRC64 is run
* @len: length of buffer @p
*/
u64 __pure crc64_be(u64 crc, const void *p, size_t len)
{
size_t i, t;
const unsigned char *_p = p;
for (i = 0; i < len; i++) {
t = ((crc >> 56) ^ (*_p++)) & 0xFF;
crc = crc64table[t] ^ (crc << 8);
}
return crc;
}
EXPORT_SYMBOL_GPL(crc64_be);
|
__label__pos
| 0.993311 |
summaryrefslogtreecommitdiff
path: root/nchan.c
blob: 0ea88da33a74bd3bba271848e8d4a21a4c3d8089 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
/*
* Copyright (c) 1999 Markus Friedl. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Markus Friedl.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "includes.h"
RCSID("$Id: nchan.c,v 1.10 2000/05/09 01:03:01 damien Exp $");
#include "ssh.h"
#include "buffer.h"
#include "packet.h"
#include "channels.h"
#include "nchan.h"
#include "ssh2.h"
#include "compat.h"
/* functions manipulating channel states */
/*
* EVENTS update channel input/output states execute ACTIONS
*/
/* events concerning the INPUT from socket for channel (istate) */
chan_event_fn *chan_rcvd_oclose = NULL;
chan_event_fn *chan_read_failed = NULL;
chan_event_fn *chan_ibuf_empty = NULL;
/* events concerning the OUTPUT from channel for socket (ostate) */
chan_event_fn *chan_rcvd_ieof = NULL;
chan_event_fn *chan_write_failed = NULL;
chan_event_fn *chan_obuf_empty = NULL;
/*
* ACTIONS: should never update the channel states
*/
static void chan_send_ieof1(Channel *c);
static void chan_send_oclose1(Channel *c);
static void chan_send_close2(Channel *c);
static void chan_send_eof2(Channel *c);
/* channel cleanup */
chan_event_fn *chan_delete_if_full_closed = NULL;
/* helper */
static void chan_shutdown_write(Channel *c);
static void chan_shutdown_read(Channel *c);
/*
* SSH1 specific implementation of event functions
*/
static void
chan_rcvd_oclose1(Channel *c)
{
debug("channel %d: rcvd oclose", c->self);
switch (c->istate) {
case CHAN_INPUT_WAIT_OCLOSE:
debug("channel %d: input wait_oclose -> closed", c->self);
c->istate = CHAN_INPUT_CLOSED;
break;
case CHAN_INPUT_OPEN:
debug("channel %d: input open -> closed", c->self);
chan_shutdown_read(c);
chan_send_ieof1(c);
c->istate = CHAN_INPUT_CLOSED;
break;
case CHAN_INPUT_WAIT_DRAIN:
/* both local read_failed and remote write_failed */
log("channel %d: input drain -> closed", c->self);
chan_send_ieof1(c);
c->istate = CHAN_INPUT_CLOSED;
break;
default:
error("channel %d: protocol error: chan_rcvd_oclose for istate %d",
c->self, c->istate);
return;
}
}
static void
chan_read_failed_12(Channel *c)
{
debug("channel %d: read failed", c->self);
switch (c->istate) {
case CHAN_INPUT_OPEN:
debug("channel %d: input open -> drain", c->self);
chan_shutdown_read(c);
c->istate = CHAN_INPUT_WAIT_DRAIN;
if (buffer_len(&c->input) == 0) {
debug("channel %d: input: no drain shortcut", c->self);
chan_ibuf_empty(c);
}
break;
default:
error("channel %d: internal error: we do not read, but chan_read_failed for istate %d",
c->self, c->istate);
break;
}
}
static void
chan_ibuf_empty1(Channel *c)
{
debug("channel %d: ibuf empty", c->self);
if (buffer_len(&c->input)) {
error("channel %d: internal error: chan_ibuf_empty for non empty buffer",
c->self);
return;
}
switch (c->istate) {
case CHAN_INPUT_WAIT_DRAIN:
debug("channel %d: input drain -> wait_oclose", c->self);
chan_send_ieof1(c);
c->istate = CHAN_INPUT_WAIT_OCLOSE;
break;
default:
error("channel %d: internal error: chan_ibuf_empty for istate %d",
c->self, c->istate);
break;
}
}
static void
chan_rcvd_ieof1(Channel *c)
{
debug("channel %d: rcvd ieof", c->self);
if (c->type != SSH_CHANNEL_OPEN) {
debug("channel %d: non-open", c->self);
if (c->istate == CHAN_INPUT_OPEN) {
debug("channel %d: non-open: input open -> wait_oclose", c->self);
chan_shutdown_read(c);
chan_send_ieof1(c);
c->istate = CHAN_INPUT_WAIT_OCLOSE;
} else {
error("channel %d: istate %d != open", c->self, c->istate);
}
if (c->ostate == CHAN_OUTPUT_OPEN) {
debug("channel %d: non-open: output open -> closed", c->self);
chan_send_oclose1(c);
c->ostate = CHAN_OUTPUT_CLOSED;
} else {
error("channel %d: ostate %d != open", c->self, c->ostate);
}
return;
}
switch (c->ostate) {
case CHAN_OUTPUT_OPEN:
debug("channel %d: output open -> drain", c->self);
c->ostate = CHAN_OUTPUT_WAIT_DRAIN;
break;
case CHAN_OUTPUT_WAIT_IEOF:
debug("channel %d: output wait_ieof -> closed", c->self);
c->ostate = CHAN_OUTPUT_CLOSED;
break;
default:
error("channel %d: protocol error: chan_rcvd_ieof for ostate %d",
c->self, c->ostate);
break;
}
}
static void
chan_write_failed1(Channel *c)
{
debug("channel %d: write failed", c->self);
switch (c->ostate) {
case CHAN_OUTPUT_OPEN:
debug("channel %d: output open -> wait_ieof", c->self);
chan_send_oclose1(c);
c->ostate = CHAN_OUTPUT_WAIT_IEOF;
break;
case CHAN_OUTPUT_WAIT_DRAIN:
debug("channel %d: output wait_drain -> closed", c->self);
chan_send_oclose1(c);
c->ostate = CHAN_OUTPUT_CLOSED;
break;
default:
error("channel %d: internal error: chan_write_failed for ostate %d",
c->self, c->ostate);
break;
}
}
static void
chan_obuf_empty1(Channel *c)
{
debug("channel %d: obuf empty", c->self);
if (buffer_len(&c->output)) {
error("channel %d: internal error: chan_obuf_empty for non empty buffer",
c->self);
return;
}
switch (c->ostate) {
case CHAN_OUTPUT_WAIT_DRAIN:
debug("channel %d: output drain -> closed", c->self);
chan_send_oclose1(c);
c->ostate = CHAN_OUTPUT_CLOSED;
break;
default:
error("channel %d: internal error: chan_obuf_empty for ostate %d",
c->self, c->ostate);
break;
}
}
static void
chan_send_ieof1(Channel *c)
{
debug("channel %d: send ieof", c->self);
switch (c->istate) {
case CHAN_INPUT_OPEN:
case CHAN_INPUT_WAIT_DRAIN:
packet_start(SSH_MSG_CHANNEL_INPUT_EOF);
packet_put_int(c->remote_id);
packet_send();
break;
default:
error("channel %d: internal error: cannot send ieof for istate %d",
c->self, c->istate);
break;
}
}
static void
chan_send_oclose1(Channel *c)
{
debug("channel %d: send oclose", c->self);
switch (c->ostate) {
case CHAN_OUTPUT_OPEN:
case CHAN_OUTPUT_WAIT_DRAIN:
chan_shutdown_write(c);
buffer_consume(&c->output, buffer_len(&c->output));
packet_start(SSH_MSG_CHANNEL_OUTPUT_CLOSE);
packet_put_int(c->remote_id);
packet_send();
break;
default:
error("channel %d: internal error: cannot send oclose for ostate %d",
c->self, c->ostate);
break;
}
}
static void
chan_delete_if_full_closed1(Channel *c)
{
if (c->istate == CHAN_INPUT_CLOSED && c->ostate == CHAN_OUTPUT_CLOSED) {
debug("channel %d: full closed", c->self);
channel_free(c->self);
}
}
/*
* the same for SSH2
*/
static void
chan_rcvd_oclose2(Channel *c)
{
debug("channel %d: rcvd close", c->self);
if (c->flags & CHAN_CLOSE_RCVD)
error("channel %d: protocol error: close rcvd twice", c->self);
c->flags |= CHAN_CLOSE_RCVD;
if (c->type == SSH_CHANNEL_LARVAL) {
/* tear down larval channels immediately */
c->ostate = CHAN_OUTPUT_CLOSED;
c->istate = CHAN_INPUT_CLOSED;
return;
}
switch (c->ostate) {
case CHAN_OUTPUT_OPEN:
/* wait until a data from the channel is consumed if a CLOSE is received */
debug("channel %d: output open -> drain", c->self);
c->ostate = CHAN_OUTPUT_WAIT_DRAIN;
break;
}
switch (c->istate) {
case CHAN_INPUT_OPEN:
debug("channel %d: input open -> closed", c->self);
chan_shutdown_read(c);
break;
case CHAN_INPUT_WAIT_DRAIN:
debug("channel %d: input drain -> closed", c->self);
chan_send_eof2(c);
break;
}
c->istate = CHAN_INPUT_CLOSED;
}
static void
chan_ibuf_empty2(Channel *c)
{
debug("channel %d: ibuf empty", c->self);
if (buffer_len(&c->input)) {
error("channel %d: internal error: chan_ibuf_empty for non empty buffer",
c->self);
return;
}
switch (c->istate) {
case CHAN_INPUT_WAIT_DRAIN:
debug("channel %d: input drain -> closed", c->self);
if (!(c->flags & CHAN_CLOSE_SENT))
chan_send_eof2(c);
c->istate = CHAN_INPUT_CLOSED;
break;
default:
error("channel %d: internal error: chan_ibuf_empty for istate %d",
c->self, c->istate);
break;
}
}
static void
chan_rcvd_ieof2(Channel *c)
{
debug("channel %d: rcvd eof", c->self);
if (c->ostate == CHAN_OUTPUT_OPEN) {
debug("channel %d: output open -> drain", c->self);
c->ostate = CHAN_OUTPUT_WAIT_DRAIN;
}
}
static void
chan_write_failed2(Channel *c)
{
debug("channel %d: write failed", c->self);
switch (c->ostate) {
case CHAN_OUTPUT_OPEN:
debug("channel %d: output open -> closed", c->self);
chan_shutdown_write(c); /* ?? */
c->ostate = CHAN_OUTPUT_CLOSED;
break;
case CHAN_OUTPUT_WAIT_DRAIN:
debug("channel %d: output drain -> closed", c->self);
chan_shutdown_write(c);
c->ostate = CHAN_OUTPUT_CLOSED;
break;
default:
error("channel %d: internal error: chan_write_failed for ostate %d",
c->self, c->ostate);
break;
}
}
static void
chan_obuf_empty2(Channel *c)
{
debug("channel %d: obuf empty", c->self);
if (buffer_len(&c->output)) {
error("internal error: chan_obuf_empty %d for non empty buffer",
c->self);
return;
}
switch (c->ostate) {
case CHAN_OUTPUT_WAIT_DRAIN:
debug("channel %d: output drain -> closed", c->self);
chan_shutdown_write(c);
c->ostate = CHAN_OUTPUT_CLOSED;
break;
default:
error("channel %d: internal error: chan_obuf_empty for ostate %d",
c->self, c->ostate);
break;
}
}
static void
chan_send_eof2(Channel *c)
{
debug("channel %d: send eof", c->self);
switch (c->istate) {
case CHAN_INPUT_WAIT_DRAIN:
packet_start(SSH2_MSG_CHANNEL_EOF);
packet_put_int(c->remote_id);
packet_send();
break;
default:
error("channel %d: internal error: cannot send eof for istate %d",
c->self, c->istate);
break;
}
}
static void
chan_send_close2(Channel *c)
{
debug("channel %d: send close", c->self);
if (c->ostate != CHAN_OUTPUT_CLOSED ||
c->istate != CHAN_INPUT_CLOSED) {
error("channel %d: internal error: cannot send close for istate/ostate %d/%d",
c->self, c->istate, c->ostate);
} else if (c->flags & CHAN_CLOSE_SENT) {
error("channel %d: internal error: already sent close", c->self);
} else {
packet_start(SSH2_MSG_CHANNEL_CLOSE);
packet_put_int(c->remote_id);
packet_send();
c->flags |= CHAN_CLOSE_SENT;
}
}
static void
chan_delete_if_full_closed2(Channel *c)
{
if (c->istate == CHAN_INPUT_CLOSED && c->ostate == CHAN_OUTPUT_CLOSED) {
if (!(c->flags & CHAN_CLOSE_SENT)) {
chan_send_close2(c);
}
if ((c->flags & CHAN_CLOSE_SENT) &&
(c->flags & CHAN_CLOSE_RCVD)) {
debug("channel %d: full closed2", c->self);
channel_free(c->self);
}
}
}
/* shared */
void
chan_init_iostates(Channel *c)
{
c->ostate = CHAN_OUTPUT_OPEN;
c->istate = CHAN_INPUT_OPEN;
c->flags = 0;
}
/* init */
void
chan_init(void)
{
if (compat20) {
chan_rcvd_oclose = chan_rcvd_oclose2;
chan_read_failed = chan_read_failed_12;
chan_ibuf_empty = chan_ibuf_empty2;
chan_rcvd_ieof = chan_rcvd_ieof2;
chan_write_failed = chan_write_failed2;
chan_obuf_empty = chan_obuf_empty2;
chan_delete_if_full_closed = chan_delete_if_full_closed2;
} else {
chan_rcvd_oclose = chan_rcvd_oclose1;
chan_read_failed = chan_read_failed_12;
chan_ibuf_empty = chan_ibuf_empty1;
chan_rcvd_ieof = chan_rcvd_ieof1;
chan_write_failed = chan_write_failed1;
chan_obuf_empty = chan_obuf_empty1;
chan_delete_if_full_closed = chan_delete_if_full_closed1;
}
}
/* helper */
static void
chan_shutdown_write(Channel *c)
{
buffer_consume(&c->output, buffer_len(&c->output));
if (compat20 && c->type == SSH_CHANNEL_LARVAL)
return;
/* shutdown failure is allowed if write failed already */
debug("channel %d: close_write", c->self);
if (c->sock != -1) {
if (shutdown(c->sock, SHUT_WR) < 0)
debug("channel %d: chan_shutdown_write: shutdown() failed for fd%d: %.100s",
c->self, c->sock, strerror(errno));
} else {
if (close(c->wfd) < 0)
log("channel %d: chan_shutdown_write: close() failed for fd%d: %.100s",
c->self, c->wfd, strerror(errno));
c->wfd = -1;
}
}
static void
chan_shutdown_read(Channel *c)
{
if (compat20 && c->type == SSH_CHANNEL_LARVAL)
return;
debug("channel %d: close_read", c->self);
if (c->sock != -1) {
if (shutdown(c->sock, SHUT_RD) < 0)
error("channel %d: chan_shutdown_read: shutdown() failed for fd%d [i%d o%d]: %.100s",
c->self, c->sock, c->istate, c->ostate, strerror(errno));
} else {
if (close(c->rfd) < 0)
log("channel %d: chan_shutdown_read: close() failed for fd%d: %.100s",
c->self, c->rfd, strerror(errno));
c->rfd = -1;
}
}
|
__label__pos
| 0.998324 |
Project
General
Profile
Howto PHP
Lighttpd config
setup {
module_load ( "mod_fastcgi" );
}
php = {
if phys.path =$ ".php" {
if physical.is_file {
fastcgi "unix:/var/run/lighttpd/sockets/www-default-php.sock";
}
}
};
# ... some vhost/directory/whatever
# just use it in places where you want allow php.
# you need docroot before it (an alias / index if you need them)!
docroot "/var/www";
alias "/phpmyadmin" => "/usr/share/phpmyadmin";
index ( "index.php", "index.html" );
# if you want to use urls like http://example.com/index.php/some/path (using your php files like directories), you need this:
pathinfo;
php;
# ...
Spawning php
Simple ./run script to spawn php with spawn-fcgi and runit/daemontools:
#!/bin/sh
exec 2>&1
PHP_FCGI_CHILDREN=2 \
PHP_FCGI_MAX_REQUESTS=10000 \
LANG=C LC_ALL=C \
exec /usr/bin/spawn-fcgi -n -s /var/run/lighttpd/sockets/www-default-php.sock -u www-default -U www-data -- /usr/bin/php5-cgi
php-fpm
This directs physical files with extension .php and the special url "/fpm-status" to php.
-- php-fpm.lua
local function phpfpm(act)
return action.when(physical.path:suffix(".php"),
action.when(physical.is_file:is(), act),
action.when(request.path:eq("/fpm-status"), act)
)
end
actions = {
["phpfpm"] = phpfpm,
}
setup {
module_load ( "mod_fastcgi", "mod_lua" );
lua.plugin "/etc/lighttpd2/php-fpm.lua";
}
php = {
phpfpm { fastcgi "unix:/var/run/lighttpd2-php-www-default.sock"; };
};
Or, without the lua helper (which is only run at startup, no runtime lua involved):
setup {
module_load ( "mod_fastcgi" );
}
php = {
if phys.path =$ ".php" {
if physical.is_file {
fastcgi "unix:/var/run/lighttpd/sockets/www-default-php.sock";
}
} else if request.path == "/fpm-status" {
fastcgi "unix:/var/run/lighttpd2-php-www-default.sock";
}
};
Updated by stbuehler almost 7 years ago · 7 revisions
|
__label__pos
| 0.796254 |
answersLogoWhite
0
Which TI basic statements are used to branch?
User Avatar
Wiki User
2011-03-25 03:52:54
Best Answer
TI-Basic doesn't support multi tasking.
User Avatar
Wiki User
2011-03-25 03:52:54
This answer is:
User Avatar
Study guides
Add your answer:
Earn +20 pts
Q: Which TI basic statements are used to branch?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions
When was the TI-2500 DataMath introduced?
1972 ( http://datamath.org/BASIC/DATAMATH/ti-2500-1.htm )
How do the HP calculators handle TI-BASIC?
TI-Basic is just an unofficial name.In truth Texas Instruments doesn't call it anything.Noone else uses the term except enthusiast.
What is a basic Mario program for the ti-83 plus?
I don't think there are any "Basic" programs for Mario.
When was the TI 2500 DataMath calculator introduced?
1972 ( http://datamath.org/BASIC/DATAMATH/ti-2500-1.htm )
Who uses TI BASIC and what is its purpose?
The purpose of TI BASIC is to create math-oriented programs. It is exactly the same as what you normally input to do math, only with the addition of loops and other programish things. A big favorite is the Quadratic formula program, in which you input A, B, and C and it gives you the answers. I use TI BASIC to make my calculator do my homework for me.
When was the TI 2500 DataMath introduced?
1972 link here for evidence http://datamath.org/BASIC/DATAMATH/ti-2500-1.htm
How often must the legislative branch redistrict?
10 years due ti the yearly census
What are examples of sofa syllables?
"do", "re", "mi", "fa", "so", "la" and "ti" are the basic ones, but each of those notes would have variations, used when you raise or lower a note chromatically (for example: a raised "do" is a "di" and a raised "re" is a "ri", and a lowered "ti" is a "to")
Where did they get ti from for ti name?
his grandad used to call him T.I.P so he got his inspirational from there
What is fo ti used for?
Chinese herbalists also maintain that fo ti strengthens the liver and kidneys.
What is the tune to London Bridge is Falling Down?
Ti ti ti ti ti ti ta. Ti ti ta. Ti ti ta. Ti ti ti ti ti ti ta. Ti ti ta ta.
What maori used this plant as a drink to reduce fever and colds?
ti tree Ti tree is the answer, ti tree is very good indeed and there is an oil made of ti tree oil. It is an amazing substance and can be very handy.
People also asked
|
__label__pos
| 0.99998 |
DVT e Language IDE User Guide
Rev. 23.1.12, 23 May 2023
Chapter 38. How to Report an Issue?
You can send an issue report right from the DVT GUI using the Report an Issue dialog. Along with a problem description, we often need logs and system information in order to reproduce a problematic behavior and fix it.
Go to menu Help > DVT Quick Help > Report an Issue or simply click the toolbar button:
Fill in the identification data (will be remembered for future reports) and issue description. Attach screenshots, code snippets or any other files you consider helpful in reproducing the problem. By default various application logs and diagnostic files are attached. You can preview any attachment using the magnifier icon.
When you click 'Send', an e-mail is sent to [email protected] with your own address in CC. You can also save the issue report as a zip archive, and send it manually to [email protected] (for example if you don't have Internet connectivity on the machine where DVT runs).
The most useful debug information when dealing with performance issues is a JVM thread dump. Most likely this will help us pinpoint the problem and provide a fast solution.
How to generate a thread dump from within DVT Eclipse?
To generate a thread dump from within DVT go to Help > DVT Quick Help > Thread Dump Collector. Start the collector, then do the operation that causes the performance issue and afterwards stop the process from the same dialog.
You can also use the Start Thread Dump Collector and Stop Thread Dump Collector shortcuts from the Quick Access bar (Ctrl+3). The thread dump is generated in the directory of the currently selected DVT project.
How to generate a thread dump from outside DVT Eclipse?
Assuming the DVT GUI is frozen, you can still generate a thread dump by running a script. Open a terminal, log into the machine where DVT runs and run the following command:
$DVT_HOME/bin/dvt_debug_utils.sh -workspace <dvt_workspace_location> -thread_dump -nof_kills 60 -tbs 500ms
The thread dump file is generated in the <dvt_workspace_location>.
How to generate a thread dump for Verissimo & Specador running in batch mode?
Open a terminal and log into the machine where Verissimo/Specador runs. Identify the PID of the Verissimo/Specador java process, for example:
ps aux | grep ro.amiq.dvt.main.specador.SpecadorMain
ps aux | grep ro.amiq.vlogdt.main.VerissimoMain
Run the following command:
$DVT_HOME/bin/dvt_debug_utils.sh -pid <PID> -thread_dump -nof_kills 60 -tbs 500ms
The thread dump is generated in the current directory.
Note: Thread dumps can be automatically generated for specific named actions that the tool performs using the +dvt_profile+<name>[ +<name>][ +<period_ms>] build configuration directive, where <name> is one of: VLOG_RI, VLOG_RC, VLOG_RPC, VLOG_ELAB, VLOG_RD, VLOG_FSC, VLOG_EV, VLOG_US, VLOG_EP, VLOG_CP, VHDL_RU, VHDL_RT, VHDL_RD, VHDL_FSC, VHDL_USBD, VHDL_US, VHDL_RPC, VHDL_ELAB, VHDL_CP, ALL.
|
__label__pos
| 0.913803 |
Extending real-time container request
From PegaWiki
This is the approved revision of this page, as well as being the most recent.
Jump to navigation Jump to search
Extending real-time container request
Description Extend the real-time container payload so an external application can pass additional input.
Version as of 8.4
Application Customer Decision Hub
Capability/Industry Area Cross-sell and upsell on digital
Purpose[edit]
Extend the real-time container payload so an external application can pass additional input, which could be used by the decision strategy.
Use case examples[edit]
An application needs to send aggregated data for each entity (for example department).
Before you begin[edit]
For a basic understanding of real-time containers, see the Pega Customer Decision Hub User Guide on Pega Community.
Extending the real-time container request[edit]
1. Create a custom class that represents the request. Class: RequestData PageList: -PatronID -PEPAggregates
2. Create a property in the container payload class. Class: PegaMKT-Data-Container Page: -RequestData
3. Add the property to the Int-PegaCDH-Container-Request class.
4. Access the property in the decision strategy from a Set property component. Category = Primary.ContainerPayload.RequestData.PatronID
Results[edit]
Testing / verification:
Simple Request
Request:
{
"ContainerName": "AllOffers",
"CustomerID": "Customer1",
"RequestData":{
"PatronID": "Customer1",
"PEPAggregates":""
}
}
Returns - Status OK and relevant offers with "Customer1" in category
Aggregate Pagelist
{
"ContainerName": "AllOffers",
"CustomerID": "Customer1",
"RequestData":{
"PatronID": "Customer1",
"PEPAggregates": [{
"Days": "7",
"Department": "Department101",
"PointBalance": "100.11"
},
{
"Days": "7",
"Department": "Department101",
"PointBalance": "1.0"
},
{
"Days": "7",
"Department": "Department102",
"PointBalance": "100.11"
}]
}
}
|
__label__pos
| 0.9564 |
• Evidence of RMAN backup run
If I run any RMAN backup, does Oracle provide a historical means, a table entry or database view which is evidence that an RMAN backup was run on a certain date?
Miki5 pointsBadges:
• Where does Oracle automatic backup create the backup file?
I have created one database through DBCA on Oracle 10.1.0.2.0 and choose automatic backup daily at 2 am. But I cannot see any backup that is done under Oracle flash recovery area. Does it create in any other place? No error message was found in alertlog. Any ideas?
OracleATE190 pointsBadges:
• How do I recover deleted data from Oracle 9i?
Today morining at 10:30am, user deiete the data, and I have 12 aug, rman full backup, can you help me out with this mess, Thanks Ather Hussain [email protected]
Mygold5 pointsBadges:
• How do you restore and recover RMAN incremental backup on a new Host in different HDD partition?
How do you restore and recover RMAN incremental backup on a new Host in different HDD partition? My target and source operating system is Windows server. Please tell me the steps. I have done up to restoration. The restoration is completed successfully without any errors. But when I am firing...
OracleATE190 pointsBadges:
• TDP Linux Oracle backupuser rights
What rights do I have to assign, and where (in the /opt/tivoli folder, and in the location of the log files) for a specific user in Linux to run the scrpts for TDP Oracle backup
Idantanna5 pointsBadges:
• Flash Recovery Area in Oracle 11g
What is the easiest way to handle the flash recovery area in Oracle? I'm having to run an RMan job daily to delete obsolete backups so the flash recovery area does not get too full and then I have to run an operating system task to clean up the empty directories that get left behind after the...
ITKE372,075 pointsBadges:
• Oracle archive log mode
I have two databases A & B. A is a production database and B is an exact cloned copy of A and both are in archive log mode. I copy archived logs of database A using UNIX FTP binary mode to database server B and manually applied those logs to database B to keep both databases in sync. When I use...
BrentSheets6,925 pointsBadges:
• Oracle archives are not moving from primary to standby database
Archives are not moving from primary to standby database, which are in the same machine. What things do I need to check?
OracleATE190 pointsBadges:
• oracle cold backup 8.1.7.4 restore to oracle8.1.7.4 Can it be done.
Please advise if I can take a cold backup from oracle 8.1.7.2 and restore onto oracle 8.1.7.4 binaries thanks
Dannyl0 pointsBadges:
• Oracle Backup
Dear Friends, Please I need to advice my management on the best policy to do backup of our Oracle Database running of HPUX. I am familiar with backing up file system. I also learnt the RMAN is a good way to do backup in Oracle too. Could you please give me the advantages and difference in using...
Chax29100 pointsBadges:
• Oracle newbie looking for basic backup and restore
Hello. My background is in SQL Server, but am currently working with Oracle 9.2 I would like to do a simple backup and possible restore of an Oracle DB. It is approximately 9gb. Thanks for any information for an Oracle newbie.
MILLERJ620 pointsBadges:
• BACKUP & RECOVERY for Oracle 9i
How can i take a backup of my database through OEM ? PLZ reply ASAP
NehaArya55 pointsBadges:
• Turning off archive log and enabling back archive logs, implication on RMAN backup
As a part of application upgrade we temporary turned off archiving and swithed on post upgrade. My intention is to full level 0 rman backup. Do i need to recreate dbid for this incarnation ?
DBA695 pointsBadges:
• What are the know issues with Oracle Flash back recovery area?
What are the know issues with Oracle Flash back recovery area?
dtailor5 pointsBadges:
• automate Oracle database backup on Windows 2000 server
Hello, I have to make a cold backup of our test database. The database is oracle 8.1.7 on a Windows 2000 server. I have made bat files to do this and have scheduled them in the Windows scheduled tasks application. This works fine. I check to see if my jobs have run successfully by looking the the...
Mariane10 pointsBadges:
• autobackup
How do you enable the autobackup for the controlfile using RMAN
Narmada5 pointsBadges:
• Rman Backup
what's the steps to take backup through RMAN and is it required RMAN Repository to backup?
SatishJain65 pointsBadges:
• Best backup procedure for Oracle E-Business Suite?
We are using Oracle E-Business Suite R.12. Database and applications are running in two different nodes under hp-ux in NoArchivelog mode. In this scenario, a backup procedure is to be created. Can you suggest to me the steps involved in taking backup of both database and applications node, please?
OracleATE190 pointsBadges:
• Restoring offline backup
How to apply offline redo log files to an off line backup which earlier to the offline redo log backup and recover system at less loss of data
17383110 pointsBadges:
• how to come up with a backup and restore startegy for application developed on portal
we have an application that has been developed on oracle APP server 8i portal(forms and reports),Win2003 server(OS) is the a way I can create a backup plan and restore plan for the system which steps should i follow o ensure the successfull backed-up system thank in advance
Tokina5 pointsBadges:
Forgot Password
No problem! Submit your e-mail address below. We'll send you an e-mail containing your password.
Your password has been sent to:
To follow this tag...
There was an error processing your information. Please try again later.
REGISTER or login:
Forgot Password?
By submitting you agree to receive email from TechTarget and its partners. If you reside outside of the United States, you consent to having your personal data transferred to and processed in the United States. Privacy
Thanks! We'll email you when relevant content is added and updated.
Following
|
__label__pos
| 0.806611 |
快速幂
发布时间：2017-5-26 0:11:00 编辑：www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"快速幂"，主要涉及到快速幂方面的内容，对于快速幂感兴趣的同学可以参考一下。
快速幂顾名思义，就是快速算某个数的多少次幂。其时间复杂度为 O(log₂N)， 与朴素的O(N)相比效率有了极大的提高。 求a的b次方: 把b转换成二进制数,该二进制数第i位的权为 例如 11的二进制是1011 11 = 2³×1 + 2²×0 + 2¹×1 + 2º×1 因此，将a¹¹转化为 ，也就是算的值 快速幂可以用位运算这个强大的工具实现： b and 1 //取b的二进制最末位 b shr 1 //就是去掉b的二进制最末位 有了这个强大的工具，快速幂就好实现了！ var a,b,n:int64; function f(a,b,n:int64):int64; var t,y:int64; begin t:=1;y:=a; while b<>0 do begin if (b and 1)=1 then t:=t*y mod n; y:=y*y mod n; { 这里用了一个很强大的技巧,y*y即求出了 a^(2^(i-1)) 不知道这是什么的看原理 } b:=b shr 1; {去掉已经处理过的一位} end; exit(t); end; begin read(a,b,n); {n是模} writeln(f(a,b,n)); end. 常规求幂int pow1( int a, int b ) { int r = 1; while( b-- ) r *= a; return r; } 二分求幂（一般） int pow2( int a, int b ) { int r = 1, base = a; while( b != 0 ) { if( b % 2 ) r *= base; base *= base; b /= 2; } return r; } 快速求幂（位操作） int pow3( int a, int b ) { int r = 1, base = a; while( b != 0 ) { if( b & 1 ) r *= base; base *= base; b >>= 1; } return r; } 快速求幂（更高效率的位运算法） int pow4(int x, int n) { int result; if (n == 0) return 1; else { while ((n & 1) == 0) { n >>= 1; x *= x; } } result = x; n >>= 1; while (n != 0) { x *= x; if ((n & 1) != 0) result *= x; n >>= 1; } return result; }
上一篇:POJ 2186 Popular Cows / 强连通分量
下一篇:电脑访问手机站跳转至电脑站代码
相关文章
关键词： 快速幂
相关评论
本站评论功能暂时取消，后续此功能例行通知。
一、不得利用本站危害国家安全、泄露国家秘密，不得侵犯国家社会集体的和公民的合法权益，不得利用本站制作、复制和传播不法有害信息！
二、互相尊重，对自己的言论和行为负责。
|
__label__pos
| 0.98859 |
math
there are 80 students in math club. For every 5 girls, there are 3 boys. How many girls & boys in club.
1. 👍 0
2. 👎 0
3. 👁 121
1. Let x equal the number of girls.
Cross multiply and solve for x.
5/8 = x/80
8x = 400
x = 50
2. 5+3=8
50+30=80
If for every 5 girls there are 3 boys, then for 50 girls there are 30 boys and 50+30=80 students in math club.
1. 👍 0
2. 👎 0
Respond to this Question
First Name
Your Response
Similar Questions
1. English
Which of the following sentences demonstrates proper subject verb agreement? A. The boy or the girls come to school late B. The boys and girl visits my house C. The boys or the girls sing in the choir D. The boys and girl in our
asked by Sean on February 24, 2018
2. maths
In a graduating class with the same number of boys and girls, 1/8 of the girls and 5/6 of the boys are honor students. What part of the class consists of boys who are not honor students
asked by athaulla on July 27, 2016
3. Math
There are 72 boys and 90 girls on a math team. For the next competition, Mr Johnson would like to arrange all the students in equal rows with only girls and only boys in each row. What is the greatest number of students that can
asked by Matt on September 9, 2016
4. algebra
A math class has 3 girls and 7 boys in the seventh grade and 2 girls and 2 boys in the eighth grade. The teacher randomly selects a seventh grader and an eighth grader from the class for a competition. What is the probability that
asked by Anneasha on June 16, 2018
5. math
3/4 of the students in a school were girls and the rest were boys. 2/3 of the girls and 1/2 of the boys attended the school carnival. Find the total number of students in the school if 330 students did not attend the carnival.
asked by Nai on October 29, 2012
1. math
There were 20% more boys than girls in a swimming club. After 50 girls left, there were twice as many boys as girls in the club. How many boys were there in the club?
asked by jane on November 30, 2012
2. math
At the beginning of the year, 40% of the students in the Art Club were boys. In the middle of the year, 25% of the girls left but 8 more boys joined the Art Club. The number of members became 42. Find the total number of Art Club
asked by lillyyy on August 7, 2018
3. maths
There 168 students in a school. There are twice as many girls as there are boys. a) Calculate the number of girls in the school. b) the students are to be divided into seven classes so that each class has the same number of girls
asked by indira on April 18, 2017
4. Math
There are 12 girls and 9 boys in Mrs. Johnson's classroom. She said that if she randomly selects one student from her classroom the probability that it is a boy is 3/4. Which mistake did Mrs. Johnson make? A. She divided the
asked by Anne on March 20, 2013
5. math
ok this is in my practice book. there are 33 students in the chess club. there are five more boys than girls in the club. write and solve a system of equations to find the number of boys and girls in the chess club?
asked by ariel on December 6, 2011
6. math
2 students are chosen at random from a group of 120 students that has 60 boys and 60 girls. What is the probability that the students are either both boys or both girls
asked by A on January 20, 2015
You can view more similar questions or ask a new question.
|
__label__pos
| 0.902649 |
configure: add endian check
[fio.git] / Makefile
1 DEBUGFLAGS = -D_FORTIFY_SOURCE=2 -DFIO_INC_DEBUG
2 CPPFLAGS= -D_GNU_SOURCE -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 \
3 $(DEBUGFLAGS)
4 OPTFLAGS= -O3 -g -ffast-math $(EXTFLAGS)
5 CFLAGS = -std=gnu99 -Wwrite-strings -Wall $(OPTFLAGS)
6 LIBS = -lm $(EXTLIBS)
7 PROGS = fio
8 SCRIPTS = fio_generate_plots
9 UNAME := $(shell uname)
10
11 ifneq ($(wildcard config-host.mak),)
12 all:
13 include config-host.mak
14 config-host-mak: configure
15 @echo $@ is out-of-date, running configure
16 @sed -n "/.*Configured with/s/[^:]*: //p" $@ | sh
17 else
18 config-host.mak:
19 @echo "Running configure for you..."
20 @./configure
21 all:
22 include config-host.mak
23 endif
24
25 SOURCE := gettime.c fio.c ioengines.c init.c stat.c log.c time.c filesetup.c \
26 eta.c verify.c memory.c io_u.c parse.c mutex.c options.c \
27 rbtree.c smalloc.c filehash.c profile.c debug.c lib/rand.c \
28 lib/num2str.c lib/ieee754.c $(wildcard crc/*.c) engines/cpu.c \
29 engines/mmap.c engines/sync.c engines/null.c engines/net.c \
30 memalign.c server.c client.c iolog.c backend.c libfio.c flow.c \
31 json.c lib/zipf.c lib/axmap.c lib/lfsr.c gettime-thread.c \
32 helpers.c lib/flist_sort.c lib/hweight.c
33
34 ifdef CONFIG_64BIT_LLP64
35 CFLAGS += -DBITS_PER_LONG=32
36 endif
37 ifdef CONFIG_64BIT
38 CFLAGS += -DBITS_PER_LONG=64
39 endif
40 ifdef CONFIG_32BIT
41 CFLAGS += -DBITS_PER_LONG=32
42 endif
43 ifdef CONFIG_BIG_ENDIAN
44 CFLAGS += -DCONFIG_BIG_ENDIAN
45 endif
46 ifdef CONFIG_LITTLE_ENDIAN
47 CFLAGS += -DCONFIG_LITTLE_ENDIAN
48 endif
49 ifdef CONFIG_LIBAIO
50 CFLAGS += -DCONFIG_LIBAIO
51 SOURCE += engines/libaio.c
52 endif
53 ifdef CONFIG_RDMA
54 CFLAGS += -DCONFIG_RDMA
55 SOURCE += engines/rdma.c
56 endif
57 ifdef CONFIG_POSIXAIO
58 CFLAGS += -DCONFIG_POSIXAIO
59 SOURCE += engines/posixaio.c
60 endif
61 ifdef CONFIG_LINUX_FALLOCATE
62 SOURCE += engines/falloc.c
63 endif
64 ifdef CONFIG_LINUX_EXT4_MOVE_EXTENT
65 SOURCE += engines/e4defrag.c
66 endif
67 ifdef CONFIG_LINUX_SPLICE
68 CFLAGS += -DCONFIG_LINUX_SPLICE
69 SOURCE += engines/splice.c
70 endif
71 ifdef CONFIG_GUASI
72 CFLAGS += -DCONFIG_GUASI
73 SOURCE += engines/guasi.c
74 endif
75 ifdef CONFIG_FUSION_AW
76 CFLAGS += -DCONFIG_FUSION_AW
77 SOURCE += engines/fusion-aw.c
78 endif
79 ifdef CONFIG_SOLARISAIO
80 CFLAGS += -DCONFIG_SOLARISAIO
81 SOURCE += engines/solarisaio.c
82 endif
83
84 ifndef CONFIG_STRSEP
85 CFLAGS += -DCONFIG_STRSEP
86 SOURCE += lib/strsep.c
87 endif
88 ifndef CONFIG_GETOPT_LONG_ONLY
89 CFLAGS += -DCONFIG_GETOPT_LONG_ONLY
90 SOURCE += lib/getopt_long.c
91 endif
92
93 ifndef CONFIG_INET_ATON
94 CFLAGS += -DCONFIG_INET_ATON
95 SOURCE += lib/inet_aton.c
96 endif
97 ifdef CONFIG_CLOCK_GETTIME
98 CFLAGS += -DCONFIG_CLOCK_GETTIME
99 endif
100 ifdef CONFIG_POSIXAIO_FSYNC
101 CFLAGS += -DCONFIG_POSIXAIO_FSYNC
102 endif
103 ifdef CONFIG_FADVISE
104 CFLAGS += -DCONFIG_FADVISE
105 endif
106 ifdef CONFIG_CLOCK_MONOTONIC
107 CFLAGS += -DCONFIG_CLOCK_MONOTONIC
108 endif
109 ifdef CONFIG_CLOCK_MONOTONIC_PRECISE
110 CFLAGS += -DCONFIG_CLOCK_MONOTONIC_PRECISE
111 endif
112 ifdef CONFIG_GETTIMEOFDAY
113 CFLAGS += -DCONFIG_GETTIMEOFDAY
114 endif
115 ifdef CONFIG_SOCKLEN_T
116 CFLAGS += -DCONFIG_SOCKLEN_T
117 endif
118 ifdef CONFIG_SFAA
119 CFLAGS += -DCONFIG_SFAA
120 endif
121 ifdef CONFIG_FDATASYNC
122 CFLAGS += -DCONFIG_FDATASYNC
123 endif
124 ifdef CONFIG_3ARG_AFFINITY
125 CFLAGS += -DCONFIG_3ARG_AFFINITY
126 endif
127 ifdef CONFIG_2ARG_AFFINITY
128 CFLAGS += -DCONFIG_2ARG_AFFINITY
129 endif
130 ifdef CONFIG_SYNC_FILE_RANGE
131 CFLAGS += -DCONFIG_SYNC_FILE_RANGE
132 endif
133 ifdef CONFIG_LIBNUMA
134 CFLAGS += -DCONFIG_LIBNUMA
135 endif
136 ifdef CONFIG_TLS_THREAD
137 CFLAGS += -DCONFIG_TLS_THREAD
138 endif
139 ifdef CONFIG_POSIX_FALLOCATE
140 CFLAGS += -DCONFIG_POSIX_FALLOCATE
141 endif
142 ifdef CONFIG_LINUX_FALLOCATE
143 CFLAGS += -DCONFIG_LINUX_FALLOCATE
144 endif
145
146 ifeq ($(UNAME), Linux)
147 SOURCE += diskutil.c fifo.c blktrace.c cgroup.c trim.c engines/sg.c \
148 engines/binject.c profiles/tiobench.c
149 LIBS += -lpthread -ldl
150 LDFLAGS += -rdynamic
151 endif
152 ifeq ($(UNAME), Android)
153 SOURCE += diskutil.c fifo.c blktrace.c trim.c profiles/tiobench.c
154 LIBS += -ldl
155 LDFLAGS += -rdynamic
156 CPPFLAGS += -DFIO_NO_HAVE_SHM_H
157 endif
158 ifeq ($(UNAME), SunOS)
159 LIBS += -lpthread -ldl -laio -lrt -lnsl -lsocket
160 CPPFLAGS += -D__EXTENSIONS__
161 endif
162 ifeq ($(UNAME), FreeBSD)
163 LIBS += -lpthread -lrt
164 LDFLAGS += -rdynamic
165 endif
166 ifeq ($(UNAME), NetBSD)
167 LIBS += -lpthread -lrt
168 LDFLAGS += -rdynamic
169 endif
170 ifeq ($(UNAME), AIX)
171 LIBS += -lpthread -ldl -lrt
172 CPPFLAGS += -D_LARGE_FILES -D__ppc__
173 LDFLAGS += -L/opt/freeware/lib -Wl,-blibpath:/opt/freeware/lib:/usr/lib:/lib -Wl,-bmaxdata:0x80000000
174 endif
175 ifeq ($(UNAME), HP-UX)
176 LIBS += -lpthread -ldl -lrt
177 CFLAGS += -D_LARGEFILE64_SOURCE -D_XOPEN_SOURCE_EXTENDED
178 endif
179 ifeq ($(UNAME), Darwin)
180 LIBS += -lpthread -ldl
181 endif
182 ifneq (,$(findstring CYGWIN,$(UNAME)))
183 SOURCE := $(filter-out engines/mmap.c,$(SOURCE))
184 SOURCE += engines/windowsaio.c os/windows/posix.c
185 LIBS += -lpthread -lpsapi -lws2_32
186 CFLAGS += -DPSAPI_VERSION=1 -Ios/windows/posix/include -Wno-format
187 endif
188
189 OBJS = $(SOURCE:.c=.o)
190
191 T_SMALLOC_OBJS = t/stest.o
192 T_SMALLOC_OBJS += gettime.o mutex.o smalloc.o t/log.o
193 T_SMALLOC_PROGS = t/stest
194
195 T_IEEE_OBJS = t/ieee754.o
196 T_IEEE_OBJS += lib/ieee754.o
197 T_IEEE_PROGS = t/ieee754
198
199 T_ZIPF_OBS = t/genzipf.o
200 T_ZIPF_OBJS += t/log.o lib/ieee754.o lib/rand.o lib/zipf.o t/genzipf.o
201 T_ZIPF_PROGS = t/genzipf
202
203 T_AXMAP_OBJS = t/axmap.o
204 T_AXMAP_OBJS += lib/lfsr.o lib/axmap.o
205 T_AXMAP_PROGS = t/axmap
206
207 T_OBJS = $(T_SMALLOC_OBJS)
208 T_OBJS += $(T_IEEE_OBJS)
209 T_OBJS += $(T_ZIPF_OBJS)
210 T_OBJS += $(T_AXMAP_OBJS)
211
212 T_PROGS = $(T_SMALLOC_PROGS)
213 T_PROGS += $(T_IEEE_PROGS)
214 T_PROGS += $(T_ZIPF_PROGS)
215 T_PROGS += $(T_AXMAP_PROGS)
216
217 ifneq ($(findstring $(MAKEFLAGS),s),s)
218 ifndef V
219 QUIET_CC = @echo ' ' CC $@;
220 QUIET_DEP = @echo ' ' DEP $@;
221 endif
222 endif
223
224 INSTALL = install
225 prefix = /usr/local
226 bindir = $(prefix)/bin
227
228 ifeq ($(UNAME), Darwin)
229 mandir = /usr/share/man
230 else
231 mandir = $(prefix)/man
232 endif
233
234 all: .depend $(PROGS) $(SCRIPTS) FORCE
235
236 .PHONY: all install clean
237 .PHONY: FORCE cscope
238
239 FIO-VERSION-FILE: FORCE
240 @$(SHELL) ./FIO-VERSION-GEN
241 -include FIO-VERSION-FILE
242
243 CFLAGS += -DFIO_VERSION='"$(FIO_VERSION)"'
244
245 .c.o: .depend FORCE
246 $(QUIET_CC)$(CC) -o $@ -c $(CFLAGS) $(CPPFLAGS) $<
247
248 init.o: FIO-VERSION-FILE
249 $(QUIET_CC)$(CC) -o init.o -c $(CFLAGS) $(CPPFLAGS) -c init.c
250
251 t/stest: $(T_SMALLOC_OBJS)
252 $(QUIET_CC)$(CC) $(LDFLAGS) $(CFLAGS) -o $@ $(T_SMALLOC_OBJS) $(LIBS) $(LDFLAGS)
253
254 t/ieee754: $(T_IEEE_OBJS)
255 $(QUIET_CC)$(CC) $(LDFLAGS) $(CFLAGS) -o $@ $(T_IEEE_OBJS) $(LIBS) $(LDFLAGS)
256
257 t/genzipf: $(T_ZIPF_OBJS)
258 $(QUIET_CC)$(CC) $(LDFLAGS) $(CFLAGS) -o $@ $(T_ZIPF_OBJS) $(LIBS) $(LDFLAGS)
259
260 t/axmap: $(T_AXMAP_OBJS)
261 $(QUIET_CC)$(CC) $(LDFLAGS) $(CFLAGS) -o $@ $(T_AXMAP_OBJS) $(LIBS) $(LDFLAGS)
262
263 fio: $(OBJS)
264 $(QUIET_CC)$(CC) $(LDFLAGS) $(CFLAGS) -o $@ $(OBJS) $(LIBS) $(LDFLAGS)
265
266 .depend: $(SOURCE)
267 $(QUIET_DEP)$(CC) -MM $(CFLAGS) $(CPPFLAGS) $(SOURCE) 1> .depend
268
269 $(PROGS): .depend
270
271 clean: FORCE
272 -rm -f .depend $(OBJS) $(T_OBJS) $(PROGS) $(T_PROGS) core.* core FIO-VERSION-FILE config-host.mak config-host.ld cscope.out
273
274 cscope:
275 @cscope -b -R
276
277 install: $(PROGS) $(SCRIPTS) FORCE
278 $(INSTALL) -m 755 -d $(DESTDIR)$(bindir)
279 $(INSTALL) $(PROGS) $(SCRIPTS) $(DESTDIR)$(bindir)
280 $(INSTALL) -m 755 -d $(DESTDIR)$(mandir)/man1
281 $(INSTALL) -m 644 fio.1 $(DESTDIR)$(mandir)/man1
282 $(INSTALL) -m 644 fio_generate_plots.1 $(DESTDIR)$(mandir)/man1
283
284 ifneq ($(wildcard .depend),)
285 include .depend
286 endif
|
__label__pos
| 0.755597 |
ggui ggui - 7 months ago 38
C# Question
Regex to get first 6 and last 4 characters of a string
I would like to use regex instead of string.replace() to get the first 6 chars of a string and the last 4 chars of the same string and substitute it with another character:
&
for example. The string is always with 16 chars. Im doing some research but i never worked with regex before. Thanks
Answer
If you prefer to use regular expression, you could use the following. The dot . will match any character except a newline sequence, so you can specify {n} to match exactly n times and use beginning/end of string anchors.
String r = Regex.Replace("123456foobar7890", @"^.{6}|.{4}$",
m => new string('&', m.ToString().Length));
Console.WriteLine(r); //=> "&&&&&&foobar&&&&"
If you want to invert the logic, replacing the middle portion of your string you can use Positive Lookbehind.
String r = Regex.Replace("123456foobar7890", @"(?<=^.{6}).{6}",
m => new string('&', m.ToString().Length));
Console.WriteLine(r); //=> "123456&&&&&&7890"
|
__label__pos
| 0.501593 |
Arrow pointing right
Connect Mysql to Shopify like Magic
How to Use Magical to Transfer Data from Mysql to Shopify
Install Magical
Connect your apps with ease
Transfer Data from Mysql to Shopify: A Step-by-Step Guide
With Magical, you can transfer data from Mysql to Shopify in seconds – no complex integrations or code required. In this post, we'll discuss what Magical is, how to install it, and how to use Magical to transfer data from Mysql to Shopify, helping you streamline your e-commerce operations and optimize your data management processes.
Get Magical for Free
More Mysql integrations with Magical
What Mysql data can you transfer
Magical enables you to transfer a wide array of data from Mysql to Shopify. Here are some examples of the information you can extract:
Database Name
Table Name
Column Name
Data Entry
And move more types of information by creating your own custom labels.
How to Transfer data from Mysql to Shopify using Magical?
Now that you have the Magical Chrome extension installed, let's discuss how to transfer data from Mysql to Shopify for more efficient e-commerce operations. Follow these steps:
1. Sign in to your Mysql account and open the database containing the data you want to transfer, such as product information and inventory details.
2. In Mysql, label the information you want to transfer with Magical, like Product Name, Price, or Inventory Count.
3. Sign in to your Shopify account and open the product listing where you want to add the Mysql data.
4. Type "//" in an empty field and select the information you want to transfer from Mysql such as Product Name, Price, etc.
5. The next time you fill out a product listing, Magical will automatically transfer all the fields into the form with one click.
About Mysql and Shopify
Efficient and accurate data management is crucial to maintaining a successful e-commerce business. Mysql is a powerful database management system and Shopify is a robust e-commerce platform. Combining the capabilities of these two platforms can significantly enhance your e-commerce operations. By leveraging Magical, you can easily move information from Mysql to Shopify, allowing you to focus on growing your business and improving customer satisfaction.
Other ways to connect Mysql and Shopify
Using Zapier
Zapier provides a seamless connection between Mysql and Shopify, allowing for automatic data transfer between the two platforms without the need for coding. This integration offers a variety of triggers and actions, enabling you to automate workflows and save time
Using an API
An additional approach to integrate Mysql and Shopify is by directly utilizing their APIs. By integrating both APIs, you empower your e-commerce operations with real-time product insights, fostering improved data management and a superior customer experience. To employ this method, refer to their respective API documentation.
Have an integration in mind?
We can connect ANY app. We'll show you how in 15 mins, and if not, we'll give you $100 for your time.
Book a time
Common questions
WHAT IS MAGICAL
Magical is a chrome extension that allows users to extract information from any website without complex integrations or APIs. You can run it on Mysql and transfer data directly to Shopify. The extension is designed to simplify the process of data collection by automating the extraction of information from Mysql. Magical is free, easy to use, and it can save you a lot of time and effort.
HOW TO INSTALL MAGICAL
To start using GetMagical, you need to install the chrome extension. Click the button below to install, or follow the steps to download directly from the Chrome web store.
Ready to save time with Magical?
Add to Chrome – it's free
Chrome Store · 4.6 stars · 2,620+ reviews
|
__label__pos
| 0.749744 |
array: assigning tokens
• my first post, I love construct already but have got to find my way :P
My first problem as well ;)
================= situation
global text shape_all = "shape_red:shape_blue:shape_purple:shape_yellow:shape_green:shape_orange"
global text shape_1 = "empty"
global text shape_2 = "empty"
global text shape_3 = "empty"
global text shape_select = "empty"
set shape_select to (tokenat(shape_all, int( random( tokencount(shape_all, ":"))), ":"))
================= problem
I can't find a solution for
a. randomly set shape_1 _2 or _3 to shape_select
b. set the remaining two shape_x to something different than shape_select and different from each other (using the shape_all list)
I was used to be working with Director Shockwave Lingo
Have a look at chato.nl/ipad and hit the blue balloon (second screen) to see the progress
Hope someone can help me on this one! (arrays/lists are not easy in C2 for me yet) TNx!
• You can either,
a:set a global to"red,blue,purple,yellow,orange", then pick a token in that string with getToken(int(random(5)),",").... comma is the delimiter.
B: Use the system expression choose, like choose(red,blue,purple,yellow,orange)
• Dont use shape_1, shape_2 and shape_3 but an array
Else you will have to rewrite the whole thing for each
global text shape_all = "shape_red:shape_blue:shape_purple:shape_yellow:shape_green:shape_orange"
global shapeCount = 3 // number of shape you want
+System: on start of layout
-> Array: set size to shapeCount,1,1
+ Array: foreach X elements
-> Array: set value at (self.CurX) to "empty"
+On What you want
Local text tmp = "" // copy to keep the original intact
+repeat shapeCount times
-> System: set tmp to shape_all
-> Array: set value at loopindex to (tokenat(tmp,floor(random(tokencount(tmp,":"))),":"))
-> System: set tmp to replace(tmp,Array.At(loopindex),"")
-> System: set tmp to replace(tmp,"::",":")
-> System: set tmp to (left(tmp,0,1) = ",") ? right(tmp,len(tmp)-1) : tmp
-> System: set tmp to (right(tmp,len(tmp-1),1) = ",") ? left(tmp,len(tmp)-1) : tmp
The four last actions are used to delete the token from the tmp string. This way you don't pick it again.
-> System: set tmp to replace(tmp,Array.At(loopindex),"")
Delete the token leaving the colons
1:2:3 -> ":2:3" or "1::3" or "1:2:"
-> System: set tmp to replace(tmp,"::",":")
Check if there's two colons side to side and delete one
1:2:3 -> ":2:3" or "1:3" or "1:2:"
-> System: set tmp to (left(tmp,0,1) = ",") ? right(tmp,len(tmp)-1) : tmp
Check if the first character is a colon and delete it
1:2:3 -> "2:3" or "1:3" or "1:2:"
-> System: set tmp to (right(tmp,len(tmp-1),1) = ",") ? left(tmp,len(tmp)-1) : tmp
Check if there's a colon on the last character is a colon and delete it
1:2:3 -> "2:3" or "1:3" or "1:2"
• Try Construct 3
Develop games in your browser. Powerful, performant & highly capable.
Try Now Construct 3 users don't see these ads
• Tnx, I've managed to make a workaround. Just one thing to fix:
I put the names of the three globals in one global text, to randomly get one out of it.
But because this is a string, it won't give its value when using this name.
=================== begin
global text shape_nr = "shape1:shape2:shape3"
set shape_select to (tokenat(shape_nr, int( random( tokencount(shape_nr, ":"))), ":")) -> "shape1" "shape2" "shape3"
Set animation to shape_select.AnimationName -> "shape1" instead of the value inside global shape1
========================
probably something simple, but I'm unable to find anything that I can use; global(tokenat(......)) -> syntax error
tnx for any hints and tips!
• object X -> set animation to sprite(shape_select_tmp).AnimationName
ps. shape_select_tmp = "shape1"
No errors, but nothing happens as well :P
• Read and apply Yann's solution.
For the problem evoked in the very first post, this is the best solution.
• I did use Yann's solution partly, but I'm getting errors on
System: set tmp to (right(tmp,len(tmp-1),1) = ",") ? left(tmp,len(tmp)-1) : tmp
--> C2 indicates there can only be 2 conditions instead of 3? But 2 doesn't work
Also the missing part in Yan's solution is that I have to randomly set shape4.animationName to shape1, shape2 or shape3's animationName.
And for this last part Im looking for a solution, cause when I randomly get the name "shape1", "shape2" or "shape3", I'm unable to get the value of a global with this string?
shape4 -> set animation to "AnimationName of sprite_randomly_picked" ?
Tnx for any suggestions to solve this last issue.
• Fixed! :D
Yann: tnx for pointing out the directions :P
Jump to:
Active Users
There are 1 visitors browsing this topic (0 users and 1 guests)
|
__label__pos
| 0.966242 |
You are viewing ahefner
Previous Entry
GIMP-Python script for dithering pixel art
oscar
Here's a Python script for GIMP that takes an indexed color image and replaces every other color with a checkerboard dithering of its neighbors. The intended use was to create grayscale 4 color images with this style of dithering, by first creating a hand-tuned 7 color image, then applying the script. After it runs, you can delete the in-between tones from the palette. It should work for any odd number of colors, n>=3.
Having scripted Gimp in both Python and Scheme, I definitely found Python more pleasant.
This is the kind of silly thing I used to do, to pass the time:
#!/usr/bin/env python
# Pixel art dither script for GIMP
# Author: [email protected]
import math
from gimpfu import *
from array import array
def python_8bit_dither(img, srclayer):
try:
pdb.gimp_message("Running...")
pdb.gimp_image_undo_group_start(img)
layer = srclayer.copy()
img.add_layer(layer, 0)
width = layer.width
height = layer.height
rgn = layer.get_pixel_rgn(0, 0, width, height, TRUE, FALSE)
src_pixels = array("B", rgn[0:width, 0:height])
# cmbytes, cmdata = pdb.gimp_image_get_colormap(img)
# colors = cmbytes / 3
# pdb.gimp_message(str(cmdata))
i = 0
ph = 0
for y in range(height):
ph = y & 1
for x in range(width):
c = src_pixels[i]
if (c & 1):
c = c-1 if (ph == 0) else c+1
src_pixels[i] = c
ph = ph ^ 1
i = i + 1
rgn[0:width, 0:height] = src_pixels.tostring()
layer.flush()
# layer.merge_shadow()
layer.update(0,0,width,height)
pdb.gimp_image_undo_group_end(img)
pdb.gimp_message("Finished!")
except Exception, err:
pdb.gimp_message("ERR: " + str(err))
pdb.gimp_image_undo_group_end(img)
register(
"python_fu_dither",
"Dither odd colors in an indexed-color image",
"Dither odd colors in an indexed-color image",
"Andy Hefner",
"Andy Hefner",
"2010",
"/Filters/Mine/8-Bit Dither Helper",
"INDEXED",
[],
[],
python_8bit_dither)
main()
Comments
( 2 comments )
Tyler Barnes
Jun. 13th, 2013 09:18 pm (UTC)
I'm not really a GIMP user I use PS, but have found no other type of scripts like this one that do what I need them to do. What file extension do I save this file as, where should I save/install it, and how do I run it in GIMP? Thank you for this script and thank you for your time.
ahefner
Sep. 3rd, 2013 01:18 am (UTC)
Here's a link to an updated version, as the old one doesn't work on slightly newer GIMP versions for some reason: https://raw.github.com/ahefner/asm6502/master/hacks/dither1.py
Just save it as dither1.py to your Gimp plug-ins folder. On my machine that's /home/hefner/.gimp-2.6/plug-ins/ but that depends on your OS. When you restart Gimp it should appear in the Filters menu under a folder named "Hefner". It will only be enabled for Indexed-Color images.
Obviously I've only tried this with GIMP 2.6, which is still out of date. Hopefully newer versions don't somehow break it again.
( 2 comments )
|
__label__pos
| 0.5848 |
Follow Our FB Page << CircleMedia.in >> for Daily Laughter. We Post Funny, Viral, Comedy Videos, Memes, Vines...
Company Name Starts with ...
# A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
FCG Interview Questions
Questions Answers Views Company eMail
what is the difference between synchronization pt and wait statement. what are the advanatages and disadv..of context sensitive and analog recording
4 7642
Post New FCG Interview Questions
Un-Answered Questions
What is an advantage of a database?
241
Digital marketing is better than traditional marketing, can you please explain the statement?
63
Can we load the datatable directly using sql query ?
302
Which is better jboss or tomcat?
208
Who developed the zend framework?
72
What is quality assurance checklist?
1025
What are the steps to do the converting from lis to lo extraction.
241
Why do we use javascript in php?
274
What is the maximum row limit in excel 2010?
119
Explain about integration services of Microsoft SQL server?
308
Speedtronic system .
1143
Do you know what is kernel svm?
39
For performing heavy duty operations what is suitable di api or di server ?
295
What is button in html?
253
What is a dagger component?
210
|
__label__pos
| 1 |
Vulnerability Management Program Framework
Helping you identify, classify, remediate, and mitigate vulns—before attackers do
What is a vulnerability management program framework?
Massive breaches have caused many companies to pursue stronger, more proactive measures for managing vulnerabilities in their environments. Yet, as corporate infrastructures have become more complex—encompassing the cloud and spanning vast attack surfaces—businesses have found it more difficult to achieve complete visibility into the rapidly proliferating vulnerabilities across their ecosystems. Capitalizing on the opportunity, cybercriminals have learned how to exploit chains of weaknesses in systems, applications, and people.
Vulnerability management programs address today’s modern cybersecurity challenges by instituting a comprehensive and continuous process for identifying, classifying, remediating, and mitigating vulnerabilities before attackers can take advantage of them. At the heart of these vulnerability management programs is often a vulnerability scanner that automatically assesses and understands risk across an entire infrastructure, generating easy-to-understand reports that help businesses properly and rapidly prioritize the vulnerabilities they must remediate or mitigate.
The four steps of a vulnerability management program
A vulnerability scanner automates the vulnerability management process, typically breaking it down into the following four steps. It’s important to note that a good vulnerability management process should continually scan for vulnerabilities as they are introduced into the environment, as circumstances can quickly change.
1. Identifying vulnerabilities
The first and most essential step in any vulnerability process, of course, is to bring to light all of the vulnerabilities that may exist across your environment. A vulnerability scanner goes about this by scanning the full range of accessible systems that exist—from laptops, desktops, and servers on to databases, firewalls, switches, printers, and beyond.
From there, the vulnerability scanner identifies any open ports and services that are running on those systems, logging in to those systems and gathering detailed information where possible before correlating the information it obtains with known vulnerabilities. This insight can be used to create reports, metrics, and dashboards for a variety of audiences.
2. Evaluating vulnerabilities
Once you’ve identified all the vulnerabilities across your environment, you’ll need to evaluate them in order to appropriately deal with the risks they pose according to your organization’s cybersecurity risk management strategy. Different vulnerability management solutions use different risk ratings and scores for vulnerabilities, but one commonly referenced framework for new programs is the Common Vulnerability Scoring System (CVSS).
Vulnerability scores can help organizations determine how to prioritize the vulnerabilities they’ve discovered, it’s important to also consider other factors to form a complete understanding of the true risk posed by any given vulnerability. It’s also worth noting that vulnerability scanners can generate false positives in rare instances, thus underscoring the necessity of including other considerations in addition to risk scores at this stage of the process.
3. Treating vulnerabilities
After you’ve prioritized the vulnerabilities that you’ve found, it’s important to promptly treat them in collaboration with your original business or network stakeholders. Depending on the vulnerability in question, treatment usually proceeds according to one of the following three paths:
1. Remediation: Fully fixing or patching a vulnerability so that it cannot be exploited, which is usually the most preferable option whenever possible.
2. Mitigation. When remediation can’t be accomplished, an organization may choose the next best option of reducing the likelihood that a vulnerability will be exploited by implementing compensating controls. This solution should be temporary, buying time for an organization to eventually remediate the vulnerability.
3. Acceptance. If a vulnerability is deemed low-risk or the cost of remediating it is much greater than it would be if it were exploited, an organization may choose simply to take no action to fix the vulnerability.
When determining specific treatment strategies, it is best for an organization’s security team, system owners, and system administrators to come together and determine the right remediation approach—whether that’s issuing a software patch or refreshing a fleet of physical servers. Once remediation is considered complete, it’s wise to run another vulnerability scan to make sure that the vulnerability has, in fact, been effectively remediated or mitigated.
4. Reporting vulnerabilities
Improving the speed and accuracy with which you detect and treat vulnerabilities is essential to managing the risk that they represent, which is why many organizations continually assess the efficacy of their vulnerability management program. They can take advantage of the visual reporting capabilities found in vulnerability management solutions for this purpose. Armed with the insights needed, IT teams can identify which remediation techniques will help them fix the most vulnerabilities with the least amount of effort. Security teams, for their part, can use this reporting to monitor vulnerability trends over time and communicate their risk reduction progress to leadership.
Ideal solutions will include integrations with IT ticketing systems and patch management to accelerate the process of sharing information between teams. This helps customers make meaningful progress toward reducing their risk. Businesses can also use these assessments to fulfill their compliance and regulatory requirements.
Four tips for a better vulnerability management program
1. Conduct comprehensive scans. While many businesses once found it sufficient to scan servers and desktop computers on the enterprise network, today’s complex and rapidly evolving IT environment requires a comprehensive approach. Your vulnerability management program should provide visibility into your entire attack surface, including the cloud, and automatically detect devices as they connect to your network for the first time.
2. Continually assess your vulnerabilities. Infrastructures and applications can change on a daily and even hourly basis. For this reason, you must continually scan your environment to make sure that you identify new vulnerabilities as early as possible. Many vulnerability management solutions include endpoint agents and other integrations that can provide you with a real-time view of vulnerabilities across your environment.
3. Accelerate your processes. Introducing automation into the vulnerability management process is essential to properly managing the modern risks your business faces at scale. Human decisions play a critical role in every vulnerability management program, but automation can help streamline the repetitive work that is done before and following these key decision points.
4. Address weaknesses in people, too. Vulnerabilities are not limited to technology; they exist in the human element within an organization as well. Security teams must collaborate with IT operations and application development groups to more quickly identify and remediate vulnerabilities of all kinds. Meanwhile, user education and simulations can increase your organization’s resilience to phishing and other social-engineering attacks.
Businesses face growing risks as the attack surface continues to expand, increasing the number of vulnerabilities for hackers to exploit. Vulnerability management programs give companies a framework for managing these risks at scale, detecting vulnerabilities across the entire environment with greater speed. Meanwhile, analytics help organizations continually optimize the techniques they use for remediation.
With a strong vulnerability management program or managed vulnerability management (MVM) in place, businesses can better address the risks they face not only today but well into the future.
|
__label__pos
| 0.78859 |
paoloboni / spray-json-derived-codecs
Derived codecs for spray-json
Version Matrix
spray-json derived codecs
Build Status Latest version Scala Steward badge License
JsonFormat derivation for algebraic data types, inspired by Play Json Derived Codecs.
The derivation built with Scala 2.x is powered by shapeless, whereas the one built with Scala 3 is based on the new Type Class Derivation language API.
The derivation currently supports:
• sum types
• product types
• recursive types
• polymorphic types
This library is built with Sbt 1.5.2 or later, and its master branch is built with Scala 2.13.6 by default but also cross-builds for 3 and 2.12.
NOTE
Scala 2.11 is no longer supported. The latest version available for scala 2.11 is 2.2.2.
Installation
If you use sbt add the following dependency to your build file:
libraryDependencies += "io.github.paoloboni" %% "spray-json-derived-codecs" % "2.3.0"
Usage
For automatic derivation, add the following import:
import spray.json.derived.auto._
If you prefer to explicitly define your formats, then you can use semi-auto derivation:
import spray.json.derived.semiauto._
Examples
Product types
Auto derivation
import spray.json._
import spray.json.derived.auto._
import spray.json.DefaultJsonProtocol._
case class Cat(name: String, livesLeft: Int)
object Test extends App {
val oliver: Cat = Cat("Oliver", 7)
val encoded = oliver.toJson
assert(encoded == """{"livesLeft":7,"name":"Oliver"}""".parseJson)
assert(encoded.convertTo[Cat] == oliver)
}
Semi-auto derivation
import spray.json._
import spray.json.derived.semiauto._
import spray.json.DefaultJsonProtocol._
case class Cat(name: String, livesLeft: Int)
object Test extends App {
implicit val format: JsonFormat[Cat] = deriveFormat[Cat]
val oliver: Cat = Cat("Oliver", 7)
val encoded = oliver.toJson
assert(encoded == """{"livesLeft":7,"name":"Oliver"}""".parseJson)
assert(encoded.convertTo[Cat] == oliver)
}
Union types
Union types are encoded by using a discriminator field, which by default is type.
import spray.json._
import spray.json.derived.auto._
import spray.json.DefaultJsonProtocol._
sealed trait Pet
case class Cat(name: String, livesLeft: Int) extends Pet
case class Dog(name: String, bonesHidden: Int) extends Pet
object Test extends App {
val oliver: Pet = Cat("Oliver", 7)
val encodedOliver = oliver.toJson
assert(encodedOliver == """{"livesLeft":7,"name":"Oliver","type":"Cat"}""".parseJson)
assert(encodedOliver.convertTo[Pet] == oliver)
val albert: Pet = Dog("Albert", 3)
val encodedAlbert = albert.toJson
assert(encodedAlbert == """{"bonesHidden":3,"name":"Albert","type":"Dog"}""".parseJson)
assert(encodedAlbert.convertTo[Pet] == albert)
}
The discriminator can be customised by annotating the union type with the @Discriminator annotation:
import spray.json._
import spray.json.derived.auto._
import spray.json.DefaultJsonProtocol._
import spray.json.derived.Discriminator
@Discriminator("petType")
sealed trait Pet
case class Cat(name: String, livesLeft: Int) extends Pet
case class Dog(name: String, bonesHidden: Int) extends Pet
object Test extends App {
val oliver: Pet = Cat("Oliver", 7)
val encodedOliver = oliver.toJson
assert(encodedOliver == """{"livesLeft":7,"name":"Oliver","petType":"Cat"}""".parseJson)
assert(encodedOliver.convertTo[Pet] == oliver)
}
Recursive types
import spray.json._
import spray.json.derived.auto._
import spray.json.DefaultJsonProtocol._
sealed trait Tree
case class Leaf(s: String) extends Tree
case class Node(lhs: Tree, rhs: Tree) extends Tree
object Test extends App {
val obj: Tree = Node(Node(Leaf("1"), Leaf("2")), Leaf("3"))
val encoded = obj.toJson
val expectedJson =
"""{
| "lhs": {
| "lhs": {
| "s": "1",
| "type": "Leaf"
| },
| "rhs": {
| "s": "2",
| "type": "Leaf"
| },
| "type": "Node"
| },
| "rhs": {
| "s": "3",
| "type": "Leaf"
| },
| "type": "Node"
|}
|""".stripMargin
assert(encoded == expectedJson.parseJson)
assert(encoded.convertTo[Tree] == obj)
}
Polymorphic types
import spray.json._
import spray.json.derived.auto._
import spray.json.DefaultJsonProtocol._
case class Container[T](value: T)
object Test extends App {
val cString: Container[String] = Container("abc")
val cStringEncoded = cString.toJson
assert(cStringEncoded == """{"value":"abc"}""".parseJson)
assert(cStringEncoded.convertTo[Container[String]] == cString)
val cInt: Container[Int] = Container(123)
val cIntEncoded = cInt.toJson
assert(cIntEncoded == """{"value":123}""".parseJson)
assert(cIntEncoded.convertTo[Container[Int]] == cInt)
}
Undefined optional members
By default, undefined optional members are not rendered:
import spray.json._
import spray.json.derived.auto._
import spray.json.DefaultJsonProtocol._
case class Dog(toy: Option[String])
object Test extends App {
val aDog = Dog(toy = None)
val aDogEncoded = aDog.toJson
assert(aDogEncoded.compactPrint == "{}")
}
It's possible to render undefined optional members as null values by specifying an alternative configuration. Just specify the alternative configuration as implicit value and enable the renderNullOptions flag:
import spray.json._
import spray.json.derived.Configuration
import spray.json.derived.auto._
import spray.json.DefaultJsonProtocol._
case class Dog(toy: Option[String])
object Test extends App {
implicit val conf: Configuration = Configuration(renderNullOptions = true)
val aDog = Dog(toy = None)
val aDogEncoded = aDog.toJson
assert(aDogEncoded.compactPrint == """{"toy":null}""")
}
License
spray-json-derived-codecs is licensed under APL 2.0.
|
__label__pos
| 0.971878 |
What is SSD(Solid State Drive)
What is a Solid State Drive(SSD)|Definition, Types and Features of SSD
Introduction
A computer system’s storage is a crucial component. Data is stored using a variety of storage component types. The two most prevalent types of storage in a computer system are hard disc drives and solid-state drives. While SSDs have been released with some useful characteristics, HDDs are a well-known yet outdated technology for storing data. This article will teach you the meaning of solid-state drives, the different kinds of SSDs, and their characteristics, benefits, and drawbacks (SSD).
What is a Solid State Drive(SSD)?
Solid State Drive SSD
Solid-state drives, sometimes known as SSDs, are non-volatile storage devices that use solid-state flash memory to hold permanent data. Popular SSD types are flash drives. Solid State drives, as opposed to Hard Disc Drives, or HDDs, are mechanically free. A rotating hard disc drive, or HDD, uses magnetism to read and write data. Although it is an older and dependable technology, mechanical failures can occur. On the other hand, an SSD uses silicon to build its interconnected flash memory chips’ substrate for reading and writing data.
History of Solid-State Drive (SSD)
History of Solid State Drive SSD
In 1978, Storage Tech invented the first RAM-Based Version of SSDs(Solid State Drives) . Western Digital released SSDs based on Flash Memory in 1989. Since 1991, SSDs have undergone remarkable development, with sizes ranging from 20MB to 100TB and sequential read speeds rising from 49.3MB/s to 15GB/s. With access times falling from 0.5 ms to 0.045 ms for reads and 0.013 ms for writes, IOPS increased from 79 to 2.5 million. Prices also fell dramatically, from $50,000 to $0.10 per gigabyte. These advancements demonstrate how SSD technology has transformed, becoming a widely used and reasonably priced storage option in contemporary computing.
Different Types of Solid State Drives(SSDs)
The Different Types of SSDs are
• SATA
• NVMe
• PCIe Connector
• M.2 Connector
1-SATA Drives
Serial Advanced Technology Attachment (SATA) SSDs represent the first wave of consumer-grade solid-state drives. Leveraging the ubiquitous SATA interface, these drives seamlessly integrate into existing systems, offering a plug-and-play solution for upgrading from traditional Hard Disk Drives (HDDs). SATA SSDs provide a noticeable performance boost over their mechanical counterparts, with faster boot times, reduced application loading times, and improved overall system responsiveness.
2-NVMe Drives
A new era of storage performance is ushered in by Non-Volatile Memory Express (NVMe) SSDs. Developed from the foundation up to take advantage of the fast PCIe (Peripheral Component Interconnect Express) interface, NVMe SSDs offer significantly faster read and write rates than SATA-based drives. Enthusiasts, professionals, and content producers who need unwavering performance for jobs like data analysis, 3D rendering, and video editing love these drives.
3-PCIe Connector
The PCIe connector functions as the central support system for NVMe SSDs, allowing them to attain unmatched levels of performance. By utilising the extensive bandwidth provided by the PCIe interface, NVMe SSDs are capable of transmitting data at speeds that were previously inconceivable. This makes them highly suitable for tasks and applications that necessitate exceptionally rapid storage solutions.
4-M.2 Connector
The M.2 connector has become the widely accepted standard for small, high-speed storage solutions. The M.2 form factor is capable of supporting both SATA and NVMe SSDs, providing a combination of versatility and performance. This makes it suited for various applications, including ultrabooks, tiny PCs, high-end gaming rigs, and enterprise servers. The device’s compact size and minimal height make it well-suited for limited space scenarios, enabling manufacturers to create elegant and easily transportable gadgets without compromising storage capabilities.
What are SSD(Solid State Drive) form factors?
SSD form factors pertain to the specific physical dimensions and connector types employed in solid-state drives. The form factors of SSDs are essential in determining their compatibility and appropriateness for various devices and applications.
(1)-2.5-inch Form Factor
The 2.5-inch size factor is widely used for SSDs, particularly in desktop PCs and laptops. The SSDs are commonly enclosed in a shell made of metal or plastic, with a width of 2.5 inches and a length that varies depending on the model. The 2.5-inch form factor is preferred due to its compatibility with current drive bays and mounting solutions, facilitating a hassle-free conversion from a conventional HDD to an SSD without the need for extra hardware.
(2)-3.5-inch Form Factor
Although less prevalent than the 2.5-inch form factor, 3.5-inch SSDs are nonetheless utilised in specific applications, particularly in business storage systems and network-attached storage (NAS) devices. These solid-state drives (SSDs) have larger dimensions and greater mass compared to their 2.5-inch equivalents, rendering them less suited for installation in laptops and compact desktop PCs. Nevertheless, their increased dimensions enable them to have a higher storage capacity and improved thermal management, making them exceptionally suitable for data-intensive tasks that prioritise performance and dependability.
(3)-M.2 Form Factor
The M.2 form factor has become widely popular in recent years because to its small size and excellent performance. These solid-state drives (SSDs) are specifically intended for direct installation onto the motherboard or an expansion card utilising the M.2 socket. This eliminates the necessity of traditional drive bays and cords. M.2 SSDs are available in many dimensions, with the most prevalent widths being 22mm and lengths ranging from 42mm to 110mm, including 42mm, 60mm, 80mm, and 110mm. The adaptability of M.2 SSDs makes them well-suited for utilisation in ultrabooks, micro PCs, and other compact devices with restricted space.
What are the major features of SSDs?
SSDs boast several features that set them apart from traditional HDDs, including:
• Speed: SSDs offer significantly faster read and write speeds, resulting in snappier system performance and reduced loading times.
• Reliability: With no moving parts, SSDs are inherently more reliable and durable than HDDs, mitigating the risk of mechanical failure.
• Energy Efficiency: SSDs consume less power than HDDs, translating into longer battery life for laptops and lower electricity bills for data centers.
• Silent Operation: The absence of moving components renders SSDs virtually silent, making them ideal for noise-sensitive environments.
• Shock Resistance: SSDs are impervious to shock and vibration, making them ideal for mobile devices and rugged environments.
Difference Between SSD(Solid State Drive) and HDD(Hard Disk Drive)
The differences between SSDs and HDDs are vast, encompassing speed, reliability, form factor, and power consumption. While HDDs excel in capacity and cost per gigabyte, SSDs reign supreme in terms of performance and durability.
1-Speed
SSDs have substantially higher read and write rates in comparison to HDDs, leading to improved system performance and decreased latency. SSDs are well-suited for tasks including fast starting up the operating system, opening apps, and rapidly accessing huge files due to their performance advantage.
2-Reliability
Due to the absence of any mechanical components, solid-state drives (SSDs) are intrinsically more dependable and long-lasting compared to hard disc drives (HDDs). Common concerns encountered with HDDs include mechanical failures such as head crashes and motor failures, but SSDs are impervious to such problems. Furthermore, solid-state drives (SSDs) exhibit greater resistance to harm caused by impact and oscillation, rendering them well-suited for deployment in portable devices and challenging conditions.
3-Form Factor
SSDs are available in many form factors such as 2.5-inch, 3.5-inch, and M.2, while HDDs are mostly found in the 3.5-inch form factor. SSDs have a distinct physical design that enables its use in many devices and applications, such as laptops, desktop PCs, and tiny form factor computers.
4-Power Consumption
SSDs use less power than HDDs, which means that laptop batteries last longer and data centres pay less for energy. Because they use less energy, SSDs are a good choice for people who care about both speed and the environment.
SSD vs eMMC
When it comes to speed and durability, eMMC (Embedded MultiMediaCard) storage, which is popular in low-cost devices like smartphones and tablets, is not even close to SSDs. eMMC is a cheap way to store data on entry-level devices, but it doesn’t work as well or as reliably as SSDs.
1-Speed
SSDs provide substantially higher read and write rates in comparison to eMMC storage, leading to enhanced system performance and quicker data retrieval. The speed benefit is especially evident while carrying out operations such as launching applications, loading web pages, and transferring files.
2-Longevity
SSDs offer a greater longevity compared to eMMC storage due to its sturdier construction and higher endurance. eMMC storage is susceptible to deterioration over time, resulting in possible decline in performance and loss of data, but SSDs are engineered to endure extensive usage and frequent data retrieval without affecting dependability.
SSD vs. Hybrid Hard Drive
Hybrid hard drives include the advantages of both regular HDD storage and a tiny quantity of NAND flash memory. Although hybrid drives provide enhanced performance in comparison to conventional HDDs, they still do not match the speed and dependability of dedicated SSDs.
1-Performance
SSDs have considerably higher read and write rates in comparison to hybrid hard drives, leading to improved system performance and decreased latency. The speed advantage is especially evident while carrying out operations such as starting up the operating system, initiating applications, and swiftly accessing huge files.
2-Reliability
SSDs are intrinsically more dependable and long-lasting than hybrid hard drives due to their solid-state architecture and absence of mechanical components. Hybrid hard drives often have mechanical difficulties, such as head crashes and motor failures, while SSDs are not susceptible to these issues.
Why SSD Is Better than HDD
SSDs offer numerous benefits compared to HDDs, making them the favoured option for both discerning consumers and enterprises:
• Speed: SSDs deliver blazing-fast read and write speeds, resulting in snappier system performance and reduced latency.
• Reliability: With no moving parts to contend with, SSDs exhibit superior reliability and durability, minimizing the risk of data loss due to mechanical failure.
• Energy Efficiency: SSDs consume less power than HDDs, translating into lower electricity bills and extended battery life for portable devices.
• Silent Operation: The absence of spinning platters renders SSDs virtually silent, making them ideal for noise-sensitive environments.
When You Would Need to Use SSD(Solid State Drive)
SSDs are utilised in diverse domains such as business, internet hosting, gaming, and travelling, where speed, dependability, and efficiency are of utmost importance.
Business
When it comes to work, time is money. SSDs boost efficiency by cutting down on the time it takes to access data and load applications, letting workers do their jobs faster.
Website Hosting
Uptime and speed are very important to web hosts. SSD-based computers make sure that pages load instantly and users have a smooth experience, which makes customers happier and more likely to stick with your business.
Gaming
When gamers play, they expect everything to work smoothly and respond instantly. SSDs make it possible for games to start quickly and for levels to switch without any problems, which takes the gaming experience to a whole new level.
Traveling
Laptops and computers are popular ways for travellers to stay connected while they’re on the go. Solid-state drives (SSDs) make devices last longer and use less power, which makes them perfect for travelling.
Advantages and Disadvantages of SSDs
SSDs are faster, more reliable, use less energy, and run quietly than HDDs, but they are more expensive and can’t store as much data.
Advantages of SSDs
• Speed: SSDs offer unparalleled read and write speeds, resulting in snappier system performance and reduced loading times.
• Reliability: With no moving parts, SSDs are less susceptible to mechanical failure, ensuring data integrity and longevity.
• Energy Efficiency: SSDs consume less power than HDDs, prolonging battery life for laptops and reducing electricity bills for data centers.
• Silent Operation: The absence of spinning platters renders SSDs virtually silent, making them ideal for noise-sensitive environments.
Disadvantages of SSDs
• Cost: SSDs command a premium price compared to HDDs, making them less accessible to budget-conscious consumers.
• Capacity: While SSD capacities continue to increase, they still lag behind HDDs in terms of sheer storage space, limiting their appeal for users with extensive storage needs.
• Write Endurance: SSDs have a finite lifespan dictated by the number of write cycles they can endure, although modern SSDs boast impressive endurance ratings.
How to Choose the Right SSD
When picking the right SSD, you need to think about your budget, the amount of space you need, the type of device you have, and how you plan to use it.
1-Budget
Think about how much money you have and compare the cost-per-gigabyte of SSDs to the speed boosts they provide. Even though SSDs may cost more at first, the benefits they offer in the long run often make the cost worth it.
2-Storage Capacity
Think about how much space you need for storing and choose an SSD that has enough room for your files, apps, and operating system. To get the most out of your system, you need to find the right mix between capacity and performance.
3-Type of Device
Select an SSD form factor and interface that are compatible with your device, whether it is a desktop PC, laptop, or ultrabook. In order to guarantee optimal performance and seamless integration, it is crucial to evaluate variables such as interface speed, connector type, and physical dimensions.
Summary
SSDs have revolutionised the field of data storage, providing unmatched speed, dependability, and effectiveness. SSDs, with their diverse range of types, form factors, and functions, have become essential in both consumer and professional environments, providing users with fast and smooth access to their data. SSDs consistently advance business workflows, improve gaming experiences, and enable efficient productivity on-the-go, continuously expanding the capabilities of storage technology.
Ultimately, the advancement of solid-state drives (SSDs) signifies a fundamental change in the way we store and retrieve info, introducing a fresh era characterised by enhanced speed, dependability, and effectiveness. With the continuous progress of technology and the increasing availability of SSDs, we may anticipate further advancements and improvements in this field, which will open up even more opportunities for the future of storage.
|
__label__pos
| 0.762312 |
Tcl_DString(3) Tcl Library Procedures Tcl_DString(3)
Tcl_DStringInit, Tcl_DStringAppend, Tcl_DStringAppendElement, Tcl_DStringStartSublist, Tcl_DStringEndSublist, Tcl_DStringLength, Tcl_DStringValue, Tcl_DStringSetLength, Tcl_DStringTrunc, Tcl_DStringFree, Tcl_DStringResult, Tcl_DStringGetResult - manipulate dynamic strings
#include <tcl.h>
Tcl_DStringInit(dsPtr)
char *
Tcl_DStringAppend(dsPtr, bytes, length)
char *
Tcl_DStringAppendElement(dsPtr, element)
Tcl_DStringStartSublist(dsPtr)
Tcl_DStringEndSublist(dsPtr)
int
Tcl_DStringLength(dsPtr)
char *
Tcl_DStringValue(dsPtr)
Tcl_DStringSetLength(dsPtr, newLength)
Tcl_DStringTrunc(dsPtr, newLength)
Tcl_DStringFree(dsPtr)
Tcl_DStringResult(interp, dsPtr)
Tcl_DStringGetResult(interp, dsPtr)
Tcl_DString *dsPtr (in/out)
Pointer to structure that is used to manage a dynamic string.
const char *bytes (in)
Pointer to characters to append to dynamic string.
const char *element (in)
Pointer to characters to append as list element to dynamic string.
int length (in)
Number of bytes from bytes to add to dynamic string. If -1, add all characters up to null terminating character.
int newLength (in)
New length for dynamic string, not including null terminating character.
Tcl_Interp *interp (in/out)
Interpreter whose result is to be set from or moved to the dynamic string.
Dynamic strings provide a mechanism for building up arbitrarily long strings by gradually appending information. If the dynamic string is short then there will be no memory allocation overhead; as the string gets larger, additional space will be allocated as needed.
Tcl_DStringInit initializes a dynamic string to zero length. The Tcl_DString structure must have been allocated by the caller. No assumptions are made about the current state of the structure; anything already in it is discarded. If the structure has been used previously, Tcl_DStringFree should be called first to free up any memory allocated for the old string.
Tcl_DStringAppend adds new information to a dynamic string, allocating more memory for the string if needed. If length is less than zero then everything in bytes is appended to the dynamic string; otherwise length specifies the number of bytes to append. Tcl_DStringAppend returns a pointer to the characters of the new string. The string can also be retrieved from the string field of the Tcl_DString structure.
Tcl_DStringAppendElement is similar to Tcl_DStringAppend except that it does not take a length argument (it appends all of element) and it converts the string to a proper list element before appending. Tcl_DStringAppendElement adds a separator space before the new list element unless the new list element is the first in a list or sub-list (i.e. either the current string is empty, or it contains the single character “{”, or the last two characters of the current string are “ {”). Tcl_DStringAppendElement returns a pointer to the characters of the new string.
Tcl_DStringStartSublist and Tcl_DStringEndSublist can be used to create nested lists. To append a list element that is itself a sublist, first call Tcl_DStringStartSublist, then call Tcl_DStringAppendElement for each of the elements in the sublist, then call Tcl_DStringEndSublist to end the sublist. Tcl_DStringStartSublist appends a space character if needed, followed by an open brace; Tcl_DStringEndSublist appends a close brace. Lists can be nested to any depth.
Tcl_DStringLength is a macro that returns the current length of a dynamic string (not including the terminating null character). Tcl_DStringValue is a macro that returns a pointer to the current contents of a dynamic string.
Tcl_DStringSetLength changes the length of a dynamic string. If newLength is less than the string's current length, then the string is truncated. If newLength is greater than the string's current length, then the string will become longer and new space will be allocated for the string if needed. However, Tcl_DStringSetLength will not initialize the new space except to provide a terminating null character; it is up to the caller to fill in the new space. Tcl_DStringSetLength does not free up the string's storage space even if the string is truncated to zero length, so Tcl_DStringFree will still need to be called.
Tcl_DStringTrunc changes the length of a dynamic string. This procedure is now deprecated. Tcl_DStringSetLength should be used instead.
Tcl_DStringFree should be called when you are finished using the string. It frees up any memory that was allocated for the string and reinitializes the string's value to an empty string.
Tcl_DStringResult sets the result of interp to the value of the dynamic string given by dsPtr. It does this by moving a pointer from dsPtr to the interpreter's result. This saves the cost of allocating new memory and copying the string. Tcl_DStringResult also reinitializes the dynamic string to an empty string.
Tcl_DStringGetResult does the opposite of Tcl_DStringResult. It sets the value of dsPtr to the result of interp and it clears interp's result. If possible it does this by moving a pointer rather than by copying the string.
append, dynamic string, free, result
7.4 Tcl
|
__label__pos
| 0.552744 |
hammer2 - Config notifications, cleanup HAMMER2 VFS API
[dragonfly.git] / sys / vfs / hammer2 / hammer2_network.h
CommitLineData
9ab15106
MD
1/*
2 * Copyright (c) 2011-2012 The DragonFly Project. All rights reserved.
3 *
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <[email protected]>
6 * by Venkatesh Srinivas <[email protected]>
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
17 * distribution.
18 * 3. Neither the name of The DragonFly Project nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific, prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
30 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
31 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
32 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35#ifndef VFS_HAMMER2_NETWORK_H_
36#define VFS_HAMMER2_NETWORK_H_
37
38#ifndef _VFS_HAMMER2_DISK_H_
39#include "hammer2_disk.h"
40#endif
41
42/*
43 * Mesh network protocol structures.
44 *
10c86c4e
MD
45 * SPAN PROTOCOL
46 *
9ab15106 47 * The mesh is constructed from point-to-point streaming links with varying
10c86c4e
MD
48 * levels of interconnectedness, forming a graph. Terminii in the graph
49 * are entities such as a HAMMER2 PFS or a network mount or other types
50 * of nodes.
51 *
52 * The spanning tree protocol runs symmetrically on every node. Each node
53 * transmits a representitive LNK_SPAN out all available connections. Nodes
54 * also receive LNK_SPANs from other nodes (obviously), and must aggregate,
55 * reduce, and relay those LNK_SPANs out all available connections, thus
56 * propagating the spanning tree. Any connection failure or topology change
57 * causes changes in the LNK_SPAN propagation.
58 *
59 * Each LNK_SPAN or LNK_SPAN relay represents a virtual circuit for routing
60 * purposes. In addition, each relay is chained in one direction,
61 * representing a 1:N fan-out (i.e. one received LNK_SPAN can be relayed out
62 * multiple connections). In order to be able to route a message via a
63 * LNK_SPAN over a deterministic route THE MESSAGE CAN ONLY FLOW FROM A
64 * REMOTE NODE TOWARDS OUR NODE (N:1 fan-in).
65 *
66 * This supports the requirement that we have both message serialization
67 * and positive feedback if a topology change breaks the chain of VCs
68 * the message is flowing over. A remote node sending a message to us
69 * will get positive feedback that the route was broken and can take suitable
70 * action to terminate the transaction with an error.
71 *
72 * TRANSACTIONAL REPLIES
73 *
74 * However, when we receive a command message from a remote node and we want
75 * to reply to it, we have a problem. We want the remote node to have
76 * positive feedback if our reply fails to make it, but if we use a virtual
77 * circuit based on the remote node's LNK_SPAN to us it will be a DIFFERENT
78 * virtual circuit than the one the remote node used to message us. That's
79 * a problem because it means we have no reliable way to notify the remote
80 * node if we get notified that our reply has failed.
81 *
82 * The solution is to first note the fact that the remote chose an optimal
83 * route to get to us, so the reverse should be true. The reason the VC
84 * might not exist over the same route in the reverse is because there may
85 * be multiple paths available with the same distance metric.
86 *
87 * But this also means that we can adjust the messaging protocols to
88 * propagate a LNK_SPAN from the remote to us WHILE the remote's command
89 * message is being sent to us, and it will not only likely be optimal but
90 * it might also already exist, and it will also guarantee that a reply
91 * failure will propagate back to both sides (because even though each
92 * direction is using a different VC chain, the two chains are still
93 * going along the same path).
94 *
95 * We communicate the return VC by having the relay adjust both the target
96 * and the source fields in the message, rather than just the target, on
97 * each relay. As of when the message gets to us the 'source' field will
98 * represent the VC for the return direction (and of course also identify
99 * the node the message came from).
100 *
101 * This way both sides get positive feedback if a topology change disrupts
102 * the VC for the transaction. We also get one additional guarantee, and
103 * that is no spurious messages. Messages simply die when the VC they are
104 * traveling over is broken, in either direction, simple as that.
105 * It makes managing message transactional states very easy.
8c280d5d
MD
106 *
107 * MESSAGE TRANSACTIONAL STATES
9ab15106
MD
108 *
109 * Message state is handled by the CREATE, DELETE, REPLY, and ABORT
110 * flags. Message state is typically recorded at the end points and
111 * at each hop until a DELETE is received from both sides.
112 *
113 * One-way messages such as those used by spanning tree commands are not
26bf1a36
MD
114 * recorded. These are sent without the CREATE, DELETE, or ABORT flags set.
115 * ABORT is not supported for one-off messages. The REPLY bit can be used
116 * to distinguish between command and status if desired.
117 *
118 * Persistent-state messages are messages which require a reply to be
119 * returned. These messages can also consist of multiple message elements
120 * for the command or reply or both (or neither). The command message
121 * sequence sets CREATE on the first message and DELETE on the last message.
122 * A single message command sets both (CREATE|DELETE). The reply message
123 * sequence works the same way but of course also sets the REPLY bit.
124 *
125 * Persistent-state messages can be aborted by sending a message element
126 * with the ABORT flag set. This flag can be combined with either or both
127 * the CREATE and DELETE flags. When combined with the CREATE flag the
128 * command is treated as non-blocking but still executes. Whem combined
129 * with the DELETE flag no additional message elements are required.
130 *
131 * ABORT SPECIAL CASE - Mid-stream aborts. A mid-stream abort can be sent
132 * when supported by the sender by sending an ABORT message with neither
133 * CREATE or DELETE set. This effectively turns the message into a
134 * non-blocking message (but depending on what is being represented can also
135 * cut short prior data elements in the stream).
136 *
137 * ABORT SPECIAL CASE - Abort-after-DELETE. Persistent messages have to be
138 * abortable if the stream/pipe/whatever is lost. In this situation any
139 * forwarding relay needs to unconditionally abort commands and replies that
140 * are still active. This is done by sending an ABORT|DELETE even in
141 * situations where a DELETE has already been sent in that direction. This
142 * is done, for example, when links are in a half-closed state. In this
143 * situation it is possible for the abort request to race a transition to the
144 * fully closed state. ABORT|DELETE messages which race the fully closed
145 * state are expected to be discarded by the other end.
9ab15106 146 *
9ab15106
MD
147 * --
148 *
8c280d5d
MD
149 * All base and extended message headers are 64-byte aligned, and all
150 * transports must support extended message headers up to HAMMER2_MSGHDR_MAX.
151 * Currently we allow extended message headers up to 2048 bytes. Note
152 * that the extended header size is encoded in the 'cmd' field of the header.
9ab15106 153 *
8c280d5d 154 * Any in-band data is padded to a 64-byte alignment and placed directly
9ab15106
MD
155 * after the extended header (after the higher-level cmd/rep structure).
156 * The actual unaligned size of the in-band data is encoded in the aux_bytes
157 * field in this case. Maximum data sizes are negotiated during registration.
158 *
8c280d5d
MD
159 * Auxillary data can be in-band or out-of-band. In-band data sets aux_descr
160 * equal to 0. Any out-of-band data must be negotiated by the SPAN protocol.
161 *
162 * Auxillary data, whether in-band or out-of-band, must be at-least 64-byte
163 * aligned. The aux_bytes field contains the actual byte-granular length
164 * and not the aligned length.
165 *
166 * hdr_crc is calculated over the entire, ALIGNED extended header. For
167 * the purposes of calculating the crc, the hdr_crc field is 0. That is,
168 * if calculating the crc in HW a 32-bit '0' must be inserted in place of
169 * the hdr_crc field when reading the entire header and compared at the
170 * end (but the actual hdr_crc must be left intact in memory). A simple
171 * counter to replace the field going into the CRC generator does the job
172 * in HW. The CRC endian is based on the magic number field and may have
173 * to be byte-swapped, too (which is also easy to do in HW).
174 *
175 * aux_crc is calculated over the entire, ALIGNED auxillary data.
176 *
177 * SHARED MEMORY IMPLEMENTATIONS
178 *
179 * Shared-memory implementations typically use a pipe to transmit the extended
180 * message header and shared memory to store any auxilary data. Auxillary
181 * data in one-way (non-transactional) messages is typically required to be
182 * inline. CRCs are still recommended and required at the beginning, but
183 * may be negotiated away later.
184 *
185 * MULTI-PATH MESSAGE DUPLICATION
186 *
187 * Redundancy can be negotiated but is not required in the current spec.
188 * Basically you send the same message, with the same msgid, via several
189 * paths to the target. The msgid is the rendezvous. The first copy that
190 * makes it to the target is used, the second is ignored. Similarly for
191 * replies. This can improve performance during span flapping. Only
192 * transactional messages will be serialized. The target might receive
193 * multiple copies of one-way messages in higher protocol layers (potentially
194 * out of order, too).
9ab15106
MD
195 */
196struct hammer2_msg_hdr {
8c280d5d 197 uint16_t magic; /* 00 sanity, synchro, endian */
10c86c4e 198 uint16_t reserved02; /* 02 */
8c280d5d
MD
199 uint32_t salt; /* 04 random salt helps w/crypto */
200
201 uint64_t msgid; /* 08 message transaction id */
10c86c4e
MD
202 uint64_t source; /* 10 originator or 0 */
203 uint64_t target; /* 18 destination or 0 */
8c280d5d 204
10c86c4e
MD
205 uint32_t cmd; /* 20 flags | cmd | hdr_size / ALIGN */
206 uint32_t aux_crc; /* 24 auxillary data crc */
207 uint32_t aux_bytes; /* 28 auxillary data length (bytes) */
208 uint32_t error; /* 2C error code or 0 */
209 uint64_t aux_descr; /* 30 negotiated OOB data descr */
8c280d5d
MD
210 uint32_t reserved38; /* 38 */
211 uint32_t hdr_crc; /* 3C (aligned) extended header crc */
9ab15106
MD
212};
213
214typedef struct hammer2_msg_hdr hammer2_msg_hdr_t;
215
216#define HAMMER2_MSGHDR_MAGIC 0x4832
217#define HAMMER2_MSGHDR_MAGIC_REV 0x3248
218#define HAMMER2_MSGHDR_CRCOFF offsetof(hammer2_msg_hdr_t, salt)
219#define HAMMER2_MSGHDR_CRCBYTES (sizeof(hammer2_msg_hdr_t) - \
220 HAMMER2_MSGHDR_CRCOFF)
221
222/*
223 * Administrative protocol limits.
224 */
8c280d5d
MD
225#define HAMMER2_MSGHDR_MAX 2048 /* <= 65535 */
226#define HAMMER2_MSGAUX_MAX 65536 /* <= 1MB */
9ab15106
MD
227#define HAMMER2_MSGBUF_SIZE (HAMMER2_MSGHDR_MAX * 4)
228#define HAMMER2_MSGBUF_MASK (HAMMER2_MSGBUF_SIZE - 1)
229
230/*
231 * The message (cmd) field also encodes various flags and the total size
232 * of the message header. This allows the protocol processors to validate
233 * persistency and structural settings for every command simply by
234 * switch()ing on the (cmd) field.
235 */
236#define HAMMER2_MSGF_CREATE 0x80000000U /* msg start */
237#define HAMMER2_MSGF_DELETE 0x40000000U /* msg end */
238#define HAMMER2_MSGF_REPLY 0x20000000U /* reply path */
239#define HAMMER2_MSGF_ABORT 0x10000000U /* abort req */
240#define HAMMER2_MSGF_AUXOOB 0x08000000U /* aux-data is OOB */
241#define HAMMER2_MSGF_FLAG2 0x04000000U
242#define HAMMER2_MSGF_FLAG1 0x02000000U
243#define HAMMER2_MSGF_FLAG0 0x01000000U
244
245#define HAMMER2_MSGF_FLAGS 0xFF000000U /* all flags */
246#define HAMMER2_MSGF_PROTOS 0x00F00000U /* all protos */
247#define HAMMER2_MSGF_CMDS 0x000FFF00U /* all cmds */
248#define HAMMER2_MSGF_SIZE 0x000000FFU /* N*32 */
249
250#define HAMMER2_MSGF_CMDSWMASK (HAMMER2_MSGF_CMDS | \
251 HAMMER2_MSGF_SIZE | \
252 HAMMER2_MSGF_PROTOS | \
253 HAMMER2_MSGF_REPLY)
42e2a62e 254
f2e07ffb
MD
255#define HAMMER2_MSGF_BASECMDMASK (HAMMER2_MSGF_CMDS | \
256 HAMMER2_MSGF_SIZE | \
257 HAMMER2_MSGF_PROTOS)
9ab15106 258
42e2a62e
MD
259#define HAMMER2_MSGF_TRANSMASK (HAMMER2_MSGF_CMDS | \
260 HAMMER2_MSGF_SIZE | \
261 HAMMER2_MSGF_PROTOS | \
262 HAMMER2_MSGF_REPLY | \
263 HAMMER2_MSGF_CREATE | \
264 HAMMER2_MSGF_DELETE)
265
9ab15106
MD
266#define HAMMER2_MSG_PROTO_LNK 0x00000000U
267#define HAMMER2_MSG_PROTO_DBG 0x00100000U
9b8b748f
MD
268#define HAMMER2_MSG_PROTO_DOM 0x00200000U
269#define HAMMER2_MSG_PROTO_CAC 0x00300000U
270#define HAMMER2_MSG_PROTO_QRM 0x00400000U
271#define HAMMER2_MSG_PROTO_BLK 0x00500000U
272#define HAMMER2_MSG_PROTO_VOP 0x00600000U
9ab15106
MD
273
274/*
275 * Message command constructors, sans flags
276 */
8c280d5d 277#define HAMMER2_MSG_ALIGN 64
9ab15106
MD
278#define HAMMER2_MSG_ALIGNMASK (HAMMER2_MSG_ALIGN - 1)
279#define HAMMER2_MSG_DOALIGN(bytes) (((bytes) + HAMMER2_MSG_ALIGNMASK) & \
280 ~HAMMER2_MSG_ALIGNMASK)
f2e07ffb 281#define HAMMER2_MSG_HDR_ENCODE(elm) (((uint32_t)sizeof(struct elm) + \
9ab15106
MD
282 HAMMER2_MSG_ALIGNMASK) / \
283 HAMMER2_MSG_ALIGN)
284
285#define HAMMER2_MSG_LNK(cmd, elm) (HAMMER2_MSG_PROTO_LNK | \
286 ((cmd) << 8) | \
287 HAMMER2_MSG_HDR_ENCODE(elm))
288
289#define HAMMER2_MSG_DBG(cmd, elm) (HAMMER2_MSG_PROTO_DBG | \
290 ((cmd) << 8) | \
291 HAMMER2_MSG_HDR_ENCODE(elm))
292
9b8b748f
MD
293#define HAMMER2_MSG_DOM(cmd, elm) (HAMMER2_MSG_PROTO_DOM | \
294 ((cmd) << 8) | \
295 HAMMER2_MSG_HDR_ENCODE(elm))
296
9ab15106
MD
297#define HAMMER2_MSG_CAC(cmd, elm) (HAMMER2_MSG_PROTO_CAC | \
298 ((cmd) << 8) | \
299 HAMMER2_MSG_HDR_ENCODE(elm))
300
301#define HAMMER2_MSG_QRM(cmd, elm) (HAMMER2_MSG_PROTO_QRM | \
302 ((cmd) << 8) | \
303 HAMMER2_MSG_HDR_ENCODE(elm))
304
305#define HAMMER2_MSG_BLK(cmd, elm) (HAMMER2_MSG_PROTO_BLK | \
306 ((cmd) << 8) | \
307 HAMMER2_MSG_HDR_ENCODE(elm))
308
309#define HAMMER2_MSG_VOP(cmd, elm) (HAMMER2_MSG_PROTO_VOP | \
310 ((cmd) << 8) | \
311 HAMMER2_MSG_HDR_ENCODE(elm))
312
313/*
314 * Link layer ops basically talk to just the other side of a direct
315 * connection.
316 *
1a34728c 317 * LNK_PAD - One-way message on link-0, ignored by target. Used to
9ab15106
MD
318 * pad message buffers on shared-memory transports. Not
319 * typically used with TCP.
320 *
1a34728c 321 * LNK_PING - One-way message on link-0, keep-alive, run by both sides
8c280d5d
MD
322 * typically 1/sec on idle link, link is lost after 10 seconds
323 * of inactivity.
324 *
1a34728c 325 * LNK_AUTH - Authenticate the connection, negotiate administrative
9ab15106
MD
326 * rights & encryption, protocol class, etc. Only PAD and
327 * AUTH messages (not even PING) are accepted until
328 * authentication is complete. This message also identifies
329 * the host.
330 *
1a34728c 331 * LNK_CONN - Enable the SPAN protocol on link-0, possibly also installing
8c280d5d
MD
332 * a PFS filter (by cluster id, unique id, and/or wildcarded
333 * name).
9ab15106 334 *
1a34728c 335 * LNK_SPAN - A SPAN transaction on link-0 enables messages to be relayed
8c280d5d
MD
336 * to/from a particular cluster node. SPANs are received,
337 * sorted, aggregated, and retransmitted back out across all
338 * applicable connections.
9ab15106
MD
339 *
340 * The leaf protocol also uses this to make a PFS available
341 * to the cluster (e.g. on-mount).
1a34728c
MD
342 *
343 * LNK_VOLCONF - Volume header configuration change. All hammer2
344 * connections (hammer2 connect ...) stored in the volume
345 * header are spammed at the link level to the hammer2
346 * service daemon, and any live configuration change
347 * thereafter.
9ab15106
MD
348 */
349#define HAMMER2_LNK_PAD HAMMER2_MSG_LNK(0x000, hammer2_msg_hdr)
350#define HAMMER2_LNK_PING HAMMER2_MSG_LNK(0x001, hammer2_msg_hdr)
351#define HAMMER2_LNK_AUTH HAMMER2_MSG_LNK(0x010, hammer2_lnk_auth)
8c280d5d
MD
352#define HAMMER2_LNK_CONN HAMMER2_MSG_LNK(0x011, hammer2_lnk_conn)
353#define HAMMER2_LNK_SPAN HAMMER2_MSG_LNK(0x012, hammer2_lnk_span)
1a34728c 354#define HAMMER2_LNK_VOLCONF HAMMER2_MSG_LNK(0x020, hammer2_lnk_volconf)
9ab15106
MD
355#define HAMMER2_LNK_ERROR HAMMER2_MSG_LNK(0xFFF, hammer2_msg_hdr)
356
357/*
8c280d5d
MD
358 * LNK_CONN - Register connection for SPAN (transaction, left open)
359 *
360 * One LNK_CONN transaction may be opened on a stream connection, registering
361 * the connection with the SPAN subsystem and allowing the subsystem to
362 * accept and relay SPANs to this connection.
363 *
364 * The LNK_CONN message may contain a filter, limiting the desireable SPANs.
365 *
366 * This message contains a lot of the same info that a SPAN message contains,
367 * but is not a SPAN. That is, without this message the SPAN subprotocol will
368 * not be executed on the connection, nor is this message a promise that the
369 * sending end is a client or node of a cluster.
370 */
81666e1b
MD
371struct hammer2_lnk_auth {
372 hammer2_msg_hdr_t head;
373 char dummy[64];
374};
375
8c280d5d
MD
376struct hammer2_lnk_conn {
377 hammer2_msg_hdr_t head;
1a34728c 378 uuid_t mediaid; /* media configuration id */
8c280d5d
MD
379 uuid_t pfs_clid; /* rendezvous pfs uuid */
380 uuid_t pfs_fsid; /* unique pfs uuid */
381 uint8_t pfs_type; /* peer type */
382 uint8_t reserved01;
383 uint16_t proto_version; /* high level protocol support */
384 uint32_t status; /* status flags */
385 uint8_t reserved02[8];
32d51501 386 int32_t dist; /* span distance */
8c280d5d
MD
387 uint32_t reserved03[15];
388 char label[256]; /* PFS label (can be wildcard) */
389};
390
391typedef struct hammer2_lnk_conn hammer2_lnk_conn_t;
392
393/*
394 * LNK_SPAN - Relay a SPAN (transaction, left open)
9b8b748f
MD
395 *
396 * This message registers a PFS/PFS_TYPE with the other end of the connection,
397 * telling the other end who we are and what we can provide or what we want
398 * to consume. Multiple registrations can be maintained as open transactions
399 * with each one specifying a unique {source} linkid.
400 *
401 * Registrations are sent from {source}=S {1...n} to {target}=0 and maintained
402 * as open transactions. Registrations are also received and maintains as
403 * open transactions, creating a matrix of linkid's.
404 *
405 * While these transactions are open additional transactions can be executed
406 * between any two linkid's {source}=S (registrations we sent) to {target}=T
407 * (registrations we received).
408 *
409 * Closure of any registration transaction will automatically abort any open
410 * transactions using the related linkids. Closure can be initiated
411 * voluntarily from either side with either end issuing a DELETE, or they
412 * can be ABORTed.
413 *
414 * Status updates are performed via the open transaction.
415 *
416 * --
417 *
418 * A registration identifies a node and its various PFS parameters including
419 * the PFS_TYPE. For example, a diskless HAMMER2 client typically identifies
420 * itself as PFSTYPE_CLIENT.
421 *
422 * Any node may serve as a cluster controller, aggregating and passing
423 * on received registrations, but end-points do not have to implement this
424 * ability. Most end-points typically implement a single client-style or
425 * server-style PFS_TYPE and rendezvous at a cluster controller.
426 *
427 * The cluster controller does not aggregate/pass-on all received
428 * registrations. It typically filters what gets passed on based on
429 * what it receives.
430 *
431 * STATUS UPDATES: Status updates use the same structure but typically
432 * only contain incremental changes to pfs_type, with the
433 * label field containing a text status.
434 */
435struct hammer2_lnk_span {
436 hammer2_msg_hdr_t head;
8c280d5d 437 uuid_t pfs_clid; /* rendezvous pfs uuid */
9b8b748f
MD
438 uuid_t pfs_fsid; /* unique pfs uuid */
439 uint8_t pfs_type; /* peer type */
440 uint8_t reserved01;
441 uint16_t proto_version; /* high level protocol support */
442 uint32_t status; /* status flags */
443 uint8_t reserved02[8];
32d51501 444 int32_t dist; /* span distance */
8c280d5d 445 uint32_t reserved03[15];
9b8b748f
MD
446 char label[256]; /* PFS label (can be wildcard) */
447};
448
42e2a62e
MD
449typedef struct hammer2_lnk_span hammer2_lnk_span_t;
450
451#define HAMMER2_SPAN_PROTO_1 1
452
9b8b748f 453/*
1a34728c
MD
454 * LNK_VOLCONF
455 */
456struct hammer2_lnk_volconf {
457 hammer2_msg_hdr_t head;
458 hammer2_copy_data_t copy; /* copy spec */
459 int32_t index;
460 int32_t unused01;
461 uuid_t mediaid;
462 int64_t reserved02[32];
463};
464
465typedef struct hammer2_lnk_volconf hammer2_lnk_volconf_t;
466
467/*
9ab15106
MD
468 * Debug layer ops operate on any link
469 *
470 * SHELL - Persist stream, access the debug shell on the target
471 * registration. Multiple shells can be operational.
472 */
473#define HAMMER2_DBG_SHELL HAMMER2_MSG_DBG(0x001, hammer2_dbg_shell)
474
475struct hammer2_dbg_shell {
476 hammer2_msg_hdr_t head;
477};
478typedef struct hammer2_dbg_shell hammer2_dbg_shell_t;
479
480/*
9b8b748f
MD
481 * Domain layer ops operate on any link, link-0 may be used when the
482 * directory connected target is the desired registration.
483 *
484 * (nothing defined)
485 */
486
487/*
9ab15106
MD
488 * Cache layer ops operate on any link, link-0 may be used when the
489 * directly connected target is the desired registration.
490 *
491 * LOCK - Persist state, blockable, abortable.
492 *
493 * Obtain cache state (MODIFIED, EXCLUSIVE, SHARED, or INVAL)
494 * in any of three domains (TREE, INUM, ATTR, DIRENT) for a
495 * particular key relative to cache state already owned.
496 *
497 * TREE - Effects entire sub-tree at the specified element
498 * and will cause existing cache state owned by
499 * other nodes to be adjusted such that the request
500 * can be granted.
501 *
502 * INUM - Only effects inode creation/deletion of an existing
503 * element or a new element, by inumber and/or name.
504 * typically can be held for very long periods of time
505 * (think the vnode cache), directly relates to
506 * hammer2_chain structures representing inodes.
507 *
508 * ATTR - Only effects an inode's attributes, such as
509 * ownership, modes, etc. Used for lookups, chdir,
510 * open, etc. mtime has no affect.
511 *
512 * DIRENT - Only affects an inode's attributes plus the
513 * attributes or names related to any directory entry
514 * directly under this inode (non-recursively). Can
515 * be retained for medium periods of time when doing
516 * directory scans.
517 *
518 * This function may block and can be aborted. You may be
519 * granted cache state that is more broad than the state you
520 * requested (e.g. a different set of domains and/or an element
521 * at a higher layer in the tree). When quorum operations
522 * are used you may have to reconcile these grants to the
523 * lowest common denominator.
524 *
525 * In order to grant your request either you or the target
526 * (or both) may have to obtain a quorum agreement. Deadlock
527 * resolution may be required. When doing it yourself you
528 * will typically maintain an active message to each master
529 * node in the system. You can only grant the cache state
530 * when a quorum of nodes agree.
531 *
532 * The cache state includes transaction id information which
533 * can be used to resolve data requests.
534 */
535#define HAMMER2_CAC_LOCK HAMMER2_MSG_CAC(0x001, hammer2_cac_lock)
536
537/*
538 * Quorum layer ops operate on any link, link-0 may be used when the
539 * directly connected target is the desired registration.
540 *
541 * COMMIT - Persist state, blockable, abortable
542 *
543 * Issue a COMMIT in two phases. A quorum must acknowledge
544 * the operation to proceed to phase-2. Message-update to
545 * proceed to phase-2.
546 */
547#define HAMMER2_QRM_COMMIT HAMMER2_MSG_QRM(0x001, hammer2_qrm_commit)
548
549/*
8c280d5d
MD
550 * NOTE!!!! ALL EXTENDED HEADER STRUCTURES MUST BE 64-BYTE ALIGNED!!!
551 *
9ab15106
MD
552 * General message errors
553 *
554 * 0x00 - 0x1F Local iocomm errors
555 * 0x20 - 0x2F Global errors
556 */
81666e1b 557#define HAMMER2_MSG_ERR_NOSUPP 0x20
9ab15106 558
42e2a62e 559union hammer2_msg_any {
9ab15106
MD
560 char buf[HAMMER2_MSGHDR_MAX];
561 hammer2_msg_hdr_t head;
42e2a62e 562 hammer2_lnk_span_t lnk_span;
8c280d5d 563 hammer2_lnk_conn_t lnk_conn;
1a34728c 564 hammer2_lnk_volconf_t lnk_volconf;
9ab15106
MD
565};
566
42e2a62e 567typedef union hammer2_msg_any hammer2_msg_any_t;
9ab15106
MD
568
569#endif
|
__label__pos
| 0.964109 |
Smart Contracts in Blockchain: An Introduction to the Technicalities of Ethereum and Other Platforms
Dr Vin Menon
4 min readMay 9, 2023
Businesses of all sizes and in all industries benefit from written agreements. And yet, they typically cause burdens and are the subject of commercial and legal disputes. A problem like this, however, can be resolved by using intelligent contracts instead of traditional ones.
A blockchain-based smart contract intends to facilitate trade and business between known and unknown parties, often without a middleman. How do smart contracts in blockchain work, however? To learn more, keep reading.
What are smart contracts in blockchain?
A self-executing program known as a smart contract automates the steps necessary to fulfill the terms of a contract or agreement written directly into lines of code. The transactions are irreversible and trackable, since smart contracts are based upon blockchain networks.
Smart contracts are contracts that are stored on the blockchain as coded documents. By automating agreements between the maker and the recipient, they become unchangeable and irreversible. Its main objective is to execute contracts automatically without the need for middlemen, enabling immediate confirmation of the agreement by all parties. They can also be programmed to start a workflow in response to certain conditions.
A smart contract is deemed to have been executed after all of the requirements outlined in the smart contract’s code have been satisfied. Smart contracts in blockchain were made popular by the Ethereum blockchain, and they have given rise to various decentralized apps (DApps) and other use cases on the network.
How exactly are smart contracts in blockchain carried out?
Consider digital “if-then” declarations between two (or more) parties as smart contracts. The agreement can be honored, and the contract is deemed finished if one group’s needs are satisfied.
Say a market requests 100 ears of corn from a farmer. The latter will deliver, and the former will lock money into a smart contract that can be released upon the delivery. The money will be released immediately when the farmer fulfills their end of the bargain, following the conclusion of a formal contract. If the farmer misses the deadline, the agreement is nullified, and the money is returned to the client.
The aforementioned use case is obviously rather limited. Among other advantages, smart contracts can be configured to function for the general public, replacing centralized watch-over in commercial transactions.
Advantages and Disadvantages of Smart Contracts in Blockchain
Like blockchain technology, smart contracts have the same main advantage of eliminating the need for third parties in an agreement. Other advantages of smart contracts in blockchain include the following:
• Efficiency and Accuracy: Smart contracts are self-executing, which means that they automatically execute when predefined conditions are met. This does away with the need for manual intervention, reduces the potential for errors, and speeds up the process.
• Cost Savings: Since smart contracts in blockchain eliminate the need for intermediaries, they reduce the associated costs, such as fees, commissions, and salaries. This makes transactions more affordable for all parties involved.
• Accessibility: Smart contracts are decentralized, which means that they can be accessible in any corner of the world, given there is a decent internet connection. This makes them particularly useful for cross-border transactions.
• Security: Smart contracts are encrypted and then stored on a decentralized network, making them resistant to hacking and other forms of cyberattacks. This enhances the security and privacy of the transactions.
The following are some disadvantages of smart contracts:
• Immutability: While the immutability of smart contracts in blockchain can be a benefit, it can also be a disadvantage in certain situations. Once a smart contract is deployed on the blockchain, it cannot be changed, even if there are errors or changes in circumstances.
• Complexity: Smart contracts in blockchain can be complex and difficult to understand, particularly for individuals without a technical background. This can lead to errors or misunderstandings that could impact the outcome of the transaction.
• Dependence on Technology: Smart contracts are dependent on the underlying blockchain technology, which can be susceptible to technical issues, such as network congestion or software bugs.
Which blockchains employ smart contracts?
Smart contracts were first introduced on the Ethereum blockchain, which is currently the most popular blockchain for smart contracts. However, several other blockchains also support smart contracts, including:
• Binance Smart Chain (BSC)
• Cardano
• Polkadot
• TRON
• EOS
• Tezos
• Avalanche
• Algorand
• NEO
• Stellar
Each of these blockchains has its own unique features and advantages for deploying smart contracts, and the choice of blockchain depends on the specific use case and requirements of the project.
Notably, while Bitcoin was not originally designed to support smart contracts, it does have limited support for them through a feature called “Script”, which is a simple programming language used to define transaction outputs. Script is a stack-based language that allows for some basic scripting operations, such as multi-signature transactions and time-locked transactions.
However, the Script language used in Bitcoin is relatively limited compared to other blockchain platforms, such as Ethereum, which was specifically designed to support more complex smart contracts. As a result, while Bitcoin can technically support some basic smart contracts, it is not widely used for this purpose, and other, newer blockchains are typically preferred for deploying more sophisticated smart contracts.
Conclusion
I do hope this post has helped you learn about the concept of smart contracts in blockchain, and what they are used for. Are you curious to learn more about cryptocurrency, NFTs, and Blockchain? You can find more articles you like on my Medium page!
--
--
Dr Vin Menon
A blockchain enthusiast and entrepreneur’s musings on the next big revolution since the Internet.
|
__label__pos
| 0.973424 |
Adding Multiple Documents at a Time Using the Document Unpackager
Usually, it is better to upload documents into your Blackboard course one file at a time, since Blackboard allows you to provide descriptive information about each document and to set the options so that you can see (for example) whether students are actually viewing a particular document in your course. When you have a group of similar files to upload, however, it can be tedious to do that one file at a time. To make possible "bulk" uploads of files into a Blackboard course, we have installed a "building block" (that is, a program to extend Blackboard's functionality) called the Document Unpackager. The Document Unpackager allows you to upload a compressed (*.ZIP) archive file into your course. That ZIP archive can contain documents and even folders that themselves contain documents. The building block will unzip the archive, create folders in Blackboard (if the archive file has folders), and create an item in the course for each of the documents as well. The title for each document will be the same as the file name, and the link to each document will also be the file name, with the appropriate file extension (as in mydocument.doc). The process involves two steps, which we will explain in two separate help sheets:
1. Creating the Zip Archive
2. Uploading the Package Into Blackboard
Last revised February 26, 2008. Please send questions or comments to [email protected].
|
__label__pos
| 0.549925 |
Wondering what’s next for npm?Check out our public roadmap! »
hamlib-commonTypeScript icon, indicating that this package has built-in type declarations
0.3.2 • Public • Published
Ham lib
This is a library which is used in tix project
The main reason of this repository is to have a library in javascript which implements the communication protocol and all necessary functions of cryptography for tix project.
Getting Started
This library has two main files. crypto can handle all the required cryptography functions and serialize which handles all the serializing and deserializing packets. This library is using proto3 syntax to define packets.
At first all the actors in tix project (Requester, Subject, Prover) should generate two kinds of pair keys for further use.
import * as crypto from "../src/crypto";
const [pk, pubk] = crypto.createKey();
const [pkECDH, pubkECDH] = crypto.createKeyECDH();
After generating all pair keys, applications should save both private keys locally(encrypted by a password or not) and register their public keys to DID server.
pk and pubk are EDDSA pair of keys which is going to be used for signing the packets and pkECDH and pubkECDH is going to be used to encrypt and decrypt the communication channel. To encrypt or decrypt the pk with a password you can use aesEncrypt function in crypto.
const encrypted = crypto.aesEncrypt(password, pk);
const pk = crypto.aesDecrypt(password, encrypted);
From now on all applications should have their private keys for EdDSA and ECDH and they can look for any DID in DID server to retrieve their public keys.
Create a Query
In Requester application if you want to create a query you should specify:
1. Which question you want to ask?
• Types of questions are defined in types.ts as an enum
• Relation, Position, Certificate, Permission
• According to the type of question the query can have queryArgs which is an array of string.
2. Which prover can approve subject's answer?
• The prover DID should be in the query
Notice: Version is a field in this packet which can be used for backward compatibility
const encoded = serialize.encodeRequesterPacket(pk, requesterDID, proverDID,
questionType, queryArgs);
The result is a Uint8Array and requester application should use this to generate the QR code with.
Subject reads QR code
In Subject application after scanning the QR code the application should decode the bytes.
const decoded = serialize.decodeRequesterPacket(encoded);
After decoding the packet application can use decoded.query.requesterDID to retrieve the requester public key by searching in DID Server and verify the signature by:
serialize.verifyRequesterPacket(requesterPublicKey, decoded)
After seeing the question subject answers it and retrieves the appropriate prover's ECDH public key to create a packet for prover:
//startValidationTime and endValidationTime are epoch time
const encodedPacket = serialize.encodeSubjectPacket(subjectPrivateKey, decoded, subjectDID, proverDID, startValidationTime, endValidationTime, answerArgs);
const encryptedPacket = serialize.encodeEncryptPacket(subjectECDHPrivateKey, proverECDHPublicKey, PacketType.Subject, subjectDID, encodedPacket);
// here subject can send the encrypted packet to prover.
Approve subject's answer
When prover's application receives the encrypted packet:
1. It should decode it to a packet:
const decodedPacket = serialize.decodeEncryptPacket(encryptedPacket);
2. Look for ECDH public key of decodedPacket.did
const [packetType, encodedData, decryptedPacket] = serialize.decryptPacket(proverECDHPrivateKey, subjectECDHPublicKey, decodedPacket);
// packetType is the type of packet: Requester, Subject, Prover
// decryptedPacket is the json format of the packet
// encodedData is the encoded compressed version of decryptedPacket
3. If this packet is not a prover packet (decodedPacket.type != PacketType.Prover)
1. Here prover can confirm the subject's answer and create the encryptedPacket:
// decryptedPacket is the subject packet which this prover has just received.
// proverStartValidationTime, proverEndValidationTime, proverAnswerArgs are the prover's answer if prover does
// status is a ConfirmStatus which can be Reject, Confirm or Modify.
// if the status is Modify answerArgs and validation times can be different from subject's answer.
const proverEncodedPacket = serialize.encodeProverPacket(proverPrivateKey, decryptedPacket, [], [], proverDID, status, proverStartValidationTime, proverEndValidationTime, proverAnswerArgs);
2. Should I send the answer back to subject (Single Prover)
const encryptedPacket = serialize.encodeEncryptPacket(proverECDHPrivateKey, subjectECDHPublicKey, PacketType.Prover, proverDID, proverEncodedPacket);
// now prover can send encryptedPacket to the subject.
3. Should I send it to another prover (Multiple Prover)
const encryptedPacket = serialize.encodeEncryptPacket(proverECDHPrivateKey, nextProverECDHPublicKey, PacketType.Prover, proverDID, proverEncodedPacket);
// now prover can send encryptedPacket to next prover.
4. If this packet is a prover packet (Multiple prover scenario)
1. If I'm the prover that requester wanted me to approve the query and I should send the result to subject or if my confirmation is already in this packet and I should send it back to previous prover:
const encryptedPacket = serialize.encodeEncryptPacket(proverECDHPrivateKey, subjectECDHPublicKey or prevoiusECDHPublicKey, PacketType.Prover, proverDID, encodedData);
// now prover can send encryptedPacket to the subject or previous prover.
2. If not, Answer the question
const proverEncodedPacket = serialize.encodeProverPacket(proverPrivateKey, decryptedPacket, [], [], proverDID, status, proverStartValidationTime, proverEndValidationTime, proverAnswerArgs);
3. Send it to another prover
const encryptedPacket = serialize.encodeEncryptPacket(proverECDHPrivateKey, nextProverECDHPublicKey, PacketType.Prover, proverDID, proverEncodedPacket);
// now prover can send encryptedPacket to next prover.
Notice: answerArgs and queryArgs are designed generally to support all kind of scenarios.
Subject receives prover packet
1. It should decode it to a packet:
const decodedPacket = serialize.decodeEncryptPacket(encryptedPacket);
2. Look for ECDH public key of decodedPacket.did
const [packetType, encodedData, decryptedPacket] = serialize.decryptPacket(subjectECDHPrivateKey, proverECDHPublicKey, decodedPacket);
3. Decode the packet and check if everything is alright, subject can generate a QR code from encodedData and show it to the requester.
Requester should check all signatures
After scanning subject's QR code, now requester should decode the bytes to readable json format:
const packet = serialize.decodeProverPacket(qrBytes);
// check if every signature is ok or not
serialize.verifyProverPacket([all provers public key which can be retreived from packet.confirmations], packet, true, requestPublicKey, subjectPublicKey);
Register To DID
Prover, Subject and Requester should register to DID server via comminication.ts. To use communication you should specify address of did server and two functions for loading did from cache and saving the did to cache.
import {Communication} from "communication"
const communication = new Communication("http://127.0.0.1", did => {
// save did document in local database
}, (did: string) => {
// return did document if it is in local database
});
After having communication object you can easily register to did server according to the role of the application with appropriate methods.
// prover can register to did server
// prover is listening on subscribeUrl to push data to subjects, default is tcp://{ip address}:7200
// prover is listening on replyUrl to receive data from subjects or provers tcp://{ip address}:7201
communication.registerProverDID(name, ecdhPublicKey, publicIp);
// subjects can register to did server
communication.registerSubjectDID(name, ecdhPublicKey, eddsaPublicKey);
//requester can register to did server
communication.registerRequesterDID(name, ecdhPublicKey, eddsaPublicKey);
To get the json before submitting it to DID server you can use communication.mockRegisterProverDID, communication.mockRegisterSubjectDID and communication.mockRegisterRequesterDID.
Sending and receiving data
After scanning the QR code, subject should decode it by serialize.decodeRequesterPacket and show the json via UI to the user. User can answer the query by serialize.encodeSubjectPacket and then to send the answer to the prover:
communication.sendAnswerToProver(privateKeyECDH, proverDID, myDID, encodedPacket);
// for receiving data from prover subject should connect to prover as well
communication.connectToProver(privateKeyECDH, proverDID, myDID,
(packetId, validity, type, encodedMessage, packet) => {
// packetId is unique identifier of this packet
// validity is true if every signature in packet is valid
// type is one of Subject, Prover
// according to type you can cast packet to SubjectPacketType or ProverPacketType
// in last step if you want to create a QR code for requester, you can generate QR code from encodedMessage
});
That was for subject but prover application should call communication.startProver at the start of application.
// default port for subscribe is 7200 (pushing data to subjects)
// default port for reply is 7201 (receiving data from other provers or subjects)
communication.startProver(privateKeyECDH,
(packetId, validity, type, encodedMessage, packet) => {
// packetId is unique identifier of this packet
// validity is true if every signature in packet is valid
// type is one of Subject, Prover
// according to type you can cast packet to SubjectPacketType or ProverPacketType
});
In prover application, after receiving subject packet, prover should decide to confirm or reject the packet or forward it to another prover. To forward it to another prover you should call communication.forwardProver and to confirm or reject the packet and sends it back to subject you should call communication.sendConfirmationToSubject.
Notice In multiple prover story the last prover should call communication.sendConfirmationToSubject as well. The packet will get forwarded to previous prover
Question Types
Query packet structure is:
{
version: number;
requesterDID: string;
proverDID: string;
type: number;
queryArgs: string[];
}
Requester can generate the query by the help of serialize.encodeRequesterPacket function. This function returns the encodedBytes as Uint8Array with which you can generate the QR code and you can have the size of bytes by using encodedBytes.length. This function needs privateKey, requesterDID, proverDID, type and queryArgs as arguments. PrivateKey, requesterDID and proverDID are obvious but for type and query args you can use table below for reference.
Question type queryArgs
What relation do you have with organization x? QuestionType.Relation [organization name in text]
What position/responsibility x do you have for organization y? QuestionType.Position [organization name in text, position text like: CTO, CEO, etc.]
Do you have certificate X from organization y? QuestionType.Certificate [organization name in text, certificate text like: CCNA, MCSA, etc.]
Do you have permission X from organization y? QuestionType.Permission [organization name in text, clearance level text like: RS, ERS, etc.]
Subject's answer packet's structure is:
{
subjectDID: string;
answerArgs: string[];
startValidationTime: number;
endValidationTime: number;
}
subjectDID, startValidationTime and endValidationTime are obvious but to set the answerArgs you can use following table as reference.
type answerArgs
QuestionType.Relation [relation text like: employee, representative, etc.]
QuestionType.Position [position text like: CTO, CEO, etc.]
QuestionType.Certificate [certificate text like: CCNA, MCSA, etc.]
QuestionType.Permission [clearance level text like: RS, ERS, etc.]
Notice Since queryArgs and answerArgs are general and their values do not have any effect on the protocol, to minimize the size of packets you can use abbreviations. For example instead of using employee you can use e, etc.
Keywords
none
Install
npm i hamlib-common
DownloadsWeekly Downloads
0
Version
0.3.2
License
MIT
Unpacked Size
73.7 kB
Total Files
16
Last publish
Collaborators
• avatar
|
__label__pos
| 0.772897 |
How to change PHP version on your domain using cPanel?
Some software requires older version of PHP like 5.6 while other asks for PHP7. If it happens you need either of the versions, you can switch to it from cPanel.
1. Log into your cPanel account.
2. In the "Software" section, click on the "MultiPHP Manager" Icon.
3. Scroll down to the bottom of the page, select your domain from the left side of the screen and you will see an option "PHP Version" with a drop-down menu on the right side. Select the appropriate PHP version from it and click the Apply button.
If will take a few seconds and then your PHP version will change to your selected version.
• 0 Users Found This Useful
Was this answer helpful?
Related Articles
How to check disk usage of directory and bandwidth usage?
If you are receiving a disk space usage warning and don't know which folder is using too...
How to Edit or Delete Cronjob via cPanel?
How to Edit Cronjob?1. Log into your cPanel account.2. In the "Advanced" section, click on "Cron...
How to edit or remove a Record in cPanel using the DNS Zone Editor?
You can edit or remove a Record from cPanel using the cPanel DNS Zone Editor which allows you to...
How to Reset my cPanel Account Password?
If you can access your cPanel account, follow these steps to reset your password:1. Log into your...
How to Reset the PHP Version to the Default Version, Using cPanel?
If you wish to reset the PHP version to the default version, follow these instructions:1. Log...
|
__label__pos
| 0.962466 |
Business Intelligence
Zen of data modelling in Hadoop
Zen of data modelling in Hadoop
The Zen of Python is well known tongue-in-cheek guidelines to writing Python code. If you haven’t read it, I would highly recommend reading it here Zen of Python.
There’s an “ester egg” in Python REPL. Type the following import into Python REPL and it will printout the Zen of Python.
import this
Beautiful is better than ugly.
Explicit is better than implicit.
Simple is better than complex.
Complex is better than complicated.
Flat is better than nested.
Sparse is better than dense.
Readability counts.
Special cases aren’t special enough to break the rules.
Although practicality beats purity.
Errors should never pass silently.
Unless explicitly silenced.
In the face of ambiguity, refuse the temptation to guess.
There should be one-and preferably only one –obvious way to do it.
Although that way may not be obvious at first unless you’re Dutch.
Now is better than never.
Although never is often better than right now.
If the implementation is hard to explain, it’s a bad idea.
If the implementation is easy to explain, it may be a good idea.
Namespaces are one honking great idea -let’s do more of those!
I have been pondering about how would you model your data in Hadoop. There are no clear guideline or hard and fast rules. As in, if it is an OLTP database use 3NF or if you are building warehouse, use Kimball methodology. I had the same dilemma when SSAS Tabular came around in SQL Server 2012. The conclusion that I reached was that it was somewhere between the two extremes: a fully normalized > = 3NF and flat-wide-deep denormalized mode.
Hadoop ecosystem also throws additional complexities in the mix – what file format to choose (Avro, Paraquet, ORC, Sequence and so on), what compression works best (Snappy, bzip etc), access patterns (is it scan, is it more like search), redundancy, data distribution,partitioning, distributed/parallel processing and so on. Some would give the golden answer “it depends”. However, I think there are some basic guidelines we can follow (while, at the same time, not disagreeing with the fact that it depends on the use case).
So in the same vein as Zen of Python I would like to present my take on Zen of data modelling in Hadoop. In future posts – hopefully – I will expand further on each one.
So here it is
Zen of Data Modelling in Hadoop
Scans are better than joins
Distributed is better than centralised
Tabular view is better than nested
Redundancy is better than lookups
Compact is better than sparse
End user queries matter
No model is appropriate for all use cases so schema changes be graceful
Multiple views of the data are okay
Access to all data is not always needed, filtering at the source is great
Processing is better done closer to data
Chunk data into large blocks
ETL is not the end, so don’t get hung up on it, ETL exists to serve data
Good enough is better than none at all, Better is acceptable than Best
So there you have it. As mentioned previously, the model will depend on the situation and lets hope these will be helpful starting point. They come with full disclaimer – Use at your own risk and are always subject to change 🙂
Advertisements
Changing role of IT in the BI world
BI is Dead, Long live BI
Timo Elliot (blog|twitter) recently published a blog BI is Dead which draws from Gartner’s Magic Quadrant report and a detailed report.
The main take away from the post (which includes references from the Gartner research ,so not all are Timo’s points) include:
• The self service analytics tools have matured enough that the involvement of IT in BI and analytics projects is deemed optional. IT don’t need to model the data upfront (which needed gathering all or partial analytics requirements to start with), analysts can prototype and test it themselves.
• The balance of power for BI and analytics platform buying decisions has gradually shifted from IT to business.
• BI and analytics tools which do require intervention from IT are not considered BI anymore; they are Enterprise Reporting Based Platforms. Admittedly, they take most share of the BI market. In other words Gartner has updated the definition of BI.
• The bold headline – “BI is Dead” – is to gain attention on the changing landscape of BI tools.
• Organizations who do not embrace the new definition of BI, run the danger of turning into BI-nosaurs.
• Having single view of data through an EDW is pointless/extremely hard. This and this from Curt Monash also support this line of thinking.
• Most organizations believe that IT has role to play in BI although majority want the responsibility of authoring the content to end users. This has always been the holy grail of BI.
So it is really dead?
Well-not necessarily. It’s dead in the sense that PCs are dead as we know them from 1980 or before. PCs have clearly evolved: they don’t look like how they used to look and many aspects of PC have been democratized. Trivial things which needed programmer in those days can now be done by users themselves. Heck, you can even upgrade the hardware if you are into that sort of thing.
I think that’s exactly what is happening in the BI and analytics world. The self service analytics tools have evolved to the point that many of the trivial data munging tasks can be done by the analysts themselves and what they can do with these new tools does not look at all like how they have been doing it. Does that mean the BI is dead? No- the fundamental analytics is still the same. It has evolved just like the PCs and the role of IT has changed.
Role of IT in the new BI world
The changing role of IT in BI and analytics can be best described from picture below.
Changing role of IT in the BI world
IT is now viewed as (and rightly so) as data facilitators. They make data available to the analysts in palatable form. The responsibility of modelling it,authoring presentation components and analysis lies with analysts.
Does that mean the job of IT got easier?
Most-Definitely-Not, on the contrary it has got even more complicated. With the influx of new tools, the demand for data has dramatically increased. The analysts want to analyse all sorts of data, from all sorts of unlikely sources and with all sorts of analytical methods. Their expectations from IT is to facilitate this process which is where ITs job has got a lot harder. We have to deal with ever increasing data sizes, from ever expanding sources, and support ever changing analytical tools.
What else is keeping BI alive?
If we assume the following definition of BI,then here are more reasons why BI is definitely not dead in its current incarnation.
BI
:
an umbrella term to describe “concepts and methods to improve business decision making by using fact-based support systems”
1. Not everybody is data scientist
a. Combining data from multiple sources, b. creating data model and c.authoring reports from it, need special skillset. Many a times, analysts just want an Excel connecting to OLAP cube to do their analysis. Traditional BI has a place in this space.
2. Robust production ready solutions
The analysis done in the analysts R code or ipython notebook is not usually production ready. BI will be very much needed when it needs to be productionised.
3. If ETL is part of BI then its here to stay
How else would you provide quality data to analysts otherwise? And if the definition of BI includes methods to improve process of decision making, then we need BI.
4. Operational reporting is a fact of life
As much as we harp about ad-hoc analysis, data science and self-service BI, plain old operational reporting is a big part of any organization. For that we need classic BI.
Creating a new SSIS package? Have you thought about these things?
Creating a package in SSIS is easy but creating a “good” SSIS package is a different story. As developers, we tend to jump right into building and creating that wonderfully simple package and often overlook the nitty-gritties. Being an avid developer myself, I must confess that I have fallen prey to this from time to time. When I find myself in a rush to create “that” package, I take a step back and ask myself “have you thought about these things?”. The list below is not comprehensive but it’s a good starting point. I will hopefully keep it updated as I come across more issues. Please note that it is not a SSIS best practices or SSIS optimization tips; these are more of high level things which I keep at the back of my mind whenever I am creating a new SSIS package.
1. SSIS Configuration
Configuration has to be the No.1 thing to think about when you start creating any SSIS package. It governs how the package will run in multiple environments so it is absolutely necessary to pay particular attention to configuration. Some of the questions to ask yourself are
• Where is configuration stored? Is it XML, dtcConfig file, SQL Server?
• How easy it is to change configured values?
• What values are you going to store in configuration? Is it just connection manager or should you be storing any variable values as well.
• What will happen if the package does not find a particular configured item? Would it fail? Would it do something it should not be doing?
• How are you storing the passwords if there are any?
• and so on..
2. SSIS Logging
There is certain minimum information each SSIS package must log. It is not only a good practice but it will make life much easier when package fails in production and you want to know where and why it failed. As rule of thumb, I think the following should be logged
• The start and end of the package
• The start and end of each task
• Any errors on tasks. You should log as much information as possible about the error such as the error message, variable values when the error occurred, server names, file names under processing etc.
• Row counts in the data flow
Which log provider to use is entirely up to you although I tend to create the log in a SQL Server database because it is easier to query that way.
3. Package restartability
Can you re-run the package as many times as you want? What if the package fails in between the operation? Would it start from where it failed? If it starts from the beginning what would it do?
4. Is your package atomic?
By “atomic”, I mean is it doing just one operation like “load date” or “load customer” or is it doing multiple operations like “load date and update fact”. It is always a good idea to keep packages atomic. This helps in restartability besides helping while debugging the ETL. If you think your package is doing multiple operations in one go, split it into multiple packages.
5. Are you using the correct SSIS tasks?
There are tasks in which SSIS is good at and there are tasks in which databases are good at. For example, databases are good at JOIN operations whereas SSIS can connect to an FTP site with ease. Are you using the optimum task? Can your current operation be done in pure TSQL? If yes, push it to the database.
6. Are you using event handlers?
Event handlers are great if you want to take alternative actions on certain events. For example, if the package fails, OnError event handler can be used to reset tables or notify somebody.
7. Have you thought about data source?
How are you getting data from data source? Is it the best way? Can you add a layer of abstraction between data source and your SSIS package? If you are reading from a relational database, can you create views on it rather than hard-coded SQL queries? If you are reading from flat files, have you set the data type correctly?
8. Naming convention
Is your package aptly named? Does it do what it says on the tin? Does it convey meaningful information about what the package is doing?
Same rules also apply to variables in the package.
9. SSIS Task Names
Have you renamed SSIS Tasks and are they descriptive enough to convey meaning of the operation they are performing?
10. Documentation/Annotations
Is your package well documented? Does it describe WHY it is doing something rather than WHAT it is doing? The former is considered a good documentation although in case of SSIS I find that even the later is very helpful because any new person doesn’t have to go through the package to understand what it is doing. SSIS annotations are great for in-package documentation and can be used effectively.
11. Is your package well structured both operationally and visually?
Can you box tasks into a series sequence containers? Does your package looks like a nice flow either from top-to-bottom or left-to-right? Are there any tasks which are hidden beneath other? Can the person looking at the package for first time grasp what’s happening without digging into each task?
12. Are you using an ETL framwork?
Having a generalized ETL framework will save a significant amount of time because many of the repetitive tasks such as logging, event handlers, configuration can be created in one “template” package and all other packages can be based on this template package.
Please leave a comment about what you think and if there is anything that you always keep in my mind when developing in SSIS. An older post of mine about things to be aware of while developing SSAS cubes is one of favorite and I can see this becoming one too!!
Data Virtualization in Business Intelligence
A long time ago I wrote a blog post where I described three approaches to providing operational reports and compared them against each other. They are 1) traditional DW approach, 2) the abstract views approach and 3) the direct query approach. The blog post can be found here and I keep it handy whenever I am asked about operational reports.
I have been recently looking at Data Virtualization (DV) and started thinking how it can be used in a BI project. This blog is about that. If you are not familiar with DV, this youtube video from one of the DV software vendors provides good introduction. I would highly recommend watching it before proceeding.
This is the wikipedia definition of DV but in a nutshell it is a technique in which multiple data sources are joined together in a logical layer so as to abstract the complexities of the data sources and provide a unified view of the data to the end users. Going back to my original blog post, one of the difficulties of the views approach is in integrating multiple data sources. That’s primarily because views are simply projections on tables in databases. It’s quite difficult to create a view which spans across different databases for e.g. SQL Server view based on data in Oracle unless you some how bring it in the SQL server AKA ETL it. It is even more challenging if the data source is a flat file or XML or JSON. How would you create views on them?
Enter DV. In DV, as mentioned earlier, multiple data sources are joined together in a virtual layer. The type of the data sources can vary from relational databases to files in Hadoop to web services. The ETL is performed on the fly and in-place,if need be, i.e. multiple data sources are integrated in real time. If we can point our reporting tool to this virtual layer, we can provide real time operational reporting. Sweet!! So imagine a quick report you want to knock together which involves SQL Server, a web service and Excel file. DV will gladly connect to three, allow you mash them together and publish this data. You can point the reporting tool to published data and are good to go. And all in real time – that’s added bonus.
This all looks very cool hence a word of caution. It sounds like DV is replacement for ETL and data warehouse but it is NOT. There are far more advantages to having a DW and ETL process in place but they are beyond the scope of this blog. We can certainly think of creative ways of using DV in conjunction with traditional DW and ETL. Providing real time operational reports in a way mentioned above can be one of them.
Faster SSAS Processing by using Shared Memory Protocol
I came across this very handy tip to increase SSAS processing speed in SQL Server 2008 R2 Analysis Services Operations Guide and thought it is worth sharing.
The guide recommendes using Shared Memory Protocol when getting data from the relational data source if it is SQL Server and both SSAS and SQL Server are on the same physical box. Exchaning data over shared memory is much faster than over TCP/IP as you probably already know. You will need to perform two steps to force SSAS data source to use shared memory while querying underlying SQL Server.
1. Check that Shared Memory Protocol is enabled in SQL Server configuration manager.
2. Prefix the data source connection string in SSAS with :lpc like below.
Provider=SQLNCLI10.1;Data Source=lpc:ThisServer\INST1;Integrated Security=SSPI;Initial Catalog=WordMatch
The guide claims to have achieved 112,000 rows per second using TCP/IP where as 180,000 rows per second using shared memory which is impressive. In my own test, a slightly modified Adventure Works cube took 56 seconds to process using TCP-IP whereas 47 seconds using shared memory; an improvement of 16%.
99 Problems in R
In my Introduction to R post, I introduced R and provided some resources to learn it. I am learning R myself and finding the learning curve a bit steep. Anyway, the best way to learn a new programming language is to practice as much as possible. So inspired by 99 Problems in various languages (links below), I am creating ’99 Problems in R’ set. The project is on github. I am new to github but finding it easy to share code through github rather than here on the blog. Hopefully in future, I would make more use of github.
The files are in *.rmd format which can be opened in R Studio. I have also added knitted HTML files. The git repo is here.
https://github.com/saysmymind/99-Problems-R
Be warned that the solutions to problems are written by me; an amateur R programmer, so there might be better way of solving some of them. I will try to solve more problems and keep adding them to the repo. In the mean time, feel free to do pull request and peek at code.
I wish I can say ‘I got 99 problems but R ain’t one’ but alas I am not there yet. 🙂
99 Haskell Problems
99 Python Problems
99 Prolog Problems
99 LISP Problems
99 Perl 6 Problems
99 OCaml Problems
Calculated distinct count measures in SSAS
Distinct count measures are fact-of-life for an SSAS developer. No matter how much we try to avoid them they are always asked for and we have to deal with them somehow. Another painful fact is, as you might already know, we cannot create multiple distinct count measures in the same measure group. So each distinct count measure has to sit in its own measure group which,IMO, does not look right when browsing the cube. In this post, I want to show a method of creating distinct count calculated measures which I found on Richard Lees blog here with slight modification.
http://richardlees.blogspot.co.uk/2008/10/alternative-to-physical-distinct-count.html
Using Adventure Works, let’s say the end users want to know the distinct count of customers who have placed orders on the internet. I can add a calculation like this in the cube
CREATE MEMBER CURRENTCUBE.[Measures].[Unique Customers]
AS COUNT(NONEMPTY([Customer].[Customer].[Customer].members,
[Measures].[Internet Order Count])),
VISIBLE = 1 , ASSOCIATED_MEASURE_GROUP = 'Internet Orders' ;
This is all fine and dandy, however, as soon as I added any attribute from customer dimension on the rows or filters, the results were showing incorrect values i.e. the same count of customers was repeated for all records.
The solution is to count the number of unique customers in the context of current attributes of customer dimension. For examples sake, lets take Customer City attribute. I tweaked the calculation like below to count customers only in the context of current members in City attributes and it started working as expected when Customer City attribute is used in rows, columns or filters.
CREATE MEMBER CURRENTCUBE.[Measures].[Unique Customers]
AS COUNT(NONEMPTY(
CROSSJOIN(
[Customer].[Customer].[Customer].members,
[Customer].[City].CurrentMember
),[Measures].[Internet Order Count])),
VISIBLE = 1 , ASSOCIATED_MEASURE_GROUP = 'Internet Orders' ;
Of course, you will have to add all the dimension attributes in the CROSSJOIN but ultimately a calculated, though complex, distinct count measure is better than having a number of physical distinct count measures IMHO.
|
__label__pos
| 0.532068 |
Graphics Programming
Introduction to OpenGL
Outline
• • • • • What is OpenGL OpenGL Rendering Pipeline OpenGL Utility Toolkits OpenGL Coding Framework OpenGL API
Graphics System
Function calls Data
User User Program Program
Graphics Graphics System System
Output Input
I/O I/O Device Device
Graphics API
org .What is OpenGL OpenGL • • • • • A software interface to graphics hardware A 3D graphics rendering API (>120 functions) Hardware independent Very fast (a standard to be accelerated) Portable http://www.opengl.
mesa3d.4 (latest) • Governed by OpenGL Architecture Review Board (ARB) “Mesa” – an Open source (http://www.0 (1992) • OpenGL v1.1 (1995) • OpenGL v1.org) .A History of OpenGL • Was SGI’s Iris GL – “Open”GL • “Open” standard allowing for wide range hardware platforms • OpenGL v1.
Graphics Process Geometric Primitives Rendering Rendering Image Primitives Frame Buffer + = .
OpenGL Architecture .
OpenGL is Not a Language It is a Graphics Rendering API Whenever we say that a program is OpenGL-based or OpenGL applications. we mean that it is written in some programming language (such as C/C++) that makes calls to one or more of OpenGL libraries .
Window Management • OpenGL is window and operating system independent • OpenGL does not include any functions for window management. and file I/O • Host environment is responsible for window management . user interaction.
Window Management API We need additional libraries to handle window management • GLX/AGL/WGL – glue between OpenGL and windowing systems • GLUT – OpenGL Window Interface/Utility toolkit • AUX – OpenGL Utility Toolkit .
OpenGL API Hierarchy .
OpenGL Division of Labor • GL – “core” library of OpenGL that is platform independent • GLU – an auxiliary library that handles a variety of graphics accessory functions • GLUT/AUX – utility toolkits that handle window managements .
lib (PC) -lgl (UNIX) glu32.lib (PC) -lglaux (UNIX) glut.lib (PC) -lglu Header File gl.Libraries and Headers Library Name OpenGL Auxiliary library Library File opengl32.h glaux.h glu.lib (PC) -lglut (UNIX) glaux.h Note “core” library handles a variety of accessory functions window managements Utility toolkits glut32.h All are presented in the C language .
Learning OpenGL with GLUT
• GLUT is a Window Manager (handles window creation, user interaction, callbacks, etc) • Platform Independent • Makes it easy to learn and write OpenGL programs without being distracted by your environment • Not “final” code (Not meant for commercial products)
Environment Setup
• All of our discussions will be presented in C/C++ language • Use GLUT library for window managements • Files needed gl.h, glu.h, glut.h opengl32.lib, glu32.lib, glut32.lib • Go to http://www.opengl.org download files • Follow the Setup instruction to configure proper path
Usage
Include the necessary header files in your code
#include <GL/gl.h> #include <GL/glu.h> #include <GL/glut.h> // “core”, the only thing is required // handles accessory functions // handles window managements
void main( int argc, char **argv ) { ….. }
Only the “core” library (opengl32.lib, gl.h) are required
or -lglut (UNIX) .lib (PC).lib (PC). or -lglu (UNIX) • Link GLUT library – Link glut32.Usage Link the necessary Libraries to your code • Link GL library – Link opengl32. or -lgl (UNIX) • Link GLU library – Link glu32.lib (PC).
double B. . GLdouble B. OpenGL defines its own data types that map to normal C data types GLshort A[10].OpenGL Data Types To make it easier to convert OpenGL code from one platform to another. short A[10].
GLenum.OpenGL Data Types OpenGL Data Type GLbyte GLshort GLint. GLboolean GLushort GLunit. GLbitfield Representation 8-bit integer 16-bit integer 32-bit integer 32-bit float 64-bit float 8-bit unsigned integer 16-bit unsigned short 32-bit unsigned integer As C Type signed char short long float double unsigned char unsigned short unsigned long . GLsizei GLfloat GLdouble GLubyte.
and how many and what type of arguments that the function takes <Library prefix><Root command><Argument count><Argument type> .OpenGL Function Naming OpenGL functions all follow a naming convention that tells you which library the function is from.
type of arguments gl means OpenGL glu means GLU glut means GLUT f: the argument is float type i: the argument is integer type v: the argument requires a vector .OpenGL Function Naming glColor3f(…) gl library Root command. # of arguments.
Initialize OpenGL state – background color. …… 2. light. Configure GL (and GLUT) – Open window. Register callback functions – Render. View positions. …… 3.Basic OpenGL Coding Framework 1. …… 4. Event processing loop – glutMainLoop() . Display mode. mouse). Interaction (keyboard.
glutInitDisplayMode (GLUT_SINGLE | GLUT_RGB). glutKeyboardFunc ( key ). } 1 2 3 4 . glutCreateWindow (“My First Program"). myinit (). glutDisplayFunc ( display ). glutReshapeFunc ( resize ). argv). 500). glutInitWindowSize (500.A Sample Program void main (int argc. char **argv) { glutInit (&argc. glutMainLoop ().
// display model glutInitWindowSize (500. 500). …… } // window size // create window . // GLUT initialization glutInitDisplayMode (GLUT_SINGLE | GLUT_RGB). glutCreateWindow (“My First Program").1: Initializing & Creating Window Set up window/display you’re going to use void main (int argc. argv). char **argv) { glutInit (&argc.
int height) glutInitWindowPosition(int x.GLUT Initializing Functions • Standard GLUT initialization glutInit (int argc. char ** argv) • Display model glutInitDisplayMode (unsigned int mode) • Window size and position glutInitWindowSize (int width. . int y) • Create window glutCreateWindow (char *name).
1. glColor3f(1.0. glLoadIdentity().0.0. } // background color // line color // followings set up viewing . 0.2: Initializing OpenGL State Set up whatever state you’re going to use void myinit(void) { glClearColor(1.0. 500.0). glMatrixMode(GL_MODELVIEW).0.0). glMatrixMode(GL_PROJECTION). 500. 1. 1. 0. 0.0.0).0.0. gluOrtho2D(0.
etc • GLUT uses a callback mechanism to do its event processing . redraw.Callback Functions • Callback Function Routine to call when something happens .window resize. user input.
GLUT Callback Functions • • • • • • • Contents of window need to be refreshed glutDisplayFunc() Window is resized or moved glutReshapeFunc() Key action glutKeyboardFunc() Mouse button action glutMouseFunc() Mouse moves while a button is pressed glutMotionFunc() Mouse moves regardless of mouse button state glutPassiveMouseFunc() Called when nothing else is going on glutIdleFunc() .
glutKeyboardFunc ( key ). char **argv) { …… glutDisplayFunc ( display ).3: Register Callback Functions Set up any callback function you’re going to use void main (int argc. glutReshapeFunc ( resize ). // display callback // window resize callback // keyboard callback …… } .
0. glClear(GL_COLOR_BUFFER_BIT).0}}. int rand(). k. for( k=0.0}. 0. {500.0. k<5000.0.Rendering Callback It’s here that does all of your OpenGL rendering void display( void ) { typedef GLfloat point2[2]. 0. k++) …… } . point2 vertices[3]={{0. {250. j. 500.0}. int i.
…… display(). h). w. 0.Window Resize Callback It’s called when the window is resized or moved void resize(int w. int h) { glViewport(0. } . glLoadIdentity(). glMatrixMode(GL_PROJECTION).
Keyboard Input Callback It’s called when a key is struck on the keyboard void key( char mkey. …… } . break. int x. int y ) { switch( mkey ) { case ‘q’ : exit( EXIT_SUCCESS ).
Event Process Loop This is where your application receives events. } . char **argv) { …… glutMainLoop(). and schedules when callback functions are called void main (int argc.
Let’s go Inside • OpenGL API – Geometric Primitives – Color Mode – Managing OpenGL’s State – Transformations – Lighting and shading – Texture mapping .
RGBA. size. line. Z-buffering. Color index • Materials lighting and shading – Accurately compute the color of any point given the material properties • Buffering – Double buffering. Accumulation buffer • Texture mapping …… . or image • Transformation – Rotation. perspective in 3D coordinate space • Color mode – RGB. polygon.OpenGL API Functions • Primitives – A point. bitmap.
Geometric Primitives GL_POINTS GL_LINES GL_LINE_STRIP GL_LINE_LOOP GL_POLYGON GL_QUADS GL_TRIANGLES GL_TRIANGLE_FAN All geometric primitives are specified by vertices .
Geometry Commands • glBegin(GLenum type) marks the beginning of a vertex-data list that describes a geometric primitives • glEnd (void) marks the end of a vertex-data list • glVertex*(…) specifies vertex for describing a geometric object .
Specifying Geometric Primitives glBegin( type ). type determines how vertices are combined . glVertex*(…). …… glVertex*(…). glEnd().
0.1 ). glVertex2f ( 0.Example void drawSquare (GLfloat *color) { glColor3fv ( color ).0 ). glVertex2f ( 1.0 ).1.0. glEnd(). } . glVertex2f ( 0. glVertex2f ( 1. 0. 1. glBegin(GL_POLYGON). 1.0 ).0.0.
shading.Primitives and Attributes • Draw what… – Geometric primitives • points. lines and polygons • How to draw… – Attributes • colors. texturing. . lighting. etc.
it uses data stored in its internal attribute tables to determine how the vertex should be transformed. rendered or any of OpenGL’s other modes .Attributes • An attribute is any property that determines how a geometric primitives is to be rendered • Each time. OpenGL processes a vertex.
glEnd(). 5.0). 1. glVertex2f(25. glBegin(GL_LINE).0. 5.0. 0.0. glVertex2f(5. .0. glColor3f(0. 1.0.0).0).0).0). 1. 1.0. glShadeModel(GL_SMOOTH).Example glPointSize(3.0. glColor4f(1.
OpenGL has no command to control .OpenGL Color • There are two color models in OpenGL – RGB Color (True Color) – Indexed Color (Color map) • The type of window color model is requested from the windowing system.
Color Cube Three color theory C = T1*R + T2*G + T3* B .
each pixel’s color is independent of each other . B components are stored for each pixel • With RGB mode.RGB Color • R. G.
RGB Color Red Green Blue .
How Many Colors?
Color number = 2
color_depth
For example: 4-bit color 24 = 16 colors 8-bit color 8 2 = 256 colors 24-bit color 24 2 = 16.77 million colors
How Much Memory?
Buffer size = width * height *color depth
For example: If width = 640, height = 480, color depth = 24 bits Buffer size = 640 * 480 * 24 = 921,600 bytes If width = 640, height = 480, color depth = 32 bits Buffer size = 640 * 480 * 32 = 1,228,800 bytes
Alpha Component
Alpha value A value indicating the pixels opacity
Zero usually represents totally transparent and the maximum value represents completely opaque
Alpha buffer
Hold the alpha value for every pixel Alpha values are commonly represented in 8 bits, in which case transparent to opaque ranges from 0 to 255
RGB Color Commands
• glColor*(…) specifies vertex colors
• glClearColor(r, g, b, a)
sets current color for cleaning color buffer
• glutInitDisplayMode(mode)
specify either an RGBA window (GLUT_RGBA ), or a color indexed window (GLUT_INDEX )
1.0.0 ).0 ). glVertex2f ( 0. glClearColor(1.0. } . 1.0). 0.0. 0. void drawLine (GLfloat *color) { glColor3fv ( color ).0. glVertex2f ( 1.0. glEnd().Example glutInitDisplayMode (GLUT_RGBA). glBegin(GL_LINE). 1.
each pixel with same index stored in its bit-planes shares the same color-map location . color-index mode was important because it required less memory • Use Color-map (lookup table) • With color-index mode.Indexed Color • Historically.
Color Lookup Table Index 0 1 … 253 254 255 8 bits 8 bits 8 bits Red 0 120 … Green 0 123 … Blue 0 187 … .
RGBA vs. Color Index Mode Color index model Index 0 1 2 254 255 … … … … R 0 120 G 0 123 B 0 187 RGBA model .
.Color Index Commands • glIndex*(…) specifies vertex colors • glClearIndex(Glfloat index) sets current color for cleaning color buffer. GLfloat r. GLfloat b ) sets the entries in a color table for window. GLfloat g. • glutSetColor(int color.
128) Gray (255.Shading Model Green Red Blue (0. 128. 255) White . 0) Black (128. 255. 0.
Shading Model Green Red Blue A triangle in RGB color space Smooth shading in OpenGL .
The colors of interior pixels are interpolated. Smooth shading: the color at each vertex is treated individually. The mode parameter can be GL_SMOOTH (the default) or GL_FLAT. Flat shading: the color of one particular vertex of an independent primitive is duplicated across all the primitive’s vertices to render that primitive. .Shading Model Commands • glShadeModel(mode) set the shading mode.
all rendering attributes are encapsulated in the OpenGL State – rendering styles – color – shading – lighting – texture mapping .OpenGL’s State Machine In OpenGL.
texturing Attributes • Controlling State Functions – glEnable(…) – glDisable(…) .normal -.OpenGL’s State Management • Setting Vertex Attributes – – – – – glPointSize(.color -.line width -.) glLineWidth(…) glColor*(…) glNormal*(…) glTexCoord*(…) -.point size -...
– GL_LIGHTING – GL_DEPTH_TEST – GL_SHADE_MODEL – GL_LINE_STIPPLE …… .Controlling State Functions • OpenGL has many states and state variables can be changed to control rendering Ex.
These states can be turn on/off by using: • glEnable (Glenum state) turn on a state • glDisable (Glenum state) turn off a state .Controlling State Functions • By default. most of the states are initially inactive.
0). glVertex2f(5.0.0).0. glColor3f(0. 5. glDisable(GL_LIGHTING). 1. 5.Example glEnable(GL_LIGHTING). 0. glEnd(). glBegin(GL_LINE). 1. glShadeModel(GL_SMOOTH). .0.0). 1.0.0.0). glColor3f(1.0. glVertex2f(25.
OpenGL Transformations Model View position (eyepoint) View direction .
Graphics Pipeline Object Object Coordinates Transformation Object -> World Transformation World -> Viewport Clipping Screen Coordinates World World Coordinates Viewport Viewport Coordinates Rasterization Scan Converting Triangles .
Adjust camera .Position camera .Produce photograph .Camera Analogy The graphics transformation process is analogous to taking a photograph with a camera .Place objects .
Transformations and Camera Analogy
• Viewing transformation
– Positioning and aiming camera in the world.
• Modeling transformation
– Positioning and moving the model.
• Projection transformation
– Adjusting the lens of the camera.
• Viewport transformation
– Enlarging or reducing the physical photograph.
OpenGL Transformation Pipeline
Transformations in OpenGL
• Transformations are specified by matrix operations. Desired transformation can be obtained by a sequence of simple transformations that can be concatenated together. • Transformation matrix is usually represented by 4x4 matrix (homogeneous coordinates). • Provides matrix stacks for each type of supported matrix to store matrices.
. we often have objects specified in their own coordinate systems and must use transformations to bring the objects into the scene.Programming Transformations • In OpenGL. the transformation matrices are part of the state. • OpenGL provides matrix stacks for each type of supported matrix (model-view. projection. texture) to store matrices. they must be defined prior to any vertices to which they are to apply. • In modeling.
Steps in Programming • Define matrices: – Viewing/modeling. projection. viewport … • Manage the matrices – Including matrix stack • Composite transformations .
Transformation Matrix Operation • Current Transformation Matrix (CTM) – The matrix that is applied to any vertex that is defined subsequent to its setting. • CTM is a 4 x 4 matrix that can be altered by a set of functions. . • If change the CTM. we change the state of the system.
Current Transformation Matrix The CTM can be set/reset/modify (by postmultiplication) by a matrix Ex: C <= M C <= CT C <= CS C <= CR // set to matrix M // post-multiply by T // post-multiply by S // post-multiply by R .
which becomes the new CTM. C <= CT. C <= CR. • CTM contains the cumulative product of multiplying transformation matrices. C <= CS C=MTRS . the result.Current Transformation Matrix • Each transformation actually creates a new matrix that multiplies the CTM. Ex: If Then C <= M.
Viewing-Modeling Transformation • If given an object. and I want to render it from a viewpoint. . what information do I have to have? – Viewing position – Which way I am looking at – Which way is “up” …..
T x z x z Camera • Translation • Rotation .Viewing Position y y R.
eyey. atz) y .Where I am and Looking at y View-up vector (upx. aty. upy. eyez) x Model Loot at (atx. upz) x z z Eyepoint (eyex.
looking down the negative z-axis +Z +X .Define Coordinate System +Y In the default position. the camera is at the origin.
upx. atx. eyey. atz. . eyez. upy. aty.If we use OpenGL • Look-At Function gluLookAt (eyex. upz ) Define a viewing matrix and multiplies it to the right of the current matrix.
glMultMatrix ) – Specify operations ( glRotate. glTranslate ) .Ways to Specify Transformations • In OpenGL. we usually have two styles of specifying transformations: – Specify matrices ( glLoadMatrix.
Specifying Matrix • • • • Specify current matrix mode Modify current matrix Load current matrix Multiple current matrix .
mode: GL_MODELVIEW GL_PROJECTION .Specifying Matrix (1) • Specify current matrix mode glMatrixMode (mode) Specified what transformation matrix is modified.
Specifying Matrix (2) • Modify current matrix glLoadMatrix{fd} ( Type *m ) Set the 16 values of current matrix to those specified by m. Note: m is the 1D array of 16 elements arranged by the columns of the desired matrix .
Specifying Matrix (3) • Modify current matrix glLoadIdentity ( void ) Set the currently modifiable matrix to the 4x4 identity matrix. .
and stores the result as current matrix.Specifying Matrix (4) • Modify current matrix glMultMatrix{fd} ( Type *m ) Multiple the matrix specified by the 16 values pointed by m by the current matrix. Note: m is the 1D array of 16 elements arranged by the columns of the desired matrix .
Specifying Operations • Three OpenGL operation routines for modeling transformations: – Translation – Scale – Rotation .
s z) ⎢ 0 ⎢ ⎣0 0 1 0 0 0 sy 0 0 0 0 1 0 d x⎤ ⎥ d y⎥ d z⎥ ⎥ 1⎦ 0 0 sz 0 0⎤ ⎥ 0⎥ 0⎥ ⎥ 1⎦ Translation: Scale: . s y . dy .Recall • Three elementary 3D transformations ⎡1 ⎢ ⎢0 T ( dx. d z ) = ⎢ 0 ⎢ ⎣0 ⎡sx ⎢ 0 =⎢ S (sx .
Recall Rotation Rx (θ ) ⎡1 0 0 ⎢ ⎢0 cosθ − sin θ Rx (θ ) = ⎢0 sin θ cosθ ⎢ 0 0 ⎣0 ⎡ cosθ ⎢ ⎢ 0 Ry(θ ) = ⎢− sin θ ⎢ ⎣ 0 0 sin θ 1 0 0 cosθ 0 0 0 0 1 0 0⎤ ⎥ 0⎥ 0⎥ ⎥ 1⎦ 0⎤ ⎥ 0⎥ 0⎥ ⎥ 1⎦ 0⎤ ⎥ 0⎥ 0⎥ ⎥ 1⎦ Rotation Ry (θ ) Rotation Rz (θ ) ⎡cosθ − sin θ ⎢ ⎢ sin θ cosθ Rz (θ ) = ⎢ 0 0 ⎢ 0 ⎣ 0 .
. y. TYPE y. z. TYPE z) Multiplies the current matrix by a matrix that translates an object by the given x.Specifying Operations (1) • Translation glTranslate {fd} (TYPE x.
. TYPE y.Specifying Operations (2) • Scale glScale {fd} (TYPE x. y. TYPE z) Multiplies the current matrix by a matrix that scales an object by the given x. z.
TYPE z) Multiplies the current matrix by a matrix that rotates an object in a counterclockwise direction about the ray from origin through the point by the given x. TYPE y. TYPE x. The angle parameter specifies the angle of rotation in degree.Specifying Operations (3) • Rotate glRotate {fd} (TPE angle. y. z. .
0. 6.Example Let’s examine an example: – Rotation about an arbitrary point Question: Rotate a object for a 45. . 2.0. 5. 3.0).0.0-degree about the line through the origin and the point (1.0.0) with a fixed point of (4.
Rotate about the origin through angle θ.0. T(-4.0.0.0) 3.0. -5.0) 2. R(45.Rotation About an Arbitrary Point 1. -6.0) M = T(V ) R(θ ) T(-V ) . 5. Translate object through vector –V. 6. Translate back through vector V T(4.
0. glTranslatef (4. 5. 3. glRotatef (45. 1. 2.0.0. glLoadIdentity ().0. . 6.0). -6.0.0.0).0.0). -5. glTranslatef (-40.OpenGL Implementation glMatrixMode (GL_MODEVIEW).
the transformation specified most recently is the one applied first.Order of Transformations • The transformation matrices appear in reverse order to that in which the transformations are applied. . • In OpenGL.
-6.0.0.0.0.0. -5.0) Write it Read it .0) C <= CR(45. 1. -6. 6. 6.Order of Transformations • In each step: C <= I C <= CT(4.0.0.0) CR(45. 2.0. 5.0.0. -5. 1.0) • Finally C = T(4. 3.0. 2. 5.0. 3.0) CT(-4.0) C < = CT(-4.
then translate => First translate.Matrix Multiplication is Not Commutative First rotate. then rotate => .
Matrix Stacks • OpenGL uses matrix stacks mechanism to manage transformation hierarchy. • OpenGL provides matrix stacks for each type of supported matrix to store matrices. – Model-view matrix stack – Projection matrix stack – Texture matrix stack .
Pushing Popping Top • • Bottom .Matrix Stacks • Current matrix is always the topmost matrix of the stack We manipulate the current matrix is that we actually manipulate the topmost matrix. We can control the current matrix by using push and pop operations.
so its contents are duplicated in both the top and second-from-the top matrix. Note: current stack is determined by glMatrixModel() .Manipulating Matrix Stacks (1) • Remember where you are glPushMatrix ( void ) Pushes all matrices in the current stack down one level. The topmost matrix is copied.
Manipulating Matrix Stacks (2) • Go back to where you were glPopMatrix ( void ) Pops the top matrix off the stack. destroying the contents of the popped matrix. What was the second-from-the top matrix becomes the top matrix. Note: current stack is determined by glMatrixModel() .
Manipulating Matrix Stacks (3) • The depth of matrix stacks are implementation-dependent. glGetIntegerv ( Glenum pname. • The Projection matrix stack is guaranteed to be at least 2 matrices deep. Glint *parms ) Pname: GL_MAX_MODELVIEW_STACT_DEPTH GL_MAX_PROJECTION_STACT_DEPTH . • The Modelview matrix stack is guaranteed to be at least 32 matrices deep.
Projection Transformation • Projection & Viewing Volume • Projection Transformation • Viewpoint Transformation .
0) (50. 0) Positive X Remember: the Y coordinates of OpenGL screen is the opposite of Windows screen. . 50) Y Positive (0.OpenGL and Windows Screen Windows Screen Mapping (0. 50) OpenGL Screen Mapping Y Positive X Positive (50. But same as in the XWindows system.
Orthographic Projection • Vertexes of an object are projected towards infinity • Points projected outside view volume are clipped out • Distance does not change the apparent size of an object Image Clipped out .
Orthographic Viewing Volume Clipped out top left right Bottom Near-plane Far-plane Viewing rectangle Viewing volume .
zFar ) Creates a matrix for an orthographic viewing volume and multiplies the current matrix by it • gluOrtho2D( left. right. bottom. bottom. right.Orthographic Projection Commands • glOrtho( left. top. top ) Creates a matrix for projecting 2D coordinates onto the screen and multiplies the current matrix by it . zNear.
gluOrtho2D(0. 500.Orthographic Projection (Example) Define a 500x500 viewing rectangle with the lower-left corner of the rectangle at the origin of the 2D system glMatrixMode(GL_PROJECTION) glLoadIdentity(). .0.0. glMatrixMode(GL_MODELVIEW). 500.0).0. 0.
Perspective Projection Volume y aspect ratio = w/h w z fovy x Near-plane: zNear Far-plane: zNear h Viewing volume .
. zFar ) Creates a matrix for a perspective viewing frustum and multiplies the current matrix by it.Perspective Projection Commands glFrustum( left. right. top. zNear. bottom.
zNear. Note: fovy is the field of view (fov) between the top and bottom planes of the clipping volume.Perspective Projection Commands gluPerspective( fovy. aspect. aspect is the aspect ratio . zFar ) Creates a matrix for an perspective viewing frustum and multiplies the current matrix by it.
Image-space check .Requires a depth or z buffer to store the information as polygons are rasterized Viewpoint z1 z2 .Hidden-Surface Removal z-buffer algorithm .The worst-case complexity is proportional to the number of polygons .
Hidden-Surface Removal glEnable(GL_DEPTH_TEST) glDisable(GL_DEPTH_TEST) Enable/disable z (depth) buffer for hiddensurface removal .
Remember to Initialize glutInitDisplayMode(GLUT_DOUBLE|GLUT_RBG|GLUT_DEPTH). You can also clear the depth buffer (as we did for color buffer) glClear(GL_DEPTH_BUFFER_BIT) Clear z (depth) buffer .
Viewing a 3D world View up Aspect Ratio = ViewRight ViewUp View right .
which reflect the position of pixels on the screen related to the lower-left corner of the window . it is set to the entire rectangle of the window that is opened – Measured in the window coordinates.Viewpoint • Viewpoint – The region within the window that will be used for drawing the clipping area – By default.
Viewpoint Transformation h w w A viewpoint is defined as half the size of the window A viewpoint is defined as the same size as the window h .
Aspect Ratio = width/height • Viewport aspect ratio should be same as projection transformation.Aspect Ratio • The Aspect Ratio of a rectangle is the ratio of the rectangle’s width to its height: e. .g. or resulting image may be distorted.
Viewpoint Commands • glViewport( x. height) specifies the size of the viewport rectangle . height ) Defines a pixel rectangle in the window into which the final image is mapped (x. y. width. y) specifies the lower-left corner of the viewport (width.
characterized by a narrow range of angles through which light is emitted. • Ambient light . Light rays usually emanate in specific directions. regardless of location of light and object. • Distributed light source .Lighting • Point light source . It represents the approximate contribution of the light to the general scene.approximates the light source as a 3D object. Light rays emanate in all directions.provide uniform illumination throughout the environment.approximates the light source as a 3D point in space. • Spotlights . (Background Light) .
Light Model • Ambient The combination of light reflections from various surfaces to produce a uniform illumination. the viewing angle. . Proportional to the “amount of light” that hits the surface. • Diffuse Uniform light scattering of light rays on a surface. • Sepecular Light that gets reflected. and the surface normal. Depends on the light ray. Background light. Depends on the surface normal and light vector.
Light Model • Light at a pixel from a light = Ambient + Diffuse + Specular Ilight = Iambient + Idiffuse + Ispecular I light = k a La + lights−1 ∑ l =0 ns f (dl ) [ k d Lld (L ⋅ N )+ k s Lls (R ⋅ V ) ] .
linearly interpolate the normals. – With the interpolated normal at each pixel. calculate the lighting at each pixel .Shading • Flat Shading – Calculate one lighting calculation (pick a vertex) per triangle – Color the entire triangle the same color • Gouraud Shading – Calculate three lighting calculations (the vertices) per triangle – Linearly interpolate the colors as you scan convert • Phong Shading – While do scan convert.
Lighting in OpenGL • OpenGL supports the four types of light sources. • OpenGL allows at least eight light sources set in a program. • We must specify and enable individually (as exactly required by the Phong model) .
position. and enable one or more light sources. • Don’t forget to Enable/disable lighting. . • Create. • Define material properties for the objects in the scene.Steps of Specifying Lighting • Define normal vectors for each vertex of every object. • Select a lighting model.
GL_light1. . pname indicates the properties of light that will be specified with param.Creating Light Sources • Define light properties – color. TYPE param) Create the light specified by light. position.…GL_light7. and direction glLight*(Glenum light. which can be GL_light0. Glenum pname.
glEnable(GL_LIGHT0). glLightfv (GL_LIGHT0. GL_AMBIENT. 1. 0.Creating Light Sources • Color GLfloat light_ambient[] = {0.0. 1. lgiht_ambient).0. glEnable(GL_LIGHT1).0).0.0). 1.0. lgiht_diffuse). glLightfv (GL_LIGHT1.0. 1. 1. . GLfloat lght_diffuse[] = {1. GL_DIFFUSE.0.
glEnable(GL_LIGHT0). 0.0. .0.0. 0. spot_dir). glLightfv (GL_LIGHT0.Creating Light Sources • Position GLfloat light_position[] = {1. GL_POSITION. glEnable(GL_LIGHT1). 1. lgiht_position).0). -1. glLightfv (GL_LIGHT1.0). GLfloat spot_dir[] = {-1. GL_SPOT_DIRECTION. 1.0.0.
In other word. a light source is subject to the same matrix transformations as a primitives. – A light position that remains fixed – A light that moves around a stationary object – A light that moves along with the viewpoint .Creating Light Sources • Controlling a Light’s Position and Direction OpenGL treats the position and direction of a light source just as it treats the position of a geometric primitives.
– Whether lighting calculations should be performed differently for both the front and back faces of objects. . glLightModel*(Glenum pname. – Whether the viewpoint position is local to the scene or whether it should be considered to be infinite distance away. TYPE param) Sets properties of the lighting model.Selecting Lighting Model • OpenGL notion of a lighting model has three components: – The global ambient light intensity.
GL_TRUE).Selecting Lighting Model • Global ambient light GLfloat lmodel_ambient[] = {0. .3. GL_TRUE). 0. • Local or Infinite Viewpoint glLightModelfi (GL_LIGHT_MODEL_LOCAL_VIEWER.2. • Two-sided Lighting glLightModelfi (GL_LIGHT_MODEL_TWO_SIDE.0). glLightModelfv (GL_LIGHT_MODEL_AMBIENT.0. 1. lmodel_ambient). 1.
.Defining Material Properties • OpenGL supports the setting of material properties of objects in the scene – – – – Ambient Diffuse Specular Shininess glMaterial*(Glenum face. TYPE param) Specifies a current material property foe use in lighting calculations. Glenum pname.
OpenGL Image Path .
Texture Mapping in OpenGL • Steps in Texture Mapping – Create a texture object and specify a texture for that object. • Keep in mind that texture mapping works only in RGBA mode. supplying both texture and geometric coordinates. – Enable texture mapping. Texture mapping results in colorindex mode are undefined. – Indicate how the texture is to be applied to each pixel. – Draw the scene. .
const GLvoid *pixels) Note: both width and height must have the form 2m+2b. GLsizei width. GLenum type.Specifying the Texture GLubyte image[rows][cols] void glTexImage2D (GLenum target. GLint level. GLsizei height. . and b is the value of board. GLenum format. where m is nonnegative integer. GLint border. GLint internalFormat.
making their data currently available for rendering texture models. . A texture object stores data and makes it readily available. take these steps: – Generate texture names.1. – Bind and rebind texture objects. • To use texture objects for your texture data.Texture Object • Texture objects are an important new feature since OpenGL 1. – Initially bind (create) texture objects to texture data. including the image arrays and texture properties.
Naming a Texture Object • Any nonzero unsigned integer may be used as a texture name. To avoid accidentally resulting names. void glGenTextures (Glsizei n. GLuint *textureNames) . consistently use glGenTexture() to provide unused texture names.
void glBindTexture (GLenum target. When binding to previously created texture object. glBindTexture(). name). that texture object becomes active. Ex: glBindTexture(GL_TEXTURE_2D.Creating and Using Texture Object • The same routine. both creates and uses texture objects. GLuint textureName) When using it first time. . a new texture object is created.
named by elements in the array textureNames.Cleaning Up Texture Objects void glDeleteTexture (GLsizei n. const GLuint textureNames) Delete n texture object. The freed texture names may now be reused. .
How to control texture mapping and rendering? . TYPE param) Set various parameters that control how a texture is treated as it’s applied or stored in a texture object.Set Texture Parameters void glTexParameter* (GLenum target. GLenum pname.
y) .Texture Mapping Process Object -> Texture Transformation Screen -> Object Transformation (s. t) (u. v) (x.
y) . v) (x.Rendering the Texture • Rendering texture is similar to shading: It proceeds across the surface pixel-by pixel. access the texture. For each pixel. t) (u. (s. t). it must determine the corresponding texture coordinates (s. and set the pixel to the proper texture color.
Combining Lighting and Texturing • There is no lighting involved with texture mapping • They are independent operations. which may be combined • It all depends on how to “apply” the texture to the underlying triangle .
Set Texturing Function void glTexEnv (GLenum target. GL_TEXTURE_ENV_MODE. Ex: glTexEnv(GL_TEXTURE_ENV. GL_BLEND) . We can use directly the texture colors to paint the object. GLenum pname. TYPE param) Set the current texturing function. or use the texture values to modulate or blend the color in the texture map with the original color of object.
Assigning Texture Coordinates void glTexCoord* (TYPE coords) Sets the current texture coordinates. 1). glTexCoord2f (1. 0). glVertex2f (10. Subsequent calls to glVertex*() result in those vertices being assigning the current texture coordinates. 5). 1). 0. 5). 0). glTexCoord2f (0. 10. . 0. glTexCoord2f (1. 10. } glVertex2f (0. 5). glBegin(GL_QUAN) { glTexCoord2f (0. glVertex2f (10. 5). glVertex2f (0.
Remember to Enable Texture glEnable (GL_TEXTURE_2D) glDisable (GL_TEXTURE_2D) Enable/disable texture mapping .
GL_Q . TYPE param Specifies the function for automatically generating texture coordinates.Automatic Texture-Coordinate Generation • OpenGL can automatically generate texture coordinate for you. GL_T. GL_R. void glTexGen* (GLenum coord. GLenum pname. coord: GL_S.
Thus we don’t have enough pixels to accurately represent the underlying function. • Three reasons – Pixel numbers are fixed in the frame buffer – Pixel locations are fixed on a uniform – Pixel size/shape are fixed • How do we fix it? – Increase resolution – Filtering .Recall Aliasing • Aliasing manifests itself as “jaggies” in graphics.
Increase Rendering Resolution • Render the image at a higher resolution and downsample (like you are letting your eye do some filtering). .
each smaller and filtered from the original.Mip Mapping • MIP .multium in parvo .many in a small place. • Build a pyramid of images. .
GL_RGBA. glTexParameteri( GL_TEXTURE_2D. width. height. GL_RGBA. image).Mipmapping • Thus as we render. • OpenGL supports mipmapping gluBuild2DMipmaps(GL_TEXTURE_2D. GL_TEXTURE_MIN_FILTER. GL_LINEAR_MIPMAP_LINEAR). GL_UNSIGNED_BYTE. we choose the texture that best “fits” what you are drawing. .
Bump Mapping • We can also use textures for so much more than just images! • We can use the textures as a “road map” on how to perturb normals across a surface. perturb the normal by the partial derivatives of the corresponding s. • As we shade each pixel. t in the bump map. .
• We can extend our mapping techniques to obtain an image that approximates the desired reflection by extending texture maps to environmental (reflection) maps.Environmental Mapping • Highly reflective surface are characterized by specular reflections that mirror the environment. .
(2) Map the intermediate surface to the surface being rendered.Environmental Mapping • Two-pass texture mapping (1) Map the texture to a 3D intermediate surface. Object in environment Intermediate surface Projected object .
we need to map the texture values on the intermediate surface to the desired surface. n n n .Environmental Mapping • Then.
Now It’s Your Turn • Find a good reference/book • Play with an example • Make your own code Computer graphics is best learned by doing! .
Sign up to vote on this title
UsefulNot useful
|
__label__pos
| 0.760124 |
Logo
Programming-Idioms
This language bar is your friend. Select your favorite languages!
Select your favorite languages :
• Or search :
Idiom #75 Compute LCM
Compute the least common multiple x of big integers a and b. Use an integer type able to handle huge numbers.
x = lcm a b
#include <gmp.h>
mpz_t _a, _b, _x;
mpz_init_set_str(_a, "123456789", 10);
mpz_init_set_str(_b, "987654321", 10);
mpz_init(_x);
mpz_lcm(_x, _a, _b);
gmp_printf("%Zd\n", _x);
#include <numeric>
auto x = std::lcm(a, b);
int gcd(int a, int b)
{
while (b != 0)
{
int t = b;
b = a % t;
a = t;
}
return a;
}
int lcm(int a, int b)
{
if (a == 0 || b == 0)
return 0;
return (a * b) / gcd(a, b);
}
int x = lcm(140, 72);
import std.numeric: gcd
uint x = (a * b) / gcd(a, b);
x = lcm(a, b);
int lcm(int a, int b) => (a * b) ~/ gcd(a, b);
int gcd(int a, int b) {
while (b != 0) {
var t = b;
b = a % t;
a = t;
}
return a;
}
defmodule BasicMath do
def gcd(a, 0), do: a
def gcd(0, b), do: b
def gcd(a, b), do: gcd(b, rem(a,b))
def lcm(0, 0), do: 0
def lcm(a, b), do: (a*b)/gcd(a,b)
end
gcd(A,B) when A == 0; B == 0 -> 0;
gcd(A,B) when A == B -> A;
gcd(A,B) when A > B -> gcd(A-B, B);
gcd(A,B) -> gcd(A, B-A).
lcm(A,B) -> (A*B) div gcd(A, B).
import "math/big"
gcd.GCD(nil, nil, a, b)
x.Div(a, gcd).Mul(x, b)
const gcd = (a, b) => b === 0 ? a : gcd (b, a % b)
let x = (a * b) / gcd(a, b)
import java.math.BigInteger;
BigInteger a = new BigInteger("123456789");
BigInteger b = new BigInteger("987654321");
BigInteger x = a.multiply(b).divide(a.gcd(b));
(setf x (lcm a b))
extension=gmp
$gcd = gmp_lcm($a, $b);
echo gmp_strval($gcd);
sub lcm {
use integer;
my ($x, $y) = @_;
my ($f, $s) = @_;
while ($f != $s) {
($f, $s, $x, $y) = ($s, $f, $y, $x) if $f > $s;
$f = $s / $x * $x;
$f += $x if $f < $s;
}
$f
}
sub gcd {
my ($x, $y) = @_;
while ($x) { ($x, $y) = ($y % $x, $x) }
$y
}
sub lcm {
my ($x, $y) = @_;
($x && $y) and $x / gcd($x, $y) * $y or 0
}
from math import gcd
x = (a*b)//gcd(a, b)
x = a.lcm(b)
extern crate num;
use num::Integer;
use num::bigint::BigInt;
let x = a.lcm(&b);
New implementation...
deleplace
|
__label__pos
| 0.997097 |
Skip to navigation
Elite on the BBC Micro
Drawing circles: TT14 [Disc version, Flight]
Name: TT14 [Show more] Type: Subroutine Category: Drawing circles Summary: Draw a circle with crosshairs on a chart
Context: See this subroutine in context in the source code Variations: See code variations for this subroutine in the different versions References: This subroutine is called as follows: * TT22 calls TT14 * TT23 calls TT14
Draw a circle with crosshairs at the current system's galactic coordinates.
.TT126 LDA #104 \ Set QQ19 = 104, for the x-coordinate of the centre of STA QQ19 \ the fixed circle on the Short-range Chart LDA #90 \ Set QQ19+1 = 90, for the y-coordinate of the centre of STA QQ19+1 \ the fixed circle on the Short-range Chart LDA #16 \ Set QQ19+2 = 16, the size of the crosshairs on the STA QQ19+2 \ Short-range Chart JSR TT15 \ Draw the set of crosshairs defined in QQ19, at the \ exact coordinates as this is the Short-range Chart LDA QQ14 \ Set K to the fuel level from QQ14, so this can act as STA K \ the circle's radius (70 being a full tank) JMP TT128 \ Jump to TT128 to draw a circle with the centre at the \ same coordinates as the crosshairs, (QQ19, QQ19+1), \ and radius K that reflects the current fuel levels, \ returning from the subroutine using a tail call .TT14 LDA QQ11 \ If the current view is the Short-range Chart, which BMI TT126 \ is the only view with bit 7 set, then jump up to TT126 \ to draw the crosshairs and circle for that view \ Otherwise this is the Long-range Chart, so we draw the \ crosshairs and circle for that view instead LDA QQ14 \ Set K to the fuel level from QQ14 divided by 4, so LSR A \ this can act as the circle's radius (70 being a full LSR A \ tank, which divides down to a radius of 17) STA K LDA QQ0 \ Set QQ19 to the x-coordinate of the current system, STA QQ19 \ which will be the centre of the circle and crosshairs \ we draw LDA QQ1 \ Set QQ19+1 to the y-coordinate of the current system, LSR A \ halved because the galactic chart is half as high as STA QQ19+1 \ it is wide, which will again be the centre of the \ circle and crosshairs we draw LDA #7 \ Set QQ19+2 = 7, the size of the crosshairs on the STA QQ19+2 \ Long-range Chart JSR TT15 \ Draw the set of crosshairs defined in QQ19, which will \ be drawn 24 pixels to the right of QQ19+1 LDA QQ19+1 \ Add 24 to the y-coordinate of the crosshairs in QQ19+1 CLC \ so that the centre of the circle matches the centre ADC #24 \ of the crosshairs STA QQ19+1 \ Fall through into TT128 to draw a circle with the \ centre at the same coordinates as the crosshairs, \ (QQ19, QQ19+1), and radius K that reflects the \ current fuel levels
|
__label__pos
| 0.72948 |
hpjwinauth.dll
Application using this process: Unknown
hpjwinauth.dll
Application using this process: Unknown
What is hpjwinauth.dll doing on my computer?
hpjwinauth.dll is a module Non-system processes like hpjwinauth.dll originate from software you installed on your system. Since most applications store data in your system's registry, it is likely that over time your registry suffers fragmentation and accumulates invalid entries which can affect your PC's performance. It is recommended that you check your registry to identify slowdown issues.
hpjwinauth.dll
In order to ensure your files and data are not lost, be sure to back up your files online. Using a cloud backup service will allow you to safely secure all your digital files. This will also enable you to access any of your files, at any time, on any device.
Is hpjwinauth.dll harmful?
hpjwinauth.dll is unrated
Can I stop or remove hpjwinauth.dll?
Most non-system processes that are running can be stopped because they are not involved in running your operating system. Scan your system now to identify unused processes that are using up valuable resources. hpjwinauth.dll is used by 'Unknown'.This is an application created by 'Unknown'. To stop hpjwinauth.dll permanently uninstall 'Unknown' from your system. Uninstalling applications can leave invalid registry entries, accumulating over time. Run a free scan to find out how to optimize software and system performance.
Is hpjwinauth.dll CPU intensive?
This process is not considered CPU intensive. However, running too many processes on your system may affect your PC’s performance. To reduce system overload, you can use the Microsoft System Configuration Utility to manually find and disable processes that launch upon start-up. Alternatively, download PC Mechanic to automatically scan and identify any PC issues.
Why is hpjwinauth.dll giving me errors?
Process related issues are usually related to problems encountered by the application that runs it. A safe way to stop these errors is to uninstall the application and run a system scan to automatically identify any PC issues.
Process Library is the unique and indispensable process listing database since 2004 Now counting 140,000 processes and 55,000 DLLs. Join and subscribe now!
System Tools
SpeedUpMyPC
PC Mechanic
Toolbox
ProcessQuicklink
|
__label__pos
| 0.928236 |
WordPress评论回复邮件通知勾选框美化
WordPress 3 年前 2条评论
, , ,
先看看效果图：
WordPress评论回复邮件通知勾选框美化
WordPress评论回复邮件通知勾选框美化
首先将邮件回复html部分进行结构调整至如下形式，主要就是外层盒子加上mail-notify类，而input标签加上“notify”类。
<span class="mail-notify">
<input type="checkbox" name="comment_mail_notify" id="comment_mail_notify" value="comment_mail_notify" checked="checked" class="notify" />
<label for="comment_mail_notify"><span>有人回复时邮件通知我</span></label>
</span>
然后在样式表中添加如下样式
/** 评论回复邮件通知 **/
.mail-notify {
padding-left: 10px;
font-size: 14px;
vertical-align: middle;
}
.mail-notify span {
position: absolute;
top: -3px;
left: 0;
width: 230px;
color: #999;
padding-left: 38px;
padding-left: 5px\9;
}
.notify {
display: none;
display: inline\9;
}
.notify + label {
position: relative;
background: #a5a5a5;
width: 30px;
width: 0\9;
height: 15px;
cursor: pointer;
display: inline-block;
border-radius: 15px;
}
.notify + label:before {
content: '';
position: absolute;
background: #fff;
top: 0;
left: -1px;
width: 15px;
width: 0\9;
height: 15px;
z-index: 99999;
border: 1px solid #ddd;
border-radius: 15px;
border: none\9;
}
.notify + label:after {
content: '';
position: absolute;
top: 0;
left: 0;
color: #fff;
font-size: 9px;
font-size: 0.9rem;
}
.notify:checked + label {
background: rgba(178,34,34,1);
border-radius: 15px;
}
.notify:checked + label:after {
content: '';
left: 6px;
}
.notify:checked + label:before {
content: '';
position: absolute;
z-index: 99999;
left: 15px;
border-radius: 15px;
}
.notify + label:after {
left: 15px;
line-height: 21px;
}
.notify + label:after, .notify + label:before {
-webkit-transition: all 0.1s ease-in;
transition: all 0.1s ease-in;
}
我改下了颜色，可以看本站底下的效果，其他自己发挥把！
本文摘自https://www.yaxi.net/2018-04-27/1777.html
支付宝打赏微信打赏
如果此文对你有帮助，欢迎打赏作者。
2条评论
1. #1
HTML在哪里加啊？
• @check 这个在你需要的位置添加就行，一般都在comments.php文件里，找到提交按钮的位置就差不多了
发表评论
欢迎回来 (打开)
(必填)
|
__label__pos
| 0.988214 |
在 Kubernetes 上部署 TiDB Operator
本文介绍如何在 Kubernetes 上部署 TiDB Operator。
准备环境
TiDB Operator 部署前，请确认以下软件需求：
部署 Kubernetes 集群
TiDB Operator 运行在 Kubernetes 集群，你可以使用 Getting started 页面列出的任何一种方法搭建一套 Kubernetes 集群。只要保证 Kubernetes 版本大于等于 v1.12。如果你使用 AWS、GKE 或者本机，下面是快速上手教程：
TiDB Operator 使用持久化卷持久化存储 TiDB 集群数据（包括数据库，监控和备份数据），所以 Kubernetes 集群必须提供至少一种持久化卷。为提高性能，建议使用本地 SSD 盘作为持久化卷。可以根据这一步配置本地持久化卷。
Kubernetes 集群建议启用 RBAC
安装 Helm
参考 使用 Helm 安装 Helm 并配置 PingCAP 官方 chart 仓库。
配置本地持久化卷
准备本地卷
参考本地 PV 配置在你的 Kubernetes 集群中配置本地持久化卷。
安装 TiDB Operator
TiDB Operator 使用 CRD (Custom Resource Definition) 扩展 Kubernetes，所以要使用 TiDB Operator，必须先创建 TidbCluster 自定义资源类型。只需要在你的 Kubernetes 集群上创建一次即可：
kubectl apply -f https://raw.githubusercontent.com/pingcap/tidb-operator/master/manifests/crd.yaml && \
kubectl get crd tidbclusters.pingcap.com
创建 TidbCluster 自定义资源类型后，接下来在 Kubernetes 集群上安装 TiDB Operator。
1. 获取你要安装的 tidb-operator chart 中的 values.yaml 文件：
mkdir -p /home/tidb/tidb-operator && \
helm inspect values pingcap/tidb-operator --version=${chart_version} > /home/tidb/tidb-operator/values-tidb-operator.yaml
注意：
${chart_version} 在后续文档中代表 chart 版本，例如 v1.0.0，可以通过 helm search -l tidb-operator 查看当前支持的版本。
2. 配置 TiDB Operator
TiDB Operator 里面会用到 k8s.gcr.io/kube-scheduler 镜像，如果下载不了该镜像，可以修改 /home/tidb/tidb-operator/values-tidb-operator.yaml 文件中的 scheduler.kubeSchedulerImageNameregistry.cn-hangzhou.aliyuncs.com/google_containers/kube-scheduler
3. 安装 TiDB Operator
helm install pingcap/tidb-operator --name=tidb-operator --namespace=tidb-admin --version=${chart_version} -f /home/tidb/tidb-operator/values-tidb-operator.yaml && \
kubectl get po -n tidb-admin -l app.kubernetes.io/name=tidb-operator
自定义 TiDB Operator
通过修改 /home/tidb/tidb-operator/values-tidb-operator.yaml 中的配置自定义 TiDB Operator。后续文档使用 values.yaml 指代 /home/tidb/tidb-operator/values-tidb-operator.yaml
TiDB Operator 有两个组件：
• tidb-controller-manager
• tidb-scheduler
这两个组件是无状态的，通过 Deployment 部署。你可以在 values.yaml 中自定义资源 limitrequestreplicas
修改为 values.yaml 后，执行下面命令使配置生效：
helm upgrade tidb-operator pingcap/tidb-operator --version=${chart_version} -f /home/tidb/tidb-operator/values-tidb-operator.yaml
|
__label__pos
| 0.531706 |
Can I password-protect my exported data file?
SIMKL offers simple text file formats like .csv and .json for easy access. These files capture your watch history, ratings, and more. While they're convenient, you might want to enhance their security by adding a password layer.
Exporting From SimklWhat data is included in the exported file (e.g., watched episodes, ratings, comments, etc.)?
Adding Password Protection:
Yes, you can indeed password-protect your exported data files from SIMKL. Here's how you can do it:
1. Choose a Compression Software: To password-protect your files, you'll need compression software like WinZip or WinRAR. These tools allow you to create password-protected archives.
2. Create a Compressed Archive: Add your exported data file (.csv or .json) to the compression software. Create a new archive in .zip or .rar format.
3. Add a Password: During the process of creating the archive, you'll be prompted to add a password. Set a strong, unique password that you can remember.
4. Save the Archive: Once you've added the password, save the compressed archive file. This file now contains your exported data, protected by the password you've set.
Finding Additional Information:
For more detailed instructions and guidance on password-protecting archives, you can refer to online resources. A quick search on Google using keywords like "how to password protect archive" will provide you with step-by-step guides and tutorials.
Why Password Protect?
Password-protecting your exported data adds an extra layer of security to your personal information. It ensures that even if someone gains access to your device, they won't be able to access your entertainment tracking data without the password.
While SIMKL provides accessible text file formats for exporting your data, you have the power to enhance the security of these files. By using compression software like WinZip or WinRAR to create password-protected archives, you're adding a safeguard to your exported data. Remember to choose a strong password and consult online resources for detailed instructions. With this added layer of security, you can confidently store and share your exported data while keeping your personal information protected.
Last updated
|
__label__pos
| 0.999177 |
1
$\begingroup$
Given a fixed number of infinite-capacity containers and a list of items of varying weights, how can I best place the items into the containers preserving their original order in a way that minimises the difference between the heaviest and lightest containers?
For example, given 3 containers and 10 items with weights [19, 7, 12, 1, 9, 11, 3, 17, 10, 8] the optimal solution is:
1. 19, 7
2. 12, 1, 9, 11, 3
3. 17, 10, 8
Such that the difference between the heaviest and lightest containers is (12 + 1 + 9 + 11 + 3) - (19 + 7) = 10.
My current algorithm is to:
• calculate the target bin weight as the sum of all item weights divided by the number of containers
• if adding the next item to the active container would bring its weight closer to the target then add it to the active container
• otherwise move to the next container and add the item
• repeat until all items have been placed in containers
This algorithm works well for lists of items of similar weights but doesn't find the best solution when there are one or more very heavy items.
For example, with 4 containers and item weights [3, 8, 2, 4, 8, 2, 27, 20] the above algorithm gives:
• 3, 8, 2, 4
• 8, 2
• 27
• 20
With a weight range of 27 - (8 + 2) = 17.
However the optimal solution is in fact:
• 3, 8, 2
• 4, 8, 2
• 27
• 20
With a weight range of 27 - (3 + 8 + 2) = 14.
How can I find the optimal solution?
$\endgroup$
2
• $\begingroup$ What's the context where you encountered this problem? If you ran across it somewhere, can you credit the source? As far as how to solve it, see cs.stackexchange.com/tags/dynamic-programming/info for the general method. $\endgroup$
– D.W.
Jan 26, 2023 at 6:12
• $\begingroup$ Thanks for your comment @D.W. and for the pointer to dynamic programming, I will take a look. The context is that I'm trying to create a Bible reading plan to read through a book of the Bible in a given number of days. So the containers are days and the items are chapters, e.g. reading the book of Psalms in January there are 31 days and 150 chapters. The chapters range widely in length from Psalm 117 (31 words) to Psalm 119 (2,472 words) and I want the daily word count to vary as little as possible. Hence the need to preserve item order and optimise for the minimum weight range. $\endgroup$
– matkins
Jan 26, 2023 at 14:28
1 Answer 1
1
$\begingroup$
This can be solved with dynamic programming. Let $W[1,\dots,n]$ denote the weights of the items. Fix a value of $\ell$. Define the array $A[\cdot,\cdot]$ as
$A[i,j] = $ the smallest value of $h$ such that there is an allocation of the first $i$ items to the first $j$ containers where the lightest container is $\ge \ell$ and the heaviest container is $\le h$
We have the recursive relation:
$$A[i,j] = \min\{\max(A[i_0,j-1],W[i_0+1]+\dots+W[i]) \mid W[i_0+1]+\dots+W[i] \ge \ell\}$$
This can be used to build a dynamic programming algorithm, which fills in entries of $A[i,j]$ in order of increasing $j$. Then $A[n,m]-\ell$ contains the smallest possible difference between heaviest and lightest containers, assuming the lightest container is $\ell$. Finally, we can repeat this algorithm once per value of $\ell$ (for each $\ell$ in the range $1,2,3,\dots,(W[1]+\dots+W[n])/m)$).
The overall running time will be $O(n^2 S)$, where $S=W[1]+\dots+W[n]$ is the sum of the weights. This might be fast enough if the sum of the weights is not too large. If the sum of weights is very large, you might need a different approach.
$\endgroup$
3
• $\begingroup$ Brilliant, thanks very much! I'll have a go at that and come back to you to accept your answer. $\endgroup$
– matkins
Jan 27, 2023 at 6:46
• $\begingroup$ I'm trying to implement this in Python but I don't completely follow the notation in your recursive relation. Specifically the meaning of $i_0$ and $W[i_0 + 1]$. Could you possibly give me an example of building the algorithm with trivial inputs of e.g. 2 containers and the items [1, 2, 3]? $\endgroup$
– matkins
Feb 2, 2023 at 21:49
• $\begingroup$ @matkins, $i_0$ ranges over all values $i_0:=1,2,\dots,i-1$ such that $W[i_0+1]+\dots + W[I] \ge \ell$. The min is taken over all of the values you obtain by iterating over those values of $i_0$. $\endgroup$
– D.W.
Feb 3, 2023 at 0:53
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.989367 |
Emergency! Help, please!
Discussion in 'Motorola Droid 2 Global' started by OwlD2G, Feb 14, 2011.
1. OwlD2G
Offline
OwlD2G New Member
Joined:
Feb 5, 2011
Messages:
83
Likes Received:
0
Trophy Points:
0
I just noticed an icon on my Droid 2 Global's desktop...and it says 'Emergency Alert'!!! What is this? Please help!
Thank you.
OwlD2G
2. TJConnery
Offline
TJConnery New Member
Joined:
Nov 27, 2009
Messages:
67
Likes Received:
0
Trophy Points:
0
Location:
NYC
Relax
Bloatware. There is an emergency notification app included on the phone. Enter the app, hit settings, and see what types of alerts can be enabled.
3. OwlD2G
Offline
OwlD2G New Member
Joined:
Feb 5, 2011
Messages:
83
Likes Received:
0
Trophy Points:
0
Thanks. It was actually giving me a high wind advisory.
4. TJConnery
Offline
TJConnery New Member
Joined:
Nov 27, 2009
Messages:
67
Likes Received:
0
Trophy Points:
0
Location:
NYC
Weather
That sounds like a weather advisory from weather bug. Did you see the ! sign in your notifications bar or something on the desktop?
You can enable/disable those in the app. They drive my wife crazy so she had me turn them off. For me, they are faster than the weather radio when a thunderstorm/tornado warning is issued, so I leave them on. (and the wx radio is in the pile of discarded devices).
5. OwlD2G
Offline
OwlD2G New Member
Joined:
Feb 5, 2011
Messages:
83
Likes Received:
0
Trophy Points:
0
yup...red triangle with a red exclamation point inside of it
6. TJConnery
Offline
TJConnery New Member
Joined:
Nov 27, 2009
Messages:
67
Likes Received:
0
Trophy Points:
0
Location:
NYC
WxBug
Yup, that's Weatherbug. BTW, we have a high wind warning here also in NYC!
7. TimChgo9
Offline
TimChgo9 New Member
Joined:
Dec 26, 2009
Messages:
410
Likes Received:
0
Trophy Points:
0
Location:
NE Illinois
Around here WeatherBug lags behind the weather radio, for whatever reason. I am sure it's all transmitted at roughly the same time, but I'll get the alert on my phone about a minute or so after the weather radio alert. I keep them active because it's a great way to get weather info if I'm away from the house. For winter weather, our local office doesn't sound the alert so, the Weather Bug is the only way I get Winter Storm Warnings, or Winter Weather Advisories..
Search tags for this page
android turn off emergency alerts
,
cancel emergency notification settings on a droid
,
disable emergency notification android
,
droid emergency notifications
,
emergency code red app for android for verizon
,
emergency notices droid
,
emergency notification on android
,
how to disable emergency alerts on android
,
how to turn off emergency alerts on android
,
how to turn on emergency notifications on droid 4
,
motorla droid 911 assist is turned off
,
what is emergency alert on droid
|
__label__pos
| 0.86166 |
Skip to main content
Conga Support
Convert a Composer Button into a Formula Field Manually for Conductor
To manually convert a Conga Composer button into a formula field:
1. Create a custom formula field on your Master Object with Return Type of Text and label it.
We find it helpful to include the type of delivery method (e.g. download, email, etc.), the template, and the master object in the Label such as, “Conga Conductor Download Simple Proposal Oppty.”
2. Copy the button URL from your working Conga Composer button and paste it in your formula field’s formula window.
https://composer.congamerge.com?sessionId={!API.Session_ID}&serverUrl=
{!API.Partner_Server_URL_130}&id=
{!Opportunity.Id}&TemplateId=a0I80000000laT3&FP0=1&AC0=1&AC1=Invoice+for+{!Opportunity.Name}
Remove the following unnecessary lines:
https://composer.congamerge.com
?sessionId={!API.Session_ID}
&serverUrl={!API.Partner_Server_URL_130}
You should be left with just the &Id parameter and what follows it. For example:
&id={!Opportunity.Id}
&TemplateId=a0I80000000laT3
&FP0=1
&AC0=1
&AC1=Invoice+for+{!Opportunity.Name}
1. Convert the remaining lines into a valid Salesforce formula.
The formula must adhere to the following rules:
"&id="+ Id +
"&TemplateId=a0I80000000laT3" +
"&FP0=1" +
"&AC0=1" +
"&AC1=Invoice+for+" + Name +
• Literal text strings (a.k.a. static text) must be enclosed in quotes (" … ")
• Literal spaces within literal text strings must be replaced with plus signs (+)
• Merge fields from the button must be replaced with the corresponding field available in the formula. For example, {!Opportunity.Id} would be replaced with Id
• Each element (literal text strings and fields) must be joined with the concatenation operator (+) or (&)
2. Append the QMode parameter to indicate how Conga Conductor should deliver the merged output files.
+ "&QMode=Download"
Button URL
Formula
https://composer.congamerge.com
?sessionId={!API.Session_ID} &serverUrl={!API.Partner_Server_URL_130}
&id={!Opportunity.Id}
&TemplateId=a0I80000000laT3
&FP0=1
&AC0=1 &AC1=Invoice+for+{!Opportunity.Name}
"&id=" + Id +"&TemplateId=a0I80000000laT3" + "&FP0=1" + "&AC0=1" +"&AC1=Invoice+for+" + Name +"&QMode=Download"
|
__label__pos
| 0.990352 |
You are previewing iPhoto '09: The Missing Manual.
O'Reilly logo
iPhoto '09: The Missing Manual
Book Description
With iPhoto '09, Apple's popular photo organizer and editing program is better than ever. Unfortunately, intuitive as it may be, iPhoto still has the power to confuse anyone who uses it. That's why more people rely on our Missing Manual than any other iPhoto resource. Author and New York Times tech columnist David Pogue provides clear and objective guidance on every iPhoto feature, including new tools such as face recognition, place recognition based on GPS data, themed slideshows, online sharing, enhanced editing, and travel maps. You'll find step-by-step instructions, along with many undocumented tips and tricks. With iPhoto '09: The Missing Manual, you will:
• Get a course in picture-taking and digital cameras -- how to buy and use a digital camera, how to compose brilliant photos in various situations
• Import, organize, and file your photos -- and learn how to search and edit them
• Create slideshows, photo books, calendars, and greeting cards, and either make or order prints
• Share photos on websites or by email, and turn photos into screensavers or desktop pictures
• Learn to manage your Photo Libraries, use plug-ins, and get photos to and from camera phones
There's much more in this comprehensive guide. Discover today why iPhoto '09: The Missing Manual is the top-selling iPhoto book.
Table of Contents
1. Special Upgrade Offer
2. A Note Regarding Supplemental Files
3. The Missing Credits
1. About the Authors
2. About the Creative Team
3. Acknowledgements
4. The Missing Manual Series
4. Introduction
1. iPhoto Arrives
1. iPhoto Arrives
2. What’s New in iPhoto ’09
2. About This Book
1. About the Outline
2. About→These→Arrows
3. About MissingManuals.com
3. The Very Basics
1. Safari® Books Online
5. I. iPhoto Basics
1. 1. Camera Meets Mac
1. iPhoto: The Application
1. iPhoto Requirements
2. Getting iPhoto
1. Upgrading from earlier versions
3. Running iPhoto for the First Time
2. Getting Your Pictures into iPhoto
1. Connecting with a USB Camera
2. USB Card Readers
3. Importing Photos from Really Old Cameras
4. Importing Existing Graphics Files
5. Internal or External?
6. Dragging into iPhoto
7. Side Doors into iPhoto
8. The File Format Factor
1. RAW
2. Movies
3. Other graphics formats
3. The Post-Import Inspection
4. Where iPhoto Keeps Your Files
1. A Trip to the Library
1. What all those numbers mean
2. Other folders in the iPhoto Library
3. Look, but don’t touch
2. 2. The Digital Shoebox
1. The Source List
1. Library
2. Events
3. Photos
4. Faces
5. Places
6. Recent
7. Shares
8. Subscriptions
9. Albums
10. MobileMe Gallery, Facebook, Flickr
11. Keepsakes
12. Slideshows
2. All About Events
1. The Events List
2. Opening an Event
1. Open to Photos view
2. Open a photo directly
3. Photos View
1. Size Control
2. Sorting Photos
3. Renaming Photos
4. Displaying Event Names
5. Collapsing Events En Masse
6. Creating Events Manually
7. Splitting Events
8. Moving Photos Between Events
9. Merging Events
10. Renaming and Dating Events
11. Scrolling Through Your Photos
4. Selecting Photos
5. Hiding Photos
1. Seeing Hidden Photos
2. Unhiding Photos
6. Three Ways to Open a Photo
1. Method 1: Right in the Window
2. Method 2: Full-Screen Mode
3. Method 3: In Another Program
7. Albums
1. Creating an Empty Album
2. Creating an Album by Dragging
3. Creating an Album by Selecting
4. Adding More Photos
5. Viewing an Album
6. Moving Photos Between Albums
7. Removing Photos from an Album
8. Duplicating a Photo
9. Putting Photos in Order
10. Duplicating an Album
11. Merging Albums
12. Deleting an Album
8. Smart Albums
9. Folders
10. The Info Panel
1. Titles (Renaming Photos)
2. Changing Titles, Dates, or Comments En Masse
3. Photo Dates
4. Description
1. Description as captions
11. Extended Photo Info
12. Deleting Photos
1. The iPhoto Trash
13. Customizing the Shoebox
1. Changing the View
2. Showing/Hiding Keywords, Titles, and Event Info
3. 3. Five Ways to Flag and Find Photos
1. Flagging Photos
1. How to Flag a Photo
2. How to Unflag Photos
3. How to Use Flagged Photos
1. See them all at once
2. Put them into an Event
3. Create a smart album
4. Hide them all at once
5. Move them all to the Trash
2. Searching for Photos by Text
3. The Calendar
4. Keywords
1. Editing Keywords
2. Assigning and Unassigning Keywords
3. Keyboard Shortcuts
4. Viewing Keyword Assignments
5. Using Keywords
5. Ratings
4. 4. Faces and Places
1. Faces
1. Step 1: Analysis
2. Tagging Faces Automatically
3. Tagging Faces Manually
4. Adding More Pictures to a Name
1. Naming Faces Anytime
5. The Payoff
6. Deleting Faces
7. Adding More Details to a Face
8. Organizing the Faces Album
1. Change the key photo
2. Rearrange the order
3. Edit names
2. Places
1. Automatically Geotagging Photos
2. Manually Geotagging Photos
3. Adding Additional Information to a Photo or Event
4. Going Places with Places
1. World view
2. Browser view
5. Places for Your Smart Albums
5. 5. Editing Your Shots
1. Editing in iPhoto
1. Choosing an Editing Window
2. Getting to Your Favorite Editing Window
3. What a Double-Click Does
2. The Toolbar and Thumbnails Browser
3. Notes on Full-Screen Mode
4. Notes on Zooming and Scrolling
1. Zooming in Either Editing View
2. Zooming in Full-Screen View
3. Scrolling Tricks (Any Editing View)
4. The “Before and After” Keystroke
5. Backing Out
5. The Rotate Button
6. Cropping
1. How to Crop a Photo
7. Straightening
8. The Enhance Button
9. Red-Eye
10. Retouching Freckles, Scratches, and Hairs
1. Using the Retouch Brush
11. The Effects Palette
12. The Adjust Panel
13. Introduction to the Histogram
1. Three Channels
2. Adjusting the Levels
14. Exposure
15. Contrast
16. Saturation
17. Highlights and Shadows
18. Definition
19. Sharpness
20. De-noise
21. Color Balance
1. Manual Color Adjustment
2. Automatic Color Correction
22. Copy and Paste
23. Beyond iPhoto
1. The Official Way
2. The Quick-and-Dirty Way
24. Reverting to the Original
25. Editing RAW Files
1. External RAW Editors
2. 16-Bit TIFF Files Instead of JPEGs
6. II. Meet Your Public
1. 6. The iPhoto Slideshow
1. About Slideshows
1. Slideshow Themes
2. Instant Slideshows
1. Selecting a Slideshow Theme
2. What to Do During a Slideshow
3. Music: Soundtrack Central
4. Different Shows, Different Albums
3. Slideshow Settings
1. Slide Timing
2. Transitions
3. Show Caption
4. Show Title Slide
5. Repeat Slideshow
6. Shuffle Slide Order
7. Scale Photos to Fill Screen
8. Picking Photos for Instant Slideshows
9. Photo Order
4. Saved Slideshows
1. Global Settings
1. The Themes dialog box
2. The Music Settings dialog box
3. The Slideshow Settings dialog box
4. All Slides
2. Individual-Slide Options
1. Color options
2. Slide timing
3. Transition
4. Transition speed and direction
5. Cropping and zooming
6. The Ken Burns checkbox
5. Slideshow Tips
1. Picture Size
1. Determining the size of your photos
6. Slideshows and iDVD
2. 7. Making Prints
1. Making Your Own Prints
1. Resolution and Shape
1. Calculating resolution
2. Aspect ratio
2. Tweaking the Printer Settings
3. Paper Matters
4. Printing from iPhoto, Step by Step
1. Phase 1: Choose the photos to print
2. Phase 2: Choose a printing style (theme)
3. Phase 3: Choose print and paper sizes
4. Phase 4: Adjust the layout
5. Phase 5: Print
2. Ordering Prints Online
3. 8. Email, Web Galleries,and Network Sharing
1. Emailing Photos
1. The Mail Photo Command
2. Publishing Photos on the Web
1. Three Roads to Webdom
3. Flickr
1. iPhoto Places on Flickr maps
1. iPhoto Places on Flickr maps
2. Adding more photos to published Flickr sets
3. Deleting photos from Flickr
4. Facebook
1. Automatic photo-tagging in Facebook
1. Automatic photo-tagging in Facebook
2. Adding more photos to Facebook albums
3. Deleting photos from Facebook
5. The MobileMe Gallery
1. Using MobileMe Gallery
2. Turning Off Your MobileMe Albums
3. Subscribing to Published Albums
1. Subscribing to Flickr feeds
6. iPhoto to iWeb
1. What you get when you’re done
1. What you get when you’re done
2. Editing or deleting the Web page
7. Exporting iPhoto Web Pages
1. Preparing the Export
2. Examining the Results
3. Enhancing iPhoto’s HTML
4. Better HTML
8. Photo Sharing on the Network
9. Photo Sharing Across Accounts
1. Easy Way: Share Your Library
2. Geeky Way: Move the Library
4. 9. Books, Calendars, and Cards
1. Phase 1: Pick the Pix
2. Phase 2: Publishing Options
1. Book Type
2. Theme Choices
3. Phase 3: Design the Pages
1. Open a Page
2. Choose a Page Layout
3. Lay Out the Book
1. Ways to manipulate photos
2. Ways to manipulate pages
3. Layout strategies
4. Backgrounds
5. Making Your Photos Shape Up
6. Page Limits
7. Hiding Page Numbers
4. Phase 4: Edit the Titles and Captions
1. Editing Text
2. Formatting Text
3. Check Your Spelling
4. Listen to Your Book
5. Phase 5: Preview the Masterpiece
1. Print It
2. Slideshow It
3. Turn It into a PDF File
6. Phase 6: Send the Book to the Bindery
1. Your Apple ID and 1-Click Ordering
7. Photo Calendars
1. Phase 1: Choose the Photos
2. Phase 2: Choose the Calendar Design
3. Phase 3: Design the Pages
4. Phase 4: Edit the Text
5. Phase 5: Order the Calendar
8. Greeting Cards and Postcards
5. 10. iPhoto Goes to the Movies
1. Before You Export the Slideshow
1. Perfect the Slideshow
1. Which photos make the cut
2. Two Ways to Make Movies
1. Exporting an Instant Slideshow
2. Exporting a Saved Slideshow
3. Exporting a QuickTime Movie
1. Step 1: Choose QuickTime
2. Step 2: Choose the Movie Dimensions
1. Proportion considerations
2. Size considerations
3. Step 3: Choose the Seconds per Photo
4. Step 4: Choose the Background Colors
1. Solid colors
2. Background graphics
5. Step 5: Export the Movie
4. Fun with QuickTime
1. Play Movies at Full Screen
1. Selecting footage
2. Advanced Audio and Video Controls
3. Exporting Edited Movies
5. Managing Movies Imported from Your Camera
6. Editing Digital-Camera Movies
1. Editing Digital-Camera Movies in QuickTime Pro
7. Burning a Slideshow Movie CD or DVD
8. Slideshow Movies on the Web
1. Preparing a Low-Bandwidth Movie for the Web (No Transitions)
2. Preparing a High-Bandwidth Movie for the Web (with Transitions)
3. Uploading to a MobileMe Gallery
6. 11. iDVD Slideshows
1. The iDVD Slideshow
1. Creating an iDVD Slideshow
1. Starting in iPhoto
2. Starting in iDVD
2. Customizing the Show
1. Previewing the DVD
2. Extra Credit: Self-Playing Slideshows
7. III. iPhoto Stunts
1. 12. Screen Savers, AppleScript, and Automator
1. Building a Custom Screen Saver
1. Meet the Screen Saver
2. One-Click Desktop Backdrop
3. Exporting and Converting Pictures
1. Exporting by Dragging
2. Exporting by Dialog Box
1. File format
2. Titles and Keywords
3. Size options
4. File Name
4. Plug-Ins and Add-Ons
5. AppleScript Tricks
6. Automator Tricks
1. The Lay of the Land
1. Library list
2. Action list
3. Workflow pane
2. Automating iPhoto
2. 13. iPhoto File Management
1. About iPhoto Discs
1. Burning an iPhoto CD or DVD
1. What you get
2. When Not to Burn
2. iPhoto Backups
1. Backing Up to CD or DVD
2. Backing Up Without a CD Burner
3. Managing Photo Libraries
1. iPhoto Disk Images
2. Multiple iPhoto Libraries
1. Creating new libraries
2. Swapping libraries (Apple’s method)
3. Swapping libraries (automatic method)
4. Merging Photo Libraries
1. How Not to Do It
2. The Good Way
5. Beyond iPhoto
8. IV. Appendixes
1. A. Troubleshooting
1. The Most Important Advice in This Chapter
2. Importing, Upgrading, and Opening
1. “Unable to upgrade this photo library”
1. “Unable to upgrade this photo library”
2. iPhoto doesn’t recognize my camera.
3. iPhoto crashes when I try to import.
4. iPhoto crashes when I try to empty the Trash.
5. iPhoto won’t import images from my video camera.
3. Exporting
1. After I upgraded iPhoto to the latest version, my Export button became disabled.
1. After I upgraded iPhoto to the latest version, my Export button became disabled.
4. Printing
1. I can’t print more than one photo per page. It seems like a waste to use a whole sheet of paper for one 4 x 6 print.
1. I can’t print more than one photo per page. It seems like a waste to use a whole sheet of paper for one 4 x 6 print.
2. My picture doesn’t fit right on 4 x 6, 5 x 7, or 8 x 10 inch paper.
5. Editing and Sharing
1. iPhoto crashes when I double-click a thumbnail to edit it.
1. iPhoto crashes when I double-click a thumbnail to edit it.
2. iPhoto won’t let me use an external graphics program when I double-click a thumbnail.
3. Faces really stinks at identifying the people in my pictures!
4. Published pictures I re-edit in iPhoto aren’t updating on my free Flickr page.
5. I’ve messed up a photo while editing it, and now it’s ruined!
6. General Questions
1. iPhoto’s wigging out.
1. iPhoto’s wigging out.
2. I don’t see my other Mac’s shared photos over the network.
3. I can’t delete a photo!
4. I deleted a photo, but it’s back again!
5. All my pictures are gone!
6. All my pictures are still gone! (or) My thumbnails are all gray rectangles! (or) I’m having some other crisis!
2. B. iPhoto ’09, Menu by Menu
1. iPhoto Menu
1. About iPhoto
2. Preferences
1. General
2. Appearance
3. Events
4. Sharing
5. Web
6. Advanced
3. Empty iPhoto Trash
4. Shop for iPhoto Products
5. Provide iPhoto Feedback
6. Register iPhoto
7. Check for Updates
8. Hide iPhoto, Hide Others, Show All
9. Quit iPhoto
2. File Menu
1. New Album
2. New Album From Selection
3. New Smart Album
4. New Folder
5. Get Info
6. Import to Library
7. Export
8. Close Window
9. Edit Smart Album
10. Subscribe to Photo Feed
11. Order Prints
12. Print
13. Browse Backups
3. Edit Menu
1. Undo
2. Redo
3. Cut, Copy, Paste
4. Select All
5. Select None
6. Find
7. Font
8. Spelling
9. Special Characters
4. Photos Menu
1. Show Extended Photo Info
2. Adjust Date and Time
3. Batch Change
4. Rotate
5. My Rating
6. Flag Photo
7. Hide Photo
8. Duplicate
9. Move to Trash
10. Revert to Original
11. Restore to Photo Library
5. Events Menu
6. Share Menu
1. Email, Set Desktop, MobileMe, Facebook, Flickr…
7. View Menu
1. Titles, Ratings, Keywords, Event Titles
2. Hidden Photos
3. Sort Photos
4. Show in Toolbar
5. Full Screen
6. Always Show Toolbar/Autohide Toolbar
7. Thumbnails
8. Window Menu
1. Minimize
2. Zoom
3. Show Keywords
4. Manage My Places
5. Bring All to Front
6. [Window Names]
9. Help Menu
1. iPhoto Help
3. C. Where to Go From Here
1. iPhoto and the Web
1. iPhoto and the Web
2. Digital Photo Equipment Online
3. Show Your Pictures
4. Online Instruction
5. Online Printing
6. O’Reilly Guides
9. Index
10. About the Authors
11. Colophon
12. Special Upgrade Offer
13. Copyright
|
__label__pos
| 0.999971 |
20 27 30 triangle
Acute scalene triangle.
Sides: a = 20 b = 27 c = 30
Area: T = 263.8610640301
Perimeter: p = 77
Semiperimeter: s = 38.5
Angle ∠ A = α = 40.65553767418° = 40°39'19″ = 0.71095701828 rad
Angle ∠ B = β = 61.58663778464° = 61°35'11″ = 1.07548850678 rad
Angle ∠ C = γ = 77.75882454118° = 77°45'30″ = 1.3577137403 rad
Height: ha = 26.38660640301
Height: hb = 19.54552326149
Height: hc = 17.59107093534
Median: ma = 26.73301328092
Median: mb = 21.62875287539
Median: mc = 18.42655257727
Inradius: r = 6.85435231247
Circumradius: R = 15.3499011491
Vertex coordinates: A[30; 0] B[0; 0] C[9.51766666667; 17.59107093534]
Centroid: CG[13.17222222222; 5.86435697845]
Coordinates of the circumscribed circle: U[15; 3.2554558918]
Coordinates of the inscribed circle: I[11.5; 6.85435231247]
Exterior(or external, outer) angles of the triangle:
∠ A' = α' = 139.3454623258° = 139°20'41″ = 0.71095701828 rad
∠ B' = β' = 118.4143622154° = 118°24'49″ = 1.07548850678 rad
∠ C' = γ' = 102.2421754588° = 102°14'30″ = 1.3577137403 rad
Calculate another triangle
How did we calculate this triangle?
Now we know the lengths of all three sides of the triangle and the triangle is uniquely determined. Next we calculate another its characteristics - same procedure as calculation of the triangle from the known three sides SSS.
a = 20 ; ; b = 27 ; ; c = 30 ; ;
1. The triangle circumference is the sum of the lengths of its three sides
p = a+b+c = 20+27+30 = 77 ; ;
2. Semiperimeter of the triangle
s = fraction{ o }{ 2 } = fraction{ 77 }{ 2 } = 38.5 ; ;
3. The triangle area using Heron's formula
T = sqrt{ s(s-a)(s-b)(s-c) } ; ; T = sqrt{ 38.5 * (38.5-20)(38.5-27)(38.5-30) } ; ; T = sqrt{ 69622.44 } = 263.86 ; ;
4. Calculate the heights of the triangle from its area.
T = fraction{ a h _a }{ 2 } ; ; h _a = fraction{ 2 T }{ a } = fraction{ 2 * 263.86 }{ 20 } = 26.39 ; ; h _b = fraction{ 2 T }{ b } = fraction{ 2 * 263.86 }{ 27 } = 19.55 ; ; h _c = fraction{ 2 T }{ c } = fraction{ 2 * 263.86 }{ 30 } = 17.59 ; ;
5. Calculation of the inner angles of the triangle using a Law of Cosines
a**2 = b**2+c**2 - 2bc cos( alpha ) ; ; alpha = arccos( fraction{ a**2-b**2-c**2 }{ 2bc } ) = arccos( fraction{ 20**2-27**2-30**2 }{ 2 * 27 * 30 } ) = 40° 39'19" ; ; beta = arccos( fraction{ b**2-a**2-c**2 }{ 2ac } ) = arccos( fraction{ 27**2-20**2-30**2 }{ 2 * 20 * 30 } ) = 61° 35'11" ; ; gamma = arccos( fraction{ c**2-a**2-b**2 }{ 2ba } ) = arccos( fraction{ 30**2-20**2-27**2 }{ 2 * 27 * 20 } ) = 77° 45'30" ; ;
6. Inradius
T = rs ; ; r = fraction{ T }{ s } = fraction{ 263.86 }{ 38.5 } = 6.85 ; ;
7. Circumradius
R = fraction{ a }{ 2 * sin( alpha ) } = fraction{ 20 }{ 2 * sin 40° 39'19" } = 15.35 ; ;
Look also our friend's collection of math examples and problems:
See more informations about triangles or more information about solving triangles.
|
__label__pos
| 0.999983 |
优草派 > Python
python代码满屏爱心模板？
孙悦 来源：优草派
近几年，Python 已经成为最受欢迎的编程语言之一。随着Python在开发中的广泛应用，各种有趣的Python代码也越来越多。其中一个受欢迎的 Python 代码片段是爱心模板。
爱心模板是一种使用 Python 代码画出一个心形的艺术形式。这种代码看起来美丽且富有现代感，非常适合用于表达爱意或添加一些情感元素。
python代码满屏爱心模板？
在本文中，我们将探讨 Python 代码满屏爱心模板的各个方面，包括：
1. 这个模板的 Python 代码是什么？
这种爱心模板使用 Python 代码画出一个心形。代码片段大致如下：
```
import math
import turtle
# Set screen size
turtle.setup(800, 600)
# Set turtle parameters
turtle.pensize(3)
turtle.pencolor('red')
turtle.fillcolor('pink')
# Draw heart shape
turtle.begin_fill()
for x in range(-180, 180):
pos = math.sin(math.radians(x)) * 100
x_pos = math.sin(math.radians(x)) * abs(pos) ** (1 / 2)
y_pos = math.cos(math.radians(x)) * abs(pos) ** (1 / 2)
turtle.goto(x_pos * 3, y_pos * 3)
turtle.end_fill()
# Write message
turtle.penup()
turtle.goto(0, 180)
turtle.pencolor('purple')
turtle.write("I ❤ U", align="center", font=("Arial", 36, "normal"))
# Stop turtle
turtle.done()
```
此代码使用 Python 的 turtle 绘图模块创建心形。
2. 为什么这种漂亮的设计适合使用 Python 代码实现？
Python 是一种高级语言，易于理解且易于学习。Python 的高物理学习曲线可以让用户快速掌握下划线、布局和内存处理等基本技能。这使得Python成为了人们制作众多类型代码艺术作品的首选。
Python 除了简便外，它的效率和功能还能在很多方面具有优势，可以轻松地制作出优秀的可视化作品、数据分析和Internet of Things应用。此外,Python 的turtle库和其它库还可以轻松实现数百种优秀的编程操作。
3. 如何定制化这个模板？
这种爱心模板可以很容易地自定义广泛的地使用。您可以使用不同的颜色来修改这个模板以适应不同的场合和制作第一个具有极高质量的爱心代码。
您还可以通过调整代码来改变心形的大小和形状。例如，通过修改“100”大小参数代码可以制作大型或小型的心形。同样的，“3”大小参数决定了线条的宽度，可以调整此参数后获得更细的线条或更浓密的线条。
4. 如何将这个模板应用于日常生活？
您可以将这个爱心模板保存为 Python 文件，随时运行代码来创建令人惊叹的心形艺术列表以及诸如并发的 发布消息等独特表达情感的方式。
还有，您也可以尝试将这个模板应用于数字艺术品委员会或奖学金申请等，这将会极大增强自己的竞争力。同时，它也可以作为一种有趣的方式来与朋友或家人分享感情。
总之，Python代码满屏爱心模板，非常适合表达爱意和其他情感元素的艺术形式。使用 Python 进行编码的艺术品不仅美丽，还可以轻松进行自定义和应用。您还等什么？快来创建你的第一个Python代码爱心！
【原创声明】凡注明“来源：优草派”的文章，系本站原创，任何单位或个人未经本站书面授权不得转载、链接、转贴或以其他方式复制发表。否则，本站将依法追究其法律责任。
TOP 10
• 周排行
• 月排行
|
__label__pos
| 0.999889 |
Maximizing React’s Potential: Performance Optimization Tips for Developers
Image Source: Unsplash
React has become one of the most popular JavaScript libraries for building dynamic and interactive web applications. With its declarative syntax and efficient rendering capabilities, it has gained a massive following among developers worldwide. However, as applications become more complex and larger in scale, performance can become a major concern. As a developer, it’s important to understand how to optimize your React code to ensure that your application runs smoothly and efficiently. In this article, we’ll explore some key tips and strategies for maximizing React’s potential and achieving optimal performance. From optimizing rendering and minimizing re-renders to using memoization and code splitting, we’ll cover a range of techniques that will help you take your React skills to the next level. Whether you’re a seasoned React developer or just getting started, these performance optimization tips will be invaluable in helping you create fast, responsive, and user-friendly applications. So, let’s dive in and learn how to make the most of React’s potential!
Importance of React Performance Optimization
Performance optimization is a crucial aspect of any web application development process. It determines how fast and efficiently your application runs, which directly affects user experience. A slow and unresponsive application is likely to drive users away and negatively impact your business. React is a powerful library that can handle complex and dynamic applications with ease. However, it’s essential to optimize your React code to ensure that your application is fast, responsive, and user-friendly. Optimizing your React code involves reducing the time it takes to render your UI, minimizing re-renders, and optimizing the Virtual DOM. By doing so, you can create a performant application that provides a seamless user experience.
React Performance Optimization Techniques
React provides several performance optimization techniques that you can use to ensure that your application runs smoothly and efficiently. These techniques range from code splitting and lazy loading to memoization and optimizing the Virtual DOM. Let’s explore each of these techniques in detail.
Code Splitting in React
Code splitting is a technique that involves breaking down your application code into smaller chunks that can be loaded on demand. By doing so, you can reduce the initial load time of your application and improve its performance. React provides built-in support for code splitting through dynamic imports. With dynamic imports, you can split your code into smaller chunks and load them on demand based on user interactions. This technique is especially useful for applications with a large codebase or multiple entry points.
Lazy Loading in React
Lazy loading is a technique that involves loading resources only when they are needed. This technique can significantly improve your application’s performance by reducing the amount of data that needs to be loaded initially. React provides support for lazy loading through the React.lazy() function. With React.lazy(), you can load components lazily, which means they won’t be loaded until they are required. This technique is especially useful for applications with a large number of components or images.
Memoization in React
Memoization is a technique that involves caching the results of a function call and returning the cached result when the same function is called again with the same arguments. This technique can significantly improve your application’s performance by reducing the number of function calls and re-renders. React provides built-in support for memoization through the React.memo() function. With React.memo(), you can memoize functional components, which means they won’t be re-rendered unless the props they receive change. This technique is especially useful for applications with a large number of components or dynamic data.
Virtual DOM Optimization Techniques
The Virtual DOM is a key feature of React that allows for efficient and performant UI rendering. However, there are several techniques you can use to optimize the Virtual DOM and improve your application’s performance. One such technique is to minimize the number of re-renders. You can achieve this by using the shouldComponentUpdate() lifecycle method or the PureComponent class. Another technique is to use the key prop to identify unique elements in a list. By doing so, you can help React identify which elements have changed and avoid unnecessary updates.
Best Practices for React Performance Optimization
In addition to the performance optimization techniques we’ve discussed, there are several best practices you can follow to ensure that your React application is optimized for performance. These best practices include:
• Minimizing the use of inline styles and instead using CSS stylesheets
• Using React’s built-in profiling tools to identify performance bottlenecks
• Avoiding unnecessary state updates and component re-renders
• Using React’s Context API to manage state instead of prop drilling
• Using functional components instead of class components where possible
By following these best practices, you can ensure that your React application is optimized for performance and provides a seamless user experience.
Tools for React Performance Optimization
There are several tools available that can help you optimize your React application for performance. These tools range from browser extensions and build tools to profiling tools and performance monitoring services. Let’s take a look at some of the most popular tools for React performance optimization.
React Developer Tools
React Developer Tools is a browser extension that provides a set of tools for debugging and profiling React applications. It allows you to inspect React component hierarchies, view component props and state, and analyze performance metrics such as render time and update frequency.
Webpack
Webpack is a popular build tool that provides support for code splitting, lazy loading, and other performance optimization techniques. It allows you to bundle your application code into smaller chunks and optimize its performance for production.
React Profiler
React Profiler is a tool that allows you to profile the performance of your React application and identify performance bottlenecks. It provides a timeline view of your application’s rendering performance, allowing you to identify slow components and optimize their performance.
Sentry
Sentry is a performance monitoring service that allows you to monitor your application’s performance in real-time. It provides detailed performance metrics and alerts you when performance issues occur, allowing you to quickly identify and resolve performance bottlenecks.
Conclusion
React is a powerful library that can handle complex and dynamic applications with ease. However, as applications become more complex and larger in scale, performance can become a major concern. As a developer, it’s important to understand how to optimize your React code to ensure that your application runs smoothly and efficiently. In this article, we’ve explored some key tips and strategies for maximizing React’s potential and achieving optimal performance. From optimizing rendering and minimizing re-renders to using memoization and code splitting, we’ve covered a range of techniques that will help you take your React skills to the next level. By following these performance optimization tips and best practices, and using the right tools, you can create fast, responsive, and user-friendly applications that provide a seamless user experience.
0368826868
|
__label__pos
| 0.965054 |
Properties
Label 7350.2.a.c
Level 7350
Weight 2
Character orbit 7350.a
Self dual yes
Analytic conductor 58.690
Analytic rank 1
Dimension 1
CM no
Inner twists 1
Related objects
Downloads
Learn more about
Newspace parameters
Level: \( N \) \(=\) \( 7350 = 2 \cdot 3 \cdot 5^{2} \cdot 7^{2} \)
Weight: \( k \) \(=\) \( 2 \)
Character orbit: \([\chi]\) \(=\) 7350.a (trivial)
Newform invariants
Self dual: yes
Analytic conductor: \(58.6900454856\)
Analytic rank: \(1\)
Dimension: \(1\)
Coefficient field: \(\mathbb{Q}\)
Coefficient ring: \(\mathbb{Z}\)
Coefficient ring index: \( 1 \)
Twist minimal: no (minimal twist has level 1050)
Fricke sign: \(1\)
Sato-Tate group: $\mathrm{SU}(2)$
$q$-expansion
\(f(q)\) \(=\) \( q - q^{2} - q^{3} + q^{4} + q^{6} - q^{8} + q^{9} + O(q^{10}) \) \( q - q^{2} - q^{3} + q^{4} + q^{6} - q^{8} + q^{9} - 4q^{11} - q^{12} - q^{13} + q^{16} - 2q^{17} - q^{18} + q^{19} + 4q^{22} + 2q^{23} + q^{24} + q^{26} - q^{27} + 4q^{29} - q^{32} + 4q^{33} + 2q^{34} + q^{36} - 3q^{37} - q^{38} + q^{39} + 12q^{41} - 8q^{43} - 4q^{44} - 2q^{46} + 6q^{47} - q^{48} + 2q^{51} - q^{52} - 2q^{53} + q^{54} - q^{57} - 4q^{58} + 6q^{59} - 13q^{61} + q^{64} - 4q^{66} - 3q^{67} - 2q^{68} - 2q^{69} + 16q^{71} - q^{72} + 11q^{73} + 3q^{74} + q^{76} - q^{78} + 13q^{79} + q^{81} - 12q^{82} + 6q^{83} + 8q^{86} - 4q^{87} + 4q^{88} - 2q^{89} + 2q^{92} - 6q^{94} + q^{96} - 17q^{97} - 4q^{99} + O(q^{100}) \)
Embeddings
For each embedding \(\iota_m\) of the coefficient field, the values \(\iota_m(a_n)\) are shown below.
For more information on an embedded modular form you can click on its label.
Label \(\iota_m(\nu)\) \( a_{2} \) \( a_{3} \) \( a_{4} \) \( a_{5} \) \( a_{6} \) \( a_{7} \) \( a_{8} \) \( a_{9} \) \( a_{10} \)
1.1
0
−1.00000 −1.00000 1.00000 0 1.00000 0 −1.00000 1.00000 0
\(n\): e.g. 2-40 or 990-1000
Significant digits:
Format:
Inner twists
This newform does not admit any (nontrivial) inner twists.
Twists
By twisting character orbit
Char Parity Ord Mult Type Twist Min Dim
1.a even 1 1 trivial 7350.2.a.c 1
5.b even 2 1 7350.2.a.cl 1
7.b odd 2 1 7350.2.a.y 1
7.c even 3 2 1050.2.i.t yes 2
35.c odd 2 1 7350.2.a.bp 1
35.j even 6 2 1050.2.i.a 2
35.l odd 12 4 1050.2.o.k 4
By twisted newform orbit
Twist Min Dim Char Parity Ord Mult Type
1050.2.i.a 2 35.j even 6 2
1050.2.i.t yes 2 7.c even 3 2
1050.2.o.k 4 35.l odd 12 4
7350.2.a.c 1 1.a even 1 1 trivial
7350.2.a.y 1 7.b odd 2 1
7350.2.a.bp 1 35.c odd 2 1
7350.2.a.cl 1 5.b even 2 1
Atkin-Lehner signs
\( p \) Sign
\(2\) \(1\)
\(3\) \(1\)
\(5\) \(1\)
\(7\) \(1\)
Hecke kernels
This newform subspace can be constructed as the intersection of the kernels of the following linear operators acting on \(S_{2}^{\mathrm{new}}(\Gamma_0(7350))\):
\( T_{11} + 4 \)
\( T_{13} + 1 \)
\( T_{17} + 2 \)
\( T_{19} - 1 \)
\( T_{23} - 2 \)
\( T_{31} \)
Hecke characteristic polynomials
$p$ $F_p(T)$
$2$ \( 1 + T \)
$3$ \( 1 + T \)
$5$ 1
$7$ 1
$11$ \( 1 + 4 T + 11 T^{2} \)
$13$ \( 1 + T + 13 T^{2} \)
$17$ \( 1 + 2 T + 17 T^{2} \)
$19$ \( 1 - T + 19 T^{2} \)
$23$ \( 1 - 2 T + 23 T^{2} \)
$29$ \( 1 - 4 T + 29 T^{2} \)
$31$ \( 1 + 31 T^{2} \)
$37$ \( 1 + 3 T + 37 T^{2} \)
$41$ \( 1 - 12 T + 41 T^{2} \)
$43$ \( 1 + 8 T + 43 T^{2} \)
$47$ \( 1 - 6 T + 47 T^{2} \)
$53$ \( 1 + 2 T + 53 T^{2} \)
$59$ \( 1 - 6 T + 59 T^{2} \)
$61$ \( 1 + 13 T + 61 T^{2} \)
$67$ \( 1 + 3 T + 67 T^{2} \)
$71$ \( 1 - 16 T + 71 T^{2} \)
$73$ \( 1 - 11 T + 73 T^{2} \)
$79$ \( 1 - 13 T + 79 T^{2} \)
$83$ \( 1 - 6 T + 83 T^{2} \)
$89$ \( 1 + 2 T + 89 T^{2} \)
$97$ \( 1 + 17 T + 97 T^{2} \)
show more
show less
|
__label__pos
| 0.996787 |
Уведомления
Группа в Telegram: присоединиться | Немецкий хостинг Fornex для Ваших сайтов посмотреть
#1 Янв. 13, 2019 17:16:41
IfDANCodeR
Зарегистрирован: 2019-01-13
Сообщения: 6
Репутация: + 0 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
Есть такой код:
def textcutter(winyorwinxortextar, text, winxdefault):
textsplit = text.split()
winytext = 1
curtextsplit = []
if(len(textsplit) == 1):
winxtext = len(text)
else:
for n in range(len(textsplit)):
curtextsplit[winytext] = textsplit[n]
if(len(currenttextsplit[winytext]) >= winxdefault):
curtextsplit[winytext] = oldcurtextsplit
winytext += 1
elif(n < len(textsplit)):
oldcurtextsplit = curtextsplit[winytext]
curtextsplit[winytext] += ' '
print(winytext)
text = "Какой-то криповый сегодня вечерок, не правда ли, друзья?"
textcutter(1, text, 20)
В теории, он должен разделять текст на строки, чтобы они по длине не превышали winxdefault (в крайнем случае, winxdefault будет увеличиваться (но с этим я разберусь)) и возвращать несколько значений, в зависимости от заданных параметров (с этим я разберусь)
Проблема в том, что python выдает мне ошибки по диапазону индексов (он больше возможного):
Traceback (most recent call last):
File "C:\Users\danil\Desktop\Python\test.py", line 18, in <module>
textcutter(1, text, 20)
File "C:\Users\danil\Desktop\Python\test.py", line 9, in textcutter
curtextsplit[winytext] = textsplit[n]
IndexError: list assignment index out of range
Как избавиться от этой ошибки?
Отредактировано IfDANCodeR (Янв. 14, 2019 16:32:05)
Офлайн
#2 Янв. 13, 2019 17:42:53
marvellik
Зарегистрирован: 2016-05-15
Сообщения: 479
Репутация: + 55 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
IfDANCodeR для начала
вставляете свой код в окно сообщений затем выделяете его от начала и до конца удерживая л.к.м. и после выделения когда ваш код уже выделен синим идете вверх окна рядом с смайликом слева наводите на стрелку а затем жмете PYTHON и ваш код будет полным и читаемым. а так не читаемый код
Офлайн
#3 Янв. 14, 2019 13:14:16
IfDANCodeR
Зарегистрирован: 2019-01-13
Сообщения: 6
Репутация: + 0 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
marvellik
IfDANCodeR для начала вставляете свой код в окно сообщений затем выделяете его от начала и до конца удерживая л.к.м. и после выделения когда ваш код уже выделен синим идете вверх окна рядом с смайликом слева наводите на стрелку а затем жмете PYTHON и ваш код будет полным и читаемым. а так не читаемый код
Исправил
Офлайн
#4 Янв. 14, 2019 13:33:59
PEHDOM
Зарегистрирован: 2016-11-28
Сообщения: 1233
Репутация: + 191 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
все правильно оно говорит:
winytext = 1
curtextsplit = []
...
curtextsplit[winytext] = textsplit[n]
У вас curtextsplit пустой список, там нету ни одного элемента, а вы пытаетесь изменить его первый!!!(тоесть по факту второй) элемент.
IfDANCodeR
В теории, он должен разделять текст на строки, чтобы они по длине не превышали winxdefault
на практике он делает что угодно но только не это.
Отредактировано PEHDOM (Янв. 14, 2019 14:06:15)
Офлайн
#5 Янв. 14, 2019 14:13:44
Rafik
Зарегистрирован: 2018-09-04
Сообщения: 108
Репутация: + 12 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
Для добавления в конец списка имеется хорошая функция append
curtextsplit.append(textsplit[n])
Насколько я понимаю, в список curtextsplit будет идти добавление последовательно: первая строка идёт первым элементом, вторая - следующий и т.д.
Офлайн
#6 Янв. 14, 2019 14:55:10
IfDANCodeR
Зарегистрирован: 2019-01-13
Сообщения: 6
Репутация: + 0 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
Rafik
Для добавления в конец списка имеется хорошая функция append
Окей
Но дело-то в том, что таким образом из curtextsplit получится тот же список из слов, что и textsplit
А мне нужно, чтобы цикл проходил через if, менялось winytext, выставлялись пробелы, и только когда winytext меняется на следующее значение (когда набирается количество знаков, меньше, чем winxdefault, но при этом следующее слово добавляет количество символов, не влазящее в winxdefault (это последнее слово и не вписывается)), следовательно, уже тогда менялся индекс curtextsplit
Так вот, как добавлять в конец строки элементы (в строку с нужным индексом)?
Отредактировано IfDANCodeR (Янв. 14, 2019 15:21:30)
Офлайн
#7 Янв. 14, 2019 16:31:28
IfDANCodeR
Зарегистрирован: 2019-01-13
Сообщения: 6
Репутация: + 0 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
Rafik
Для добавления в конец списка имеется хорошая функция append
PEHDOM
все правильно оно говорит:
Окей, я попробовал исправить ситуацию со списком
def textcutter(winyorwinxortextar, text, winxdefault):
textsplit = text.split()
winytext = 1
curtextsplit = ['']
if(len(textsplit) == 1):
winxtext = len(text)
else:
for n in range(len(textsplit)):
curtextsplit[winytext] = textsplit[n]
if(len(currenttextsplit[winytext]) >= winxdefault):
curtextsplit.append('')
curtextsplit[winytext] = oldcurtextsplit
winytext += 1
elif(n < len(textsplit)):
oldcurtextsplit = curtextsplit[winytext]
curtextsplit[winytext] += ' '
print(winytext)
text = "Какой-то криповый сегодня вечерок, не правда ли, друзья?"
textcutter(1, text, 20)
Но
Traceback (most recent call last):
File "C:\Users\danil\Desktop\Python\test.py", line 19, in <module>
textcutter(1, text, 20)
File "C:\Users\danil\Desktop\Python\test.py", line 9, in textcutter
curtextsplit[winytext] = textsplit[n]
IndexError: list assignment index out of range
Проходя через if, индекс добавляется и меняется
Ничего не изменилось
Хз, что делать
Офлайн
#8 Янв. 14, 2019 16:34:53
IfDANCodeR
Зарегистрирован: 2019-01-13
Сообщения: 6
Репутация: + 0 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
IfDANCodeR
Ребят, всё, догнал, всё работает. Спасибо за помощь!
def textcutter(winyorwinxortextar, text, winxdefault):
textsplit = text.split()
winytext = 1
curtextsplit = ['']
if(len(textsplit) == 1):
winxtext = len(text)
else:
for n in range(len(textsplit)):
curtextsplit[winytext-1] = textsplit[n]
if(len(curtextsplit[winytext-1]) >= winxdefault):
curtextsplit.append('')
curtextsplit[winytext-1] = oldcurtextsplit
winytext += 1
elif(n < len(textsplit)):
oldcurtextsplit = curtextsplit[winytext-1]
curtextsplit[winytext-1] += ' '
print(winytext)
text = "Какой-то криповый сегодня вечерок, не правда ли, друзья?"
textcutter(1, text, 20)
С остальным разберусь
Офлайн
#9 Янв. 14, 2019 17:39:38
JOHN_16
От: Россия, Петропавловск-Камчатск
Зарегистрирован: 2010-03-22
Сообщения: 3132
Репутация: + 215 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
IfDANCodeR
что более читаемо curtextsplit или cur_text_split ? textcutter или text_cutter ? oldcurtextsplit или old_cur_text_split ? winytext или win_y_text? Подумайте над этим.
В самом конце, в качестве доп задачки, можете вернуться к этой функции и переписать ее в 2-3 раза лучше/ короче/ эффективнее/ понятнее
_________________________________________________________________________________
полезный блог о python john16blog.blogspot.com
Офлайн
#10 Янв. 14, 2019 20:20:28
uf4JaiD5
Зарегистрирован: 2018-12-28
Сообщения: 74
Репутация: + 3 -
Профиль Отправить e-mail
Как создать список с изначально неизвестным количеством элементов
Значит, надо разрезать строку по пробелам (“разделить на слова”), а затем собрать из этих “слов” строки не длинее заданного значения. Так?
Что именно надо вернуть, так и не сказано.
Последний вариант кода просто выводит 1. Ни в curtextsplit, ни в oldcurtextsplit не остаётся ничего осмысленного.
def add_word(word, line, n):
if len(word) > n:
print('Error: "{}" не влезет в {} ({})'.format(word, n, len(word)))
exit()
if line[0] + len(word) + 1 <= n:
line.append(word)
line[0] += len(word) + 1
return True
return False
def cut(text, n):
out = []
line = [-1]
# хранит первым элементом длину, потом "слова"
for word in text.split():
if not add_word(word, line, n):
# строка переполнена, добавить не удалось
# сохраняем текущую строку, начинаем набирать новую
out.append(' '.join(line[1:]))
line = [-1]
add_word(word, line, n)
if len(line) >1:
out.append(' '.join(line[1:]))
return out
n = 20
print('-'*n+'|')
for l in cut("Какой-то криповый сегодня вечерок, не правда ли, друзья?", n):
print(l)
--------------------|
Какой-то криповый
сегодня вечерок, не
правда ли, друзья?
Отредактировано uf4JaiD5 (Янв. 14, 2019 20:23:50)
Офлайн
Board footer
Модераторировать
Powered by DjangoBB
Lo-Fi Version
|
__label__pos
| 0.582421 |
Aide en ligne ESET
Sélectionnez le sujet
get configuration
Get the product configuration. Result of status may be { success, error }
Ligne de commande
ermm.exe get configuration --file C:\tmp\conf.xml --format xml
Paramètres
Name
Value
file
the path where the configuration file will be saved
format
format of configuration: json, xml. Default format is xml
Exemple :
call
{
"command":"get_configuration",
"id":1,
"version":"1",
"params":{
"format":"xml",
"file":"C:\\tmp\\conf.xml"
}
}
result
{
"id":1,
"result":{
"configuration":"PD94bWwgdmVyc2lvbj0iMS4w=="
},
"error":null
}
|
__label__pos
| 0.99783 |
Intelligent Systems
The growing consequences of accelerating climate change have been visible across the world with wildfires, floods, severe heatwaves, and even tropical cyclones in recent years. Climate change presents many challenges to society, as extreme weather events and pollution increases disease infection, while frequent wildfires and droughts threatens livelihoods. Data from an automated weather station (AWS) can be used to detect climate change trends and input into models to predict future changes in our environment.
Refuge chambers or emergency shelters are heavy duty steel boxes constructed to withstand overpressure of 15 PSI without deformation; each of these chambers is typically comprised of a small airlock chamber and a main chamber, capable of housing up to 20 or more people working in hazardous settings/industries such as underground mining. In the event of an unforeseen disaster caused by fires, floods, rock-falls, or explosions, these chambers, equipped with life-support systems that stay online for several days even when cut off from the main air and power supplies, are the last resort to which everyone involved would escape.
In dense urban environments where traffic flow is heavy, keeping up with traffic control and maintaining road safety at intersections with the heaviest traffic is often tricky as vehicles and pedestrians’ behaviors are erratic and unpredictable, not to mention the fact that not all are prone to follow the traffic regulations at all times.
Forest fires may have a variety of origins and causes but early detection and warning methods used to limit the extent of their damage are largely the same. Now, cutting-edge AI technology is enabling more rapid detection to facilitate greater advance warning.
Modern fisheries have embarked on a new era of data and analytics-based technology to provide monitoring capability in a complex operational environment.
To ensure reliable monitoring and recording, the industry is turning to a reliance on Artificial Intelligence-based vision and Big Data analytics enabled by IoT technologies. By using electronic monitoring, video surveillance, sensors, and control systems, today’s fishing industry can achieve cost and risk reduction using intelligent systems.
Data centers are and will continue to serve as the backbones of our modern world. From watching your favorite shows on video streaming platforms to communicating with colleagues overseas, data centers enable the online services and resources that empower the way we live and work. As a result, ensuring the optimal operation and security of our data centers is crucial. To realize this, data center administrators require the ability to collect, consolidate, and analyze data across the board. This is best achieved via Data Center Infrastructure Management (DCIM) that leverages surveillance technologies, network appliances, sensors, and monitoring software. Through effective DCIM, administrators have an indispensable tool to measure, manage, and control data center utilization and energy consumption of all IT-related equipment and facility infrastructure components, including air conditioning systems.
In order to build the largest edge cloud network in rural environments, network-as-a-service providers utilizes edge computing and wireless technology to bring the capabilities and advantages of the cloud with IoT and AI to the remote and hard-to-reach rural areas.
페이지 1 / 전체 5
|
__label__pos
| 0.579683 |
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other.
Join them; it only takes a minute:
Sign up
Join the Stack Overflow community to:
1. Ask programming questions
2. Answer and help your peers
3. Get recognized for your expertise
int **F;
int **dev_pF;
size_t *pitchF;
void init_cuda_mem(int mF,int mT,int nF,int nT){
cudaMallocPitch((void **)dev_pF,pitchF,(nF + 2*nT -2)*sizeof(int),mF + 2*mT -2);
cudaMemcpy2D((void *)dev_pF,*pitchF,(void *)pF,*pitchF,(nF + 2*nT -2)*sizeof(int),mF + 2*mT -2,cudaMemcpyHostToDevice);
}
Well hello everyone
in the above snippet i am trying to allocate a 2D array using cudaMallocPitch
and then copying that array using cudaMemcpy2D from the host to the device
unfortunately it crashes and i think the error is (i think) at the cudaMemcpy2D
can someone help me locate it please
share|improve this question
up vote 0 down vote accepted
I think the issue is that you are mistaken with regards to pointers and pointers to pointers.
You should probably do something on the lines of:
int *dev_pF;
size_t pitchF;
void init_cuda_mem(int mF,int mT,int nF,int nT) {
cudaMallocPitch((void **)&dev_pF, &pitchF,(nF + 2*nT -2)*sizeof(int),mF + 2*mT -2);
cudaMemcpy2D((void *)dev_pF,pitchF,(void *)pF, pitchF,(nF + 2*nT -2)*sizeof(int),mF + 2*mT -2,cudaMemcpyHostToDevice);
}
Note the difference that you are now taking the address of the variables in the cudaMallocPitch call and then just using them directly in the second call.
In your original code, you were first asking cudaMalloc to store a pointer in whatever memory dec_pF happened to point to and store the size in whatever memory pitchF was pointing to. Both of these where unitialized, so disaster could occur there. In the second call you were converting dev_pF from a pointer to pointer to a regular pointer, so you are telling the memcpy to copy memory starting where the pointer was stored rather than where the allocated memory was stored. And since both the pointer to pointer and the size where unitialized at first, pretty much anything could happen.
Also, you are making use of a pF pointer that I cannot see in the original code, make sure it is initialized properly.
share|improve this answer
Thank you! You are right i missed that. – Spyros Jan 21 '11 at 10:49
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.938171 |
Commit e952972d authored by Hugo Beauzée-Luyssen's avatar Hugo Beauzée-Luyssen
Browse files
MetadataParser: Don't use dates to discriminate compilation albums
parent cb430c29
...@@ -472,11 +472,11 @@ std::shared_ptr<Album> MetadataParser::findAlbum( parser::Task& task, std::share ...@@ -472,11 +472,11 @@ std::shared_ptr<Album> MetadataParser::findAlbum( parser::Task& task, std::share
for ( auto it = begin( albums ); it != end( albums ); ) for ( auto it = begin( albums ); it != end( albums ); )
{ {
auto a = (*it).get(); auto a = (*it).get();
auto candidateAlbumArtist = a->albumArtist();
if ( albumArtist != nullptr ) if ( albumArtist != nullptr )
{ {
// We assume that an album without album artist is a positive match. // We assume that an album without album artist is a positive match.
// At the end of the day, without proper tags, there's only so much we can do. // At the end of the day, without proper tags, there's only so much we can do.
auto candidateAlbumArtist = a->albumArtist();
if ( candidateAlbumArtist != nullptr && candidateAlbumArtist->id() != albumArtist->id() ) if ( candidateAlbumArtist != nullptr && candidateAlbumArtist->id() != albumArtist->id() )
{ {
it = albums.erase( it ); it = albums.erase( it );
...@@ -520,22 +520,31 @@ std::shared_ptr<Album> MetadataParser::findAlbum( parser::Task& task, std::share ...@@ -520,22 +520,31 @@ std::shared_ptr<Album> MetadataParser::findAlbum( parser::Task& task, std::share
continue; continue;
} }
// Attempt to discriminate by date // Attempt to discriminate by date, but only for the same artists.
auto candidateDate = task.vlcMedia.meta( libvlc_meta_Date ); // Not taking the artist in consideration would cause compilation to
if ( candidateDate.empty() == false ) // create multiple albums, especially when track are only partially
// tagged with a year.
if ( ( albumArtist != nullptr && candidateAlbumArtist != nullptr &&
albumArtist->id() == candidateAlbumArtist->id() ) ||
( trackArtist != nullptr && candidateAlbumArtist != nullptr &&
trackArtist->id() == candidateAlbumArtist->id() ) )
{ {
try auto candidateDate = task.vlcMedia.meta( libvlc_meta_Date );
if ( candidateDate.empty() == false )
{ {
unsigned int year = std::stoi( candidateDate ); try
if ( year != a->releaseYear() ) {
it = albums.erase( it ); unsigned int year = std::stoi( candidateDate );
else if ( year != a->releaseYear() )
++it; it = albums.erase( it );
continue; else
} ++it;
catch (...) continue;
{ }
// Date wasn't helpful, simply ignore the error and continue catch (...)
{
// Date wasn't helpful, simply ignore the error and continue
}
} }
} }
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
|
__label__pos
| 0.558339 |
Specifying conditions for alerting policies
This document describes how to specify conditions for alerting policies for the Legacy interface. If you are using the Preview interface, see Configure a condition. This content does not apply to log-based alerting policies. For information about log-based alerting policies, which notify you when a particular message appears in your logs, see Monitoring your logs.
The conditions for an alerting policy define what is monitored and when to trigger an alert. For example, suppose you want to define an alerting policy that emails you if the CPU utilization of a Compute Engine VM instance is above 80% for more than 3 minutes. You use the conditions dialog to specify that you want to monitor the CPU utilization of a Compute Engine VM instance, and that you want an alerting policy to trigger when that utilization is above 80% for 3 minutes.
Before you begin
To open the Conditions pane for a new alerting policy, do the following:
1. In the Cloud Console, select Monitoring:
Go to Monitoring
2. Select Alerting.
3. Click Create policy.
4. Click Add Condition in the Create new alerting policy window.
Title
Each condition must contain a title. As you complete the fields in the conditions dialog, the title field is automatically populated. You can change the auto-populated content to something more meaningful.
Type of Condition
The conditions dialog lets you select the type of condition that you are adding. While all conditions include a configuration that defines when an alert occurs, each type of condition has unique fields:
• A metric condition is defined by a resource type and a metric.
• An uptime-check condition is defined by a resource type and an uptime check.
• A process-health condition is defined by a resource type and a series of filters.
You can also create conditions using the text-based Monitoring Query Language (MQL). For information on using MQL to create conditions, see Creating MQL alerting policies.
Select the type of condition to add to the alerting policy.
Target
After you select the type of condition, you use the fields in the Target pane to define values for the condition's fields. For example, if you select a metric condition, the Target pane includes a list of resource types and metrics.
When you select a target for any type of alerting policy, you are selecting a set of time series that must stay within some constraint. These time series are plotted on the chart for the condition. For more information on time series, see Metrics, time series, and resources.
Adding a metric target
A metric target is defined by a resource type and a metric. For example, you might select Compute Engine VM Instance and CPU load (15m) as the resource type and metric, respectively. To add a metric condition, do the following:
1. Ensure the Metric tab is selected.
2. Click the Find resource type and metric field to bring up a drop-down list of available resource types and metrics.
3. You can either enter text into the Find resource type and metric field or select the resource type that you want to monitor from the menu:
Select the resource type.
4. To choose a metric, scroll through the menu and make a selection. Another option is to filter the menu options by entering a partial service name or the metric name. For more information see Selecting metrics.
After you select the resource type and metric, this page expands to display a chart and to provide fine-grained control for your alerting condition. See Configuring a target metric for details on the new options. For additional information:
You can't create a condition based on the ratio of two metrics through the UI, but you can create such policies using the API. See Metric ratio for a sample policy.
Adding an uptime-check target
To create an alerting policy for an uptime check, go to the details pane of the uptime check and click Add alert policy in the Uptime details pane. For details, see Alerting on uptime checks.
Adding a process-health target
A process-health target is defined by a resource type and a series of filters. You can configure this policy to create an alert if the number of processes that match a specific pattern falls above, or below, a threshold during a duration window.
To add a process-health condition, do the following:
1. Ensure the Process health tab is selected.
2. In the Resource Type fields, complete the following steps:
• From the drop-down list, select a single resource, a group of resources, or all resources.
• From the drop-down list, select the resource type you want to monitor. For example, you might select GCE VM Instance. The UI provides the list of available resource types for your system.
3. For the Command Line, Command, and User filters, select the fields to identify the processes that you want to monitor. In these filters, you can select the string-match operator and specify the query.
• The string-match operators are: Equals, Contains, Starts with, Ends with, and Regex. The operations are case sensitive.
• The syntax of the query depends on the operation choice. You can use wildcard operators in queries. For example, the wildcard * matches any process.
The results of the three filters are combined using the following rules:
• If you don't specify the query value for any of the filters, then all processes are counted.
• If you enter a query for one filter, only processes that match the filter are counted.
• If you enter command-line and command queries, processes that match either filter are counted. Note that command lines are truncated after 1024 characters, so text in a command line beyond that limit can't be matched against.
• If you enter a user query, processes that match the user filter and the command-line-or-command filter are counted.
Processes that are monitored
Not all processes running in your system can be monitored by a process-health condition. This condition selects processes to be monitored by using a regular expression that is applied to the command line that invoked the process. When the command line field isn't available, the process can't be monitored.
One way to determine if a process can be monitored by a process-health condition is to view the output of the Linux ps command:
ps aux | grep nfs
USER PID %CPU %MEM VSZ RSS TTY STAT START TIME COMMAND
root 1598 0.0 0.0 0 0 ? S< Oct25 0:00 [nfsd4]
root 1639 0.0 0.0 0 0 ? S Oct25 2:33 [nfsd]
root 1640 0.0 0.0 0 0 ? S Oct25 2:36 [nfsd]
When a COMMAND entry is wrapped with square brackets, for example [nfsd], the command-line information for the process isn't available, so you can't use Cloud Monitoring to monitor the process.
Example
As an example, to count the number of processes with nginx in their name, that are owned by root, on all Compute Engine VM instances in a project, you can configure the Target pane as follows:
• In the Resource type menu, select All, and for the other menu, select Compute Engine VM Instance.
• In the Command Line menu, select Contains, and for the field, enter nginx.
• Leave the Command field empty.
• In the User menu, select Equals, and for the field, enter root.
• Click Apply.
Show user is root for nginx.
In the preceding figure, the graph shows an alerting threshold of one process and data for two instances. Neither instance is running enough processes to trigger an alerting policy.
Configuration
After specifying the target, you use the Configuration region to define when the alerting policy triggers. The configuration region defines which time series can cause an alerting policy to trigger and when these time series aren't meeting the policy.
The Condition triggers if menu lets you select the subset of the targets that must violate the condition:
• Any time series violates
• Percent of time series violates
• Number of time series violates
• All time series violate
The Condition menu defines the comparator:
• Is above
• Is below
• Increases by
• Decreases by
• Is absent
For example, to configure an alerting policy to trigger if any time series is above 50 for 3 minutes, do the following:
• In the Condition triggers if menu, select Any time series violates.
• In the Condition menu, select is above.
• In the Threshold field, enter 50.
• In the For menu, select 3 minutes.
Configuring the target metric dialog.
Finish defining the condition
To complete the definition of your condition and to return to the alerting policy dialog, click Add.
|
__label__pos
| 0.781552 |
0 Replies Latest reply on Nov 23, 2009 2:35 PM by Tanya Ruttenberg
Edit dataTable with modalPanel cannot save changes
Tanya Ruttenberg Expert
I am basing my code on the richfaces demo example "Edit Table with ModalPanel". I am using a seam-generated application, which differs slightly from the example.
The view is this:
<ui:define name="body">
<div style="clear: both" />
<h:form>
<a4j:region>
<rich:dataTable id="dataTable" value="#{devTagsList.resultList}"
var="_devtags" ajaxKeys="#{assetTag.rowsToUpdate}" rowKeyVar="rowId">
<rich:column>
<f:facet name="header">Row ID</f:facet>
<h:outputText value="#{rowId}" id="rowid" />
</rich:column>
<rich:column>
<f:facet name="header">
<h:outputText value="Asset Tag" />
</f:facet>
<h:outputText value="#{_devtags.devTagId}" id="hostname" />
</rich:column>
<rich:column>
<f:facet name="header">
<h:outputText value="Serial Number" />
</f:facet>
<h:outputText value="#{_devtags.devSerialNum}" id="platform" />
</rich:column>
<rich:column>
<f:facet name="header">
<h:outputText value="Comment" />
</f:facet>
<h:outputText value="#{_devtags.comment}" id="devId" />
</rich:column>
<rich:column>
<f:facet name="header">
<h:outputText value="Tag ID" />
</f:facet>
<h:outputText value="#{_devtags.tagId}" id="tagId" />
</rich:column>
<rich:column>
<f:facet name="header">
<h:outputText value="Device Id" />
</f:facet>
<h:outputText value="#{_devtags.devId}" />
</rich:column>
<rich:column>
<a4j:commandLink ajaxSingle="true" id="editLink"
oncomplete="#{rich:component('editPanel')}.show()" >
<h:graphicImage value="/img/icons/edit.gif" style="border:0" />
<f:setPropertyActionListener value="#{_devtags}"
target="#{devTagsHome.instance}" />
</a4j:commandLink>
</rich:column>
</rich:dataTable>
<rich:messages style="color:red;"></rich:messages>
</a4j:region>
</h:form>
<rich:modalPanel id="editPanel" autosized="true" width="450">
<f:facet name="header">Asset Tag</f:facet>
<f:facet name="controls">
<h:panelGroup>
<h:graphicImage value="/img/modal/close.png"
id="hideEditPanel" styleClass="hidelink"
onclick="#{rich:component('editPanel')}.hide()" />
</h:panelGroup>
</f:facet>
<h:form>
<rich:messages for="assetTagPanel" style="color:red;"></rich:messages>
<a4j:outputPanel ajaxRendered="true" id="assetTagPanel">
<h:panelGrid columns="2">
<h:outputText value="Serial Number. Change if necessary" />
<h:inputText value="#{devTagsHome.instance.devSerialNum}" />
<h:outputText value="Asset Tag" />
<h:inputText value="#{devTagsHome.instance.devTagId}" />
<h:outputText value="Comment" />
<h:inputText value="#{devTagsHome.instance.comment}" />
<h:outputText value="Instance ID" />
<h:outputText value="#{devTagsHome.id}" />
</h:panelGrid>
<a4j:commandButton value="Update"
action="#{devTagsHome.update(devTagsHome.instance.tagId)}"
oncomplete="#{rich:component('editPanel')}.hide()"
reRender="dataTable" />
</a4j:outputPanel>
</h:form>
</rich:modalPanel>
</ui:define>
Here is DevTags.java:
@Entity
@Table(name = "dev_tags")
@AutoCreate
@Name("devTags")
public class DevTags implements java.io.Serializable {
private Integer tagId;
private String devTagId;
private String devSerialNum;
private String comment;
private String singleSiteCode;
private Integer devId;
public DevTags() {
}
public DevTags(Integer devId, String devSerialNum) {
this.devSerialNum = devSerialNum;
this.devId = devId;
}
@Id
@GeneratedValue(strategy = IDENTITY)
@Column(name = "tag_id", unique = true, nullable = false)
public Integer getTagId() {
return this.tagId;
}
public void setTagId(Integer tagId) {
this.tagId = tagId;
}
@Column(name = "dev_tag_id", length = 45)
@Length(max = 45)
public String getDevTagId() {
return this.devTagId;
}
public void setDevTagId(String devTagId) {
this.devTagId = devTagId;
}
@Column(name = "dev_serial_num_hard", length = 45)
@Length(max = 45)
public String getDevSerialNum() {
return this.devSerialNum;
}
public void setDevSerialNum(String devSerialNum) {
this.devSerialNum = devSerialNum;
}
@Column(name = "comment", length = 65535)
@Length(max = 65535)
public String getComment() {
return this.comment;
}
public void setComment(String comment) {
this.comment = comment;
}
@Transient
public String getSingleSiteCode() {
return this.singleSiteCode;
}
public void setSingleSiteCode(String singleSiteCode) {
this.singleSiteCode = singleSiteCode;
}
@Column(name = "dev_id")
public Integer getDevId() {
return this.devId;
}
public void setDevId(Integer devId) {
this.devId = devId;
}
}
And DevTagsHome.java:
package dne.nib.assettags.action;
import java.util.Set;
import org.jboss.seam.annotations.Name;
import org.jboss.seam.framework.EntityHome;
import dne.nib.assettags.model.DevTags;
@Name("devTagsHome")
public class DevTagsHome extends EntityHome<DevTags> {
public void setDevTagsTagId(Integer id) {
setId(id);
}
public Integer getDevTagsTagId() {
return (Integer) getId();
}
@Override
protected DevTags createInstance() {
DevTags devTags = new DevTags();
return devTags;
}
public void load() {
if (isIdDefined()) {
wire();
}
}
public void wire() {
getInstance();
}
public boolean isWired() {
return true;
}
public DevTags getDefinedInstance() {
return isIdDefined() ? getInstance() : null;
}
public String update(Integer id) {
System.out.println("instance id defined "+isIdDefined());
System.out.println("instance id "+ id);
System.out.println("isManaged = "+this.isManaged());
return super.update();
}
}
When I click on the Edit button to bring up the ModalPanel it works fine. All fields are populated. When I try to update the instance using DevTagsHome.update(), I get this output on the console:
14:28:42,028 INFO [STDOUT] Hibernate:
select
devtags0_.tag_id as tag1_33_,
devtags0_.comment as comment33_,
devtags0_.dev_id as dev3_33_,
devtags0_.dev_serial_num_hard as dev4_33_,
devtags0_.dev_tag_id as dev5_33_
from
ond.dev_tags devtags0_ limit ?
14:28:46,372 INFO [STDOUT] instance id defined false
14:28:46,372 INFO [STDOUT] instance id 0
14:28:46,372 INFO [STDOUT] isManaged = false
14:28:46,513 INFO [STDOUT] Hibernate:
select
devtags0_.tag_id as tag1_33_,
devtags0_.comment as comment33_,
devtags0_.dev_id as dev3_33_,
devtags0_.dev_serial_num_hard as dev4_33_,
devtags0_.dev_tag_id as dev5_33_
from
ond.dev_tags devtags0_ limit ?
To me, my code seems pretty much identical to the example on the richfaces demo. My devTagsHome is analogous to DataScrollerBean. My instance is the currentItem and my update() is the same as store().
And yet, when I click on update(), the app acts like it has never seen my devTags instance before?
This is driving me crazy. Can someone help?
|
__label__pos
| 0.903434 |
0
I've got an iPhone that is not locked down via the cloud, just PIN. Unfortunately, the PIN has been lost. I did the home button down, plug into the computer thing to get it to attach. I then tried to do the wipe from the computer, but it said the software had to be updated first. After allowing the update process to go along for awhile the phone rebooted. It's now at a "swipe to update" screen. If I swipe, it asks for the PIN (which I don't have). I'm unable to power it off now (it doesn't respond to the power button). Attaching it to the computer just gives the backup (PIN required) screen, no wipe option available.
Is there any way to recover from this point? Is it worth trying to run down the battery to kill it and then try again? Even if I do, how can I do a wipe without getting stuck in the same place again?
2
0
From: https://support.apple.com/en-us/HT201263
"Press and hold both the Sleep/Wake and Home button for at least 10 seconds, and don't release when you see the Apple logo. Keep holding until you see the recovery mode screen."
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
__label__pos
| 0.560396 |
Algebra
posted by .
I am very confused as to how to make a table with the range of values I have this y=-1/2x-4
my table layout is similar to this;
x_y_(x,y)
?_-1_?
-2_?_?
?_-4_?
2_?_?
8_?_?
**note** I used the underscore to separate the x,y and X,y to kind of make a chart.
Could someone please explain how I would do this.
Thank you
• Algebra -
When given x or y, solve the equation for the other.
• Algebra -
How do you do that?
Respond to this Question
First Name
School Subject
Your Answer
Similar Questions
1. Vector Table (physics)
I have to find the magnitude and direction of a resultant vector from values obtained from a vector table. The values in the book that we had to follow and put on the balancing part of the weight table were in F1= (0.200)g N when calculating …
2. algebra
HOw do I make a table of values for y equals 3/2?
3. chem
Complete the table below: Note: Make simplifying assumptions, do not use the quadratic formula. What is the pH of the solution created by combining 1.00 mL of the 0.10 M NaOH(aq) with 8.00 mL of the 0.10 M HCl(aq)?
4. Maths
For this question, use the copy of the Random Number table provided at the end of this AAT. (This table was copied from page 111 in the Textbook.) Select 48 values according to the following criteria. o The first thirty (30) numbers …
5. Maths A
For this question, use the copy of the Random Number table provided at the end of this AAT. (This table was copied from page 111 in the Textbook.) Select 48 values according to the following criteria. o The first thirty (30) numbers …
6. Maths A
Select 48 values according to the following criteria. o The first thirty (30) numbers must lie in the range from 48 to 58 inclusive. o The next ten (10) numbers must lie in the range from 30 to 70 inclusive. o The remaining eight (8) …
7. STAT
Calculate SP (the sum of products of deviations) for the following scores. Note: Both means are decimal values, so the computational formula works well. X Y 0 2 0 1 1 0 2 1 1 2 0 3 Assume a two-tailed test with .05. (Note: The …
8. Algebra HELP ASAP
CURRENTLY 6 LESSON DAYS BEHIND AND VERY DEPRESSED/STRESSED!! You are making a rectangular table. The area of the table should be 10 ft^2. You want the length of the table to be 1 ft shorter than twice its width. What should the dimensions …
9. algebra
The Jackson High School gymnastics team sells calendars for their annual fundraiser. The function rule below describes the amount of money the team can raise, where y is the total amount in dollars, and x is the number of calendars …
10. Precalc
Find a possible formula for the trigonometric function whose values are in the following table (note the values in the table may be slightly rounded): x 0.00 0.17 0.33 0.50 0.67 0.83 1.00 1.17 1.33 1.50 1.67 1.83 2.00 g(x) 4.00 5.50 …
More Similar Questions
|
__label__pos
| 0.638203 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.