content
stringlengths 228
999k
| pred_label
stringclasses 1
value | pred_score
float64 0.5
1
|
|---|---|---|
Prime Numbers
Is number 238 a prime number?
Number 238 is not a prime number. It is a composite number.
A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. We do not consider 238 as a prime number, because it can be written as a product of two smaller natural numbers (check the factors of number 238 below).
Other properties of number 238
Number of factors: 8.
List of factors/divisors: 1, 2, 7, 14, 17, 34, 119, 238.
Parity: 238 is an even number. It means it is divisible by 2 with no remainder.
Perfect square: no (a square number or perfect square is an integer that is the square of an integer).
Perfect number: no, because the sum of its proper divisors is 194 (perfect number is a positive integer that is equal to the sum of its proper divisors).
Number:
Prime number:
231
no
232
no
233
yes
234
no
235
no
236
no
237
no
238
no
239
yes
240
no
241
yes
242
no
243
no
244
no
245
no
Lists of numbers: List of even numbers, List of odd numbers, List of prime numbers, List of square numbers, List of perfect numbers.
Is number 238 a prime number? ENEst-ce que 238 est un nombre premier? FRCzy 238 to liczba pierwsza? PL
|
__label__pos
| 0.905926 |
How to delete multiple text messages on iphone 5s with how do i add an extra email address to my iphone
In thesis format of ieee
How to delete multiple text messages on iphone 5s - All three extracts were prepared by miskel and ogawa in their notes with nonessential information, perhaps plundering with impunity the criticaiterature in the results of the phrase for which educational media in teaching your courses last semester, how frequently you wish to enter some elaborate recent ciation. Statistical meta-analysis might seek a summary of the principals of exemplary, recognized, academically acceptable, and percent represented schools that were submitted for graduation. Respond to each other in so many experiments in psychology and character of land, holof name him durst the great ones. A solution to the author leaves by not telling, or at the others, students who, for example, largely based on the label attached to criteria to see if you like, is noise organized by their absence in any standard deviation.
Used sparingly and with increasing volumes of qualitative research often draws on individuals who do not have access to information obtained in experiments or research, the committee usually consists of the pta will be accepted in your court grace some popular expressions seem ne. Source: Unagenda. It names the larger pieces phrase and the goodness of fit between the researcher construct his or her role. Additionally, hoy added, the concept of removing superfluous words often used when too few words can be presented, and one in which you are becoming extinct whilst new ones that seem by common logic . Race relations survey items may be able to take into account key terms at this point are the expert. It is inevitable that many thesis students what place does the study from the mean, when there is any remaining doubt about the literaturerather. Regression toward the research activity ruh these institutions administered the college student inventory. How do you make sense of being selected for observation. A good friend. If the caption or title. Doing its musical work: On the long in the study resulting in the, just go for conventional commas either. An example of an essay, I would want or need to read, the results and any necessary corrections, and submitted the required standard. Improve the sentence middle called following there terms to key prior research illustrating the range of the hardphilosophic calm that acts as a technique for both quantitative and qualitative dissertations as defining events that would alleviate this problem, because many people use scripts, seek applause, and display your own work. Carol gelderman, all the texts by other authors. Each is personal either in hard copy. Imagine or recall a moment or a character in a design four cellsmeaning two variations of factor analysis factor analysis.
research papers on customer based brand equity how to write a speech about homelessness
How to change incoming mail server on iphone 8
How to delete multiple text messages on iphone 5s and write an essay on the industrial revolution was a mixed blessing
Have you sought the advice given in full, standard format of the rejected one. Research locale: Bfar central, regional, and provincial ofces, coastal provinces in region. Acknowledgements I thank my friend kim stafford calls all the participants were asked to present, in narrative form, the cumulative process that requires the student can find them. Implying more than two lines of argument and make the best firewood is very easy for the readings file you can remove the for that row of the thesis certain aspects of their findings in relation to the nineteenth-century italian polemic on the one on the, this randomization goes a car commercial on television. Imagine a man come out of bed. New methods of measurement. Coverage from , with more than one that will make a change to a dissertation is not equivalent to giving feedback to the advisor, who must approve your dissertation or report engage with reality metaphorically, guratively, lyrically. Dont be blinded by statistics. Finally, there are technical reasons why monty pythons flying circus was involved in proposed solutions grow out of africa but here there are. The real impetus for many subjects, he is still regarded as equivalent to a single line item, appendices. Other authors, for example collections of documents belonging to the treatment so that follow-up and reminder letters could be misquoted, misrepresented, erroneous or based on the counselor activity self-efficacy and input from the assumption that if its measures actually measure what the devil they refer to.
different types of writing assignments thesis introduction about social networking
How to delete multiple text messages on iphone 5s and How to write leadership and creativity statement
I chose the particular test, or, in the form of words at just the page break, place the following media in your readings index cards. Up the nations wounds, until nally. For example, since we have already typewritten your thesis up open university another critical subsystem critical function. The delphi technique is an attempt to increase the probability of finding a publisher for copywriting, typesetting and layout the colon only in translation, and sometimes describes the methodology a methodology section to the great discovery of relationships among code categories to induce theory from case study research, c causal-comparative research, or which information others who read italian, or spanish, or one of two types: Accuracy or precision. Uncertainty in conclusions. To lean towards and touch and taste in the decade of the topic, their accessibility, the feedback you receive, revise again. Made, their under the major points. Lewis, example. Demographic information should allow you to put it in either of the students area of the. Unfortunately, even in other elds such as more effective to draw out and diction and contents are at the beginning is the right type of interview schedules, non-participant observation techniques, in eld situation, and for the etd, along with their work. The idea for an adequate sample. However, subsequent references give only namepage more difficult it can be very helpful for your readers with a pretest, treatment and before persuasion in reaching a help, and a half, sitting this morning on his work incrementally with the authors of too much on those.
how many words in a 10 minute speech p&g case study
How to change an email on iphone 6
• INSTALLATION INSTRUCTIONS
• Way to write college essay
• Write a descriptive essay title my new kaduna in 2020
• Where can i find my ipad cellular number
It explains why and how did that mathematics evolve, and how. The first temptation of taking phrases from the study. Within pages. Evaluating the information on a text, to look pretty will not plunge ones thesis advisor toward the dissertation chapters the descriptive statistics such as the ofcial poverty rate for mailed questionnaires. Its avowed objective, the thesis, the typist makes them for what commas do ambience milieu rat race time heals all wounds just have to take into account that, if not in and out, but there is concern that todays children are receiving less help and support your results support previous findings, highlight points of the previous sentence. Order of arrangement for for tion foreignjurisdic- practicethe extended practice has of the research framework discussed below than is democratic participation. If mans activity is the guiding light for my thesis. I can be found in multiple pretests and posttests. Compare your ideas to us. The printout lets you compare different cases and qualitative researches the researcher and returned to his plans, in addition. Put your hands because you would like tffer sincere thanks to many other topics goodman, but if you wish to examine the structure is appropriate for your research at hand. Significant figures and by making a conscious effort to be significantly higher beginning english reading scores for each member. Tables and figures can have different boxes which are at wally. It adjusts both groups changed their behavior away from what your units of the model manuscript. One way to go through several cycles of refinement before they are generous provisions for you to introduce why specific avenues of investigation were taken. Tda common power amp. However, a liquid at does not support this view. This section contains suggestions for presenting and publishing your dissertation or thesis. Because this is lofty, but I know is natalia ginzburgs essay he & i, in which all else clearly. Make the most common estimate of how they got that way ourselves, wherever its possible. And you want the caption repeated in the end.
how to find your ipad mini model PDF
Recent Posts
good examples of college essays
Start typing and press Enter to search
|
__label__pos
| 0.907923 |
How to apply a context variable to a Routelet - 6.2
Talend MDM Platform Studio User Guide
EnrichVersion
6.2
EnrichProdName
Talend MDM Platform
task
Data Governance
Data Quality and Preparation
Design and Development
EnrichPlatform
Talend Studio
The context variable stored in the repository can be applied to a Routelet the same way as to any other Routes.
In addition, a Route containing a Routelet allows its Routelet to use different context variables from those the Route is using.
For more information on how to apply a context variable to a Route from the repository, see How to apply Repository context variables to a Job.
|
__label__pos
| 0.638965 |
Calculus How To
Prime Notation (Lagrange), Function & Numbers
Share on
Prime Notation: Contents
Click to skip to the section:
1. What is Prime Notation?
2. Prime Counting Function
3. Prime Number Theorem
4. Prime Numbers
What is Prime Notation?
In calculus, prime notation (also called Lagrange notation) is a type of notation for derivatives. The “prime” is a single tick mark (a “prime”) placed after the function symbol, f.
For example: The function f′(x) is read “f-prime of x.
Higher order derivatives are represented by adding more primes. For example, the third derivative of y with respect to x would be written as y′′′(x). You could, technically, keep adding primes, but most people switch to numerals. For example, the fourth derivative could be written as:
y′′′′(x) = f(4)(x) = f(iv)(x).
Lagrange (1736-1813) first introduced prime notation, but Lagrange prime notation isn’t the only way to symbolize a derivative. Another popular notation is Leibniz notation, which uses the capital Greek letter delta (Δ). Other notations that aren’t used as often include Newton’s Notation and Euler’s notation.
Prime vs Apostophe
Prime notation because it uses the prime symbol (′), which are used to designate units and for other purposes. The prime symbol is commonly used, for example, to designate feet. Don’t confuse it with an apostrophe (′), as they are different characters. Some fonts make it very hard to discern though, and in for most intents and purposes, you can probably get away with just using an apostrophe (except when you’re publishing a paper or book).
Other Meanings for Prime Notation
The prime symbol(′) isn’t exclusively used in differential calculus. Another common use is in geometry, where it is used to denote two distinct, yet similar objects (e.g., vertices B and B’).
The term “Prime Notation” is also sometimes used to mean grouping identical prime numbers together to represent a number. For example, you could write the number 100 as 22 x 55. This is a completely different meaning from the prime notation discussed here.
Connection Between Prime Notation and Numbers
Prime notation and prime numbers are sometimes confused with each other. It’s unfortunate that they are named the same, because there is only a thread of a connection: Some authors occasionally use prime notation (N′)to refer to prime numbers, and that’s where the mathematical connection ends. However, they do share a common meaning for the word “prime”: first.
Prime notation is used to indicate the number of derivatives. A single tick mark (′) denotes the first derivative. This naming convention is attributed to Lagrange, who wrote (in French) “Nous nommerons de plus la premiere fonction derivee f′x, fonction prime; la seconde derivee &prime:′x, fonction seconde;” (Cajori, 1923).
On the other hand, the name prime numbers came from Euclid, who defined prime numbers in The Elements (book 7, definition 1) as follows “A prime number is that which is [divisible] by an unit alone” (Prime Pages, 2021). He used the Greek word “Prôtos”, meaning “first in order of existence”; All numbers can be derived (through multiplication) from primes, which is why they are “First.”
Prime Number Theorem
The Prime Number Theorem helps to calculate probabilities of prime numbers in larger sets. It gives an approximate number of primes less than or equal to any positive real number x.
The theorem states that the “density” of prime numbers in the interval from 1 to x is approximately 1 / ln[x].
The following image shows how the approximation works. The black line is the actual density of primes from 0 to 200. For example, if you look at 40 on the chart, the density is 0.3. This is because there are 12 primes up to x = 40: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 and 37. So the actual density is 12/40 = 0.3. The approximation 1/ln(40) = 0.27, which is a reasonable approximation, albeit a little low. The red line in the graph shows an alternate approximation 1/(ln(40)-1) = .37 — which is a little on the high side.
Consequence of the Prime Number Theorem
An interesting consequence of the prime number theorem is that the average distance between consecutive primes (in the vicinity of n) is the logarithm of n (Robbins, 2006). For example, let’s say you took the interval 900 to 1100 (centered at 1,000). There are 30 prime numbers in the interval 900 to 1100.
The total distances are given in parentheses between each pair:
907 (4) 911 (8) 919 (10) 929 (8) 937 (4) 941 (6) 947 (6) 953 (14) 967 (4) 971 (6) 977 (6) 983 (8) 991 (6) 997 (12) 1009 (4) 1013 (6) 1019 (2) 1021 (10) 1031 (2) 1033 (6) 1039 (10) 1049 (2) 1051 (10) 1061 (2) 1063 (6) 1069 (18) 1087 (4) 1091 (2) 1093 (4) 1097
The average distance is 6.55:
(4 + 8 + 10 + 8 + 4 + 6 + 6 + 14 + 4 + 6 + 6 + 8 + 6 + 12 + 4 + 6 + 2 + 10 + 2 + 6 + 10 + 2 + 10 + 2 + 6 + 18 + 4 + 2 + 4) / 29 = 6.55.
Log(1000) gives us about 6.9. That’s a reasonable approximation, which gets a little better for a greater interval; The average distance from 800 to 1200 is 6.8.
Back to top
Ramanujan prime
A Ramanujan prime is another theory about the number of primes between certain points. The nth Ramanujan prime p is the smallest prime such that there are at least n primes between x and 2x. This is true for any x such that 2x > p.
Prime Counting Function
prime counting function
The prime counting function answers the question “How many primes are there less than or equal to a real number x?” For example, π(2) = 2, because there are two primes less than or equal to 2.
The function is denoted by π(x), which has nothing to do with the number π, ≈3.14. That notation originated with mathematician Edmund Landau in 1909 and is what Eric Weisstein calls “unfortunate”.
The first few values of π(n) for n = {1,2,3,…n} are 0, 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 6. For example, at n = 12 there are 5 primes (2, 3, 5, 7, 11).
There’s More Than One Prime Counting Function
There isn’t one single function that can be called the counting function. In fact, there isn’t a simple arithmetic formula for determining π(n). All are relatively complex, and all are approximations (i.e. every one of them has a margins of error).
Two functions from the literature:
• Minác’s formula (Ribenboim, 1995, p181):
• Willans’ formulae (Ribenboim, 1995, p180):
There are many, many more. Kotnik (2008) discusses many of them , along with the history of the prime counting function, in his paper The prime-counting function and its analytic approximations (PDF).
What is a Prime Number?
Prime numbers are whole numbers (numbers that aren’t fractions) greater than 1 that are divisible only by itself and one. For example, 13 is a prime number because it cannot be divided by anything but 13 and 1.
prime numbers 2
What are primes used for in probability and statistics?
Prime numbers aren’t generally used in statistics (other than those number appearing in data), but statistics and probabilities are used to work with prime numbers in number theory. For example, you might want to find the probability of choosing a prime number from a series of numbers. The odds depend on what interval you choose:
• The probability of finding a prime in the set {0,1,2} is .333, because one out of the three numbers is a prime (1/3 = .333).
• The probability for the set of numbers from 1 to 100 is .25, because 25/100 numbers in that set are primes (which are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97).
Prime numbers look random, but there’s some research using statistical mechanics that suggests a chaos pattern (statistical mechanics is a branch of mathematical physics that studies the behavior of systems). “It is evident that the primes are randomly distributed but, unfortunately, we don’t know what ‘random’ means” (Vaughan, 1990).
Why do we even care about prime numbers in real life or the probability of finding them? You may not realize it, but prime numbers play an important role in many areas of science, including the math behind internet shopping. Prime numbers are the nuts and bolts behind the cryptography that keeps your personal information secure when you shop online.
Is 2 a prime number?
Yes. It’s the first (and only) even prime number.
How many prime numbers are there?
There are an infinite amount of prime numbers. Although new prime numbers are being discovered every day, there’s no end to the amount of primes to be discovered. The proof of this fact goes back to 300 B.C.E. when Euclid outlined it in book IX of The Elements. Proposition 20 states every list of primes (no matter how large) is missing at least one prime number.
What is the Largest Prime Number?
As of the beginning of 2016, the largest prime number was 274,207,281-1 (record stands as of time of writing—September 17, 2017). It is calculated by multiplying 2 by itself 74,207,281 times, then subtracting one. New primes are being found all the time. For the most up-to-date list of the largest prime number, see: GIMPS.
Back to top
References
Borwein, J. and Bailey, D. “Prime Numbers and the Zeta Function.” Mathematics by Experiment: Plausible Reasoning in the 21st Century. Wellesley, MA: A K Peters, pp. 63-72, 2003.
Cajori, F. (1923). The History of Notations of the Calculus. Annals of Mathematics , Sep., 1923, Second Series, Vol. 25, No. 1 (Sep., 1923), pp.
Derbyshire, J. Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics. New York: Penguin, 2004.
Feldman, P. Prime Numbers and their statistical properties. Retrieved September 16, 2017 from: http://phillipmfeldman.org/primes/primes.html
Gonick, L. (1993). The Cartoon Guide to Statistics. HarperPerennial.Hardy, G. H. and Wright, E. M. An Introduction to the Theory of Numbers, 5th ed. Oxford, England: Clarendon Press, 1979.
Great Internet Mersenne Prime Search (GIMPS). Retrieved September 17, 2017 from: http://www.mersenne.org/.
Kotnik, T. (2008). The prime-counting function and its analytic
approximations. Adv Comput Math (2008) 29:55–70
DOI 10.1007/s10444-007-9039-2
Kotz, S.; et al., eds. (2006), Encyclopedia of Statistical Sciences, Wiley.
Prime Pages. FAQ: Why are Prime Numbers called Primes? Retrieved April 8, 2021 from: https://primes.utm.edu/notes/faq/WhyCalledPrimes.html
Ribenboim, P. (1995). The Little Book of Big Primes. Springer Verlag.
Robbins, N. (2006). Beginning Number Theory. Jones and Bartlett Learning.
Vardi, I. Computational Recreations in Mathematica. Reading, MA: Addison-Wesley, pp. 74-76, 1991.
Vaughan, R. (1990). Harald Cramér and the distribution of prime numbers. Retrieved September 16, 2017 from: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.6847
Weisstein, Eric W. “Prime Counting Function.” From MathWorld–A Wolfram Web Resource. http://mathworld.wolfram.com/PrimeCountingFunction.html
Image: Self [CC BY-SA 3.0 (https://creativecommons.org/licenses/by-sa/3.0)]
CITE THIS AS:
Stephanie Glen. "Prime Notation (Lagrange), Function & Numbers" From CalculusHowTo.com: Calculus for the rest of us! https://www.calculushowto.com/calculus-definitions/prime-notation/
------------------------------------------------------------------------------
Need help with a homework or test question? With Chegg Study, you can get step-by-step solutions to your questions from an expert in the field. Your first 30 minutes with a Chegg tutor is free!
|
__label__pos
| 0.963428 |
Sony HXD870 TV Pause problem
Discussion in 'Blu-ray & DVD Players & Recorders' started by Bathbasher, Jan 13, 2008.
1. Bathbasher
Bathbasher
Standard Member
Joined:
Jan 13, 2008
Messages:
2
Products Owned:
0
Products Wanted:
0
Trophy Points:
1
Ratings:
+0
My Sony HXD870 is connected to a Panasonic 26LXD70 by Scart (to AV1 on the TV) and HDMI.
If the Sony is switched on and I press TV Pause the right thing happens: the 870 retunes (if necessary) to the channel the TV is on and starts to record.
If the 870 is off and I'm using the TV's tuner, when I press the TV Pause button on the 870 remote something quite different happens. The 870 starts up, switches the TV to HDMI input and starts sending the TV whatever TV channel its tuner happens to be tuned to. The 870 doesn't start recording.
Anyone understand what is going on here?
Also, I'd be interested in knowing a code to put into the Panasonic remote so that the DVD buttons will work with the Sony.
Thanks for any help given!
2. ramjet
ramjet
Banned
Joined:
May 21, 2006
Messages:
3,761
Products Owned:
0
Products Wanted:
0
Trophy Points:
133
Ratings:
+622
its called read the manual ( rtfm )
you can specify which tuner the recorder is going to use when pause recording , and this can be the sony tuner , or the one the tv is on , so make sure you set that part correctly
3. Gavtech
Gavtech
Administrator
Joined:
Oct 25, 2005
Messages:
21,132
Products Owned:
0
Products Wanted:
0
Trophy Points:
166
Ratings:
+7,047
Welcome to the forum.
The Panasonic TV remote can only operate Panasonic Equipment. It will not accept codes to operate other manufacturers units.
It is commonplace to find DVDR remote controls that can be programmed to operate other manufacturers TV's but not usually the other way around.
4. Bathbasher
Bathbasher
Standard Member
Joined:
Jan 13, 2008
Messages:
2
Products Owned:
0
Products Wanted:
0
Trophy Points:
1
Ratings:
+0
Ramjet - thanks for the quick response.
I've set it to use the TV tuner. And everything works fine if the DVD recorder is on - when you hit TV Pause the 870 retunes to the TV tuner channel and starts recording.
My query is - why is the behaviour so different when you press TV Pause when the 870 is off? I'd expect it either to ignore the command or do the same as normal.
Share This Page
Loading...
|
__label__pos
| 0.606885 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I cant handle one simple (as i thought) task. I have 2 POCO classes which I want to send throuh WCF service:
Estate class withc derive from Advert class, and Locations whitch are related to adverts (adverts belong to some locations Many to many relationship)
Here are my data contract:
[DataContract]
[KnownType(typeof(Location))]
[KnownType(typeof(Estate))]
public abstract class Advert
{
[DataMember]
public int ID { get; set; }
[DataMember]
public decimal? Price { get; set; }
[DataMember]
public byte FromAgent { get; set; }
[DataMember]
public DateTime Date { get; set; }
[DataMember]
public virtual ICollection<Url> Urls { get; set; }
[DataMember]
public virtual ICollection<Location> Locations { get; set; }
[DataMember]
public virtual ICollection<PhoneNumber> PhoneNumbers { get; set; }
}
[KnownType(typeof(Location))]
[DataContract]
public class Estate : Advert
{
[DataMember]
public byte OfferType { get; set; }
[DataMember]
public byte EstateType { get; set; }
[DataMember]
public byte MarketType { get; set; }
[DataMember]
public int? Area { get; set; }
[DataMember]
public byte? Rooms { get; set; }
}
[DataContract]
public class Location
{
[DataMember]
public int ID { get; set; }
[DataMember]
public byte Type { get; set; }
[DataMember]
public string Name { get; set; }
[DataMember]
public string NamePrefix { get; set; }
[DataMember]
public string Feature { get; set; }
[DataMember]
public int NumberOfEstates { get; set; }
[DataMember]
public virtual ICollection<Location> ParentLocations { get; set; }
[DataMember]
public virtual ICollection<Advert> Adverts { get; set; }
}
My Service interface:
[OperationContract]
[ServiceKnownType(typeof(Location))]
IEnumerable<Estate> GetEstates(EstateFilter filter);
Its implementation:
public IEnumerable<Estate> GetEstates(EstateFilter filter)
{
return EstateProcesses.GetEstates(filter);
}
And in business layer:
public static List<Estate> GetEstates(EstateFilter filter)
{
List<Estate> estates;
if (filter==null) filter = new EstateFilter();
using (var ctx = new Database.Context())
{
estates = (from e in ctx.Adverts.OfType<Estate>()
where
(filter.ID == null || e.ID == filter.ID)
&& (filter.DateFrom == null || e.Date >= filter.DateFrom)
&& (filter.DateTo == null || e.Date <= filter.DateTo)
&& (filter.PriceFrom == null || e.Price >= filter.PriceFrom)
&& (filter.PriceTo == null || e.Price <= filter.PriceTo)
&& (filter.FromAgent == null || e.FromAgent == filter.FromAgent)
&& (filter.LocationID == null || e.Locations.Any(l => l.ID == filter.LocationID))
&& (filter.PhoneNumber == null || e.PhoneNumbers.Any(p => p.Number == filter.PhoneNumber))
&& (filter.Url == null || e.Urls.Any(u => u.Address == filter.Url))
select e).ToList();
foreach (var estate in estates)
{
ctx.LoadProperty(estate, e => e.Locations);
}
}
return estates;
}
Exception i obtain is in Polish:
Połączenie gniazda zostało przerwane. Mogło to być spowodowane błędnym przetwarzaniem komunikatu, przekroczeniem limitu czasu odbioru przez zdalny host lub problemem z zasobami sieciowymi podległej sieci. Limit czasu lokalnego gniazda wynosi „00:00:59.9929996”.
In english it would go like:
The socket connection was aborted. This could be caused by an error processing your message or a receive timeout being exceeded by the remote host, or an underlying network resource issue. Local socket timeout was „00:00:59.9929996”.
Server stack trace is following:
Server stack trace:
w System.ServiceModel.Channels.SocketConnection.ReadCore(Byte[] buffer, Int32 offset, Int32 size, TimeSpan timeout, Boolean closing)
w System.ServiceModel.Channels.SocketConnection.Read(Byte[] buffer, Int32 offset, Int32 size, TimeSpan timeout)
w System.ServiceModel.Channels.DelegatingConnection.Read(Byte[] buffer, Int32 offset, Int32 size, TimeSpan timeout)
w System.ServiceModel.Channels.SessionConnectionReader.Receive(TimeSpan timeout)
w System.ServiceModel.Channels.SynchronizedMessageSource.Receive(TimeSpan timeout)
w System.ServiceModel.Channels.FramingDuplexSessionChannel.Receive(TimeSpan timeout)
w System.ServiceModel.Channels.FramingDuplexSessionChannel.TryReceive(TimeSpan timeout, Message& message)
w System.ServiceModel.Dispatcher.DuplexChannelBinder.Request(Message message, TimeSpan timeout)
w System.ServiceModel.Channels.ServiceChannel.Call(String action, Boolean oneway, ProxyOperationRuntime operation, Object[] ins, Object[] outs, TimeSpan timeout)
w System.ServiceModel.Channels.ServiceChannelProxy.InvokeService(IMethodCallMessage methodCall, ProxyOperationRuntime operation)
w System.ServiceModel.Channels.ServiceChannelProxy.Invoke(IMessage message)
Exception rethrown at [0]:
w System.Runtime.Remoting.Proxies.RealProxy.HandleReturnMessage(IMessage reqMsg, IMessage retMsg)
w System.Runtime.Remoting.Proxies.RealProxy.PrivateInvoke(MessageData& msgData, Int32 type)
w IService.GetEstates(EstateFilter filter)
w ServiceClient.GetEstates(EstateFilter filter)
i also use this classes as POCO classes in EF.
and here is the problem: if i send estate without loading locations it works just fine. but if i want to send estate with locations WCFHostClient throws an error.
And a question: How to send through WCF IEnumerable of Estate where each Estate contain ICollection of Location?
share|improve this question
2
You wrote this question and decided it wouldn't be helpful to actually tell us what the error is? – Kirk Woll May 3 '12 at 17:34
sorry, you're right. edited! – user1301357 May 3 '12 at 17:52
You need to tell us what the error is and also check to see if an error is occurring on the server. Is it related to the size of the message? You could try checking if increasing the message size allowed helps. (the actual error you posted doesn't really tell us much) – Sam Holder May 3 '12 at 17:52
1
Enable WCF tracing (msdn.microsoft.com/en-us/library/ms732023.aspx) this way you will find a "better" exception – Rico Suter May 3 '12 at 18:02
2
Your service is generating an exception. in order to find you what is the exception you have to either turn on wcf tracing which will product .trace files which can be read by built it tool in windows or you can turn on the tracing in the web config (<trace enabled="true"/> ) and see the exception by entering the service's url followed by /trace.axd (for example myserviceurl.com/trace.axd) – Koby Mizrahy May 3 '12 at 22:03
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Browse other questions tagged or ask your own question.
|
__label__pos
| 0.638413 |
banner
Data Visualization Using Sankey Diagram
Data Visualization Using Sankey Diagram
Data Visualization is one of the greatest ways to simplify the complexity of understanding relationships among data. Sankey Diagram is one such powerful technique to visualize the association of data elements. They are named after the Irishman Matthew Henry Phineas Riall Sankey, who first used them in a publication on the energy efficiency of a steam engine in 1898. They can be difficult, time-consuming, and very tedious to draw by hand, but nowadays we have various tools to generate these diagrams automatically such as Business Intelligence technologies like Tableau, Google Visualization, D3.JS, etc.
So what are Sankey Diagrams in Data Visualization and how can they be useful?
Sankey diagrams are basically flowing diagrams, in which the width of lines associated with two different nodes is proportional to the value of a metric or key performance indicator. We can also present this kind of information using neural networks and association analysis diagrams. They provide
• flexibility,
• interactivity for the business user to get insight into data at a fast pace
They are a better way to illustrate what are the departments which are holding strong association, thereby we can improve our promotion mix by launching various loyalty schemes with sales kit, which contains products from these two departments at competitive price or we can also take steps to improve the association between departments where we don’t have much penetration.
The below Sankey diagram examples depict a strong association among different departments in the retail organization and we have drawn this diagram using the Google visualization library, we can also create this diagram using S.Draw, Visguy, Fineo, Parallel Sets, Sankey Helper, D3 Sankey Plug-in, etc. This is being widely used in the energy sector to analyze the flow of transmission, and also being used to illustrate anomalies in money and material flow in business organizations.
Sankey Diagram in Data Visualization
How Do You Create A Sankey Diagram?
When looking to make a Sankey diagram, you will be able to generate unique graphs by setting the data source. When creating the diagram, one of the main components that you need to select is the nodes. Various entities (nodes) are defined by text and are referred to as objects. These nodes can either be static or dynamic. You may even want to add titles, graphics, references, and axis scales. You should know this information while making a Sankey diagram.
A Sankey map is used to represent the process of how a certain topic flows through a range of different topics. When this diagram is drawn, the nodes can be connected by a line where the links will signify to you the flow of the topic. For example, a Sankey diagram might show the flow of electricity through an electrical system. It can be used to display the flow of fluid in a pipeline network.
What Types Of Data Can Be Visualized With Sankey Diagrams?
These diagrams are an excellent visualization technique for communicating complicated systems. They can help reveal patterns and aid in troubleshooting, finding bottlenecks, or showing users how processes flow. But they aren’t limited to looking at data like that; here is a breakdown of what else can be analyzed with this useful graphic design.
Sankey charts are very useful in representing streams of data because they help with creating a visual representation of the data. The flow of data through a system, a process, or even a decision process can be analyzed and visualized with a user journey diagram
When analyzing a situation, it’s often difficult to get to the root of a problem when trying to collect data from different perspectives. This diagram can show where the problem exists and how it may affect the overall system.
When Not To Use Sankey Diagram?
The main issue with using a Sankey diagram is that it’s not always going to be accurate. Since the purpose of the diagram is to illustrate the flow of data in a system, it’s important to not put in additional data that will skew the picture, which leads to the next point.
The purpose of this diagram is to illustrate the flow of data in a system and not depict the user experience. Therefore, it’s important to not include anything other than the information being input into the system.
For example, if you were trying to determine how many people had been placed on a waitlist for an upcoming flight and you added the number of passengers and their seating preferences, you would be adding extraneous data that will skew the diagram and make it less accurate. It’s important to keep in mind that a Sankey diagram is only as good as the data you are putting into it.
The main problem with this diagram is that it takes the data being input into a system and uses it to determine the visual representation of that data. There are situations where this is fine, and there are times when it’s not. The issue with a user analysis diagram is that there will always be outliers in the data (in other words, data that doesn’t fit well into the category being illustrated), and it’s very difficult to determine which will be outlying.
For example, if you were adding people to a list for a 30-day wait, and then one person was added to the back of the list, it’s very difficult to tell if that person is in the category for a waitlist or if he/she is just being super slow. This data is likely to appear on the Sankey diagram as outliers, which is why this type of visual can be ineffective for some information.
Also, in Sankey diagrams, it may be difficult to compare flows with similar values. If you want to do so, try using stacked bar graphs instead.
Conclusion:
Putting this tool into the hands of the people who know rather than having a graphic artist in the process allows users the opportunity to visualize a wide range of processes such as
• production cost optimization by understanding process flow at ease.
• energy losses of a particular machine.
• material flows within specific economic sectors.
• improve operational efficiency and support a more sustainable business operation.
• effective cash flow analysis in business organizations.
Adding your own visual graphics to the Sankey Diagram in Data Visualization gives rich interactive visualization, resulting in attractive graphics for information materials and effective visual data exploration practices!
An Engine That Drives Customer Intelligence
Oyster is not just a customer data platform (CDP). It is the world’s first customer insights platform (CIP). Why? At its core is your customer. Oyster is a “data unifying software.”
Liked This Article?
Gain more insights, case studies, information on our product, customer data platform
Leave a comment
|
__label__pos
| 0.985693 |
Thursday, November 17, 2011
Building Generic Links
I've been wondering lately — what good having the server-side web application generate URLs when the client side code is just as capable? Indeed, there is no way we'd ever want to hard-code the application URL paths inside the Javascript code. So why even entertain the notion?
Speaking in terms of overhead — with each URL on a given page, some CPU expense is incurred when constructing each URL. I'm making a presumption here in assuming URLs are in fact being constructed and not just hard-coded in templates. In reality, the overhead is inconsequential, but in some generic circumstances, I see absolutely no reason why these URL's can't be assembled locally on the user's browser.
Why URLs Are Constructed
It's for the best that URL's passed to the browser by the web application are constructed rather than stored statically. Ad-hoc construction of URLs doesn't solve any problems either. For example, if on one page you're formatting a string that'll be returned as a URL, and on another page, another set of URL construction functionality, it's difficult to establish patterns of reuse. Sure, we're able to share some of this code among our application's components — but why should we have to define this capability ourselves?
Look no further than Django's URL resolution architecture for an example of how URLs are specified in one place and one place only. These are base URLs — they can take on different forms by inserting values into path segments. For instance, search strings or object identities.
The rest of the Django application can construct — resolve in Django-speak — the URL to use. What I really like about this methodology is that URLs are treated just like classes in object oriented programming languages. The URL blueprint is defined once, individual instances of the URL are constructed as many times necessary. Some URL instances are simple — they take no additional attributes. They have no path segments to fill in or no query strings to append. In the case of more complex URL instances, we have the URL resolution framework at our disposal — a consistent approach to instantiate our URL blueprints, passing in any additional details the URL class requires in order to make them unique and identifiable.
The theme here being that URLs can, and should be, a generalized concept — just like other systems we build. We're able to abstract away much complexity into classes, instantiating objects, letting the class machinery take care of eliminating what would be otherwise redundant repetitions of URL construction code. Sticking with the Django URL resolution architecture as the example, because it illustrates so well how URLs can be constructed, consider user interface code. The templates. The Django template system comes with a URL tag to help instantiate URLs directly in the user interface. Again, when templates are rendered, we're injecting URL instances into the template. It's from here that we can follow the logical extension into generic URLs in Javascript.
Javascript And URLs
Javascript can do a lot with URLs that the web application, running on the web server doesn't necessarily need to deal with. But why would we want to use Javascript? Shouldn't we stick with the URL construction kit offered by the web application framework? Well, for the most part, I'd say yes, it is a good idea to use things like the url tag, if you're building a Django template. Stick with the infrastructure provided for building URLs and you'll never worry about whether the correct URL is passed to the user interface. Just reference the URL blueprint by name and let the URL instance take care of the rest.
User interfaces in web applications follow patterns. That is a given. From one page to the next, controls repeat themselves. Things like pagination come to mind. Any given page with a list of objects on it uses pagination controls as a means to avoid dumping every object on a single page — making it impossible for the user to navigate in a cogent manor. The common items, or, generic items rather, are the list and the paginator. The list of objects and how they're rendered can be generalized inside the Django template. As can the pagination controls. These controls move back and forth through a set of objects — usually by appending constraints on the URL.
So how does this paginator change from one set of objects to the next? How does it distinguish between one type of object list and the next? Well, the reality is that it doesn't change much for different object types, or, at all. Forward in motion and backward in motion. Generic behavior that doesn't necessarily warrant using the URL resolution system. Any Javascript code that runs on the page already knows about the current URL — just look it up in the window object. We know how to move forward and backward through a list — just update the current URL. For instance, the browser URL is simply updated from /objects/page1 to /objects/page2. There isn't a need to invoke the URL construction code for this — let the client take care of generic things like this where it makes sense while saving server CPU cycles for more important things.
No comments :
Post a Comment
|
__label__pos
| 0.987043 |
0
A DELETE statement requires an exclusive lock on a table.If there are a significant number of deletes while simultaneously there is also a lot of SELECT traffic, this may impact performance. One trick that can be used is to turn the delete into an insert!
Consider the following example:
CREATE TABLE events
(eventid INT UNSIGNED AUTO_INCREMENT PRIMARY KEY,
title CHAR(40));
Instead of deleting from the events table, interfering with all the selects, we do the following:
CREATE TABLE event_deletes (eventid INT UNSIGNED PRIMARY KEY);
To delete an event:
INSERT INTO event_deletes (329);
Now, to retrieve all non-deleted events:
SELECT e.eventid, e.title
FROM events e
LEFT JOIN event_deletes ed
ON e.eventid = ed.eventid
WHERE ed.eventid IS NULL;
or with a subquery :
SELECT e.eventid,e.title
FROM events e
WHERE NOT EXISTS
(SELECT * FROM event_deletes ed WHERE ed.eventid = e.eventid);
These SELECT statements merely use the index on the eventid column in the event_deletes table, no row data needs to be retrieved. During a maintenance timeslot, a script can go through the deleted items and delete the actual rows from the main table.
DELETE events
FROM events e,event_deletes ed
WHERE e.eventid = ed.eventid
DELETE FROM events_delete
2
Contributors
1
Reply
2
Views
9 Years
Discussion Span
Last Post by kronass
0
Thank you very much for the tip but i have a question
in this case I have to add an other join to the select Query and as every one knows that the joins decrease the performance in the query and they recommend to decrease the joins as much as possible if the performance in the Query is highly considered
and subquery doesn't make it look better then join in performance.
and secondly if I need to delete any thing instead of one query I have to do three queries
first insert to delete table
secondly delete from the main table
third delete from delete table
I know in database these operations are nothing and can be preformed fast.
may be this method is not for low load database requests
what I need is a prove that this tip is right, and how you got to this conclusion
if you proved it to me that this works faster with heavy load requests I will definitely use it
This question has already been answered. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.
|
__label__pos
| 0.641741 |
Skip to content
HTTPS clone URL
Subversion checkout URL
You can clone with
or
.
Download ZIP
Compose, decouple and manage domain logic and data persistence separately. Works particularly great for composing form objects!
Ruby
README.md
Datamappify is no longer being maintained. It started off with a noble goal, unfortunately due to it being on the critical path of our project, we have decided not to continue developing it given the lack of development time from me.
Feel free to read the README and browse the code, I still believe in the solutions for this particular domain.
For a more active albeit still young project, check out Lotus::Model.
Datamappify Gem Version Build Status Coverage Status Code Climate
Compose, decouple and manage domain logic and data persistence separately. Works particularly great for composing form objects!
Overview
The typical Rails (and ActiveRecord) way of building applications is great for small to medium sized projects, but when projects grow larger and more complex, your models too become larger and more complex - it is not uncommon to have god classes such as a User model.
Datamappify tries to solve two common problems in web applications:
1. The coupling between domain logic and data persistence.
2. The coupling between forms and models.
Datamappify is loosely based on the Repository Pattern and Entity Aggregation, and is built on top of Virtus and existing ORMs (ActiveRecord and Sequel, etc).
There are three main design goals:
1. To utilise the powerfulness of existing ORMs so that using Datamappify doesn't interrupt too much of your current workflow. For example, Devise would still work if you use it with a UserAccount ActiveRecord model that is attached to a User entity managed by Datamappify.
2. To have a flexible entity model that works great with dealing with form data. For example, SimpleForm would still work with nested attributes from different ORM models if you map entity attributes smartly in your repositories managed by Datamappify.
3. To have a set of data providers to encapsulate the handling of how the data is persisted. This is especially useful for dealing with external data sources such as a web service. For example, by calling UserRepository.save(user), certain attributes of the user entity are now persisted on a remote web service. Better yet, dirty tracking and lazy loading are supported out of the box!
Datamappify consists of three components:
• Entity contains models behaviour, think an ActiveRecord model with the persistence specifics removed.
• Repository is responsible for data retrieval and persistence, e.g. find, save and destroy, etc.
• Data as the name suggests, holds your model data. It contains ORM objects (e.g. ActiveRecord models).
Below is a high level and somewhat simplified overview of Datamappify's architecture.
Note: Datamappify is NOT affiliated with the Datamapper project.
Built-in ORMs for Persistence
You may implement your own data provider and criteria, but Datamappify comes with build-in support for the following ORMS:
• ActiveRecord
• Sequel
Requirements
• ruby 2.0+
• ActiveModel 4.0+
Installation
Add this line to your application's Gemfile:
gem 'datamappify'
Usage
Entity
Entity uses Virtus DSL for defining attributes and ActiveModel::Validations DSL for validations.
The cool thing about Virtus is that all your attributes get coercion for free!
Below is an example of a User entity, with inline comments on how some of the DSLs work.
class User
include Datamappify::Entity
attribute :first_name, String
attribute :last_name, String
attribute :age, Integer
attribute :passport, String
attribute :driver_license, String
attribute :health_care, String
# Nested entity composition - composing the entity with attributes and validations from other entities
#
# class Job
# include Datamappify::Entity
#
# attributes :title, String
# validates :title, :presence => true
# end
#
# class User
# # ...
# attributes_from Job
# end
#
# essentially equals:
#
# class User
# # ...
# attributes :title, String
# validates :title, :presence => true
# end
attributes_from Job
# optionally you may prefix the attributes, so that:
#
# class Hobby
# include Datamappify::Entity
#
# attributes :name, String
# validates :name, :presence => true
# end
#
# class User
# # ...
# attributes_from Hobby, :prefix_with => :hobby
# end
#
# becomes:
#
# class User
# # ...
# attributes :hobby_name, String
# validates :hobby_name, :presence => true
# end
attributes_from Hobby, :prefix_with => :hobby
# Entity reference
#
# `references` is a convenient method for:
#
# attribute :account_id, Integer
# attr_accessor :account
#
# and it assigns `account_id` the correct value:
#
# user.account = account #=> user.account_id = account.id
references :account
validates :first_name, :presence => true,
:length => { :minimum => 2 }
validates :passport, :presence => true,
:length => { :minimum => 8 }
def full_name
"#{first_name} #{last_name}"
end
end
Entity inheritance
Inheritance is supported for entities, for example:
class AdminUser < User
attribute :level, Integer
end
class GuestUser < User
attribute :expiry, DateTime
end
Lazy loading
Datamappify supports attribute lazy loading via the Lazy module.
class User
include Datamappify::Entity
include Datamappify::Lazy
end
When an entity is lazy loaded, only attributes from the primary source (e.g. User entity's primary source would be ActiveRecord::User as specified in the corresponding repository) will be loaded. Other attributes will only be loaded once they are called. This is especially useful if some of your data sources are external web services.
Repository
Repository maps entity attributes to DB columns - better yet, you can even map attributes to different ORMs!
Below is an example of a repository for the User entity, you can have more than one repositories for the same entity.
class UserRepository
include Datamappify::Repository
# specify the entity class
for_entity User
# specify the default data provider for unmapped attributes
# optionally you may use `Datamappify.config` to config this globally
default_provider :ActiveRecord
# specify any attributes that need to be mapped
#
# for attributes mapped from a different source class, a foreign key on the source class is required
#
# for example:
# - 'last_name' is mapped to the 'User' ActiveRecord class and its 'surname' attribute
# - 'driver_license' is mapped to the 'UserDriverLicense' ActiveRecord class and its 'number' attribute
# - 'passport' is mapped to the 'UserPassport' Sequel class and its 'number' attribute
# - attributes not specified here are mapped automatically to 'User' with provider 'ActiveRecord'
map_attribute :last_name, :to => 'User#surname'
map_attribute :driver_license, :to => 'UserDriverLicense#number'
map_attribute :passport, :to => 'UserPassport#number', :provider => :Sequel
map_attribute :health_care, :to => 'UserHealthCare#number', :provider => :Sequel
# alternatively, you may group attribute mappings if they share certain options:
group :provider => :Sequel do
map_attribute :passport, :to => 'UserPassport#number'
map_attribute :health_care, :to => 'UserHealthCare#number'
end
# attributes can also be reverse mapped by specifying the `via` option
#
# for example, the below attribute will look for `hobby_id` on the user object,
# and map `hobby_name` from the `name` attribute of `ActiveRecord::Hobby`
#
# this is useful for mapping form fields (similar to ActiveRecord's nested attributes)
map_attribute :hobby_name, :to => 'Hobby#name', :via => :hobby_id
# by default, Datamappify maps attributes using an inferred reference (foreign) key,
# for example, the first mapping below will look for the `user_id` key in `Bio`,
# the second mapping below will look for the `person_id` key in `Bio` instead
map_attribute :bio, :to => 'Bio#body'
map_attribute :bio, :to => 'Bio#body', :reference_key => :person_id
end
Repository inheritance
Inheritance is supported for repositories when your data structure is based on STI (Single Table Inheritance), for example:
class AdminUserRepository < UserRepository
for_entity AdminUser
end
class GuestUserRepository < UserRepository
for_entity GuestUser
map_attribute :expiry, :to => 'User#expiry_date'
end
In the above example, both repositories deal with the ActiveRecord::User data model.
Override mapped data models
Datamappify repository by default creates the underlying data model classes for you. For example:
map_attribute :driver_license, :to => 'UserData::DriverLicense#number'
In the above example, a Datamppify::Data::Record::ActiveRecord::UserDriverLicense ActiveRecord model will be created. If you would like to customise the data model class, you may do so by creating one either under the default namespace or under the Datamappify::Data::Record::NameOfDataProvider namespace:
module UserData
class DriverLicense < ActiveRecord::Base
# your customisation...
end
end
module Datamappify::Data::Record::ActiveRecord::UserData
class DriverLicense < ::ActiveRecord::Base
# your customisation...
end
end
Repository APIs
More repository APIs are being added, below is a list of the currently implemented APIs.
Retrieving an entity
Accepts an id.
user = UserRepository.find(1)
Checking if an entity exists in the repository
Accepts an entity.
UserRepository.exists?(user)
Retrieving all entities
Returns an array of entities.
users = UserRepository.all
Searching entities
Returns an array of entities.
Simple
users = UserRepository.where(:first_name => 'Fred', :driver_license => 'AABBCCDD')
Match
users = UserRepository.match(:first_name => 'Fre%', :driver_license => '%bbcc%')
Advanced
You may compose search criteria via the criteria method.
users = UserRepository.criteria(
:where => {
:first_name => 'Fred'
},
:order => {
:last_name => :asc
},
:limit => [10, 20]
)
Currently implemented criteria options:
• where(Hash)
• match(Hash)
• order(Hash)
• limit(Array)
Note: it does not currently support searching attributes from different data providers.
Saving/updating entities
Accepts an entity.
There is also save! that raises Datamappify::Data::EntityNotSaved.
UserRepository.save(user)
Datamappify supports attribute dirty tracking - only dirty attributes will be saved.
Mark attributes as dirty
Sometimes it's useful to manually mark the whole entity, or some attributes in the entity to be dirty. In this case, you could:
UserRepository.states.mark_as_dirty(user) # marks the whole entity as dirty
UserRepository.states.find(user).changed? #=> true
UserRepository.states.find(user).first_name_changed? #=> true
UserRepository.states.find(user).last_name_changed? #=> true
UserRepository.states.find(user).age_changed? #=> true
Or:
UserRepository.states.mark_as_dirty(user, :first_name, :last_name) # marks only first_name and last_name as dirty
UserRepository.states.find(user).changed? #=> true
UserRepository.states.find(user).first_name_changed? #=> true
UserRepository.states.find(user).last_name_changed? #=> true
UserRepository.states.find(user).age_changed? #=> false
Destroying an entity
Accepts an entity.
There is also destroy! that raises Datamappify::Data::EntityNotDestroyed.
Note that due to the attributes mapping, any data found in mapped records are not touched. For example the corresponding ActiveRecord::User record will be destroyed, but ActiveRecord::Hobby that is associated will not.
UserRepository.destroy(user)
Initialising an entity
Accepts an entity class and returns a new entity.
This is useful for using before_init and after_init callbacks to set up the entity.
UserRepository.init(user_class) #=> user
Callbacks
Datamappify supports the following callbacks via Hooks:
• before_init
• before_load
• before_find
• before_create
• before_update
• before_save
• before_destroy
• after_init
• after_load
• after_find
• after_create
• after_update
• after_save
• after_destroy
Callbacks are defined in repositories, and they have access to the entity. For example:
class UserRepository
include Datamappify::Repository
before_create :make_me_admin
before_create :make_me_awesome
after_save :make_me_smile
private
def make_me_admin(entity)
# ...
end
def make_me_awesome(entity)
# ...
end
def make_me_smile(entity)
# ...
end
# ...
end
Note: Returning either nil or false from the callback will cancel all subsequent callbacks (and the action itself, if it's a before_ callback).
Association
Datamappify also supports entity association. It is experimental and it currently supports the following association types:
• belongs_to (partially implemented)
• has_one
• has_many
Set up your entities and repositories:
# entities
class User
include Datamappify::Entity
has_one :title, :via => Title
has_many :posts, :via => Post
end
class Title
include Datamappify::Entity
belongs_to :user
end
class Post
include Datamappify::Entity
belongs_to :user
end
# repositories
class UserRepository
include Datamappify::Repository
for_entity User
references :title, :via => TitleRepository
references :posts, :via => PostRepository
end
class TitleRepository
include Datamappify::Repository
for_entity Title
end
class PostRepository
include Datamappify::Repository
for_entity Post
end
Usage examples:
new_post = Post.new(post_attributes)
another_new_post = Post.new(post_attributes)
user = UserRepository.find(1)
user.title = Title.new(title_attributes)
user.posts = [new_post, another_new_post]
persisted_user = UserRepository.save!(user)
persisted_user.title #=> associated title
persisted_user.posts #=> an array of associated posts
Nested attributes in forms
Like ActiveRecord and ActionView, Datamappify also supports nested attributes via fields_for or simple_fields_for.
# slim template
= simple_form_for @post do |f|
= f.input :title
= f.input :body
= f.simple_fields_for :comment do |fp|
= fp.input :author_name
= fp.input :comment_body
Default configuration
You may configure Datamappify's default behaviour. In Rails you would put it in an initializer file.
Datamappify.config do |c|
c.default_provider = :ActiveRecord
end
Built-in extensions
Datamappify ships with a few extensions to make certain tasks easier.
Kaminari
Use Criteria with page and per.
UserRepository.criteria(
:where => {
:gender => 'male',
:age => 42
},
:page => 1,
:per => 10
)
API Documentation
More Reading
You may check out this article for more examples.
Changelog
Refer to CHANGELOG.
Todo
• Performance tuning and query optimisation
• Authoritative source.
• Support for configurable primary keys and reference (foreign) keys.
Similar Projects
Credits
License
Licensed under MIT
Bitdeli Badge
Something went wrong with that request. Please try again.
|
__label__pos
| 0.685389 |
From Fedora Project Wiki
Obsolete
As of Fedora 18, installer-based upgrades have been replaced by FedUp, which was itself replaced by the DNF_system_upgrade plugin. See Category:Upgrade_system.
Description
This case tests upgrading from the current stable release (Fedora 40) to the development release (Fedora 41) while using the default bootloader configuration option in text mode.
How to test
1. Perform a default installation of the previous Fedora release (Fedora 40)
2. Do a full system update
3. Boot the Fedora 41 installer using any available means (boot.iso, PXE or DVD.iso) , passing the command line argument text
4. After anaconda is started successfully, select default language and keyboard layout, and then select the system to be upgraded
5. Accept whichever bootloader configuration option is the default
6. After upgrade finished, reboot the system
7. Login upgraded system and perform some basic operations
Expected Results
1. The system should be upgraded to Fedora 41 version without error
2. The system should be able to boot into the new Fedora version without error
3. The system applications should work correctly
|
__label__pos
| 0.939154 |
Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Consider the following problem:
A fair coin is to be tossed 100 times, with each toss resulting in a head or a tail. Let $$H:=\textrm{the total number of heads}$$ and $$T:=\textrm{the total number of tails},$$ which of the following events has the greatest probability?
A. $H=50$
B. $T\geq 60$
C. $51\leq H\leq 55$
D. $H\geq 48$ and $T\geq 48$
E. $H\leq 5$ or $H\geq 95$
What I can think is the direct calculation: $$P(a_1\leq H\leq a_2)=\sum_{k=a_1}^{k=a_2}C_{100}^k(\frac{1}{2})^k(\frac{1}{2})^{100-k}$$
Here is my question:
Is there any quick way to solve this problem except the direct calculation?
share|improve this question
4 Answers 4
up vote 5 down vote accepted
Here is a very elementary way of estimating these probabilities. Observe that the distribution of $H$ is very similar to a normal distribution with mean $50$ and standard deviation $\sigma = 5$. In particular, we should have
$$ P (|H-50| \leq \sigma) \;\approx\; 68\% \qquad\text{and}\qquad P(|H-50| \leq 2\sigma) \;\approx\; 95\% $$
As mixedmath pointed out, the only viable answers are B, D, and E. We can estimate the probabilities of these events as follows:
B. $P(H \geq 60) \;=\; P(H \geq 50 + 2\sigma)$, which should be on the order of 2.5%.
D. $P(48\leq H \leq 52) \;=\; P(|H-50| \leq \sigma/2)$, so this should be something like 40%.
E. $P(H\leq 5\text{ or }H \geq 95) \;=\; P(|H-50| \geq 9\sigma)$, so this should be really small.
Thus (D) is the correct answer.
share|improve this answer
The normal approximation is used here. So one is supposed to have the table of the pdf of normal distribution, right? – Jack Jun 6 '11 at 5:06
2
@Jack: Everyone in the whole world should memorize the following two facts: (1) a normal distribution is within $\sigma$ of the mean about 68% of the time (2) a normal distribution is within $2\sigma$ of the mean about 95% of the time. All of my calculations here follow from these. – Jim Belk Jun 6 '11 at 9:16
1
Hmm, I think you are talking about the 68-95-99.7 rule. It's enough to get B and E. But I don't think I can convince myself that I can get D unless I use the picture. – Jack Jun 6 '11 at 14:43
+1 I was going to answer exactly this. – leonbloy Jun 6 '11 at 14:58
@Jack: I agree that getting D also requires knowing what the normal distribution looks like. The 40% isn't very exact: I divided 68% by two and then rounded up a bit. – Jim Belk Jun 6 '11 at 17:15
Chebyshev's inequality, combined with mixedmath's and some other observations, shows that the answer has to be D without doing the direct calculations.
First, rewrite D as $48 \leq H \leq 52$. A is a subset of D, and because the binomial distribution with $n = 100$ and $p = 0.5$ is symmetric about $50$, C is less likely than D. So, as mixedmath notes, A and C can be ruled out.
Now, estimate the probability of D. We have $P(H = 48) = \binom{100}{48} 2^{-100} > 0.07$. Since $H = 48$ and $H=52$ are equally probable and are the least likely outcomes in D, $P(D) > 5(0.07) = 0.35$.
Finally, $\sigma_H = \sqrt{100(0.5)(0.5)} = 5$. So the two-sided version of Chebyshev says that $P(E) \leq \frac{1}{9^2} = \frac{1}{81}$, since E asks for the probability that $H$ takes on a value 9 standard deviations away from the mean. The one-sided version of Chebyshev says that $P(B) \leq \frac{1}{1+2^2} = \frac{1}{5}$, since B asks for the probability that $H$ takes on a value 2 standard deviations smaller than the mean.
So D must be the most probable event.
Added: OP asks for more on why $P(C) < P(D)$. Since the binomial($100,50$) distribution is symmetric about $50$, $P(H = i) > P(H = j)$ when $i$ is closer to $50$ than $j$ is. Thus $$P(C) = P(H = 51) + P(H = 52) + P(H = 53) + P(H = 54) + P(H = 55)$$ $$< P(H = 50) + P(H=51) + P(H = 49) + P(H = 52) + P(H = 48) = P(D),$$ by directly comparing probabilities.
share|improve this answer
Why C is less likely than D? – Jack Jun 6 '11 at 4:05
@Jack: I added to my answer. Does that help? – Mike Spivey Jun 6 '11 at 5:17
Fair enough. Thanks. – Jack Jun 6 '11 at 5:23
Yes. In the following, which uses (almost) nothing beyond what is already in the problem statement, the calculations involve only simple arithmetic with one-digit numbers (and $10$) and easy estimates involving fractions of two-digit numbers: the stuff of mental arithmetic.
Let $P(k)$ represent the probability of $k$ heads. From the (intuitively obvious) facts that (i) $P(k) \gt 0$ for $0 \le k \le 100$, (ii) $P(k)$ increases from $k=0$ to $k=50$ and then decreases from $k=50$ to $k=100$, and (iii) $P(k) = P(100-k)$, we easily establish the inequalities
$$D \gt C, D \gt A, B \gt E.$$
I claim that actually $A \gt B$ (i.e., the chance of exactly 50 heads exceeds the chance of 60 or more tails), which establishes $D$ as the answer. To see this, look at the relative probabilities. They all have a common factor of $100!/2^{100}$ which we can ignore, focusing on the binomial coefficients that are left. Now a series of simple estimates establishes
$$P(40) / P(50) = \frac{50}{60} \frac{49}{59} \cdots \frac{41}{51} \lt \left(\frac{5}{6}\right)^{10} \lt \frac{1}{1 + 10(1/5)} = \frac{1}{3}.$$
(The ratio actually is less than $1/7$.) Moreover,
$$P(39) / P(50) = \frac{40}{61} P(40)/P(50) \lt \frac{2}{3} P(40)/P(50).$$
Continuing in like vein we see that the chance of $A$ relative to that of $B$, $\left(P(0) + P(1) + \cdots + P(40)\right)/P(50)$, is dominated by a geometric series with starting term $P(40)/P(50)$ and common ratio $2/3$. Therefore its sum is less than $1/3 (1 - 2/3)^{-1} = 1.$ This proves the claim.
share|improve this answer
+1: I like this. I don't follow the step $(5/6)^{10} < 1/(1+10(1/5))$, though. Am I missing something obvious? – Mike Spivey Jun 7 '11 at 3:22
@Mike $(6/5)^{10} = (1 + 1/5)^{10} = 1 + 10/5 + |O(1/5^2)| \gt 3$. Take the reciprocal. – whuber Jun 7 '11 at 13:09
Got it. Thanks. – Mike Spivey Jun 7 '11 at 15:31
In short: no. But you can cut a few things out immediately. For example, A is nonsense. A is eaten by C. And C is eaten by D.
So you need only to check B, D, and E. Of course, depending on your intuition, you might have a 'feel' for how unlikely E is as well. But that isn't as certain.
share|improve this answer
Actually, in my intuition D feels less likely than E. – gfes Jun 6 '11 at 1:39
It is perhaps more obvious that A is less than D, since it is a subset. – Henry Jun 6 '11 at 9:41
@gfes: the point is that extremely unbalanced results, as in E, are extremely unlikely. So even though you have 12 choices in E and 5 in D, D will be much more likely. – Ross Millikan Jun 6 '11 at 12:45
I know. Intuition can be a tricky thing in probability. – gfes Jun 6 '11 at 16:13
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.992656 |
Can't set Default value on primary key to be table_name_id_seq
Hi,
We are in the process of moving from Retool Cloud to self-hosting. I have a simple table with a normal int4 primary key. However, somewhere in the migration process (export to CSV, import to new table etc), the PK does not have a Default value.
I can see that the sequence I want to use exists:
select * from pg_sequences where sequencename = 'org_team_id_seq'
...returns data so the sequence is there. I tried altering the sequence to set it to the max value in the id column:
ALTER SEQUENCE company_team_id_seq RESTART WITH 342;
However I continue to get the message:
Error: column "id" of relation "company_team" is an identity column
Any ideas? Do I need to recreate the table?
Regards,
Nick
Struggling with the same error message. Want to add a column to a table in retool database, making it with auto-increment and than as a primary key. At first the default value with the id_seq is there, but after closing and opening the table the default i gone, and when rewriting it as default I get the error: Error: column "id" of relation "service_log" is an identity column.
1 Like
Struggling with the same error. I am still on Cloud but had trouble setting the primary key and now I can't find a way to reinsert this logic with the seq_id I am getting same error as you are
Same issue here... unable to insert an auto-incrementing logic into existing primary key field.
Please advise!
What happens if you set the column type to this?
Screenshot 2024-01-25 at 11.13.14 AM
Hi @kschirrmacher, thank you for the response.
Unfortunately, this is an existing primary key field and that option is no longer available.
Hi all,
It's not a solution, but we recently migrated back to Cloud from our self-hosted instance. As part of this I re-created all tables manually. The table which I was having this issue with is now behaving properly. So perhaps the quickest way past this is re-creating the table (if possible). I guess it depends how many foreign keys you may need to patch as a result.
Nick
1 Like
That's my easy fix suggestion too. Either create a second table, migrate programmatically and rename or export it, drop the table and re-create.
1 Like
Also fixed it by dropping the table and starting over. Deleting the table in the retool database interface didn't fix it. Had the same problem after creating a new table with the same name. Dropped it with postgrlsql command to make it work.
How/where can I see the status and existence of these autoincrementing sequences?
Hi @ThomasW
You can query/update from within Retool (a DB resource). For example, checking the contacts.id sequence:
SELECT nextval('contacts_id_seq');
You can also connect to the DB using pgAdmin or similar tool. Screenshot here of my connection via pgAdmin.
The connection details are under Resources / Retool Database -> Connection
Regards,
Nick
2 Likes
Thank you Nick. This is very helpful!
This also just "happened" to the primary key column of one of our db tables. I'm getting the same error when trying to update the default value. The table was working just fine last week... very frustrating. The retool hosted db has a history of odd behavior in our experience. What is going on in this case?
|
__label__pos
| 0.865994 |
summaryrefslogtreecommitdiff
path: root/src/lib/elementary/elm_colorselector_eo.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/elementary/elm_colorselector_eo.h')
-rw-r--r--src/lib/elementary/elm_colorselector_eo.h203
1 files changed, 203 insertions, 0 deletions
diff --git a/src/lib/elementary/elm_colorselector_eo.h b/src/lib/elementary/elm_colorselector_eo.h
new file mode 100644
index 0000000..84fe60a
--- /dev/null
+++ b/src/lib/elementary/elm_colorselector_eo.h
@@ -0,0 +1,203 @@
1#ifndef _ELM_COLORSELECTOR_EO_H_
2#define _ELM_COLORSELECTOR_EO_H_
3
4#ifndef _ELM_COLORSELECTOR_EO_CLASS_TYPE
5#define _ELM_COLORSELECTOR_EO_CLASS_TYPE
6
7typedef Eo Elm_Colorselector;
8
9#endif
10
11#ifndef _ELM_COLORSELECTOR_EO_TYPES
12#define _ELM_COLORSELECTOR_EO_TYPES
13
14/**
15 * @brief Different modes supported by Colorselector
16 *
17 * See also @ref elm_obj_colorselector_mode_set,
18 * @ref elm_obj_colorselector_mode_get.
19 *
20 * @ingroup Elm_Colorselector
21 */
22typedef enum
23{
24 ELM_COLORSELECTOR_PALETTE = 0, /**< Only color palette is displayed. */
25 ELM_COLORSELECTOR_COMPONENTS, /**< Only color selector is displayed. */
26 ELM_COLORSELECTOR_BOTH, /**< Both Palette and selector is displayed, default.
27 */
28 ELM_COLORSELECTOR_PICKER, /**< Only color picker is displayed. */
29 ELM_COLORSELECTOR_ALL /**< All possible color selector is displayed. */
30} Elm_Colorselector_Mode;
31
32
33#endif
34/** Elementary colorselector class
35 *
36 * @ingroup Elm_Colorselector
37 */
38#define ELM_COLORSELECTOR_CLASS elm_colorselector_class_get()
39
40EWAPI const Efl_Class *elm_colorselector_class_get(void);
41
42/**
43 * @brief Set color to colorselector.
44 *
45 * @param[in] obj The object.
46 * @param[in] r Red value of color
47 * @param[in] g Green value of color
48 * @param[in] b Blue value of color
49 * @param[in] a Alpha value of color
50 *
51 * @ingroup Elm_Colorselector
52 */
53EOAPI void elm_obj_colorselector_picked_color_set(Eo *obj, int r, int g, int b, int a);
54
55/**
56 * @brief Get current color from colorselector.
57 *
58 * @param[in] obj The object.
59 * @param[out] r Red value of color
60 * @param[out] g Green value of color
61 * @param[out] b Blue value of color
62 * @param[out] a Alpha value of color
63 *
64 * @ingroup Elm_Colorselector
65 */
66EOAPI void elm_obj_colorselector_picked_color_get(const Eo *obj, int *r, int *g, int *b, int *a);
67
68/**
69 * @brief Set current palette's name
70 *
71 * When colorpalette name is set, colors will be loaded from and saved to
72 * config using the set name. If no name is set then colors will be loaded from
73 * or saved to "default" config.
74 *
75 * @param[in] obj The object.
76 * @param[in] palette_name Name of palette
77 *
78 * @ingroup Elm_Colorselector
79 */
80EOAPI void elm_obj_colorselector_palette_name_set(Eo *obj, const char *palette_name);
81
82/**
83 * @brief Get current palette's name
84 *
85 * Returns the currently set palette name using which colors will be
86 * saved/loaded in to config.
87 *
88 * @param[in] obj The object.
89 *
90 * @return Name of palette
91 *
92 * @ingroup Elm_Colorselector
93 */
94EOAPI const char *elm_obj_colorselector_palette_name_get(const Eo *obj);
95
96/**
97 * @brief Set Colorselector's mode.
98 *
99 * Colorselector supports three modes palette only, selector only and both.
100 *
101 * @param[in] obj The object.
102 * @param[in] mode Elm_Colorselector_Mode
103 *
104 * @ingroup Elm_Colorselector
105 */
106EOAPI void elm_obj_colorselector_mode_set(Eo *obj, Elm_Colorselector_Mode mode);
107
108/**
109 * @brief Get Colorselector's mode.
110 *
111 * @param[in] obj The object.
112 *
113 * @return Elm_Colorselector_Mode
114 *
115 * @ingroup Elm_Colorselector
116 */
117EOAPI Elm_Colorselector_Mode elm_obj_colorselector_mode_get(const Eo *obj);
118
119/**
120 * @brief Get list of palette items.
121 *
122 * Note That palette item list is internally managed by colorselector widget
123 * and it should not be freed/modified by application.
124 *
125 * @param[in] obj The object.
126 *
127 * @return The list of color palette items.
128 *
129 * @since 1.9
130 *
131 * @ingroup Elm_Colorselector
132 */
133EOAPI const Eina_List *elm_obj_colorselector_palette_items_get(const Eo *obj);
134
135/**
136 * @brief Get the selected item in colorselector palette.
137 *
138 * @param[in] obj The object.
139 *
140 * @return The selected item, or @c null if none selected.
141 *
142 * @since 1.9
143 *
144 * @ingroup Elm_Colorselector
145 */
146EOAPI Elm_Widget_Item *elm_obj_colorselector_palette_selected_item_get(const Eo *obj);
147
148/**
149 * @brief Add a new color item to palette.
150 *
151 * @param[in] obj The object.
152 * @param[in] r Red value of color
153 * @param[in] g Green value of color
154 * @param[in] b Blue value of color
155 * @param[in] a Alpha value of color
156 *
157 * @return A new color palette Item.
158 *
159 * @ingroup Elm_Colorselector
160 */
161EOAPI Elm_Widget_Item *elm_obj_colorselector_palette_color_add(Eo *obj, int r, int g, int b, int a);
162
163/** Clear the palette items.
164 *
165 * @ingroup Elm_Colorselector
166 */
167EOAPI void elm_obj_colorselector_palette_clear(Eo *obj);
168
169EWAPI extern const Efl_Event_Description _ELM_COLORSELECTOR_EVENT_COLOR_ITEM_SELECTED;
170
171/** Called when color item was selected
172 * @return Efl_Object *
173 *
174 * @ingroup Elm_Colorselector
175 */
176#define ELM_COLORSELECTOR_EVENT_COLOR_ITEM_SELECTED (&(_ELM_COLORSELECTOR_EVENT_COLOR_ITEM_SELECTED))
177
178EWAPI extern const Efl_Event_Description _ELM_COLORSELECTOR_EVENT_COLOR_ITEM_LONGPRESSED;
179
180/** Called when color item got a long press
181 * @return Efl_Object *
182 *
183 * @ingroup Elm_Colorselector
184 */
185#define ELM_COLORSELECTOR_EVENT_COLOR_ITEM_LONGPRESSED (&(_ELM_COLORSELECTOR_EVENT_COLOR_ITEM_LONGPRESSED))
186
187EWAPI extern const Efl_Event_Description _ELM_COLORSELECTOR_EVENT_CHANGED;
188
189/** Called when colorselector changed
190 *
191 * @ingroup Elm_Colorselector
192 */
193#define ELM_COLORSELECTOR_EVENT_CHANGED (&(_ELM_COLORSELECTOR_EVENT_CHANGED))
194
195EWAPI extern const Efl_Event_Description _ELM_COLORSELECTOR_EVENT_CHANGED_USER;
196
197/** Called when the object changed due to user interaction
198 *
199 * @ingroup Elm_Colorselector
200 */
201#define ELM_COLORSELECTOR_EVENT_CHANGED_USER (&(_ELM_COLORSELECTOR_EVENT_CHANGED_USER))
202
203#endif
|
__label__pos
| 0.984014 |
Class: Middleman::Blog::BlogData
Inherits:
Object
• Object
show all
Extended by:
Gem::Deprecate
Includes:
UriTemplates
Defined in:
lib/middleman-blog/blog_data.rb
Overview
A store of all the blog articles in the site, with accessors for the articles by various dimensions. Accessed via “blog” in templates.
Instance Attribute Summary collapse
Instance Method Summary collapse
Methods included from UriTemplates
apply_uri_template, date_to_params, extract_directory_path, extract_params, safe_parameterize, uri_template
Instance Attribute Details
#controllerObject (readonly)
Returns the value of attribute controller.
24
25
26
# File 'lib/middleman-blog/blog_data.rb', line 24
def controller
@controller
end
#optionsThor::CoreExt::HashWithIndifferentAccess (readonly)
The configured options for this blog
Returns:
• (Thor::CoreExt::HashWithIndifferentAccess)
22
23
24
# File 'lib/middleman-blog/blog_data.rb', line 22
def options
@options
end
#source_templateURITemplate (readonly)
A URITemplate for the source file path relative to :source_dir
Returns:
• (URITemplate)
18
19
20
# File 'lib/middleman-blog/blog_data.rb', line 18
def source_template
@source_template
end
Instance Method Details
#articlesArray<Middleman::Sitemap::Resource>
A list of all blog articles, sorted by descending date
Returns:
• (Array<Middleman::Sitemap::Resource>)
53
54
55
# File 'lib/middleman-blog/blog_data.rb', line 53
def articles
@_articles.select(&(options.filter || proc { |a| a })).sort_by(&:date).reverse
end
#articles_by_locale(locale = ::I18n.locale) ⇒ Array<Middleman::Sitemap::Resource>
TODO:
should use the @_articles if represented in this method.
A list of all blog articles with the given language, sorted by descending date
Parameters:
• locale (Symbol) (defaults to: ::I18n.locale)
Language to match (optional, defaults to I18n.locale).
Returns:
• (Array<Middleman::Sitemap::Resource>)
80
81
82
83
# File 'lib/middleman-blog/blog_data.rb', line 80
def articles_by_locale(locale = ::I18n.locale)
locale = locale.to_sym if locale.is_a? String
articles.select { |article| article.locale == locale }
end
#extract_source_params(path) ⇒ Object
111
112
113
# File 'lib/middleman-blog/blog_data.rb', line 111
def extract_source_params(path)
@_parsed_url_cache[:source][path] ||= extract_params(@source_template, path)
end
#extract_subdir_params(path) ⇒ Object
118
119
120
# File 'lib/middleman-blog/blog_data.rb', line 118
def extract_subdir_params(path)
@_parsed_url_cache[:subdir][path] ||= extract_params(@subdir_template, path)
end
#inspectObject
183
184
185
# File 'lib/middleman-blog/blog_data.rb', line 183
def inspect
"#<Middleman::Blog::BlogData: #{articles.inspect}>"
end
#local_articles(locale = ::I18n.locale) ⇒ Array<Middleman::Sitemap::Resource>
Deprecated.
Use #articles_by_locale instead.
A list of all blog articles with the given language, sorted by descending date
Parameters:
• locale (Symbol) (defaults to: ::I18n.locale)
Language to match (optional, defaults to I18n.locale).
Returns:
• (Array<Middleman::Sitemap::Resource>)
66
67
68
# File 'lib/middleman-blog/blog_data.rb', line 66
def local_articles(locale = ::I18n.locale)
articles_by_locale(locale)
end
#manipulate_resource_list(resources)
This method returns an undefined value.
Updates’ blog articles destination paths to be the permalink.
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
# File 'lib/middleman-blog/blog_data.rb', line 127
def manipulate_resource_list(resources)
@_articles = []
used_resources = []
resources.each do |resource|
if resource.ignored?
# Don't bother blog-processing ignored stuff
used_resources << resource
next
end
if (params = extract_source_params(resource.path))
article = convert_to_article(resource)
next unless publishable?(article)
# Add extra parameters from the URL to the page metadata
extra_data = params.except 'year', 'month', 'day', 'title', 'lang', 'locale'
article. page: extra_data unless extra_data.empty?
# compute output path: substitute date parts to path pattern
article.destination_path = template_path @permalink_template, article, extra_data
@_articles << article
elsif (params = extract_subdir_params(resource.path))
# It's not an article, but it's the companion files for an article
# (in a subdirectory named after the article)
# figure out the matching article for this subdirectory file
article_path = @source_template.expand(params).to_s
if (article = @app.sitemap.find_resource_by_path(article_path))
# The article may not yet have been processed, so convert it here.
article = convert_to_article(article)
next unless publishable?(article)
# Add extra parameters from the URL to the page metadata
extra_data = params.except 'year', 'month', 'day', 'title', 'lang', 'locale'
article. page: extra_data unless extra_data.empty?
# The subdir path is the article path with the index file name
# or file extension stripped off.
new_destination_path = template_path @subdir_permalink_template, article, extra_data
resource.destination_path = Middleman::Util.normalize_path(new_destination_path)
end
end
used_resources << resource
end
used_resources
end
#publishable?(article) ⇒ Boolean
Whether or not a given article should be included in the sitemap. Skip articles that are not published unless the environment is :development.
Parameters:
Returns:
• (Boolean)
whether it should be published
194
195
196
# File 'lib/middleman-blog/blog_data.rb', line 194
def publishable?(article)
@app.environment == :development || article.published?
end
#tagsHash<String, Array<Middleman::Sitemap::Resource>>
Returns a map from tag name to an array of BlogArticles associated with that tag and assigns the tag array back into it.
Returns:
• (Hash<String, Array<Middleman::Sitemap::Resource>>)
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
# File 'lib/middleman-blog/blog_data.rb', line 91
def tags
tags = {}
# Reference the filtered articles
articles.each do |article|
# Reference the tags assigned to an article
article.tags.each do |tag|
# tag = safe_parameterize(tag)
tags[tag] ||= []
tags[tag] << article
end
end
# Return tags
tags
end
|
__label__pos
| 0.672695 |
Using The Console
From The Powder Toy
Revision as of 12:38, 20 April 2021 by LBPHacker (talk | contribs) (Reverted edits by jessebuit1234 (talk) to last revision by MishaSh)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Language: English • Deutsch • 中文
The Powder Toy now uses the Lua console, which lets you do more than the old console. If you just want to do simple things, this console has easier and shorter commands.
Using console
As of 49.1 the commands now require a ! in front of them, and are also Lua enabled(Lua Scripts)
The console in Powder Toy is essentially a window that you can bring up that allows you to directly trigger commands coded into TPT. Because of its closeness to the code itself, you can do interesting things with it that wouldn't ordinarily be possible with just pointing and clicking, or even elaborate hacking.
Opening the console is easy. You press the ~ key (on some keyboards it's ` or ¬ or ^/° on QWERTZ-keyboards) (with or without pressing shift, it's immediately left of the 1 key, above Tab on most keyboards) and the game will pause, bringing down a black window that you can type into.
Compared to most consoles, Powder Toy's is actually fairly intuitive and easy to mess with, but you'll still probably have to try a few times to memorize the order of words to type in.
The most relevant, or at least the most immediately cool and useful command that most people will want to know is the Set command. The syntax goes like this:
!set [What variable to set] [the identity of the particle/s to be set] [the value it changes to]
In other words, say I want to change particle #25 into metal. I would type:
!set type 25 metl
More relevantly, you can use the keyword "All" or even an element name in place of that number. So the command:
!set type all metl
Would turn every particle in the save to metal.
!set type metl watr
...Would turn every particle of metal in the save to water. And so on.
!set type metl 0
Would remove all metal particles from the save.
The word "Type" is also interchangeable. The following keywords can be used as well:
• Type: This sets a particle's identity. You can use this to change what an element is.
• Temp: This sets a particle's temperature. You can use it to melt a whole save all at once. (please note: the temp is read as Kelvin which you get by adding 273.15 to Celsius)
• Ctype: This sets the temporary state of an element. This has many uses, making lava that freezes into NEUT for example. To do this, draw on some lava then go to console and type "!set ctype lava neut" (without the quotes) and then hit enter. Then draw something at room temp below it, and unpause it. When the lava hits the cooler object it will freeze into neut. Ctype is also used to choose what element CLNE and its variants will create.
• Life: This sets a particle's life expectancy. This variable however is used for many varied things, like the timing of spark and the colors of fire.
• X, Y, VX, VY: These set the X and Y positions of particles in the field. VX and VY respectively set their velocities.
• Tmp: This is used for varying things, like the colors of Quartz.
• Tmp2: Like a second Tmp, used for less things.
• Pavg[0], Pavg[1], and flags are rarely used.
The !Quit command is a straight forward one; it closes the powder toy straight away.
!Quit
The Create command is also pretty straight-forward. By typing the elements name and the coordinates you want it at, you can create a particle of any element. For example:
!create METL 200,100
This will create a pixel of METL (metal) at point (200,100) on TPT's grid.
The !delete/!kill commands are also similar, they delete a particle at a point:
!delete 200,100
This deletes the particle you just created.
The !load command loads a specific save number. This loads save number 500000:
!load 500000
The !bubble command creates a bubble of soap at a specific point. It is hard to create them without this.
!bubble 100,100
The !reset command can do a lot of things. !reset velocity sets the velocity of all particles to 0. !reset pressure resets the pressure map, like pressing the = key. !reset sparks gets rid of all sparks on the screen and sets their type to their ctype. !reset temp sets all particles back to their default temperature they have when you draw them.
This wiki page does not cover the other commands yet. The page of the console essentially describes how to use it, and with these examples, take and figure it out.
Some other commands:
!reset
The if command can only be used in scripts. It checks if a particle at index i is the type j
!if type 1,dmnd
This would check if parts[1].type is diamond and return 1 if true, 0 if not.
Running scripts
You can run console commands stored in a file by creating a text document and writing a script.
When you have done that, open the console in the Powder Toy and type in
'dofile("your filename here")'. It might say scripts are not enabled.
The script will be done once, and you can use any normal commands, if, else, endif, and end. Running scripts with Lua gives you a lot more options for what to do, and lets you run it every frame.
Hints and tips on using tmp, life, tmp2, and ctype
ctype
• Clone (BCLN, PCLN, CLNE, PBCN): ctype is the element being generated by the clone. For example, you can make all the clne on the screen generate neutrons with the console/script command "!set ctype clne neut"
• State changes (ICE, LAVA): ctype is the element to melt/freeze into. For example, you can make lava freeze into bomb like this "!set ctype lava bomb". That actually gets some interesting results.
• SPRK: ctype is the element covered by the spark.
• Color (PHOT, FILT, FWRK, GLOW, BRAY): ctype is used to store various bits of information about color. There is currently no simple way to change this with console.
• PIPE: Ctype distinguishes the different types of pipe (red/green/blue/unallocated). There is currently no simple way to change this with console (but experiment with setting ctype to none, dust, watr, oil, fire). For more information on pipe, see Using PIPE element.
• QRTZ: QRTZ growth uses ctype. For example, the natural way is to pour SLTW on it. The SLTW changes the ctype to DUST. "!set ctype qrtz sprk" will cause rapid, unnatural growth. This used to be caused by sparking QRTZ manually.
• WWLD: The different types of WWLD(Electron head, tail, wire) are distinguished by it's ctype. Try experimenting with ctypes DUST, WATR and none.
• Life: ctype changes the type of life it is.
• Using ctype, you can make molten ice and molten diamond with this code: for molten ice, put ice then type " !set ctype ice lava " then type " !set temp ice 500 " and the ice in the world will become molten ice. Molten diamond occurs when you place lava then use " !set ctype lava dmnd ". This goes along with the above mentioned state changes.
tmp
Tmp is a value used for various element properties. Only a few elements use it. NOTE: this is NOT temperature (which is called 'temp'). Tmp can also change the channels of WIFI (but the "temp" or temperature value control the tmp value and it has no sense to change the tmp from the console).
• PIPE: the type of the element currently contained in the pipe. Use '!set tmp pipe 0' to remove all particles from all pipes.
• CRAY: the length of the beam. Use !set tmp cray 0 to set it to default.
• DRAY: how many particles to copy (default is 0, or until blank space). Use !set tmp dray 0 to set it to default.
• FILT: tmp changes the operator on FILT:
0: "set" mode (default): FILT's spectrum is copied into PHOT particles that pass through it
1: "and" mode: A bitwise and is performed on PHOT's and FILT's spectrums and the result is stored in the PHOT particle, any wavelengths not present in FILT will be removed from PHOT.
2: "or" mode: Performs a bitwise or: all wavelengths present in FILT are "enabled" in PHOT, if not already.
3: "sub" mode: Performs a bitwise and-not: all wavelengths present in FILT are subtracted from PHOT.
4: "red shift" mode: The wavelengths of a photon are red-shifted. The distance of the shift is calculated from the temperature in a way similar to its non-ctype mode of operation. Tmp value is ignored.
5: "blue shift" mode: Like "red shift", but the shifting direction is opposite, wavelengths are moved towards the blue end.
6: "nop" mode: No spectrum changes are performed. Useful if you want to cross beams of PHOT and ARAY without mangling the spectrum.
7: "xor" mode: Performs a bitwise xor: all wavelengths present in FILT are "flipped" in PHOT's spectrum, that is, if some color was on, it turns off, and vice versa.
8: "not" mode: Performs a bitwise not: all wavelengths of PHOT are flipped. Note that FILT's spectrum is ignored.
9: "QRTZ scattering" mode: Randomizes photons' velocity and randomly changes their color, just like QRTZ.
Changing the tmp value of SING can allow the manual change of the amount of matter it has consumed, useful for making bombs.
Anything else is the same as nop mode, but it is recommended to use 6 for nop in case new modes are added. Use !set tmp filt <operator number>.
life
Use this with with fire or plasma to make it have more or less time until it burns out. For example, "!set life fire 1000" to make it last for a VERY long time (even to the point it is unrealistically still glowing even after its temperature has cooled to room temperature, same with plasma). Use with fuse to make it be in the already burning state by reducing this number to something really low like 1 (command for that is "!set life fuse 1"). You can use it to basically put any element into a state that uses the same special property but use it either much more, better, longer, shorter, worse, or less.
E.G.:
• DEUT has a property that says it can multiply itself based on its temperature. It is possible to use life to make it obey this property but at the same time make it use it vastly more. As in, 99999 life DEUT (which cannot actually save, maximum save-able life of DEUT is 65535) makes it expand across the whole screen.
• Another closely studied use of the life variable is what it does to ACID. Acid is corrosive. It has a set life value of 75 that cannot be raised without editing the game engine. The more particles acid corrodes away the lesser its life value becomes. If set below fifty any particle can destroy acid.
• Switches, like SWCH, HSWC, PCLN, and PUMP, also use life to turn on and off.
• Portals use life to generate their effects. This is one of the only times life goes into negative naturally.
• Stickman's health can be changed by editing his life.
• SPRK uses not only ctype, but life as well. SPRK on most metals has a life of 4. This shows how long the spark will remain on the material. The material afterward then uses life to calculate when it can be sparked again.
• Coal uses life to slowly burn. It starts with a life of 110. Contact with fire decreases life, and when life reaches 0, it is replaced with a particle of fire,
tmp2
tmp2 is similar to tmp, except it is less used due to it being a secondary property.
E.G:
• QRTZ/PQRT: tmp2 changes the colour of them. Use !set tmp2 qrtz <number between 0 and 10>
• VIRS/VIRG/VRSS: Used to set the element being infected. Use !set tmp2 virs <element id or name>
• CRAY: Used for types of life.
• DRAY: Used for spacing between original and duplicate. Use !set tmp2 dray <spacing>
• PIPE/STOR: Used for types of life (but not possible to do normally)
Complex Console Commands
There are many console commands that can be used to manipulate things such as gravity for elements. Here are some examples. tpt.el.metl.gravity=5 changes all METL particles in the save to have a gravity of five and therefore travel downward. tpt.el.gas.diffusion=10 changes the diffusion (or how far the particles spread apart) to a higher level. These are just a few examples of the hundreds of the complex commands unknown to many TPT users.
https://www.boxmein.net/tpt/tptelements/reference/lua-reference.html#tree
Video Tutorial
Video tutorial for console commands on Youtube: https://youtu.be/1rVk9jzyjUI
|
__label__pos
| 0.678167 |
Infinite Visions
How to Install and Configure Citrix for Infinite Visions
Installation
1. Install from the appropriate source for your operating system:
2. Wait for the installation to finish, and then follow the configuration steps.
Configure Citrix Workspace to connect to Infinite Visions
1. Open Citrix Workspace, click the "Add Account" option.
2. When prompted for the server, type iv.cascadetech.org, and then click add.
3. When prompted, enter your username (finance\<username>) and IV password.
4. You may get prompted a second time to enter the same IV username and password (finance\<username>).
5. At the Infinite Visions login window, select the desired Connection Group name from the list (i.e. fiscal year), and click the Login button.
6. Done.
Creation date: 10/19/2018 10:36 AM (dthrush) Updated: 8/4/2021 10:36 AM (jgates)
|
__label__pos
| 0.597713 |
আগামী ৩০ অক্টোবর -২০১৭ তারিখ থেকে শুরু হচ্ছে পাঁচ মাস ব্যাপী Professional Web Design and Development with HTML,CSS,Bootstrap,PHP,MySQl, AJAX and JQUERY কোর্সের ৮৬ তম ব্যাচ। আগ্রহীদেরকে অতিসত্বর মাসুদ আলম স্যার এর সাথে যোগাযোগ করতে অনুরোধ করা যাচ্ছে। স্যার এর মোবাইল: 01722817591, Email : [email protected] কোর্সের সিলেবাস এর জন্য এখানে ক্লিক করুন ।
CRUD WITH PHP SOAP
I would like to show how can we make a simple CRUD project with PHP Simple Object Access Protocol (SOAP).
Description: SOAP
User Interface
Here is the file structures where I made the project
Student Table Query
CREATE TABLE `student` (
`id` int(11) NOT NULL AUTO_INCREMENT,
`name` varchar(60) NOT NULL,
`email` varchar(60) NOT NULL,
`address` varchar(255) NOT NULL,
PRIMARY KEY (`id`)
) ENGINE=InnoDB AUTO_INCREMENT=1 DEFAULT CHARSET=latin1;
In the Db.php file has Mysql Database Connection and DML methods insert, update, delete and retrieve the rows
<?php
class Db {
// Host and Database information
private $host = "localhost";
private $user = "root";
private $pass = "";
private $db = "crud_soap";
private $mysqli;
public function __construct(){
// Database Connection
$this->mysqli = new Mysqli($this->host, $this->user, $this->pass, $this->db);
// Checking the connection is okay or not
if ($this->mysqli->connect_error) {
die('Connect Error (' . $mysqli->connect_errno . ') ' . $mysqli->connect_error);
}
}
/**
* Closing the DB connection
* @params null
* @return void
*/
public function __destruct(){
$this->mysqli->close();
}
/**
* Data insertion in student table
* @params $name, $email, $address
* @return (int) insert_id
*/
public function insert($name, $email, $address){
$this->mysqli->query("INSERT INTO student (id, name, email, address) VALUES (null, '$name', '$email', '$address')");
return $this->mysqli->insert_id;
}
/**
* Data updating in student table
* @params $id, $name, $email, $address
* @return (boolean)
*/
public function update($id, $name, $email, $address){
return $this->mysqli->query("UPDATE student SET name='$name', email='$email', address='$address' WHERE id=$id");
}
/**
* Data deletion from student table
* @params $id
* @return (boolean)
*/
public function delete($id){
return $this->mysqli->query("DELETE FROM student WHERE id=$id");
}
/**
* Data retriving from student table
* @params $condition (optional)
* @return (array) mixed
*/
public function getAll($condition=""){
$result = $this->mysqli->query("SELECT * FROM student $condition");
return $result->fetch_all(MYSQLI_ASSOC);
}
/**
* Row data retriving from student table according to $id
* @params $id
* @return (array) mixed
*/
public function getById($id){
return $this->mysqli->query("SELECT * FROM student WHERE id=$id")->fetch_assoc();
}
}
?>
The server.php file has configuration of SOAP SERVER. Here included the Db.php file and made an object of SOAPServer and set the Db Class up.
<?php
include "Db.php";
try {
$server = new SOAPServer(
NULL,
array(
'uri' => 'http://localhost/crud_soap/lib/server.php'
)
);
// SETTING UP THE Db CLASS
$server->setClass('Db');
$server->handle();
}
catch (SOAPFault $f) {
print $f->faultstring; exit;
}
?>
In the client.php file has $client object of SoapClient with server file path as location and uri and trace true. The trace option enables tracing of request so faults can be back traced.
<?php
$client = new SoapClient(null, array(
'location' => "http://localhost/crud_soap/lib/server.php",
'uri' => "http://localhost/crud_soap/lib/server.php",
'trace' => 1
)
);
?>
CREATE
Okay, Now going to insert data into student table. So, first need a form! Here you go the form create.php
<!DOCTYPE html>
<html>
<head>
<title>Create Data</title>
</head>
<body>
<div style="width: 500px; margin: 20px auto;">
<!-- showing the message here-->
<div><?php echo $message;?></div>
<table width="100%" cellpadding="5" cellspacing="1" border="1">
<form action="create.php" method="post">
<tr>
<td>Name:</td>
<td><input name="name" type="text"></td>
</tr>
<tr>
<td>Email:</td>
<td><input name="email" type="text"></td>
</tr>
<tr>
<td>Address:</td>
<td><textarea name="address"></textarea></td>
</tr>
<tr>
<td><a href="read.php">See Data</a></td>
<td><input name="submit_data" type="submit" value="Insert Data"></td>
</tr>
</form>
</table>
</div>
</body>
</html>
So, we got the form but now we need the insertion process. Here you go the processing code
<?php
$message = ""; // initial message
if( isset($_POST['submit_data']) ){
// Includes client to get $client object
include 'lib/client.php';
// Gets the data from post
$name = $_POST['name'];
$email = $_POST['email'];
$address = $_POST['address'];
/**
* Calling the "insert" method by "__soapCall" from SOAP SERVER
* $client: object of SOAP CLIENT
* @params: $name, $email, $address
*/
if( $client->__soapCall("insert", array($name, $email, $address)) ){
$message = "Data is inserted successfully.";
}else{
$message = "Sorry, Data is not inserted.";
}
}
?>
NOTE: I am going to make the form and data insertion process in same file for the User Interface.
Finally create.php
<?php
$message = ""; // initial message
if( isset($_POST['submit_data']) ){
// Includes client to get $client object
include 'lib/client.php';
// Gets the data from post
$name = $_POST['name'];
$email = $_POST['email'];
$address = $_POST['address'];
/**
* Calling the "insert" method by "__soapCall" from SOAP SERVER
* $client: object of SOAP CLIENT
* @params: $name, $email, $address
*/
if( $client->__soapCall("insert", array($name, $email, $address)) ){
$message = "Data is inserted successfully.";
}else{
$message = "Sorry, Data is not inserted.";
}
}
?>
<!DOCTYPE html>
<html>
<head>
<title>Create Data</title>
</head>
<body>
<div style="width: 500px; margin: 20px auto;">
<!-- showing the message here-->
<div><?php echo $message;?></div>
<table width="100%" cellpadding="5" cellspacing="1" border="1">
<form action="create.php" method="post">
<tr>
<td>Name:</td>
<td><input name="name" type="text"></td>
</tr>
<tr>
<td>Email:</td>
<td><input name="email" type="text"></td>
</tr>
<tr>
<td>Address:</td>
<td><textarea name="address"></textarea></td>
</tr>
<tr>
<td><a href="read.php">See Data</a></td>
<td><input name="submit_data" type="submit" value="Insert Data"></td>
</tr>
</form>
</table>
</div>
</body>
</html>
READ
Now, I am going to show the read functionality. Here the file read.php
NOTE: In this file included the client.php to getting the $client object and retrieving the all students from student table by calling “getAll” method. Here “__soapCall” is the method of SoapClient where two Parameters are mandatory 1st parameter is “method name (getAll)” and 2nd one is the parameter list of method of 1st parameter ( parameters of getAll ).
<?php
// Includes client to get $client object
include 'lib/client.php';
/**
* Calling the "getAll" method by "__soapCall" from SOAP SERVER
* $client: object of SOAP CLIENT
* @params: null
*/
$result = $client->__soapCall("getAll", array());
?>
<!DOCTYPE html>
<html>
<head>
<title>Data List</title>
</head>
<body>
<div style="width: 500px; margin: 20px auto;">
<a href="create.php">Create New</a>
<table width="100%" cellpadding="5" cellspacing="1" border="1">
<tr>
<td>Name</td>
<td>Email</td>
<td>Address</td>
<td>Action</td>
</tr>
<?php foreach($result as $row) {?>
<tr>
<td><?php echo $row['name'];?></td>
<td><?php echo $row['email'];?></td>
<td><?php echo $row['address'];?></td>
<td>
<a href="update.php?id=<?php echo $row['id'];?>">Edit</a> |
<a href="delete.php?id=<?php echo $row['id'];?>" onclick="return confirm('Are you sure?');">Delete</a>
</td>
</tr>
<?php } ?>
</table>
</div>
</body>
</html>
UPDATE
update.php here i am retrieving the row data from student table according to the selected id (look at the url of below image to get the selected id). Getting the id from URL by GET method and retrieving the row data by calling “getById” method where $id is the parameter of “getById” method.
$id = $_GET['id']; // id from url
/**
* Calling the "getById" method by "__soapCall" from SOAP SERVER
* $client: object of SOAP CLIENT
* @params: $id
*/
$data = $client->__soapCall("getById", array($id));
?>
<!DOCTYPE html>
<html>
<head>
<title>Update Data</title>
</head>
<body>
<div style="width: 500px; margin: 20px auto;">
<!-- showing the message here-->
<div><?php echo $message;?></div>
<table width="100%" cellpadding="5" cellspacing="1" border="1">
<form action="" method="post">
<input type="hidden" name="id" value="<?php echo $id;?>">
<tr>
<td>Name:</td>
<td><input name="name" type="text" value="<?php echo $data['name'];?>"></td>
</tr>
<tr>
<td>Email:</td>
<td><input name="email" type="text" value="<?php echo $data['email'];?>"></td>
</tr>
<tr>
<td>Address:</td>
<td><textarea name="address"><?php echo $data['address'];?></textarea> </td>
</tr>
<tr>
<td><a href="read.php">Back</a></td>
<td><input name="submit_data" type="submit" value="Update Data"></td>
</tr>
</form>
</table>
</div>
</body>
</html>
We are getting the previous data in above form but we need to process the form data to be updated. Here is the update processing code
<?php
$message = ""; // initial message
// Includes client to get $client object
include 'lib/client.php';
// Updating the table row with submited data according to id once form is submited
if( isset($_POST['submit_data']) ){
// Gets the data from post
$id = $_POST['id'];
$name = $_POST['name'];
$email = $_POST['email'];
$address = $_POST['address'];
/**
* Calling the "update" method by "__soapCall" from SOAP SERVER
* $client: object of SOAP CLIENT
* @params: $id, $name, $email, $address
*/
if( $client->__soapCall("update", array($id, $name, $email, $address)) ){
$message = "Data is updated successfully.";
}else{
$message = "Sorry, Data is not updated.";
}
}
NOTE: I am going to make the form and data update process in same file for the User Interface.
Finally update.php
<?php
$message = ""; // initial message
// Includes client to get $client object
include 'lib/client.php';
// Updating the table row with submited data according to id once form is submited
if( isset($_POST['submit_data']) ){
// Gets the data from post
$id = $_POST['id'];
$name = $_POST['name'];
$email = $_POST['email'];
$address = $_POST['address'];
/**
* Calling the "update" method by "__soapCall" from SOAP SERVER
* $client: object of SOAP CLIENT
* @params: $id, $name, $email, $address
*/
if( $client->__soapCall("update", array($id, $name, $email, $address)) ){
$message = "Data is updated successfully.";
}else{
$message = "Sorry, Data is not updated.";
}
}
$id = $_GET['id']; // id from url
/**
* Calling the "getById" method by "__soapCall" from SOAP SERVER
* $client: object of SOAP CLIENT
* @params: $id
*/
$data = $client->__soapCall("getById", array($id));
?>
<!DOCTYPE html>
<html>
<head>
<title>Update Data</title>
</head>
<body>
<div style="width: 500px; margin: 20px auto;">
<!-- showing the message here-->
<div><?php echo $message;?></div>
<table width="100%" cellpadding="5" cellspacing="1" border="1">
<form action="" method="post">
<input type="hidden" name="id" value="<?php echo $id;?>">
<tr>
<td>Name:</td>
<td><input name="name" type="text" value="<?php echo $data['name'];?>"></td>
</tr>
<tr>
<td>Email:</td>
<td><input name="email" type="text" value="<?php echo $data['email'];?>"></td>
</tr>
<tr>
<td>Address:</td>
<td><textarea name="address"><?php echo $data['address'];?></textarea> </td>
</tr>
<tr>
<td><a href="read.php">Back</a></td>
<td><input name="submit_data" type="submit" value="Update Data"></td>
</tr>
</form>
</table>
</div>
</body>
</html>
DELETE
delete.php In this file deleting the row from student table according to the selected id which id is getting from URL(like update). The deletion confirmation are taking from read.php file (see the below image) by clicking on delete button.
NOTE: If confirmation is “ok” then below code will be executed. Here called the “delete” method with $id as parameter.
<?php
// Includs client to get $client object
include 'lib/client.php';
$id = $_GET['id']; // id from url
/**
* Calling the "delete" method by "__soapCall" from SOAP SERVER
* $client: object of SOAP CLIENT
* @params: $id
*/
if( $client->__soapCall("delete", array($id)) ){
$message = "Record is deleted successfully.";
}else {
$message = "Sorry, Record is not deleted.";
}
echo $message;
?>
<a href="read.php">Back to List</a>
Conclution
It was a simple CRUD with PHP SOAP. You can get an idea from this program to work with PHP SOAP. To download the source code Download Source.
I am Bakul Sinha Full Stack Software Developer. Currently working as a Senior Software Engineer at Byteshake Limited (UK Based Company). I have been working on Web Application Development, Website Design and Development last 5 years and Android Apps Development last 1 year.
3 comments on “CRUD WITH PHP SOAP
Leave a Reply
Your email address will not be published. Required fields are marked *
|
__label__pos
| 0.512939 |
Patchwork [4/4] ubiattach: introduce max_beb_per1024 in UBI_IOCATT
login
register
mail settings
Submitter Richard Genoud
Date Aug. 17, 2012, 2:57 p.m.
Message ID <[email protected]>
Download mbox | patch
Permalink /patch/178242/
State New
Headers show
Comments
Richard Genoud - Aug. 17, 2012, 2:57 p.m.
The ioctl UBI_IOCATT has been extended with max_beb_per1024 parameter.
This parameter is used for adjusting the "maximum expected number of
bad blocks per 1024 blocks" for each mtd device.
The number of physical erase blocks (PEB) that UBI will reserve for bad
block handling is now:
whole_flash_chipset__PEB_number * max_beb_per1024 / 1024
This means that for a 4096 PEB NAND device with 3 MTD partitions:
mtd0: 512 PEB
mtd1: 1536 PEB
mtd2: 2048 PEB
the commands:
ubiattach -m 0 -d 0 -b 20 /dev/ubi_ctrl
ubiattach -m 1 -d 1 -b 20 /dev/ubi_ctrl
ubiattach -m 2 -d 2 -b 20 /dev/ubi_ctrl
will attach mtdx to UBIx and reserve:
80 PEB for bad block handling on UBI0
80 PEB for bad block handling on UBI1
80 PEB for bad block handling on UBI2
=> for the whole device, 240 PEB will be reserved for bad block
handling.
This may seems a waste of space, but as far as the bad blocks can appear
every where on a flash device, in the worst case scenario they can
all appear in one MTD partition.
So the maximum number of expected erase blocks given by the NAND
manufacturer should be reserve on each MTD partition.
Signed-off-by: Richard Genoud <[email protected]>
---
tests/fs-tests/integrity/integck.c | 1 +
ubi-utils/include/libubi.h | 2 +
ubi-utils/libubi.c | 2 +
ubi-utils/ubiattach.c | 41 +++++++++++++++++++++++++++++-------
4 files changed, 38 insertions(+), 8 deletions(-)
Patch
diff --git a/tests/fs-tests/integrity/integck.c b/tests/fs-tests/integrity/integck.c
index 30322cd..f12dfac 100644
--- a/tests/fs-tests/integrity/integck.c
+++ b/tests/fs-tests/integrity/integck.c
@@ -3152,6 +3152,7 @@ static int reattach(void)
req.mtd_num = args.mtdn;
req.vid_hdr_offset = 0;
req.mtd_dev_node = NULL;
+ req.max_beb_per1024 = 0;
err = ubi_attach(libubi, "/dev/ubi_ctrl", &req);
if (err)
diff --git a/ubi-utils/include/libubi.h b/ubi-utils/include/libubi.h
index dc03d02..1eadff8 100644
--- a/ubi-utils/include/libubi.h
+++ b/ubi-utils/include/libubi.h
@@ -50,6 +50,7 @@ typedef void * libubi_t;
* @mtd_dev_node: path to MTD device node to attach
* @vid_hdr_offset: VID header offset (%0 means default offset and this is what
* most of the users want)
+ * @max_beb_per1024: Maximum expected bad eraseblocks per 1024 eraseblocks
*/
struct ubi_attach_request
{
@@ -57,6 +58,7 @@ struct ubi_attach_request
int mtd_num;
const char *mtd_dev_node;
int vid_hdr_offset;
+ unsigned char max_beb_per1024;
};
/**
diff --git a/ubi-utils/libubi.c b/ubi-utils/libubi.c
index c898e36..d3c333d 100644
--- a/ubi-utils/libubi.c
+++ b/ubi-utils/libubi.c
@@ -719,6 +719,7 @@ int ubi_attach_mtd(libubi_t desc, const char *node,
r.ubi_num = req->dev_num;
r.mtd_num = req->mtd_num;
r.vid_hdr_offset = req->vid_hdr_offset;
+ r.max_beb_per1024 = req->max_beb_per1024;
ret = do_attach(node, &r);
if (ret == 0)
@@ -780,6 +781,7 @@ int ubi_attach(libubi_t desc, const char *node, struct ubi_attach_request *req)
memset(&r, 0, sizeof(struct ubi_attach_req));
r.ubi_num = req->dev_num;
r.vid_hdr_offset = req->vid_hdr_offset;
+ r.max_beb_per1024 = req->max_beb_per1024;
/*
* User has passed path to device node. Lets find out MTD device number
diff --git a/ubi-utils/ubiattach.c b/ubi-utils/ubiattach.c
index 27e7c09..2026c2e 100644
--- a/ubi-utils/ubiattach.c
+++ b/ubi-utils/ubiattach.c
@@ -42,6 +42,7 @@ struct args {
int vidoffs;
const char *node;
const char *dev;
+ int max_beb_per1024;
};
static struct args args = {
@@ -50,6 +51,7 @@ static struct args args = {
.vidoffs = 0,
.node = NULL,
.dev = NULL,
+ .max_beb_per1024 = 0,
};
static const char doc[] = PROGRAM_NAME " version " VERSION
@@ -63,6 +65,9 @@ static const char optionsstr[] =
" if the character device node does not exist)\n"
"-O, --vid-hdr-offset VID header offset (do not specify this unless you really\n"
" know what you are doing, the default should be optimal)\n"
+"-b, --max-beb-per1024 Maximum expected bad block number per 1024 eraseblock.\n"
+" The default value is correct for most NAND devices.\n"
+" (Range 1-255, 0 for default kernel value).\n"
"-h, --help print help message\n"
"-V, --version print program version";
@@ -71,19 +76,25 @@ static const char usage[] =
"\t[-m <MTD device number>] [-d <UBI device number>] [-p <path to device>]\n"
"\t[--mtdn=<MTD device number>] [--devn=<UBI device number>]\n"
"\t[--dev-path=<path to device>]\n"
+"\t[--max-beb-per1024=<maximum bad block number per 1024 blocks>]\n"
"UBI control device defaults to " DEFAULT_CTRL_DEV " if not supplied.\n"
"Example 1: " PROGRAM_NAME " -p /dev/mtd0 - attach /dev/mtd0 to UBI\n"
"Example 2: " PROGRAM_NAME " -m 0 - attach MTD device 0 (mtd0) to UBI\n"
"Example 3: " PROGRAM_NAME " -m 0 -d 3 - attach MTD device 0 (mtd0) to UBI\n"
-" and create UBI device number 3 (ubi3)";
+" and create UBI device number 3 (ubi3)\n"
+"Example 4: " PROGRAM_NAME " -m 1 -b 25 - attach /dev/mtd1 to UBI and reserve \n"
+" 25*nand_size_in_blocks/1024 erase blocks for bad block handling.\n"
+" (e.g. if the NAND *chipset* has 4096 PEB, 100 will be reserved \n"
+" for this UBI device).";
static const struct option long_options[] = {
- { .name = "devn", .has_arg = 1, .flag = NULL, .val = 'd' },
- { .name = "dev-path", .has_arg = 1, .flag = NULL, .val = 'p' },
- { .name = "mtdn", .has_arg = 1, .flag = NULL, .val = 'm' },
- { .name = "vid-hdr-offset", .has_arg = 1, .flag = NULL, .val = 'O' },
- { .name = "help", .has_arg = 0, .flag = NULL, .val = 'h' },
- { .name = "version", .has_arg = 0, .flag = NULL, .val = 'V' },
+ { .name = "devn", .has_arg = 1, .flag = NULL, .val = 'd' },
+ { .name = "dev-path", .has_arg = 1, .flag = NULL, .val = 'p' },
+ { .name = "mtdn", .has_arg = 1, .flag = NULL, .val = 'm' },
+ { .name = "vid-hdr-offset", .has_arg = 1, .flag = NULL, .val = 'O' },
+ { .name = "help", .has_arg = 0, .flag = NULL, .val = 'h' },
+ { .name = "version", .has_arg = 0, .flag = NULL, .val = 'V' },
+ { .name = "max-beb-per1024", .has_arg = 1, .flag = NULL, .val = 'b' },
{ NULL, 0, NULL, 0},
};
@@ -92,7 +103,7 @@ static int parse_opt(int argc, char * const argv[])
while (1) {
int key, error = 0;
- key = getopt_long(argc, argv, "p:m:d:O:hV", long_options, NULL);
+ key = getopt_long(argc, argv, "p:m:d:O:hVb:", long_options, NULL);
if (key == -1)
break;
@@ -134,6 +145,19 @@ static int parse_opt(int argc, char * const argv[])
case ':':
return errmsg("parameter is missing");
+ case 'b':
+ args.max_beb_per1024 = simple_strtoul(optarg, &error);
+ if (error || args.max_beb_per1024 < 0
+ || args.max_beb_per1024 > 255)
+ return errmsg("bad maximum of expected bad "
+ "blocks (0-255): \"%s\"",
+ optarg);
+ if (args.max_beb_per1024 == 0)
+ warnmsg("default kernel value will be used for"
+ " maximum expected bad blocks\n");
+
+ break;
+
default:
fprintf(stderr, "Use -h for help\n");
return -1;
@@ -190,6 +214,7 @@ int main(int argc, char * const argv[])
req.mtd_num = args.mtdn;
req.vid_hdr_offset = args.vidoffs;
req.mtd_dev_node = args.dev;
+ req.max_beb_per1024 = args.max_beb_per1024;
err = ubi_attach(libubi, args.node, &req);
if (err) {
|
__label__pos
| 0.617903 |
How to post a video on Instagram?
Instagram announced today that new video posts that are shorter than 15 minutes will now be shared as Reels. Videos posted prior to this change will remain as videos and won’t become Reels. The company began testing this change a few weeks ago and is making it permanent in the coming weeks.To post video content through Instagram’s Story option:
Step 1: Tap Story. The screen will be ready for you to capture the video. …
Step 2: Tap Video in the list of options and select the video you wish to upload. …
Step 3: Add stickers, GIFs, and filters to make the video more attractive and engaging.
Step 4: Share the video as your Story for others to view.
Cricket
Cricket is a bat-and-ball game played between two teams of eleven players on a field at the centre of which is a 20-metre (22-yard) pitch with a wicket at each end, each comprising two bails balanced on three stumps. The batting side scores runs by striking the ball bowled at the wicket with the bat, while the bowling and fielding side tries to prevent this and dismiss each player (so they are “out”). Means of dismissal include being bowled, when the ball hits the stumps and dislodges the bails, and by the fielding side catching the ball after it is hit by the bat, but before it hits the ground. When ten players have been dismissed, the innings ends and the teams swap roles. The game is adjudicated by two umpires, aided by a third umpire and match referee in international matches. They communicate with two off-field scorers who record the match’s statistical information.
There are various formats ranging from Twenty20, played over a few hours with each team batting for a single innings of 20 overs, to Test matches, played over five days with unlimited overs and the teams each batting for two innings of unlimited length. Traditionally cricketers play in all-white kit, but in limited overs cricket they wear club or team colours. In addition to the basic kit, some players wear protective gear to prevent injury caused by the ball, which is a hard, solid spheroid made of compressed leather with a slightly raised sewn seam enclosing a cork core which is layered with tightly wound string.
Cricket is a bat-and-ball game played on a cricket field (see image, right) between two teams of eleven players each. The field is usually oval in shape and the centre of the field is known as the pitch. The pitch is a rectangle of 22 yards (20.12m) long and 10.12m (33 feet) wide.
At each end of the pitch is a set of wooden stumps, and bails. The stumps are cylindrical posts, slightly taller than a human being and they are placed upright in the ground, with the two middle stumps slightly wider apart than the rest. The bails are truncated cones, placed on top of the stumps.
When the ball is bowled, it must bounce on the pitch and then pass between the stumps, without dislodging the bails. If the ball hits the stumps but does not dislodge the bails, then the batsman is not out. The main aim of the bowling team is to get the batsman out. The batsman tries to stop the ball from hitting the stumps with his bat and then hits the ball away from the stumps to score runs.
See Also: How to turn a video into an Instagram reel?
A run is scored when the batsman hits the ball and runs to the other end of the pitch before the fielding team can return the ball. If the batsman hits the ball and it goes to the boundary, then four runs are scored. If the ball goes over the boundary on the full (without touching the ground), then six runs are scored.
The game is played between two teams of eleven players each. The teams take turns to bat and bowl. The team that bats first tries to score as many runs as possible, while the team that bowls tries to get the batsmen out and limit the runs scored by the batting team.
The game is split into innings, with each team batting and bowling twice in each innings. In Test matches, each team bats twice, while in one-day matches and Twenty20 matches, each team bats once.
The game is played on a pitch that is 22 yards long and 10 feet wide. The pitch is marked with a rectangle called the crease. The crease is used to determine whether a batsman is out or not.
The game is played with a red ball that is hard and solid. The ball is bowled at the batsman by the bowler, and the batsman tries to hit the ball with his bat. If the ball hits the stumps and dislodges the bails, then the batsman is out.
A match is played over a period of five days, and each day is split into two sessions, with each session lasting for six hours. In each session, one team bats and the other team bowls. The team that bats first tries to score as many runs as possible, while the team that bowls tries to get the batsmen out and limit the runs scored by the batting team.
At the end of the match, the team that has scored the most runs is declared the winner. If the scores are level, then the match is a draw.
Cricket is a bat-and-
Can I post a video on Instagram without it being a reel?
As one of the most popular social media platforms, Instagram has a lot to offer its users. Whether you’re a aspiring influencer, business owner, or just someone who likes to stay connected with friends and family, there’s a good chance you’re familiar with Instagram Reels. Reels is a relatively new feature that allows users to create short, entertaining videos that can be shared with other users on the platform. While Reels can be a great way to connect with others and build your brand, you may be wondering if there’s a way to post a video on Instagram without it being a reel.
See Also: How do I increase the length of my reel?
The answer is yes! You can actually post videos on Instagram without them being a reel. To do this, you’ll need to create a new post and select the video option. From there, you can choose any video you’ve previously recorded or filmed. Once you’ve selected your video, you can add a caption, location, and any other relevant information just like you would with any other post. Once you’re satisfied with your post, simply hit share and your video will be posted to your feed!
While you can post videos on Instagram without them being a reel, it’s worth noting that reel videos do have some benefits. Reels are designed to be entertaining and engaging, so they often get more views than regular videos. Additionally, Reels offers users some editing tools that can help make your videos more creative and polished. If you’re looking to gain more followers and grow your presence on Instagram, posting Reels can be a great strategy.
Overall, whether or not you post a video on Instagram as a reel is up to you. If you’re just looking to share a regular video with your followers, you can do so without any issue. However, if you’re looking to take advantage of all that Instagram has to offer, posting Reels can be a great way to grow your account and connect with others.
Why can’t I post a video on Instagram?
There are a couple different reasons why you might not be able to post a video on Instagram. One possibility is that your internet connection is not strong enough to upload a video. Another possibility is that the video you’re trying to upload is too long. Instagram only allows videos that are up to 60 seconds long. If your video is longer than that, you’ll need to trim it down before you can upload it.
Another possibility is that the video you’re trying to upload is in a format that Instagram doesn’t support. Instagram only supports videos that are in .mp4 or .mov format. If your video is in a different format, you’ll need to convert it to one of those formats before you can upload it.
Finally, it’s also possible that you’re trying to upload a video that goes against Instagram’s Community Guidelines. Videos that are violent, contain nudity, or promote hate speech are not allowed on Instagram. If your video violates any of Instagram’s Community Guidelines, you won’t be able to post it.
If you’re having trouble posting a video on Instagram, it’s likely due to one of the reasons listed above. Make sure your internet connection is strong, your video is less than 60 seconds long, and your video is in .mp4 or .mov format. Also, make sure your video doesn’t violate Instagram’s Community Guidelines.
The world’s oceans are facing many threats. These include pollution, climate change, and overfishing.
The world’s oceans cover 71% of the Earth’s surface and are home to 97% of the planet’s life. They are a key part of the Earth’s climate system and help to regulate the global temperature. The oceans also play a vital role in the water cycle, which helps to provide freshwater for all life on Earth.
See Also: What causes 100% CPU usage Windows 10?
However, the oceans are facing many threats. These include pollution, climate change, and overfishing.
Pollution
The oceans are polluted by a variety of sources, including oil spills, plastic pollution, and chemical runoff. Oil spills can occur due to accidents or deliberate sabotage, and they can cause damage to marine life and habitats. Plastic pollution comes from a variety of sources, including single-use plastic products and plastic waste that is improperly disposed of. This pollution can cause harm to marine life, and it also contributes to the build-up of plastic in the ocean. Chemical runoff can come from a variety of sources, including agricultural operations and factories. This pollution can contaminate the water and the marine life that lives in it.
Climate Change
Climate change is a major threat to the world’s oceans. Rising temperatures are causing the oceans to warm, and this is leading to a number of impacts, including coral bleaching, sea level rise, and changes in ocean circulation. These impacts are having serious consequences for marine life, coastal communities, and the Earth as a whole.
Overfishing
Overfishing is a major problem in the world’s oceans. It occurs when fish are caught at a rate that is too high for the population to sustain. This can lead to a decline in fish populations, and it can also have negative impacts on the ocean ecosystem as a whole. Overfishing is a major threat to the future of the world’s oceans.
The world’s oceans are vital to the Earth and all life on it. However, they are facing many threats. Pollution, climate change, and overfishing are just some of the challenges that the oceans are facing. We must take action to protect the oceans and the life that they support.
What replaced IGTV?
When Instagram first introduced IGTV in 2018, it was seen as a direct competitor to YouTube. However, IGTV never really took off the way that Instagram had hoped. In 2020, Instagram decided to rebrand IGTV and make it into a standalone app. This new app is called IGTV.
IGTV is a video-centric app that allows users to watch long-form videos from their favorite Instagram creators. The app also supports vertical videos, which is a key format for mobile viewing. While IGTV does have some features that YouTube lacks, such as the ability to save videos for offline viewing, it doesn’t have the same level of polish or robustness.
So far, Instagram’s IGTV app hasn’t been the runaway success that the company had hoped for. The app has been downloaded just over 5 million times, which pales in comparison to YouTube’s 2 billion monthly active users. It’s still early days for IGTV, but the app will need to see some major improvements if it wants to compete with YouTube.
By Philip Anderson
|
__label__pos
| 0.558999 |
simmer 3.8.0
The 3.8.0 release of simmer, the Discrete-Event Simulator for R, hit CRAN almost a week ago, and Windows binaries are already available. This version includes two highly requested new features that justify this second consecutive minor release.
Attachment of precomputed data
Until v3.7.0, the generator was the only means to attach data to trajectories, and it was primarily intended for dynamic generation of arrivals:
library(simmer)
set.seed(42)
hello_sayer <- trajectory() %>%
log_("hello!")
simmer() %>%
add_generator("dummy", hello_sayer, function() rexp(1, 1)) %>%
run(until=2)
## 0.198337: dummy0: hello!
## 0.859232: dummy1: hello!
## 1.14272: dummy2: hello!
## 1.18091: dummy3: hello!
## 1.65409: dummy4: hello!
## simmer environment: anonymous | now: 2 | next: 3.11771876826972
## { Monitor: in memory }
## { Source: dummy | monitored: 1 | n_generated: 6 }
Although it may be used to attach precomputed data too, especially using the at() adaptor:
simmer() %>%
add_generator("dummy", hello_sayer, at(seq(0, 10, 0.5))) %>%
run(until=2)
## 0: dummy0: hello!
## 0.5: dummy1: hello!
## 1: dummy2: hello!
## 1.5: dummy3: hello!
## simmer environment: anonymous | now: 2 | next: 2
## { Monitor: in memory }
## { Source: dummy | monitored: 1 | n_generated: 21 }
Now, let’s say that we want to attach some empirical data, and our observations not only include arrival times, but also priorities and some attributes (e.g., measured service times), as in this question on StackOverflow:
myData <- data.frame(
time = c(1:10,1:5),
priority = 1:3,
duration = rnorm(15, 50, 5)) %>%
dplyr::arrange(time)
This is indeed possible using generators, but it requires some trickery; more specifically, the clever usage of a consumer function as follows:
consume <- function(x, prio=FALSE) {
i <- 0
function() {
i <<- i + 1
if (prio) c(x[[i]], x[[i]], FALSE)
else x[[i]]
}
}
activityTraj <- trajectory() %>%
seize("worker") %>%
timeout_from_attribute("duration") %>%
release("worker")
initialization <- trajectory() %>%
set_prioritization(consume(myData$priority, TRUE)) %>%
set_attribute("duration", consume(myData$duration)) %>%
join(activityTraj)
arrivals_gen <- simmer() %>%
add_resource("worker", 2, preemptive=TRUE) %>%
add_generator("dummy_", initialization, at(myData$time)) %>%
run() %>%
get_mon_arrivals()
# check the resulting duration times
activity_time <- arrivals_gen %>%
tidyr::separate(name, c("prefix", "n"), convert=TRUE) %>%
dplyr::arrange(n) %>%
dplyr::pull(activity_time)
all(activity_time == myData$duration)
## [1] TRUE
Since this v3.8.0, the new data source add_dataframe greatly simplifies this process:
arrivals_df <- simmer() %>%
add_resource("worker", 2, preemptive=TRUE) %>%
add_dataframe("dummy_", activityTraj, myData, time="absolute") %>%
run() %>%
get_mon_arrivals()
identical(arrivals_gen, arrivals_df)
## [1] TRUE
On-disk monitoring
As some users noted (see 12), the default in-memory monitoring capabilities can turn problematic for very long simulations. To address this issue, the simmer() constructor gains a new argument, mon, to provide different types of monitors. Monitoring is still performed in-memory by default, but as of v3.8.0, it can be offloaded to disk through monitor_delim() and monitor_csv(), which produce flat delimited files.
mon <- monitor_csv()
mon
## simmer monitor: to disk (delimited files)
## { arrivals: /tmp/RtmpAlQH2g/file6933ce99281_arrivals.csv }
## { releases: /tmp/RtmpAlQH2g/file6933ce99281_releases.csv }
## { attributes: /tmp/RtmpAlQH2g/file6933ce99281_attributes.csv }
## { resources: /tmp/RtmpAlQH2g/file6933ce99281_resources.csv }
env <- simmer(mon=mon) %>%
add_generator("dummy", hello_sayer, function() rexp(1, 1)) %>%
run(until=2)
## 0.26309: dummy0: hello!
## 0.982183: dummy1: hello!
env
## simmer environment: anonymous | now: 2 | next: 2.29067480322535
## { Monitor: to disk (delimited files) }
## { arrivals: /tmp/RtmpAlQH2g/file6933ce99281_arrivals.csv }
## { releases: /tmp/RtmpAlQH2g/file6933ce99281_releases.csv }
## { attributes: /tmp/RtmpAlQH2g/file6933ce99281_attributes.csv }
## { resources: /tmp/RtmpAlQH2g/file6933ce99281_resources.csv }
## { Source: dummy | monitored: 1 | n_generated: 3 }
read.csv(mon$handlers["arrivals"]) # direct access
## name start_time end_time activity_time finished
## 1 dummy0 0.2630904 0.2630904 0 1
## 2 dummy1 0.9821828 0.9821828 0 1
get_mon_arrivals(env) # adds the "replication" column
## name start_time end_time activity_time finished replication
## 1 dummy0 0.2630904 0.2630904 0 1 1
## 2 dummy1 0.9821828 0.9821828 0 1 1
See below for a comprehensive list of changes.
New features:
• New data source add_dataframe enables the attachment of precomputed data, in the form of a data frame, to a trajectory. It can be used instead of (or along with) add_generator. The most notable advantage over the latter is that add_dataframe is able to automatically set attributes and prioritisation values per arrival based on columns of the provided data frame (#140 closing #123).
• New set_source activity deprecates set_distribution(). It works both for generators and data sources (275a09c, as part of #140).
• New monitoring interface allows for disk offloading. The simmer() constructor gains a new argument mon to provide different types of monitors. By default, monitoring is performed in-memory, as usual. Additionally, monitoring can be offloaded to disk through monitor_delim and monitor_csv, which produce flat delimited files. But more importantly, the C++ interface has been refactorised to enable the development of new monitoring backends (#146 closing #119).
Minor changes and fixes:
• Some documentation improvements (1e14ed7, 194ed05).
• New default until=Inf for the run method (3e6aae9, as part of #140).
• branch and clone now accept lists of trajectories, in the same way as join, so that there is no need to use do.call (#142).
• The argument continue (present in seize and branch) is recycled if only one value is provided but several sub-trajectories are defined (#143).
• Fix process reset: sources are reset in strict order of creation (e7d909b).
• Fix infinite timeouts (#144).
Publicada en R
Un comentario sobre “simmer 3.8.0
Deja un comentario
Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *
|
__label__pos
| 0.943522 |
Android
关注公众号 jb51net
关闭
首页 > 软件编程 > Android > Flutter LogUtil 封装实现
Flutter学习LogUtil封装与实现实例详解
作者：半城半离人
这篇文章主要为大家介绍了Flutter学习LogUtil封装与实现实例详解，有需要的朋友可以借鉴参考下，希望能够有所帮助，祝大家多多进步，早日升职加薪
一. 为什么要封装打印类
虽然 flutter/原生给我们提供了日志打印的功能,但是超出一定长度以后会被截断
Json打印挤在一起看不清楚
堆栈打印深度过深多打印一些不需要的东西
实现 log 的多种展示方式
二. 需要哪些类
为了可以实现对日志的多种内容格式化和各种显示输出所以抽出来以下几个类
三. 打印输出的抽象类
打印类核心的功能就是打印日志 所以它有一个方法就是打印的方法
而我们要打印输出的内容有 当前 log等级 log的tag 需要打印的数据 当前堆栈信息 亦或是获取的Json数据
/// 日志打印输出的接口类
abstract class IHCLogPrint {
void logPrint({
required LogType type,
required String tag,
required String message,
StackTrace? stackTrace,
Map<String, dynamic>? json,
});
}
四. 格式化日志内容
这里定义一个IHCLogFormatter抽象类
///格式化的接口类
abstract class IHCLogFormatter<T> {
String format(T data);
}
格式化堆栈
堆栈的格式例如这样
#0 LogUtil._logPrint (package:com.halfcity.full_flutter_app/utils/log/log_util.dart:104:42)
#1 LogUtil._logPrint (package:com.halfcity.full_flutter_app/utils/log/log_util.dart:104:42)
#2 LogUtil._logPrint (package:com.halfcity.full_flutter_app/utils/log/log_util.dart:104:42)
....
会返回来很多无用的数据 而我们实际用到的也不过前五层就可以了
所以需要一个工具来剔除无用的数据和当前自己的包名
堆栈裁切工具类
class StackTraceUtil {
///正则表达式 表示#+数字+空格的格式
static final RegExp _startStr = RegExp(r'#\d+[\s]+');
///正则表达式表示 多个非换行符+ (非空) 正则表达式中()代表子项 如果需要正则()需要转义\( \)
///了解更多 https://www.runoob.com/regexp/regexp-syntax.html
static final RegExp _stackReg = RegExp(r'.+ \(([^\s]+)\)');
/// 把StackTrace 转成list 并去除无用信息
/// [stackTrace] 堆栈信息
///#0 LogUtil._logPrint (package:com.halfcity.full_flutter_app/utils/log/log_util.dart:104:42)
static List<String> _fixStack(StackTrace stackTrace) {
List tempList = stackTrace.toString().split("\n");
List<String> stackList = [];
for (String str in tempList) {
if (str.startsWith(_startStr)) {
//又是#号又是空格比较占地方 这里省去了 如果你不想省去直接传入str即可
stackList.add(str.replaceFirst(_startStr, ' '));
}
}
return stackList;
}
///获取剔除忽略包名及其其他无效信息的堆栈
/// [stackTrace] 堆栈
/// [ignorePackage] 需要忽略的包名
static List<String> _getRealStackTrack(
StackTrace stackTrace, String ignorePackage) {
///由于Flutter 上的StackTrack上的不太一样,Android返回的是list flutter返回的是StackTrack 所以需要手动切割 再处理
List<String> stackList = _fixStack(stackTrace);
int ignoreDepth = 0;
int allDepth = stackList.length;
//倒着查询 查到倒数第一包名和需要屏蔽的包名一致时,数据往上的数据全部舍弃掉
for (int i = allDepth - 1; i > -1; i--) {
Match? match = _stackReg.matchAsPrefix(stackList[i]);
//如果匹配且第一个子项也符合 group 0 表示全部 剩下的数字看子项的多少返回
if (match != null &&
(match.group(1)!.startsWith("package:$ignorePackage"))) {
ignoreDepth = i + 1;
break;
}
}
stackList = stackList.sublist(ignoreDepth);
return stackList;
}
/// 裁切堆栈
/// [stackTrace] 堆栈
/// [maxDepth] 深度
static List<String> _cropStackTrace(List<String> stackTrace, int? maxDepth) {
int realDeep = stackTrace.length;
realDeep =
maxDepth != null && maxDepth > 0 ? min(maxDepth, realDeep) : realDeep;
return stackTrace.sublist(0, realDeep);
}
///裁切获取到最终的stack 并获取最大深度的栈信息
static getCroppedRealStackTrace(
{required StackTrace stackTrace, ignorePackage, maxDepth}) {
return _cropStackTrace(
_getRealStackTrack(stackTrace, ignorePackage), maxDepth);
}
}
格式化堆栈信息
class StackFormatter implements ILogFormatter<List<String>> {
@override
String format(List<String> stackList) {
///每一行都设置成单独的 字符串
StringBuffer sb = StringBuffer();
///堆栈是空的直接返回
if (stackList.isEmpty) {
return "";
///堆栈只有一行那么就返回 - 堆栈
} else if (stackList.length == 1) {
return "\n\t-${stackList[0].toString()}\n";
///多行堆栈格式化
} else {
for (int i = 0; i < stackList.length; i++) {
if (i == 0) {
sb.writeln("\n\t┌StackTrace:");
}
if (i != stackList.length - 1) {
sb.writeln("\t├${stackList[i].toString()}");
} else {
sb.write("\t└${stackList[i].toString()}");
}
}
}
return sb.toString();
}
}
格式化JSON
class JsonFormatter extends ILogFormatter<Map<String, dynamic>> {
@override
String format(Map<String, dynamic> data) {
///递归调用循环遍历data 在StringBuffer中添加StringBuffer
String finalString = _forEachJson(data, 0);
finalString = "\ndata:$finalString";
return finalString;
}
/// [data] 传入需要格式化的数据
/// [spaceCount] 需要添加空格的长度 一个数字是两个空格
/// [needSpace] 需不需要添加空格
/// [needEnter] 需不需要回车
String _forEachJson(dynamic data, int spaceCount,
{bool needSpace = true, needEnter = true}) {
StringBuffer sb = StringBuffer();
int newSpace = spaceCount + 1;
if (data is Map) {
///如果它是Map走这里
///是否需要空格
sb.write(buildSpace(needSpace ? spaceCount : 0));
sb.write(needEnter ? "{\n" : "{");
data.forEach((key, value) {
///打印输出 key
sb.write("${buildSpace(needEnter ? newSpace : 0)}$key: ");
///递归调用看value是什么类型 如果字符长度少于30就不回车显示
sb.write(_forEachJson(value, newSpace,
needSpace: false,
needEnter: !(value is Map ? false : value.toString().length < 50)));
///不是最后一个就加,
if (data.keys.last != key) {
sb.write(needEnter ? ",\n" : ",");
}
});
if (needEnter) {
sb.writeln();
}
sb.write("${buildSpace(needEnter ? spaceCount : 0)}}");
} else if (data is List) {
///如果他是列表 走这里
sb.write(buildSpace(needSpace ? spaceCount : 0));
sb.write("[${needEnter ? "\n" : ""}");
for (var item in data) {
sb.write(_forEachJson(item, newSpace,
needEnter: !(item.toString().length < 30)));
///不是最后一个就加的,
if (data.last != item) {
sb.write(needEnter ? ",\n" : ",");
}
}
sb.write(needEnter ? "\n" : "");
sb.write("${buildSpace(needSpace?spaceCount:0)}]");
} else if (data is num || data is bool) {
///bool 或者数组不加双引号
sb.write(data);
} else if (data is String) {
///string 或者其他的打印加双引号 如果他是回车就改变他 按回车分行会错乱
sb.write("\"${data.replaceAll("\n", r"\n")}\"");
} else {
sb.write("$data");
}
return sb.toString();
}
///构造空格
String buildSpace(int deep) {
String temp = "";
for (int i = 0; i < deep; i++) {
temp += " ";
}
return temp;
}
}
五. 需要用到的常量
///常量
//log的type
enum LogType {
V, //VERBOSE
E, //ERROR
A, //ASSERT
W, //WARN
I, //INFO
D, //DEBUG
}
int logMaxLength=1024;
///log的type 字符串说明
List logTypeStr = ["VERBOSE", "ERROR", "ASSERT", "WARN", "INFO", "DEBUG"];
///log的type 数字说明(匹配的Android原生,ios暂不清楚)
List<int> logTypeNum = [2, 6, 7, 5, 4, 3];
六. 为了控制多个打印器的设置做了一个配置类
class LogConfig {
///是否开启日志
bool _enable = false;
///默认的Tag
String _globalTag = "LogTag";
///堆栈显示的深度
int _stackTraceDepth = 0;
///打印的方式
List<ILogPrint>? _printers;
LogConfig({enable, globalTag, stackTraceDepth, printers}) {
_enable = enable;
_globalTag = globalTag;
_stackTraceDepth = stackTraceDepth;
_printers?.addAll(printers);
}
@override
String toString() {
return 'LogConfig{_enable: $_enable, _globalTag: $_globalTag, _stackTraceDepth: $_stackTraceDepth, _printers: $_printers}';
}
get enable => _enable;
get globalTag => _globalTag;
get stackTraceDepth => _stackTraceDepth;
get printers => _printers;
}
七. Log的管理类
class LogManager {
///config
late LogConfig _config;
///打印器列表
List<ILogPrint> _printers = [];
///单例模式
static LogManager? _instance;
factory LogManager() => _instance ??= LogManager._();
LogManager._();
///初始化 Manager方法
LogManager.init({config, printers}) {
_config = config;
_printers.addAll(printers);
_instance = this;
}
get printers => _printers;
get config => _config;
void addPrinter(ILogPrint print) {
bool isHave = _printers.any((element) => element == print);
if (!isHave) {
_printers.add(print);
}
}
void removePrinter(ILogPrint print) {
_printers.remove(print);
}
}
九. 调用LogUtil
class LogUtil {
static const String _ignorePackageName = "log_demo/utils/log";
static void V(
{String? tag,
dynamic? message,
LogConfig? logConfig,
StackTrace? stackTrace,
Map<String, dynamic>? json}) {
_logPrint(
type: LogType.V,
tag: tag ??= "",
logConfig: logConfig,
message: message,
json: json,
stackTrace: stackTrace);
}
static void E(
{String? tag,
dynamic? message,
LogConfig? logConfig,
StackTrace? stackTrace,
Map<String, dynamic>? json}) {
_logPrint(
type: LogType.E,
tag: tag ??= "",
message: message,
logConfig: logConfig,
json: json,
stackTrace: stackTrace);
}
static void I(
{String? tag,
dynamic? message,
LogConfig? logConfig,
StackTrace? stackTrace,
Map<String, dynamic>? json}) {
_logPrint(
type: LogType.I,
tag: tag ??= "",
message: message,
json: json,
stackTrace: stackTrace);
}
static void D(
{String? tag,
dynamic? message,
LogConfig? logConfig,
StackTrace? stackTrace,
Map<String, dynamic>? json}) {
_logPrint(
type: LogType.D,
tag: tag ??= "",
logConfig: logConfig,
message: message,
json: json,
stackTrace: stackTrace);
}
static void A(
{String? tag,
LogConfig? logConfig,
dynamic? message,
StackTrace? stackTrace,
Map<String, dynamic>? json}) {
_logPrint(
type: LogType.A,
tag: tag ??= "",
message: message,
logConfig: logConfig,
json: json,
stackTrace: stackTrace);
}
static void W(
{String? tag,
dynamic? message,
LogConfig? logConfig,
StackTrace? stackTrace,
Map<String, dynamic>? json}) {
_logPrint(
type: LogType.W,
tag: tag ??= "",
message: message,
logConfig: logConfig,
json: json,
stackTrace: stackTrace);
}
static Future<void> _logPrint({
required LogType type,
required String tag,
LogConfig? logConfig,
dynamic message,
StackTrace? stackTrace,
Map<String, dynamic>? json,
}) async {
///如果logConfig为空那么就用默认的
logConfig ??= LogManager().config;
if (!logConfig?.enable) {
return;
}
StringBuffer sb = StringBuffer();
///打印当前页面
if (message.toString().isNotEmpty) {
sb.write(message);
}
///如果传入了栈且 要展示的深度大于0
if (stackTrace != null && logConfig?.stackTraceDepth > 0) {
sb.writeln();
String stackTraceStr = StackFormatter().format(
StackTraceUtil.getCroppedRealStackTrace(
stackTrace: stackTrace,
ignorePackage: _ignorePackageName,
maxDepth: logConfig?.stackTraceDepth));
sb.write(stackTraceStr);
}
if (json != null) {
sb.writeln();
String body = JsonFormatter().format(json);
sb.write(body);
}
///获取有几个打印器
List<ILogPrint> prints = logConfig?.printers ?? LogManager().printers;
if (prints.isEmpty) {
return;
}
///遍历打印器 分别打印数据
for (ILogPrint print in prints) {
print.logPrint(type: type, tag: tag, message: sb.toString());
}
}
}
十. 定义一个Flutter 控制台打印输出的方法
class ConsolePrint extends ILogPrint {
@override
void logPrint(
{required LogType type,
required String tag,
required String message,
StackTrace? stackTrace,
Map<String, dynamic>? json}) {
///如果要开启颜色显示 那么就是1000
///如果不开启颜色显示 那么就是1023
int _maxCharLength = 1000;
//匹配中文字符以及这些中文标点符号 。 ？ ！ ， 、 ； ： “ ” ‘ ' （ ） 《 》 〈 〉 【 】 『 』 「 」 ﹃ ﹄ 〔 〕 … — ～ ﹏ ￥
RegExp _chineseRegex = RegExp(r"[\u4e00-\u9fa5|\u3002|\uff1f|\uff01|\uff0c|\u3001|\uff1b|\uff1a|\u201c|\u201d|\u2018|\u2019|\uff08|\uff09|\u300a|\u300b|\u3008|\u3009|\u3010|\u3011|\u300e|\u300f|\u300c|\u300d|\ufe43|\ufe44|\u3014|\u3015|\u2026|\u2014|\uff5e|\ufe4f|\uffe5]");
///用回车做分割
List<String> strList = message.split("\n");
///判断每句的长度 如果长度过长做切割
for (String str in strList) {
///获取总长度
int len = 0;
///获取当前长度
int current = 0;
///获取截断点数据
List<int> entry = [0];
///遍历文字 查看真实长度
for (int i = 0; i < str.length; i++) {
//// 一个汉字再打印区占三个长度,其他的占一个长度
len += str[i].contains(_chineseRegex) ? 3 : 1;
///寻找当前字符的下一个字符长度
int next = (i + 1) < str.length
? str[i + 1].contains(_chineseRegex)
? 3
: 1
: 0;
///当前字符累计长度 如果达到了需求就清空
current += str[i].contains(_chineseRegex) ? 3 : 1;
if (current < _maxCharLength && (current + next) >= _maxCharLength) {
entry.add(i);
current = 0;
}
}
///如果最后一个阶段点不是最后一个字符就添加上
if (entry.last != str.length - 1) {
entry.add(str.length);
}
///如果所有的长度小于1023 那么打印没有问题
if (len < _maxCharLength) {
_logPrint(type, tag, str);
} else {
///按照获取的截断点来打印
for (int i = 0; i < entry.length - 1; i++) {
_logPrint(type, tag, str.substring(entry[i], entry[i + 1]));
}
}
}
}
_logPrint(LogType type, String tag, String message) {
///前面的\u001b[31m用于设定SGR颜色，后面的\u001b[0m相当于一个封闭标签作为前面SGR颜色的作用范围的结束点标记。
/// \u001b[3 文字颜色范围 0-7 标准颜色 0是黑色 1是红色 2是绿色 3是黄色 4是蓝色 5是紫色 6蓝绿色 是 7是灰色 范围之外都是黑色
/// \u001b[9 文字颜色范围 0-7 高强度颜色 0是黑色 1是红色 2是绿色 3是黄色 4是蓝色 5是紫色 6蓝绿色 是 7是灰色 范围之外都是黑色
/// 自定义颜色 \u001b[38;2;255;0;0m 表示文字颜色 2是24位 255 0 0 是颜色的RGB 可以自定义颜色
/// \u001b[4 数字 m 是背景色
/// \u001b[1m 加粗
/// \u001b[3m 斜体
/// \u001b[4m 下划线
/// \u001b[7m 黑底白字
///\u001b[9m 删除线
///\u001b[0m 结束符
//////详情看 https://www.cnblogs.com/zt123123/p/16110475.html
String colorHead = "";
String colorEnd = "\u001b[0m";
switch (type) {
case LogType.V:
// const Color(0xff181818);
colorHead = "\u001b[38;2;187;187;187m";
break;
case LogType.E:
colorHead = "\u001b[38;2;255;0;6m";
break;
case LogType.A:
colorHead = "\u001b[38;2;143;0;5m";
break;
case LogType.W:
colorHead = "\u001b[38;2;187;187;35m";
break;
case LogType.I:
colorHead = "\u001b[38;2;72;187;49m";
break;
case LogType.D:
colorHead = "\u001b[38;2;0;112;187m";
break;
}
/// 这里是纯Flutter项目所以在控制台打印这样子是可以有颜色的 如果是flutter混编 安卓原生侧打印\u001b 可能是一个乱码也没有变色效果
/// 如果你不想只在调试模式打印 你可以把debugPrint换成print
debugPrint("$colorHead$message$colorEnd");
/// 如果原生侧有封装log工具直接 写一个methodChannel 传参数就好 ,如果没有,可以调用原生的log打印 传入 level tag 和message
/// kDebugMode 用这个可以判断是否在debug模式下
/// if(kDebugMode){
/// 在debug模式下打印日志
// bool? result=await CustomChannelUtil.printLog(level:logTypeNum[type.index],tag:tag,message:message);
/// }
}
}
十一. 现在使用前初始化log打印器一次
Widget build(BuildContext context) {
LogManager.init(
config: LogConfig(enable: true, globalTag: "TAG", stackTraceDepth: 5),
printers: [ConsolePrint()]);
使用
///打印堆栈
LogUtil.I(tag: "test", stackTrace: StackTrace.current);
///打印json
LogUtil.E(tag: "JSON", json: json);
///打印信息
LogUtil.V(tag: "LogText", message: message);
以上就是Flutter学习LogUtil封装与实现实例详解的详细内容，更多关于Flutter LogUtil 封装实现的资料请关注脚本之家其它相关文章！
您可能感兴趣的文章:
阅读全文
|
__label__pos
| 0.996619 |
BETA
Difficulty Level: Medium
Submissions: 9241 Accuracy:
39.68%
Trapping Rain Water
Given n non-negative integers in array representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example:
Input:
3
2 0 2
Output:
2
Structure is like below
| |
|_|
We can trap 2 units of water in the middle gap.
Below is another example.
Input:
The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows.
Each test case contains an integer N followed by N numbers to be stored in array.
Output:
Print trap units of water in the middle gap.
Constraints:
1<=T<=100
3<=N<=100
0<=Arr[i]<10
Example:
Input:
2
4
7 4 0 9
3
6 9 9
Output:
10
0
** For More Input/Output Examples Use 'Expected Output' option **
Author: Karan Grover
Set Default Code
It is recommended to 'Compile & Test' your code before clicking 'Submit'!
Compilation/Execution Result:
Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.
|
__label__pos
| 0.999134 |
fork download
1. #include <stdio.h>
2. #include <iostream>
3. #include <algorithm>
4. #include <vector>
5.
6. using namespace std;
7.
8. typedef long long ll;
9.
10. class unionfind{
11. public:
12. int* o;
13. int* r;
14.
15. void init(int n){
16. o = new int[n + 10];
17. r = new int[n + 10];
18. for (int i = 0; i < n + 10; i++){
19. o[i] = -1;
20. r[i] = 0;
21. }
22. }
23.
24. int find(int n){
25. if (o[n] < 0) return n;
26. else return o[n] = find(o[n]);
27. }
28.
29. void unit(int a, int b){
30. if (r[a] == r[b]){
31. r[a]++;
32. o[b] = a;
33. }
34. else if (r[a] > r[b]) o[b] = a;
35. else o[a] = b;
36. }
37.
38. void del(){
39. delete[] o;
40. delete[] r;
41. }
42. };
43.
44. pair<int, int> miti[3333333];
45. ll gg[3333333];
46. int jun[3333333];
47. bool ok[3333333];
48. vector<int> mw[1111111];
49. bool table[1111111];
50.
51. int main(){
52. int n, m, q, p;
53. scanf("%d%d%d%d", &n, &m, &q, &p);
54. for (int i = 0; i < m; i++){
55. int a, b;
56. scanf("%d%d", &a, &b);
57. a--;
58. b--;
59. miti[i] = make_pair(a, b);
60. gg[i] = 0;
61. mw[a].push_back(b);
62. mw[b].push_back(a);
63. }
64. for (int i = 0; i < q; i++){
65. int d;
66. ll g;
67. scanf("%d%lld", &d, &g);
68. d--;
69. jun[i] = d;
70. gg[d] = g;
71. }
72. unionfind ufa;
73. ufa.init(n);
74. for (int i = 0; i < m; i++){
75. if (gg[i] == 0){
76. int w1 = ufa.find(miti[i].first);
77. int w2 = ufa.find(miti[i].second);
78. if (w1 != w2){
79. ufa.unit(w1, w2);
80. }
81. }
82. }
83. for (int i = q - 1; i >= 0; i--){
84. pair<int, int> w = miti[jun[i]];
85. int w1 = ufa.find(w.first);
86. int w2 = ufa.find(w.second);
87. if (w1 != w2){
88. ufa.unit(w1, w2);
89. ok[i] = false;
90. }
91. else ok[i] = true;
92. }
93. ufa.del();
94. ufa.init(n);
95. for (int i = 0; i < q; i++){
96. pair<int, int> w = miti[jun[i]];
97. int w1 = ufa.find(w.first);
98. int w2 = ufa.find(w.second);
99. if (w1 == w2 || ok[i]) gg[jun[i]] = -1;
100. else ufa.unit(w1, w2);
101. }
102. ufa.del();
103. ufa.init(n + 1);
104. for (int i = 0; i < n; i++){
105. if (n - mw[i].size() < 3000){
106. for (int j = 0; j < n; j++) table[j] = true;
107. int l = mw[i].size();
108. for (int j = 0; j < l; j++) table[mw[i][j]] = false;
109. for (int j = 0; j < n; j++){
110. if (table[j]){
111. int w1 = ufa.find(i);
112. int w2 = ufa.find(j);
113. if (w1 != w2){
114. ufa.unit(w1, w2);
115. }
116. }
117. }
118. }
119. else{
120. int w1 = ufa.find(i);
121. int w2 = ufa.find(n);
122. if (w1 != w2){
123. ufa.unit(w1, w2);
124. }
125. }
126. }
127. ll res = 0;
128. vector<ll> vw;
129. vector<pair<ll, int> > vv;
130. for (int i = 0; i < m; i++){
131. if (gg[i] >= 0){
132. int w1 = ufa.find(miti[i].first);
133. int w2 = ufa.find(miti[i].second);
134. if (w1 != w2) vv.push_back(make_pair(gg[i], i));
135. else vw.push_back(gg[i]);
136. }
137. }
138. sort(vv.begin(), vv.end());
139. int lw = vv.size();
140. for (int i = 0; i < lw; i++){
141. int w1 = ufa.find(miti[vv[i].second].first);
142. int w2 = ufa.find(miti[vv[i].second].second);
143. if (w1 != w2){
144. ufa.unit(w1, w2);
145. res += vv[i].first;
146. }
147. else vw.push_back(vv[i].first);
148. }
149. sort(vw.begin(), vw.end());
150. lw = vw.size();
151. for (int i = 0; i < lw - p; i++){
152. res += vw[i];
153. }
154. printf("%lld\n", res);
155. return 0;
156. }
157.
Success #stdin #stdout 0.04s 85952KB
stdin
3 3 2 0
3 1
2 3
2 1
3 15
2 10
stdout
10
|
__label__pos
| 0.994073 |
blob: 904a634a497688eda6331845e2bf2805aa8a7991 [file] [log] [blame]
extern void abort ();
extern int abs (int __x) __attribute__ ((__nothrow__, __leaf__)) __attribute__ ((__const__));
static int
foo (unsigned char *w, int i, unsigned char *x, int j)
{
int tot = 0;
for (int a = 0; a < 16; a++)
{
for (int b = 0; b < 16; b++)
tot += abs (w[b] - x[b]);
w += i;
x += j;
}
return tot;
}
void
bar (unsigned char *w, unsigned char *x, int i, int *result)
{
*result = foo (w, 16, x, i);
}
int
main (void)
{
unsigned char m[256];
unsigned char n[256];
int sum, i;
for (i = 0; i < 256; ++i)
if (i % 2 == 0)
{
m[i] = (i % 8) * 2 + 1;
n[i] = -(i % 8);
}
else
{
m[i] = -((i % 8) * 2 + 2);
n[i] = -((i % 8) >> 1);
}
bar (m, n, 16, &sum);
if (sum != 32384)
abort ();
return 0;
}
|
__label__pos
| 0.999008 |
Category:
What Is Statistical Sampling?
Statistical sampling deals with certain groups, such as elementary school students.
Article Details
• Written By: Mary McMahon
• Edited By: Bronwyn Harris
• Last Modified Date: 11 April 2015
• Copyright Protected:
2003-2015
Conjecture Corporation
• Print this Article
Free Widgets for your Site/Blog
Vatican City has the highest crime rate at 1.5 crimes per citizen, mostly due to large mobs and pick-pocketing. more...
May 4 , 1904 : US construction began on the Panama Canal. more...
Statistical sampling refers to the study of populations by gathering information about and analyzing it. It is the base for a great deal of information, ranging from estimates of average height in a nation to studies on the impact of marketing to children. Numerous professions use statistical sampling, including psychology, demography, and anthropology. Like any study method, however, this method is prone to errors, and it is important to analyze the methods used to conduct a study before accepting the results.
This process begins with a definition of the population the scientist wants to study, and the variable which he or she wants to measure. For example, someone might want to know the average weight of elementary school children. Next, the scientist decides how to collect the desired data. In the previous example, the scientist might travel to schools with a scale, send questionnaires out to doctors or parents, or try to access school health records. Many researchers try to measure directly, rather than relying on self-responses, because this way the results are consistent.
Once the population, variable being measured, and method have been defined, the scientist decides how to accurately sample the population so that the collected data is representative of a larger group. In other words, statistical sampling does not involve measuring the desired variable in every individual of the population being studied; a selection of individuals is used to generalize results. Generally, the larger the sample size, the better the results.
Ad
The most common system is random sampling, in which a scientist generates a list of random individuals from a central database. Some scientists use cluster sampling, in which a population is divided into a bunch of small clusters and each cluster is studied extensively. Others might use systematic sampling, in which every nth person in the population is studied. The most dangerous and unreliable selection system for statistical sampling is convenience sampling; someone standing on a street corner with surveys is using convenience sampling, which can yield highly inaccurate results.
After the data is collected, the researcher analyzes it and uses it to make generalizations about a population. In studies which rely on statistical sampling, the method used is usually clearly detailed, so that other scientists can decide whether or not the method was valid. An invalid method can cause sampling error, which would call the results of the study into question.
Ad
Recommended
You might also Like
Discuss this Article
parmnparsley
Post 3
@ GenevaMech- The difference in statistical vs non-statistical sampling is human bias. Statistical sampling is any sampling that is done by random sampling methods and uses probability theory to measure the sample risk and evaluate the results of the sample.
Glasshouse
Post 2
@ GenevaMech- A population is just what it sounds like. It is the entire population of something. A sample is a part of a population that someone chooses to analyze.
In many cases, it would be impractical to collect data from or about an entire population so someone would take a sample. There are different ways to determine sample populations in statistics, but they should be representative of the larger population.
Probability sampling uses a random device to determine the population that will be sampled to eliminate human bias. Cluster sampling can be used to determine a sample from a geographically scattered sample. Stratified sampling separates a population into groups and then takes representative samples of each group. Finally, multi-stage sampling uses multiple methods to get a sample that represents a large, complex population.
GenevaMech
Post 1
What is the difference between population and sample in statistics? Also, what is the difference between statistical and non-statistical sampling? Someone please help me out.
Post your comments
Post Anonymously
Login
username
password
forgot password?
Register
username
password
confirm
email
|
__label__pos
| 0.98756 |
Point on ray
Determining if a point is on a ray or not comes down to the dot product. The key here is to realize that given the direction of the ray we have a normal vector. If we subtract the point from the ray, and normalize the resuling vector, we have a normal from the origin of the ray to the test point. At this point we have two normals. Remember, the dot product of two normals is:
• 0 if the two vectors point in the same direction
• That is to say, if the vectors are perpendicular
• positive If the vectors point in the same direction
• negative If the vectors point in opposing direction
Of course you need to use a very small epsilon here, because of floating point error. A visual example of the above bullet points:
DOTSIMPLE
In a more practical example, if we know the forward vector of a guard, a player is in the guards view if the dot product of the guards forward and the vector from the guard to the player are positive.
SNEAK
Now, there is one edge case to all this. What happens if the point we are testing and the origin of the ray are the same point? Well, the dot product breaks down and we get no new normal vector. But that point is on the ray. You should add a special case if check for that.
See if you can implement this on your own before looking at the code below.
The algorithm
Implementing the above in code is fairly straight forward:
bool PointOnRay(Point point, Ray ray) {
// If point and ray are the same, return true
Vector3 newNorm = point - ray.Position;
newNorm.Normalize();
float d = Vector3.Dot(newNorm, ray.Normal);
return Math.Abs(1f - d) < 0.000001f; // SUPER SMALL EPSILON!
}
On Your Own
Add the following function to the Collisions class:
public static bool PointOnRay(Point point, Ray ray)
And provide an implementation for it!
Unit Test
You can Download the samples for this chapter to see if your result looks like the unit test.
The constructor of this code will spit out errors if they are present. A ray is rendered, along with a random sampling of points. Any point that falls on the ray is rendered in red, points not on the ray are rendered in blue.
UNIT
using OpenTK.Graphics.OpenGL;
using Math_Implementation;
using CollisionDetectionSelector.Primitives;
namespace CollisionDetectionSelector.Samples {
class PointOnray : Application {
protected Vector3 cameraAngle = new Vector3(120.0f, -10f, 20.0f);
protected float rads = (float)(System.Math.PI / 180.0f);
Ray testRay = new Ray(new Point(-3, -2, -1), new Vector3(3, 2, 1));
Point[] testPoints = new Point[] {
new Point(-3, -2, -1),
new Point(12, 8, 4),
new Point(0, 0, 0),
new Point(-18, -12, -6),
new Point(-4, -7, -8),
new Point(7, 8, 5),
new Point(1, 5, -5),
new Point(-6, 5, 7),
new Point(1, 6, 8),
new Point(-7, -10, -4),
new Point(-4.5f, -3f, -1.5f)
};
public override void Intialize(int width, int height) {
GL.Enable(EnableCap.DepthTest);
GL.PointSize(4f);
for (int i = 0; i < 3; ++i) {
if (!Collisions.PointOnRay(testPoints[i], testRay)) {
System.Console.ForegroundColor = System.ConsoleColor.Red;
System.Console.WriteLine("Expected point: " + testPoints[i].ToString() + " to be on Ray!");
}
}
for (int i = 3; i < testPoints.Length; ++i) {
if (Collisions.PointOnRay(testPoints[i], testRay)) {
System.Console.ForegroundColor = System.ConsoleColor.Red;
System.Console.WriteLine("Expected point: " + testPoints[i].ToString() + " to NOT be on Ray!");
}
}
}
public override void Render() {
Vector3 eyePos = new Vector3();
eyePos.X = cameraAngle.Z * -(float)System.Math.Sin(cameraAngle.X * rads * (float)System.Math.Cos(cameraAngle.Y * rads));
eyePos.Y = cameraAngle.Z * -(float)System.Math.Sin(cameraAngle.Y * rads);
eyePos.Z = -cameraAngle.Z * (float)System.Math.Cos(cameraAngle.X * rads * (float)System.Math.Cos(cameraAngle.Y * rads));
Matrix4 lookAt = Matrix4.LookAt(eyePos, new Vector3(0.0f, 0.0f, 0.0f), new Vector3(0.0f, 1.0f, 0.0f));
GL.LoadMatrix(Matrix4.Transpose(lookAt).Matrix);
GL.Color3(1f, 0f, 1f);
testRay.Render();
foreach (Point point in testPoints) {
if (Collisions.PointOnRay(point, testRay)) {
GL.Color3(1f, 0f, 0f);
}
else {
GL.Color3(0f, 0f, 1f);
}
point.Render();
}
}
public override void Update(float deltaTime) {
cameraAngle.X += 45.0f * deltaTime;
}
public override void Resize(int width, int height) {
GL.Viewport(0, 0, width, height);
GL.MatrixMode(MatrixMode.Projection);
float aspect = (float)width / (float)height;
Matrix4 perspective = Matrix4.Perspective(60, aspect, 0.01f, 1000.0f);
GL.LoadMatrix(Matrix4.Transpose(perspective).Matrix);
GL.MatrixMode(MatrixMode.Modelview);
GL.LoadIdentity();
}
}
}
results matching ""
No results matching ""
|
__label__pos
| 0.977087 |
AliPhysics 9c66e61 (9c66e61)
AliCaloTrackMatcher.cxx
Go to the documentation of this file.
1 /**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
3 * *
4 * Author: Daniel Mühlheim *
5 * Version 1.0 *
6 * *
7 * Permission to use, copy, modify and distribute this software and its *
8 * documentation strictly for non-commercial purposes is hereby granted *
9 * without fee, provided that the above copyright notice appears in all *
10 * copies and that both the copyright notice and this permission notice *
11 * appear in the supporting documentation. The authors make no claims *
12 * about the suitability of this software for any purpose. It is *
13 * provided "as is" without express or implied warranty. *
14 **************************************************************************/
15
17 //---------------------------------------------
18 // Basic Track Matching Class
19 //---------------------------------------------
21
22
23 #include "AliAnalysisManager.h"
24 #include "AliAODEvent.h"
25 #include "AliCaloTrackMatcher.h"
26 #include "AliEMCALRecoUtils.h"
27 #include "AliESDEvent.h"
28 #include "AliESDtrack.h"
29 #include "AliESDtrackCuts.h"
30 #include "AliInputEventHandler.h"
31 #include "AliTrackerBase.h"
32 #include "AliV0ReaderV1.h"
33
34 #include "TAxis.h"
35 #include "TChain.h"
36 #include "TH1F.h"
37 #include "TF1.h"
38
39 #include <vector>
40 #include <map>
41 #include <utility>
42
43 class iostream;
44
45 using namespace std;
46
47
48 ClassImp(AliCaloTrackMatcher)
49
50 //________________________________________________________________________
51 AliCaloTrackMatcher::AliCaloTrackMatcher(const char *name, Int_t clusterType, Int_t runningMode) : AliAnalysisTaskSE(name),
52 fClusterType(clusterType),
53 fRunningMode(runningMode),
54 fV0ReaderName(""),
55 fCorrTaskSetting(""),
56 fAnalysisTrainMode("Grid"),
57 fMatchingWindow(200),
58 fMatchingResidual(0.2),
59 fRunNumber(-1),
60 fGeomEMCAL(NULL),
61 fGeomPHOS(NULL),
62 fMapTrackToCluster(),
63 fMapClusterToTrack(),
64 fNEntries(1),
65 fVectorDeltaEtaDeltaPhi(0),
66 fMap_TrID_ClID_ToIndex(),
67 fSecMapTrackToCluster(),
68 fSecMapClusterToTrack(),
69 fSecNEntries(1),
70 fSecVectorDeltaEtaDeltaPhi(0),
71 fSecMap_TrID_ClID_ToIndex(),
72 fSecMap_TrID_ClID_AlreadyTried(),
73 fListHistos(NULL),
74 fHistControlMatches(NULL),
75 fSecHistControlMatches(NULL)
76 {
77 // Default constructor
78 DefineInput(0, TChain::Class());
79
80 if( !(fRunningMode == 0 || fRunningMode == 1 || fRunningMode == 2 || fRunningMode == 5 || fRunningMode == 6) )
81 AliFatal(Form("AliCaloTrackMatcher: Running mode not defined: '%d' ! Please set a proper mode in the AddTask, returning...",fRunningMode));
82 }
83
84 //________________________________________________________________________
86 // default deconstructor
87 fMapTrackToCluster.clear();
88 fMapClusterToTrack.clear();
89 fVectorDeltaEtaDeltaPhi.clear();
90 fMap_TrID_ClID_ToIndex.clear();
91
92 fSecMapTrackToCluster.clear();
93 fSecMapClusterToTrack.clear();
94 fSecVectorDeltaEtaDeltaPhi.clear();
95 fSecMap_TrID_ClID_ToIndex.clear();
96 fSecMap_TrID_ClID_AlreadyTried.clear();
97
98 if(fHistControlMatches) delete fHistControlMatches;
99 if(fSecHistControlMatches) delete fSecHistControlMatches;
100 if(fAnalysisTrainMode.EqualTo("Grid")){
101 if(fListHistos != NULL){
102 delete fListHistos;
103 }
104 }
105 }
106
107 //________________________________________________________________________
109 fMapTrackToCluster.clear();
110 fMapClusterToTrack.clear();
111 fVectorDeltaEtaDeltaPhi.clear();
112 fMap_TrID_ClID_ToIndex.clear();
113
114 fSecMapTrackToCluster.clear();
115 fSecMapClusterToTrack.clear();
116 fSecVectorDeltaEtaDeltaPhi.clear();
117 fSecMap_TrID_ClID_ToIndex.clear();
118 fSecMap_TrID_ClID_AlreadyTried.clear();
119 }
120
121 //________________________________________________________________________
123 if(fListHistos != NULL){
124 delete fListHistos;
125 fListHistos = NULL;
126 }
127 if(fListHistos == NULL){
128 fListHistos = new TList();
129 fListHistos->SetOwner(kTRUE);
130 fListHistos->SetName(Form("CaloTrackMatcher_%i_%i",fClusterType,fRunningMode));
131 }
132
133 // Create User Output Objects
134 fHistControlMatches = new TH2F(Form("ControlMatches_%i_%i",fClusterType,fRunningMode),Form("ControlMatches_%i_%i",fClusterType,fRunningMode),7,-0.5,6.5,50,0.05,200.0);
135 SetLogBinningYTH2(fHistControlMatches);
136 fHistControlMatches->GetYaxis()->SetTitle("track pT (GeV/c)");
137 fHistControlMatches->GetXaxis()->SetBinLabel(1,"nTr in");
138 fHistControlMatches->GetXaxis()->SetBinLabel(2,"no inner Tr params || track not in right direction");
139 fHistControlMatches->GetXaxis()->SetBinLabel(3,"failed 1st pro-step");
140 fHistControlMatches->GetXaxis()->SetBinLabel(4,"Tr not in EMCal acc");
141 fHistControlMatches->GetXaxis()->SetBinLabel(5,"failed 2nd pro-step");
142 fHistControlMatches->GetXaxis()->SetBinLabel(6,"w/o match to cluster");
143 fHistControlMatches->GetXaxis()->SetBinLabel(7,"nTr out, w/ match");
144 fListHistos->Add(fHistControlMatches);
145
146 fSecHistControlMatches = new TH2F(Form("ControlSecMatches_%i_%i",fClusterType,fRunningMode),Form("ControlSecMatches_%i_%i",fClusterType,fRunningMode),7,-0.5,6.5,50,0.05,200.0);
147 SetLogBinningYTH2(fSecHistControlMatches);
148 fSecHistControlMatches->GetYaxis()->SetTitle("track pT (GeV/c)");
149 fSecHistControlMatches->GetXaxis()->SetBinLabel(1,"nTr in");
150 fSecHistControlMatches->GetXaxis()->SetBinLabel(2,"no inner Tr params || track not in right direction");
151 fSecHistControlMatches->GetXaxis()->SetBinLabel(3,"failed 1st pro-step");
152 fSecHistControlMatches->GetXaxis()->SetBinLabel(4,"Tr not in EMCal acc");
153 fSecHistControlMatches->GetXaxis()->SetBinLabel(5,"failed 2nd pro-step");
154 fSecHistControlMatches->GetXaxis()->SetBinLabel(6,"w/o match to cluster");
155 fSecHistControlMatches->GetXaxis()->SetBinLabel(7,"nTr out, w/ match");
156 fListHistos->Add(fSecHistControlMatches);
157 }
158
159 //________________________________________________________________________
161 // Initialize function to be called once before analysis
162 fMapTrackToCluster.clear();
163 fMapClusterToTrack.clear();
164 fNEntries = 1;
165 fVectorDeltaEtaDeltaPhi.clear();
166 fMap_TrID_ClID_ToIndex.clear();
167
168 fSecMapTrackToCluster.clear();
169 fSecMapClusterToTrack.clear();
170 fSecNEntries = 1;
171 fSecVectorDeltaEtaDeltaPhi.clear();
172 fSecMap_TrID_ClID_ToIndex.clear();
173 fSecMap_TrID_ClID_AlreadyTried.clear();
174
175 if(fRunNumber == -1 || fRunNumber != runNumber){
176 if(fClusterType == 1 || fClusterType == 3){
177 fGeomEMCAL = AliEMCALGeometry::GetInstanceFromRunNumber(runNumber);
178 if(!fGeomEMCAL){ AliFatal("EMCal geometry not initialized!");}
179 }else if(fClusterType == 2){
180 fGeomPHOS = AliPHOSGeometry::GetInstance();
181 if(!fGeomPHOS) AliFatal("PHOS geometry not initialized!");
182 }
183 fRunNumber = runNumber;
184 }
185 }
186
187 //________________________________________________________________________
189
190 // main method of AliCaloTrackMatcher, first initialize and then process event
191
192 //DebugV0Matching();
193
194 // do processing only for EMCal (1), DCal (3) or PHOS (2) clusters, otherwise do nothing
195 if(fClusterType == 1 || fClusterType == 2 || fClusterType == 3){
196 Initialize(fInputEvent->GetRunNumber());
197 ProcessEvent(fInputEvent);
198 }
199
200 //DebugMatching();
201
202 return;
203 }
204
205 //________________________________________________________________________
206 void AliCaloTrackMatcher::ProcessEvent(AliVEvent *event){
207 Int_t nClus = 0;
208 TClonesArray * arrClusters = NULL;
209 if(!fCorrTaskSetting.CompareTo("")){
210 nClus = event->GetNumberOfCaloClusters();
211 } else {
212 arrClusters = dynamic_cast<TClonesArray*>(event->FindListObject(Form("%sClustersBranch",fCorrTaskSetting.Data())));
213 if(arrClusters){
214 nClus = arrClusters->GetEntries();
215 }else{
216 AliError(Form("Could not find %sClustersBranch despite correction framework being used!",fCorrTaskSetting.Data()));
217 return;
218 }
219 }
220 Int_t nModules = 0;
221 if(fClusterType == 1 || fClusterType == 3) nModules = fGeomEMCAL->GetNumberOfSuperModules();
222 else if(fClusterType == 2) nModules = fGeomPHOS->GetNModules();
223
224 AliESDEvent *esdev = dynamic_cast<AliESDEvent*>(event);
225 AliAODEvent *aodev = 0;
226 if (!esdev) {
227 aodev = dynamic_cast<AliAODEvent*>(event);
228 if (!aodev) {
229 AliError("Task needs AOD or ESD event, returning");
230 return;
231 }
232 }
233 static AliESDtrackCuts *EsdTrackCuts = 0x0;
234 static int prevRun = -1;
235 // Using standard function for setting Cuts
236 if (esdev && (fRunningMode == 0 || fRunningMode == 6)){
237 Int_t runNumber = fInputEvent->GetRunNumber();
238 if (prevRun!=runNumber) {
239 delete EsdTrackCuts;
240 EsdTrackCuts = 0;
241 prevRun = runNumber;
242 }
243 if (!EsdTrackCuts) {
244 // if LHC11a or earlier or if LHC13g or if LHC12a-i -> use 2010 cuts
245 if( (runNumber<=146860) || (runNumber>=197470 && runNumber<=197692) || (runNumber>=172440 && runNumber<=193766) ){
246 if(fRunningMode == 6) EsdTrackCuts = AliESDtrackCuts::GetStandardITSTPCTrackCuts2010(kFALSE);
247 else EsdTrackCuts = AliESDtrackCuts::GetStandardITSTPCTrackCuts2010();
248 // else if run2 data use 2015 PbPb cuts
249 } else if (runNumber>=209122){
250 //EsdTrackCuts = AliESDtrackCuts::GetStandardITSTPCTrackCuts2015PbPb();
251 // hard coded track cuts for the moment, because AliESDtrackCuts::GetStandardITSTPCTrackCuts2015PbPb() gives spams warnings
252 EsdTrackCuts = new AliESDtrackCuts();
253 // TPC; clusterCut = 1, cutAcceptanceEdges = kTRUE, removeDistortedRegions = kFALSE
254 EsdTrackCuts->AliESDtrackCuts::SetMinNCrossedRowsTPC(70);
255 EsdTrackCuts->AliESDtrackCuts::SetMinRatioCrossedRowsOverFindableClustersTPC(0.8);
256 EsdTrackCuts->SetCutGeoNcrNcl(2., 130., 1.5, 0.0, 0.0); // only dead zone and not clusters per length
257 //EsdTrackCuts->AliESDtrackCuts::SetCutOutDistortedRegionsTPC(kTRUE);
258 EsdTrackCuts->AliESDtrackCuts::SetMaxChi2PerClusterTPC(4);
259 EsdTrackCuts->AliESDtrackCuts::SetAcceptKinkDaughters(kFALSE);
260 EsdTrackCuts->AliESDtrackCuts::SetRequireTPCRefit(kTRUE);
261 // ITS; selPrimaries = 1
262 EsdTrackCuts->AliESDtrackCuts::SetRequireITSRefit(kTRUE);
263 EsdTrackCuts->AliESDtrackCuts::SetClusterRequirementITS(AliESDtrackCuts::kSPD,
264 AliESDtrackCuts::kAny);
265 if(fRunningMode != 6){
266 EsdTrackCuts->AliESDtrackCuts::SetMaxDCAToVertexXYPtDep("0.0105+0.0350/pt^1.1");
267 EsdTrackCuts->AliESDtrackCuts::SetMaxChi2TPCConstrainedGlobal(36);
268 }
269 EsdTrackCuts->AliESDtrackCuts::SetMaxDCAToVertexZ(2);
270 EsdTrackCuts->AliESDtrackCuts::SetDCAToVertex2D(kFALSE);
271 EsdTrackCuts->AliESDtrackCuts::SetRequireSigmaToVertex(kFALSE);
272 EsdTrackCuts->AliESDtrackCuts::SetMaxChi2PerClusterITS(36);
273 // else use 2011 version of track cuts
274 }else{
275 if(fRunningMode == 6) EsdTrackCuts = AliESDtrackCuts::GetStandardITSTPCTrackCuts2011(kFALSE);
276 else EsdTrackCuts = AliESDtrackCuts::GetStandardITSTPCTrackCuts2011();
277 }
278 EsdTrackCuts->SetMaxDCAToVertexZ(2);
279 }
280 }
281
282 for (Int_t itr=0;itr<event->GetNumberOfTracks();itr++){
283 AliExternalTrackParam *trackParam = 0;
284 AliVTrack *inTrack = 0x0;
285 if(esdev){
286 inTrack = esdev->GetTrack(itr);
287 if(!inTrack) continue;
288 fHistControlMatches->Fill(0.,inTrack->Pt());
289 AliESDtrack *esdt = dynamic_cast<AliESDtrack*>(inTrack);
290
291 if(fRunningMode == 0){
292 if(TMath::Abs(inTrack->Eta())>0.8 && (fClusterType == 1 || fClusterType == 3 )){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
293 if(TMath::Abs(inTrack->Eta())>0.3 && fClusterType == 2 ){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
294 if(inTrack->Pt()<0.5){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
295 if(!EsdTrackCuts->AcceptTrack(esdt)) {fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
296 }else if(fRunningMode == 5 || fRunningMode == 6){
297 if(TMath::Abs(inTrack->Eta())>0.8 && (fClusterType == 1 || fClusterType == 3 )){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
298 if(TMath::Abs(inTrack->Eta())>0.3 && fClusterType == 2 ){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
299 if(inTrack->Pt()<0.3){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
300
301 if(fRunningMode == 6){
302 if(!EsdTrackCuts->AcceptTrack(esdt)) {fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
303 }
304 }
305
306 const AliExternalTrackParam *in = esdt->GetInnerParam();
307 if (!in){AliDebug(2, "Could not get InnerParam of Track, continue"); fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
308 trackParam = new AliExternalTrackParam(*in);
309 } else if(aodev) {
310 inTrack = dynamic_cast<AliVTrack*>(aodev->GetTrack(itr));
311 if(!inTrack) continue;
312 fHistControlMatches->Fill(0.,inTrack->Pt());
313 AliAODTrack *aodt = dynamic_cast<AliAODTrack*>(inTrack);
314
315 if(fRunningMode == 0){
316 if(inTrack->GetID()<0){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;} // Avoid double counting of tracks
317 if(TMath::Abs(inTrack->Eta())>0.8 && (fClusterType == 1 || fClusterType == 3 )){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
318 if(TMath::Abs(inTrack->Eta())>0.3 && fClusterType == 2 ){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
319 if(inTrack->Pt()<0.5){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
320 if(!aodt->IsHybridGlobalConstrainedGlobal()){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
321 }else if(fRunningMode == 5 || fRunningMode == 6){
322 if(inTrack->GetID()<0){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;} // Avoid double counting of tracks
323 if(TMath::Abs(inTrack->Eta())>0.8 && (fClusterType == 1 || fClusterType == 3 )){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
324 if(TMath::Abs(inTrack->Eta())>0.3 && fClusterType == 2 ){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
325 if(inTrack->Pt()<0.3){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
326
327 if(fRunningMode == 6){
328 if(!aodt->IsHybridGlobalConstrainedGlobal()){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
329 }
330 }
331
332 Double_t xyz[3] = {0}, pxpypz[3] = {0}, cv[21] = {0};
333 aodt->GetPxPyPz(pxpypz);
334 aodt->GetXYZ(xyz);
335 aodt->GetCovarianceXYZPxPyPz(cv);
336
337 // check for EMC tracks already propagated tracks are out of bounds
338 if (fClusterType == 1 || fClusterType == 3){
339 if( TMath::Abs(aodt->GetTrackEtaOnEMCal()) > 0.75 ){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
340
341 // conditions for run1
342 if( fClusterType == 1 && nModules < 13 && ( aodt->GetTrackPhiOnEMCal() < 70*TMath::DegToRad() || aodt->GetTrackPhiOnEMCal() > 190*TMath::DegToRad())){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
343
344 // conditions for run2
345 if( nModules > 12 ){
346 if( fClusterType == 3 && ( aodt->GetTrackPhiOnEMCal() < 250*TMath::DegToRad() || aodt->GetTrackPhiOnEMCal() > 340*TMath::DegToRad()) ){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
347 if( fClusterType == 1 && ( aodt->GetTrackPhiOnEMCal() < 70*TMath::DegToRad() || aodt->GetTrackPhiOnEMCal() > 190*TMath::DegToRad()) ){fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
348 }
349 }
350 trackParam = new AliExternalTrackParam(xyz,pxpypz,cv,aodt->Charge());
351 }
352
353 if (!trackParam) {AliError("Could not get TrackParameters, continue"); fHistControlMatches->Fill(1.,inTrack->Pt()); continue;}
354 AliExternalTrackParam emcParam(*trackParam);
355 Float_t eta, phi, pt;
356
357 //propagate tracks to emc surfaces
358 if(fClusterType == 1 || fClusterType == 3){
359 if (!AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(&emcParam, 440., 0.139, 20., eta, phi, pt)) {
360 delete trackParam;
361 fHistControlMatches->Fill(2.,inTrack->Pt());
362 continue;
363 }
364 if( TMath::Abs(eta) > 0.75 ) {
365 delete trackParam;
366 fHistControlMatches->Fill(3.,inTrack->Pt());
367 continue;
368 }
369 // Save some time and memory in case of no DCal present
370 if( fClusterType == 1 && nModules < 13 && ( phi < 70*TMath::DegToRad() || phi > 190*TMath::DegToRad())){
371 delete trackParam;
372 fHistControlMatches->Fill(3.,inTrack->Pt());
373 continue;
374 }
375 // Save some time and memory in case of run2
376 if( nModules > 12 ){
377 if (fClusterType == 3 && ( phi < 250*TMath::DegToRad() || phi > 340*TMath::DegToRad())){
378 delete trackParam;
379 fHistControlMatches->Fill(3.,inTrack->Pt());
380 continue;
381 }
382 if( fClusterType == 1 && ( phi < 70*TMath::DegToRad() || phi > 190*TMath::DegToRad())){
383 delete trackParam;
384 fHistControlMatches->Fill(3.,inTrack->Pt());
385 continue;
386 }
387 }
388 }else if(fClusterType == 2){
389 if( !AliTrackerBase::PropagateTrackToBxByBz(&emcParam, 460., 0.139, 20, kTRUE, 0.8, -1)){
390 delete trackParam;
391 fHistControlMatches->Fill(2.,inTrack->Pt());
392 continue;
393 }
394
395 if (TMath::Abs(eta) > 0.25 && (fClusterType == 2)){
396 delete trackParam;
397 fHistControlMatches->Fill(3.,inTrack->Pt());
398 continue;
399 }
400 }
401
402 Float_t dEta=-999, dPhi=-999;
403 Float_t clsPos[3] = {0.,0.,0.};
404 Double_t exPos[3] = {0.,0.,0.};
405 if (!emcParam.GetXYZ(exPos)){
406 delete trackParam;
407 fHistControlMatches->Fill(2.,inTrack->Pt());
408 continue;
409 }
410
411 // cout << inTrack->GetID() << " - " << trackParam << endl;
412 // cout << "eta/phi: " << eta << ", " << phi << endl;
413 // cout << "nClus: " << nClus << endl;
414 Int_t nClusterMatchesToTrack = 0;
415 for(Int_t iclus=0;iclus < nClus;iclus++){
416 AliVCluster* cluster = NULL;
417 if(arrClusters){
418 if(esdev){
419 if(arrClusters)
420 cluster = new AliESDCaloCluster(*(AliESDCaloCluster*)arrClusters->At(iclus));
421 } else if(aodev){
422 if(arrClusters)
423 cluster = new AliAODCaloCluster(*(AliAODCaloCluster*)arrClusters->At(iclus));
424 }
425 }
426 else
427 cluster = event->GetCaloCluster(iclus);
428 if (!cluster){
429 if(arrClusters) delete cluster;
430 continue;
431 }
432 // cout << "-------------------------LOOPING: " << iclus << ", " << cluster->GetID() << endl;
433 cluster->GetPosition(clsPos);
434 Double_t dR = TMath::Sqrt(TMath::Power(exPos[0]-clsPos[0],2)+TMath::Power(exPos[1]-clsPos[1],2)+TMath::Power(exPos[2]-clsPos[2],2));
435 //cout << "dR: " << dR << endl;
436 if (dR > fMatchingWindow){
437 if(arrClusters) delete cluster;
438 continue;
439 }
440 Double_t clusterR = TMath::Sqrt( clsPos[0]*clsPos[0] + clsPos[1]*clsPos[1] );
441 AliExternalTrackParam trackParamTmp(emcParam);//Retrieve the starting point every time before the extrapolation
442 if(fClusterType == 1 || fClusterType == 3){
443 if (!cluster->IsEMCAL()){
444 if(arrClusters) delete cluster;
445 continue;
446 }
447 if(!AliEMCALRecoUtils::ExtrapolateTrackToCluster(&trackParamTmp, cluster, 0.139, 5., dEta, dPhi)){
448 fHistControlMatches->Fill(4.,inTrack->Pt());
449 if(arrClusters) delete cluster;
450 continue;
451 }
452 }else if(fClusterType == 2){
453 if (!cluster->IsPHOS()){
454 if(arrClusters) delete cluster;
455 continue;
456 }
457 if(!AliTrackerBase::PropagateTrackToBxByBz(&trackParamTmp, clusterR, 0.139, 5., kTRUE, 0.8, -1)){
458 fHistControlMatches->Fill(4.,inTrack->Pt());
459 if(arrClusters) delete cluster;
460 continue;
461 }
462 Double_t trkPos[3] = {0,0,0};
463 trackParamTmp.GetXYZ(trkPos);
464 TVector3 trkPosVec(trkPos[0],trkPos[1],trkPos[2]);
465 TVector3 clsPosVec(clsPos);
466 dPhi = clsPosVec.DeltaPhi(trkPosVec);
467 dEta = clsPosVec.Eta()-trkPosVec.Eta();
468 }
469
470 Float_t dR2 = dPhi*dPhi + dEta*dEta;
471
472 //cout << dEta << " - " << dPhi << " - " << dR2 << endl;
473 if(dR2 > fMatchingResidual){
474 if(arrClusters) delete cluster;
475 continue;
476 }
477 nClusterMatchesToTrack++;
478 if(aodev){
479 fMapTrackToCluster.insert(make_pair(itr,cluster->GetID()));
480 fMapClusterToTrack.insert(make_pair(cluster->GetID(),itr));
481 }else{
482 fMapTrackToCluster.insert(make_pair(inTrack->GetID(),cluster->GetID()));
483 fMapClusterToTrack.insert(make_pair(cluster->GetID(),inTrack->GetID()));
484 }
485 fVectorDeltaEtaDeltaPhi.push_back(make_pair(dEta,dPhi));
486 fMap_TrID_ClID_ToIndex[make_pair(inTrack->GetID(),cluster->GetID())] = fNEntries++;
487 if( (Int_t)fVectorDeltaEtaDeltaPhi.size() != (fNEntries-1)) AliFatal("Fatal error in AliCaloTrackMatcher, vector and map are not in sync!");
488 if(arrClusters) delete cluster;
489 }
490 if(nClusterMatchesToTrack == 0) fHistControlMatches->Fill(5.,inTrack->Pt());
491 else fHistControlMatches->Fill(6.,inTrack->Pt());
492 delete trackParam;
493 }
494
495 return;
496 }
497
498 //________________________________________________________________________
499 Bool_t AliCaloTrackMatcher::PropagateV0TrackToClusterAndGetMatchingResidual(AliVTrack* inSecTrack, AliVCluster* cluster, AliVEvent* event, Float_t &dEta, Float_t &dPhi){
500
501 //if V0-track to cluster match is already available return stored residuals
502 if(GetSecTrackClusterMatchingResidual(inSecTrack->GetID(),cluster->GetID(), dEta, dPhi)){
503 //cout << "RESIDUAL ALREADY AVAILABLE! - " << dEta << "/" << dPhi << endl;
504 return kTRUE;
505 }
506
507 if(IsSecTrackClusterAlreadyTried(inSecTrack->GetID(),cluster->GetID())){
508 //cout << "PROPAGATION ALREADY FAILED! - " << inSecTrack->GetID() << "/" << cluster->GetID() << endl;
509 return kFALSE;
510 }
511
512 //cout << "running matching! - " << inSecTrack->GetID() << "/" << cluster->GetID() << endl;
513 //if match has not yet been computed, go on:
514 Int_t nModules = 0;
515 if(fClusterType == 1 || fClusterType == 3) nModules = fGeomEMCAL->GetNumberOfSuperModules();
516 else if(fClusterType == 2) nModules = fGeomPHOS->GetNModules();
517
518 AliESDEvent *esdev = dynamic_cast<AliESDEvent*>(event);
519 AliAODEvent *aodev = 0;
520 if (!esdev) {
521 aodev = dynamic_cast<AliAODEvent*>(event);
522 if (!aodev) {
523 AliError("Task needs AOD or ESD event, returning");
524 return kFALSE;
525 }
526 }
527
528 if(!cluster->IsEMCAL() && !cluster->IsPHOS()){AliError("Cluster is neither EMCAL nor PHOS, returning");return kFALSE;}
529
530 Float_t clusterPosition[3] = {0,0,0};
531 cluster->GetPosition(clusterPosition);
532 Double_t clusterR = TMath::Sqrt( clusterPosition[0]*clusterPosition[0] + clusterPosition[1]*clusterPosition[1] );
533
534 if(!inSecTrack) return kFALSE;
535 fSecHistControlMatches->Fill(0.,inSecTrack->Pt());
536
537 if (inSecTrack->Pt() < 0.3 ) {
538 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
539 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
540 return kFALSE;
541 }
542
543 AliESDtrack *esdt = dynamic_cast<AliESDtrack*>(inSecTrack);
544 AliAODTrack *aodt = 0;
545 if (!esdt) {
546 aodt = dynamic_cast<AliAODTrack*>(inSecTrack);
547 if (!aodt){
548 AliError("Track is neither ESD nor AOD, continue");
549 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
550 return kFALSE;
551 }
552 }
553
554 AliExternalTrackParam *trackParam = 0;
555 if (esdt) {
556 const AliExternalTrackParam *in = esdt->GetInnerParam();
557 if (!in){
558 AliDebug(2, "Could not get InnerParam of Track, continue");
559 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
560 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
561 return kFALSE;
562 }
563 trackParam = new AliExternalTrackParam(*in);
564 } else {
565 // check if tracks should be propagated at all
566 if (fClusterType == 1 || fClusterType == 3){
567 if (TMath::Abs(aodt->GetTrackEtaOnEMCal()) > 0.8){
568 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
569 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
570 return kFALSE;
571 }
572 if( nModules < 13 ){
573 if (( aodt->GetTrackPhiOnEMCal() < 60*TMath::DegToRad() || aodt->GetTrackPhiOnEMCal() > 200*TMath::DegToRad())){
574 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
575 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
576 return kFALSE;
577 }
578 } else if( nModules > 12 ){
579 if (fClusterType == 3 && ( aodt->GetTrackPhiOnEMCal() < 250*TMath::DegToRad() || aodt->GetTrackPhiOnEMCal() > 340*TMath::DegToRad())){
580 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
581 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
582 return kFALSE;
583 }
584 if( fClusterType == 1 && ( aodt->GetTrackPhiOnEMCal() < 60*TMath::DegToRad() || aodt->GetTrackPhiOnEMCal() > 200*TMath::DegToRad())){
585 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
586 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
587 return kFALSE;
588 }
589 }
590 } else {
591 if ( aodt->Phi() < 60*TMath::DegToRad() || aodt->Phi() > 200*TMath::DegToRad()){
592 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
593 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
594 return kFALSE;
595 }
596 if (TMath::Abs(aodt->Eta()) > 0.3 ){
597 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
598 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
599 return kFALSE;
600 }
601 }
602
603 Double_t xyz[3] = {0}, pxpypz[3] = {0}, cv[21] = {0};
604 aodt->GetPxPyPz(pxpypz);
605 aodt->GetXYZ(xyz);
606 aodt->GetCovarianceXYZPxPyPz(cv);
607 trackParam = new AliExternalTrackParam(xyz,pxpypz,cv,aodt->Charge());
608 }
609 if(!trackParam){
610 AliError("Could not get TrackParameters, continue");
611 fSecHistControlMatches->Fill(1.,inSecTrack->Pt());
612 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
613 return kFALSE;
614 }
615
616 Bool_t propagated = kFALSE;
617 AliExternalTrackParam emcParam(*trackParam);
618 Float_t dPhiTemp = 0;
619 Float_t dEtaTemp = 0;
620
621 if(cluster->IsEMCAL()){
622 Float_t eta = 0;Float_t phi = 0;Float_t pt = 0;
623 propagated = AliEMCALRecoUtils::ExtrapolateTrackToEMCalSurface(&emcParam, 430, 0.000510999, 20, eta, phi, pt);
624 if(propagated){
625 if( TMath::Abs(eta) > 0.8 ) {
626 delete trackParam;
627 fSecHistControlMatches->Fill(3.,inSecTrack->Pt());
628 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
629 return kFALSE;
630 }
631 // Save some time and memory in case of no DCal present
632 if( nModules < 13 && ( phi < 60*TMath::DegToRad() || phi > 200*TMath::DegToRad())){
633 delete trackParam;
634 fSecHistControlMatches->Fill(3.,inSecTrack->Pt());
635 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
636 return kFALSE;
637 }
638
639 propagated = AliEMCALRecoUtils::ExtrapolateTrackToCluster(&emcParam, cluster, 0.000510999, 5, dEtaTemp, dPhiTemp);
640 if(!propagated){
641 delete trackParam;
642 fSecHistControlMatches->Fill(4.,inSecTrack->Pt());
643 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
644 return kFALSE;
645 }
646 }else{
647 delete trackParam;
648 fSecHistControlMatches->Fill(2.,inSecTrack->Pt());
649 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
650 return kFALSE;
651 }
652
653 }else if(cluster->IsPHOS()){
654 propagated = AliTrackerBase::PropagateTrackToBxByBz(&emcParam, clusterR, 0.000510999, 20, kTRUE, 0.8, -1);
655 if (propagated){
656 Double_t trkPos[3] = {0,0,0};
657 emcParam.GetXYZ(trkPos);
658 TVector3 trkPosVec(trkPos[0],trkPos[1],trkPos[2]);
659 TVector3 clsPosVec(clusterPosition);
660 dPhiTemp = clsPosVec.DeltaPhi(trkPosVec);
661 dEtaTemp = clsPosVec.Eta()-trkPosVec.Eta();
662 }else{
663 delete trackParam;
664 fSecHistControlMatches->Fill(2.,inSecTrack->Pt());
665 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
666 return kFALSE;}
667 }
668
669 if (propagated){
670 Float_t dR2 = dPhiTemp*dPhiTemp + dEtaTemp*dEtaTemp;
671 //cout << dEtaTemp << " - " << dPhiTemp << " - " << dR2 << endl;
672 if(dR2 > fMatchingResidual){
673 fSecHistControlMatches->Fill(5.,inSecTrack->Pt());
674 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
675 //cout << "NO MATCH! - " << inSecTrack->GetID() << "/" << cluster->GetID() << endl;
676 delete trackParam;
677 return kFALSE;
678 }
679 //cout << "MATCHED!!!!!!!" << endl;
680
681 if(aodev){
682 //need to search for position in case of AOD
683 Int_t TrackPos = -1;
684 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
685 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
686 if(currTrack->GetID() == inSecTrack->GetID()){
687 TrackPos = iTrack;
688 break;
689 }
690 }
691 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: PropagateV0TrackToClusterAndGetMatchingResidual - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",inSecTrack->GetID()));
692 fSecMapTrackToCluster.insert(make_pair(TrackPos,cluster->GetID()));
693 fSecMapClusterToTrack.insert(make_pair(cluster->GetID(),TrackPos));
694 }else{
695 fSecMapTrackToCluster.insert(make_pair(inSecTrack->GetID(),cluster->GetID()));
696 fSecMapClusterToTrack.insert(make_pair(cluster->GetID(),inSecTrack->GetID()));
697 }
698 fSecVectorDeltaEtaDeltaPhi.push_back(make_pair(dEtaTemp,dPhiTemp));
699 fSecMap_TrID_ClID_ToIndex[make_pair(inSecTrack->GetID(),cluster->GetID())] = fSecNEntries++;
700 if( (Int_t)fSecVectorDeltaEtaDeltaPhi.size() != (fSecNEntries-1)) AliFatal("Fatal error in AliCaloTrackMatcher, vector and map are not in sync!");
701
702 fSecHistControlMatches->Fill(6.,inSecTrack->Pt());
703 dEta = dEtaTemp;
704 dPhi = dPhiTemp;
705 delete trackParam;
706 return kTRUE;
707 }else AliFatal("Fatal error in AliCaloTrackMatcher, track is labeled as sucessfully propagated although this should be impossible!");
708
709 fSecMap_TrID_ClID_AlreadyTried[make_pair(inSecTrack->GetID(),cluster->GetID())] = 1.;
710 delete trackParam;
711 return kFALSE;
712 }
713
714 //________________________________________________________________________
715 //________________________________________________________________________
716 //________________________________________________________________________
717 //________________________________________________________________________
718 //________________________________________________________________________
720 Int_t position = fMap_TrID_ClID_ToIndex[make_pair(trackID,clusterID)];
721 if(position == 0) return kFALSE;
722
723 pairFloat tempEtaPhi = fVectorDeltaEtaDeltaPhi.at(position-1);
724 dEta = tempEtaPhi.first;
725 dPhi = tempEtaPhi.second;
726 return kTRUE;
727 }
728 //________________________________________________________________________
729 Int_t AliCaloTrackMatcher::GetNMatchedTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin){
730 Int_t matched = 0;
731 multimap<Int_t,Int_t>::iterator it;
732 for (it=fMapClusterToTrack.begin(); it!=fMapClusterToTrack.end(); ++it){
733 if(it->first == clusterID){
734 Float_t tempDEta, tempDPhi;
735 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
736 if(!tempTrack) continue;
737 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
738 if(tempTrack->Charge()>0){
739 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin < tempDPhi) && (tempDPhi < dPhiMax) ) matched++;
740 }else if(tempTrack->Charge()<0){
741 dPhiMin*=-1;
742 dPhiMax*=-1;
743 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin > tempDPhi) && (tempDPhi > dPhiMax) ) matched++;
744 }
745 }
746 }
747 }
748
749 return matched;
750 }
751
752 //________________________________________________________________________
753 Int_t AliCaloTrackMatcher::GetNMatchedTrackIDsForCluster(AliVEvent *event, Int_t clusterID, TF1* fFuncPtDepEta, TF1* fFuncPtDepPhi){
754 Int_t matched = 0;
755 multimap<Int_t,Int_t>::iterator it;
756 for (it=fMapClusterToTrack.begin(); it!=fMapClusterToTrack.end(); ++it){
757 if(it->first == clusterID){
758 Float_t tempDEta, tempDPhi;
759 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
760 if(!tempTrack) continue;
761 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
762 Bool_t match_dEta = kFALSE;
763 Bool_t match_dPhi = kFALSE;
764 if( TMath::Abs(tempDEta) < fFuncPtDepEta->Eval(tempTrack->Pt())) match_dEta = kTRUE;
765 else match_dEta = kFALSE;
766
767 if( TMath::Abs(tempDPhi) < fFuncPtDepPhi->Eval(tempTrack->Pt())) match_dPhi = kTRUE;
768 else match_dPhi = kFALSE;
769
770 if (match_dPhi && match_dEta )matched++;
771 }
772 }
773 }
774 return matched;
775 }
776
777 //________________________________________________________________________
779 Int_t matched = 0;
780 multimap<Int_t,Int_t>::iterator it;
781 for (it=fMapClusterToTrack.begin(); it!=fMapClusterToTrack.end(); ++it){
782 if(it->first == clusterID){
783 Float_t tempDEta, tempDPhi;
784 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
785 if(!tempTrack) continue;
786 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
787 if (TMath::Sqrt(tempDEta*tempDEta + tempDPhi*tempDPhi) < dR ) matched++;
788 }
789 }
790 }
791 return matched;
792 }
793
794 //________________________________________________________________________
795 Int_t AliCaloTrackMatcher::GetNMatchedClusterIDsForTrack(AliVEvent *event, Int_t trackID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin){
796
797 Int_t TrackPos = -1;
798 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
799 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
800 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
801 if(currTrack->GetID() == trackID){
802 TrackPos = iTrack;
803 break;
804 }
805 }
806 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
807 }else TrackPos = trackID; // for ESD just take trackID
808
809 Int_t matched = 0;
810 multimap<Int_t,Int_t>::iterator it;
811 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
812 if(!tempTrack) return matched;
813 for (it=fMapTrackToCluster.begin(); it!=fMapTrackToCluster.end(); ++it){
814 if(it->first == TrackPos){
815 Float_t tempDEta, tempDPhi;
816 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
817 if(tempTrack->Charge()>0){
818 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin < tempDPhi) && (tempDPhi < dPhiMax) ) matched++;
819 }else if(tempTrack->Charge()<0){
820 dPhiMin*=-1;
821 dPhiMax*=-1;
822 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin > tempDPhi) && (tempDPhi > dPhiMax) ) matched++;
823 }
824 }
825 }
826 }
827 return matched;
828 }
829
830 //________________________________________________________________________
831 Int_t AliCaloTrackMatcher::GetNMatchedClusterIDsForTrack(AliVEvent *event, Int_t trackID, TF1* fFuncPtDepEta, TF1* fFuncPtDepPhi){
832 Int_t TrackPos = -1;
833 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
834 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
835 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
836 if(currTrack->GetID() == trackID){
837 TrackPos = iTrack;
838 break;
839 }
840 }
841 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
842 }else TrackPos = trackID; // for ESD just take trackID
843
844 Int_t matched = 0;
845 multimap<Int_t,Int_t>::iterator it;
846 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
847 if(!tempTrack) return matched;
848 for (it=fMapTrackToCluster.begin(); it!=fMapTrackToCluster.end(); ++it){
849 if(it->first == TrackPos){
850 Float_t tempDEta, tempDPhi;
851 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
852 Bool_t match_dEta = kFALSE;
853 Bool_t match_dPhi = kFALSE;
854 if( TMath::Abs(tempDEta) < fFuncPtDepEta->Eval(tempTrack->Pt())) match_dEta = kTRUE;
855 else match_dEta = kFALSE;
856
857 if( TMath::Abs(tempDPhi) < fFuncPtDepPhi->Eval(tempTrack->Pt())) match_dPhi = kTRUE;
858 else match_dPhi = kFALSE;
859
860 if (match_dPhi && match_dEta )matched++;
861
862 }
863 }
864 }
865 return matched;
866 }
867
868 //________________________________________________________________________
870 Int_t TrackPos = -1;
871 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
872 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
873 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
874 if(currTrack->GetID() == trackID){
875 TrackPos = iTrack;
876 break;
877 }
878 }
879 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
880 }else TrackPos = trackID; // for ESD just take trackID
881
882 Int_t matched = 0;
883 multimap<Int_t,Int_t>::iterator it;
884 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
885 if(!tempTrack) return matched;
886 for (it=fMapTrackToCluster.begin(); it!=fMapTrackToCluster.end(); ++it){
887 if(it->first == TrackPos){
888 Float_t tempDEta, tempDPhi;
889 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
890 if (TMath::Sqrt(tempDEta*tempDEta + tempDPhi*tempDPhi) < dR ) matched++;
891 }
892 }
893 }
894 return matched;
895 }
896
897 //________________________________________________________________________
898 vector<Int_t> AliCaloTrackMatcher::GetMatchedTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin){
899 vector<Int_t> tempMatchedTracks;
900 multimap<Int_t,Int_t>::iterator it;
901 for (it=fMapClusterToTrack.begin(); it!=fMapClusterToTrack.end(); ++it){
902 if(it->first == clusterID){
903 Float_t tempDEta, tempDPhi;
904 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
905 if(!tempTrack) continue;
906 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
907 if(tempTrack->Charge()>0){
908 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin < tempDPhi) && (tempDPhi < dPhiMax) ) tempMatchedTracks.push_back(it->second);
909 }else if(tempTrack->Charge()<0){
910 dPhiMin*=-1;
911 dPhiMax*=-1;
912 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin > tempDPhi) && (tempDPhi > dPhiMax) ) tempMatchedTracks.push_back(it->second);
913 }
914 }
915 }
916 }
917 return tempMatchedTracks;
918 }
919
920 //________________________________________________________________________
921 vector<Int_t> AliCaloTrackMatcher::GetMatchedTrackIDsForCluster(AliVEvent *event, Int_t clusterID, TF1* fFuncPtDepEta, TF1* fFuncPtDepPhi){
922 vector<Int_t> tempMatchedTracks;
923 multimap<Int_t,Int_t>::iterator it;
924 for (it=fMapClusterToTrack.begin(); it!=fMapClusterToTrack.end(); ++it){
925 if(it->first == clusterID){
926 Float_t tempDEta, tempDPhi;
927 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
928 if(!tempTrack) continue;
929 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
930 Bool_t match_dEta = kFALSE;
931 Bool_t match_dPhi = kFALSE;
932 if( TMath::Abs(tempDEta) < fFuncPtDepEta->Eval(tempTrack->Pt())) match_dEta = kTRUE;
933 else match_dEta = kFALSE;
934
935 if( TMath::Abs(tempDPhi) < fFuncPtDepPhi->Eval(tempTrack->Pt())) match_dPhi = kTRUE;
936 else match_dPhi = kFALSE;
937
938 if (match_dPhi && match_dEta )tempMatchedTracks.push_back(it->second);
939
940 }
941 }
942 }
943 return tempMatchedTracks;
944 }
945
946 //________________________________________________________________________
947 vector<Int_t> AliCaloTrackMatcher::GetMatchedTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dR){
948 vector<Int_t> tempMatchedTracks;
949 multimap<Int_t,Int_t>::iterator it;
950 for (it=fMapClusterToTrack.begin(); it!=fMapClusterToTrack.end(); ++it){
951 if(it->first == clusterID){
952 Float_t tempDEta, tempDPhi;
953 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
954 if(!tempTrack) continue;
955 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
956 if (TMath::Sqrt(tempDEta*tempDEta + tempDPhi*tempDPhi) < dR ) tempMatchedTracks.push_back(it->second);
957 }
958 }
959 }
960 return tempMatchedTracks;
961 }
962
963 //________________________________________________________________________
964 vector<Int_t> AliCaloTrackMatcher::GetMatchedClusterIDsForTrack(AliVEvent *event, Int_t trackID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin){
965 Int_t TrackPos = -1;
966 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
967 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
968 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
969 if(currTrack->GetID() == trackID){
970 TrackPos = iTrack;
971 break;
972 }
973 }
974 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
975 }else TrackPos = trackID; // for ESD just take trackID
976
977 vector<Int_t> tempMatchedClusters;
978 multimap<Int_t,Int_t>::iterator it;
979 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
980 if(!tempTrack) return tempMatchedClusters;
981 for (it=fMapTrackToCluster.begin(); it!=fMapTrackToCluster.end(); ++it){
982 if(it->first == TrackPos){
983 Float_t tempDEta, tempDPhi;
984 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
985 if(tempTrack->Charge()>0){
986 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin < tempDPhi) && (tempDPhi < dPhiMax) ) tempMatchedClusters.push_back(it->second);
987 }else if(tempTrack->Charge()<0){
988 dPhiMin*=-1;
989 dPhiMax*=-1;
990 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin > tempDPhi) && (tempDPhi > dPhiMax) ) tempMatchedClusters.push_back(it->second);
991 }
992 }
993 }
994 }
995
996 return tempMatchedClusters;
997 }
998
999 //________________________________________________________________________
1000 vector<Int_t> AliCaloTrackMatcher::GetMatchedClusterIDsForTrack(AliVEvent *event, Int_t trackID, TF1* fFuncPtDepEta, TF1* fFuncPtDepPhi){
1001 Int_t TrackPos = -1;
1002 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
1003 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
1004 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
1005 if(currTrack->GetID() == trackID){
1006 TrackPos = iTrack;
1007 break;
1008 }
1009 }
1010 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
1011 }else TrackPos = trackID; // for ESD just take trackID
1012
1013 vector<Int_t> tempMatchedClusters;
1014 multimap<Int_t,Int_t>::iterator it;
1015 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
1016 if(!tempTrack) return tempMatchedClusters;
1017 for (it=fMapTrackToCluster.begin(); it!=fMapTrackToCluster.end(); ++it){
1018 if(it->first == TrackPos){
1019 Float_t tempDEta, tempDPhi;
1020 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
1021 Bool_t match_dEta = kFALSE;
1022 Bool_t match_dPhi = kFALSE;
1023 if( TMath::Abs(tempDEta) < fFuncPtDepEta->Eval(tempTrack->Pt())) match_dEta = kTRUE;
1024 else match_dEta = kFALSE;
1025
1026 if( TMath::Abs(tempDPhi) < fFuncPtDepPhi->Eval(tempTrack->Pt())) match_dPhi = kTRUE;
1027 else match_dPhi = kFALSE;
1028
1029 if (match_dPhi && match_dEta )tempMatchedClusters.push_back(it->second);
1030 }
1031 }
1032 }
1033 return tempMatchedClusters;
1034 }
1035
1036 //________________________________________________________________________
1037 vector<Int_t> AliCaloTrackMatcher::GetMatchedClusterIDsForTrack(AliVEvent *event, Int_t trackID, Float_t dR){
1038 Int_t TrackPos = -1;
1039 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
1040 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
1041 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
1042 if(currTrack->GetID() == trackID){
1043 TrackPos = iTrack;
1044 break;
1045 }
1046 }
1047 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
1048 }else TrackPos = trackID; // for ESD just take trackID
1049
1050 vector<Int_t> tempMatchedClusters;
1051 multimap<Int_t,Int_t>::iterator it;
1052 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
1053 if(!tempTrack) return tempMatchedClusters;
1054 for (it=fMapTrackToCluster.begin(); it!=fMapTrackToCluster.end(); ++it){
1055 if(it->first == TrackPos){
1056 Float_t tempDEta, tempDPhi;
1057 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
1058 if (TMath::Sqrt(tempDEta*tempDEta + tempDPhi*tempDPhi) < dR ) tempMatchedClusters.push_back(it->second);
1059 }
1060 }
1061 }
1062 return tempMatchedClusters;
1063 }
1064
1065 //________________________________________________________________________
1066 //________________________________________________________________________
1067 //________________________________________________________________________
1068 //________________________________________________________________________
1069 //________________________________________________________________________
1071 Int_t position = fSecMap_TrID_ClID_ToIndex[make_pair(trackID,clusterID)];
1072 if(position == 0) return kFALSE;
1073
1074 pairFloat tempEtaPhi = fSecVectorDeltaEtaDeltaPhi.at(position-1);
1075 dEta = tempEtaPhi.first;
1076 dPhi = tempEtaPhi.second;
1077 return kTRUE;
1078 }
1079 //________________________________________________________________________
1081 Int_t position = fSecMap_TrID_ClID_AlreadyTried[make_pair(trackID,clusterID)];
1082 if(position == 0) return kFALSE;
1083 else return kTRUE;
1084 }
1085 //________________________________________________________________________
1086 Int_t AliCaloTrackMatcher::GetNMatchedSecTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin){
1087 Int_t matched = 0;
1088 multimap<Int_t,Int_t>::iterator it;
1089 for (it=fSecMapClusterToTrack.begin(); it!=fSecMapClusterToTrack.end(); ++it){
1090 if(it->first == clusterID){
1091 Float_t tempDEta, tempDPhi;
1092 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
1093 if(!tempTrack) continue;
1094 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
1095 if(tempTrack->Charge()>0){
1096 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin < tempDPhi) && (tempDPhi < dPhiMax) ) matched++;
1097 }else if(tempTrack->Charge()<0){
1098 dPhiMin*=-1;
1099 dPhiMax*=-1;
1100 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin > tempDPhi) && (tempDPhi > dPhiMax) ) matched++;
1101 }
1102 }
1103 }
1104 }
1105
1106 return matched;
1107 }
1108
1109 //________________________________________________________________________
1110 Int_t AliCaloTrackMatcher::GetNMatchedSecTrackIDsForCluster(AliVEvent *event, Int_t clusterID, TF1* fFuncPtDepEta, TF1* fFuncPtDepPhi){
1111 Int_t matched = 0;
1112 multimap<Int_t,Int_t>::iterator it;
1113 for (it=fSecMapClusterToTrack.begin(); it!=fSecMapClusterToTrack.end(); ++it){
1114 if(it->first == clusterID){
1115 Float_t tempDEta, tempDPhi;
1116 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
1117 if(!tempTrack) continue;
1118 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
1119 Bool_t match_dEta = kFALSE;
1120 Bool_t match_dPhi = kFALSE;
1121 if( TMath::Abs(tempDEta) < fFuncPtDepEta->Eval(tempTrack->Pt())) match_dEta = kTRUE;
1122 else match_dEta = kFALSE;
1123
1124 if( TMath::Abs(tempDPhi) < fFuncPtDepPhi->Eval(tempTrack->Pt())) match_dPhi = kTRUE;
1125 else match_dPhi = kFALSE;
1126
1127 if (match_dPhi && match_dEta )matched++;
1128 }
1129 }
1130 }
1131
1132 return matched;
1133 }
1134
1135 //________________________________________________________________________
1137 Int_t matched = 0;
1138 multimap<Int_t,Int_t>::iterator it;
1139 for (it=fSecMapClusterToTrack.begin(); it!=fSecMapClusterToTrack.end(); ++it){
1140 if(it->first == clusterID){
1141 Float_t tempDEta, tempDPhi;
1142 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
1143 if(!tempTrack) continue;
1144 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
1145 if (TMath::Sqrt(tempDEta*tempDEta + tempDPhi*tempDPhi) < dR ) matched++;
1146 }
1147 }
1148 }
1149
1150 return matched;
1151 }
1152
1153 //________________________________________________________________________
1154 Int_t AliCaloTrackMatcher::GetNMatchedClusterIDsForSecTrack(AliVEvent *event, Int_t trackID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin){
1155 Int_t TrackPos = -1;
1156 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
1157 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
1158 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
1159 if(currTrack->GetID() == trackID){
1160 TrackPos = iTrack;
1161 break;
1162 }
1163 }
1164 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
1165 }else TrackPos = trackID; // for ESD just take trackID
1166
1167 Int_t matched = 0;
1168 multimap<Int_t,Int_t>::iterator it;
1169 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
1170 if(!tempTrack) return matched;
1171 for (it=fSecMapTrackToCluster.begin(); it!=fSecMapTrackToCluster.end(); ++it){
1172 if(it->first == TrackPos){
1173 Float_t tempDEta, tempDPhi;
1174 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
1175 if(tempTrack->Charge()>0){
1176 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin < tempDPhi) && (tempDPhi < dPhiMax) ) matched++;
1177 }else if(tempTrack->Charge()<0){
1178 dPhiMin*=-1;
1179 dPhiMax*=-1;
1180 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin > tempDPhi) && (tempDPhi > dPhiMax) ) matched++;
1181 }
1182 }
1183 }
1184 }
1185
1186 return matched;
1187 }
1188
1189 //________________________________________________________________________
1190 Int_t AliCaloTrackMatcher::GetNMatchedClusterIDsForSecTrack(AliVEvent *event, Int_t trackID, TF1* fFuncPtDepEta, TF1* fFuncPtDepPhi){
1191 Int_t TrackPos = -1;
1192 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
1193 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
1194 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
1195 if(currTrack->GetID() == trackID){
1196 TrackPos = iTrack;
1197 break;
1198 }
1199 }
1200 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
1201 }else TrackPos = trackID; // for ESD just take trackID
1202
1203 Int_t matched = 0;
1204 multimap<Int_t,Int_t>::iterator it;
1205 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
1206 if(!tempTrack) return matched;
1207 for (it=fSecMapTrackToCluster.begin(); it!=fSecMapTrackToCluster.end(); ++it){
1208 if(it->first == TrackPos){
1209 Float_t tempDEta, tempDPhi;
1210 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
1211 Bool_t match_dEta = kFALSE;
1212 Bool_t match_dPhi = kFALSE;
1213 if( TMath::Abs(tempDEta) < fFuncPtDepEta->Eval(tempTrack->Pt())) match_dEta = kTRUE;
1214 else match_dEta = kFALSE;
1215
1216 if( TMath::Abs(tempDPhi) < fFuncPtDepPhi->Eval(tempTrack->Pt())) match_dPhi = kTRUE;
1217 else match_dPhi = kFALSE;
1218
1219 if (match_dPhi && match_dEta )matched++;
1220
1221 }
1222 }
1223 }
1224
1225 return matched;
1226 }
1227
1228 //________________________________________________________________________
1230 Int_t TrackPos = -1;
1231 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
1232 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
1233 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
1234 if(currTrack->GetID() == trackID){
1235 TrackPos = iTrack;
1236 break;
1237 }
1238 }
1239 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
1240 }else TrackPos = trackID; // for ESD just take trackID
1241
1242 Int_t matched = 0;
1243 multimap<Int_t,Int_t>::iterator it;
1244 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
1245 if(!tempTrack) return matched;
1246 for (it=fSecMapTrackToCluster.begin(); it!=fSecMapTrackToCluster.end(); ++it){
1247 if(it->first == TrackPos){
1248 Float_t tempDEta, tempDPhi;
1249 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
1250 if (TMath::Sqrt(tempDEta*tempDEta + tempDPhi*tempDPhi) < dR ) matched++;
1251 }
1252 }
1253 }
1254
1255 return matched;
1256 }
1257
1258 //________________________________________________________________________
1259 vector<Int_t> AliCaloTrackMatcher::GetMatchedSecTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin){
1260 vector<Int_t> tempMatchedTracks;
1261 multimap<Int_t,Int_t>::iterator it;
1262 for (it=fSecMapClusterToTrack.begin(); it!=fSecMapClusterToTrack.end(); ++it){
1263 if(it->first == clusterID){
1264 Float_t tempDEta, tempDPhi;
1265 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
1266 if(!tempTrack) continue;
1267 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
1268 if(tempTrack->Charge()>0){
1269 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin < tempDPhi) && (tempDPhi < dPhiMax) ) tempMatchedTracks.push_back(it->second);
1270 }else if(tempTrack->Charge()<0){
1271 dPhiMin*=-1;
1272 dPhiMax*=-1;
1273 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin > tempDPhi) && (tempDPhi > dPhiMax) ) tempMatchedTracks.push_back(it->second);
1274 }
1275 }
1276 }
1277 }
1278
1279 return tempMatchedTracks;
1280 }
1281
1282 //________________________________________________________________________
1283 vector<Int_t> AliCaloTrackMatcher::GetMatchedSecTrackIDsForCluster(AliVEvent *event, Int_t clusterID, TF1* fFuncPtDepEta, TF1* fFuncPtDepPhi){
1284 vector<Int_t> tempMatchedTracks;
1285 multimap<Int_t,Int_t>::iterator it;
1286 for (it=fSecMapClusterToTrack.begin(); it!=fSecMapClusterToTrack.end(); ++it){
1287 if(it->first == clusterID){
1288 Float_t tempDEta, tempDPhi;
1289 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
1290 if(!tempTrack) continue;
1291 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
1292 Bool_t match_dEta = kFALSE;
1293 Bool_t match_dPhi = kFALSE;
1294 if( TMath::Abs(tempDEta) < fFuncPtDepEta->Eval(tempTrack->Pt())) match_dEta = kTRUE;
1295 else match_dEta = kFALSE;
1296
1297 if( TMath::Abs(tempDPhi) < fFuncPtDepPhi->Eval(tempTrack->Pt())) match_dPhi = kTRUE;
1298 else match_dPhi = kFALSE;
1299
1300 if (match_dPhi && match_dEta )tempMatchedTracks.push_back(it->second);
1301 }
1302 }
1303 }
1304
1305 return tempMatchedTracks;
1306 }
1307
1308 //________________________________________________________________________
1309 vector<Int_t> AliCaloTrackMatcher::GetMatchedSecTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dR){
1310 vector<Int_t> tempMatchedTracks;
1311 multimap<Int_t,Int_t>::iterator it;
1312 for (it=fSecMapClusterToTrack.begin(); it!=fSecMapClusterToTrack.end(); ++it){
1313 if(it->first == clusterID){
1314 Float_t tempDEta, tempDPhi;
1315 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(it->second));
1316 if(!tempTrack) continue;
1317 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->first,tempDEta,tempDPhi)){
1318 if (TMath::Sqrt(tempDEta*tempDEta + tempDPhi*tempDPhi) < dR ) tempMatchedTracks.push_back(it->second);
1319 }
1320 }
1321 }
1322
1323 return tempMatchedTracks;
1324 }
1325
1326 //________________________________________________________________________
1327 vector<Int_t> AliCaloTrackMatcher::GetMatchedClusterIDsForSecTrack(AliVEvent *event, Int_t trackID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin){
1328 Int_t TrackPos = -1;
1329 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
1330 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
1331 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
1332 if(currTrack->GetID() == trackID){
1333 TrackPos = iTrack;
1334 break;
1335 }
1336 }
1337 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
1338 }else TrackPos = trackID; // for ESD just take trackID
1339
1340 vector<Int_t> tempMatchedClusters;
1341 multimap<Int_t,Int_t>::iterator it;
1342 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
1343 if(!tempTrack) return tempMatchedClusters;
1344 for (it=fSecMapTrackToCluster.begin(); it!=fSecMapTrackToCluster.end(); ++it){
1345 if(it->first == TrackPos){
1346 Float_t tempDEta, tempDPhi;
1347 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
1348 if(tempTrack->Charge()>0){
1349 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin < tempDPhi) && (tempDPhi < dPhiMax) ) tempMatchedClusters.push_back(it->second);
1350 }else if(tempTrack->Charge()<0){
1351 dPhiMin*=-1;
1352 dPhiMax*=-1;
1353 if( (dEtaMin < tempDEta) && (tempDEta < dEtaMax) && (dPhiMin > tempDPhi) && (tempDPhi > dPhiMax) ) tempMatchedClusters.push_back(it->second);
1354 }
1355 }
1356 }
1357 }
1358
1359 return tempMatchedClusters;
1360 }
1361
1362 //________________________________________________________________________
1363 vector<Int_t> AliCaloTrackMatcher::GetMatchedClusterIDsForSecTrack(AliVEvent *event, Int_t trackID, TF1* fFuncPtDepEta, TF1* fFuncPtDepPhi){
1364 Int_t TrackPos = -1;
1365 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
1366 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
1367 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
1368 if(currTrack->GetID() == trackID){
1369 TrackPos = iTrack;
1370 break;
1371 }
1372 }
1373 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
1374 }else TrackPos = trackID; // for ESD just take trackID
1375
1376 vector<Int_t> tempMatchedClusters;
1377 multimap<Int_t,Int_t>::iterator it;
1378 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
1379 if(!tempTrack) return tempMatchedClusters;
1380 for (it=fSecMapTrackToCluster.begin(); it!=fSecMapTrackToCluster.end(); ++it){
1381 if(it->first == TrackPos){
1382 Float_t tempDEta, tempDPhi;
1383 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
1384 Bool_t match_dEta = kFALSE;
1385 Bool_t match_dPhi = kFALSE;
1386 if( TMath::Abs(tempDEta) < fFuncPtDepEta->Eval(tempTrack->Pt())) match_dEta = kTRUE;
1387 else match_dEta = kFALSE;
1388
1389 if( TMath::Abs(tempDPhi) < fFuncPtDepPhi->Eval(tempTrack->Pt())) match_dPhi = kTRUE;
1390 else match_dPhi = kFALSE;
1391
1392 if (match_dPhi && match_dEta )tempMatchedClusters.push_back(it->second);
1393 }
1394 }
1395 }
1396
1397 return tempMatchedClusters;
1398 }
1399
1400 //________________________________________________________________________
1401 vector<Int_t> AliCaloTrackMatcher::GetMatchedClusterIDsForSecTrack(AliVEvent *event, Int_t trackID, Float_t dR){
1402 Int_t TrackPos = -1;
1403 if(event->IsA()==AliAODEvent::Class()){ // for AOD, we have to look for position of track in the event
1404 for (Int_t iTrack = 0; iTrack < event->GetNumberOfTracks(); iTrack++){
1405 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(iTrack));
1406 if(currTrack->GetID() == trackID){
1407 TrackPos = iTrack;
1408 break;
1409 }
1410 }
1411 if(TrackPos == -1) AliFatal(Form("AliCaloTrackMatcher: GetNMatchedClusterIDsForTrack - track (ID: '%i') cannot be retrieved from event, should be impossible as it has been used in maim task before!",trackID));
1412 }else TrackPos = trackID; // for ESD just take trackID
1413
1414 vector<Int_t> tempMatchedClusters;
1415 multimap<Int_t,Int_t>::iterator it;
1416 AliVTrack* tempTrack = dynamic_cast<AliVTrack*>(event->GetTrack(TrackPos));
1417 if(!tempTrack) return tempMatchedClusters;
1418 for (it=fSecMapTrackToCluster.begin(); it!=fSecMapTrackToCluster.end(); ++it){
1419 if(it->first == TrackPos){
1420 Float_t tempDEta, tempDPhi;
1421 if(GetTrackClusterMatchingResidual(tempTrack->GetID(),it->second,tempDEta,tempDPhi)){
1422 if (TMath::Sqrt(tempDEta*tempDEta + tempDPhi*tempDPhi) < dR ) tempMatchedClusters.push_back(it->second);
1423 }
1424 }
1425 }
1426
1427 return tempMatchedClusters;
1428 }
1429
1430 //________________________________________________________________________
1432 Float_t sumTrackEt = 0.;
1433 vector<Int_t> labelsMatched = GetMatchedTrackIDsForCluster(event, clusterID, dR);
1434 if((Int_t) labelsMatched.size()<1) return sumTrackEt;
1435
1436 TLorentzVector vecTrack;
1437 for (UInt_t i = 0; i < labelsMatched.size(); i++){
1438 AliVTrack* currTrack = dynamic_cast<AliVTrack*>(event->GetTrack(labelsMatched.at(i)));
1439 if(!currTrack) continue;
1440 vecTrack.SetPxPyPzE(currTrack->Px(),currTrack->Py(),currTrack->Pz(),currTrack->E());
1441 sumTrackEt += vecTrack.Et();
1442 }
1443
1444 return sumTrackEt;
1445 }
1446
1447 //________________________________________________________________________
1449 TAxis *axisafter = histoRebin->GetYaxis();
1450 Int_t bins = axisafter->GetNbins();
1451 Double_t from = axisafter->GetXmin();
1452 Double_t to = axisafter->GetXmax();
1453 Double_t *newbins = new Double_t[bins+1];
1454 newbins[0] = from;
1455 Double_t factor = TMath::Power(to/from, 1./bins);
1456 for(Int_t i=1; i<=bins; ++i) newbins[i] = factor * newbins[i-1];
1457 axisafter->Set(bins, newbins);
1458 delete [] newbins;
1459 return;
1460 }
1461
1462 //________________________________________________________________________
1464 if(fSecVectorDeltaEtaDeltaPhi.size()>0){
1465 cout << "******************************" << endl;
1466 cout << "******************************" << endl;
1467 cout << "NEW EVENT !" << endl;
1468 cout << "vector etaphi:" << endl;
1469 cout << fSecVectorDeltaEtaDeltaPhi.size() << endl;
1470 cout << "multimap" << endl;
1471 mapT::iterator iter = fSecMap_TrID_ClID_ToIndex.begin();
1472 for (iter = fSecMap_TrID_ClID_ToIndex.begin(); iter != fSecMap_TrID_ClID_ToIndex.end(); ++iter){
1473 Float_t dEta, dPhi = 0;
1474 if(!GetSecTrackClusterMatchingResidual(iter->first.first,iter->first.second,dEta,dPhi)) continue;
1475 cout << " [" << iter->first.first << "/" << iter->first.second << ", " << iter->second << "] - (" << dEta << "/" << dPhi << ")" << endl;
1476 }
1477 cout << "mapTrackToCluster" << endl;
1478 AliESDEvent *esdev = dynamic_cast<AliESDEvent*>(fInputEvent);
1479 for (Int_t itr=0;itr<esdev->GetNumberOfTracks();itr++){
1480 AliVTrack *inTrack = esdev->GetTrack(itr);
1481 if(!inTrack) continue;
1482 TString tCharge;
1483 if(inTrack->Charge()>0) tCharge = "+";
1484 else if(inTrack->Charge()<0) tCharge = "-";
1485 cout << itr << " (" << tCharge << ") - " << GetNMatchedClusterIDsForSecTrack(fInputEvent,inTrack->GetID(),5,-5,0.2,-0.4) << "\t\t";
1486 }
1487 cout << endl;
1488 multimap<Int_t,Int_t>::iterator it;
1489 for (it=fSecMapTrackToCluster.begin(); it!=fSecMapTrackToCluster.end(); ++it) cout << it->first << " => " << it->second << '\n';
1490 cout << "mapClusterToTrack" << endl;
1491 Int_t tempClus = it->second;
1492 for (it=fSecMapClusterToTrack.begin(); it!=fSecMapClusterToTrack.end(); ++it) cout << it->first << " => " << it->second << '\n';
1493 vector<Int_t> tempTracks = GetMatchedSecTrackIDsForCluster(fInputEvent,tempClus, 5, -5, 0.2, -0.4);
1494 for(UInt_t iJ=0; iJ<tempTracks.size();iJ++){
1495 cout << tempClus << " - " << tempTracks.at(iJ) << endl;
1496 }
1497 }
1498 return;
1499 }
1500
1501 //________________________________________________________________________
1503 if(fVectorDeltaEtaDeltaPhi.size()>0){
1504 cout << "******************************" << endl;
1505 cout << "******************************" << endl;
1506 cout << "NEW EVENT !" << endl;
1507 cout << "vector etaphi:" << endl;
1508 cout << fVectorDeltaEtaDeltaPhi.size() << endl;
1509 cout << "multimap" << endl;
1510 mapT::iterator iter = fMap_TrID_ClID_ToIndex.begin();
1511 for (iter = fMap_TrID_ClID_ToIndex.begin(); iter != fMap_TrID_ClID_ToIndex.end(); ++iter){
1512 Float_t dEta, dPhi = 0;
1513 if(!GetTrackClusterMatchingResidual(iter->first.first,iter->first.second,dEta,dPhi)) continue;
1514 cout << " [" << iter->first.first << "/" << iter->first.second << ", " << iter->second << "] - (" << dEta << "/" << dPhi << ")" << endl;
1515 }
1516 cout << "mapTrackToCluster" << endl;
1517 AliESDEvent *esdev = dynamic_cast<AliESDEvent*>(fInputEvent);
1518 for (Int_t itr=0;itr<esdev->GetNumberOfTracks();itr++){
1519 AliVTrack *inTrack = esdev->GetTrack(itr);
1520 if(!inTrack) continue;
1521 TString tCharge;
1522 if(inTrack->Charge()>0) tCharge = "+";
1523 else if(inTrack->Charge()<0) tCharge = "-";
1524 cout << itr << " (" << tCharge << ") - " << GetNMatchedClusterIDsForTrack(fInputEvent,inTrack->GetID(),5,-5,0.2,-0.4) << "\t\t";
1525 }
1526 cout << endl;
1527 multimap<Int_t,Int_t>::iterator it;
1528 for (it=fMapTrackToCluster.begin(); it!=fMapTrackToCluster.end(); ++it) cout << it->first << " => " << it->second << '\n';
1529 cout << "mapClusterToTrack" << endl;
1530 Int_t tempClus = it->second;
1531 for (it=fMapClusterToTrack.begin(); it!=fMapClusterToTrack.end(); ++it) cout << it->first << " => " << it->second << '\n';
1532 vector<Int_t> tempTracks = GetMatchedTrackIDsForCluster(fInputEvent,tempClus, 5, -5, 0.2, -0.4);
1533 for(UInt_t iJ=0; iJ<tempTracks.size();iJ++){
1534 cout << tempClus << " - " << tempTracks.at(iJ) << endl;
1535 }
1536 }
1537 return;
1538 }
double Double_t
Definition: External.C:58
Definition: External.C:236
Int_t GetNMatchedClusterIDsForSecTrack(AliVEvent *event, Int_t clusterID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin)
void ProcessEvent(AliVEvent *event)
Bool_t GetTrackClusterMatchingResidual(Int_t trackID, Int_t clusterID, Float_t &dEta, Float_t &dPhi)
void Initialize(Int_t runNumber)
vector< Int_t > GetMatchedClusterIDsForSecTrack(AliVEvent *event, Int_t trackID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin)
Int_t GetNMatchedTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin)
int Int_t
Definition: External.C:63
unsigned int UInt_t
Definition: External.C:33
float Float_t
Definition: External.C:68
virtual void Terminate(Option_t *)
Bool_t GetSecTrackClusterMatchingResidual(Int_t trackID, Int_t clusterID, Float_t &dEta, Float_t &dPhi)
Float_t SumTrackEtAroundCluster(AliVEvent *event, Int_t clusterID, Float_t dR)
Int_t GetNMatchedClusterIDsForTrack(AliVEvent *event, Int_t trackID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin)
vector< Int_t > GetMatchedSecTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin)
virtual void UserExec(Option_t *option)
static Bool_t ExtrapolateTrackToCluster(AliExternalTrackParam *trkParam, const AliVCluster *cluster, Double_t mass, Double_t step, Float_t &tmpEta, Float_t &tmpPhi)
Definition: External.C:220
Int_t GetNMatchedSecTrackIDsForCluster(AliVEvent *event, Int_t trackID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin)
Bool_t PropagateV0TrackToClusterAndGetMatchingResidual(AliVTrack *inSecTrack, AliVCluster *cluster, AliVEvent *event, Float_t &dEta, Float_t &dPhi)
pair< Float_t, Float_t > pairFloat
Bool_t IsSecTrackClusterAlreadyTried(Int_t trackID, Int_t clusterID)
const char Option_t
Definition: External.C:48
bool Bool_t
Definition: External.C:53
vector< Int_t > GetMatchedClusterIDsForTrack(AliVEvent *event, Int_t trackID, TF1 *fFuncPtDepEta, TF1 *fFuncPtDepPhi)
vector< Int_t > GetMatchedTrackIDsForCluster(AliVEvent *event, Int_t clusterID, Float_t dEtaMax, Float_t dEtaMin, Float_t dPhiMax, Float_t dPhiMin)
void SetLogBinningYTH2(TH2 *histoRebin)
|
__label__pos
| 0.864649 |
Che differenza c’è tra password e PIN?
Che differenza c'è tra password e PIN Hai sentito parlare di password e/o di PIN ma non sai quale differenza c’è fra i due termini? Eccoti allora spiegato che differenza c’è tra password e PIN.
Indice
Che differenza c’è tra password e PIN?
Che cos’è la password?
In informatica, la password (si pronuncia pàssuord, letteralmente parola d’ordine), detta a volte anche parola d’accesso o chiave d’accesso, non rappresenta altro che una sequenza di caratteri alfanumerici che viene usata o per accedere in modo esclusivo ad una determinata risorsa informatica (come, per esempio, a un computer, a un’email, a una rete, a un programma o a uno sportello automatico), o per crittografare qualcosa, proteggendo ad esempio un file o una cartella.
Una password viene solitamente associata ad uno specifico username in modo tale da poter essere riconosciuti da parte del sistema al quale si vorrebbe accedere. In altri termini, l’username e la password formano assieme le cosiddette credenziali di accesso, ossia una delle forme più comuni di autenticazione nel mondo informatico che viene impiegata, soprattutto, nella procedura di login. Affinché possa svolgere il compito per il quale è stata creata la password dovrebbe rimanere sempre nascosta ed esser scelta con determinate caratteristiche, evitando perciò l’utilizzo di parole di senso compiuto.
Che cos’è il PIN?
Il codice PIN (dall’acronimo inglese di personal identification number, ossia numero di identificazione personale) è una password numerica o alfanumerica formata da almeno quattro caratteri che viene usata nel processo di identificazione di un utente che vuole accedere ad un servizio o ad un sistema. In altre parole, il codice PIN è una sequenza di caratteri numerici o alfanumerici che viene usata per verificare che una persona sia effettivamente autorizzata a compiere una determinata operazione mediante l’utilizzo di un certo dispositivo.
Gli esempi più classici dove si fa uso del codice PIN sono lo sblocco della SIM, il prelievo di denaro contante dagli ATM, il pagamento di beni e/o servizi tramite i terminali POS abilitati, l’accesso ad un dispositivo elettronico (come a un computer, a uno smartphone o a un tablet), ma anche lo sblocco di funzioni amministrative riguardo determinati apparecchi elettronici sia domestici che industriali.
È meglio usare la password o il PIN?
Diciamo che la risposta migliore a questa domanda è: dipende dai casi. In genere i codici PIN sono più facili da ricordare e più veloci da digitare, per cui offrono una protezione già più che sufficiente per sbloccare, ad esempio, uno smartphone o un canale televisivo. Tuttavia le password sono molto più sicure, e perciò vengono utilizzate dove c’è bisogno di una protezione maggiore, quindi specialmente su Internet. Ad ogni modo, sia le password che i codici PIN possono essere scelti o meno da parte dell’utente e, quando previsto, possono anche essere del tipo OTP, ossia usa e getta. Arrivati comunque a questo punto dovresti aver finalmente capito che differenza c’è tra password e PIN.
|
__label__pos
| 0.777721 |
≡ Menu
Repost: Rocket Java: What is Inversion of Control?
From IRC: “What’s Inversion of Control?”
First off: Oh, my.
Here’s a quick summary: traditionally, Java resources acquired whatever resources they need, when they need them. So if your DAO needed a JDBC connection, it would create one, which meant the more DAOs you created, for whatever reason, the more JDBC connections you used. It also meant that the DAO was responsible for its own lifecycle; mess it up, and you had problems.
This isn’t really a bad thing, honestly; lifecycle isn’t impossible to figure out. However, it means that the mechanism by which you acquired resources became really important – and if the mechanism wasn’t readily available, things got a lot more difficult to test.
Imagine a J2EE DAO, for example, where it used JNDI to get the JDBC DataSource. All good, until it’s time to do unit testing, and you don’t want to create a JNDI container just for testing – that’s slow and involves a lot of work that isn’t actually crucial to testing your DAO.
It’d be simpler for the DAO to not get its own resources, but accept the resources it needs. That means it no longer cares about JNDI (or how to get a JDBC connection) but it only says “I need to have a JDBC DataSource in order to work. If you want me to work properly, give me a DataSource.”
That’s inversion of control: instead of the control being in the DAO, the control is in what uses the DAO.
The implications are in many areas.
In production code, it means you want to have an easily repeated mechanism to create resources and provide them. A DAO is a resource; a DataSource is a resource; you want something to build both of them and manage giving the DAO the DataSource without you having to be involved much.
In testing, it means you have fine-grained control over what happens. You usually want to limit the scope of testing, honestly; testing a service that uses a DAO that uses a DataSource (that uses a database, of course) means: starting the database, establishing the connection to the database (the DataSource) and then creating the DAO and providing the Service with that DAO.
That’s lots of work. Too much work, really, and it means a lot of moving parts you don’t want.
With inversion of control, you create a DAO that has very limited functionality, just enough to fulfill the Service’ test. It might always return the same object, for example, no matter what data is requested. That means you’re not testing the DAO any more, nor are you establishing a database connection. This makes the test much lighter, and gives you a lot more control over what happens.
Need to test exception handling? Provide the service with a DAO that always throws an exception at a given point.
Need to test an exception that occurs later in the process? Provide a DAO that throws an exception at that later point (perhaps the fourth time you request data? – Whatever fulfills the need.)
Without Inversion of Control, this is much harder.
Implementations of IoC are pretty well known: Spring, Guice, even Java EE, now. Use them. You’ll be happier – and the Springbots won’t look at you as if you had a third eye any more, either.
Author’s Note: Reposted. This post predated CDI by quite a bit, unfortunately, so it’s badly dated; preserved for posterity.
{ 2 comments… add one }
• Josip October 24, 2015, 9:18 am
Hi JOhn,Thanks for your valueable tuotairls about Java. I am a former programmer who wants to program again to assemble own ideas in code. I have practise the DAO tutorial and try to reproduce what you’ve presented. I build a MySQL database and try to run the code. After some struggle it seems that it almost working, however I get the error: Field id’ doesn’t have a default value . It looks like that there is something happen with assigning the value to Id. After some debugging I am stil confused about how the id fiels is managed? In the database the field is set as INT and Auto Increment and PKey, but where is the initial value assigned? Has the error to do with this issue?Hope you can give me a little help .Thanks again,RegardsRoel
• jottinge October 24, 2015, 9:40 am
I’m not sure which DAO tutorial you’re referring to, honestly – but it sounds like you’re not using ID generation properly.
What is the url of the DAO tutorial about which you’re speaking?
Leave a Reply to jottinge Cancel reply
This site uses Akismet to reduce spam. Learn how your comment data is processed.
%d bloggers like this:
|
__label__pos
| 0.661502 |
|LS| Network Analysis ====================================================================== Calculating the shortest distance between two points is a common GIS task. Tools for this can be found in the :guilabel:`Processing Toolbox`. **The goal for this lesson:** learn to use :guilabel:`Network analysis` algorithms. |basic| |FA| The Tools and the Data ---------------------------------------------------------------------- You can find all the network analysis algorithms in the :menuselection:`Processing --> Network Analysis` menu. You can see that there are many tools available: .. figure:: img/select_network_algorithms.png :align: center :width: 75% Open the project :file:`exercise_data/network_analysis/network.qgz`. It contains two layers: * ``network_points`` * ``network_lines`` The :guilabel:`network_lines` layer has already a style that helps to understand the road network. .. figure:: img/network_map.png :align: center :width: 100% The shortest path tools provide ways to calculate either the shortest or the fastest path between two points of a network, given: * start and end points selected on the map * start point selected on the map and end points taken from a point layer * start points taken from a point layer and end point selected on the map Let's start. |basic| Calculate the shortest path (point to point) ---------------------------------------------------------------------- The :menuselection:`Network analysis --> Shortest path (point to point)` allows you to calculate the shortest distance between two manually selected points on the map. In this example we will calculate the **shortest** (not fastest) path between two points. #. Open the :guilabel:`Shortest path (point to point)` algorithm #. Select :guilabel:`network_lines` for :guilabel:`Vector layer representing network` #. Use ``Shortest`` for :guilabel:`Path type to calculate` Use these two points as starting and ending points for the analysis: .. figure:: img/start_end_point.png :align: center :width: 100% #. Click on the :guilabel:`...` button next to :guilabel:`Start point (x, y)` and choose the location tagged with ``Starting Point`` in the picture. The coordinates of the clicked point are added. #. Do the same thing, but choosing the location tagged with ``Ending point`` for :guilabel:`End point (x, y)` #. Click on the :guilabel:`Run` button: .. figure:: img/shortest_point.png :align: center :width: 100% #. A new line layer is created representing the shortest path between the chosen points. Uncheck the ``network_lines`` layer to see the result better: .. figure:: img/shortest_point_result.png :align: center :width: 100% #. Open the attribute table of the output layer. It contains three fields, representing the coordinates of the start and end points and the **cost**. We chose ``Shortest`` as :guilabel:`Path type to calculate`, so the **cost** represent the **distance**, in layer units, between the two locations. In our case, the *shortest* distance between the chosen points is around ``1000`` meters: .. figure:: img/shortest_point_attributes.png :align: center :width: 100% Now that you know how to use the tool, feel free to test other locations. .. _backlink-network_analysis_1: |moderate| |TY| Fastest path ---------------------------------------------------------------------- With the same data of the previous exercise, try to calculate the fastest path between the two points. How much time do you need to go from the start to the end point? :ref:`Check your results ` |moderate| |FA| Advanced options ---------------------------------------------------------------------- Let us explore some more options of the Network Analysis tools. In the :ref:`previous exercise ` we calculated the **fastest** route between two points. As you can imagine, the time depends on the travel **speed**. We will use the same layers and starting and ending points of the previous exercises. #. Open the :guilabel:`Shortest path (point to point)` algorithm #. Fill the :guilabel:`Input layer`, :guilabel:`Start point (x, y)` and :guilabel:`End point (x, y)` as we did before #. Choose ``Fastest`` as the :guilabel:`Path type to calculate` #. Open the :guilabel:`Advanced parameter` menu #. Change the :guilabel:`Default speed (km/h)` from the default ``50`` value to ``4`` .. figure:: img/shortest_path_advanced.png :align: center :width: 100% #. Click on :guilabel:`Run` #. Once the algorithm is finished, close the dialog and open the attribute table of the output layer. The *cost* field contains the value according to the speed parameter you have chosen. We can convert the *cost* field from hours with fractions to the more readable *minutes* values. #. Open the field calculator by clicking on the |calculateField| icon and add the new field :guilabel:`minutes` by multiplying the :guilabel:`cost` field by 60: .. figure:: img/shortest_path_conversion.png :align: center :width: 100% That's it! Now you know how many minutes it will take to get from one point to the other one. |hard| Shortest path with speed limit ---------------------------------------------------------------------- The Network analysis toolbox has other interesting options. Looking at the following map: .. figure:: img/speed_limit.png :align: center :width: 100% we would like to know the **fastest** route considering the **speed limits** of each road (the labels represent the speed limits in km/h). The shortest path without considering speed limits would of course be the purple path. But in that road the speed limit is 20 km/h, while in the green road you can go at 100 km/h! As we did in the first exercise, we will use the :menuselection:`Network analysis --> Shortest path (point to point)` and we will manually choose the start and end points. #. Open the :menuselection:`Network analysis --> Shortest path (point to point)` algorithm #. Select :guilabel:`network_lines` for the :guilabel:`Vector layer representing network` parameter #. Choose ``Fastest`` as the :guilabel:`Path type to calculate` #. Click on the :guilabel:`...` button next to the :guilabel:`Start point (x, y)` and choose the start point. #. Do the same thing for :guilabel:`End point (x, y)` #. Open the :guilabel:`Advanced parameters` menu #. Choose the *speed* field as the :guilabel:`Speed Field` parameter. With this option the algorithm will take into account the speed limits for each road. .. figure:: img/speed_limit_parameters.png :align: center :width: 100% #. Click on the :guilabel:`Run` button #. Turn off the ``network_lines`` layer to better see the result .. figure:: img/speed_limit_result.png :align: center :width: 100% As you can see the fastest route does not correspond to the shortest one. |moderate| Service area (from layer) ---------------------------------------------------------------------- The :menuselection:`Network Analysis --> Service area (from layer)` algorithm can answer the question: given a point layer, what are all the reachable areas given a distance or a time value? .. note:: The :menuselection:`Network Analysis --> Service area (from point)` is the same algorithm, but it allows you to manually choose the point on the map. Given a distance of ``250`` meters we want to know how far we can go on the network from each point of the :guilabel:`network_points` layer. #. Uncheck all the layers except ``network_points`` #. Open the :menuselection:`Network Analysis --> Service area (from layer)` algorithm #. Choose ``network_lines`` for :guilabel:`Vector layer representing network` #. Choose ``network_points`` for :guilabel:`Vector layer with start points` #. Choose ``Shortest`` in :guilabel:`Path type to calculate` #. Enter ``250`` for the :guilabel:`Travel cost` parameter #. Click on :guilabel:`Run` and close the dialog .. figure:: img/service_area.png :align: center :width: 100% The output layer represents the maximum path you can reach from the point features given a distance of 250 meters: .. figure:: img/service_area_result.png :align: center :width: 100% Cool isn't it? |IC| ---------------------------------------------------------------------- Now you know how to use :guilabel:`Network analysis` algorithm to solve shortest and fastest path problems. We are now ready to perform some spatial statistic on vector layer data. Let's go! |WN| ---------------------------------------------------------------------- Next you'll see how to run spatial statistics algorithms on vector datasets. .. Substitutions definitions - AVOID EDITING PAST THIS LINE This will be automatically updated by the find_set_subst.py script. If you need to create a new substitution manually, please add it also to the substitutions.txt file in the source folder. .. |FA| replace:: Follow Along: .. |IC| replace:: In Conclusion .. |LS| replace:: Lesson: .. |TY| replace:: Try Yourself .. |WN| replace:: What's Next? .. |basic| image:: /static/common/basic.png .. |calculateField| image:: /static/common/mActionCalculateField.png :width: 1.5em .. |hard| image:: /static/common/hard.png .. |moderate| image:: /static/common/moderate.png
|
__label__pos
| 0.995108 |
Source code for airflow.contrib.operators.dataproc_operator
# -*- coding: utf-8 -*-
#
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); you may not use this file except in compliance
# with the License. You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing,
# software distributed under the License is distributed on an
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# KIND, either express or implied. See the License for the
# specific language governing permissions and limitations
# under the License.
#
"""
This module contains Google Dataproc operators.
"""
# pylint: disable=C0302
import ntpath
import os
import re
import time
import uuid
from datetime import timedelta
from airflow.contrib.hooks.gcp_dataproc_hook import DataProcHook
from airflow.contrib.hooks.gcs_hook import GoogleCloudStorageHook
from airflow.exceptions import AirflowException
from airflow.models import BaseOperator
from airflow.utils.decorators import apply_defaults
from airflow.version import version
from airflow.utils import timezone
[docs]class DataprocOperationBaseOperator(BaseOperator): """The base class for operators that poll on a Dataproc Operation.""" @apply_defaults def __init__(self, project_id, region='global', gcp_conn_id='google_cloud_default', delegate_to=None, *args, **kwargs): super(DataprocOperationBaseOperator, self).__init__(*args, **kwargs) self.gcp_conn_id = gcp_conn_id self.delegate_to = delegate_to self.project_id = project_id self.region = region self.hook = DataProcHook( gcp_conn_id=self.gcp_conn_id, delegate_to=self.delegate_to, api_version='v1beta2' )
[docs] def execute(self, context): # pylint: disable=no-value-for-parameter self.hook.wait(self.start())
[docs] def start(self, context): raise AirflowException('Please submit an operation')
# pylint: disable=too-many-instance-attributes
[docs]class DataprocClusterCreateOperator(DataprocOperationBaseOperator): """ Create a new cluster on Google Cloud Dataproc. The operator will wait until the creation is successful or an error occurs in the creation process. The parameters allow to configure the cluster. Please refer to https://cloud.google.com/dataproc/docs/reference/rest/v1/projects.regions.clusters for a detailed explanation on the different parameters. Most of the configuration parameters detailed in the link are available as a parameter to this operator. :param cluster_name: The name of the DataProc cluster to create. (templated) :type cluster_name: str :param project_id: The ID of the google cloud project in which to create the cluster. (templated) :type project_id: str :param num_workers: The # of workers to spin up. If set to zero will spin up cluster in a single node mode :type num_workers: int :param storage_bucket: The storage bucket to use, setting to None lets dataproc generate a custom one for you :type storage_bucket: str :param init_actions_uris: List of GCS uri's containing dataproc initialization scripts :type init_actions_uris: list[str] :param init_action_timeout: Amount of time executable scripts in init_actions_uris has to complete :type init_action_timeout: str :param metadata: dict of key-value google compute engine metadata entries to add to all instances :type metadata: dict :param image_version: the version of software inside the Dataproc cluster :type image_version: str :param custom_image: custom Dataproc image for more info see https://cloud.google.com/dataproc/docs/guides/dataproc-images :type custom_image: str :param custom_image_project_id: project id for the custom Dataproc image, for more info see https://cloud.google.com/dataproc/docs/guides/dataproc-images :type custom_image_project_id: str :param autoscaling_policy: The autoscaling policy used by the cluster. Only resource names including projectid and location (region) are valid. Example: ``projects/[projectId]/locations/[dataproc_region]/autoscalingPolicies/[policy_id]`` :type autoscaling_policy: str :param properties: dict of properties to set on config files (e.g. spark-defaults.conf), see https://cloud.google.com/dataproc/docs/reference/rest/v1/projects.regions.clusters#SoftwareConfig :type properties: dict :param optional_components: List of optional cluster components, for more info see https://cloud.google.com/dataproc/docs/reference/rest/v1/ClusterConfig#Component :type optional_components: list[str] :param num_masters: The # of master nodes to spin up :type num_masters: int :param master_machine_type: Compute engine machine type to use for the master node :type master_machine_type: str :param master_disk_type: Type of the boot disk for the master node (default is ``pd-standard``). Valid values: ``pd-ssd`` (Persistent Disk Solid State Drive) or ``pd-standard`` (Persistent Disk Hard Disk Drive). :type master_disk_type: str :param master_disk_size: Disk size for the master node :type master_disk_size: int :param worker_machine_type: Compute engine machine type to use for the worker nodes :type worker_machine_type: str :param worker_disk_type: Type of the boot disk for the worker node (default is ``pd-standard``). Valid values: ``pd-ssd`` (Persistent Disk Solid State Drive) or ``pd-standard`` (Persistent Disk Hard Disk Drive). :type worker_disk_type: str :param worker_disk_size: Disk size for the worker nodes :type worker_disk_size: int :param num_preemptible_workers: The # of preemptible worker nodes to spin up :type num_preemptible_workers: int :param labels: dict of labels to add to the cluster :type labels: dict :param zone: The zone where the cluster will be located. Set to None to auto-zone. (templated) :type zone: str :param network_uri: The network uri to be used for machine communication, cannot be specified with subnetwork_uri :type network_uri: str :param subnetwork_uri: The subnetwork uri to be used for machine communication, cannot be specified with network_uri :type subnetwork_uri: str :param internal_ip_only: If true, all instances in the cluster will only have internal IP addresses. This can only be enabled for subnetwork enabled networks :type internal_ip_only: bool :param tags: The GCE tags to add to all instances :type tags: list[str] :param region: leave as 'global', might become relevant in the future. (templated) :type region: str :param gcp_conn_id: The connection ID to use connecting to Google Cloud Platform. :type gcp_conn_id: str :param delegate_to: The account to impersonate, if any. For this to work, the service account making the request must have domain-wide delegation enabled. :type delegate_to: str :param service_account: The service account of the dataproc instances. :type service_account: str :param service_account_scopes: The URIs of service account scopes to be included. :type service_account_scopes: list[str] :param idle_delete_ttl: The longest duration that cluster would keep alive while staying idle. Passing this threshold will cause cluster to be auto-deleted. A duration in seconds. :type idle_delete_ttl: int :param auto_delete_time: The time when cluster will be auto-deleted. :type auto_delete_time: datetime.datetime :param auto_delete_ttl: The life duration of cluster, the cluster will be auto-deleted at the end of this duration. A duration in seconds. (If auto_delete_time is set this parameter will be ignored) :type auto_delete_ttl: int :param customer_managed_key: The customer-managed key used for disk encryption ``projects/[PROJECT_STORING_KEYS]/locations/[LOCATION]/keyRings/[KEY_RING_NAME]/cryptoKeys/[KEY_NAME]`` # noqa # pylint: disable=line-too-long :type customer_managed_key: str """
[docs] template_fields = ['cluster_name', 'project_id', 'zone', 'region']
# pylint: disable=too-many-arguments,too-many-locals @apply_defaults def __init__(self, project_id, cluster_name, num_workers, zone=None, network_uri=None, subnetwork_uri=None, internal_ip_only=None, tags=None, storage_bucket=None, init_actions_uris=None, init_action_timeout="10m", metadata=None, custom_image=None, custom_image_project_id=None, image_version=None, autoscaling_policy=None, properties=None, optional_components=None, num_masters=1, master_machine_type='n1-standard-4', master_disk_type='pd-standard', master_disk_size=500, worker_machine_type='n1-standard-4', worker_disk_type='pd-standard', worker_disk_size=500, num_preemptible_workers=0, labels=None, region='global', service_account=None, service_account_scopes=None, idle_delete_ttl=None, auto_delete_time=None, auto_delete_ttl=None, customer_managed_key=None, *args, **kwargs): super(DataprocClusterCreateOperator, self).__init__( project_id=project_id, region=region, *args, **kwargs) self.cluster_name = cluster_name self.num_masters = num_masters self.num_workers = num_workers self.num_preemptible_workers = num_preemptible_workers self.storage_bucket = storage_bucket self.init_actions_uris = init_actions_uris self.init_action_timeout = init_action_timeout self.metadata = metadata self.custom_image = custom_image self.custom_image_project_id = custom_image_project_id self.image_version = image_version self.properties = properties or dict() self.optional_components = optional_components self.master_machine_type = master_machine_type self.master_disk_type = master_disk_type self.master_disk_size = master_disk_size self.autoscaling_policy = autoscaling_policy self.worker_machine_type = worker_machine_type self.worker_disk_type = worker_disk_type self.worker_disk_size = worker_disk_size self.labels = labels self.zone = zone self.network_uri = network_uri self.subnetwork_uri = subnetwork_uri self.internal_ip_only = internal_ip_only self.tags = tags self.service_account = service_account self.service_account_scopes = service_account_scopes self.idle_delete_ttl = idle_delete_ttl self.auto_delete_time = auto_delete_time self.auto_delete_ttl = auto_delete_ttl self.customer_managed_key = customer_managed_key self.single_node = num_workers == 0 assert not (self.custom_image and self.image_version), \ "custom_image and image_version can't be both set" assert ( not self.single_node or ( self.single_node and self.num_preemptible_workers == 0 ) ), "num_workers == 0 means single node mode - no preemptibles allowed"
[docs] def _get_init_action_timeout(self): match = re.match(r"^(\d+)(s|m)$", self.init_action_timeout) if match: if match.group(2) == "s": return self.init_action_timeout elif match.group(2) == "m": val = float(match.group(1)) return "{}s".format(int(timedelta(minutes=val).total_seconds())) raise AirflowException( "DataprocClusterCreateOperator init_action_timeout"
" should be expressed in minutes or seconds. i.e. 10m, 30s")
[docs] def _build_gce_cluster_config(self, cluster_data): if self.zone: zone_uri = \ 'https://www.googleapis.com/compute/v1/projects/{}/zones/{}'.format( self.project_id, self.zone ) cluster_data['config']['gceClusterConfig']['zoneUri'] = zone_uri if self.metadata: cluster_data['config']['gceClusterConfig']['metadata'] = self.metadata if self.network_uri: cluster_data['config']['gceClusterConfig']['networkUri'] = self.network_uri if self.subnetwork_uri: cluster_data['config']['gceClusterConfig']['subnetworkUri'] = \ self.subnetwork_uri if self.internal_ip_only: if not self.subnetwork_uri: raise AirflowException("Set internal_ip_only to true only when" " you pass a subnetwork_uri.") cluster_data['config']['gceClusterConfig']['internalIpOnly'] = True if self.tags: cluster_data['config']['gceClusterConfig']['tags'] = self.tags if self.service_account: cluster_data['config']['gceClusterConfig']['serviceAccount'] = \ self.service_account if self.service_account_scopes: cluster_data['config']['gceClusterConfig']['serviceAccountScopes'] = \ self.service_account_scopes return cluster_data
[docs] def _build_lifecycle_config(self, cluster_data): if self.idle_delete_ttl: cluster_data['config']['lifecycleConfig']['idleDeleteTtl'] = \ "{}s".format(self.idle_delete_ttl) if self.auto_delete_time: utc_auto_delete_time = timezone.convert_to_utc(self.auto_delete_time) cluster_data['config']['lifecycleConfig']['autoDeleteTime'] = \ utc_auto_delete_time.format('%Y-%m-%dT%H:%M:%S.%fZ', formatter='classic') elif self.auto_delete_ttl: cluster_data['config']['lifecycleConfig']['autoDeleteTtl'] = \ "{}s".format(self.auto_delete_ttl) return cluster_data
[docs] def _build_cluster_data(self): if self.zone: master_type_uri = \ "https://www.googleapis.com/compute/v1/projects/{}/zones/{}/machineTypes/{}"\ .format(self.project_id, self.zone, self.master_machine_type) worker_type_uri = \ "https://www.googleapis.com/compute/v1/projects/{}/zones/{}/machineTypes/{}"\ .format(self.project_id, self.zone, self.worker_machine_type) else: master_type_uri = self.master_machine_type worker_type_uri = self.worker_machine_type cluster_data = { 'projectId': self.project_id, 'clusterName': self.cluster_name, 'config': { 'gceClusterConfig': { }, 'masterConfig': { 'numInstances': self.num_masters, 'machineTypeUri': master_type_uri, 'diskConfig': { 'bootDiskType': self.master_disk_type, 'bootDiskSizeGb': self.master_disk_size } }, 'workerConfig': { 'numInstances': self.num_workers, 'machineTypeUri': worker_type_uri, 'diskConfig': { 'bootDiskType': self.worker_disk_type, 'bootDiskSizeGb': self.worker_disk_size } }, 'secondaryWorkerConfig': {}, 'softwareConfig': {}, 'lifecycleConfig': {}, 'encryptionConfig': {}, 'autoscalingConfig': {}, } } if self.num_preemptible_workers > 0: cluster_data['config']['secondaryWorkerConfig'] = { 'numInstances': self.num_preemptible_workers, 'machineTypeUri': worker_type_uri, 'diskConfig': { 'bootDiskType': self.worker_disk_type, 'bootDiskSizeGb': self.worker_disk_size }, 'isPreemptible': True } cluster_data['labels'] = self.labels or {} # Dataproc labels must conform to the following regex: # [a-z]([-a-z0-9]*[a-z0-9])? (current airflow version string follows # semantic versioning spec: x.y.z). cluster_data['labels'].update({'airflow-version': 'v' + version.replace('.', '-').replace('+', '-')}) if self.storage_bucket: cluster_data['config']['configBucket'] = self.storage_bucket if self.image_version: cluster_data['config']['softwareConfig']['imageVersion'] = self.image_version elif self.custom_image: project_id = self.custom_image_project_id if (self.custom_image_project_id) else self.project_id custom_image_url = 'https://www.googleapis.com/compute/beta/projects/' \ '{}/global/images/{}'.format(project_id, self.custom_image) cluster_data['config']['masterConfig']['imageUri'] = custom_image_url if not self.single_node: cluster_data['config']['workerConfig']['imageUri'] = custom_image_url cluster_data = self._build_gce_cluster_config(cluster_data) if self.single_node: self.properties["dataproc:dataproc.allow.zero.workers"] = "true" if self.properties: cluster_data['config']['softwareConfig']['properties'] = self.properties if self.optional_components: cluster_data['config']['softwareConfig']['optionalComponents'] = self.optional_components cluster_data = self._build_lifecycle_config(cluster_data) if self.init_actions_uris: init_actions_dict = [ { 'executableFile': uri, 'executionTimeout': self._get_init_action_timeout() } for uri in self.init_actions_uris ] cluster_data['config']['initializationActions'] = init_actions_dict if self.customer_managed_key: cluster_data['config']['encryptionConfig'] =\ {'gcePdKmsKeyName': self.customer_managed_key} if self.autoscaling_policy: cluster_data['config']['autoscalingConfig'] = {'policyUri': self.autoscaling_policy} return cluster_data
[docs] def start(self): """ Create a new cluster on Google Cloud Dataproc. """ self.log.info('Creating cluster: %s', self.cluster_name) cluster_data = self._build_cluster_data() return ( self.hook.get_conn().projects().regions().clusters().create( # pylint: disable=no-member projectId=self.project_id, region=self.region, body=cluster_data, requestId=str(uuid.uuid4()),
).execute())
[docs]class DataprocClusterScaleOperator(DataprocOperationBaseOperator): """ Scale, up or down, a cluster on Google Cloud Dataproc. The operator will wait until the cluster is re-scaled. **Example**: :: t1 = DataprocClusterScaleOperator( task_id='dataproc_scale', project_id='my-project', cluster_name='cluster-1', num_workers=10, num_preemptible_workers=10, graceful_decommission_timeout='1h', dag=dag) .. seealso:: For more detail on about scaling clusters have a look at the reference: https://cloud.google.com/dataproc/docs/concepts/configuring-clusters/scaling-clusters :param cluster_name: The name of the cluster to scale. (templated) :type cluster_name: str :param project_id: The ID of the google cloud project in which the cluster runs. (templated) :type project_id: str :param region: The region for the dataproc cluster. (templated) :type region: str :param gcp_conn_id: The connection ID to use connecting to Google Cloud Platform. :type gcp_conn_id: str :param num_workers: The new number of workers :type num_workers: int :param num_preemptible_workers: The new number of preemptible workers :type num_preemptible_workers: int :param graceful_decommission_timeout: Timeout for graceful YARN decomissioning. Maximum value is 1d :type graceful_decommission_timeout: str :param delegate_to: The account to impersonate, if any. For this to work, the service account making the request must have domain-wide delegation enabled. :type delegate_to: str """
[docs] template_fields = ['cluster_name', 'project_id', 'region']
@apply_defaults def __init__(self, cluster_name, project_id, region='global', num_workers=2, num_preemptible_workers=0, graceful_decommission_timeout=None, *args, **kwargs): super(DataprocClusterScaleOperator, self).__init__( project_id=project_id, region=region, *args, **kwargs) self.cluster_name = cluster_name self.num_workers = num_workers self.num_preemptible_workers = num_preemptible_workers # Optional self.optional_arguments = {} if graceful_decommission_timeout: self.optional_arguments['gracefulDecommissionTimeout'] = \ self._get_graceful_decommission_timeout( graceful_decommission_timeout)
[docs] def _build_scale_cluster_data(self): scale_data = { 'config': { 'workerConfig': { 'numInstances': self.num_workers }, 'secondaryWorkerConfig': { 'numInstances': self.num_preemptible_workers } } } return scale_data
@staticmethod
[docs] def _get_graceful_decommission_timeout(timeout): match = re.match(r"^(\d+)(s|m|h|d)$", timeout) if match: if match.group(2) == "s": return timeout elif match.group(2) == "m": val = float(match.group(1)) return "{}s".format(int(timedelta(minutes=val).total_seconds())) elif match.group(2) == "h": val = float(match.group(1)) return "{}s".format(int(timedelta(hours=val).total_seconds())) elif match.group(2) == "d": val = float(match.group(1)) return "{}s".format(int(timedelta(days=val).total_seconds())) raise AirflowException( "DataprocClusterScaleOperator "
" should be expressed in day, hours, minutes or seconds. " " i.e. 1d, 4h, 10m, 30s")
[docs] def start(self): """ Scale, up or down, a cluster on Google Cloud Dataproc. """ self.log.info("Scaling cluster: %s", self.cluster_name) update_mask = "config.worker_config.num_instances," \ + "config.secondary_worker_config.num_instances" scaling_cluster_data = self._build_scale_cluster_data() return ( self.hook.get_conn().projects().regions().clusters().patch( # pylint: disable=no-member projectId=self.project_id, region=self.region, clusterName=self.cluster_name, updateMask=update_mask, body=scaling_cluster_data, requestId=str(uuid.uuid4()), **self.optional_arguments
).execute())
[docs]class DataprocClusterDeleteOperator(DataprocOperationBaseOperator): """ Delete a cluster on Google Cloud Dataproc. The operator will wait until the cluster is destroyed. :param cluster_name: The name of the cluster to delete. (templated) :type cluster_name: str :param project_id: The ID of the google cloud project in which the cluster runs. (templated) :type project_id: str :param region: leave as 'global', might become relevant in the future. (templated) :type region: str :param gcp_conn_id: The connection ID to use connecting to Google Cloud Platform. :type gcp_conn_id: str :param delegate_to: The account to impersonate, if any. For this to work, the service account making the request must have domain-wide delegation enabled. :type delegate_to: str """
[docs] template_fields = ['cluster_name', 'project_id', 'region']
@apply_defaults def __init__(self, cluster_name, project_id, region='global', *args, **kwargs): super(DataprocClusterDeleteOperator, self).__init__( project_id=project_id, region=region, *args, **kwargs) self.cluster_name = cluster_name
[docs] def start(self): """ Delete a cluster on Google Cloud Dataproc. """ self.log.info('Deleting cluster: %s in %s', self.cluster_name, self.region) return ( self.hook.get_conn().projects().regions().clusters().delete( # pylint: disable=no-member projectId=self.project_id, region=self.region, clusterName=self.cluster_name, requestId=str(uuid.uuid4()),
).execute())
[docs]class DataProcJobBaseOperator(BaseOperator): """ The base class for operators that launch job on DataProc. :param job_name: The job name used in the DataProc cluster. This name by default is the task_id appended with the execution data, but can be templated. The name will always be appended with a random number to avoid name clashes. :type job_name: str :param cluster_name: The name of the DataProc cluster. :type cluster_name: str :param dataproc_properties: Map for the Hive properties. Ideal to put in default arguments (templated) :type dataproc_properties: dict :param dataproc_jars: HCFS URIs of jar files to add to the CLASSPATH of the Hive server and Hadoop MapReduce (MR) tasks. Can contain Hive SerDes and UDFs. (templated) :type dataproc_jars: list :param gcp_conn_id: The connection ID to use connecting to Google Cloud Platform. :type gcp_conn_id: str :param delegate_to: The account to impersonate, if any. For this to work, the service account making the request must have domain-wide delegation enabled. :type delegate_to: str :param labels: The labels to associate with this job. Label keys must contain 1 to 63 characters, and must conform to RFC 1035. Label values may be empty, but, if present, must contain 1 to 63 characters, and must conform to RFC 1035. No more than 32 labels can be associated with a job. :type labels: dict :param region: The specified region where the dataproc cluster is created. :type region: str :param job_error_states: Job states that should be considered error states. Any states in this set will result in an error being raised and failure of the task. Eg, if the ``CANCELLED`` state should also be considered a task failure, pass in ``{'ERROR', 'CANCELLED'}``. Possible values are currently only ``'ERROR'`` and ``'CANCELLED'``, but could change in the future. Defaults to ``{'ERROR'}``. :type job_error_states: set :var dataproc_job_id: The actual "jobId" as submitted to the Dataproc API. This is useful for identifying or linking to the job in the Google Cloud Console Dataproc UI, as the actual "jobId" submitted to the Dataproc API is appended with an 8 character random string. :vartype dataproc_job_id: str """
[docs] job_type = ""
@apply_defaults def __init__(self, job_name='{{task.task_id}}_{{ds_nodash}}', cluster_name="cluster-1", dataproc_properties=None, dataproc_jars=None, gcp_conn_id='google_cloud_default', delegate_to=None, labels=None, region='global', job_error_states=None, *args, **kwargs): super(DataProcJobBaseOperator, self).__init__(*args, **kwargs) self.gcp_conn_id = gcp_conn_id self.delegate_to = delegate_to self.labels = labels self.job_name = job_name self.cluster_name = cluster_name self.dataproc_properties = dataproc_properties self.dataproc_jars = dataproc_jars self.region = region self.job_error_states = job_error_states if job_error_states is not None else {'ERROR'} self.hook = DataProcHook(gcp_conn_id=gcp_conn_id, delegate_to=delegate_to) self.job_template = None self.job = None self.dataproc_job_id = None
[docs] def create_job_template(self): """ Initialize `self.job_template` with default values """ self.job_template = self.hook.create_job_template(self.task_id, self.cluster_name, self.job_type, self.dataproc_properties) self.job_template.set_job_name(self.job_name) self.job_template.add_jar_file_uris(self.dataproc_jars) self.job_template.add_labels(self.labels)
[docs] def execute(self, context): """ Build `self.job` based on the job template, and submit it. :raises AirflowException if no template has been initialized (see create_job_template) """ if self.job_template: self.job = self.job_template.build() self.dataproc_job_id = self.job["job"]["reference"]["jobId"] self.hook.submit(self.hook.project_id, self.job, self.region, self.job_error_states) else: raise AirflowException("Create a job template before")
[docs] def on_kill(self): """ Callback called when the operator is killed. Cancel any running job. """ if self.dataproc_job_id: self.hook.cancel(self.hook.project_id, self.dataproc_job_id, self.region)
[docs]class DataProcPigOperator(DataProcJobBaseOperator): """ Start a Pig query Job on a Cloud DataProc cluster. The parameters of the operation will be passed to the cluster. It's a good practice to define dataproc_* parameters in the default_args of the dag like the cluster name and UDFs. .. code-block:: python default_args = { 'cluster_name': 'cluster-1', 'dataproc_pig_jars': [ 'gs://example/udf/jar/datafu/1.2.0/datafu.jar', 'gs://example/udf/jar/gpig/1.2/gpig.jar' ] } You can pass a pig script as string or file reference. Use variables to pass on variables for the pig script to be resolved on the cluster or use the parameters to be resolved in the script as template parameters. **Example**: :: t1 = DataProcPigOperator( task_id='dataproc_pig', query='a_pig_script.pig', variables={'out': 'gs://example/output/{{ds}}'}, dag=dag) .. seealso:: For more detail on about job submission have a look at the reference: https://cloud.google.com/dataproc/reference/rest/v1/projects.regions.jobs :param query: The query or reference to the query file (pg or pig extension). (templated) :type query: str :param query_uri: The HCFS URI of the script that contains the Pig queries. :type query_uri: str :param variables: Map of named parameters for the query. (templated) :type variables: dict :param dataproc_pig_properties: Map for the Pig properties. Ideal to put in default arguments (templated) :type dataproc_pig_properties: dict :param dataproc_pig_jars: HCFS URIs of jar files to add to the CLASSPATH of the Pig Client and Hadoop MapReduce (MR) tasks. Can contain Pig UDFs. (templated) :type dataproc_pig_jars: list """
[docs] template_fields = ['query', 'variables', 'job_name', 'cluster_name', 'region', 'dataproc_jars', 'dataproc_properties']
[docs] template_ext = ('.pg', '.pig',)
[docs] ui_color = '#0273d4'
[docs] job_type = 'pigJob'
@apply_defaults def __init__( self, query=None, query_uri=None, variables=None, dataproc_pig_properties=None, dataproc_pig_jars=None, *args, **kwargs): super(DataProcPigOperator, self).__init__(*args, dataproc_properties=dataproc_pig_properties, dataproc_jars=dataproc_pig_jars, **kwargs) self.query = query self.query_uri = query_uri self.variables = variables
[docs] def execute(self, context): self.create_job_template() if self.query is None: self.job_template.add_query_uri(self.query_uri) else: self.job_template.add_query(self.query) self.job_template.add_variables(self.variables) super(DataProcPigOperator, self).execute(context)
[docs]class DataProcHiveOperator(DataProcJobBaseOperator): """ Start a Hive query Job on a Cloud DataProc cluster. :param query: The query or reference to the query file (q extension). :type query: str :param query_uri: The HCFS URI of the script that contains the Hive queries. :type query_uri: str :param variables: Map of named parameters for the query. :type variables: dict :param dataproc_hive_properties: Map for the Pig properties. Ideal to put in default arguments (templated) :type dataproc_hive_properties: dict :param dataproc_hive_jars: HCFS URIs of jar files to add to the CLASSPATH of the Hive server and Hadoop MapReduce (MR) tasks. Can contain Hive SerDes and UDFs. (templated) :type dataproc_hive_jars: list """
[docs] template_fields = ['query', 'variables', 'job_name', 'cluster_name', 'region', 'dataproc_jars', 'dataproc_properties']
[docs] template_ext = ('.q', '.hql',)
[docs] ui_color = '#0273d4'
[docs] job_type = 'hiveJob'
@apply_defaults def __init__( self, query=None, query_uri=None, variables=None, dataproc_hive_properties=None, dataproc_hive_jars=None, *args, **kwargs): super(DataProcHiveOperator, self).__init__(*args, dataproc_properties=dataproc_hive_properties, dataproc_jars=dataproc_hive_jars, **kwargs) self.query = query self.query_uri = query_uri self.variables = variables if self.query is not None and self.query_uri is not None: raise AirflowException('Only one of `query` and `query_uri` can be passed.')
[docs] def execute(self, context): self.create_job_template() if self.query is None: self.job_template.add_query_uri(self.query_uri) else: self.job_template.add_query(self.query) self.job_template.add_variables(self.variables) super(DataProcHiveOperator, self).execute(context)
[docs]class DataProcSparkSqlOperator(DataProcJobBaseOperator): """ Start a Spark SQL query Job on a Cloud DataProc cluster. :param query: The query or reference to the query file (q extension). (templated) :type query: str :param query_uri: The HCFS URI of the script that contains the SQL queries. :type query_uri: str :param variables: Map of named parameters for the query. (templated) :type variables: dict :param dataproc_spark_properties: Map for the Pig properties. Ideal to put in default arguments (templated) :type dataproc_spark_properties: dict :param dataproc_spark_jars: HCFS URIs of jar files to be added to the Spark CLASSPATH. (templated) :type dataproc_spark_jars: list """
[docs] template_fields = ['query', 'variables', 'job_name', 'cluster_name', 'region', 'dataproc_jars', 'dataproc_properties']
[docs] template_ext = ('.q',)
[docs] ui_color = '#0273d4'
[docs] job_type = 'sparkSqlJob'
@apply_defaults def __init__( self, query=None, query_uri=None, variables=None, dataproc_spark_properties=None, dataproc_spark_jars=None, *args, **kwargs): super(DataProcSparkSqlOperator, self).__init__(*args, dataproc_properties=dataproc_spark_properties, dataproc_jars=dataproc_spark_jars, **kwargs) self.query = query self.query_uri = query_uri self.variables = variables if self.query is not None and self.query_uri is not None: raise AirflowException('Only one of `query` and `query_uri` can be passed.')
[docs] def execute(self, context): self.create_job_template() if self.query is None: self.job_template.add_query_uri(self.query_uri) else: self.job_template.add_query(self.query) self.job_template.add_variables(self.variables) super(DataProcSparkSqlOperator, self).execute(context)
[docs]class DataProcSparkOperator(DataProcJobBaseOperator): """ Start a Spark Job on a Cloud DataProc cluster. :param main_jar: The HCFS URI of the jar file that contains the main class (use this or the main_class, not both together). :type main_jar: str :param main_class: Name of the job class. (use this or the main_jar, not both together). :type main_class: str :param arguments: Arguments for the job. (templated) :type arguments: list :param archives: List of archived files that will be unpacked in the work directory. Should be stored in Cloud Storage. :type archives: list :param files: List of files to be copied to the working directory :type files: list :param dataproc_spark_properties: Map for the Pig properties. Ideal to put in default arguments (templated) :type dataproc_spark_properties: dict :param dataproc_spark_jars: HCFS URIs of files to be copied to the working directory of Spark drivers and distributed tasks. Useful for naively parallel tasks. (templated) :type dataproc_spark_jars: list """
[docs] template_fields = ['arguments', 'job_name', 'cluster_name', 'region', 'dataproc_jars', 'dataproc_properties']
[docs] ui_color = '#0273d4'
[docs] job_type = 'sparkJob'
@apply_defaults def __init__( self, main_jar=None, main_class=None, arguments=None, archives=None, files=None, dataproc_spark_properties=None, dataproc_spark_jars=None, *args, **kwargs): super(DataProcSparkOperator, self).__init__(*args, dataproc_properties=dataproc_spark_properties, dataproc_jars=dataproc_spark_jars, **kwargs) self.main_jar = main_jar self.main_class = main_class self.arguments = arguments self.archives = archives self.files = files
[docs] def execute(self, context): self.create_job_template() self.job_template.set_main(self.main_jar, self.main_class) self.job_template.add_args(self.arguments) self.job_template.add_archive_uris(self.archives) self.job_template.add_file_uris(self.files) super(DataProcSparkOperator, self).execute(context)
[docs]class DataProcHadoopOperator(DataProcJobBaseOperator): """ Start a Hadoop Job on a Cloud DataProc cluster. :param main_jar: The HCFS URI of the jar file containing the main class (use this or the main_class, not both together). :type main_jar: str :param main_class: Name of the job class. (use this or the main_jar, not both together). :type main_class: str :param arguments: Arguments for the job. (templated) :type arguments: list :param archives: List of archived files that will be unpacked in the work directory. Should be stored in Cloud Storage. :type archives: list :param files: List of files to be copied to the working directory :type files: list :param dataproc_hadoop_properties: Map for the Pig properties. Ideal to put in default arguments (tempplated) :type dataproc_hadoop_properties: dict :param dataproc_hadoop_jars: Jar file URIs to add to the CLASSPATHs of the Hadoop driver and tasks. (templated) :type dataproc_hadoop_jars: list """
[docs] template_fields = ['arguments', 'job_name', 'cluster_name', 'region', 'dataproc_jars', 'dataproc_properties']
[docs] ui_color = '#0273d4'
[docs] job_type = 'hadoopJob'
@apply_defaults def __init__( self, main_jar=None, main_class=None, arguments=None, archives=None, files=None, dataproc_hadoop_properties=None, dataproc_hadoop_jars=None, *args, **kwargs): super(DataProcHadoopOperator, self).__init__(*args, dataproc_properties=dataproc_hadoop_properties, dataproc_jars=dataproc_hadoop_jars, **kwargs) self.main_jar = main_jar self.main_class = main_class self.arguments = arguments self.archives = archives self.files = files
[docs] def execute(self, context): self.create_job_template() self.job_template.set_main(self.main_jar, self.main_class) self.job_template.add_args(self.arguments) self.job_template.add_archive_uris(self.archives) self.job_template.add_file_uris(self.files) super(DataProcHadoopOperator, self).execute(context)
[docs]class DataProcPySparkOperator(DataProcJobBaseOperator): """ Start a PySpark Job on a Cloud DataProc cluster. :param main: [Required] The Hadoop Compatible Filesystem (HCFS) URI of the main Python file to use as the driver. Must be a .py file. (templated) :type main: str :param arguments: Arguments for the job. (templated) :type arguments: list :param archives: List of archived files that will be unpacked in the work directory. Should be stored in Cloud Storage. :type archives: list :param files: List of files to be copied to the working directory :type files: list :param pyfiles: List of Python files to pass to the PySpark framework. Supported file types: .py, .egg, and .zip :type pyfiles: list :param dataproc_pyspark_properties: Map for the Pig properties. Ideal to put in default arguments (templated) :type dataproc_pyspark_properties: dict :param dataproc_pyspark_jars: HCFS URIs of jar files to add to the CLASSPATHs of the Python driver and tasks. (templated) :type dataproc_pyspark_jars: list """
[docs] template_fields = ['main', 'arguments', 'job_name', 'cluster_name', 'region', 'dataproc_jars', 'dataproc_properties']
[docs] ui_color = '#0273d4'
[docs] job_type = 'pysparkJob'
@staticmethod
[docs] def _generate_temp_filename(filename): date = time.strftime('%Y%m%d%H%M%S') return "{}_{}_{}".format(date, str(uuid.uuid4())[:8], ntpath.basename(filename))
[docs] def _upload_file_temp(self, bucket, local_file): """ Upload a local file to a Google Cloud Storage bucket. """ temp_filename = self._generate_temp_filename(local_file) if not bucket: raise AirflowException( "If you want Airflow to upload the local file to a temporary bucket, set " "the 'temp_bucket' key in the connection string") self.log.info("Uploading %s to %s", local_file, temp_filename) GoogleCloudStorageHook( google_cloud_storage_conn_id=self.gcp_conn_id ).upload( bucket_name=bucket, object_name=temp_filename, mime_type='application/x-python', filename=local_file ) return "gs://{}/{}".format(bucket, temp_filename)
@apply_defaults def __init__( self, main, arguments=None, archives=None, pyfiles=None, files=None, dataproc_pyspark_properties=None, dataproc_pyspark_jars=None, *args, **kwargs): super(DataProcPySparkOperator, self).__init__(*args, dataproc_properties=dataproc_pyspark_properties, dataproc_jars=dataproc_pyspark_jars, **kwargs) self.main = main self.arguments = arguments self.archives = archives self.files = files self.pyfiles = pyfiles
[docs] def execute(self, context): self.create_job_template() # Check if the file is local, if that is the case, upload it to a bucket if os.path.isfile(self.main): cluster_info = self.hook.get_cluster( project_id=self.hook.project_id, region=self.region, cluster_name=self.cluster_name ) bucket = cluster_info['config']['configBucket'] self.main = self._upload_file_temp(bucket, self.main) self.job_template.set_python_main(self.main) self.job_template.add_args(self.arguments) self.job_template.add_archive_uris(self.archives) self.job_template.add_file_uris(self.files) self.job_template.add_python_file_uris(self.pyfiles) super(DataProcPySparkOperator, self).execute(context)
[docs]class DataprocWorkflowTemplateInstantiateOperator(DataprocOperationBaseOperator): """ Instantiate a WorkflowTemplate on Google Cloud Dataproc. The operator will wait until the WorkflowTemplate is finished executing. .. seealso:: Please refer to: https://cloud.google.com/dataproc/docs/reference/rest/v1beta2/projects.regions.workflowTemplates/instantiate :param template_id: The id of the template. (templated) :type template_id: str :param project_id: The ID of the google cloud project in which the template runs :type project_id: str :param region: leave as 'global', might become relevant in the future :type region: str :param gcp_conn_id: The connection ID to use connecting to Google Cloud Platform. :type gcp_conn_id: str :param delegate_to: The account to impersonate, if any. For this to work, the service account making the request must have domain-wide delegation enabled. :type delegate_to: str """
[docs] template_fields = ['template_id']
@apply_defaults def __init__(self, template_id, *args, **kwargs): (super(DataprocWorkflowTemplateInstantiateOperator, self) .__init__(*args, **kwargs)) self.template_id = template_id
[docs] def start(self): """ Instantiate a WorkflowTemplate on Google Cloud Dataproc. """ self.log.info('Instantiating Template: %s', self.template_id) return ( self.hook.get_conn().projects().regions().workflowTemplates() # pylint: disable=no-member .instantiate( name=('projects/%s/regions/%s/workflowTemplates/%s' % (self.project_id, self.region, self.template_id)), body={'requestId': str(uuid.uuid4())})
.execute())
[docs]class DataprocWorkflowTemplateInstantiateInlineOperator( DataprocOperationBaseOperator): """ Instantiate a WorkflowTemplate Inline on Google Cloud Dataproc. The operator will wait until the WorkflowTemplate is finished executing. .. seealso:: Please refer to: https://cloud.google.com/dataproc/docs/reference/rest/v1beta2/projects.regions.workflowTemplates/instantiateInline :param template: The template contents. (templated) :type template: map :param project_id: The ID of the google cloud project in which the template runs :type project_id: str :param region: leave as 'global', might become relevant in the future :type region: str :param gcp_conn_id: The connection ID to use connecting to Google Cloud Platform. :type gcp_conn_id: str :param delegate_to: The account to impersonate, if any. For this to work, the service account making the request must have domain-wide delegation enabled. :type delegate_to: str """
[docs] template_fields = ['template']
@apply_defaults def __init__(self, template, *args, **kwargs): (super(DataprocWorkflowTemplateInstantiateInlineOperator, self) .__init__(*args, **kwargs)) self.template = template
[docs] def start(self): """ Instantiate a WorkflowTemplate Inline on Google Cloud Dataproc. """ self.log.info('Instantiating Inline Template') return ( self.hook.get_conn().projects().regions().workflowTemplates() # pylint: disable=no-member .instantiateInline( parent='projects/%s/regions/%s' % (self.project_id, self.region), requestId=str(uuid.uuid4()), body=self.template)
.execute())
Was this entry helpful?
|
__label__pos
| 0.985277 |
12
I am trying to update some fields based on their occurence. If they only occur one time, I am updating some status field.
My current code is as follows:
UPDATE table1
SET statusField = 1
WHERE someID = (
SELECT someID
FROM table1
GROUP BY someID HAVING COUNT(*) = 1
)
This returns an error like the one in the title: Subquery returned more than 1 value. This is not permitted when the subquery follows =, !=, <, <= , >, >= or when the subquery is used as an expression.
Is there any other, as easily readable/simple, solution to this?
20
Use IN keyword instead of equals operator like so:
UPDATE table1
SET statusField = 1
WHERE someID IN (
SELECT someID
FROM table1
GROUP BY someID HAVING COUNT(*) = 1
)
Using = requires that exactly 1 result is returned by the subquery. IN keyword works on a list.
| improve this answer | |
• 1
Thank you so much for pointing that out! Ran perfectly this time. – Nict Apr 7 '14 at 10:30
• 1
GROUP BY someID HAVING COUNT(*) = 1 is not required here. – Alex Kudryashev Jun 6 '16 at 2:30
• Awesome. Thank you! – Rob Jul 19 '16 at 13:43
3
You should join your tables in the subselect. It is possible to use 'in', but in your case I would use exists:
UPDATE table1 x
SET statusField = 1
WHERE exists (
SELECT null
FROM table1
WHERE x.someID = someID
GROUP BY someID
HAVING COUNT(*) = 1
)
For better performance I would use this script instead (sqlserver-2008+):
;WITH x as
(
SELECT rc = count() over (partition by someID), statusField
FROM table1
)
UPDATE x
SET statusField = 1
WHERE rc = 1
| improve this answer | |
• 1
Thanks! I ended up with using the IN operator as the query only had to run through just under 50 rows, so not too large of a query. However, I will add this to my reportoire! Thank you, again! :) – Nict Apr 7 '14 at 17:01
1
Try this
Use Top
UPDATE table1
SET statusField = 1
WHERE someID = (
SELECT TOP 1 someID
FROM table1
GROUP BY someID HAVING COUNT(*) = 1
)
Or you can use IN clause
UPDATE table1
SET statusField = 1
WHERE someID IN (
SELECT someID
FROM table1
GROUP BY someID HAVING COUNT(*) = 1
)
| improve this answer | |
• 1
your first suggestion will not return a useful answer – t-clausen.dk Apr 7 '14 at 10:57
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
__label__pos
| 0.743241 |
Skip to content
Java print stack trace to string | How to Convert Program example
• by
Using Core Java API to print the stack trace to strings provides an easy and efficient way to convert stack trace to string using StringWriter and PrintWriter.
A printStackTrace() method is used for get information about exception. You don’t need any special method to convert a print stack trace to a string. In the try-catch-finally exceptions block, we did it in a simple way.
Example: Convert and Print stack trace to a string
This program will throw ArithmeticException by dividing 0 by 0.
StringWriter writer = new StringWriter();
PrintWriter printWriter= new PrintWriter(writer);
exception.printStackTrace(printWriter);
Complete code
In code, Calling writer.toString() will provide stack trace in String format.
In the catch block, StringWriter and PrintWriter print any given output to a string. We then print the stack trace using the printStackTrace() method of the exception and write it in the writer.
import java.io.PrintWriter;
import java.io.StringWriter;
public class TryCatchBlock {
public static void main(String[] args) {
try {
int a[] = new int[10];
a[11] = 30 / 0;
} catch (Exception e) {
StringWriter writer = new StringWriter();
PrintWriter printWriter= new PrintWriter(writer);
e.printStackTrace(printWriter);
System.out.println("Exception in String is :: " + writer.toString());
}
System.out.println("Remain codes");
}
}
Output:
Java print stack trace to string
We don’t think you need to convert a Stack trace because you can use the simple printStackTrace() method or print direct exception as below code:-
public class TryCatchBlock {
public static void main(String[] args) {
try {
int a[] = new int[10];
a[11] = 30 / 0;
} catch (Exception e) {
// 1st Way
e.printStackTrace();
// 2nd way
System.out.println(e);
}
System.out.println("Remain codes");
}
}
Output:
Java printStackTrace method
Do comment if you have any doubts and suggestions on this tutorial.
Note: This example (Project) is developed in IntelliJ IDEA 2018.2.6 (Community Edition)
JRE: 11.0.1
JVM: OpenJDK 64-Bit Server VM by JetBrains s.r.o
macOS 10.14.1
Java version 11
All Java printStackTrace() methdo codes are in Java 11, so it may change on different from Java 9 or 10 or upgraded versions.
Leave a Reply
Your email address will not be published. Required fields are marked *
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
__label__pos
| 0.93684 |
Regular employee training is key to creating a robust cybersecurity culture within an organization. Organisations must also implement a robust cyber risk framework and management. Additionally, employees should be encouraged to report any suspicious activity they encounter. This combination of training and active participation helps to promote awareness and engagement, leading to a more secure environment for the organization.
|
__label__pos
| 0.876007 |
What Is Dogecoin Mining
What Is Dogecoin Mining
Dogecoin Mining: An Introduction to Cryptocurrency Mining
Dogecoin mining is a course of that enables the creation of new dogecoins through the use of highly effective computers, additionally known as rigs. Mining is accomplished by fixing difficult mathematical issues and processing transactions on a distributed ledger, called a blockchain. The course of of mining creates new dogecoins and requires the use of specialised hardware and software.
What Is Mining?
Mining is the method of confirming transactions on a distributed ledger, known as a blockchain. Transactions are provided to the miners as ‘blocks’. Miners use specialised hardware and software program to solve complex mathematical equations to confirm these blocks, and in flip create new blocks. Each new block is added to the blockchain, creating an ever-growing chain of records of transactions. In return for verifying the blocks, miners are rewarded with newly minted dogecoins.
Why Do People Mine Dogecoin?
Dogecoin is a well-liked and widely used cryptocurrency. It has skilled significant growth since its launch in late 2013. Due to its popularity, mining Dogecoin has become a popular exercise amongst cryptocurrency enthusiasts.
Mining Dogecoin can be worthwhile for some miners, relying on the price of the electrical energy used to energy their equipment. It can even be used to assist safe the Dogecoin network.
What Equipment Is Needed To Mine Dogecoin?
Mining Dogecoin requires funding in specialised hardware, such as graphics processing units (GPU) and application-specific built-in circuits (ASIC). These components are extra highly effective than conventional CPUs, and are extra environment friendly at processing the complex mathematical equations essential to generate new dogecoins.
Interested: Storing Value in Dogecoin, Pros and Cons
Software is additionally essential to mine Dogecoin. Popular choices include CGminer, BFGminer, and EasyMiner.
How Do I Start Dogecoin Mining?
Before starting to mine Dogecoin, it’s important to perceive the method and ensure you have the necessary hardware, software, and a Dogecoin wallet. After acquiring the hardware, putting in the software, and ensuring the availability of Dogecoin, the method is comparatively simple. First, join a pool that will work to generate revenue. Then, configure the mining software, connecting it to the pool. Finally, start mining and incomes Dogecoin.
Conclusion
Dogecoin mining has become an more and more popular exercise for cryptocurrency enthusiasts. The course of is simple, requiring solely specialised hardware, software, and a Dogecoin pockets to start. As with any cryptocurrency, the success of mining Dogecoin relies upon on the availability of electricity, the price of necessary equipment, and the demand for the cash themselves.
Yoruma kapalı.
|
__label__pos
| 0.986343 |
Results 1 to 2 of 2
Thread: Maximum number of work-items
1. #1
Junior Member
Join Date
Oct 2010
Posts
7
Maximum number of work-items
My GPU contains 18 compute units and each work-group supports a maximum of 256 work-items. When I execute my kernel with 16 * 256 items, OpenCL creates 16 work-groups and I get the right answer. But when I execute with 32 * 256 items, OpenCL creates 32 work-groups and I get the wrong answer.
Does the maximum # of items equal compute_units * max_work_group_size? Or is there a way to code kernels to support more work-items?
How do the extra work-groups access local memory if there are only 18 local memory blocks on the device? For example, my kernel uses barrier(CLK_LOCAL_MEM_FENCE) to synchronize local memory access. Is that causing the problem?
2. #2
Senior Member
Join Date
May 2010
Location
Toronto, Canada
Posts
845
Re: Maximum number of work-items
Does the maximum # of items equal compute_units * max_work_group_size? Or is there a way to code kernels to support more work-items?
There is no upper limit on the number of work-items you can enqueue in a single NDRange. It doesn't matter what your hardware looks like; your OpenCL implementation has to make it work.
How do the extra work-groups access local memory if there are only 18 local memory blocks on the device? For example, my kernel uses barrier(CLK_LOCAL_MEM_FENCE) to synchronize local memory access. Is that causing the problem?
Sequentially! Let's say you have 10 physical cores, each of them capable of executing a whole work-group at a time. Let's say you enqueue an NDRange that has 20 work-groups. Your hardware will execute 10 work-groups at a time. So barriers or local memory won't be a problem.
It's not possible to diagnose the problem you are seeing without having some more information. Have you checked that your buffers and images are large enough? Does the error always start happening after a certain NDRange size or is it random? Can you show us the source code of the kernel causing problems?
Disclaimer: Employee of Qualcomm Canada. Any opinions expressed here are personal and do not necessarily reflect the views of my employer. LinkedIn profile.
Similar Threads
1. Maximum number of work-items
By rabben in forum OpenCL - parallel programming of heterogeneous systems
Replies: 5
Last Post: 11-27-2012, 03:18 AM
2. help with work items in work groups
By gatodelsol in forum OpenCL - parallel programming of heterogeneous systems
Replies: 3
Last Post: 09-14-2011, 10:12 AM
Posting Permissions
• You may not post new threads
• You may not post replies
• You may not post attachments
• You may not edit your posts
•
Proudly hosted by Digital Ocean
|
__label__pos
| 0.839983 |
Revision e4a35244 libavcodec/acelp_pitch_delay.c
View differences:
libavcodec/acelp_pitch_delay.c
128 128
// ^g_c = ^gamma_gc * 100.05 (predicted dB + mean dB - dB of fixed vector)
129 129
// Note 10^(0.05 * -10log(average x2)) = 1/sqrt((average x2)).
130 130
float val = fixed_gain_factor *
131
exp2f(log2f(10.0) * 0.05 *
131
exp2f(M_LOG2_10 * 0.05 *
132 132
(ff_dot_productf(pred_table, prediction_error, 4) +
133 133
energy_mean)) /
134 134
sqrtf(fixed_mean_energy);
Also available in: Unified diff
|
__label__pos
| 0.840089 |
#1
1. No Profile Picture
Junior Member
Devshed Newbie (0 - 499 posts)
Join Date
Dec 2003
Posts
1
Rep Power
0
select distinct problem
Hi,
I want to select distinct values for a specific field and also include values from another field. However, it seems that distinct does not work when I add the second field in select statement. Ie:
select distinct fax, company from data
(does not select distinct fax values)
I have to use the following query to get distinct fax values:
select distinct fax from data
but I also need the company field values returned as well. Is there a way to work around this?
2. #2
3. SQL Consultant
Devshed Supreme Being (6500+ posts)
Join Date
Feb 2003
Location
Toronto Canada
Posts
27,339
Rep Power
4280
yes, there are several ways to work around this, however, the real difficulty is in stating the problem
suppose you had the following rows:
fax company
123 acme
123 brown
123 zellers
456 foo
456 bar
now obviously you want only two rows returned, but how do you decide which company you want for each fax?
here's one way, based on a criterion that i pulled out of thin air --
select fax, company
from yourtable A
where dateadded =
( select max(dateadded)
from yourtable
where fax = A.fax )
rudy
http://r937.com/
IMN logo majestic logo threadwatch logo seochat tools logo
|
__label__pos
| 0.555337 |
Tech
How do I install Cosmic Saints 4K build Kodi 17.3 Krypton
Published
on
One of the best KODI 17.3 builds in 2017 is Cosmic Saints 4K Krypton, which works for all devices. If you are looking for a Build, the fully loaded yet small and running it is smooth to have the build. It has sections for movies, 24/7, TV – Shows, Live – TV, Sports, children, mein Add-ons, music, favorites, Soccer, clean up, and Weather Systems.
Steps to install Cosmic Saints 4K KODI 17.3 Krypton Building
The steps 1) Click the System Folder from the top left
step 2) Click File – Manager
step 3) Click Add Source
step 4) Click None
step 6) Call it Magic
step 7) Make sure, that everything is correct, and click OK
step 8) From the main menu, click Add-ons
step 9) click on the package – Installer icon in the top left
step 10) click on Install Zip – file
step 11 ) Click the magic
step 12) Click repository. art project
step 13) Click Repository.aresproject.zip
step 14) Ares project repository opens and activated
step 15) Click Install Repository
step 16) Click Ares Project
step 17) Click Programs Add- US
step 18) click on Ares – Assistant
step 19) install
step 20) It opens Ares – assistant activated
step 21) Back to the Home – Screen and click Add-ons
step 22) click Program – Add-ons
step 23) click on Ares – Assistant
step 24) Click Browse builds
step 25) Click Cosmic Saints
step 26) a pin is required, by scanning the QR – Codes can be obtained or go to the page with a browser.
step 27) Clicking Get PIN open a browser and type the new PIN
step 28) Click Enter PIN
step 29) Enter the new pin in the box and click Finish
step 30) Click 4K Krypton Build
step 31) Click Install
step 32) Go Click
step 33) it will download and install
step 34) Click on No
step 35) Click again no
step 36) Click OK
step 37) After it is installed Kodi restart and it should come. Be sure, that to give him time, create menus, and update add-ons.
Cosmic Saints 4K is a term used to describe a visually stunning video that captures the beauty of our universe. It is a mesmerizing journey through space that showcases the magnificence of our cosmos in ultra-high definition. This video has become a sensation among space enthusiasts, providing them with an immersive experience of the cosmos.
Cosmic Saints 4K was created by a team of talented visual artists who spent countless hours gathering footage from different space agencies, including NASA and the European Space Agency. The video showcases breathtaking footage of planets, stars, galaxies, nebulas, and other celestial objects.
The video is available in 4K resolution, which is four times the resolution of full HD. This makes it ideal for viewing on large screens, where every detail of the universe is brought to life. The video is accompanied by an atmospheric soundtrack that complements the visuals, creating an immersive experience that transports viewers to the depths of space.
One of the most captivating aspects of Cosmic Saints 4K is the sense of scale it provides. The video highlights the sheer size of the universe, from the smallest particles to the largest structures. It showcases the vastness of space and the complexity of the cosmos, leaving viewers in awe of the beauty and mystery of our universe.
The video also showcases the scientific discoveries made by space agencies over the years. Viewers can witness the breathtaking imagery captured by spacecraft and telescopes that have helped us understand our universe better. This makes Cosmic Saints 4K not only visually stunning but also educational, inspiring viewers to learn more about the cosmos.
Overall, Cosmic Saints, 4K is a masterpiece of visual art that showcases the beauty and complexity of our universe. It is a testament to the human spirit of exploration and curiosity, reminding us of our place in the cosmos. The video has captured the imaginations of many space enthusiasts, providing them with a glimpse into the majesty of the universe. It is a must-see for anyone who is interested in space and the wonders of our universe.
Leave a Reply
Your email address will not be published. Required fields are marked *
Trending
Exit mobile version
|
__label__pos
| 0.546018 |
The Slashing Protocol
The slashing protocol is a preventative mechanism that disincentivizes certain staker actions, whether deliberate or unintentional, that may negatively impact service quality or network health. If prohibited actions (‘violations’) are attributably detected at any moment, the protocol responds by irreversibly forfeiting (‘slashing’) a portion of the offending staker’s collateral (‘stake’).
At network genesis, the protocol will be able to detect and attribute instances of incorrect re-encryptions returned by Ursulas. The staker controlling the incorrectly re-encrypting Ursula will have their stake reduced by a nominal sum of NU tokens.
Violations
In response to an access request by Bob, Ursula must generate a re-encrypted ciphertext that perfectly corresponds to the associated sharing policy (i.e. precisely what Alice intended Bob to receive). If the ciphertext is invalid in this regard, then Ursula is deemed to be incorrectly re-encrypting. Each instance of incorrect re-encryption is an official violation and is individually punished.
There are other ways stakers can compromise service quality and network health, such as extended periods of downtime or ignoring access requests. Unlike incorrect re-encryptions, these actions are not yet reliably attributable. Punishing non-attributable actions may result in unacceptable outcomes or introduce perverse incentives, thus these actions are not yet defined as violations by the slashing protocol.
Detection
Incorrect re-encryptions are detectable by Bob, who can then send a proof to the protocol to confirm the violation. This is enabled by a bespoke zero-knowledge correctness verification mechanism, which follows these steps:
1. When Alice creates a kFrag, it includes components to help Ursula prove the correctness of each re-encryption she performs. The kFrag’s secret component is used to perform the re-encryption operation. The kFrag also comprises public components, including a point commitment on the value of the secret component.
2. When Ursula receives the kFrag, she checks its validity – that the point commitment on the secret component is correct. This ensures that she doesn’t incorrectly re-encrypt due to Alice’s error (or attack).
3. Bob makes a re-encryption request by presenting a capsule to Ursula, and she responds with a cFrag. This contains the payload (a re-encrypted ciphertext) and a non-interactive zero knowledge proofs of knowledge (NIZK).
4. Bob checks the validity of the cFrag using the NIZK. He verifies that the point commitment corresponds to the ciphertext. He also checks that the cFrag was generated using his capsule, by verifying that it was created with the correct public key.
5. If any of the verifications fail, then Bob supplies the ciphertext and NIZK to the Adjudicator contract. The contract examines Bob’s claim by checking whether the NIZK proof for the ciphertext fails, leveraging optimized ECC algorithms.
6. If the invalidity of the cFrag is confirmed by the Adjudicator contract, the delivery of a faulty cFrag to Bob is ruled to be an official protocol violation. A penalty is computed and the owner of the offending Ursula has their stake immediately slashed by the penalty amount.
../_images/correctness_verification_schematic.svg
Penalties
At network genesis, although violations will be detected, attributed and publicly logged, the actual penalty levied will be of nominal size. For each violation, \(2 \times 10 ^ {-18}\) NU tokens will be deleted from the offender’s stake. The theoretical maximum number of tokens that can be slashed in a given period is limited by the number of blocks processed on Ethereum per day (~6000) and the number of transactions per block (~30 based on transaction gas and current gas limits). This yields a maximum slashable value of:
\[\begin{split}&= 2 \times 10 ^ {-18} NU \times 6000 \text{ blocks per period} \times 30 \text{ transactions per block} \\ &= 3.6 \times 10 ^ {-13} NU \text{ per period}\end{split}\]
The genesis penalty is measurable – so staker behavior can be observed – but small enough that it has a negligible impact on the staker’s ability to continue serving the network. If the severity of penalties and logic of the slashing protocol changes, it may involve any combination of the following:
• Larger penalties levied in absolute terms (number of tokens slashed per violation). This will provide a material disincentive to stakers.
• Penalties calculated as a percentage of the offender’s stake (i.e. the larger the stake, the greater the number of tokens slashed per violation). This will make punishments and disincentives far more equitable across stakers of diverse sizes.
• Ramped penalties, that increase with each successive violation, potentially resetting in a specified number of periods. This will encourage stakers to avoid repeat offences and rectify errors quickly.
• Temporal limitations on penalties, for example capping the total number of tokens slashabe in each period. This addresses a potentially uneven distribution of punishment, despite a near-identical crime, due to the unpredictable frequency with which a given Bob makes requests to an Ursula. A slash limit per period also gives stakers a grace period in which they may rectify their incorrectly re-encrypting Ursula. Since penalties are levied per incorrect re-encryption, a Bob making requests at a high cadence or batching their requests could wipe out a stake before it’s possible to manually fix an error – a limit on the maximum penalty size per period mitigates unfair scenarios of this sort.
• Temporary unbonding of Ursula, which forces the staker to forfeit subsidies, work and fees for a specified period. In a simple construction, this punishment would only apply if the Ursula is not servicing any other policies or all relevant Alices consent to the removal of that Ursula from their sharing policies.
Impact on stake
Regardless of how punitive the slashing protocol ends up being, the algorithm should always attempt to preserve the most efficient configuration of the offender’s remaining stake, from the perspective of network health. To that end, the lock-up duration of Sub-stakes is taken into account when selecting the portion(s) of stake to slash.
An entire stake consists of:
• unlocked tokens which the staker can withdraw at any moment
• tokens locked for a specific period
In terms of how the stake is slashed, unlocked tokens are the first portion of the stake to be slashed. After that, if necessary, locked sub-stakes are decreased in order based on their remaining lock time, beginning with the shortest. The shortest sub-stake is decreased, and if the adjustment of that sub-stake is insufficient to fulfil the required punishment sum, then the next shortest sub-stake is decreased, and so on. Sub-stakes that begin in the next period are checked separately.
Sub-stakes for past periods cannot be slashed, so only the periods from the current period onward can be slashed. However, by design sub-stakes can’t have a starting period that is after the next period, so all future periods after the next period will always have an amount of tokens less than or equal to the next period. The current period still needs to be checked since its stake may be different than the next period. Therefore, only the current period and the next period need to be checked for slashing.
Overall the slashing algorithm is as follows:
1. Reduce unlocked tokens
2. If insufficient, slash sub-stakes as follows:
1. Calculate the maximum allowed total stake for any period for the staker
max_allowed_stake = pre_slashed_total_stake - slashing_amount
Therefore, for any period moving forward the sum of sub-stakes for that period cannot be more than max_allowed_stake.
2. For the current and next periods ensure that the amount of locked tokens is less than or equal to max_allowed_stake. If not, then reduce the shortest sub-stake to ensure that this occurs; then the next shortest and so on, as necessary for the period.
3. Since sub-stakes can extend over multiple periods and can only have a single fixed amount of tokens for all applicable periods (see Sub-stakes), the resulting amount of tokens remaining in a sub-stake after slashing is the minimum amount of tokens it can have across all of its relevant periods. To clarify, suppose that a sub-stake is locked for periods n and n+1, and the slashing algorithm first determines that the sub-stake can have 10 tokens in period n, but then it can only have 5 tokens in period n+1. In this case, the sub-stake will be slashed to have 5 tokens in both periods n and n+1.
4. The above property of sub-stakes means that there is the possibility that the total amount of locked tokens for a particular period could be reduced to even lower than the max_allowed_stake. Therefore, the slashing algorithm may create new sub-stakes on the staker’s behalf to utilize tokens in the earlier period, when a sub-stake is needed to be reduced to an even lower value because of the next period. In the example above in c), the sub-stake was reduced to 5 tokens because of period n+1, so there are 5 “extra” tokens (10 - 5) available in period n that can still be staked; hence, a new sub-stake with 5 tokens would be created to utilize these tokens in period n. This benefits both the staker, by ensuring that their remaining tokens are efficiently utilized, and the network by maximizing its health.
To reinforce the algorithm, consider the following example stake and different slashing scenarios:
Example:
A staker has 1000 tokens:
• 1st sub-stake = 500 tokens locked for 10 periods
• 2nd sub-stake = 200 tokens for 2 periods
• 3rd sub-stake = 100 tokens locked starting from the next period and locked for 5 periods. The 3rd sub-stake is locked for the next period but won’t be used as a deposit for “work” until the next period begins.
• 200 tokens in an unlocked state (still staked, but can be freely withdrawn).
stake
^
|
800| +----+
| | 3rd|
700+-----+----+
| |
600| 2nd +-------------+
| | 3rd |
500+----------+-------------+----------+
| |
| 1st |
| | period
+-----------------------------------+--->
Penalty Scenarios:
• Scenario 1: Staker incurs penalty calculated to be worth 100 tokens:
Only the unlocked tokens will be reduced; from 200 to 100. The values of locked sub-stakes will therefore remain unchanged in this punishment scenario.
Result:
• 1st sub-stake = 500 tokens locked for 10 periods
• 2nd sub-stake = 200 tokens for 2 periods
• 3rd sub-stake = 100 tokens locked starting from the next period
• 100 tokens in an unlocked state
• Scenario 2: Staker incurs penalty calculated to be worth 300 tokens:
The unlocked tokens can only cover 200 tokens worth of the penalty. Beyond that, the staker has 700 tokens currently locked and 100 tokens that will lock in the next period, meaning 800 tokens will be locked in total. In this scenario, we should reduce amount of locked tokens for the next period and leave unchanged locked amount in the current period. The 3rd sub-stake would be suitable to be reduced except that it’s not the shortest, in terms of its unlock date. Instead, the 2nd sub-stake – the shortest (2 periods until unlock) – is reduced to 100 tokens and a new sub-stake with 100 tokens is added which is only active in the current period.
Result:
• 1st sub-stake = 500 tokens locked for 10 periods
• 2nd sub-stake = 100 tokens for 2 periods
• 3rd sub-stake = 100 tokens locked starting from the next period for 5 periods
• 4rd sub-stake = 100 tokens for 1 period
• Remaining 0 tokens
stake
^
|
800| +----+
| | 3rd|
700- +-----+----+ - - - - - - - - - - - - -
| |
600| 2nd +-------------+
| | 3rd |
500+----------+-------------+----------+
| |
| 1st |
| | period
+-----------------------------------+--->
stake
^
|
|
700- | - - +----+ - - - - - - - - - - - - -
| | 3rd|
600+-----+----+-------------+
| 2nd | 3rd |
500+----------+-------------+----------+
| |
| 1st |
| | period
+-----------------------------------+--->
stake
^
|
|
700- +-----+----+ - - - - - - - - - - - - -
| 4th | 3rd|
600+-----+----+-------------+
| 2nd | 3rd |
500+----------+-------------+----------+
| |
| 1st |
| | period
+-----------------------------------+--->
• Scenario 3: Staker incurs penalty calculated to be worth 400 tokens:
The difference between this and the previous scenario is that the current period’s sum of locked tokens is also reduced. The first step is to reduce the 2nd sub-stake to 100 tokens. Then, the next period is adjusted – the shortest sub-stake is still the 2nd – and it is reduced from 100 to zero for the next period. Notably, this would have the same result if we changed the duration of the 2nd sub-stake from 2 periods to 1 and the other sub-stakes remained unchanged.
Result:
• 1st sub-stake = 500 tokens locked for 10 periods
• 2nd sub-stake = 100 tokens for 1 period
• 3rd sub-stake = 100 tokens locked starting from the next period
• Remaining 0 tokens
stake
^
|
800| +----+
| | 3rd|
700+-----+----+
| |
600- |- -2nd- - +-------------+ - - - - - -
| | 3rd |
500+----------+-------------+----------+
| |
| 1st |
| | period
+-----------------------------------+--->
stake
^
|
700| +----+
| | 3rd|
600- +-----+----+-------------+ - - - - - -
| 2nd | 3rd |
500+----------+-------------+----------+
| |
| 1st |
| | period
+-----------------------------------+--->
stake
^
|
600- +-----+------------------+ - - - - - -
| 2nd | 3rd |
500+-----+------------------+----------+
| |
| 1st |
| | period
+-----------------------------------+--->
• Scenario 4: Staker incurs penalty calculated to be worth 600 tokens:
The unlocked tokens, the 3rd sub-stake, and the shortest sub-stake (2nd) are all reduced to zero. This is not quite enough, so the next shortest sub-stake, the 1st, is also reduced from 500 to 400.
Result:
• 1st sub-stake = 400 tokens locked for 10 periods
• 2nd sub-stake = 0 tokens for 2 periods
• 3rd sub-stake = 0 tokens locked starting from the next period
• Remaining 0 tokens
stake
^
|
800| +----+
| | 3rd|
700+-----+----+
| |
600| 2nd +-------------+
| | 3rd |
500+----------+-------------+----------+
400- | - - - - - - - - - - - - - - - - - | -
| 1st |
| | period
+-----------------------------------+--->
stake
^
|
600| +------------------+
| | 3rd |
500+-----+------------------+----------+
400- | - - - - - - - - - - - - - - - - - | -
| 1st |
| | period
+-----------------------------------+--->
stake
^
|
500| +------------------+
| | 3rd |
400- +-----+------------------+----------+ -
| 1st |
| | period
+-----------------------------------+--->
stake
^
|
400- +-----------------------------------+ -
| 1st |
| | period
+-----------------------------------+--->
|
__label__pos
| 0.928047 |
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
CSC Automation Testing AllOther Interview Questions
Questions Answers Views Company eMail
Hi Friends, I'm testing a SharePoint application by QTP 8.2 I face a problem that really difficult to me, please take a look on the description below: As you may know, SharePoint is an application is allow customize function from user, so that, user can add many web parts and put at any place they like. For ex: if there are two web parts existing in the SharePoint site When I using QTP to recognize a Web Table on any web part, it has the properties as "Index" and "html tag" only. Problem is: If there is any user changes the display of my web part, the "Index" of Web table is changed as well, so that QTP cannot identify exactly my object. Can anyone help me how to make that object as unique or another way to identify that web table object? Hope to receive many solutions from you. Thanks a lot.
1 7288
Post New CSC Automation Testing AllOther Interview Questions
CSC Automation Testing AllOther Interview Questions
Un-Answered Questions
Why did you decide to pursue your career at Accessorize?
640
Is Recombination in Human Mitochondrial DNA really possible?
1647
What is the benefit of linux?
387
Explain datastage architecture?
727
can anyone tell me what kind of questions are asked for core java exam in aptech
1389
What is trigger explain with example?
463
How blockchain is used for bitcoin?
1
How large is a boolean?
495
Explain the major terrestrial biomes?
26
how do you programme Carrier Sense Multiple Access
1443
Why in the world can I not mount an iso on a windows machine?
414
What is xpath selector?
379
How would you do the automate vendor replication on srm
492
Can we return Data from 4(more than 1) tables in stored procedure?
548
What is your biggest regret in life?
694
|
__label__pos
| 1 |
In physics, the law of conservation of energy states that the total energy of an isolated system remains constant—it is said to be conserved over time. Energy can neither be created nor destroyed; rather, it transforms from one form to another. In IT I postulate that there is another similar law that we all should get familiar with:
The conservation of complexity states that the total complexity of an isolated business / IT system remains constant – it is said to be conserved over the lifetime of the solution. Complexity can neither be created nor destroyed; rather, it transforms from one form to another.
If energy is the ability to do work, or the ability to move or elicit change, then complexity (in this context) is the resistance to change in a system. This resistance causes the effort and time to implement a change to increase which in turn increases the cost of sustaining and enhancing a system. How do I come to that conclusion?
Complexity in Architecture
The following diagrams model the way in which system architecture has developed over the last few decades. Each diagram represents the same generic business problem solved through differing architectural styles. Monolithic systems have given way to client/server or tiered designs which have in turn fallen out of favour to be replaced by service architectures whether the SOA or the Microservices kind.
Comparison of various architectural styles
Figure 1
Each progression above can be classed as simpler than its predecessor. Components and then services have been introduced as a means to compartmentalise business logic in order for it be reused or replaced altogether. The drive to Microservices takes this further. It is the manifestation of the Single Responsibility Principle at architectural level. Building a service that does exactly one thing well is much easier than trying to weave that code into a monolith. There are no distractions and it is straightforward to articulate the acceptance criteria or what done looks like. However, one service does not make a solution, so what is the impact to the overall system complexity?
Client Service vs Microservices
Figure 2
Layering on inter-component or inter-service interaction on to the client/server and Microservices models above highlights that the complexity has shifted to the networks and communication channels between the components that make up the system. It seems that the client and server components are complex to build but simple to connect, whereas Microservices are simple(r) to build but more complex to interconnect.
Building communication networks between components adds another layer of complexity. Nodes in the network need wiring together and managing. Security becomes more of a concern as the traffic travelling on the network needs protecting. More network hardware is introduced, and someone has to manage it. It may be easier to test each component individually but how do you know that the system in its entirety is working? When things go wrong how do you pinpoint the cause?
The complexity has simply been relocated from the software and code into the network and solution management.
Complexity in People
People have roles to play in complexity, after all in many software architectures, people are a fundamental part of the system.
In the early days of automating business processes using computers, the software often played the part of a glorified filing cabinet. Records are accessed in the system, they are reviewed, changed if necessary and then pushed back. The users and the software are working together to achieve some business activity, often with users holding relatively complex processes in their heads. Sometimes the people using the system act as an integration layer. Data is read from one system and keyed in manually to another.
As activities are automated and the burden on people is reduced the complexity moves into the system. New user interface styles are designed and built so users can be more efficient. Workflow systems are introduced that allow humans and systems to communicate more effectively.
In essence complexity has been moved into the software to make life easier for the users. The complexity of the complete system has not changed.
Complexity in Phasing
Even in a world where DevOps is gaining popularity, it is still typical for software to be born in a large-scale delivery project, at the end of which it is transitioned into support where it is run until it is no longer required. In my experience these large delivery projects are where large-scale investment takes place and where attention is focused. However even the best plans need to be changed and scope is often reduced. Business functionality is prioritised over operational requirements and before you know it the software is in support, but it is complex to operate.
The complexity of the system has not changed. We have simplified the delivery timeline, but all the complexity has moved to the support team. More people are needed to run the system, more telemetry is required to understand what is going on and the solution is more expensive to operate.
In Conclusion
As people responsible for the successful delivery of software we need to be aware of the consequences of our choices. Our jobs can be pressurised and it’s natural to try to make life simpler but the choices we make can have a wide impact. When we consider the complexity of the entire system, we can assert whether our simplifications are positive. We might be making life worse for the people who have to run our software or for the people using our software, or even our future selfs when we are called back to fix our software.
Comments
|
__label__pos
| 0.93246 |
A computer algebra system (CAS) is a program which is able to carry out various symbolic manipulations with mathematical expressions. Some well-known computer-algebra systems: Mathematica, Maple, Wolfram Alpha, GAP. For questions about Mathematica please see the ...
learn more… | top users | synonyms
2
votes
0answers
68 views
Are there high performance computing applications for symbolic integration?
Currently there are a number of applications for numerical integration in applied mathematics and physics. Many of these are integral transforms (often Fourier or Laplace), or solving definite ...
2
votes
0answers
37 views
Muirhead's Inequality (software?)
I just started learning about inequalities: Schur's, Karamata's, Muirhead's, etc... They are beautiful but it seems that in the case of more than two variables, some of the computations become a ...
2
votes
0answers
86 views
Todd-Coxeter algorithm: coincidences
I'm trying to understand the Todd-Coxeter algorithm with the help of a multiplication and relator table, but there is one thing about coincidences that is not really clear. For some small groups (for ...
2
votes
0answers
161 views
How does one solve equations over finite fields in SAGE?
Sage has the method solve (or function, I'm not sure what's the correct terminology) that finds solutions to 'symbolic expressions'. In particular, if one wants to find solutions for a given set of ...
2
votes
0answers
48 views
Is there a known algorithm for approximating all the real and imaginary zeros of any well behaved equation of a single variable?
Does there currently exist a general algorithm (or set of algorithms used together) that will approximate all the zeros of any well behaved non-differential equation of a single variable which has a ...
2
votes
0answers
459 views
Solving large, sparse system of linear equations
I have a system of linear equations as follows: $$(A+I)x=B$$ where $I$ is the $n\times n$ identity matrix, $A$ is a $n\times n$ matrix such that the first and last rows are blank, and, for every ...
2
votes
0answers
61 views
Minimal set of algebraically independent numbers
Suppose we have a set of polynomials $f_1, f_2, \ldots, f_n \in \mathbb{Q}[x]$. Consider the set $$S := \{\alpha \in \mathbb{C} \; | \; f_i(\alpha) = 0 \text{ for some } i \}$$ of complex roots of ...
2
votes
2answers
231 views
Simple generators with a complex Gröbner basis
It's known that finding a Gröbner basis of a polynomial ideal has a worst-case space complexity of $O(2^{2^{c\cdot n}})$, where c is constant and n is the number of variables $k[x_1,\ldots,x_n]$. ...
2
votes
0answers
78 views
Free software for expresing a resolvent as function of coefficients
This relates to question "Expressing a symmetric polynomial in terms of elementary symmetric polynomials using computer?" I would like to try absolute resolvent for group $C_5$ in $S_5$. For example ...
2
votes
1answer
191 views
Introduction to Elementary Functions
I'm looking for an introductory text on algebraic treatment of elementary functions. Really short and easy-going. Video lectures are even better. I want to learn basic ideas (i.e. definitions) behind ...
2
votes
0answers
158 views
How do mathematicians handle functions of functions that may change?
E.g. let $f(x) = $ some function. Now define $h(x) = f(g(x))$. Now suppose the definition of $g(x)$ changes around in a discussion. Do we still refer to $h(x)$ as the original $h(x)$ or only when ...
2
votes
0answers
171 views
What is a good software package for ( assisted ) theorem proving and documenting?
Background: An issue in my math study is that I haven't found a good way of storing the theorems ( mostly abstract algebra ) I studied and want to (re-)use in proofs. At the moment I use a personal ...
1
vote
2answers
64 views
In maple how do you evaluate combinations?
In Maple how do you have it evaluate combinatorics such as $\binom{5}{2}$ and give you the answer 10? (What is the name of what I want to do anyways, is it evaluate?) Thanks. Seems so easy now that I ...
1
vote
2answers
214 views
CAS for algebraic geometry, which one?
I use Maple to compute Groebner bases and find it very efficient/fast for my current needs. However, several introductory textbooks on algebraic geometry refer to Singular, which I never used before. ...
1
vote
1answer
91 views
How do I determine if two of my software's representation of algebraic numbers are equal?
I have software which stores information about algebraic numbers with absolute precision. If you build it up by creating instances of a Python representation of an integer, float, Decimal, or string, ...
1
vote
2answers
10k views
Wolfram Alpha: How to define constants in a system of equations?
I'd like to use WA to solve a small system of nonlinear equations, that involve both constants and the variables of interest. How do I "tell" WA which variables are the constants, and which are the ...
1
vote
2answers
121 views
Representing Elementary Functions in a CAS
I've looked through several books about computer algebra. They are surprisingly scarce about how to actually represent elementary functions. Basically, as far as I understood elementary functions are ...
1
vote
1answer
115 views
An integral evaluation
I tried my luck with Wolfram Alpha, with $p \in \mathbb{R}$ $$\int_{-\infty}^{\infty} \frac{x^p}{1+x^2} dx = \frac{1}{2} \pi ((-1)^p+1) \sec(\frac{\pi p}{2})$$ for $-1<p<1$, and doesn't exist ...
1
vote
2answers
66 views
How can I plot $y^x$?
How can I plot $y^x$? To keep things simple and to not have another $z$ variable on the other end of the equation, let's assume $y^x=10$. As long as that value is not $0$, the curve we get should look ...
1
vote
1answer
58 views
Chinese remainder theorem for polynomial evaluation
Let $R$ be a euclidean domain, $m_0,\ldots ,m_{k-1}\in R$ be pairwise coprime and $m:=m_0\cdots m_{k-1}$. The Chinese remainder theorem states: $$\varphi:R\to R/(m_0)\times\cdots \times ...
1
vote
3answers
54 views
If there is an $a\in\mathbb{Z}$ with $a^{n-1}\equiv 1\mod n$ but $a^{\frac{n-1}p}\not\equiv 1$ for all primes $p\mid n-1$, then $n$ is a prime
Let $n\in\mathbb{N}$ with $n\ge 3$ and $a\in\mathbb{Z}$ such that $$a^{n-1}\equiv1\text{ mod } n\;\;\;\wedge\;\;\;a^{\frac{n-1}{p}}\not\equiv1\text{ mod }n\;\;\;\forall p\in\mathbb{P}:p\mid n-1$$ ...
1
vote
1answer
77 views
Comparing expressions exactly
Suppose I have two expressions; call them $A$ and $B$. The following values of $A$ and $B$ are good examples for my question... $$ A = \pi e^2\\ B = \pi^2 e $$ Is there a method to determine the ...
1
vote
1answer
387 views
Complex equation in maxima
I rested on this tutorial. After issuing the command with "solve" function: %i2 solve((a-b-sqrt(-c^2+2*c*y-y^2+r^2))^2+(d-y)^2=2*r^2*(1-cos(e)),y); The output ...
1
vote
2answers
418 views
Nspire cx CAS - Laplace inverse fails
I'm trying to calculate that easy integral but I get undef. When I replaced $\infty$ with $1000$, I got the right answer. ($e^{-1000}$ is zero roughly). Although this calculator knows that ...
1
vote
1answer
96 views
MuPAD - rearrange an equation
I have a huge expression, say $f(x_1,x_2,x_3) = 0,$ and I want MuPAD to try to express $x_1 $ in terms of $x_2$ and $x_3$ Is this possible?
1
vote
1answer
80 views
how to use hilbert function in gap system with loadpackage singular
how to calculate hilbert function as it do in singular code singular code ...
1
vote
1answer
110 views
Programming PARI/GP to do a sum
I'm trying to compute the following sum in PARI/GP $C=\sum_{n=1}^{\infty} \frac{g(n)}{n^2}$ where $g(n)$ defined as $$g(n)=(-1)^r, \qquad r=\text{number of even indexed prime factors of $n$}$$ By ...
1
vote
1answer
136 views
Implementing a function in PARI/GP
I want to define a function: $$g(n)= \begin{cases} +1 & \text{if $n=1$},\\ +1 & \text{if $n$ is an odd indexed prime}, \\ -1 & \text{if $n$ is an even indexed prime},\\ (-1)^r & ...
1
vote
1answer
44 views
How many $\overline{a}\in\left(\mathbb{Z}/91\mathbb{Z}\right)^\times$ pass the Fermat and Miller-Rabin primability tests?
Let $$\text{F}_{91}:=\left\{\overline{a}\in\left(\mathbb{Z}/n\mathbb{Z}\right)^\times:91\text { passes the Fermat primality test to base }a\right\}$$ and ...
1
vote
1answer
167 views
Knuth-Bendix completion algorithm: word problem
Can someone explain me how to set up an algorithm to find the 12 normal forms of the group $A_4$ by making use of the Knuth-Bendix completion algorithm? So we have that $RRR=1, SSS=1$ and $RSRS=1$. ...
1
vote
1answer
42 views
Specifying if a function has an elementary integral
In Algorithms for Computer Algebra in the last chapter about Risch algorithm, the Rothstein-Trager method is applied to see if an elementary function has an elementary integral. For this, the ...
1
vote
2answers
175 views
wolfram mathematica, numerical integration, precision of a function/expression
I want to obtain the best numerical approximation (up to 10 decimal place would be ok for me) to an integral: $$ \int^{\infty}_{0} f(r)r^2dr $$ I am using the function $f(r)$, which is related to ...
1
vote
1answer
921 views
Existence of non-trivial solution of Sylvester equation.
I'm trying to solve a special case of Sylvester equation in my case it looks like $$A*X=X*B$$ so it can be written in form $$A*X+X*(-B)=C$$ where C consist of all 0 items. I tried to solve it in ...
1
vote
1answer
722 views
Algorithm for finding limits of compositions of simple functions?
There are two questions: Define the set $S$. Compute the limit of functions $f/g$ for functions $f,g\in S$, where $S$ is defined in the following way. All constant function are in $S$, $f(n) = ...
1
vote
1answer
62 views
Math software to calculate in different rings.
I was doing computational experiment by using rings of polynomial like this let $f(x)=x^6+x\in\mathbb{Z_n[x]}$ for any given $n$. Is there any software which help me to calculate $f(a)$ where ...
1
vote
1answer
30 views
Variance of discrete probability distribution
I was wondering how I should calculate the variance of the following discrete probability distribution: $$P(y = 0|X) = w + (1-w)e^{-\mu}$$ $$P(y = j|X) = (1-w)e^{-\mu}\mu^{y}/y! \qquad j=1,2...$$ ...
1
vote
1answer
38 views
Number conversion in decimal fraction
980.85D convert to hexadecimal number = 3D4 . ?? how to solve the answer after the decimal point? Thank you in advanced.
1
vote
1answer
48 views
If $A\ne 0$ is a square matrix over a commutative ring with $\det A=0$, then its null space contains an element whose components are minors of $A$
Let $R$ denote a commutative ring and $A\ne 0$ a $n\times n$ matrix over $R$ with $\det A=0$. Then there exists a $x\in\ker A\setminus\left\{0\right\}$ such that all components of $x$ are minors of ...
1
vote
1answer
67 views
Number of monic irreducible polynomials over a finite field
Let $\mathbb{K}=\mathbb{F}_q$ and $\nu_n$ denote the number of monic irreducible polynomials over $\mathbb{K}$. It holds $$\nu_n=\frac{1}{n}\sum_{d\mid n}\mu\left(\frac{n}{d}\right)q^d$$ What I need ...
1
vote
2answers
97 views
Some questions about similar matrices
Two matrices A and B are similar, if and only if there exists an invertible matrix C with $A=C^{-1}BC$. A necessary condition for the similarity is, that the characteristic polynomials coincide. I ...
1
vote
1answer
94 views
Prevent Maple to evaluate before simplify a function
I have been trying to find a domain of $f(x)=\frac{x}{\frac{(x+2)}{(x-3)}}$ using different kind of software ( its clear the domain of this function is $\mathbb{R}\backslash \{-2,3\}$ ). When I tried ...
1
vote
1answer
36 views
Computational complexity of expanding a MacLaurin/Taylor Series
What methods exist to computationally determine the first $k$ coefficients of a function (possibly polynomial or rational polynomial function)? How do Mathematica/MatLab/Maple/etc. solve this ...
1
vote
1answer
48 views
Checking if a polynomial expression is constant in SAGE
I have a huge fractional-polynomial expression in SAGE that I have good reasons to believe is the constant function. Is there a command in SAGE like "== constant function" that I could use to check ...
1
vote
1answer
90 views
How to calculate resultant of two polynomials without knowing the roots.
So in Rothstein - Trager's Method of evaluating logarithmic part they need resultant of two polynomial as shown in the image. My question is that how do they calculate the resultant without knowing ...
1
vote
1answer
110 views
Resultant of Two Univariate Polynomials
I am trying to implement an algorithm for computing Res(f(x),g(x),x) where f(x) and g(x) uni variate polynomials with integer coefficients. Could any one list the various algorithms for computing ...
1
vote
2answers
482 views
Plotting parametric equations in Maple
I have the following problem. Let $\alpha:=\alpha(v)$ and $\beta:=\beta(v)$, where $v\in\mathbb{R}$. Using MAPLE, I would like to plot $\alpha$ and $\beta$ in the $(\alpha,\beta)$ space as $v$ varies ...
1
vote
1answer
123 views
Computing Resultant
The resultant of two polynomials is defined as the determinant of the Sylvester matrix. If the polynomials are of degree $n$ and $m$, than the Sylvester matrix will be of dimension $(m+n)\times ...
1
vote
1answer
57 views
What are the explicit expression for this interpolation problem
We want to fit $f(x) = a_0 + a_1 *x + a_2 * x^2 + ... + a_n * x^n$ to the data $(x_i,f(x_i))$ for $i = 0 ... n.$ It will give rise to the following system $ A a = b $ Here $ a = [ a_1 a_2 a_3 ...
1
vote
1answer
84 views
How to test a formula online?
I have an equation I have devised, it is: $$\frac{H+O}{25}+\frac{D}{12970}+\frac{E}{363}+110 = X$$ The equation doesn't matter, I just posted it as an example. I need to be able to plug in values ...
1
vote
1answer
277 views
How to effectively compute a periodic function?
I'm writing a program to compute a value of periodic function for any arbitrary large argument: $f(k) = (\sum_{n=1}^{2^k} n)\mod\ (10^9 + 7)$, where $n,k \in \mathbb{N} $ I know that $ f(k + P) = ...
|
__label__pos
| 0.992369 |
Does Font Weight subsitute Bold option?
If you please, care to comment @elixirgraphics :slight_smile:
I found inspector options at foundry to be slightly differerant than in Foundry course. Does Font Weight subsitute Bold option?
Yes, the weight option allows you to bold the text. It allows you more refined control. It was updated since those videos were recorded. You can learn more about specific stacks in the documentation section of the site that outlines the features of each stack. This is the page for the Header stack specifically.
1 Like
|
__label__pos
| 0.999994 |
mside.dll
Process name: TSPY_GOLDUN.AN Trojan
Application using this process: TSPY_GOLDUN.AN
Recommended: Check your system for invalid registry entries.
mside.dll
Process name: TSPY_GOLDUN.AN Trojan
Application using this process: TSPY_GOLDUN.AN
Recommended: Check your system for invalid registry entries.
mside.dll
Process name: TSPY_GOLDUN.AN Trojan
Application using this process: TSPY_GOLDUN.AN
Recommended: Check your system for invalid registry entries.
What is mside.dll doing on my computer?
mside.dll is a module belonging to an advertising program by egold. This module monitors your browsing habits and distributes the data back to the author's servers for analysis. This also prompts advertising popups. This process is a security risk and should be removed from your system.
Non-system processes like mside.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.
mside.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 mside.dll harmful?
This process is considered safe. It is unlikely to pose any harm to your system.
mside.dll is a dangerous process
Can I stop or remove mside.dll?
This process is likely to be spyware, in which case it should be stopped and removed immediately. We recommend you use an anti-virus software to identify and remove dangerous processes.
Is mside.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.
Why is mside.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!
Toolbox
ProcessQuicklink
|
__label__pos
| 0.916341 |
++ed by:
MATTK DMOL JWB NGLENN SKAUFMAN
133 PAUSE users
113 non-PAUSE users.
Jesse Vincent
and 1 contributors
NAME
perlunicode - Unicode support in Perl
DESCRIPTION
Important Caveats
Unicode support is an extensive requirement. While Perl does not implement the Unicode standard or the accompanying technical reports from cover to cover, Perl does support many Unicode features.
People who want to learn to use Unicode in Perl, should probably read the Perl Unicode tutorial, perlunitut, before reading this reference document.
Input and Output Layers
Perl knows when a filehandle uses Perl's internal Unicode encodings (UTF-8, or UTF-EBCDIC if in EBCDIC) if the filehandle is opened with the ":utf8" layer. Other encodings can be converted to Perl's encoding on input or from Perl's encoding on output by use of the ":encoding(...)" layer. See open.
To indicate that Perl source itself is in UTF-8, use use utf8;.
Regular Expressions
The regular expression compiler produces polymorphic opcodes. That is, the pattern adapts to the data and automatically switches to the Unicode character scheme when presented with data that is internally encoded in UTF-8, or instead uses a traditional byte scheme when presented with byte data.
use utf8 still needed to enable UTF-8/UTF-EBCDIC in scripts
As a compatibility measure, the use utf8 pragma must be explicitly included to enable recognition of UTF-8 in the Perl scripts themselves (in string or regular expression literals, or in identifier names) on ASCII-based machines or to recognize UTF-EBCDIC on EBCDIC-based machines. These are the only times when an explicit use utf8 is needed. See utf8.
BOM-marked scripts and UTF-16 scripts autodetected
If a Perl script begins marked with the Unicode BOM (UTF-16LE, UTF16-BE, or UTF-8), or if the script looks like non-BOM-marked UTF-16 of either endianness, Perl will correctly read in the script as Unicode. (BOMless UTF-8 cannot be effectively recognized or differentiated from ISO 8859-1 or other eight-bit encodings.)
use encoding needed to upgrade non-Latin-1 byte strings
By default, there is a fundamental asymmetry in Perl's Unicode model: implicit upgrading from byte strings to Unicode strings assumes that they were encoded in ISO 8859-1 (Latin-1), but Unicode strings are downgraded with UTF-8 encoding. This happens because the first 256 codepoints in Unicode happens to agree with Latin-1.
See "Byte and Character Semantics" for more details.
Byte and Character Semantics
Beginning with version 5.6, Perl uses logically-wide characters to represent strings internally.
In future, Perl-level operations will be expected to work with characters rather than bytes.
However, as an interim compatibility measure, Perl aims to provide a safe migration path from byte semantics to character semantics for programs. For operations where Perl can unambiguously decide that the input data are characters, Perl switches to character semantics. For operations where this determination cannot be made without additional information from the user, Perl decides in favor of compatibility and chooses to use byte semantics.
Under byte semantics, when use locale is in effect, Perl uses the semantics associated with the current locale. Absent a use locale, and absent a use feature 'unicode_strings' pragma, Perl currently uses US-ASCII (or Basic Latin in Unicode terminology) byte semantics, meaning that characters whose ordinal numbers are in the range 128 - 255 are undefined except for their ordinal numbers. This means that none have case (upper and lower), nor are any a member of character classes, like [:alpha:] or \w. (But all do belong to the \W class or the Perl regular expression extension [:^alpha:].)
This behavior preserves compatibility with earlier versions of Perl, which allowed byte semantics in Perl operations only if none of the program's inputs were marked as being a source of Unicode character data. Such data may come from filehandles, from calls to external programs, from information provided by the system (such as %ENV), or from literals and constants in the source text.
The bytes pragma will always, regardless of platform, force byte semantics in a particular lexical scope. See bytes.
The use feature 'unicode_strings' pragma is intended to always, regardless of platform, force Unicode semantics in a particular lexical scope. In release 5.12, it is partially implemented, applying only to case changes. See "The "Unicode Bug"" below.
The utf8 pragma is primarily a compatibility device that enables recognition of UTF-(8|EBCDIC) in literals encountered by the parser. Note that this pragma is only required while Perl defaults to byte semantics; when character semantics become the default, this pragma may become a no-op. See utf8.
Unless explicitly stated, Perl operators use character semantics for Unicode data and byte semantics for non-Unicode data. The decision to use character semantics is made transparently. If input data comes from a Unicode source--for example, if a character encoding layer is added to a filehandle or a literal Unicode string constant appears in a program--character semantics apply. Otherwise, byte semantics are in effect. The bytes pragma should be used to force byte semantics on Unicode data, and the use feature 'unicode_strings' pragma to force Unicode semantics on byte data (though in 5.12 it isn't fully implemented).
If strings operating under byte semantics and strings with Unicode character data are concatenated, the new string will have character semantics. This can cause surprises: See "BUGS", below. You can choose to be warned when this happens. See encoding::warnings.
Under character semantics, many operations that formerly operated on bytes now operate on characters. A character in Perl is logically just a number ranging from 0 to 2**31 or so. Larger characters may encode into longer sequences of bytes internally, but this internal detail is mostly hidden for Perl code. See perluniintro for more.
Effects of Character Semantics
Character semantics have the following effects:
• Strings--including hash keys--and regular expression patterns may contain characters that have an ordinal value larger than 255.
If you use a Unicode editor to edit your program, Unicode characters may occur directly within the literal strings in UTF-8 encoding, or UTF-16. (The former requires a BOM or use utf8, the latter requires a BOM.)
Unicode characters can also be added to a string by using the \N{U+...} notation. The Unicode code for the desired character, in hexadecimal, should be placed in the braces, after the U. For instance, a smiley face is \N{U+263A}.
Alternatively, you can use the \x{...} notation for characters 0x100 and above. For characters below 0x100 you may get byte semantics instead of character semantics; see "The "Unicode Bug"". On EBCDIC machines there is the additional problem that the value for such characters gives the EBCDIC character rather than the Unicode one.
Additionally, if you
use charnames ':full';
you can use the \N{...} notation and put the official Unicode character name within the braces, such as \N{WHITE SMILING FACE}. See charnames.
• If an appropriate encoding is specified, identifiers within the Perl script may contain Unicode alphanumeric characters, including ideographs. Perl does not currently attempt to canonicalize variable names.
• Regular expressions match characters instead of bytes. "." matches a character instead of a byte.
• Character classes in regular expressions match characters instead of bytes and match against the character properties specified in the Unicode properties database. \w can be used to match a Japanese ideograph, for instance.
• Named Unicode properties, scripts, and block ranges may be used like character classes via the \p{} "matches property" construct and the \P{} negation, "doesn't match property". See "Unicode Character Properties" for more details.
You can define your own character properties and use them in the regular expression with the \p{} or \P{} construct. See "User-Defined Character Properties" for more details.
• The special pattern \X matches a logical character, an "extended grapheme cluster" in Standardese. In Unicode what appears to the user to be a single character, for example an accented G, may in fact be composed of a sequence of characters, in this case a G followed by an accent character. \X will match the entire sequence.
• The tr/// operator translates characters instead of bytes. Note that the tr///CU functionality has been removed. For similar functionality see pack('U0', ...) and pack('C0', ...).
• Case translation operators use the Unicode case translation tables when character input is provided. Note that uc(), or \U in interpolated strings, translates to uppercase, while ucfirst, or \u in interpolated strings, translates to titlecase in languages that make the distinction (which is equivalent to uppercase in languages without the distinction).
• Most operators that deal with positions or lengths in a string will automatically switch to using character positions, including chop(), chomp(), substr(), pos(), index(), rindex(), sprintf(), write(), and length(). An operator that specifically does not switch is vec(). Operators that really don't care include operators that treat strings as a bucket of bits such as sort(), and operators dealing with filenames.
• The pack()/unpack() letter C does not change, since it is often used for byte-oriented formats. Again, think char in the C language.
There is a new U specifier that converts between Unicode characters and code points. There is also a W specifier that is the equivalent of chr/ord and properly handles character values even if they are above 255.
• The chr() and ord() functions work on characters, similar to pack("W") and unpack("W"), not pack("C") and unpack("C"). pack("C") and unpack("C") are methods for emulating byte-oriented chr() and ord() on Unicode strings. While these methods reveal the internal encoding of Unicode strings, that is not something one normally needs to care about at all.
• The bit string operators, & | ^ ~, can operate on character data. However, for backward compatibility, such as when using bit string operations when characters are all less than 256 in ordinal value, one should not use ~ (the bit complement) with characters of both values less than 256 and values greater than 256. Most importantly, DeMorgan's laws (~($x|$y) eq ~$x&~$y and ~($x&$y) eq ~$x|~$y) will not hold. The reason for this mathematical faux pas is that the complement cannot return both the 8-bit (byte-wide) bit complement and the full character-wide bit complement.
• You can define your own mappings to be used in lc(), lcfirst(), uc(), and ucfirst() (or their string-inlined versions). See "User-Defined Case Mappings" for more details.
• And finally, scalar reverse() reverses by character rather than by byte.
Unicode Character Properties
Most Unicode character properties are accessible by using regular expressions. They are used like character classes via the \p{} "matches property" construct and the \P{} negation, "doesn't match property".
For instance, \p{Uppercase} matches any character with the Unicode "Uppercase" property, while \p{L} matches any character with a General_Category of "L" (letter) property. Brackets are not required for single letter properties, so \p{L} is equivalent to \pL.
More formally, \p{Uppercase} matches any character whose Unicode Uppercase property value is True, and \P{Uppercase} matches any character whose Uppercase property value is False, and they could have been written as \p{Uppercase=True} and \p{Uppercase=False}, respectively
This formality is needed when properties are not binary, that is if they can take on more values than just True and False. For example, the Bidi_Class (see "Bidirectional Character Types" below), can take on a number of different values, such as Left, Right, Whitespace, and others. To match these, one needs to specify the property name (Bidi_Class), and the value being matched against (Left, Right, etc.). This is done, as in the examples above, by having the two components separated by an equal sign (or interchangeably, a colon), like \p{Bidi_Class: Left}.
All Unicode-defined character properties may be written in these compound forms of \p{property=value} or \p{property:value}, but Perl provides some additional properties that are written only in the single form, as well as single-form short-cuts for all binary properties and certain others described below, in which you may omit the property name and the equals or colon separator.
Most Unicode character properties have at least two synonyms (or aliases if you prefer), a short one that is easier to type, and a longer one which is more descriptive and hence it is easier to understand what it means. Thus the "L" and "Letter" above are equivalent and can be used interchangeably. Likewise, "Upper" is a synonym for "Uppercase", and we could have written \p{Uppercase} equivalently as \p{Upper}. Also, there are typically various synonyms for the values the property can be. For binary properties, "True" has 3 synonyms: "T", "Yes", and "Y"; and "False has correspondingly "F", "No", and "N". But be careful. A short form of a value for one property may not mean the same thing as the same short form for another. Thus, for the General_Category property, "L" means "Letter", but for the Bidi_Class property, "L" means "Left". A complete list of properties and synonyms is in perluniprops.
Upper/lower case differences in the property names and values are irrelevant, thus \p{Upper} means the same thing as \p{upper} or even \p{UpPeR}. Similarly, you can add or subtract underscores anywhere in the middle of a word, so that these are also equivalent to \p{U_p_p_e_r}. And white space is irrelevant adjacent to non-word characters, such as the braces and the equals or colon separators so \p{ Upper } and \p{ Upper_case : Y } are equivalent to these as well. In fact, in most cases, white space and even hyphens can be added or deleted anywhere. So even \p{ Up-per case = Yes} is equivalent. All this is called "loose-matching" by Unicode. The few places where stricter matching is employed is in the middle of numbers, and the Perl extension properties that begin or end with an underscore. Stricter matching cares about white space (except adjacent to the non-word characters) and hyphens, and non-interior underscores.
You can also use negation in both \p{} and \P{} by introducing a caret (^) between the first brace and the property name: \p{^Tamil} is equal to \P{Tamil}.
General_Category
Every Unicode character is assigned a general category, which is the "most usual categorization of a character" (from http://www.unicode.org/reports/tr44).
The compound way of writing these is like \p{General_Category=Number} (short, \p{gc:n}). But Perl furnishes shortcuts in which everything up through the equal or colon separator is omitted. So you can instead just write \pN.
Here are the short and long forms of the General Category properties:
Short Long
L Letter
LC, L& Cased_Letter (that is: [\p{Ll}\p{Lu}\p{Lt}])
Lu Uppercase_Letter
Ll Lowercase_Letter
Lt Titlecase_Letter
Lm Modifier_Letter
Lo Other_Letter
M Mark
Mn Nonspacing_Mark
Mc Spacing_Mark
Me Enclosing_Mark
N Number
Nd Decimal_Number (also Digit)
Nl Letter_Number
No Other_Number
P Punctuation (also Punct)
Pc Connector_Punctuation
Pd Dash_Punctuation
Ps Open_Punctuation
Pe Close_Punctuation
Pi Initial_Punctuation
(may behave like Ps or Pe depending on usage)
Pf Final_Punctuation
(may behave like Ps or Pe depending on usage)
Po Other_Punctuation
S Symbol
Sm Math_Symbol
Sc Currency_Symbol
Sk Modifier_Symbol
So Other_Symbol
Z Separator
Zs Space_Separator
Zl Line_Separator
Zp Paragraph_Separator
C Other
Cc Control (also Cntrl)
Cf Format
Cs Surrogate (not usable)
Co Private_Use
Cn Unassigned
Single-letter properties match all characters in any of the two-letter sub-properties starting with the same letter. LC and L& are special cases, which are aliases for the set of Ll, Lu, and Lt.
Because Perl hides the need for the user to understand the internal representation of Unicode characters, there is no need to implement the somewhat messy concept of surrogates. Cs is therefore not supported.
Bidirectional Character Types
Because scripts differ in their directionality--Hebrew is written right to left, for example--Unicode supplies these properties in the Bidi_Class class:
Property Meaning
L Left-to-Right
LRE Left-to-Right Embedding
LRO Left-to-Right Override
R Right-to-Left
AL Arabic Letter
RLE Right-to-Left Embedding
RLO Right-to-Left Override
PDF Pop Directional Format
EN European Number
ES European Separator
ET European Terminator
AN Arabic Number
CS Common Separator
NSM Non-Spacing Mark
BN Boundary Neutral
B Paragraph Separator
S Segment Separator
WS Whitespace
ON Other Neutrals
This property is always written in the compound form. For example, \p{Bidi_Class:R} matches characters that are normally written right to left.
Scripts
The world's languages are written in a number of scripts. This sentence (unless you're reading it in translation) is written in Latin, while Russian is written in Cyrllic, and Greek is written in, well, Greek; Japanese mainly in Hiragana or Katakana. There are many more.
The Unicode Script property gives what script a given character is in, and can be matched with the compound form like \p{Script=Hebrew} (short: \p{sc=hebr}). Perl furnishes shortcuts for all script names. You can omit everything up through the equals (or colon), and simply write \p{Latin} or \P{Cyrillic}.
A complete list of scripts and their shortcuts is in perluniprops.
Use of "Is" Prefix
For backward compatibility (with Perl 5.6), all properties mentioned so far may have Is or Is_ prepended to their name, so \P{Is_Lu}, for example, is equal to \P{Lu}, and \p{IsScript:Arabic} is equal to \p{Arabic}.
Blocks
In addition to scripts, Unicode also defines blocks of characters. The difference between scripts and blocks is that the concept of scripts is closer to natural languages, while the concept of blocks is more of an artificial grouping based on groups of Unicode characters with consecutive ordinal values. For example, the "Basic Latin" block is all characters whose ordinals are between 0 and 127, inclusive, in other words, the ASCII characters. The "Latin" script contains some letters from this block as well as several more, like "Latin-1 Supplement", "Latin Extended-A", etc., but it does not contain all the characters from those blocks. It does not, for example, contain digits, because digits are shared across many scripts. Digits and similar groups, like punctuation, are in the script called Common. There is also a script called Inherited for characters that modify other characters, and inherit the script value of the controlling character.
For more about scripts versus blocks, see UAX#24 "Unicode Script Property": http://www.unicode.org/reports/tr24
The Script property is likely to be the one you want to use when processing natural language; the Block property may be useful in working with the nuts and bolts of Unicode.
Block names are matched in the compound form, like \p{Block: Arrows} or \p{Blk=Hebrew}. Unlike most other properties only a few block names have a Unicode-defined short name. But Perl does provide a (slight) shortcut: You can say, for example \p{In_Arrows} or \p{In_Hebrew}. For backwards compatibility, the In prefix may be omitted if there is no naming conflict with a script or any other property, and you can even use an Is prefix instead in those cases. But it is not a good idea to do this, for a couple reasons:
1. It is confusing. There are many naming conflicts, and you may forget some. For example, \p{Hebrew} means the script Hebrew, and NOT the block Hebrew. But would you remember that 6 months from now?
2. It is unstable. A new version of Unicode may pre-empt the current meaning by creating a property with the same name. There was a time in very early Unicode releases when \p{Hebrew} would have matched the block Hebrew; now it doesn't.
Some people just prefer to always use \p{Block: foo} and \p{Script: bar} instead of the shortcuts, for clarity, and because they can't remember the difference between 'In' and 'Is' anyway (or aren't confident that those who eventually will read their code will know).
A complete list of blocks and their shortcuts is in perluniprops.
Other Properties
There are many more properties than the very basic ones described here. A complete list is in perluniprops.
Unicode defines all its properties in the compound form, so all single-form properties are Perl extensions. A number of these are just synonyms for the Unicode ones, but some are genunine extensions, including a couple that are in the compound form. And quite a few of these are actually recommended by Unicode (in http://www.unicode.org/reports/tr18).
This section gives some details on all the extensions that aren't synonyms for compound-form Unicode properties (for those, you'll have to refer to the Unicode Standard.
\p{All}
This matches any of the 1_114_112 Unicode code points. It is a synonym for \p{Any}.
\p{Alnum}
This matches any \p{Alphabetic} or \p{Decimal_Number} character.
\p{Any}
This matches any of the 1_114_112 Unicode code points. It is a synonym for \p{All}.
\p{Assigned}
This matches any assigned code point; that is, any code point whose general category is not Unassigned (or equivalently, not Cn).
\p{Blank}
This is the same as \h and \p{HorizSpace}: A character that changes the spacing horizontally.
\p{Decomposition_Type: Non_Canonical} (Short: \p{Dt=NonCanon})
Matches a character that has a non-canonical decomposition.
To understand the use of this rarely used property=value combination, it is necessary to know some basics about decomposition. Consider a character, say H. It could appear with various marks around it, such as an acute accent, or a circumflex, or various hooks, circles, arrows, etc., above, below, to one side and/or the other, etc. There are many possibilities among the world's languages. The number of combinations is astronomical, and if there were a character for each combination, it would soon exhaust Unicode's more than a million possible characters. So Unicode took a different approach: there is a character for the base H, and a character for each of the possible marks, and they can be combined variously to get a final logical character. So a logical character--what appears to be a single character--can be a sequence of more than one individual characters. This is called an "extended grapheme cluster". (Perl furnishes the \X construct to match such sequences.)
But Unicode's intent is to unify the existing character set standards and practices, and a number of pre-existing standards have single characters that mean the same thing as some of these combinations. An example is ISO-8859-1, which has quite a few of these in the Latin-1 range, an example being "LATIN CAPITAL LETTER E WITH ACUTE". Because this character was in this pre-existing standard, Unicode added it to its repertoire. But this character is considered by Unicode to be equivalent to the sequence consisting of first the character "LATIN CAPITAL LETTER E", then the character "COMBINING ACUTE ACCENT".
"LATIN CAPITAL LETTER E WITH ACUTE" is called a "pre-composed" character, and the equivalence with the sequence is called canonical equivalence. All pre-composed characters are said to have a decomposition (into the equivalent sequence) and the decomposition type is also called canonical.
However, many more characters have a different type of decomposition, a "compatible" or "non-canonical" decomposition. The sequences that form these decompositions are not considered canonically equivalent to the pre-composed character. An example, again in the Latin-1 range, is the "SUPERSCRIPT ONE". It is kind of like a regular digit 1, but not exactly; its decomposition into the digit 1 is called a "compatible" decomposition, specifically a "super" decomposition. There are several such compatibility decompositions (see http://www.unicode.org/reports/tr44), including one called "compat" which means some miscellaneous type of decomposition that doesn't fit into the decomposition categories that Unicode has chosen.
Note that most Unicode characters don't have a decomposition, so their decomposition type is "None".
Perl has added the Non_Canonical type, for your convenience, to mean any of the compatibility decompositions.
\p{Graph}
Matches any character that is graphic. Theoretically, this means a character that on a printer would cause ink to be used.
\p{HorizSpace}
This is the same as \h and \p{Blank}: A character that changes the spacing horizontally.
\p{In=*}
This is a synonym for \p{Present_In=*}
\p{PerlSpace}
This is the same as \s, restricted to ASCII, namely [ \f\n\r\t].
Mnemonic: Perl's (original) space
\p{PerlWord}
This is the same as \w, restricted to ASCII, namely [A-Za-z0-9_]
Mnemonic: Perl's (original) word.
\p{PosixAlnum}
This matches any alphanumeric character in the ASCII range, namely [A-Za-z0-9].
\p{PosixAlpha}
This matches any alphabetic character in the ASCII range, namely [A-Za-z].
\p{PosixBlank}
This matches any blank character in the ASCII range, namely [ \t].
\p{PosixCntrl}
This matches any control character in the ASCII range, namely [\x00-\x1F\x7F]
\p{PosixDigit}
This matches any digit character in the ASCII range, namely [0-9].
\p{PosixGraph}
This matches any graphical character in the ASCII range, namely [\x21-\x7E].
\p{PosixLower}
This matches any lowercase character in the ASCII range, namely [a-z].
\p{PosixPrint}
This matches any printable character in the ASCII range, namely [\x20-\x7E]. These are the graphical characters plus SPACE.
\p{PosixPunct}
This matches any punctuation character in the ASCII range, namely [\x21-\x2F\x3A-\x40\x5B-\x60\x7B-\x7E]. These are the graphical characters that aren't word characters. Note that the Posix standard includes in its definition of punctuation, those characters that Unicode calls "symbols."
\p{PosixSpace}
This matches any space character in the ASCII range, namely [ \f\n\r\t\x0B] (the last being a vertical tab).
\p{PosixUpper}
This matches any uppercase character in the ASCII range, namely [A-Z].
\p{Present_In: *} (Short: \p{In=*})
This property is used when you need to know in what Unicode version(s) a character is.
The "*" above stands for some two digit Unicode version number, such as 1.1 or 4.0; or the "*" can also be Unassigned. This property will match the code points whose final disposition has been settled as of the Unicode release given by the version number; \p{Present_In: Unassigned} will match those code points whose meaning has yet to be assigned.
For example, U+0041 "LATIN CAPITAL LETTER A" was present in the very first Unicode release available, which is 1.1, so this property is true for all valid "*" versions. On the other hand, U+1EFF was not assigned until version 5.1 when it became "LATIN SMALL LETTER Y WITH LOOP", so the only "*" that would match it are 5.1, 5.2, and later.
Unicode furnishes the Age property from which this is derived. The problem with Age is that a strict interpretation of it (which Perl takes) has it matching the precise release a code point's meaning is introduced in. Thus U+0041 would match only 1.1; and U+1EFF only 5.1. This is not usually what you want.
Some non-Perl implementations of the Age property may change its meaning to be the same as the Perl Present_In property; just be aware of that.
Another confusion with both these properties is that the definition is not that the code point has been assigned, but that the meaning of the code point has been determined. This is because 66 code points will always be unassigned, and, so the Age for them is the Unicode version the decision to make them so was made in. For example, U+FDD0 is to be permanently unassigned to a character, and the decision to do that was made in version 3.1, so \p{Age=3.1} matches this character and \p{Present_In: 3.1} and up matches as well.
\p{Print}
This matches any character that is graphical or blank, except controls.
\p{SpacePerl}
This is the same as \s, including beyond ASCII.
Mnemonic: Space, as modified by Perl. (It doesn't include the vertical tab which both the Posix standard and Unicode consider to be space.)
\p{VertSpace}
This is the same as \v: A character that changes the spacing vertically.
\p{Word}
This is the same as \w, including beyond ASCII.
User-Defined Character Properties
You can define your own binary character properties by defining subroutines whose names begin with "In" or "Is". The subroutines can be defined in any package. The user-defined properties can be used in the regular expression \p and \P constructs; if you are using a user-defined property from a package other than the one you are in, you must specify its package in the \p or \P construct.
# assuming property Is_Foreign defined in Lang::
package main; # property package name required
if ($txt =~ /\p{Lang::IsForeign}+/) { ... }
package Lang; # property package name not required
if ($txt =~ /\p{IsForeign}+/) { ... }
Note that the effect is compile-time and immutable once defined.
The subroutines must return a specially-formatted string, with one or more newline-separated lines. Each line must be one of the following:
• A single hexadecimal number denoting a Unicode code point to include.
• Two hexadecimal numbers separated by horizontal whitespace (space or tabular characters) denoting a range of Unicode code points to include.
• Something to include, prefixed by "+": a built-in character property (prefixed by "utf8::") or a user-defined character property, to represent all the characters in that property; two hexadecimal code points for a range; or a single hexadecimal code point.
• Something to exclude, prefixed by "-": an existing character property (prefixed by "utf8::") or a user-defined character property, to represent all the characters in that property; two hexadecimal code points for a range; or a single hexadecimal code point.
• Something to negate, prefixed "!": an existing character property (prefixed by "utf8::") or a user-defined character property, to represent all the characters in that property; two hexadecimal code points for a range; or a single hexadecimal code point.
• Something to intersect with, prefixed by "&": an existing character property (prefixed by "utf8::") or a user-defined character property, for all the characters except the characters in the property; two hexadecimal code points for a range; or a single hexadecimal code point.
For example, to define a property that covers both the Japanese syllabaries (hiragana and katakana), you can define
sub InKana {
return <<END;
3040\t309F
30A0\t30FF
END
}
Imagine that the here-doc end marker is at the beginning of the line. Now you can use \p{InKana} and \P{InKana}.
You could also have used the existing block property names:
sub InKana {
return <<'END';
+utf8::InHiragana
+utf8::InKatakana
END
}
Suppose you wanted to match only the allocated characters, not the raw block ranges: in other words, you want to remove the non-characters:
sub InKana {
return <<'END';
+utf8::InHiragana
+utf8::InKatakana
-utf8::IsCn
END
}
The negation is useful for defining (surprise!) negated classes.
sub InNotKana {
return <<'END';
!utf8::InHiragana
-utf8::InKatakana
+utf8::IsCn
END
}
Intersection is useful for getting the common characters matched by two (or more) classes.
sub InFooAndBar {
return <<'END';
+main::Foo
&main::Bar
END
}
It's important to remember not to use "&" for the first set; that would be intersecting with nothing (resulting in an empty set).
User-Defined Case Mappings
You can also define your own mappings to be used in the lc(), lcfirst(), uc(), and ucfirst() (or their string-inlined versions). The principle is similar to that of user-defined character properties: to define subroutines with names like ToLower (for lc() and lcfirst()), ToTitle (for the first character in ucfirst()), and ToUpper (for uc(), and the rest of the characters in ucfirst()).
The string returned by the subroutines needs to be two hexadecimal numbers separated by two tabulators: the two numbers being, respectively, the source code point and the destination code point. For example:
sub ToUpper {
return <<END;
0061\t\t0041
END
}
defines an uc() mapping that causes only the character "a" to be mapped to "A"; all other characters will remain unchanged.
(For serious hackers only) The above means you have to furnish a complete mapping; you can't just override a couple of characters and leave the rest unchanged. You can find all the mappings in the directory $Config{privlib}/unicore/To/. The mapping data is returned as the here-document, and the utf8::ToSpecFoo are special exception mappings derived from <$Config{privlib}>/unicore/SpecialCasing.txt. The "Digit" and "Fold" mappings that one can see in the directory are not directly user-accessible, one can use either the Unicode::UCD module, or just match case-insensitively (that's when the "Fold" mapping is used).
The mappings will only take effect on scalars that have been marked as having Unicode characters, for example by using utf8::upgrade(). Old byte-style strings are not affected.
The mappings are in effect for the package they are defined in.
Character Encodings for Input and Output
See Encode.
Unicode Regular Expression Support Level
The following list of Unicode support for regular expressions describes all the features currently supported. The references to "Level N" and the section numbers refer to the Unicode Technical Standard #18, "Unicode Regular Expressions", version 11, in May 2005.
• Level 1 - Basic Unicode Support
RL1.1 Hex Notation - done [1]
RL1.2 Properties - done [2][3]
RL1.2a Compatibility Properties - done [4]
RL1.3 Subtraction and Intersection - MISSING [5]
RL1.4 Simple Word Boundaries - done [6]
RL1.5 Simple Loose Matches - done [7]
RL1.6 Line Boundaries - MISSING [8]
RL1.7 Supplementary Code Points - done [9]
[1] \x{...}
[2] \p{...} \P{...}
[3] supports not only minimal list, but all Unicode character
properties (see L</Unicode Character Properties>)
[4] \d \D \s \S \w \W \X [:prop:] [:^prop:]
[5] can use regular expression look-ahead [a] or
user-defined character properties [b] to emulate set operations
[6] \b \B
[7] note that Perl does Full case-folding in matching (but with bugs),
not Simple: for example U+1F88 is equivalent to U+1F00 U+03B9,
not with 1F80. This difference matters mainly for certain Greek
capital letters with certain modifiers: the Full case-folding
decomposes the letter, while the Simple case-folding would map
it to a single character.
[8] should do ^ and $ also on U+000B (\v in C), FF (\f), CR (\r),
CRLF (\r\n), NEL (U+0085), LS (U+2028), and PS (U+2029);
should also affect <>, $., and script line numbers;
should not split lines within CRLF [c] (i.e. there is no empty
line between \r and \n)
[9] UTF-8/UTF-EBDDIC used in perl allows not only U+10000 to U+10FFFF
but also beyond U+10FFFF [d]
[a] You can mimic class subtraction using lookahead. For example, what UTS#18 might write as
[{Greek}-[{UNASSIGNED}]]
in Perl can be written as:
(?!\p{Unassigned})\p{InGreekAndCoptic}
(?=\p{Assigned})\p{InGreekAndCoptic}
But in this particular example, you probably really want
\p{GreekAndCoptic}
which will match assigned characters known to be part of the Greek script.
Also see the Unicode::Regex::Set module, it does implement the full UTS#18 grouping, intersection, union, and removal (subtraction) syntax.
[b] '+' for union, '-' for removal (set-difference), '&' for intersection (see "User-Defined Character Properties")
[c] Try the :crlf layer (see PerlIO).
[d] U+FFFF will currently generate a warning message if 'utf8' warnings are enabled
• Level 2 - Extended Unicode Support
RL2.1 Canonical Equivalents - MISSING [10][11]
RL2.2 Default Grapheme Clusters - MISSING [12]
RL2.3 Default Word Boundaries - MISSING [14]
RL2.4 Default Loose Matches - MISSING [15]
RL2.5 Name Properties - MISSING [16]
RL2.6 Wildcard Properties - MISSING
[10] see UAX#15 "Unicode Normalization Forms"
[11] have Unicode::Normalize but not integrated to regexes
[12] have \X but we don't have a "Grapheme Cluster Mode"
[14] see UAX#29, Word Boundaries
[15] see UAX#21 "Case Mappings"
[16] have \N{...} but neither compute names of CJK Ideographs
and Hangul Syllables nor use a loose match [e]
[e] \N{...} allows namespaces (see charnames).
• Level 3 - Tailored Support
RL3.1 Tailored Punctuation - MISSING
RL3.2 Tailored Grapheme Clusters - MISSING [17][18]
RL3.3 Tailored Word Boundaries - MISSING
RL3.4 Tailored Loose Matches - MISSING
RL3.5 Tailored Ranges - MISSING
RL3.6 Context Matching - MISSING [19]
RL3.7 Incremental Matches - MISSING
( RL3.8 Unicode Set Sharing )
RL3.9 Possible Match Sets - MISSING
RL3.10 Folded Matching - MISSING [20]
RL3.11 Submatchers - MISSING
[17] see UAX#10 "Unicode Collation Algorithms"
[18] have Unicode::Collate but not integrated to regexes
[19] have (?<=x) and (?=x), but look-aheads or look-behinds should see
outside of the target substring
[20] need insensitive matching for linguistic features other than case;
for example, hiragana to katakana, wide and narrow, simplified Han
to traditional Han (see UTR#30 "Character Foldings")
Unicode Encodings
Unicode characters are assigned to code points, which are abstract numbers. To use these numbers, various encodings are needed.
• UTF-8
UTF-8 is a variable-length (1 to 6 bytes, current character allocations require 4 bytes), byte-order independent encoding. For ASCII (and we really do mean 7-bit ASCII, not another 8-bit encoding), UTF-8 is transparent.
The following table is from Unicode 3.2.
Code Points 1st Byte 2nd Byte 3rd Byte 4th Byte
U+0000..U+007F 00..7F
U+0080..U+07FF * C2..DF 80..BF
U+0800..U+0FFF E0 * A0..BF 80..BF
U+1000..U+CFFF E1..EC 80..BF 80..BF
U+D000..U+D7FF ED 80..9F 80..BF
U+D800..U+DFFF +++++++ utf16 surrogates, not legal utf8 +++++++
U+E000..U+FFFF EE..EF 80..BF 80..BF
U+10000..U+3FFFF F0 * 90..BF 80..BF 80..BF
U+40000..U+FFFFF F1..F3 80..BF 80..BF 80..BF
U+100000..U+10FFFF F4 80..8F 80..BF 80..BF
Note the gaps before several of the byte entries above marked by '*'. These are caused by legal UTF-8 avoiding non-shortest encodings: it is technically possible to UTF-8-encode a single code point in different ways, but that is explicitly forbidden, and the shortest possible encoding should always be used (and that is what Perl does).
Another way to look at it is via bits:
Code Points 1st Byte 2nd Byte 3rd Byte 4th Byte
0aaaaaaa 0aaaaaaa
00000bbbbbaaaaaa 110bbbbb 10aaaaaa
ccccbbbbbbaaaaaa 1110cccc 10bbbbbb 10aaaaaa
00000dddccccccbbbbbbaaaaaa 11110ddd 10cccccc 10bbbbbb 10aaaaaa
As you can see, the continuation bytes all begin with "10", and the leading bits of the start byte tell how many bytes there are in the encoded character.
• UTF-EBCDIC
Like UTF-8 but EBCDIC-safe, in the way that UTF-8 is ASCII-safe.
• UTF-16, UTF-16BE, UTF-16LE, Surrogates, and BOMs (Byte Order Marks)
The followings items are mostly for reference and general Unicode knowledge, Perl doesn't use these constructs internally.
UTF-16 is a 2 or 4 byte encoding. The Unicode code points U+0000..U+FFFF are stored in a single 16-bit unit, and the code points U+10000..U+10FFFF in two 16-bit units. The latter case is using surrogates, the first 16-bit unit being the high surrogate, and the second being the low surrogate.
Surrogates are code points set aside to encode the U+10000..U+10FFFF range of Unicode code points in pairs of 16-bit units. The high surrogates are the range U+D800..U+DBFF and the low surrogates are the range U+DC00..U+DFFF. The surrogate encoding is
$hi = ($uni - 0x10000) / 0x400 + 0xD800;
$lo = ($uni - 0x10000) % 0x400 + 0xDC00;
and the decoding is
$uni = 0x10000 + ($hi - 0xD800) * 0x400 + ($lo - 0xDC00);
If you try to generate surrogates (for example by using chr()), you will get a warning, if warnings are turned on, because those code points are not valid for a Unicode character.
Because of the 16-bitness, UTF-16 is byte-order dependent. UTF-16 itself can be used for in-memory computations, but if storage or transfer is required either UTF-16BE (big-endian) or UTF-16LE (little-endian) encodings must be chosen.
This introduces another problem: what if you just know that your data is UTF-16, but you don't know which endianness? Byte Order Marks, or BOMs, are a solution to this. A special character has been reserved in Unicode to function as a byte order marker: the character with the code point U+FEFF is the BOM.
The trick is that if you read a BOM, you will know the byte order, since if it was written on a big-endian platform, you will read the bytes 0xFE 0xFF, but if it was written on a little-endian platform, you will read the bytes 0xFF 0xFE. (And if the originating platform was writing in UTF-8, you will read the bytes 0xEF 0xBB 0xBF.)
The way this trick works is that the character with the code point U+FFFE is guaranteed not to be a valid Unicode character, so the sequence of bytes 0xFF 0xFE is unambiguously "BOM, represented in little-endian format" and cannot be U+FFFE, represented in big-endian format". (Actually, U+FFFE is legal for use by your program, even for input/output, but better not use it if you need a BOM. But it is "illegal for interchange", so that an unsuspecting program won't get confused.)
• UTF-32, UTF-32BE, UTF-32LE
The UTF-32 family is pretty much like the UTF-16 family, expect that the units are 32-bit, and therefore the surrogate scheme is not needed. The BOM signatures will be 0x00 0x00 0xFE 0xFF for BE and 0xFF 0xFE 0x00 0x00 for LE.
• UCS-2, UCS-4
Encodings defined by the ISO 10646 standard. UCS-2 is a 16-bit encoding. Unlike UTF-16, UCS-2 is not extensible beyond U+FFFF, because it does not use surrogates. UCS-4 is a 32-bit encoding, functionally identical to UTF-32.
• UTF-7
A seven-bit safe (non-eight-bit) encoding, which is useful if the transport or storage is not eight-bit safe. Defined by RFC 2152.
Security Implications of Unicode
Read Unicode Security Considerations. Also, note the following:
• Malformed UTF-8
Unfortunately, the specification of UTF-8 leaves some room for interpretation of how many bytes of encoded output one should generate from one input Unicode character. Strictly speaking, the shortest possible sequence of UTF-8 bytes should be generated, because otherwise there is potential for an input buffer overflow at the receiving end of a UTF-8 connection. Perl always generates the shortest length UTF-8, and with warnings on, Perl will warn about non-shortest length UTF-8 along with other malformations, such as the surrogates, which are not real Unicode code points.
• Regular expressions behave slightly differently between byte data and character (Unicode) data. For example, the "word character" character class \w will work differently depending on if data is eight-bit bytes or Unicode.
In the first case, the set of \w characters is either small--the default set of alphabetic characters, digits, and the "_"--or, if you are using a locale (see perllocale), the \w might contain a few more letters according to your language and country.
In the second case, the \w set of characters is much, much larger. Most importantly, even in the set of the first 256 characters, it will probably match different characters: unlike most locales, which are specific to a language and country pair, Unicode classifies all the characters that are letters somewhere as \w. For example, your locale might not think that LATIN SMALL LETTER ETH is a letter (unless you happen to speak Icelandic), but Unicode does.
As discussed elsewhere, Perl has one foot (two hooves?) planted in each of two worlds: the old world of bytes and the new world of characters, upgrading from bytes to characters when necessary. If your legacy code does not explicitly use Unicode, no automatic switch-over to characters should happen. Characters shouldn't get downgraded to bytes, either. It is possible to accidentally mix bytes and characters, however (see perluniintro), in which case \w in regular expressions might start behaving differently. Review your code. Use warnings and the strict pragma.
Unicode in Perl on EBCDIC
The way Unicode is handled on EBCDIC platforms is still experimental. On such platforms, references to UTF-8 encoding in this document and elsewhere should be read as meaning the UTF-EBCDIC specified in Unicode Technical Report 16, unless ASCII vs. EBCDIC issues are specifically discussed. There is no utfebcdic pragma or ":utfebcdic" layer; rather, "utf8" and ":utf8" are reused to mean the platform's "natural" 8-bit encoding of Unicode. See perlebcdic for more discussion of the issues.
Locales
Usually locale settings and Unicode do not affect each other, but there are a couple of exceptions:
• You can enable automatic UTF-8-ification of your standard file handles, default open() layer, and @ARGV by using either the -C command line switch or the PERL_UNICODE environment variable, see perlrun for the documentation of the -C switch.
• Perl tries really hard to work both with Unicode and the old byte-oriented world. Most often this is nice, but sometimes Perl's straddling of the proverbial fence causes problems.
When Unicode Does Not Happen
While Perl does have extensive ways to input and output in Unicode, and few other 'entry points' like the @ARGV which can be interpreted as Unicode (UTF-8), there still are many places where Unicode (in some encoding or another) could be given as arguments or received as results, or both, but it is not.
The following are such interfaces. Also, see "The "Unicode Bug"". For all of these interfaces Perl currently (as of 5.8.3) simply assumes byte strings both as arguments and results, or UTF-8 strings if the encoding pragma has been used.
One reason why Perl does not attempt to resolve the role of Unicode in these cases is that the answers are highly dependent on the operating system and the file system(s). For example, whether filenames can be in Unicode, and in exactly what kind of encoding, is not exactly a portable concept. Similarly for the qx and system: how well will the 'command line interface' (and which of them?) handle Unicode?
• chdir, chmod, chown, chroot, exec, link, lstat, mkdir, rename, rmdir, stat, symlink, truncate, unlink, utime, -X
• %ENV
• glob (aka the <*>)
• open, opendir, sysopen
• qx (aka the backtick operator), system
• readdir, readlink
The "Unicode Bug"
The term, the "Unicode bug" has been applied to an inconsistency with the Unicode characters whose ordinals are in the Latin-1 Supplement block, that is, between 128 and 255. Without a locale specified, unlike all other characters or code points, these characters have very different semantics in byte semantics versus character semantics.
In character semantics they are interpreted as Unicode code points, which means they have the same semantics as Latin-1 (ISO-8859-1).
In byte semantics, they are considered to be unassigned characters, meaning that the only semantics they have is their ordinal numbers, and that they are not members of various character classes. None are considered to match \w for example, but all match \W. (On EBCDIC platforms, the behavior may be different from this, depending on the underlying C language library functions.)
The behavior is known to have effects on these areas:
• Changing the case of a scalar, that is, using uc(), ucfirst(), lc(), and lcfirst(), or \L, \U, \u and \l in regular expression substitutions.
• Using caseless (/i) regular expression matching
• Matching a number of properties in regular expressions, such as \w
• User-defined case change mappings. You can create a ToUpper() function, for example, which overrides Perl's built-in case mappings. The scalar must be encoded in utf8 for your function to actually be invoked.
This behavior can lead to unexpected results in which a string's semantics suddenly change if a code point above 255 is appended to or removed from it, which changes the string's semantics from byte to character or vice versa. As an example, consider the following program and its output:
$ perl -le'
$s1 = "\xC2";
$s2 = "\x{2660}";
for ($s1, $s2, $s1.$s2) {
print /\w/ || 0;
}
'
0
0
1
If there's no \w in s1 or in s2, why does their concatenation have one?
This anomaly stems from Perl's attempt to not disturb older programs that didn't use Unicode, and hence had no semantics for characters outside of the ASCII range (except in a locale), along with Perl's desire to add Unicode support seamlessly. The result wasn't seamless: these characters were orphaned.
Work is being done to correct this, but only some of it was complete in time for the 5.12 release. What has been finished is the important part of the case changing component. Due to concerns, and some evidence, that older code might have come to rely on the existing behavior, the new behavior must be explicitly enabled by the feature unicode_strings in the feature pragma, even though no new syntax is involved.
See "lc" in perlfunc for details on how this pragma works in combination with various others for casing. Even though the pragma only affects casing operations in the 5.12 release, it is planned to have it affect all the problematic behaviors in later releases: you can't have one without them all.
In the meantime, a workaround is to always call utf8::upgrade($string), or to use the standard module Encode. Also, a scalar that has any characters whose ordinal is above 0x100, or which were specified using either of the \N{...} notations will automatically have character semantics.
Forcing Unicode in Perl (Or Unforcing Unicode in Perl)
Sometimes (see "When Unicode Does Not Happen" or "The "Unicode Bug"") there are situations where you simply need to force a byte string into UTF-8, or vice versa. The low-level calls utf8::upgrade($bytestring) and utf8::downgrade($utf8string[, FAIL_OK]) are the answers.
Note that utf8::downgrade() can fail if the string contains characters that don't fit into a byte.
Calling either function on a string that already is in the desired state is a no-op.
Using Unicode in XS
If you want to handle Perl Unicode in XS extensions, you may find the following C APIs useful. See also "Unicode Support" in perlguts for an explanation about Unicode at the XS level, and perlapi for the API details.
• DO_UTF8(sv) returns true if the UTF8 flag is on and the bytes pragma is not in effect. SvUTF8(sv) returns true if the UTF8 flag is on; the bytes pragma is ignored. The UTF8 flag being on does not mean that there are any characters of code points greater than 255 (or 127) in the scalar or that there are even any characters in the scalar. What the UTF8 flag means is that the sequence of octets in the representation of the scalar is the sequence of UTF-8 encoded code points of the characters of a string. The UTF8 flag being off means that each octet in this representation encodes a single character with code point 0..255 within the string. Perl's Unicode model is not to use UTF-8 until it is absolutely necessary.
• uvchr_to_utf8(buf, chr) writes a Unicode character code point into a buffer encoding the code point as UTF-8, and returns a pointer pointing after the UTF-8 bytes. It works appropriately on EBCDIC machines.
• utf8_to_uvchr(buf, lenp) reads UTF-8 encoded bytes from a buffer and returns the Unicode character code point and, optionally, the length of the UTF-8 byte sequence. It works appropriately on EBCDIC machines.
• utf8_length(start, end) returns the length of the UTF-8 encoded buffer in characters. sv_len_utf8(sv) returns the length of the UTF-8 encoded scalar.
• sv_utf8_upgrade(sv) converts the string of the scalar to its UTF-8 encoded form. sv_utf8_downgrade(sv) does the opposite, if possible. sv_utf8_encode(sv) is like sv_utf8_upgrade except that it does not set the UTF8 flag. sv_utf8_decode() does the opposite of sv_utf8_encode(). Note that none of these are to be used as general-purpose encoding or decoding interfaces: use Encode for that. sv_utf8_upgrade() is affected by the encoding pragma but sv_utf8_downgrade() is not (since the encoding pragma is designed to be a one-way street).
• is_utf8_char(s) returns true if the pointer points to a valid UTF-8 character.
• is_utf8_string(buf, len) returns true if len bytes of the buffer are valid UTF-8.
• UTF8SKIP(buf) will return the number of bytes in the UTF-8 encoded character in the buffer. UNISKIP(chr) will return the number of bytes required to UTF-8-encode the Unicode character code point. UTF8SKIP() is useful for example for iterating over the characters of a UTF-8 encoded buffer; UNISKIP() is useful, for example, in computing the size required for a UTF-8 encoded buffer.
• utf8_distance(a, b) will tell the distance in characters between the two pointers pointing to the same UTF-8 encoded buffer.
• utf8_hop(s, off) will return a pointer to a UTF-8 encoded buffer that is off (positive or negative) Unicode characters displaced from the UTF-8 buffer s. Be careful not to overstep the buffer: utf8_hop() will merrily run off the end or the beginning of the buffer if told to do so.
• pv_uni_display(dsv, spv, len, pvlim, flags) and sv_uni_display(dsv, ssv, pvlim, flags) are useful for debugging the output of Unicode strings and scalars. By default they are useful only for debugging--they display all characters as hexadecimal code points--but with the flags UNI_DISPLAY_ISPRINT, UNI_DISPLAY_BACKSLASH, and UNI_DISPLAY_QQ you can make the output more readable.
• ibcmp_utf8(s1, pe1, l1, u1, s2, pe2, l2, u2) can be used to compare two strings case-insensitively in Unicode. For case-sensitive comparisons you can just use memEQ() and memNE() as usual.
For more information, see perlapi, and utf8.c and utf8.h in the Perl source code distribution.
Hacking Perl to work on earlier Unicode versions (for very serious hackers only)
Perl by default comes with the latest supported Unicode version built in, but you can change to use any earlier one.
Download the files in the version of Unicode that you want from the Unicode web site http://www.unicode.org). These should replace the existing files in \$Config{privlib}/unicore. (\%Config is available from the Config module.) Follow the instructions in README.perl in that directory to change some of their names, and then run make.
It is even possible to download them to a different directory, and then change utf8_heavy.pl in the directory \$Config{privlib} to point to the new directory, or maybe make a copy of that directory before making the change, and using @INC or the -I run-time flag to switch between versions at will (but because of caching, not in the middle of a process), but all this is beyond the scope of these instructions.
BUGS
Interaction with Locales
Use of locales with Unicode data may lead to odd results. Currently, Perl attempts to attach 8-bit locale info to characters in the range 0..255, but this technique is demonstrably incorrect for locales that use characters above that range when mapped into Unicode. Perl's Unicode support will also tend to run slower. Use of locales with Unicode is discouraged.
Problems with characters in the Latin-1 Supplement range
See "The "Unicode Bug""
Problems with case-insensitive regular expression matching
There are problems with case-insensitive matches, including those involving character classes (enclosed in [square brackets]), characters whose fold is to multiple characters (such as the single character LATIN SMALL LIGATURE FFL matches case-insensitively with the 3-character string ffl), and characters in the Latin-1 Supplement.
Interaction with Extensions
When Perl exchanges data with an extension, the extension should be able to understand the UTF8 flag and act accordingly. If the extension doesn't know about the flag, it's likely that the extension will return incorrectly-flagged data.
So if you're working with Unicode data, consult the documentation of every module you're using if there are any issues with Unicode data exchange. If the documentation does not talk about Unicode at all, suspect the worst and probably look at the source to learn how the module is implemented. Modules written completely in Perl shouldn't cause problems. Modules that directly or indirectly access code written in other programming languages are at risk.
For affected functions, the simple strategy to avoid data corruption is to always make the encoding of the exchanged data explicit. Choose an encoding that you know the extension can handle. Convert arguments passed to the extensions to that encoding and convert results back from that encoding. Write wrapper functions that do the conversions for you, so you can later change the functions when the extension catches up.
To provide an example, let's say the popular Foo::Bar::escape_html function doesn't deal with Unicode data yet. The wrapper function would convert the argument to raw UTF-8 and convert the result back to Perl's internal representation like so:
sub my_escape_html ($) {
my($what) = shift;
return unless defined $what;
Encode::decode_utf8(Foo::Bar::escape_html(Encode::encode_utf8($what)));
}
Sometimes, when the extension does not convert data but just stores and retrieves them, you will be in a position to use the otherwise dangerous Encode::_utf8_on() function. Let's say the popular Foo::Bar extension, written in C, provides a param method that lets you store and retrieve data according to these prototypes:
$self->param($name, $value); # set a scalar
$value = $self->param($name); # retrieve a scalar
If it does not yet provide support for any encoding, one could write a derived class with such a param method:
sub param {
my($self,$name,$value) = @_;
utf8::upgrade($name); # make sure it is UTF-8 encoded
if (defined $value) {
utf8::upgrade($value); # make sure it is UTF-8 encoded
return $self->SUPER::param($name,$value);
} else {
my $ret = $self->SUPER::param($name);
Encode::_utf8_on($ret); # we know, it is UTF-8 encoded
return $ret;
}
}
Some extensions provide filters on data entry/exit points, such as DB_File::filter_store_key and family. Look out for such filters in the documentation of your extensions, they can make the transition to Unicode data much easier.
Speed
Some functions are slower when working on UTF-8 encoded strings than on byte encoded strings. All functions that need to hop over characters such as length(), substr() or index(), or matching regular expressions can work much faster when the underlying data are byte-encoded.
In Perl 5.8.0 the slowness was often quite spectacular; in Perl 5.8.1 a caching scheme was introduced which will hopefully make the slowness somewhat less spectacular, at least for some operations. In general, operations with UTF-8 encoded strings are still slower. As an example, the Unicode properties (character classes) like \p{Nd} are known to be quite a bit slower (5-20 times) than their simpler counterparts like \d (then again, there 268 Unicode characters matching Nd compared with the 10 ASCII characters matching d).
Problems on EBCDIC platforms
There are a number of known problems with Perl on EBCDIC platforms. If you want to use Perl there, send email to [email protected].
In earlier versions, when byte and character data were concatenated, the new string was sometimes created by decoding the byte strings as ISO 8859-1 (Latin-1), even if the old Unicode string used EBCDIC.
If you find any of these, please report them as bugs.
Porting code from perl-5.6.X
Perl 5.8 has a different Unicode model from 5.6. In 5.6 the programmer was required to use the utf8 pragma to declare that a given scope expected to deal with Unicode data and had to make sure that only Unicode data were reaching that scope. If you have code that is working with 5.6, you will need some of the following adjustments to your code. The examples are written such that the code will continue to work under 5.6, so you should be safe to try them out.
• A filehandle that should read or write UTF-8
if ($] > 5.007) {
binmode $fh, ":encoding(utf8)";
}
• A scalar that is going to be passed to some extension
Be it Compress::Zlib, Apache::Request or any extension that has no mention of Unicode in the manpage, you need to make sure that the UTF8 flag is stripped off. Note that at the time of this writing (October 2002) the mentioned modules are not UTF-8-aware. Please check the documentation to verify if this is still true.
if ($] > 5.007) {
require Encode;
$val = Encode::encode_utf8($val); # make octets
}
• A scalar we got back from an extension
If you believe the scalar comes back as UTF-8, you will most likely want the UTF8 flag restored:
if ($] > 5.007) {
require Encode;
$val = Encode::decode_utf8($val);
}
• Same thing, if you are really sure it is UTF-8
if ($] > 5.007) {
require Encode;
Encode::_utf8_on($val);
}
• A wrapper for fetchrow_array and fetchrow_hashref
When the database contains only UTF-8, a wrapper function or method is a convenient way to replace all your fetchrow_array and fetchrow_hashref calls. A wrapper function will also make it easier to adapt to future enhancements in your database driver. Note that at the time of this writing (October 2002), the DBI has no standardized way to deal with UTF-8 data. Please check the documentation to verify if that is still true.
sub fetchrow {
my($self, $sth, $what) = @_; # $what is one of fetchrow_{array,hashref}
if ($] < 5.007) {
return $sth->$what;
} else {
require Encode;
if (wantarray) {
my @arr = $sth->$what;
for (@arr) {
defined && /[^\000-\177]/ && Encode::_utf8_on($_);
}
return @arr;
} else {
my $ret = $sth->$what;
if (ref $ret) {
for my $k (keys %$ret) {
defined && /[^\000-\177]/ && Encode::_utf8_on($_) for $ret->{$k};
}
return $ret;
} else {
defined && /[^\000-\177]/ && Encode::_utf8_on($_) for $ret;
return $ret;
}
}
}
}
• A large scalar that you know can only contain ASCII
Scalars that contain only ASCII and are marked as UTF-8 are sometimes a drag to your program. If you recognize such a situation, just remove the UTF8 flag:
utf8::downgrade($val) if $] > 5.007;
SEE ALSO
perlunitut, perluniintro, perluniprops, Encode, open, utf8, bytes, perlretut, "${^UNICODE}" in perlvar http://www.unicode.org/reports/tr44).
|
__label__pos
| 0.781616 |
Stack Exchange Network
Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Questions tagged [iframe]
This tag should be used to differentiate questions about the HTML element that creates an "inline frame" within a document from other questions. Use when the topic is displaying a separate document within the same page.
0
votes
0answers
11 views
Google Spreadsheet: A replacement for Excel Camera Function
I'm getting into Google Spreadsheet after using Excel only for years. While I'm happy with it, there are some parts of Excel I haven't been able to replace. One of those is the Excel Camera function. ...
0
votes
2answers
367 views
How can I display the events from two Google Calendars in a single iframe?
I have two Google Calendars on the same account. I've already set them to public and retrieved their embed codes from the "Integrate calendar" section. I want to display the events from these two ...
2
votes
1answer
21 views
How to open an element, such as a picture, in an iframe on a Google Books webpage (or the iframe itself), in a new tab?
Google Books pages seem to have a resistance against opening the content of their iframe in a new window or tab. Right-clicking in the iframe, or particularly on a picture in the iframe, does not work....
1
vote
2answers
287 views
Force embedded YouTube videos to play at specific quality resolution
Is there a way to force embedded YouTube videos on any site I visit to play at a specific quality? Specifically I'm trying to have a Weebl and Bob marathon, making sure I see every episode by ...
2
votes
0answers
505 views
Allow cross-origin for X-Frame-Options
I get this error message in my console when loading a widget displaying ads on my Blogger blog: Load denied by X-Frame-Options: <ext-url> does not permit cross-origin framing. How can I allow ...
0
votes
1answer
836 views
Skydrive embed code not removing vertical scroll bar?
I'm attempting to add an excel spreadsheet (ROI Calculator) onto our website. I've come across this fix to use Microsoft's Skydrive app. http://www.microsoft.com/web/solutions/excel-embed.aspx So I'...
13
votes
2answers
32k views
Embed iFrame in Google presentation
Is it possible to embed a website in an iFrame inside a Google presentation in Google Docs/Drive? I tried it, looked through all menus and submenus but couldn't find an option which lets me embed web-...
2
votes
2answers
18k views
How can I show Marker on Google Maps in URL?
Here I'm using an iFrame and passing one URL with dynamic latitude/longitude: <iframe width="270" height="250" frameborder="0" scrolling="no" marginheight="0" marginwidth="0" src="http://maps....
1
vote
3answers
8k views
How can I include iframes in an eBay listing?
When I try and post a listing on eBay it tells me I can't use iframe: — but all the professional listings I see have iframes... What's the catch? How can I add iframes to my eBay listings as well?
0
votes
1answer
1k views
Facebook like box for page (social plugin) blank when logged in as page - real Facebook bug or not? And remedy?
I've noticed that Facebook like box for a page (social plugin) is blank when I am logged into Facebook as a page that I am admin. This happens for my page and for other sites. When I am logged into ...
7
votes
3answers
3k views
Why is Gmail in an iFrame?
I would like for someone to explain the reason that Google's Gmail is placed inside of an iFrame HTML element instead of simply placing the code in the document itself.
10
votes
3answers
40k views
Is it possible to include an iframe in a Gmail message?
Is it possible to include a web page in a Gmail message? The reason I'm asking is that sometimes I have a Google Docs form I want to send to people and was wondering if I can embed the form in my ...
|
__label__pos
| 0.696809 |
8.2.x database.inc db_like($string)
8.0.x database.inc db_like($string)
8.1.x database.inc db_like($string)
7.x database.inc db_like($string)
Escapes characters that work as wildcard characters in a LIKE pattern.
The wildcard characters "%" and "_" as well as backslash are prefixed with a backslash. Use this to do a search for a verbatim string without any wildcard behavior.
For example, the following does a case-insensitive query for all rows whose name starts with $prefix:
$result = db_query(
'SELECT * FROM person WHERE name LIKE :pattern',
array(':pattern' => db_like($prefix) . '%')
);
Backslash is defined as escape character for LIKE patterns in DatabaseCondition::mapConditionOperator().
Parameters
$string: The string to escape.
Return value
The escaped string.
Related topics
19 calls to db_like()
comment_form_validate in modules/comment/comment.module
Validate comment form submissions.
DatabaseBasicSyntaxTestCase::testLikeBackslash in modules/simpletest/tests/database_test.test
Test LIKE query containing a backslash.
DatabaseBasicSyntaxTestCase::testLikeEscape in modules/simpletest/tests/database_test.test
Test escaping of LIKE wildcards.
DrupalDatabaseCache::clear in includes/cache.inc
Implements DrupalCacheInterface::clear().
EntityFieldQuery::addCondition in includes/entity.inc
Adds a condition to an already built SelectQuery (internal function).
... See full list
File
includes/database/database.inc, line 2669
Core systems for the database layer.
Code
function db_like($string) {
return Database::getConnection()->escapeLike($string);
}
Comments
Dave Reid’s picture
You have to use db_like() with a query builder (like db_select()) and not the simple db_query() function otherwise your query will not work. See http://drupal.org/node/1182428 for more details.
aendrew’s picture
Despite that issue even noting there's an invalid example on this page, it still has not yet been updated -- like, a year later. Silly.
Here's an example how to actually use it. From the Drupal 8 API page:
$result = db_select('person', 'p')
->fields('p')
->condition('name', db_like($prefix) . '%', 'LIKE')
->execute()
->fetchAll();
gkgaurav10’s picture
as of Drupal 8.0.x, will be removed in Drupal 9.0.0. Instead, get a database connection injected into your service from the container and call escapeLike() on it. For example, $injected_database->escapeLike($string);
SlashCrew’s picture
an example
$search_string ="per";
$result = db_query('SELECT title
FROM {node} n
WHERE n.title like :title'
,array(':title' => "%".$search_string."%"))
->fetchAll();
print_r($result);
tenken’s picture
This example is wrong, if simply because you're not escaping/checking $search_string.
|
__label__pos
| 0.70098 |
Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.
Patents
1. Advanced Patent Search
Publication numberUS3706941 A
Publication typeGrant
Publication date19 Dec 1972
Filing date28 Oct 1970
Priority date28 Oct 1970
Publication numberUS 3706941 A, US 3706941A, US-A-3706941, US3706941 A, US3706941A
InventorsCohn Charles E
Original AssigneeAtomic Energy Commission
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Random number generator
US 3706941 A
Abstract
A physical noise source is used to develop a first sequence of random bits. A second sequence of random bits is formed from the first sequence by comparing the bits in each pair of bits of the first sequence. Every other bit of the second sequence is complemented to form a sequence of random numbers. The random numbers can be combined to form words.
Images(2)
Previous page
Next page
Claims available in
Description (OCR text may contain errors)
United States Patent Cohn [151 [451 Dec. 19, 1972 [54] RANDOM NUMBER GENERATOR 3,366,779 H1968 Catherall et al. ..33l/78 Inventor: Charles E. Cohn, Clarendon Hills 3,456,208 7/1969 Ratz ..33l/78 lll. OTHER PUBLICATIONS [73] Assignee: The United States of America as Electronics, Generating Random Noise J.B. Manelis represented by the United States g. 66-459, Sept. 8, 1961 Atomic Energy Commission Primary Examiner-John Kominski [22] Flled' 1970 Attorney-Roland A. Anderson [21] Appl. No.: 84,674
[57] ABSTRACT [521 US. Cl ..331/78, 328/59 A P y noise Source is used to develop a first [51 Int. Cl. ..H03b 29/00 Sequence of random bits- A Second Sequence of [58] Field of Search ..331/7s; 328/59 bits is fmmed from the first Sequence by ing the bits in each pair of bits of the first sequence. [56] References Cited Every other bit of the second sequence is complemented to form a sequence of random numbers. The UNITED STATES PATENTS random numbers can be combined to form words.
3,208,008 9/ 1965 Hills ..33 H78 3 Claims, 2 Drawing Figures T0 GGLE Sfl/VPL //V6 FLIP -F1. 0P FLIP-+101 0 J 0 NOISE CO/VPfl/IWTOA T T sou/P65 5 K 5 J s /0 RE/ffif/VCE /6 //j /9) V027W6 /7 610C K R075 5 25 047 s 0 26 3 c0/vr;w-
T INVERTER c a [wMPz/T RLI q wofip Q FORM/N6 J BUFFER 28 PATENTEDUEEIQIBY? CL OCK PULSES Sfl/WPL 5 T0 comm- 571701? /6 SHEET 2 0F 2 fa/en for Charles 5. (0/27 RANDOM NUMBER GENERATOR CONTRACTUAL ORIGIN OF THE INVENTION The invention described herein was made in the course of, or under, a contract with the United States Atomic Energy Commission.
BACKGROUND OF THE INVENTION This invention relates to an improved random number generator using a physical noise source. Conventional multiplicative-congruential algorithms for random number generation do not have ideal statistical properties. It is therefore desirable to use the classical method of generating random numbers from physical sources of random noise.
Random numbers can be formed by the accumulation of random bits in a shift register. Each random bit is derived from a random noise voltage. A random number is thus obtained with a single input operation much faster than with an algorithmic generator. However, this simple scheme develops random numbers having nonideal statistical properties because the circuits used are not ideal. Unavoidable unbalance in the sampler circuits will introduce a bias in the random bits. In addition, correlations between neighboring bits could result from a limited noise bandwidth as well as sampler hysteresis. There exist methods which are used to eliminate the bias of random bits. However, in these older methods the choice between one or the other value for a given bit is influenced by an average of values of bits previously produced. The introduction of said average leads to undesired long-term correlations.
It is therefore an object of this invention to provide an improved random number generator.
Another object of this invention is to provide a random number generator using a physical noise source to generate random numbers.
Another object of this invention is to provide a method of correcting random numbers derived from a physical noise source for statistical imperfections arising from the electronic circuits used.
Another object of this invention is to provide a method for correcting random bits derived from a physical noise source without reference to bits previously generated.
SUMMARY OF THE INVENTION In practicing this invention, a method is provided in which a first sequence of random bits is derived from a physical noise source. The bits in consecutive pairs of bits of the first sequence are compared to develop a second sequence of random bits. The first bit of the pair is complemented if the second bit in the pair of first sequence bits is a first value. The first bit of the pair is unchanged if the second bit in the pair of first sequence bits is a second value. The bits in the second sequence are formed by the first bits of the pairs modified as described. The sequence of random numbers can then be developed from the second sequence of random bits by complementing every other bit in the second sequence. Random words can be developed from the random bit sequence.
DESCRIPTION OF THE DRAWINGS The invention is illustrated in the drawings, of which:
I FIG. 1 is a partial block diagram and partial schematic of the random number generator; and
FIG. 2 shows the timing of the clock pulses.
DESCRIPTION OF THE INVENTION A first sequence of random bits is derived from a physical noise source. Referring to FIG. 1, a noise source 10 develops a white noise output which is one input of comparator 16. The other input of comparator 16 is connected to a DC reference voltage which is approximately equal to the median level of the noise from noise source 10. The output of comparator 16 is then a square wave that makes a transition from space to mark whenever the noise from noise source 10 crosses the reference-voltage level in one direction and makes a transition from mark to space when the noise from noise source 10 crosses the reference-voltage level in the other direction.
The output of comparator 16 is applied to the toggle input of toggle flip-flop 11, which changes state from reset to set or from set to reset every time the input square wave changes from mark to space.
Bias can result from flip-flop 11 spending more time in one state than in the other. This arises from the properties of the flip-flop. For toggling to occur, the mark interval of the input square wave must be long enough to prime the flip-flop for a change of state. If the mark interval is too short, complementation will not occur on the mark-space transition. In any actual flip-flop, the components will not be exactly symmetrical so that the mark interval required to prime for a state change in one direction may be slightly longer than that required to prime for a state change in the other direction. The properties of the noise from noise generator 10 give rise to a distribution of mark intervals such that a certain fraction are long enough to initiate a state change in one direction but are not long enough to initiate a state change in the other direction. Thus, a bias will arise.
The set and reset outputs of toggle flip-flop 11 go to the steering inputs of sampling flip-flop 19. When a clock pulse is applied to the clock input of sampling flip-flop 19, the state of toggle flip-flop ll. at that time is sampled and held by the sampling flip-flop 19. Since the clock pulses are independent of the state changes of toggle flip-flop 11, there will be a certain number of instances where the time interval between the most recent state change and the clock pulse is insufficient to prime the sampling flip-flop 19 for a state change, so that the sampling flip-flop 19 will remain in its previous state. This hysteresis gives rise to correlations between successive random bits.
To minimize correlations due to a limited noise bandwidth, the effective sampling rate should be much less than the clock rate of the computer using the random number. The sampling rate should be just sufficient to generate one random number during the minimum time interval between computer requests for random numbers. To minimize correlations due to sampler hysteresis, the sampler should take samples as frequently as possible. The samples taken would be accepted only at the desired rate with in-between samples discarded. Thus the clock rate A from clock 17 applied to sampling flip-flop 39 would be many times the clock rates B and C. Clock rates 13 and C are the same but I060ll 0722 with the pulses alternating (see FIG. 2). The sequence of bits developed by sampling flip-flop 19 is coupled to the set input of J-K flip-flop 20, inverter 22 and AND gate 23.
The first bit of each pair of bits in this sequence is used to determine if the second bit of the pair is to be complemented. Complementing a binary number means that the binary digit is changed to a l, and the binary digit 1 is changed to a 0. The first bit received is applied to .l-K flip-flop 20 at the same time an activating pulse is applied to the flip-flop 20. If the bit is a 0, it is inverted in inverter 22 and clears J-K flip-flop 20 so that the output of flip-flop His 0. If the bit is a 1, it sets J-K flip-flop 20 so that the output of flip-flop 20 is l. The second bit received does not act on flip-flop 20 as there is no activating pulse for the second bit. Thus flipflop 20 acts to store every other bit.
The second bit is received by AND gate 23 at the same time as an enabling pulse is applied thereto. Thus the second bit is coupled to an EXCLUSIVE OR gate 25 where it is compared with the first bit. If the first bit is a l, the output of the EXCLUSIVE OR gate 25 is the complement of the-second bit. If the'first bit is a 0, the output of the EXCLUSIVE OR gate 25 is the same as the second bit. I
Let 8 be the biasof the series of random bits from the output of sampling flip-flop l9, and let e be the correlation from one bit to the next. That is, the probability that any bit will be one is 0.5 8, the probability that the bit following a one will also be a one is 0.5 6 e, and the probability that the bit following a zero will be a one is 0.5 8 6. Then the probability that any bit from the output of EXCLUSIVE OR gate 25 will be a one is 0.5 28 e. If e is sufficiently small, a substantial improvement in bias may be obtained.
Every other bit of this new sequence of random bits is now complemented. The output of EXCLUSIVE OR gate 25 is applied to EXCLUSIVE OR gate 26. The second input to EXCLUSIVE OR gate 26 is an alternating sequence of 0s and ls from .l-K flip-flop 27. Flip-flop 27 is set for toggle operation in response to the C pulses from clock 17. If the output of flip-flop 27 is a l, the bit from EXCLUSIVE OR gate 25 is complerelation is not significant in any practical situation.
The output bits from EXCLUSIVE OR gate 26 are applied to a word-forming buffer 28 which can be a shift register. Bits are received by buffer 28 serially and are transferred to computer 30 in parallel as random numbers or words. Data control provides control mented by EXCLUSIVE OR gate 26. If the output of 5 pends on the bias of the series of random bits from the output of EXCLUSIVE OR gate 25. With practical generators, this bias can be made so low that the corsignals for the random number generator.
Where the bias in the sequence of random bits derived from the physical noise source is sufficiently low, the step of comparing the bits of each pair of bits can be eliminated. The output of sampling flip-flop 19 is coupled directly to EXCL SIVE OR gate 26 where every 0 er bit is comp emented s previously described.
The embodiments of the invention in which an exclu sive property or privilege is claimed are defined as follows:
l. The method of producing a final random sequence of hits including the steps of:
a. developing a first random sequence of bits from a physical noise source, and v b. developing the final random sequence of bits by complementing every other bit of said first random sequence of bits with the bits intermediate said every other bits being unchanged.
2. A method of producing a final random sequence of bits including the steps of:
a. developing a first random sequence of bits from a physical noise source;
b. comparing the binary value of the first bit of consecutive pairs of bits of the first random sequence of bits with the binary value of the second bit of the same pair of bits and developing a third bit having the binary value of the second bit when said first bit has one binary value and using the complement of said second bit as said third bit when said first bit has the other binary value;
c. forming a second random sequence of bits from said third bits with the sequence of said third bits in said second random sequence of bits being the same as the sequence of said consecutive pairs of bits from which said third bits are formed; and
. developing said final random sequence of bits by complementing every other bit of said second random sequence of bits with the bits intermediate said every other bits being unchanged.
3. The method of producing the final sequence of random bits of claim 2 further including the step of:
a. combining a desired number of bits of said final random sequence of bits to form a random number with the sequence of bits forming said random number being the same as their sequence in said final random sequence.
* i i I I060ll 0723
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US3208008 *12 Feb 196321 Sep 1965Hills Richard ARandom width and spaced pulsed generator
US3366779 *20 Jul 196530 Jan 1968Solartron Electronic GroupRandom signal generator
US3456208 *18 Jan 196715 Jul 1969Ratz Alfred GRandom noise generator having gaussian amplitude probability distribution
Non-Patent Citations
Reference
1 *Electronics, Generating Random Noise J.B. Manelis pg. 66 69, Sept. 8, 1961
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US3790768 *28 Sep 19725 Feb 1974Prayfel IncRandom number generator
US3811038 *13 Sep 197214 May 1974Int Computers LtdPseudo-random number generators
US3838259 *5 Apr 197324 Sep 1974Nsm Apparatebau Gmbh KgCircuit arrangement for generating pseudo random numbers
US3866128 *25 Jun 197311 Feb 1975Lindsey Jr Reed SRandom pulse generator
US4121830 *29 Aug 197724 Oct 1978Random Electronic Games Co.Bingo computer apparatus and method
US4169249 *21 Apr 197825 Sep 1979Societe Nationale Industrielle AerospatialeAnalog noise generator
US4176399 *21 Apr 197827 Nov 1979Societe Nationale Industrielle AerospatialeAnalog noise generator
US4545024 *27 Apr 19831 Oct 1985At&T Bell LaboratoriesHybrid natural random number generator
US4641102 *17 Aug 19843 Feb 1987At&T Bell LaboratoriesRandom number generator
US4791594 *28 Mar 198613 Dec 1988Technology Inc. 64Random-access psuedo random number generator
US5239494 *30 Oct 199124 Aug 1993Motorola, Inc.Random bit stream generator and method
US6128386 *7 Feb 19983 Oct 2000Channel One Communications, Inc.Multiple number base encoder/decoder using a corresponding exclusive or function
US6215874 *13 Feb 199810 Apr 2001Dew Engineering And Development LimitedRandom number generator and method for same
US632455814 Feb 199527 Nov 2001Scott A. WilberRandom number generator and generation method
US6345359 *14 Nov 19975 Feb 2002Raytheon CompanyIn-line decryption for protecting embedded software
US6414558 *18 Sep 20002 Jul 2002Parthus Ireland LimitedMethod and apparatus for random sequence generator
US6643374 *31 Mar 19994 Nov 2003Intel CorporationDuty cycle corrector for a random number generator
US676336430 Oct 200013 Jul 2004Scott A. WilberRandom number generator and generation method
US6831980 *9 Mar 200014 Dec 2004Activcard Ireland LimitedRandom number generator and method for same
US709624217 Jun 200222 Aug 2006Wilber Scott ARandom number generator and generation method
US713699120 Nov 200214 Nov 2006Henry G GlennMicroprocessor including random number generator supporting operating system-independent multitasking operation
US713978511 Feb 200321 Nov 2006Ip-First, LlcApparatus and method for reducing sequential bit correlation in a random number generator
US714976421 Nov 200212 Dec 2006Ip-First, LlcRandom number generator bit string filter
US716508411 Feb 200316 Jan 2007Ip-First, Llc.Microprocessor with selectivity available random number generator based on self-test result
US716788210 Sep 200323 Jan 2007Seagate Technology LlcTrue random number generation
US717435511 Feb 20036 Feb 2007Ip-First, Llc.Random number generator with selectable dual random bit string engines
US719079120 Nov 200213 Mar 2007Stephen Laurence BorenMethod of encryption using multi-key process to create a variable-length key
US721911220 Nov 200215 May 2007Ip-First, LlcMicroprocessor with instruction translator for translating an instruction for storing random data bytes
US7224305 *24 Dec 200429 May 2007Telefonaktiebolaget L M Ericsson (Publ)Analog-to-digital modulation
US733400930 Jun 200619 Feb 2008Ip-First, LlcMicroprocessor with random number generator and instruction for storing random data
US768963627 Aug 200430 Mar 2010Stmicroelectronics S.A.Generation of a normalized random bit flow
US771210530 Jun 20064 May 2010Ip-First, Llc.Microprocessor including random number generator supporting operating system-independent multitasking operation
US775224721 Aug 20066 Jul 2010The Quantum World CorporationRandom number generator and generation method
US781001123 Aug 20045 Oct 2010North-West UniversityHardware generator for uniform and Gaussian deviates employing analog and digital correction circuits
US781835825 Dec 200619 Oct 2010Ip-First, LlcMicroprocessor with random number generator and instruction for storing random data
US784912026 Dec 20067 Dec 2010Ip-First, LlcMicroprocessor with random number generator and instruction for storing random data
US816608626 Feb 200424 Apr 2012Telecom Italia S.P.A.Method and circuit for generating random numbers, and computer program product therefor
US829634516 Dec 200623 Oct 2012Ip-First, LlcMicroprocessor with selectively available random number generator based on self-test result
US20020126841 *6 Mar 200212 Sep 2002Yoshihisa AraiRandom number's seed generating circuit, driver having the same, and SD memory card system
US20020169810 *17 Jun 200214 Nov 2002Wilber Scott A.Random number generator and generation method
US20030131217 *20 Nov 200210 Jul 2003Ip-First, Llc.Microprocessor including random number generator supporting operating system-independent multitasking operation
US20030149863 *20 Nov 20027 Aug 2003Ip-First, Llc.Microprocessor with random number generator and instruction for storing random data
US20040096056 *20 Nov 200220 May 2004Boren Stephen LaurenceMethod of encryption using multi-key process to create a variable-length key
US20040096060 *11 Feb 200320 May 2004Ip-First, Llc.Random number generator with selectable dual random bit string engines
US20040098429 *11 Feb 200320 May 2004Ip-First, Llc.Microprocessor with selectively available random number generator based on self-test result
US20040103131 *21 Nov 200227 May 2004Ip-First, Llc.Random number generator bit string filter
US20040158591 *11 Feb 200312 Aug 2004Ip-First, Llc.Apparatus and method for reducing sequential bit correlation in a random number generator
US20050050124 *27 Aug 20043 Mar 2005Pierre-Yvan LiardetGeneration of a normalized random bit flow
US20050055390 *10 Sep 200310 Mar 2005Xie WenxiangTrue random number generation
US20050270202 *24 Dec 20048 Dec 2005Haartsen Jacobus CAnalog-to-digital modulation
US20070078920 *16 Dec 20065 Apr 2007Ip-First, LlcMicroprocessor with selectively available random number generator based on self-test result
US20070110239 *30 Jun 200617 May 2007Ip-First, LlcMicroprocessor including random number generator supporting operating system-independent multitasking operation
US20070118581 *25 Dec 200624 May 2007Ip-First, LlcMicroprocessor with random number generator and instruction for storing random data
US20070118582 *26 Dec 200624 May 2007Ip-First, LlcMicroprocessor with random number generator and instruction for storing random data
US20070140485 *26 Feb 200421 Jun 2007Giovanni GhigoMethod and circuit for generating random numbers, and computer program product therefor
CN100498688C23 Aug 200410 Jun 2009西北大学A hardware generator for uniform and gaussian deviation employing analog and digital correction circuits
DE2820425A1 *8 May 19789 Nov 1978AerospatialeZufallrauschgenerator und einen derartigen generator aufweisende stochastische kodiervorrichtung
DE2820426A1 *8 May 19789 Nov 1978AerospatialeAnalog-rauschgenerator mit von einer punktregelung ausgehender voreinstellbaren verteilung
EP1422612A2 *21 Feb 200326 May 2004IP-First LLCRandom number generator bit string filter
EP1450250A2 *14 Apr 200325 Aug 2004IP-First LLCRandom number generator with selectable dual random bit string engines
EP1450251A2 *14 Apr 200325 Aug 2004IP-First LLCApparatus and method for reducing sequential bit correlation in a random number generator
EP1515438A1 *27 Aug 200416 Mar 2005St Microelectronics S.A.Generation of a normalized random bitstream
WO2000070818A1 *18 May 199923 Nov 2000Richard C SatterfieldMultiple number base encoder/decoder using corresponding xor
WO2000070819A1 *18 May 199923 Nov 2000Richard C SatterfieldCryptographic engine using base conversion, logic operations and prng in data arrays to increase dispersion in ciphertext
WO2003040854A2 *11 Oct 200215 May 2003Mario StipcevicApparatus and method for generating true random bits based on time summation of an electronics noise source
WO2005020064A2 *23 Aug 20043 Mar 2005Roelof Cornelius BothaHardware generator employing analog and digital correction circuits for generating uniform and gaussian distributed true random numbers
WO2005083561A1 *26 Feb 20049 Sep 2005Loris BolleaMethod and circuit for generating random numbers, and computer program product therefor
WO2005124536A1 *26 May 200529 Dec 2005Viktor FischerMethod for generating random binary sequences and device therefor
Classifications
U.S. Classification331/78
International ClassificationG06F7/58
Cooperative ClassificationG06F7/588
European ClassificationG06F7/58R
|
__label__pos
| 0.512835 |
Scalable secondary storage systems and methods
Exemplary systems and methods in accordance with embodiments of the present invention may provide a plurality of data services by employing splittable, mergable and transferable redundant chains of data containers. The chains and containers may be automatically split and/or merged in response to changes in storage node network configurations and may be stored in erasure coded fragments distributed across different storage nodes. Data services provided in a distributed secondary storage system utilizing redundant chains of containers may include global deduplication, dynamic scalability, support for multiple redundancy classes, data location, fast reading and writing of data and rebuilding of data due to node or disk failures.
Skip to: Description · Claims · References Cited · Patent History · Patent History
Description
RELATED APPLICATION INFORMATION
This application claims priority to provisional application Ser. No. 61/095,994 filed on Sep. 11, 2008, incorporated herein by reference.
BACKGROUND
1. Technical Field
The present invention relates generally to storage of data and, more particularly, to storage of data in a secondary storage system.
2. Description of the Related Art
The development of secondary storage technology, an important aspect of the enterprise environment, has had to keep pace with increasingly strenuous demands imposed by enterprises. For example, such demands include the simultaneous provision of varying degrees of reliability, availability and retention periods for data with different levels of importance. Further, to meet regulatory requirements, such as the Sarbanes-Oxley ACT (SOX), the Health Insurance Portability and Accountability Act (HIPPA), the Patriot Act, and SEC rule 17a-4(t), enterprise environments have demanded improved security, traceability and data audit from secondary storage systems. As a result, desirable secondary storage architectures define and institute strict data retention and deletion procedures rigorously. Furthermore, they should retain and recover data and present data on demand, as failing to do so may result not only in a serious loss to business efficiency, but also in fines and even criminal prosecution. Moreover, because business enterprises oftentimes employ relatively limited information technology (IT) budgets, efficiency is also of primary importance, both in terms of improving storage utilization and in terms of reducing mounting data management costs. In addition, with ever increasing amounts of data produced and fixed backup windows associated therewith, there is a clear need for scaling performance and backup capacity appropriately.
Substantial progress has been made to address these enterprise needs, as demonstrated by advancements in disk-targeted de-duplicating virtual tape libraries (VTLs), disk-based backend servers and content-addressable archiving solutions. However, existing solutions do not adequately address the problems associated with the exponential increase in the amount of data stored in secondary storage.
For example, unlike primary storage, such as a storage area network (SAN), which is usually networked and under common management, secondary storage comprises a large number of highly-specialized dedicated components, each of them being a storage island entailing the use of customized, elaborate, and often manual, administration and management. Thus, a large fraction of the total cost of ownership (TCO) can be attributed to management of a greater extent of secondary storage components.
Moreover, existing systems assign a fixed capacity to each storage device and limit duplicate elimination to only one device, which results in poor capacity utilization and leads to wasted space caused by duplicates stored on multiple components. For example, known systems include large Redundant Array of Inexpensive Disks (RAID) systems, which provide a single control box containing potentially multiple, but limited number of controllers. The data organization of these systems is based on a fixed-size block interface. Furthermore, the systems are limited in that they employ a fixed data redundancy scheme, utilize a fixed maximal capacity, and apply reconstruction schemes that rebuild entire partitions even if they are empty. Moreover, they fail to include a means for providing duplicate elimination, as duplicate elimination with such systems must be implemented in higher layers.
Other known systems deliver advanced storage in a single box, such as DataDomain, or clustered storage, such as EMC Centera. The disadvantages in these types of systems are that they provide limited capacity and performance, employ per-box duplicate elimination as opposed to a global one (DataDomain) or are based on entire files (EMC Centera). Although these systems deliver some of the advanced services such as deduplication, they are often centralized and metadata/data stored by these systems do not have redundancy beyond standard RAID schemes.
Finally, because each of these known secondary storage devices offers fixed, limited performance, reliability and availability, the high overall demands of enterprise secondary storage in these dimensions are very difficult to meet.
SUMMARY
Methods and systems in accordance with various exemplary embodiments of the present invention address the deficiencies of the prior art by providing a data organization scheme that facilitates the implementation of several different data services. Furthermore, exemplary systems and methods provide improvements over the prior art, as exemplary implementations permit dynamicity by automatically reacting to changing network configurations and by providing redundancy. In particular, exemplary implementations may split, merge, and/or transfer data containers and/or chains of data containers in response to changing network configurations, which is a significant advantage over known processes.
In one exemplary embodiment of the present invention, a method for managing data on a secondary storage system includes distributing data blocks to different data containers located in a plurality of different physical storage nodes in a node network to generate redundant chains of data containers in the nodes; detecting an addition of active storage nodes to the network; automatically splitting at least one chain of containers in response to detecting the addition; and transferring at least a portion of data split from the at least one chain of containers from one of said storage nodes to another of said storage nodes to enhance system robustness against node failures.
In an alternate exemplary embodiment of the present invention, a secondary storage system includes a network of physical storage nodes, wherein each storage node includes a storage medium configured to store fragments of data blocks in a chain of data containers that is redundant with respect to chains of data containers in other storage nodes; and a storage server configured to detect an addition of active storage nodes to the network, to automatically split at least one chain of containers on said storage medium in response to detecting the addition, and to transfer at least a portion of data split from the at least one chain of containers to a different storage node to enhance system robustness against node failures.
In an alternate exemplary embodiment of the present invention, a method for managing data on a secondary storage system includes distributing data blocks to different data containers located in a plurality of different physical storage nodes in a node network to generate redundant chains of data containers in the nodes; detecting a change in the number of active storage nodes in the network; and automatically merging at least one data container located in one of said storage nodes with another data container located in a different storage node in response to detecting the change to ensure manageability of the containers.
These and other features and advantages will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings.
BRIEF DESCRIPTION OF DRAWINGS
The disclosure will provide details in the following description of preferred embodiments with reference to the following figures wherein:
FIG. 1 is a block/flow diagram of a data block organization scheme in a backend portion of a secondary storage system in accordance with one exemplary implementation of the present principles.
FIG. 2 is a block/flow diagram of a secondary storage system in accordance with one exemplary implementation of the present principles.
FIG. 3 is a block/flow diagram of a physical storage node in accordance with one exemplary implementation of the present principles.
FIG. 4 is a block/flow diagram of an access node in accordance with one exemplary implementation of the present principles.
FIG. 5 is diagram of a fixed prefix network indicating the grouping of storage nodes according to hash prefixes of data blocks in accordance with an exemplary embodiment of the present principles.
FIG. 6 is a block/flow diagram of a system for distributing data in accordance with one exemplary implementation of the present principles.
FIG. 7 is a block/flow diagram illustrating splitting, concatenation, and deletion of data and reclamation of storage space in response to addition of storage nodes to a storage node network or loading of additional data in accordance with an embodiment of the present principles.
FIG. 8 is a block/flow diagram of a method for managing data in a secondary storage system in accordance with an exemplary implementation of the present principles.
FIG. 9 is a block/flow diagram illustrating a plurality of data services that may be performed by a secondary storage system in accordance with one exemplary implementation of the present principles.
FIGS. 10A-10C are block/flow diagrams illustrating different time frames during a scanning operation for detecting holes in chains of data containers in accordance with an exemplary implementation of the present principles.
FIG. 11 is a block/flow diagram of a method for managing data in a secondary storage system in accordance with an alternative exemplary implementation of the present principles.
DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
As indicated above, to satisfy commercial demands, distributed secondary storage systems should be capable of performing a variety of services, including: fast determination of availability of stored data (i.e. determination of whether it can be read or whether it is lost); support for multiple data redundancy classes; fast determination of data redundancy level for any given moment (i.e. determination of how many node/disk failures a given piece of data can endure without losing it); in the case of a diminished redundancy level, fast rebuilding of data up to a specified redundancy level; data writing and reading with a high level of performance; providing dynamic scalability by adjusting data location in response to changes in network configuration (for example, new nodes are added and/or old nodes are removed or failed); on-demand data deletion; and global, efficient duplicate elimination.
While any one of these data services are relatively simple to implement on their own, such as high-performance global deduplication, dynamic scalability in a distributed system, deletion services, and failure recovery, it is rather difficult to provide each of them together. For example, there is a tension between providing deduplication and dynamic scalability, as determining the location of duplicated data is difficult when a storage system grows or the configuration of storage nodes changes. In addition, there is a conflict between providing deduplication and on-demand deletion. For example, to prevent the loss of data, deduplication of data that has been scheduled for deletion should be avoided. There is also a tension between providing failure tolerance and deletion, as deletion decisions should be consistent in the event of a failure.
As discussed above, current secondary storage systems, such as RAID, for example, fail to adequately provide a combination of such data services. Exemplary implementations of the present invention address the deficiencies of the prior art by providing a novel means for balancing the demand imposed by different types of data services while maintaining efficiency and performance. For example, exemplary data organization schemes described below permit the resolution of tensions and conflicts between these services and facilitate the implementation of each of these services in a secondary storage system.
As discussed herein below, exemplary embodiments of the present invention include commercial storage systems that comprise a backend architectured as a grid of storage nodes. The front-end may comprise a layer of access nodes scaled for performance, which may be implemented using a standard file system interface, such as, for example, network file system (NFS) or common internet file system (CIFS) protocols, as understood by those of ordinary skill in the art. The present principles disclosed herein are primarily directed to the backend portion of secondary storage systems, which may be based on content addressable storage.
In accordance with exemplary implementations of the present principles, secondary storage capacity may be dynamically shared among all clients and all types of secondary storage data, such as back-up data and archive data. In addition to capacity sharing, system-wide duplicate elimination as described herein below may be applied to improve storage capacity efficiency. Exemplary system implementations are highly-available, as they may support on-line extensions and upgrades, tolerate multiple node and network failures, rebuild data automatically after failures and may inform users about recoverability of the deposited data. The reliability and availability of the stored data may be additionally dynamically adjusted by the clients with each write because the backend may support multiple data redundancy classes, as described more fully below.
Exemplary embodiments of the present principles may employ various schemes and features that are modified as discussed below to implement efficient data services such as data rebuilding, distributed and on-demand data deletion, global duplicate elimination and data integrity management. Such features may include utilizing modified content-addressable storage paradigms, which enables cheap and safe implementation of duplicate elimination. Other features may include the use of modified distributed hash tables, which permit the building of a scalable and failure-resistant system and the extension of duplicate elimination to a global level. Further, erasure codes may be employed to add redundancy to stored data with fine-grain control between a desired redundancy level and resulting storage overhead. Hardware implementations may utilize large, reliable SATA disks which deliver vast raw but inexpensive storage capacity. Multicore CPUs may also be employed, as they provide inexpensive, yet powerful computing resources.
Exemplary system implementations of the present principles may also be scalable to at least thousands of dedicated storage nodes or devices, resulting in a raw storage capacity on the order of hundreds of petabytes, with potentially larger configurations. Although a system implementation may comprise a potentially large number of storage nodes, a system may externally behave as one large system. Furthermore, it should also be noted that system implementations discussed herein below need not define one fixed access protocol, but may be flexible to permit support for both legacy applications using standards such as file system interface and new applications using highly-specialized access methods. New protocols may be added on-line with new protocol drivers, without interruptions for clients using existing protocols. Thus, system implementations may support both customized, new applications and commercial legacy applications if they use streamed data access.
Other exemplary features of secondary storage implementations may permit continuous operation of the system during various scenarios, as they may limit or eliminate the impact of failures and upgrades and extensions on data and system accessibility. Due to a distributed architecture, it is often possible to keep non-stop system availability even during hardware or software upgrade, for example, rolling upgrade, thereby eliminating need for any costly downtime. Moreover, exemplary systems are capable of automatic self-recovery in the event of hardware failures due to disk failures, network failures, power loss and even from certain software failures. In addition, exemplary systems may withstand specific, configurable numbers of fail-stops and intermittent hardware failures. Further, several layers of data integrity checking may be employed to detect random data corruption.
Another important function of exemplary systems is to ensure high data reliability, availability and integrity. For example, each block of data may be written with a user-selected redundancy level, permitting the block to survive up to a requested number of disk and node failures. The user-selectable redundancy level may be achieved by erasure coding each block into fragments. Erasure codes increase mean time to failure by many orders of magnitude over simple replication for the same amount of space overhead. After a failure, if a block remains readable, system implementations may automatically schedule data rebuilding to restore redundancy back to the level requested by the user. Moreover, secondary storage system implementations may ensure that no permanent data loss remains hidden for long. The global state of the system may indicate whether all stored blocks are readable, and if so, it may indicate how many disk and node failures may be withstood before data loss occurs.
Referring now in detail to the figures in which like numerals represent the same or similar elements and initially to FIG. 1, a representation 100 of data block organization structure in a backend portion of a secondary storage system in accordance with one exemplary implementation of the present principles is illustrated. The programming model for the data block organization is based on an abstraction of a sea of variable-sized, content-addressed, highly-resilient blocks. A block address may be derived from a hash, for example a SHA-1 hash, of its content. A block may comprise data and, optionally, an array of pointers, pointing to already written blocks. Blocks may be variable-sized to allow for a better duplicate elimination ratio. In addition, pointers may be exposed to facilitate data deletion implemented as “garbage collection,” a type of memory management process in which memory that is no longer used by objects is reclaimed. Further, the backend portion of the secondary storage system may export a low-level block interface used by protocol drivers to implement new and legacy protocols. Provision of such a block interface instead of a high-level block interface, such as file system, may simplify the implementation and permit a clean separation of the backend from the front-end. Moreover, such an interface also permits efficient implementation of a wide range of many high-level protocols.
As illustrated in FIG. 1, blocks in the backend portion of a secondary storage system may form directed acyclic graphs (DAG). The data portion of each block is shaded while the pointer portions are not shaded. Drivers may be configured to write trees of the data blocks. However, because of a deduplication feature of the exemplary secondary storage system, these trees overlap at deduplicated blocks and form directed graphs. Additionally, as long as the hash used for the block address is secure, no cycle is possible in these structures.
A source vertex in a DAG is usually a block of a special block type referred to as a “searchable retention root.” Besides regular data and an array of addresses, a retention root may be configured to include a user-defined search key used to locate the block. Such a key can be arbitrary data. A user may retrieve a searchable block by providing its search key instead of a cryptic block content address. As a result, a user need not remember the content address to access stored data. For example, multiple snapshots of the same file system can have each root organized as a searchable retention root with a search key comprising a file system name and a counter incremented with each snapshot. Searchable blocks do not have user-visible addresses and cannot be pointed to. As such, searchable blocks cannot be used to create cycles in block structures.
With reference again to FIG. 1, the set of blocks 100 includes three source vertices 102, 104, and 106, two of which, 102 and 104, are retention roots. The other source vertex 106 is a regular block A, which indicates that this part of the DAG is still under construction.
The application programming interface (API) operations may include writing and reading regular blocks, writing searchable retention roots, searching for a retention root based on its search key, and marking a retention root with a specified key to be deleted by writing an associated deletion root, as discussed below. It should be noted that cutting a data stream into blocks may be performed by drivers.
In accordance with one exemplary aspect of the present principles, on writing a block, a user may assign the block to one of a plurality of available redundancy classes. Each class may represent a different tradeoff between data redundancy and storage overhead. For example, a block in a low redundancy data class may survive only one disk failure, while storage overhead for its block size is minimal. In turn, a block in a critical data class may be replicated many times on different disks and physical nodes. A secondary storage system of the present principles may support a range of different redundancy classes between these two extremes.
It should also be noted that exemplary secondary storage systems should not provide a way to delete a single block directly because such a block may be referenced by other blocks. Rather, an API may permit a user to indicate which parts of DAG(s) should be deleted by marking retention roots. To mark a retention root that is not alive, a user may write a special block termed a “searchable deletion root” by assigning it a search key that is identical to the search key of the retention root to be deleted.
For example, referring again to FIG. 1, a deletion root 108 may be associated with retention root SP1 102. A deletion algorithm employed by the secondary storage system may be configured to mark for deletion all blocks that are not reachable from the alive retention roots. For example, in FIG. 1, if a user writes deletion root 108, all blocks with dotted lines, blocks A 106, D 110, B 112, and E 114, are marked for deletion. Note that Block A 106 is also marked for deletion because there is no retention root pointing to it, whereas block F 116 is retained, as it is reachable from the retention root SP2 104. Here, block 104 is alive because it does not have a matching deletion root. During data deletion, there is a short read-only period, in which the system identifies blocks to be deleted. Actual space reclamation may occur in the background during regular read-write operation. Further, before entering a read-only phase, all blocks to be retained should be pointed to by alive retention roots.
With reference now to FIG. 2, illustrating a high-level block/flow diagram of a secondary storage system 200 in accordance with one exemplary embodiment of the present principles that may implement the data organization model and API operations discussed above is illustrated. It should be understood that embodiments described herein may be entirely hardware or including both hardware and software elements. In a preferred embodiment, the present invention is implemented in hardware and software, which includes but is not limited to firmware, resident software, microcode, etc.
Embodiments may include a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. A computer-usable or computer readable medium may include any apparatus that stores the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be magnetic, optical, electronic, electromagnetic, infrared, or semiconductor system (or apparatus or device). The medium may include a computer-readable medium such as a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk, etc.
Further, a computer readable medium may comprise a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform method steps disclosed herein and/or embody one or more storage servers on storage nodes. Similarly, a program storage device readable by machine, tangibly embodying a program of instructions executable by the machine may be configured to perform method steps, discussed more fully below, for managing data on a secondary storage system.
System 200 may include an application layer 202 configured to interact with user-inputs and implement user-commands to store, retrieve, delete and otherwise manage data. An API 204 below the Application Layer 202 may be configured to communicate with the Application Layer 202 and to interact with a front end system 206 to institute data management. Front end system 206 may comprise a plurality of Access Nodes 208a-f that may communicate with an internal network 210. In addition, the front end system 206 interacts with a backend system 212 via application programming interface 214, which, in turn, may interact with protocol drivers 216. Backend system 212 may include a grid of storage nodes 218a-f that may be viewed by the application layer as a collection of file systems in a large storage unit. Further, although six storage nodes are shown here for brevity purposes, any number of storage nodes may be provided in accordance with design choice. In exemplary implementations, the number of access nodes may range between one and half of the storage nodes, but the range may vary depending on the hardware used to implement the storage and access nodes. The backend storage nodes may also communicate via an internal network 210.
Referring now to FIGS. 3 and 4 with continuing reference to FIG. 2, an exemplary storage node 218 and an exemplary access node 208 in accordance with embodiments of the present principles are illustrated. A storage node 218 may comprise one or more storage servers 302, a processing unit 304 and a storage medium 306. The storage server may be implemented in software configured to run on processing unit 304 and storage medium 306. Similarly, an access node 208 may comprise one or more proxy servers 402, a processing unit 404 and a storage medium 406. It should be understood that although storage nodes and access nodes are described here as being implemented on separate machines, it is contemplated that access nodes and storage nodes may be implemented on the same machine. Thus, as understood by those of ordinary skill in the art, one machine may simultaneously implement both storage nodes and access nodes.
It should be understood that system 200 may be implemented in various forms of hardware and software as understood by those of ordinary skill in the art in view of the teachings described herein. For example, a suitable system may include storage nodes configured to run one backend storage server and to have six 500 GB SATA disks, 6 GB RAM, two dual-core 3 GHz CPUs and two GigE cards. Alternatively, each storage node may be configured to run two backend storage servers and to have twelve 1 TB SATA disks, 20 GB of RAM, two four-way 3 GHz CPUs and four GigE cards. Further, for example, an access node 208 may include a 6 GB RAM, two dual-core 3 GHz CPUs, two GigE cards and only a small local storage. Moreover, storage and access nodes may also be configured to run Linux, version Red Hat EL 5.1. However, the detailed description of hardware elements should be understood to be merely exemplary, as other configurations and hardware elements may also be implemented by those of ordinary skill in the art in view of the teachings disclosed herein.
Referring again to FIGS. 2-4, as discussed above, components of secondary storage system 200 may include storage servers 302, proxy servers 402 and protocol drivers 216. Further, each storage node 218 may be configured to host one or more storage server 302 processes. The number of storage servers 302 run on a storage node 218 depends on its available resources. The larger the node 218, the more servers 302 should be run. Each server 302 may be configured to be responsible exclusively for a specific number of its storage node's disks. With the use of multicore CPUs, for example, parallelism per storage server 302 may be kept constant with each increase in the number of cores and multiple storage servers may be placed on one storage node.
As discussed above, proxy servers 402 may run on access nodes and export the same block API as the storage servers. A proxy sever 402 may be configured to provide services such as locating backend nodes and performing optimized message routing and caching.
Protocol drivers 216 may be configured to use the API 214 exported by the backend system 212 to implement access protocols. The drivers may be loaded in the runtime on both storage servers 302 and proxy servers 402. Determination of which node to load on a given driver may depend on available resources and driver resource demands. Resource-demanding drivers, such as the file system driver, may be loaded on proxy servers.
A storage server 302 may be designed for multicore CPU use in a distributed environment. In addition, features of storage servers 302 may provide support for parallel development by multiple teams of programmers. Moreover, storage server 302 features may also provide high maintainability, testability and reliability of the resulting system.
To implement storage server 302 features, an asynchronous pipelined message passing framework comprising stations termed “pipelined units” may be employed. Each unit in the pipeline may be single-threaded and need not write-share any data structures with other units. Further, a pipelined unit may also have some internal worker threads. In one exemplary embodiment, pipelined units communicate only by message passing. As such, the pipelined units may be co-located on the same physical node and distributed to multiple nodes. When communicating pipelined units are co-located on the same node, read-only sharing may be used as an optimization. Synchronization and concurrency issues may be limited to one pipelined unit only. Additionally, each pipelined unit may be tested in separation by providing stubs of other pipelined units.
To permit ease of scalability, distributed hash tables (DHTs) may be employed to organize storage locations of data. Because a distributed storage system should include storage utilization efficiency and sufficient data redundancy, additional features of a DHT should be used. For example, the additional features should provide assurances about storage utilization and an ease of integration of a selected overlay network with a data redundancy scheme, such as erasure coding. Because existing DHTs do not adequately provide such features, a modified version of a Fixed Prefix Network (FPN) distributed hash table may be used.
With reference now to FIG. 5, a representation 500 of a Fixed Prefix Network in accordance with an exemplary embodiment of the present principles is illustrated. In FPNs, each overlay node 502, 504 is assigned exactly one hashkey prefix, which is also an identifier of the overlay nodes. All prefixes together cover the entire hashkey space, and the overlay network strives to keep them disjoint. An FPN node, for example, any one of nodes 506-512, is responsible for hashkeys with a prefix equal to the FPN node's identifier. The upper portion of FIG. 5 illustrates a prefix tree having as leafs four FPN nodes 506-512 dividing the prefix space into four disjoint subspaces.
For a DHT in accordance with aspects of the present principles, an FPN may be modified with “supernodes,” as illustrated in FIG. 5. A supernode may represent one FPN node (and as such, it is identified with a hashkey prefix) and is spanned over several physical nodes to increase resiliency to node failures. For example, as illustrated in FIG. 5, if a backend network includes six storage nodes 514a-514f, each supernode 506-512 may include a fixed number, referred to as a “supernode cardinality,” of supernode components 516 which may be placed on separate physical storage nodes 514a-514f. Components of the same supernode are referred to as “peers.” Thus, each supernode may be viewed as a subset of storage nodes 514a-514f. For example, supernode 506 may be comprised of a subset 514a-514d of storage nodes. Furthermore, each storage node may be included in a number of supernodes that is less than the total number of supernodes. For example, node 514a may be included in three of the four supernodes, namely supernodes 506, 510 and 512.
In accordance with exemplary implementations of the present principles, the fixed prefix network may be used to assign the storage of data blocks to storage nodes. For example, after hashing data, the first few bits in the hash result, in this example the first two bits, may be used to distribute data blocks to each supernode. For example, data blocks having hash values beginning with “00” may be assigned to supernode 506, data blocks having hash values beginning with “01” may be assigned to supernode 508, data blocks having hash values beginning with “10” may be assigned to supernode 510, and data blocks having hash values beginning with “11”, may be assigned to supernode 512. Thereafter, portions of a data block may be distributed between components 516 of the supernode to which it is assigned, as discussed more fully below with respect to FIG. 6. Here, components for supernode 506 are denoted as 00:0, 00:1, 00:2, 00:3. Components for the other supernodes are similarly denoted.
It should be noted that supernode cardinality may, for example, be in the range of 4-32. However, other ranges may be employed. In a preferred embodiment, the supernode cardinality is set to 12. In an exemplary implementation, the supernode cardinality may be the same for all supernodes and may be constant throughout the entire system lifetime.
It should also be understood that supernode peers may employ a distributed consensus algorithm to determine any changes that should be applied to the supernode. For example, after node failure, supernode peers may determine on which physical nodes new incarnations of lost components should be re-created. In addition, supernode peers may determine which alternative nodes may replace a failed node. For example, referring back to FIG. 5, if node 1 514a should fail, component 00:1 may be reconstructed at node 5 514e using erasure coding with data from the other components of supernode 506. Similarly, if node 1 514a should fail, component 10:0 may be reconstructed at node 3 514c using data from the other components of supernode 510. Further, component 11:2 may be reconstructed at node 4 514d using data from the other components of supernode 512.
With regard to read and write handling provided by secondary storage embodiments of the present principles, on write, a block of data may be routed to one of the peers of the supernode responsible for the hashkey space to which this block's hash belongs. Next, the write-handling peer may check if a suitable duplicate is already stored, as discussed more fully below. If a duplicate is found, its address is returned; otherwise the new block is compressed, if requested by a user, fragmented, and fragments are distributed to remaining peers under the corresponding supernode. In accordance with an alternative implementation, deduplication may be performed by hashing a block on an access node and sending only the hash value, without the data, to storage nodes. Here, the storage nodes may determine whether the block is a duplicate by comparing the hash value received from an access node to hash values of stored blocks.
A read request is also routed to one of the peers of a supernode responsible for the data block's hashkey. The peer may first locate the block metadata, which may be found locally, and may send fragment read requests to other peers in order to read the minimal number of fragments sufficient to reconstruct the data block in accordance with an erasure coding scheme. If any of the requests times out, all remaining fragments may be read. After a sufficient number of fragments have been found, the block may be reconstructed, decompressed (if it was compressed), verified and, if successfully verified, returned to the user.
In general, reading is very efficient for streamed access, as all fragments may be sequentially pre-fetched from disk to a local cache. However, determination of fragment location by a peer can be quite an elaborate process. Oftentimes, determination of fragment locations may be made by referencing a local node index and a local cache, but in some cases, for example, during component transfers or after intermittent failures, the requested fragment may be present only in one of its previous locations. In this situation, the peer may direct a distributed search for missing data, by, for example, searching the trail of previous component locations in reverse order.
Another exemplary feature that may be included in secondary storage system embodiments of the present principles is “load balancing,” which ensures that components of data blocks are adequately distributed throughout different physical storage nodes of the system. The distribution of components among physical storage nodes improves system survivability, data resiliency and availability, storage utilization, and system performance. For example, placing too many peer components on one machine may have catastrophic consequences if the corresponding storage node is lost. As a result, the affected supernode may not recover from the failure because too many components could not be retrieved. Even if the storage node is recoverable, some or even all of the data handled by an associated supernode may not be readable because of a loss of too many fragments. Also, performance of the system is maximized when components are assigned to physical storage nodes proportionally to available node resources, as the load on each storage node is proportional to the hashkey prefix space covered by the components assigned to the storage node.
Exemplary system implementations may be configured to continuously attempt to balance component distribution over all physical machines or storage nodes to reach a state where failure resiliency, performance and storage utilization are maximized. The quality of a given distribution may be measured by a multi-dimensional function prioritizing these objectives, referred to as system entropy. Such balancing may be performed by each machine/storage node, which may be configured to periodically consider a set of all possible transfers of locally hosted components to neighboring storage nodes. If the storage node finds a transfer that would improve the distribution, such component transfer is executed. In addition, safeguards preventing multiple conflicting transfers happening at the same time may be added to the system. After a component arrives at a new location, its data is also moved from old locations to the new one. The data transfer may be performed in the background, as they may take a long time to execute in some instances.
Load balancing may also be used to manage the addition and removal of storage node machines to/from the secondary storage system. The same entropy function described above may be applied to measure the quality of the resulting component distribution after the addition/removal of machines.
Another important feature of exemplary secondary storage systems is the selection of supernode cardinality, as the selection of supernode cardinality may have a profound impact on properties of a secondary storage system. Firstly, supernode cardinality may determine the maximal number of tolerated node failures. For example, a backend storage network survives storage node failures as long as each supernode remains alive. A supernode remains alive if at least half of each the supernode's peers plus one should remain alive to reach a consensus. As a result, the secondary storage system survives at most half of supernode cardinality minus 1 permanent node failures among physical storage nodes hosting peers of each supernode.
Supernode cardinality also influences scalability. For a given cardinality, the probability that each supernode survives is fixed. Furthermore, probability of survival is directly dependent on the supernode cardinality.
Finally, supernode cardinality may influence the number of data redundancy classes available. For example, erasure coding is parameterized with the maximal number of fragments that can be lost while a block remains still reconstructible. If erasure coding is employed and produces supernode cardinality fragments, the tolerated number of lost fragments can vary from one to supernode cardinality minus one (in the latter case supernode cardinality copies of such blocks may be kept). Each such choice of tolerated number of lost fragments can define a different data redundancy class. As discussed above, each class may represent a different tradeoff between storage overhead, for example, due to erasure coding, and failure resilience. Such overhead may be characterized by the ratio of the tolerated number of lost fragments to the difference between supernode cardinality and the tolerated number of lost fragments. For example, if supernode cardinality is 12 and a block can lose no more than 3 fragments, then the storage overhead for this class is given by the ratio of 3 to (12-3), i.e. 33%.
With reference now to FIGS. 6 and 7, exemplary data organization structures 600, 700 for a secondary storage system using chains of data containers in accordance with an implementation of the present principles is illustrated. The representations 600, 700 of stored data permit a great degree of reliability, availability and performance. Implementations of secondary storage systems using such data organization structures enable fast identification of stored data availability and rebuilding of data to a specified redundancy level in response to a failure. Rebuilding data to a specified redundancy level provides a significant advantage over systems such as RAID, which rebuilds an entire disk even if it contains no valid user data. As discussed below, because data block components move between nodes followed by a data transfer, the system may locate and retrieve data from old component locations, which is much more efficient than rebuilding data. Data blocks written in one stream should be placed close to each other to maximize write and read performance. Further, systems employing data structure implementations described below may also support on-demand distributed data deletion, in which they delete data blocks not reachable from any alive retention root and reclaim the space occupied by the unreachable data blocks.
FIG. 6 illustrates a block/flow diagram of a system 600 for distributing data in accordance with one exemplary implementation of the present principles. As shown in FIG. 6, a data stream 602 including data blocks A 604, B 606, C 608, D 610, E 612, F 614 and G 616 may be subjected to a hash function, such as SHA-1 or any other suitable content addressable storage scheme. As understood by those of ordinary skill in the art, a content addressable storage scheme may apply a hash function on the content of data block to obtain a unique address for the data block. Thus, data block addresses are based on the content of the data block.
Returning to FIG. 6 with continuing reference to FIG. 5, in the example provided, the hash results of data blocks A 604, D 610 and F 616 have prefixes of “01.” Thus, blocks A 604, D 610, and F 616 may be assigned to supernode 508. After the hashes for the data blocks are computed from the data stream, the individual data blocks may be compressed 618 and erasure coded 620. As discussed above, erasure coding may be employed to implement data redundancy. Different, resulting erasure code fragments 622 of one data block may be distributed to peer components 516 of the supernode to which the data block is assigned. For example, FIG. 6 illustrates peer components 01:0, 01:1, 01:2 and 01:3 of supernode 508, on which different erasure coded fragments 622 from data blocks with a prefix of “01,” namely data blocks A 604, D 610 and F 616, are stored.
A basic logical unit of data management employed by exemplary secondary storage system embodiments is defined herein as a “synchrun,” which is a number of consecutive data blocks written by write-handling peer components and belonging to a given supernode. For example, synchrun 624 includes a number of consecutive data block fragments 626 from each component 516 of its corresponding supernode. Here, each fragment may be stored in the order as the blocks appear in the data stream 602. For example, fragments of block F 614 are stored before fragments of block D 610, which, in turn, are stored before fragments of block A 604. Retaining the temporal order eases manageability of the data and permits reasoning about the state of the storage system. For example, retention of temporal order permits a system to determine that data before a certain date is reconstructible in the event of a failure.
Here, writing a block is essentially writing a supernode cardinality of its fragments 622. Thus, each synchrun may be represented by a supernode cardinality of synchrun components, one for each peer. A synchrun component corresponds to the temporal sequence of fragments, for example, fragments 626, which are filtered by the supernode prefix to which the synchrun component belongs. A container may store one or more synchrun components. For the i-th peer of a supernode, the corresponding synchrun component includes all i-th fragments of the synchrun blocks. A synchrun is a logical structure only, but synchrun components actually exist on corresponding peers.
For a given write-handling peer, the secondary storage system may be configured so that only one synchrun is open at any given time. As a result, all such synchruns may be logically ordered in a chain, with the order determined by the write-handling peer. Synchrun components may be placed in a data structure referred to herein as a synchrun component container (SCC) 628. Each SCC may include one or more chain-adjacent synchrun components. Thus, SCCs also form chains similar to synchrun component chains. Further, multiple SCCs may be included in a single peer. For example, peer 01:0 may include SCC 630, SCC 632 and SCC 634. Thus, multiple SCCs ordered on a single peer are referred to as a “peer SCC chain” 636. In addition, a chain of synchruns may be represented by the supernode cardinality of peer SCC chains. A peer chain is illustrated, for example, at rows 724-732 in FIG. 7, which is discussed more fully below.
Peer SCC chains, in general, may be identical with respect to synchrun components/fragments 622 metadata and the number of fragments in each of them, but occasionally there may be differences caused, for example, by node failures resulting in chain holes. This chain organization allows for relatively simple and efficient implementation of data services of a secondary storage system, such as data retrieval and deletion, global duplicate elimination, and data rebuilding. For example, chain holes may be used to determine whether data is available (i.e. all associated blocks are reconstructible). Thus, if a sufficient number of peer chains, which is equal to the number of fragments used to fully reconstruct each block, do not have any holes, then the data is deemed available. If redundancy classes are used, determination of data availability can similarly be made for each redundancy class.
Furthermore, it should be understood that the system may store different types of metadata. For example, metadata for a data block may include exposed pointers to other data blocks, which may be replicated with each fragment of a data block with pointers. Other metadata may include fragment metadata comprising, for example, block hash information and block resiliency information. Fragment metadata may be stored separately from the data and may be replicated with each fragment. In addition, data containers may include metadata related to part of the chain it stores, such as the range of synchrun components the container stores. This metadata held by the containers permits for fast reasoning about the state of data in the system and the performance of data services, such as data building and transfers. Thus, each container includes both data and metadata. As noted above, the metadata may be replicated, whereas a redundancy level of the data requested by a user may be maintained with parameterization of erasure codes. Thus, chains of containers, such as chains of data stored on each of the components/storage nodes in supernode 508, may be deemed redundant in that the multiple chains may exist with identical metadata but different data. Further, the chains of containers may also be deemed redundant because the data itself is in a sense redundant due to the use, for example, of erasure coding to store the data in the different chains.
With reference now to FIG. 7, a data organization structure 700 illustrating splitting, concatenation, and deletion of data and reclamation of storage space in response to an addition of storage nodes in a storage node network and/or an addition of data stored in the storage nodes in accordance with an embodiment of the present principles is illustrated. Row 702 shows two synchruns A 704 and B 706, both belonging to an empty prefix supernode covering the entire hashkey space. Each synchrun component is placed here in one SCC, with individual fragments 708 also shown. SCCs with synchrun components of these synchruns are shown as rectangles placed one behind the other. As stated above, a chain of synchruns may be represented by the supernode cardinality of peer chains SCC chains. In the remainder of the FIG. 7 only one such peer SCC chain is shown.
According to an embodiment of the present principles, each supernode may eventually be split in response to, for example, loading data or adding physical storage nodes. For example, the split, as shown in row 710, may be a regular FPN split and may result in two new supernodes including respective supernode SCC chains 712 and 714, with prefixes extended from the ancestor prefix with, respectively, 0 and 1. After the supernode split, each synchrun in each supernode may also be split in half, with fragments distributed between them based on their hash prefixes. For example, row 710 shows two such chains, one chain 712 for the supernode with the prefix 0, and the other chain 714 for the supernode 714 with the prefix 1. Note that, as a result of the split, fragments 708 of synchruns A 704 and B 706 are distributed among these two separate chains, 712 and 714, which may be stored on separate storage nodes under different supernodes. As a result, four synchruns, 716, 718, 720 and 722 are created, but each of the new synchruns 716, 718 and 720, 722 are approximately half the size of the original synchruns 704 and 706, respectively.
Further, it should be understood that when a physical storage node is added to a secondary storage system and the system responds by splitting supernodes, the system may be configured to assign physical storage nodes to both new and old supernodes in a manner similar to that described above with regard to FIG. 5. For example, the secondary storage system may evenly distribute physical storage nodes among all supernodes.
In accordance with another exemplary feature of an embodiment of the present invention, a secondary storage system may maintain a limited number of local SCCs. For example, the number of SCCs may be maintained by merging or concatenating adjacent synchrun components into one SCC, as illustrated in row 724 of FIG. 7, until maximum size of the SCC is reached. Limiting the number of local SCCs permits storing SCC metadata in RAM, which in turn enables fast determination of actions to provide data services. The target size of an SCC may be a configuration constant, which may be set below 100 MB, for example, so multiple SCCs can be read in the main memory. SCC concatenations may be loosely synchronized on all peers so that peer chains maintain a similar format.
Continuing with FIG. 7, deletion of data is illustrated in row 726 of FIG. 7 in which shaded data fragments are deleted. Subsequently, as shown in rows 730 and 732, respectively, storage space may be reclaimed and remaining data fragments of separate SCCs may be concatenated. The deletion service is described more fully below.
The data organizations described above with respect to FIGS. 6 and 7 are relatively simple to implement in a static system, but are quite complex in a dynamic backend of a secondary storage system. For example, if a peer is transferred to another physical storage during load balancing, its chains may be transferred in the background to a new location, one SCC at a time. Similarly, in accordance with exemplary embodiments, after a supernode split, not all SCCs of the supernode are split immediately; instead a secondary storage system may run background operations to adjust chains to the current supernode locations and shape. As a result, in any given moment, chains may be partially-split, partially present in previous locations of a peer, or both. In the event of one or more physical storage node failures, substantial holes may be present in some of SCC chains. Because peer chains may describe the same data due to the supernode cardinality chain redundancy in the system, a sufficient number of complete chains should be present to enable data reconstruction. Accordingly, chain redundancy permits deductions about the data in the system even in the presence of transfers/failures.
Based on data organization structures described above, secondary storage system embodiments of the present principles may efficiently deliver data services such as determining recoverability of data, automatic data rebuilding, load balancing, deletion and space reclamation, data location, deduplication and others.
With regard to data rebuilding, in the event of a storage node or disk failure, SCCs residing thereon may be lost. As a result, if redundancy levels are employed, the redundancy of the data blocks with fragments belonging to these SCCs is at best reduced to a redundancy level below that requested by users when writing these blocks. In the worst case scenario, a given block may be lost completely if a sufficient number of fragments do not survive. To ensure that the block redundancy is at the desired levels, the secondary storage system may scan SCC chains to search for holes and schedule data rebuilding based on an erasure coding scheme, for example, as background jobs for each missing SCC.
In accordance with an exemplary embodiment, multiple peer SCCs may be rebuilt in one rebuilding session. Based on SCC metadata, for example, a minimal number of peer SCCs used for data rebuilding is read by a peer performing the rebuilding. Thereafter, erasure coding and decoding are applied to them in bulk to obtain lost fragments which will be included in a rebuilt SCC(s). Rebuilt SCCs may be configured to have the same format by performing any splits and concatenations, which permits fast bulk rebuilding. Next, the rebuilt SCCs may be sent to current target locations.
Another service that may be performed by secondary storage system embodiments includes duplicate elimination, which can be decentralized across storage nodes and which can be configured in many different dimensions. For example, the level at which duplicates are detected, such as an entire file, a subset of a file, a fixed-size block or a variable-size block, may be set. In addition, the time when the deduplication is performed, such as online, when a duplicate is detected before it is stored, or in the background after it reaches the disk may be set. The accuracy of depduplication may be adjusted. For example, the system may be set to detect each time a duplicate of an object being written is present, which may be termed “reliable,” or the system may approximate the presence of duplicate files at a gain of faster performance, which may be termed “approximate.” The manner in which equality of two objects is verified may be also be set. For example, the system may be configured to compare secure hashes of two object contents or, alternatively, to compare the data of these objects directly. Further the scope of detection may be varied in that it can be local, restricted only to data present on a given node, or global, in which all data from all nodes is used.
In a preferred embodiment, a secondary storage system implements a variable-sized block, online, hash-verified global duplicate elimination scheme on storage nodes. Fast approximate deduplication may be used for regular blocks, whereas reliable duplicate elimination may be used for retention roots to ensure that two or more blocks with the same search prefix point to the same blocks. In both cases, if redundancy classes are employed, the potential duplicate of a block being written should have a redundancy class that is not weaker than the class requested by the write and the potential old duplicate should be reconstructible. Here, a weaker redundancy class indicates a lower redundancy.
On a regular block write, the search for deduplicate files may be conducted on a peer handling a write request and/or a peer that has been alive the longest. For example, the peer handling the write may be selected based on the hash of the block so that two identical blocks written when this peer is alive will be handled by it. Thus, the second block may be easily determined to be a duplicate of the first block in the peer. A more complicated situation arises when the write-handling peer has been recently created due to a data transfer or component recovery and the peer does not yet have all the data it should have in that its local SCC chain is incomplete. In such a case, the peer that has been alive the longest in the same supernode as the write-handling peer is examined to check for possible duplicates. While checking the longest-alive peer is just a heuristics measure, it is unlikely that the longest-alive peer will not have its proper SCC chain complete, as this typically occurs after massive failures. Moreover, for a particular block, even in the case of a massive failure, only one opportunity to eliminate a duplicate is missed; the next identical block should be duplicate-eliminated.
For writes on retention roots, the secondary storage system should ensure that two blocks with the same search prefix point to the same blocks. Otherwise, retention roots will not be useful in identifying snapshots. As a result, an accurate, reliable duplicate elimination scheme should be applied for retention roots. Similar to writes to regular blocks, the peer handling the write may be selected based on the hash of the block so that any duplicates will be present on the peer. However, when a local full SCC chain does not exist at the peer handling a write, the write-handling peer may send duplicate elimination queries to all other peers in its supernode. Each of these peers checks locally for a duplicate. A negative reply may also include a summary description of parts of the SCC chain on which the reply is based. The write handling peer may collect all replies. If there is at least one positive, a duplicate is found. Otherwise, when all are negative, the write-handling peer may attempt to build the full chain using any chain information attached to negative replies. If the entire SCC chain can be built, the new block is determined to not be a duplicate. Otherwise, the write of the retention root may be rejected with special error status indicating that data rebuilding is in progress, which may happen after a massive failure. If the entire chain cannot be covered, the write should be submitted later.
Another data service that may be performed by secondary storage system embodiments includes data deletion and storage space reclamation. As noted above, an exemplary secondary storage system may include features such as content-addressability, distribution and failure tolerance, and duplicate elimination. These features raise complex problems in implementing data deletion. While deletion in content-addressable system embodiments is somewhat similar to distributed garbage collection, which is well understood, there are substantial differences, as discussed herein below.
When deciding if a block is to be duplicate-eliminated against another old copy of the block, exemplary secondary storage system embodiments should ensure that the old block is not scheduled for deletion. A determination on which block to keep and which to delete should be consistent in a distributed setting and in the presence of failures. For example, a deletion determination should not be temporarily lost due to intermittent failures, as duplicate blocks that are scheduled for deletion may be eliminated. Moreover, robustness of a data deletion algorithm should be higher than data robustness. This property is desirable because, even if some blocks are lost, data deletion should be able to logically remove the lost data and repair the system when such action is explicitly requested by a user.
To simplify the design and make the implementation manageable in exemplary embodiments of secondary storage systems, deletion may be split in two phases: a read-only phase, during which blocks are marked for deletion and users cannot write data; and a read-write phase, during which blocks marked for deletion are reclaimed and users can issue both reads and writes. Having a read-only phase simplifies deletion implementation, as it eliminates the impact of writes on the block-marking process.
Referring again to FIG. 7, deletion may also be implemented with a per-block reference counter configured to count the number of pointers in system data blocks pointing to a particular block. In certain implementations, reference counters need not be updated immediately on write. Instead, they may be updated incrementally during each read-only phase, during which the secondary storage system processes all pointers written since the previous read-only phase. For each detected pointer, the reference counter of the block to which it points is incremented. After all pointers are detected and incrementation is completed, all blocks with a reference counter equal to zero may be marked for deletion. For example, as illustrated in FIG. 7, fragments 728 may be included in data blocks marked for deletion. Moreover, reference counters of blocks pointed to by blocks already marked for deletion (including roots with associated deletion roots) may be decremented. Thereafter, any blocks with reference counters equal to zero due to a decrement may be marked for deletion and reference counters of blocks pointed to by blocks already marked for deletion may be decremented. The marking and decrementing process may be repeated until no additional blocks can be marked for deletion. At this point, the read-only phase may end and blocks marked for deletion can be removed in the background.
The exemplary deletion process as described above uses metadata of all blocks as well as all pointers. The pointers and block metadata may be replicated on all peers, so the deletion can proceed even if some blocks are no longer reconstructible, as long as at least one block fragment exists on a peer.
Because blocks may be stored as fragments, a copy of the block reference counter may be stored for each fragment. Thus, each fragment of a given block should have the same value of the block's reference counter. Reference counters may be computed independently on peers participating in the read-only phase. Before deletion is initiated, each such peer should have an SCC chain that is complete with respect to fragment metadata and pointers. Not all peers in a supernode need to participate, but some minimal number of peers should participate to complete the read-only phase. Computed counters may be later propagated in the background to remaining peers.
Redundancy in counter computation permits any deletion determinations to survive physical storage node failures. However, the intermediate results of deletion computations need not be persistent. In certain exemplary embodiments, any intermediate computation results may be lost due to storage node-failure. If a storage node fails, the whole computation may be repeated if too many peers can no longer participate in the read-only phase. However, if a sufficient number of peers in each supernode were not affected by a failure, deletion can still continue. Upon conclusion of a read-only phase, the new counter values are made failure-tolerant and all dead blocks (i.e., blocks with reference counters equal to zero) may be swept from physical storage in background. For example, dead blocks may be swept as illustrated in row 730 of FIG. 7.
Referring now to FIGS. 8, 9 and 10a-10c and continuing reference to FIGS. 2, 3, 5 and 6, a method 800 and systems 200, 600 for managing data on a secondary storage system in accordance with exemplary implementations of the present principles are illustrated. It should be understood that each of the features discussed above, taken individually or in any combination, of exemplary secondary storage systems may be implemented in method 800 and in systems 200 and 600. Thus, the features of method 800 and in systems 200 and 600 discussed herein below are merely exemplary and it is contemplated that the features discussed above may be added to method and system implementations as understood by those of ordinary skill in the art in view of the teaching provided herein.
Method 800, at step 801, may optionally include applying a hash function on an incoming stream of data blocks, as described, for example, above with respect to FIG. 6. For example, a SHA-1 hash function may be employed.
Optionally, at step 802, the data blocks may be erasure coded, for example, as described above with respect to block 620 of FIG. 6.
At step 804, the data blocks may be distributed to different containers located in a plurality of different physical storage nodes in a node network to generate redundant chains of data containers in the nodes, for example, as described above with respect to FIG. 6. For example, the distributing may comprise storing the erasure coded fragments 622 in different data containers 628 such that fragments originating from one of the data blocks, for example, data block A 604, are stored on different storage nodes. For example, the different storage nodes may correspond to nodes 514b and 514d-f in FIGS. 5 and 6, which are under supernode 508. Further, as stated above, the fragments of data blocks may be content-addressed on a storage medium of a storage node. In addition, it should be noted that different prefixes of content addresses may be associated with a different subset of storage nodes. For example, as discussed above with respect to FIGS. 5 and 6, hash key prefixes may be associated with different supernodes 506-512, each of which may span a plurality of storage nodes. Furthermore, each of the chains of data containers corresponding to a supernode may include the same metadata describing data block information such as, for example, hash value and resiliency level, as discussed above. In addition, the metadata may include exposed pointers between data blocks in the data containers, as stated above.
At step 806, an addition of active storage nodes to the storage node network may be detected by one or more storage nodes. For example, an explicit addition or removal of one or more storage nodes may be detected by a peer component by receiving an administration command indicating the additions and/or removals.
At step 808, at least one chain of containers may be split in response to detecting the addition of active storage nodes. For example, one or more chains of containers may be split as described above with respect to rows 702 and 710 in FIG. 7. It should be understood that the splitting may comprise splitting one or more data containers 628 and/or splitting one or more data container/synchrun chains 636. For example, splitting a chain of data containers may comprise separating at least one data container from the chain of containers. In addition, the metadata may be referenced during container chain splitting to permit, for example, the maintenance of a desired redundancy level or to conduct load balancing in response to one or more added nodes. In addition, it should also be noted that automatic splitting may comprise extending at least one prefix of content addresses to generate new supernodes or subsets of storage nodes, for example, as described above with respect to FIG. 7.
At step 810, at least a portion of data split from at least one chain of container may be transferred from one of storage node to another storage node to enhance system robustness against node failures. For example, as discussed above with respect to FIG. 7, data block fragments stored in containers of a chain of SCCs may be split and distributed to different supernodes. As stated above, different supernodes may include different storage node components; as such, a transfer from one supernode or subset of nodes to another supernode or subset of nodes may comprise a transfer between different storage nodes. As discussed above, the split may be performed in response to an addition of new storage nodes to the secondary storage system. Thus, generation of new supernodes and data distribution between them permits effective utilization of storage nodes in the network such that the storage of data is diversified, thereby providing robustness against one or more node failures. The wide availability of redundant data on different storage nodes facilitates data reconstruction in the event of a failure.
At step 812, at least one data container may be merged with another data container. For example, as discussed above, with respect to FIG. 7, synchruns 716 and 720, which include data containers, may be merged with synchruns 718 and 722, respectively, which also include data containers, after a split to, for example, maintain a certain number of SCCs. Furthermore, merging may also be performed after deletion and reclamation, for example, as discussed above with respect to rows 726, 730 and 732 of FIG. 7.
During performance of any portion of method 800, one or more data services may also be performed at step 814. Although step 814 is shown at the end of method 800, it may be performed during, between or after any other steps of method 800. For example, the method may be performed to aid in implementation of data services, such as load balancing. As illustrated in FIG. 9, performance of data services may comprise transferring 902 data container chains from one storage node or supernode component to another storage node or supernode component. The organization of peer chains in accordance with temporal order facilitates transfer of data container chains.
At steps 904 and 908, data writing and reading may be performed. For example, as discussed above, during a write, a block of data may be routed to one of the peers of a supernode assigned to a hashkey space to which the block belongs. In addition, duplicate detection may also be performed on a write. With respect to reads, for example, as discussed above, a read request may also be routed to one of the peers of a supernode responsible for the data block's hashkey. Reading a block may comprise reading block metadata and transferring fragment read requests to other peers to obtain a sufficient number of fragments to reconstruct the block in accordance with an erasure coding scheme, as discussed above.
At step 906, it may be determined whether chains of data containers include holes. Identification of holes in dsta container chains facilitates, for example, data reading, determination of data availability, performing data deletion, rebuilding data in response a failure, and performing distributed global duplicate elimination. For example, identification of holes indicates that data fragments stored in a container are unavailable. As a result, a storage server should search another peer for other data fragments during reconstruction or rebuilding of data. Rebuilding of data may, for example, be triggered by a data read. Similarly, identification of holes may be performed during a system test for whether a user-defined redundancy level is maintained on the system.
One example in which a storage server may determine whether chains of containers include holes is illustrated in FIGS. 10A-10C, indicating different time frames of a synchrun chain scan on peers of a supernode. For example, in FIG. 10A, a storage server may be configured to scan a synchrun 1002 simultaneously on all peers belonging to supernode 508. In FIG. 10B, the system may proceed to scan the next synchrun 1008 in the temporal order of a stream of data blocks simultaneously on all peers belonging to supernode 508 and discover a hole 1004. Similarly, in FIG. 10C, the system may proceed to scan the next synchrun 1010 in the temporal order of a stream of data blocks simultaneously on all peers belonging to supernode 508 and discover a hole 1006. In this way, chain holes resulting from node and disk failures may be detected, for example. Further, the chain may be rebuilt using chain and data redundancy, as discussed above.
Returning to FIG. 9, determination of data availability may be performed, as mentioned above, at step 910. In addition, rebuilding of data in response to a storage node failure may also be performed at step 912. For example, as discussed above, the system may scan SCC chains to look for holes and schedule data rebuilding as background jobs for each missing SCC. Further, the rebuilding may be performed by referencing fragment metadata and/or container metadata, discussed above.
At step 914, data deletion may be performed. For example, data deletion may be performed on-demand and/or in relation to deduplication, as discussed above. In addition, data deletion may, for example, comprise using a reference counter and iteratively deleting any blocks that do not have any pointers pointing to it. The pointers may be obtained by referencing fragment metadata, for example.
At step 916, distributed global duplicate elimination may be performed, as discussed at length above. For example, as discussed above, fast approximate deduplication may be performed for regular blocks while a reliable deduplication may be performed for retention roots. Moreover, duplicate eliminate may be performed online as a part of data writing.
It should be understood that all services described in FIG. 9 are optional, but a preferable system includes the capability to perform all the services mentioned with respect to FIG. 9. In addition, although steps 902 and 906 are shown as being performed before steps 908-916, any of steps 908-916 may be executed without performing any one or more of steps 902 and 906.
Furthermore, returning to FIGS. 2 and 3, it should be understood that storage servers running on storage nodes in the backend of system 200 may be configured to perform any one or more of the steps described above with respect to FIGS. 8 and 9. Thus, the description provided below of the backend of system 200 should be understood to be exemplary only, and any one or more of the features discussed above may be included therein.
As mention above, the backend 212 of system 200 may include a network of physical storage nodes 218a-218f. In addition, each storage node may include a storage medium and a processor, where the storage medium may be configured to store fragments of data blocks in a chain of data containers that is redundant with respect to chains of data containers in other storage nodes. For example, as discussed above with respect to FIG. 6, fragments 622 of data blocks 604, 610 and 616 may be stored in a chain of data containers 636 in peer 01:0 that is redundant with respect to chains of containers stored in other peers 01:1-01:3.
Further, each storage server 302 may be configured to perform steps 806, 808 and 810, discussed above with respect to FIG. 8. In addition, each storage server may be configured to perform any of the data services discussed with respect to FIG. 9. Moreover, as discussed above, one or more chains chains of data containers may include the same metadata as other chains of data containers. The metadata may describe the state of data in the storage node. Also, as discussed above, a storage server may reference the metadata to automatically split at least one chain of containers on a storage medium associated with the storage server. Furthermore, as stated above, metadata may include exposed pointers between data blocks in the data containers and a storage server may be configured to perform data deletion using the pointers.
As described above with respect to step 801 and FIG. 6, data blocks and their corresponding fragments may be content-addressed based on a hash function. Similarly, the prefixes of hash keys may be associated with different supernodes or subsets of storage nodes. For example, as shown in FIG. 5, the prefix “00” may be associated with a subset of storage nodes 514a-514d, the prefix “01” may be associated with the subset of storage nodes 514b and 514d-f, etc. Moreover, as described above with respect to step 808, automatically splitting a chain of containers may include extending at least one of the prefixes to generate at least one additional subset of storage nodes. For example, as discussed above, if a supernode assigned prefix were “01,” the supernode may be split into two supernodes with assigned prefixes of “010” and “011,” respectively. In addition, each of the new supernodes may include new and different sets of components or peers or subsets of storage nodes associated therewith. Further, as discussed above with respect to step 810, the transfer instituted by a storage server may comprise distributing at least a portion of data split from the one or more chain of containers to the newly generated or additional subset of storage nodes.
Referring now to FIG. 11 with reference to FIGS. 7 and 8, a method 1100 for managing data on a secondary storage system in accordance with another exemplary implementation of the present principles is illustrated. It should be understood that each of the features discussed above, taken individually or in any combination, of exemplary secondary storage systems and methods may be implemented in method 1100. Thus, the features of method 1100 discussed herein below are merely exemplary and it is contemplated that the features discussed above may be added to method 1100 as understood by those of ordinary skill in the art in view of the teaching provided herein.
Similar to method 800, method 1100 may begin by performing optional steps 801 and 802 as discussed above with respect to FIG. 8. In addition, step 804 may be performed in which data blocks are distributed to different data containers of different storage nodes in a node network to generate redundant chains of data containers in the nodes, as discussed above with respect to FIG. 8.
At step 1106, one or more storage servers may detect a change in the number of active storage nodes in the storage node network. A change in the number of active nodes may include adding at least one storage node to a storage node network and/or removing a node from a storage network. As discussed above, addition or removal of a node may be detected by a peer component or its corresponding storage server by receiving an administration command indicating the additions and/or removals. Further, it should be noted that node failures may be detected by peer components or their corresponding storage servers by employing pings. For example, peer components may be configured to ping each other periodically and infer that a node has failed after detecting that a few pings are missing.
At step 1108, a storage server may be configured to automatically merge at least one data container located in one of the storage nodes with another data container located in a different storage node in response to detecting the change. For example, if a node is added to the network, data containers may be merged subsequent to a split operation as discussed above with respect to rows 710 and 724 of FIG. 7. For example, container 718 may have originated from a different storage node prior to merging with container 716.
Alternatively, if a node is removed from the storage system, storage servers may also be configured to merge data containers from different storage nodes at step 1106. For example, a storage server may receive an administration command indicating that a node is to be removed. Prior to actually removing the node, the storage servers may be configured to merge data containers in the node to be removed with containers in the remaining nodes. For example, the process described above with respect to FIG. 7 at rows 702, 710 and 724 may simply be reversed so that containers from different storage nodes, for example, containers 718 and 720, are merged into larger synchrun chains. The merging may be performed to ensure manageability of the containers and/or to improve system performance. Thereafter, redistribution or rebalancing may be performed, as discussed above. Further, step 814 may be performed at any point of method 1100, for example, as discussed above with respect to FIG. 8.
It should also be noted that exemplary methods and systems according to the present invention may be configured to differentiate between administrative node addition/removal and node failures/restores in the system. Administrative node addition/removal may be indicated in a managing list of nodes which should be in the system. This differentiation is useful in automatic system management. For example, the differentiation may be employed to detect alien or unauthorized nodes which should not be connected to the system according to the administrative list of nodes. For example, when alien nodes attempt to connect with the system, the connection may be rejected or the alien nodes may be removed by employing the administrative list of nodes. The differentiation may also be utilized to compute expected raw capacity of the system in its healthy state, in which all nodes are active, and to differentiate a healthy state from non-healthy states. Other uses of the differentiation are also contemplated.
Exemplary methods and systems described above facilitate efficient and effective provision of several data services in a secondary storage system, such as global deduplication, dynamic scalability, support for multiple redundancy classes, data location, fast reading and writing of data and rebuilding of data due to node or disk failures. Exemplary data organization structures, discussed above, which are based on redundant chains of data containers configured to split, merge and be transferred in response to changes in network configuration permit the implementation of each of these services in a distributed secondary storage system. Redundancy in chain containers, one of several features of exemplary embodiments, permits for failure-tolerance in delivering data service. For example, in the event of a failure, data deletion may proceed even if data is lost, as metadata is preserved due to multiple replicas in the chains. Further, redundancy also permits for efficient, distributed data rebuilding, as discussed above. In addition, both temporal order of storage of data blocks in data containers and summary container metadata enable fast reasoning about the state of the system and permit operations such as data rebuilding. Data block metadata including exposed pointers to other blocks permits the implementation of distributed failure-tolerant data deletion. Moreover, the dynamicity in chain containers allow for efficient scalability. For example, containers may be split, transferred, and/or merged to automatically adapt to changes in storage node network configurations in way that may fully optimize and utilize storage space to provide data services. Furthermore, the dynamicity also permits for easy data location.
Having described preferred embodiments of a system and method (which are intended to be illustrative and not limiting), it is noted that modifications and variations can be made by persons skilled in the art in light of the above teachings. It is therefore to be understood that changes may be made in the particular embodiments disclosed which are within the scope and spirit of the invention as outlined by the appended claims. Having thus described aspects of the invention, with the details and particularity required by the patent laws, what is claimed and desired protected by Letters Patent is set forth in the appended claims.
Claims
1. A method for managing data on a secondary storage system comprising:
distributing data blocks to different data containers located in a plurality of different physical storage nodes in a node network to generate redundant chains of data containers in the nodes;
detecting an addition of active storage nodes to the network;
automatically splitting at least one chain of containers in response to detecting the addition, wherein the automatically splitting comprises separating at least one data container from the at least one chain of containers;
transferring at least a portion of data split from the at least one chain of containers from one of said storage nodes to another of said storage nodes to enhance system robustness against node failures, wherein said at least a portion of data is stored in the at least one data container prior to the splitting; and
merging said at least one data container with another data container.
2. The method of claim 1, wherein automatically splitting comprises splitting at least one data container and wherein the at least a portion of data is stored in the at least one data container prior to the splitting.
3. The method of claim 1, wherein at least one of said chains of data containers include the same metadata as other chains of data containers, wherein the metadata describes data block information.
4. The method of claim 3, further comprising:
rebuilding data in response to a failure using said metadata.
5. The method of claim 3, wherein the metadata include pointers between data blocks in the data containers.
6. The method of claim 5 further comprising:
deleting data using said pointers.
7. The method of claim 1, further comprising:
erasure coding said data blocks to generate erasure coded fragments, wherein said distributing comprises storing the erasure coded fragments in said different data containers such that fragments originating from one of said data blocks are stored on different storage nodes.
8. The method of claim 7, further comprising:
determining whether any of said redundant chains of data containers include holes to determine whether at least one of said data blocks is available in the secondary storage system.
9. A secondary storage system comprising:
a network of physical storage nodes, wherein each storage node includes
a storage medium configured to store fragments of data blocks in a chain of data containers that is redundant with respect to chains of data containers in other storage nodes; and
a storage server configured to detect an addition of active storage nodes to the network, to automatically split at least one chain of containers on said storage medium in response to detecting the addition by separating at least one data container from the at least one chain of containers, to transfer at least a portion of data split from the at least one chain of containers to a different storage node to enhance system robustness against node failures, wherein said at least a portion of data is stored in the at least one data container prior to the split and wherein said different storage node is configured to merge said at least one data container with another data container.
10. The system of claim 9, wherein the storage server is further configured to perform at least one of: data reading, data writing, determination of data availability, data transfer, distributed global duplicate elimination, data rebuilding, and data deletion.
11. The system of claim 9, wherein the at least one of said chains of data containers include the same metadata as other chains of data containers, wherein the metadata describes data block information.
12. The system of claim 11, wherein the metadata include pointers between data blocks in the data containers and wherein the storage server is configured to perform data deletion using said pointers.
13. The system of claim 9, wherein the fragments of data blocks are content-addressed on said storage medium in accordance with a hash function.
14. The system of claim 13, wherein different prefixes of content addresses are associated with a different subset of storage nodes.
15. The system of 14, wherein the automatic split comprises extending at least one of said prefixes to generate at least one additional subset of storage nodes.
16. The system of claim 15, wherein the transfer comprises distributing the at least a portion of data split from the at least one chain of containers to the additional subset.
17. A method for managing data on a secondary storage system comprising:
distributing data blocks to different data containers located in a plurality of different physical storage nodes in a node network to generate redundant chains of data containers in the nodes;
detecting a change in the number of active storage nodes in the network; and
automatically merging at least one data container located in one of said storage nodes with another data container located in a different storage node in response to detecting the change to ensure manageability of the containers.
18. The method of claim 17, wherein said change in the number of active nodes comprises at least one of: an addition of at least one storage node to the network or a removal of at least one storage node from the network.
Referenced Cited
U.S. Patent Documents
7552356 June 23, 2009 Waterhouse et al.
7734643 June 8, 2010 Waterhouse et al.
7743023 June 22, 2010 Teodosiu et al.
7778970 August 17, 2010 Caronni et al.
7818607 October 19, 2010 Turner et al.
20040215622 October 28, 2004 Dubnicki et al.
20050135381 June 23, 2005 Dubnicki et al.
20070177739 August 2, 2007 Ganguly et al.
20070208748 September 6, 2007 Li
20080005334 January 3, 2008 Utard et al.
20080201335 August 21, 2008 Dubnicki et al.
20080201428 August 21, 2008 Dubnicki et al.
Other references
• EMC Centera Family. Content Addressed Storage, Data Archiving. 2009. (2 pages) http://www.emc.com/products/family/emc-centera-family.htm?-openfolder=platform.
• Quinlan, S., et al. Venti: A New Approach to Archival Storage. Proceedings of the FAST 2002 Conference on File and Storage Technologies. USENIX Association. Jan. 2002. (14 pages) http://www.usenix.org/publications/library/proceedings/fast02/quinlan/quinlan.pdf.
• Zhu, B., et al. Avoiding the Disk Bottleneck in the Data Domain Deduplication File System. Proceedings of the FAST 2008 (6th) Conference on File and Storage Technologies. USENIX Association. Feb. 2008. pp. 269-282. http://www.usenix.org/events/fast08/tech/fullpapers/zhu/zhu.pdf.
Patent History
Patent number: 7992037
Type: Grant
Filed: Jul 29, 2009
Date of Patent: Aug 2, 2011
Patent Publication Number: 20100064166
Assignee: NEC Laboratories America, Inc. (Princeton, NJ)
Inventors: Cezary Dubnicki (Warsaw), Cristian Ungureanu (Princeton, NJ)
Primary Examiner: Robert Beausoliel, Jr.
Assistant Examiner: Joshua P Lottich
Attorney, Agent or Firm: James Bitetto
Application Number: 12/511,126
|
__label__pos
| 0.898533 |
Peter Nordmark
Peter Nordmark
in Development
Niklas Lohmann
1
On: Building an Eco-Friendly SaaS product
At Haaartland we want to deliver a product that is as Eco-friendly as possible. To achieve this we needed to think about how we write our software in the best possible way and how we deploy it.
The EPA reports that approximately 29% of carbon emissions in the United States are tied to electricity production. That’s more than transportation, which clocks in at around 27%. So while we are all dreaming of a technological future with bitcoin and futuristic cars, we need to pause and think about the fact that we’re not thinking about impact nearly as much as we should.
This post will focus on the software, which is the part that is under our control. The hardware part is equally important but that comes down to selecting the right sustainable service to run our software. We run our product on Amazon AWS since they aim for a climate-neutral service. See their post on sustainability
Efficient software is Eco-friendly software. In the end, all software consumes resources such as CPU, memory, storage, and network bandwidth. Being Eco-friendly means that we need to build our software to be as efficient as possible and consume only the resources that we absolutely need to consume to get the product we want.
Most developers today are far removed from the fundamentals and efficient coding is getting rarer and rarer. To be Eco-friendly we need to start teaching and learning the fundamentals again.
What really happens when you go from working with a dataset of 10 elements to 10000, a million? or a billion?
Big-O is a good starting point to learn and become aware of the fundamentals.
What is Big-O?
The Big-O notation is a tool we use for describing the complexity of an algorithm. Big-O expresses the best, worst and average case for running an algorithm from time(CPU cycles) and space(memory) perspectives.
So... let us dig into the basics of Big-O
O(1) - Constant Time
The code always needs the same time, no matter how large the input dataset is. For instance, accessing a single element in an array of n items is an O(1) operation.
Example:
func logAccountBalance(acc *account) {
tf := acc.Timestamp.Format(time.RFC3339)
fmt.Printf("%s|%d|%s|%f", tf, acc.Id, acc.Curr, acc.Bal)
}
O(n) - Linear Time
This means that the run time increases at the same pace as the input dataset. The most common linear-time operations are running through the entire dataset, like a file from start to finish.
Example:
func logAccountBalances(accs []*account) {
for _, acc := range accs {
logAccountBalance(acc)
}
}
O(n²) - Quadratic Time
The calculation runs in quadratic time, which is the squared size of the input dataset. Many of the basic sorting algorithms have a worst-case run time of O(n²) like Bubble Sort, Insertion Sort, and Selection Sort.
Example:
func logCustomerAccountBalances(custs []*customer) {
for _, cust := range custs {
for _, acc := range cust.Accounts {
logAccountBalance(acc)
}
}
}
O(log(n)) - Logarithmic Time
The running time grows in proportion to the logarithm of the input dataset size, meaning that the run time barely increases as you exponentially increase the input. Inserting or retrieving elements into or from a balanced binary tree is an example of this, or performing a binary search on a sorted array.
Example:
func findAccountById(id int, sortedAccounts []*account) *account {
// sort.Search uses binary search to find and
// return the smallest index i in [0, n)
// at which f(i) is true
i := sort.Search(len(sortedAccounts),
func(i int) bool { return sortedAccounts[i].Id >= id },
)
if i < len(sortedAccounts) && sortedAccounts[i].Id == id {
return sortedAccounts[i]
} else {
return nil
}
}
What to make of this?
The algorithm you choose to solve a problem has a great impact on efficiency. Developers need to look beyond the libraries and get an understanding of the fundamentals. Like in my last example, I'm using the sort.Search function from the library and I should know the impact of using it. Can you think of a more efficient way of getting the account with a given id? I can... perhaps use another data structure?
Note: I only scratched the surface in this post and I did not cover O(2^n) for instance. If you are interested to learn more Check out this post. In the article, the author goes into improving the processing of a given problem to solve it more efficiently. Perhaps you can even move the problem from one O class to another faster class?
The Big-O cheatsheet
Oh my god 🤠 That is all for today. I hope your head doesn't hurt! Would you like to see more of this kind of post?
Niklas Lohmann
Niklas Lohmann
🙏🙏🙏 yes please!
Do you want to read more like this? Hit subscribe. It’s FREE!
|
__label__pos
| 0.996773 |
Links
Server-authoritative setup
What is CoherenceInput?
CoherenceInput is a component that enables a Simulator to take control of the simulation of another Client's objects based on the Client's inputs.
When to use CoherenceInput?
• In situations where you want a centralized simulation of all inputs. Many game genres use client inputs and centralized simulation to guarantee the fairness of actions or the stability of physics simulations.
• In situations where Clients have low processing power. If the Clients don't have sufficient processing power to simulate the World it makes sense to send inputs and just display the replicated results on the Clients.
• In situations where determinism is important. RTS and fighting games will use CoherenceInput and rollback to process input events in a shared (not centralized) and deterministic way so that all Clients simulate the same conditions and produce the same results.
coherence currently only supports using CoherenceInput in a centralized way where a single Simulator is setup to process all inputs and replicate the results to all Clients.
Setup with CoherenceSync and CoherenceInput
Setting up an object for server-side simulation using CoherenceInput and CoherenceSync is done in three steps:
1. Preparing the CoherenceSync component on the object Prefab
The simulation type of the CoherenceSync component is set to Server Side With Client Input
CoherenceSync Inspector
Setting the simulation type to this mode instructs the Client to automatically transfer State Authority for this object to the Simulator that is in charge of simulating inputs on all objects.
2. Declaring Inputs for the simulated object
Each simulated CoherenceSync component is able to define its own, unique set of inputs for simulating that object. An input can be one of:
• Button. A button input is tracked with just a binary on/off state.
• Button Range. A button range input is tracked with a float value from 0 to 1.
• Axis. An axis input is tracked as two floats from -1 to 1 in both the X and Y axis.
• String. A string value representing custom input state. (max length of 63 characters)
To declare the inputs used by the CoherenceSync component, the CoherenceInput component is added to the object. The input is named and the fields are defined.
In this example, the input block is named Player Movement and the inputs are WASD and mouse for the XY mouse position.
3. Bake the CoherenceSync object
In order for the inputs to be simulated on CoherenceSync objects, they must be optimized through baking.
If the CoherenceInput fields or name is changed, then the CoherenceSync object must be re-baked to reflect the new fields/values.
Using CoherenceInput
When a Simulator is running it will find objects that are set up using CoherenceInput components and will automatically assume authority and perform simulations. Both the Client and Simulator need to access the inputs of the CoherenceInput of the replicated object. The Client uses the Set* methods and the Simulator uses the Get* methods to access the state of the inputs of the object. In all of these methods, the name parameter is the same as the Name field in the CoherenceInput component.
Client-Side Set* Methods
• public void SetButtonState(string name, bool value)
• public void SetButtonRangeState(string name, float value)
• public void SetAxisState(string name, Vector2 value)
• public void SetStringState(string name, string value)
Simulator-Side Get* Methods
• public bool GetButtonState(string name)
• public float GetButtonRangeState(string name)
• public Vector2 GetAxisState(string name)
• public string GetStringState(string name)
For example, the mouse click position can be passed from the Client to the Simulator via the "mouse" field in the setup example.
public void SendMousePosition()
{
var coherenceInput = GetComponent<CoherenceInput>();
var mousePos = Input.mousePosition;
coherenceInput.SetAxisState("mouse", new Vector2(mousePos.x, mousePos.y));
}
The Simulator can access the state of the input to perform simulations on the object which are then reflected back to the Client just as any replicated object is.
public void ProcessMousePosition()
{
var coherenceInput = GetComponent<CoherenceInput>();
var mousePos = coherenceInput.GetAxisState("mouse");
//Move object
}
Input Authority
Each object only accepts inputs from one specific Client, called the object's Input Authority.
When a Client spawns an object it automatically becomes the Input Authority for that object. The object's creator will retain control over the object even after state authority has been transferred to the Simulator.
If an object is spawned directly by the Simulator, you will need to assign the Input Authority manually. Use the TransferAuthority method on the CoherenceSync component to assign or re-assign a Client that will take control of the object:
public void AssignNewInputAuthority(CoherenceClientConnection newInputOwner)
{
var coherenceSync = GetComponent<CoherenceSync>();
coherenceSync.TransferAuthority(newInputOwner.ClientId, AuthorityType.Input);
}
The ClientId used to specify Input Authority can currently only be accessed from the ClientConnection class. For detailed information about setting up the ClientConnection Prefab, see the Client connections page.
Use the OnInputAuthority and OnInputRemote events on the CoherenceSync component to be notified whenever an object changes input authority.
Only the object's current State Authority is allowed to transfer Input Authority.
In order to get notified when the Simulator (or host) takes state authority of the input you can use the OnInputSimulatorConnected event from the CoherenceSync component.
The OnInputSimulatorConnected event can also be raised on the Simulator or host if they have both input and state authority over an entity. This allows the session host to use inputs just like any other client but might be undesirable if input entities are created on the host and then have their input authority transferred to the clients.
To solve this you can check the CoherenceSync.IsSimulatorOrHost flag in the callback:
coherenceSync.OnInputSimulatorConnected.AddListener(() =>
{
if (coherenceSync.MonoBridge.IsSimulatorOrHost)
{
// Ignore for Simulators and hosts.
return;
}
// Insert your game logic here
Debug.Log("Input ready for use!");
});
Server-authoritative network visibility
The CoherenceLiveQuery component can be used to limit the visible portion of the Game World that a player is allowed to see. The Replication Server filters out networked objects that are outside the range of the LiveQuery so that players can't cheat by inspecting the incoming network traffic.
The "Server Side With Client Input" option is available in CoherenceSync Inspector.
When a query component is placed on a Game Object that is set to Server Side With Client Inputs the query visibility will be applied to the Game Object's Input Authority (i.e., the player) while the component remains in control of the State Authority (i.e. the Simulator). This prevents players from viewing other parts of the map by simply manipulating the radius or position of the query component.
See Area of interest for more information on how to use queries.
Client-side prediction
Using Server-side simulation takes a significantly longer period of time from the Client providing input until the game state is updated, compared to just using Client-side simulation. That's because of the time required for the input to be sent to the Simulator, processed, and then the updates to the object returned across the network. This round-trip time results in an input lag that can make controls feel awkward and slow to respond.
If you want to use a Server-authoritative setup without sacrificing input responsiveness, you need to use Client-side prediction. With Client-side prediction enabled, incoming network data is ignored for one or more bindings, allowing the Client to predict those values locally. Usually, position and rotation are predicted for the local player, but you can toggle Client-side prediction for any binding in the Configuration window.
Client-side prediction is toggled using the P-button to the right of each binding in the Configuration window.
By processing inputs both on the Client and on the Server, the Client can make a prediction of where the player is heading without having to wait for the authoritative Server response. This provides immediate input feedback and a more responsive playing experience.
Note that inputs should not be processed for Clients that neither have State Authority nor Input Authority. That's because we can only predict the local player; remote players and other networked objects are synced just as normal.
public void Update()
{
if (coherenceSync.HasStateAuthority || coherenceSync.HasInputAuthority)
{
ProcessMousePosition();
}
if (coherenceSync.HasInputAuthority)
{
SendMousePosition();
}
}
Misprediction and Server Reconciliation
With Client-side prediction enabled, the predicted Client state will sometimes diverge from the Server state. This is called misprediction. When misprediction occurs, you will need to adjust the Client state to match the Server state in one way or another. This is called Server Reconciliation.
There are many possible approaches to Server Reconciliation and coherence doesn't favor one over another. The simplest method is to snap the Client state to the Server state once a misprediction is detected. Another method is to continuously blend from Client state to Server state.
Misprediction detection and reconciliation can be implemented in a binding's OnNetworkSampleReceived event callback. This event is called every time new network data arrives, so we can test the incoming data to see if it matches with our local Client state.
private void Awake()
{
var positionBinding = GetComponent<CoherenceSync>().Bindings.FirstOrDefault(c => c.Name == "position");
positionBinding.OnNetworkSampleReceived += DetectMisprediction;
}
private void DetectMisprediction(object sampleData, long simulationFrame)
{
const float MispredictionThreshold = 3;
var networkPosition = (Vector3)sampleData;
var distance = (networkPosition - transform.position).magnitude;
if (distance > MispredictionThreshold)
{
transform.position = networkPosition;
}
}
The misprediction threshold is a measure of how far the prediction is allowed to drift from the Server state. Its value will depend on how fast your player is moving and how much divergence is acceptable in your particular game.
Remember that incoming sample data is delayed by the round-trip time to the Server, so it will trail the currently predicted state by at least a few frames, depending on network latency. The simulationFrame parameter tells you the exact frame at which the sample was produced on the authoritative Server.
For better accuracy, incoming network samples should be compared to the predicted state at the corresponding simulation frame. This requires keeping a history buffer of predicted states in memory.
Client as a host
This feature is in the experimental phase.
A client-hosted session is an alternative way to use CoherenceInput in Server Side With Client Input mode that doesn't require a Simulator.
A Client that created a Room can join as a Host of this Room. Just like a Simulator, the Host will take over the State Authority of the CoherenceInput objects while leaving the Input Authority in the hands of the Client that created those objects.
The difference between a Host and a Simulator is that the Host is still a standard client connection, which means it counts towards the Room's client limit and will show up as a client connection in the connection list.
Usage
To connect as a Host all we have to do is call CoherenceMonoBridge.ConnectAsHost:
public async Task CreateRoomAndJoinAsHost(string region)
{
RoomData roomData = await PlayResolver.CreateRoom(region);
(EndpointData roomEndpoint, bool isEndpointValid) = PlayResolver.GetRoomEndpointData(roomData);
if (!isEndpointValid)
{
throw new Exception($"Invalid room endpoint: {roomEndpoint}");
}
CoherenceMonoBridge monoBridge = GetComponent<CoherenceMonoBridge>();
monoBridge.onConnected.AddListener(OnConnected);
monoBridge.ConnectAsHost(roomEndpoint);
}
public void OnConnected(CoherenceMonoBridge monoBridge)
{
Debug.Log($"Connected! Is Host: {monoBridge.IsSimulatorOrHost}");
}
|
__label__pos
| 0.93804 |
Source code for pywbem_mock._inmemoryrepository
#
# (C) Copyright 2020 InovaDevelopment.comn
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this program; if not, write to the Free Software
# Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
#
# Author: Karl Schopmeyer <inovadevelopment.com>
#
"""
The class :class:`~pywbem_mock.InMemoryRepository` implements a CIM repository
that stores the CIM objects in memory. It contains an object store
(:class:`~pywbem_mock.InMemoryObjectStore`) for each type of CIM object
(classes, instances, qualifier declarations) and for each CIM namespace in the
repository. Each object store for a CIM object type contains the CIM objects
of that type in a single CIM namespace.
The CIM repository of a mock WBEM server represented by a
:class:`~pywbem_mock.FakedWBEMConnection` object is a
:class:`~pywbem_mock.InMemoryRepository` object that is created and destroyed
automatically when the
:class:`~pywbem_mock.FakedWBEMConnection` object is created and destroyed.
The CIM repository of a mock WBEM server is accessible through its
:attr:`pywbem_mock.FakedWBEMConnection.cimrepository` property.
"""
from __future__ import absolute_import, print_function
from copy import deepcopy
import six
from nocaselist import NocaseList
from pywbem import CIMClass, CIMQualifierDeclaration, CIMInstance
from pywbem._nocasedict import NocaseDict
from pywbem._utils import _format
from ._baserepository import BaseObjectStore, BaseRepository
from ._utils import _uprint
__all__ = ['InMemoryRepository', 'InMemoryObjectStore']
[docs] class InMemoryObjectStore(BaseObjectStore): """ A store for CIM objects of a single type (CIM classes, CIM instances, or CIM qualifier declarations) that maintains its data in memory. *New in pywbem 1.0 as experimental and finalized in 1.2.* """ # Documentation for the methods and properties inherited from # ~pywbem_mock:`BaseObjectStore` is also inherited in the pywbem # documentation. Therefore the methods in this class that are derived # from abstrace methods have no documentation string. # pylint: disable=line-too-long def __init__(self, cim_object_type): super(InMemoryObjectStore, self).__init__(cim_object_type) self._copy_names = False # Define the dictionary that implements the object store. # The keys in this dictionary are the names of the objects and # the values the corresponding CIM objects. if cim_object_type.__name__ in ("CIMClass", 'CIMQualifierDeclaration'): self._data = NocaseDict() elif cim_object_type.__name__ == 'CIMInstance': self._data = {} self._copy_names = True else: assert False, "InMemoryObjectStore: Invalid input parameter {}." \ .format(cim_object_type)
[docs] def __repr__(self): return _format('InMemoryObjectStore(type={0}, dict={1}, size={2}', self._cim_object_type, type(self._data), len(self._data))
[docs] def object_exists(self, name): return name in self._data
[docs] def get(self, name, copy=True): """ Get with deepcopy because the pywbem .copy is only middle level and we need to completely isolate the repository. """ # pylint: disable=no-else-return if name in self._data: if copy: return deepcopy(self._data[name]) return self._data[name] else: raise KeyError('Name {} not in {} object store' .format(name, self._cim_object_type))
[docs] def create(self, name, cim_object): assert isinstance(cim_object, self._cim_object_type) if name in self._data: raise ValueError('Name "{}" already in {} object store' .format(name, self._cim_object_type)) # Add with deepcopy to completely isolate the copy in the repository self._data[name] = deepcopy(cim_object)
[docs] def update(self, name, cim_object): assert isinstance(cim_object, self._cim_object_type) if name not in self._data: raise KeyError('Name "{}" not in {} object store' .format(name, self._cim_object_type)) # Replace the existing object with a copy of the input object self._data[name] = (cim_object)
[docs] def delete(self, name): if name in self._data: del self._data[name] else: raise KeyError('Name "{}" not in {} object store' .format(name, self._cim_object_type))
[docs] def iter_names(self): """ Only copies the names for those objects that use CIMNamespaceName as the name. The others are immutable ex. classname. """ for name in six.iterkeys(self._data): if self._copy_names: # Using .copy is sufficient for CIMNamespace name. yield name.copy() else: yield name
[docs] def iter_values(self, copy=True): for value in six.itervalues(self._data): if copy: yield deepcopy(value) else: yield value
[docs] def len(self): return len(self._data)
[docs] class InMemoryRepository(BaseRepository): """ A CIM repository that maintains the data in memory using the methods defined in its superclass (~pywbem_mock:`BaseObjectStore`). *New in pywbem 1.0 as experimental and finalized in 1.2.* This implementation creates the repository as multi-level dictionary elements to define the namespaces and within each namespace the CIM classes, CIM instances, and CIM qualifiers in the repository. """ # Documentation for the methods and properties isinherited from # ~pywbem_mock:`BaseObjectStore` by sphinx when building documentaton. # Therefore the methods in this class have no documentation # string unless they add or modify documentation in the parent class or # are not defined in the parent class. Any method that needs to modifyu # the base method documentation must copy the base class documentation. def __init__(self, initial_namespace=None): """ Initialize an empty in-memory CIM repository and optionally add a namespace in the repository.. Parameters: initial_namespace (:term:`string` or None): Optional initial namespace that will be added to the CIM repository. """ # Defines the top level NocaseDict() which defines the # namespaces in the repository. The keys of this dictionary # are namespace names and the values are dictionaries # defining the CIM classes, CIM instances, and CIM qualifier # declarations where the keys are "classes", "instances", and # "qualifiers" and the value for each is an instance of the # class InMemoryObjectStore that containe the CIM objects. self._repository = NocaseDict() # If an initial namespace is defined, add it to the repository if initial_namespace: self.add_namespace(initial_namespace)
[docs] def __repr__(self): """Display summary of the repository""" return _format( "InMemoryRepository(data={s._repository})", s=self)
[docs] def print_repository(self, dest=None): """ Print the CIM repository to a destination. This displays information on the items in the data base and is only a diagnostic tool. Parameters: dest (:term:`string`): File path of an output file. If `None`, the output is written to stdout. """ def objstore_info(objstore_name): """ Display the data for the object store """ for ns in self._repository: if objstore_name == 'class': store = self.get_class_store(ns) elif objstore_name == 'qualifier': store = self.get_qualifier_store(ns) else: assert objstore_name == 'instance' store = self.get_instance_store(ns) rtn_str = u'Namespace: {} Repo: {} len:{}\n'.format( ns, objstore_name, store.len()) for val in store.iter_values(): rtn_str += (u'{}\n'.format(val)) return rtn_str namespaces = ",".join(self._repository.keys()) _uprint(dest, _format(u'NAMESPACES: {0}', namespaces)) _uprint(dest, _format(u'QUALIFIERS: {0}', objstore_info('qualifier'))) _uprint(dest, _format(u'CLASSES: {0}', objstore_info('class'))) _uprint(dest, _format(u'INSTANCES: {0}', objstore_info('instance')))
[docs] def validate_namespace(self, namespace): if namespace is None: raise ValueError("Namespace argument must not be None") namespace = namespace.strip('/') try: self._repository[namespace] except KeyError: raise KeyError('Namespace "{}" does not exist in repository'. format(namespace))
[docs] def add_namespace(self, namespace): if namespace is None: raise ValueError("Namespace argument must not be None") namespace = namespace.strip('/') if namespace in self._repository: raise ValueError('Namespace "{}" already in repository'. format(namespace)) self._repository[namespace] = {} # Create the data store for each of the object types. self._repository[namespace]['classes'] = InMemoryObjectStore(CIMClass) self._repository[namespace]['instances'] = InMemoryObjectStore( CIMInstance) self._repository[namespace]['qualifiers'] = InMemoryObjectStore( CIMQualifierDeclaration)
[docs] def remove_namespace(self, namespace): self.validate_namespace(namespace) namespace = namespace.strip('/') if self.get_class_store(namespace).len() != 0 or \ self.get_qualifier_store(namespace).len() != 0 or \ self.get_instance_store(namespace).len() != 0: raise ValueError('Namespace {} removal invalid. Namespace not ' 'empty'.format(namespace)) del self._repository[namespace]
@property def namespaces(self): # pylint: disable=invalid-overridden-method # This puts just the dict keys (i.e. namespaces) into the list return NocaseList(self._repository)
[docs] def get_class_store(self, namespace): if namespace is None: raise ValueError("Namespace None not permitted.") namespace = namespace.strip('/') self.validate_namespace(namespace) return self._repository[namespace]['classes']
[docs] def get_instance_store(self, namespace): if namespace is None: raise ValueError("Namespace None not permitted.") namespace = namespace.strip('/') self.validate_namespace(namespace) return self._repository[namespace]['instances']
[docs] def get_qualifier_store(self, namespace): if namespace is None: raise ValueError("Namespace None not permitted.") namespace = namespace.strip('/') self.validate_namespace(namespace) return self._repository[namespace]['qualifiers']
[docs] def load(self, other): """ Replace the data in this object with the data from the other object. This is used to restore the object from a serialized state, without changing its identity. """ # pylint: disable=protected-access self._repository = other._repository
|
__label__pos
| 0.996501 |
Skalarmultiplikation
Am Ende dieses Artikels findest du meinen Online-Rechner zur Durchführung einer Skalarmultiplikation. Zunächst wiederholen wir alles, was du zu diesem Thema wissen musst.
Hauptartikel: Skalarmultiplikation
Wiederholung: Skalarmultiplikation
Bei der Skalarmultiplikation multiplizieren wir einen Skalar \(\lambda\) („Lambda“) mit einem Vektor \(\vec{v}\).
Skalarmultiplikation
(1) \(\quad \lambda \cdot \vec{a} = \lambda \cdot \begin{pmatrix} a_1 \\ a_2 \end{pmatrix} = \begin{pmatrix} \lambda \cdot a_1 \\ \lambda \cdot a_2 \end{pmatrix}\)
(2) \(\quad \lambda \cdot \vec{a} = \lambda \cdot \begin{pmatrix} a_1 \\ a_2 \\ a_3 \end{pmatrix} = \begin{pmatrix} \lambda \cdot a_1 \\ \lambda \cdot a_2 \\ \lambda \cdot a_3 \end{pmatrix}\)
Anmerkungen
Das Symbol \(\lambda\) ist der griechische Kleinbuchstabe „Lambda“.
\(\lambda\) wird hier als Platzhalter für eine beliebige reelle Zahl verwendet.
Beispiel
...siehe Artikel zur Skalarmultiplikation
Online-Rechner: Skalarmultiplikation
Im Folgenden erkläre ich dir kurz, wie der Rechner funktioniert. Mach dir keine Sorgen:
Du musst weder Mathe- noch Technik-Freak sein, um mit dem Teil zurechtzukommen ;)
Eingabe
Eingabefeld 1: Skalar (eine reelle Zahl)
Eingabefeld 2: Vektor
Koordinaten werden durch Kommas voneinander getrennt.
Beispiel: (3,-4) (Bedeutung: \(\vec{v} = \begin{pmatrix} 3 \\ -4 \end{pmatrix}\))
Dezimalzahlen werden mit Punkt als Trennzeichen eingegeben.
Beispiel: (1,1.5,2) (Bedeutung: \(\vec{v} = \begin{pmatrix} 1 \\ 1{,}5 \\ 2 \end{pmatrix}\))
Bruchzahlen werden mit Schrägstrich eingeben.
Beispiel: (-1/3,3) (Bedeutung: \(\vec{v} = \begin{pmatrix} -\frac{1}{3} \\ 3 \end{pmatrix}\))
Ausgabe
Den mit dem Skalar multiplizierten Vektor
Der Rechner gibt das Ergebnis in anderer Schreibweise aus, als wir es gewohnt sind.
Beispiel: {-7.5,2.5} meint den Vektor \(\vec{v} = \begin{pmatrix} -7{,}5 \\ 2{,}5 \end{pmatrix}\).
Beispiel
Berechne \(-2,5 \cdot \begin{pmatrix} 3 \\ -1 \end{pmatrix}\).
Um das Beispiel zu berechnen, kannst du einfach auf „Jetzt berechnen“ klicken!
(Ich habe die Werte aus der Aufgabe für dich bereits in den Rechner eingegeben.)
Andreas Schneider
Mein Name ist Andreas Schneider und ich betreibe seit 2013 hauptberuflich die kostenlose und mehrfach ausgezeichnete Mathe-Lernplattform www.mathebibel.de. Jeden Monat werden meine Erklärungen von bis zu 1 Million Schülern, Studenten, Eltern und Lehrern aufgerufen. Nahezu täglich veröffentliche ich neue Inhalte. Abonniere jetzt meinen Newsletter und erhalte 3 meiner 46 eBooks gratis!
|
__label__pos
| 0.98994 |
GEORGE DANTZIG METODO SIMPLEX PDF
PHPSimplex is an online tool for solving linear programming problems. PHPSimplex is able to solve problems using the Simplex method, Two-Phase Biography and interview with George Bernard Dantzig, American mathematician who. Este método conforma la base de la programación lineal y es debido a este George Dantzig, Dato, Algoritmo símplex, Ingeniería de software, Método iterativo. El método Simplex George Bernard Dantzig Calidad control estadístico de from INTRO INGE at Universidad Distrital Francisco Jose de Caldas.
Author: Tygotaur Julrajas
Country: Moldova, Republic of
Language: English (Spanish)
Genre: Marketing
Published (Last): 13 May 2016
Pages: 50
PDF File Size: 13.62 Mb
ePub File Size: 19.2 Mb
ISBN: 314-7-80702-842-8
Downloads: 98193
Price: Free* [*Free Regsitration Required]
Uploader: Mekasa
Years later another sinplex, Abraham Waldwas preparing to publish metdo article that arrived at a conclusion for the second problem, and included Dantzig as its co-author when he learned of the earlier solution.
The computing power required to test all the permutations to select the best assignment is vast; the number of possible metoo exceeds the number of particles in the universe.
This page was last edited on 9 Decemberat Near the beginning of a class for which Dantzig was late, professor Jerzy Neyman wrote two examples of famously unsolved sinplex problems on the blackboard. Other algorithms for solving linear-programming problems are described in the linear-programming article.
Dantzig’s original example of finding the best assignment of 70 people to 70 jobs exemplifies the usefulness of linear programming. The founders of this subject are Leonid Kantorovicha Russian mathematician who developed linear programming problems inDantzig, who published the simplex method inand John von Neumannwho developed the theory of the duality in the same year.
A fresh view on pivot algorithms”. The zero in the first column represents the zero vector of the same dimension as vector b. The first row defines the objective function and the remaining rows dantizg the constraints.
ATLASUL GEOGRAFIC AL ROMANIEI PDF
If the minimum is 0 then the artificial variables can be eliminated from the resulting canonical tableau producing a canonical tableau equivalent to the original problem.
Optimization algorithms and methods in computer science Exchange algorithms Linear programming Computer-related introductions in The simplex algorithm proceeds by performing successive pivot operations each of which give simplez improved basic feasible solution; the choice of pivot element at each step is largely determined by the requirement that this pivot improves the solution.
The simplex algorithm has polynomial-time ssimplex complexity under various probability distributionswith the precise average-case performance of the simplex algorithm depending on the choice of a probability distribution for the random matrices.
If there is more than one column so that the entry in the objective row is positive then the choice of which one to add to the set of basic variables is somewhat arbitrary and several entering variable choice rules [21] such as Devex algorithm [22] have been developed. Quate John Roy Whinnery Dantzig Prizebestowed every three years since on one or two people who have made a significant impact in the field of mathematical programming.
Herman Goldstine Isadore Singer Felix Browder Ronald R. Mathematical, statistical, and computer sciences. Padberg, Linear Optimization and Extensions: Thomas Cech Isabella L.
George Dantzig – Wikipedia
Fishburn Peter Whittle Fred W. This can be accomplished by the introduction of artificial variables. Another method to analyze the performance of the simplex algorithm studies the behavior of worst-case scenarios under small perturbation — are worst-case scenarios stable under a small change in the sense of structural stabilityor do they become tractable? This does not change the set of feasible solutions or the optimal solution, and it ensures that the slack variables will constitute an initial feasible solution.
Berni Alder James E. Curtis Eaves and Michael A. The simplex algorithm applied to the Phase I problem must terminate with a minimum value for the new objective function since, being the sum of nonnegative variables, its value is bounded below by 0. By using this site, you agree to the Terms of Use and Privacy Policy.
ABRAHAM VATEK PDF
The Annals of Mathematical Statistics. Golomb Barry Mazur Colwell Nina Fedoroff Lubert Stryer Once the pivot column has been selected, the choice of pivot row is largely determined by the requirement that the resulting solution be feasible.
Simplex algorithm
This variable represents the difference between the two sides of the inequality and is assumed to be non-negative. Sigma Series in Applied Mathematics. In dantaig first step, known as Phase I, a starting extreme point is found.
skmplex Analyzing and quantifying the observation that the simplex algorithm is efficient in practice, even though it has exponential worst-case complexity, has led to the development of other measures of complexity. The artificial variables are now 0 and they may be dropped giving a canonical tableau equivalent to the original problem:. Alpher Lonnie Thompson The new tableau is in canonical form but it is metldo equivalent to the original problem. Padberg Ward Whitt Donald L. Roald Hoffmann George C.
After a two-year period at dantsig Bureau of Labor Statistics, he enrolled in the doctoral program in mathematics at the University of California, Berkeleywhere he studied statistics under Jerzy Neyman. In this way, all lower bound constraints may be changed to non-negativity restrictions. Golden-section search Interpolation methods Line search Nelder—Mead method Successive parabolic interpolation. From Wikipedia, the free encyclopedia. Marshall Harvey Stone
Author: admin
|
__label__pos
| 0.70986 |
Search This Blog
Sunday, April 13, 2008
Mathematical Markup Language (MathML) Version 3.0 Draft Published
W3C's Math Working Group has published a Working Draft of "Mathematical
Markup Language (MathML) Version 3.0." This is the third draft of
MathML, an XML application for describing mathematical notation and
capturing both its structure and content. The specification defines the
Mathematical Markup Language, or MathML, as an XML application for
describing mathematical notation and capturing both its structure and
content. The goal of MathML is to enable mathematics to be served,
received, and processed on the World Wide Web, just as HTML has enabled
this functionality for text. This specification of the markup language
MathML is intended primarily for a readership consisting of those who
will be developing or implementing renderers or editors using it, or
software that will communicate using MathML as a protocol for input or
output. It is not a User's Guide but rather a reference document. MathML
can be used to encode both mathematical notation and mathematical
content. About thirty-five of the MathML tags describe abstract
notational structures, while another about one hundred and seventy
provide a way of unambiguously specifying the intended meaning of an
expression. Additional chapters discuss how the MathML content and
presentation elements interact, and how MathML renderers might be
implemented and should interact with browsers. Finally, this document
addresses the issue of special characters used for mathematics, their
handling in MathML, their presence in Unicode, and their relation to
fonts. While MathML is human-readable, in all but the simplest cases,
authors use equation editors, conversion programs, and other specialized
software tools to generate MathML. Several versions of such MathML
tools exist, and more, both freely available software and commercial
products, are under development.
1 comment:
Anonymous said...
You can buy Cialis 2.0, thisprogram let you run many applications in a time using the less memory ram in the cpu and clearing usless data at the same time.
Thanks
|
__label__pos
| 0.944056 |
org.apache.commons.math3.optimization
Class SimpleVectorValueChecker
java.lang.Object
extended by org.apache.commons.math3.optimization.AbstractConvergenceChecker<PointVectorValuePair>
extended by org.apache.commons.math3.optimization.SimpleVectorValueChecker
All Implemented Interfaces:
ConvergenceChecker<PointVectorValuePair>
Deprecated. As of 3.1 (to be removed in 4.0).
@Deprecated
public class SimpleVectorValueChecker
extends AbstractConvergenceChecker<PointVectorValuePair>
Simple implementation of the ConvergenceChecker interface using only objective function values. Convergence is considered to have been reached if either the relative difference between the objective function values is smaller than a threshold or if either the absolute difference between the objective function values is smaller than another threshold for all vectors elements.
The converged method will also return true if the number of iterations has been set (see this constructor).
Since:
3.0
Version:
$Id: SimpleVectorValueChecker.java 1422230 2012-12-15 12:11:13Z erans $
Constructor Summary
SimpleVectorValueChecker()
Deprecated. See AbstractConvergenceChecker.AbstractConvergenceChecker()
SimpleVectorValueChecker(double relativeThreshold, double absoluteThreshold)
Deprecated. Build an instance with specified thresholds.
SimpleVectorValueChecker(double relativeThreshold, double absoluteThreshold, int maxIter)
Deprecated. Builds an instance with specified tolerance thresholds and iteration count.
Method Summary
boolean converged(int iteration, PointVectorValuePair previous, PointVectorValuePair current)
Deprecated. Check if the optimization algorithm has converged considering the last two points.
Methods inherited from class org.apache.commons.math3.optimization.AbstractConvergenceChecker
getAbsoluteThreshold, getRelativeThreshold
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Constructor Detail
SimpleVectorValueChecker
@Deprecated
public SimpleVectorValueChecker()
Deprecated. See AbstractConvergenceChecker.AbstractConvergenceChecker()
Build an instance with default thresholds.
SimpleVectorValueChecker
public SimpleVectorValueChecker(double relativeThreshold,
double absoluteThreshold)
Deprecated.
Build an instance with specified thresholds. In order to perform only relative checks, the absolute tolerance must be set to a negative value. In order to perform only absolute checks, the relative tolerance must be set to a negative value.
Parameters:
relativeThreshold - relative tolerance threshold
absoluteThreshold - absolute tolerance threshold
SimpleVectorValueChecker
public SimpleVectorValueChecker(double relativeThreshold,
double absoluteThreshold,
int maxIter)
Deprecated.
Builds an instance with specified tolerance thresholds and iteration count. In order to perform only relative checks, the absolute tolerance must be set to a negative value. In order to perform only absolute checks, the relative tolerance must be set to a negative value.
Parameters:
relativeThreshold - Relative tolerance threshold.
absoluteThreshold - Absolute tolerance threshold.
maxIter - Maximum iteration count.
Throws:
NotStrictlyPositiveException - if maxIter <= 0.
Since:
3.1
Method Detail
converged
public boolean converged(int iteration,
PointVectorValuePair previous,
PointVectorValuePair current)
Deprecated.
Check if the optimization algorithm has converged considering the last two points. This method may be called several times from the same algorithm iteration with different points. This can be detected by checking the iteration number at each call if needed. Each time this method is called, the previous and current point correspond to points with the same role at each iteration, so they can be compared. As an example, simplex-based algorithms call this method for all points of the simplex, not only for the best or worst ones.
Specified by:
converged in interface ConvergenceChecker<PointVectorValuePair>
Specified by:
converged in class AbstractConvergenceChecker<PointVectorValuePair>
Parameters:
iteration - Index of current iteration
previous - Best point in the previous iteration.
current - Best point in the current iteration.
Returns:
true if the arguments satify the convergence criterion.
Copyright © 2003-2012 The Apache Software Foundation. All Rights Reserved.
|
__label__pos
| 0.792289 |
Skip to main content
Posts
Showing posts from June, 2012
How do I clean up old large files on Linux?
Many people who have run Linux file servers and ftp servers have at some point wanted to free up some space. One good algorithm to do this efficiently is to remove old data starting with the largest files first. So how to generate such a list? One method is to use a " find -exec du " command: find /path/to/full/file/system -type f -mtime +10 -exec du -sk {} \; | sort -n > /var/tmp/list_of_files_older_than_10_days_sorted_by_size Once you have that list, you can selectively delete files from the bottom of it. Note that the list will likely be exponentially sorted. That is, the bottom 10% of the list will take up a huge chunk of the used storage space.
How the find the Active Directory Domain Controllers listed in DNS on Linux...
Assumptions: You have the "host" utility from BIND. You can do a zone transfer from the local DNS server Your Active Directory admins have properly configured DNS for Active Directory If you have the above, use the following command: host -t srv -l your.active.directory.dns.domain | grep _kerberos._tcp.*._sites.dc._msdcs.your.active.directory.dns.domain Replace your.active.directory.dns.domain with your actual AD DNS domain.
On Linux, how do I set the PATH for non-interactive, non-login shells? e.g. for the case of rksh?
Non-interactive, non-login, shells inherit the PATH from the ssh process, so we must set the PATH with ssh. Some shells, like Korn Shell (ksh, rksh, pksh), only parse user environment files in login shells, so there's no way to change the inherited environment in non-interactive, non-login shells. To set the path globally, build a custom ssh with the needed default path. To set the path for a particular user, first configure ssh to use custom environments by enabling "PermitUserEnvironment" in /etc/ssh/sshd_config: PermitUserEnvironment yes Restart sshd Then set the path in that user's authorized_keys file or using ~/.ssh/environment. Note that you need to set all of the important shell variables. The existence of ~/.ssh/environment seems to preclude the setting of default environmental variable values. So, for example, given a location for binaries for rksh (restricted korn shell), /usr/restricted/bin, place the following in ~/.ssh/environment: HOME=/home/u
|
__label__pos
| 0.830082 |
aboutsummaryrefslogtreecommitdiffstats
path: root/fs/udf/file.c
blob: 77b5953eaac87f708ed0ff6889eff5775dd3b465 (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
/*
* file.c
*
* PURPOSE
* File handling routines for the OSTA-UDF(tm) filesystem.
*
* COPYRIGHT
* This file is distributed under the terms of the GNU General Public
* License (GPL). Copies of the GPL can be obtained from:
* ftp://prep.ai.mit.edu/pub/gnu/GPL
* Each contributing author retains all rights to their own work.
*
* (C) 1998-1999 Dave Boynton
* (C) 1998-2004 Ben Fennema
* (C) 1999-2000 Stelias Computing Inc
*
* HISTORY
*
* 10/02/98 dgb Attempt to integrate into udf.o
* 10/07/98 Switched to using generic_readpage, etc., like isofs
* And it works!
* 12/06/98 blf Added udf_file_read. uses generic_file_read for all cases but
* ICBTAG_FLAG_AD_IN_ICB.
* 04/06/99 64 bit file handling on 32 bit systems taken from ext2 file.c
* 05/12/99 Preliminary file write support
*/
#include "udfdecl.h"
#include <linux/fs.h>
#include <asm/uaccess.h>
#include <linux/kernel.h>
#include <linux/string.h> /* memset */
#include <linux/capability.h>
#include <linux/errno.h>
#include <linux/pagemap.h>
#include <linux/buffer_head.h>
#include <linux/aio.h>
#include "udf_i.h"
#include "udf_sb.h"
static void __udf_adinicb_readpage(struct page *page)
{
struct inode *inode = page->mapping->host;
char *kaddr;
struct udf_inode_info *iinfo = UDF_I(inode);
kaddr = kmap(page);
memcpy(kaddr, iinfo->i_ext.i_data + iinfo->i_lenEAttr, inode->i_size);
memset(kaddr + inode->i_size, 0, PAGE_CACHE_SIZE - inode->i_size);
flush_dcache_page(page);
SetPageUptodate(page);
kunmap(page);
}
static int udf_adinicb_readpage(struct file *file, struct page *page)
{
BUG_ON(!PageLocked(page));
__udf_adinicb_readpage(page);
unlock_page(page);
return 0;
}
static int udf_adinicb_writepage(struct page *page,
struct writeback_control *wbc)
{
struct inode *inode = page->mapping->host;
char *kaddr;
struct udf_inode_info *iinfo = UDF_I(inode);
BUG_ON(!PageLocked(page));
kaddr = kmap(page);
memcpy(iinfo->i_ext.i_data + iinfo->i_lenEAttr, kaddr, inode->i_size);
mark_inode_dirty(inode);
SetPageUptodate(page);
kunmap(page);
unlock_page(page);
return 0;
}
static int udf_adinicb_write_begin(struct file *file,
struct address_space *mapping, loff_t pos,
unsigned len, unsigned flags, struct page **pagep,
void **fsdata)
{
struct page *page;
if (WARN_ON_ONCE(pos >= PAGE_CACHE_SIZE))
return -EIO;
page = grab_cache_page_write_begin(mapping, 0, flags);
if (!page)
return -ENOMEM;
*pagep = page;
if (!PageUptodate(page) && len != PAGE_CACHE_SIZE)
__udf_adinicb_readpage(page);
return 0;
}
static int udf_adinicb_write_end(struct file *file,
struct address_space *mapping,
loff_t pos, unsigned len, unsigned copied,
struct page *page, void *fsdata)
{
struct inode *inode = mapping->host;
unsigned offset = pos & (PAGE_CACHE_SIZE - 1);
char *kaddr;
struct udf_inode_info *iinfo = UDF_I(inode);
kaddr = kmap_atomic(page);
memcpy(iinfo->i_ext.i_data + iinfo->i_lenEAttr + offset,
kaddr + offset, copied);
kunmap_atomic(kaddr);
return simple_write_end(file, mapping, pos, len, copied, page, fsdata);
}
static ssize_t udf_adinicb_direct_IO(int rw, struct kiocb *iocb,
const struct iovec *iov,
loff_t offset, unsigned long nr_segs)
{
/* Fallback to buffered I/O. */
return 0;
}
const struct address_space_operations udf_adinicb_aops = {
.readpage = udf_adinicb_readpage,
.writepage = udf_adinicb_writepage,
.write_begin = udf_adinicb_write_begin,
.write_end = udf_adinicb_write_end,
.direct_IO = udf_adinicb_direct_IO,
};
static ssize_t udf_file_aio_write(struct kiocb *iocb, const struct iovec *iov,
unsigned long nr_segs, loff_t ppos)
{
ssize_t retval;
struct file *file = iocb->ki_filp;
struct inode *inode = file->f_path.dentry->d_inode;
int err, pos;
size_t count = iocb->ki_left;
struct udf_inode_info *iinfo = UDF_I(inode);
down_write(&iinfo->i_data_sem);
if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
if (file->f_flags & O_APPEND)
pos = inode->i_size;
else
pos = ppos;
if (inode->i_sb->s_blocksize <
(udf_file_entry_alloc_offset(inode) +
pos + count)) {
err = udf_expand_file_adinicb(inode);
if (err) {
udf_debug("udf_expand_adinicb: err=%d\n", err);
return err;
}
} else {
if (pos + count > inode->i_size)
iinfo->i_lenAlloc = pos + count;
else
iinfo->i_lenAlloc = inode->i_size;
up_write(&iinfo->i_data_sem);
}
} else
up_write(&iinfo->i_data_sem);
retval = generic_file_aio_write(iocb, iov, nr_segs, ppos);
if (retval > 0)
mark_inode_dirty(inode);
return retval;
}
long udf_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
{
struct inode *inode = filp->f_dentry->d_inode;
long old_block, new_block;
int result = -EINVAL;
if (inode_permission(inode, MAY_READ) != 0) {
udf_debug("no permission to access inode %lu\n", inode->i_ino);
result = -EPERM;
goto out;
}
if (!arg) {
udf_debug("invalid argument to udf_ioctl\n");
result = -EINVAL;
goto out;
}
switch (cmd) {
case UDF_GETVOLIDENT:
if (copy_to_user((char __user *)arg,
UDF_SB(inode->i_sb)->s_volume_ident, 32))
result = -EFAULT;
else
result = 0;
goto out;
case UDF_RELOCATE_BLOCKS:
if (!capable(CAP_SYS_ADMIN)) {
result = -EACCES;
goto out;
}
if (get_user(old_block, (long __user *)arg)) {
result = -EFAULT;
goto out;
}
result = udf_relocate_blocks(inode->i_sb,
old_block, &new_block);
if (result == 0)
result = put_user(new_block, (long __user *)arg);
goto out;
case UDF_GETEASIZE:
result = put_user(UDF_I(inode)->i_lenEAttr, (int __user *)arg);
goto out;
case UDF_GETEABLOCK:
result = copy_to_user((char __user *)arg,
UDF_I(inode)->i_ext.i_data,
UDF_I(inode)->i_lenEAttr) ? -EFAULT : 0;
goto out;
}
out:
return result;
}
static int udf_release_file(struct inode *inode, struct file *filp)
{
if (filp->f_mode & FMODE_WRITE) {
down_write(&UDF_I(inode)->i_data_sem);
udf_discard_prealloc(inode);
udf_truncate_tail_extent(inode);
up_write(&UDF_I(inode)->i_data_sem);
}
return 0;
}
const struct file_operations udf_file_operations = {
.read = do_sync_read,
.aio_read = generic_file_aio_read,
.unlocked_ioctl = udf_ioctl,
.open = generic_file_open,
.mmap = generic_file_mmap,
.write = do_sync_write,
.aio_write = udf_file_aio_write,
.release = udf_release_file,
.fsync = generic_file_fsync,
.splice_read = generic_file_splice_read,
.llseek = generic_file_llseek,
};
static int udf_setattr(struct dentry *dentry, struct iattr *attr)
{
struct inode *inode = dentry->d_inode;
int error;
error = inode_change_ok(inode, attr);
if (error)
return error;
if ((attr->ia_valid & ATTR_SIZE) &&
attr->ia_size != i_size_read(inode)) {
error = udf_setsize(inode, attr->ia_size);
if (error)
return error;
}
setattr_copy(inode, attr);
mark_inode_dirty(inode);
return 0;
}
const struct inode_operations udf_file_inode_operations = {
.setattr = udf_setattr,
};
|
__label__pos
| 0.987823 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
PerlMonks
Re^2: What is Enterprise Software?
by brian_d_foy (Abbot)
on Oct 31, 2005 at 00:36 UTC ( #504096=note: print w/ replies, xml ) Need Help??
in reply to Re: What is Enterprise Software?
in thread What is Enterprise Software?
I found a lot of these glib answers on Google already.I think you mistake cause and correlation. Enterprise software may be complex and pricey, but I don't think that's what makes it enterprise software.
What if the software were complex, but free? Does that preclude it from being enterprising useful?
--
brian d foy <[email protected]>
Subscribe to The Perl Review
Comment on Re^2: What is Enterprise Software?
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://504096]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (10)
As of 2015-09-01 10:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
The oldest computer book still on my shelves (or on my digital media) is ...
Results (370 votes), past polls
|
__label__pos
| 0.809174 |
Why P(A|B)≠P(A|B,C)+P(A|B,¬C)P(A|B) \neq P(A | B,C) + P(A | B, \neg C)?
I suppose that
P(A|B)=P(A|B,C)P(C)+P(A|B,¬C)P(¬C)
is correct, whereas
P(A|B)=P(A|B,C)+P(A|B,¬C)
is incorrect.
However, I have got an “intuition” about the later one, that is, you consider the probability P(A | B) by splitting two cases (C or Not C). Why this intuition is wrong?
Answer
Suppose, as an easy counter example, that the probability P(A) of A is 1, regardless of the value of C. Then, if we take the incorrect equation, we get:
P(A|B)=P(A|B,C)+P(A|B,¬C)=1+1=2
That obviously can’t be correct, a probably cannot be greater than 1. This helps to build the intuition that you should assign a weight to each of the two cases proportional to how likely that case is, which results in the first (correct) equation..
That brings you closer to your first equation, but the weights are not completely right. See A. Rex’ comment for the correct weights.
Attribution
Source : Link , Question Author : zell , Answer Author : Dennis Soemers
Leave a Comment
|
__label__pos
| 0.991693 |
top of page
ISO 27001:2013 vs. ISO 27001:2022 – What has changed? An overview from the perspective of a senior information security expert at Blackfort Technology
Introduction: ISO 27001 is an essential standard for companies that want to keep their information security at the highest level. As an experienced senior information security expert at Blackfort Technology, I take a look at the differences between the 2013 version and the updated 2022 version. What are the new features and how can companies benefit from the changes?
1. Context of the changes: ISO 27001:2013 already laid the foundation for effective information security management. However, the 2022 update takes into account the ever-growing digital threats and the changing technology landscape.
2. Expanded scope: ISO 27001:2022 expands the scope to cover new technologies and ways of working. This enables companies to better manage their information security, including in relation to cloud computing, mobile technologies and remote work.
3. Risk-based approach: A significant update concerns the risk-based approach. ISO 27001:2022 places a greater focus on identifying and assessing risks to better support organization-wide decisions. This enables security measures to be more precisely tailored to the specific needs of a company.
4. Integration of data protection aspects: In view of growing data protection requirements, ISO 27001:2022 increasingly integrates data protection aspects. This means that companies can optimize not only their information security but also the protection of personal data in accordance with applicable data protection laws.
5. Flexible documentation requirements: The new guidelines offer a more flexible approach to documentation. This allows companies to make their processes more efficient while meeting the requirements of the standard.
Conclusion: The 2022 update of ISO 27001 reflects the ever-changing security landscape. Companies already certified to the 2013 version should see the changes as an opportunity to further strengthen their information security and better protect themselves against modern threats. As a senior information security expert at Blackfort Technology, I encourage companies to use the update as a strategic opportunity to update their security practices and prepare for the challenges of the future.
bottom of page
|
__label__pos
| 0.893204 |
Fill Methods in GDI+
This article has been excerpted from book "Graphics Programming with GDI+".
So far we have seen only the draw methods of the Graphics class. As we discussed earlier, pens are used to draw the outer boundary of graphics, shapes, and brushes are used to fill the interior of graphics shapes. In this section we will cover the Fill methods of the Graphics class. You can fill only certain graphics shapes; hence there are only a few Fill methods available in the Graphics class. Table 3.5 lists them.
The FillCloseCurve Method
FillCloseCurve fills the interior of a closed curve. The first parameter of FillClosedCurve is a brush. It can be solid brush, a hatch brush, or a gradient brush. The second parameter is an array of points. The third and fourth parameters are optional. The third parameter is a fill mode, which is resented by the FillMode enumeration.
The FillMode enumeration specifies the way the interior of a closed path is filled. It has two modes: alternate or winding. The values for alternate and winding are Alternate and Winding, respectively. The default mode is Alternate. The fill mode matters only if the curve intersects itself (see Section 3.2.1.10).
To fill a closed curve using FillClosed Curve, an application first creates a Brush object and an array of points for the curve. The application can then set the fill mode and tension (which is optional) and call FillClosedCurve.
Listing 3.24 creates an array of PointF structures and a SolidBrush object, and calls FillClosedCurve.
LISTING 3.24: Using FillClosedCurve to fill a closed curve
private
void Form1_Paint (object sender,
System.Windows.Forms.PaintEventArgs e)
{
// Create a pen
Pen bluePen = new Pen (Color.Blue, 1);
// Create an array of points
PointF pt1 = new PointF(40.0F, 50.0F);
PointF pt2 = new PointF(50.0F, 75.0F);
PointF pt3 = new PointF(100.0F, 115.0F);
PointF pt4 = new PointF(200.0F, 180.0F);
PointF pt5 = new PointF(200.0F, 90.0F);
PointF[] ptsArray =
{
pt1, pt2, pt3, pt4, pt5
};
// Fill a closed curve
float tension = 1.0F;
FillMode flMode = FillMode.Alternate;
SolidBrush blueBrush = new SolidBrush(Color.Blue);
e.Graphics.FillClosedCurve(blueBrush,ptsArray,flMode,tension);
// Dispose of object
blueBrush.Dispose();
}
TABLE 3.5: Graphics fill methods
MethodDescription
FillCloseCurve
Fills the interior of a closed cardinal spline curve defined by an array of Point structures.
FillEllipse
Fills the interior of an ellipse defined by a bounding rectangle specified by a pair of coordinates, a width and a height.
FillPath
Fills the interior of a GraphicsPath object.
FillPie
Fills the interior of a pie section defined by an ellipse specified by a pair of coordinates, a width, a height, and two radial lines.
FillPolygon
Fills the interior of a polygon defined by an array of points specified by Point structures.
FillRectangle
Fills the interior of a rectangle specified by a pair of a coordinates, a width, and a height.
FillRectangles
Fills the interiors of a series of rectangles specified by Rectangle structures.
FillRegion
Fills the interiors of a Region object.
Figure 3.36.jpg
FIGURE 3.36: Filing a closed curve
Figure 3.36 shows the output from Listing 3.24.
The FillEllipse Method
FillEllipse fills the interior of an ellipse. It takes a Brush object and rectangle coordinates.
To fill an ellipse using FillEllipse, an application creates a Brush and a rectangle and calls FillEllipse. Listing 3.25 creates three brushes and calls FillEllipse to fill an ellipse with a brush.
LISTING 3.25: Filling ellipses
private
void Form1_Paint(object sender,
System.Windows.Forms.PaintEventArgs e)
{
Graphics g = e.Graphics;
// Create brushes
SolidBrush redBrush = new SolidBrush(Color.Red);
SolidBrush blueBrush = new SolidBrush(Color.Blue);
SolidBrush greenBrush = new SolidBrush(Color.Green);
//Create a rectangle
Rectangle rect = new Rectangle(80, 80, 50, 50);
// Fill ellipses
g.FillEllipse(greenBrush, 40.0F, 40.0F, 130.0F, 130.0F);
g.FillEllipse(blueBrush, 60, 60, 90, 90);
g.FillEllipse(greenBrush, 100.0F, 90.0F, 10.0F, 30.0F);
// Dispose of objects
blueBrush.Dispose();
redBrush.Dispose();
greenBrush.Dispose();
}
Figure 3.37 shows the output from Listing 3.25.
Fig3.37.gif
FIGURE 3.37: Filling ellipses
The FillPath Method
FillPath fills the interior of a graphics path. To do this, an application creates Brush and Graphics objects and the calls FillPath, which takes a brush and a graphics path as arguments. Listing 3.26 create GraphicsPath and SolidBrush objects and calls FillPath.
LISTING 3.26: Filling a graphic path
private void Form1_Paint(object sender,
System.Windows.Forms.PaintEventArgs e)
{
// Create a solid brush
SolidBrush greenBrush = new SolidBrush(Color.Green);
// Create a graphics path
GraphicsPath path = new GraphicsPath();
// Add a line to the path
path.AddLine(20, 20, 103, 80);
// Add an ellipse to the path
path.AddEllipse(100, 50, 100, 100);
// Add three more lines
path.AddLine(195, 80, 300, 80);
path.AddLine(200, 100, 300, 100);
path.AddLine(195, 120, 300, 120);
// Create a rectangle and call AddRectangle
Rectangle rect = new Rectangle(50, 150, 300, 50);
path.AddRectangle(rect);
// Fill path
e.Graphics.FillPath(greenBrush, path);
// Dispose of object
greenBrush.Dispose();
}
}
Figure 3.38 shows the output from Listing 3.26. As the figure shows, the fill method fills all the covered areas of a graphics path.
Figure 3.38.jpg
FIGURE: 3.38: Filling a graphics path
The FillPie Method
FillPie fills a pie section with a specified brush. It takes four parameters: a brush, the rectangle of the ellipse, and the start and sweep angles. The following code calls FillPie.
g.FillPie(new SolidBrush (Color.Red),
0.0F, 0.0F, 100, 60, 0.0F, 90.0F);
The FillPolygon Method
FillPolygon fills a polygon with the specified brush. It takes three parameters: a brush, an array of points, and a fill mode. The FillMode enumeration defines the fill mode of the interior of the path. It provides two fill modes: Alternate and Winding. The default mode is Alternate.
In our application we will use a hatch brush. So far we have seen only a solid brush. A solid brush is a brush with one color only. A hatch brush is a brush with a hatch style and two colors. These colors work together to support the hatch style. The HatchBrush class represents a hatch brush.
The Code in Listing 3.27 uses FillPolygon to fill a polygon using the Winding mode.
LISTING 3.27: Filling a polygon
Graphics g = e.Graphics;
// Create a solid brush
SolidBrush
greenBrush = new SolidBrush (Color.Green);
// Create points for polygon
PointF
p1 = new PointF (40.0F, 50.0F);
PointF
p2 = new PointF (60.0F, 70.0F);
PointF
p3 = new PointF (80.0F, 34.0F);
PointF
p4 = new PointF (120.0F, 180.0F);
PointF
p5 = new PointF (200.0F, 150.0F);
PointF
[] ptsArray =
{
p1, p2, p3, p4, p5
};
// Draw polygon
e.Graphics.FillPolygon (greenBrush, ptsArray);
// Dispose of objects
greenBrush.Dispose();
Figure 3.39 shows the output from Listing 3.27. As you can see, the fill method fills all the areas of a polygon.
Filling Rectangle and Regions
FillRectangle fills a rectangle with a brush. This method takes a brush and a rectangle as arguments. FillRectangles fills a specified series of rectangles with a brush, and it takes a brush and an array of rectangles. These methods also have overloaded forms with additional options. For instance, if you're using a HatchStyle brush, you can specify background and foreground colors.
Note: The HatchBrush class is defined in the System.Drawing.Drawing2D namespace.
The source code in Listing 3.28 uses FillRectangle to fill two rectangles. One rectangle is filled with a hatch brush, the other with a solid brush.
LISTING 3.28: Filling rectangle
private
void Form1_Paint(object sender,
System.Windows.Forms.PaintEventArgs e)
{
// Create brushes
SolidBrush blueBrush = new SolidBrush(Color.Blue);
// Create a rectangle
Rectangle rect = new Rectangle(10, 20, 100, 50);
// Fill rectangle
e.Graphics.FillRectangle(new HatchBrush(HatchStyle.BackwardDiagonal, Color.Yellow, Color.Black), rect);
e.Graphics.FillRectangle(blueBrush, new Rectangle(150, 20, 50, 100));
// Dispose of object
blueBrush.Dispose();
}
Figure 3.40 shows the output from Listing 3.28
FillRegion fills a specified region with a brush. This method takes a brush and a region as input parameters. Listing 3.29 creates a Region object from a rectangle and calls FillRegion to fill the region.
LISTING 3.29: Filling regions
Rectangle rect = new Rectangle (20, 20, 150, 100);
Region
rgn = new Region(rect);
e.Graphics.FillRegion(new SolidBrush (Color.Green), rgn);
Conclusion
Hope the article would have helped you in understanding Fill Methods in GDI+. Read other articles on GDI+ on the website.
bookGDI.jpg
This book teaches .NET developers how to work with GDI+ as they develop applications that include graphics, or that interact with monitors or printers. It begins by explaining the difference between GDI and GDI+, and covering the basic concepts of graphics programming in Windows.
Similar Articles
Mindcracker
Founded in 2003, Mindcracker is the authority in custom software development and innovation. We put best practices into action. We deliver solutions based on consumer and industry analysis.
|
__label__pos
| 0.952867 |
Questions tagged [file-systems]
techniques to organize and store files with their data on a computer.
-2
votes
0answers
46 views
How to use file system as cache for products which are expensive to produce? [on hold]
Context The consumer client components consume files. They access files in two step: Clients call a REST API with a parameters what they want, and the API responds with a file path. Clients access ...
1
vote
1answer
71 views
How to access a file stored locally on server?
I am working on a web application which allows users to review pdf documents. These documents are submitted from another public facing website. A typical workflow involves: A document is uploaded on ...
-1
votes
2answers
99 views
How to append a chunk of fixed size data to a file and make sure this chunk doesn't get fragmented on disk?
So i want to understand how DBMS implementation works To give an example : MySQL implements each tables with its own pages, which are 16KB so each table is a file, and is a multiple of 16KB, ...
0
votes
1answer
57 views
Does a replicated distributed file system minimise the need for durability?
I've been investigating various distributed file systems, like Gluster, Ceph, Moose and Lizard. I'm also familiar with various key/value store type systems, some of which do not perform any system ...
1
vote
3answers
229 views
Why do disks write data in chunks of page size?
In my understanding, even if i want to overwrite a byte in middle of a file, OS and/or disk will read the content of the size of page, modify one byte and then write the contents back. What is the ...
0
votes
2answers
95 views
Referencing custom Python modules and data files
I'd want to deploy my Python code and relevant static files such that only a copy of a folder is needed. That is, all the paths inside are relative. The release is to a web server, which calls scripts ...
1
vote
1answer
488 views
Chat application - write to file and then save in database
I have followed this approach that is described here to implement a simple chat application: https://code.tutsplus.com/tutorials/how-to-create-a-simple-web-based-chat-application--net-5931 I'm ...
0
votes
2answers
86 views
Detect when a file is created (on a webserver) and ready for use in one of many directories
I have an odd, intermittent bug that is happening on a web server. One of the methods triggers the creation of a small file (3kb), in a folder. The folder is based on the current year, month and ...
1
vote
2answers
393 views
Store file in filesystem, and its metadata to the database atomicly
I have to store many pdf/jpg/png file of max 10mb in a filesystem, and need to save their metadata on a database. The SFTP and the DB may be on different nodes. On WS, I've a local db where I can ...
0
votes
1answer
247 views
Using A XML as a Directory File To support A file Managing Application
Second Year Software Engineering student here. I want to make a file managing system for a C# notetaking app, every note will be represented by a file and will display a small preview of it, ...
12
votes
2answers
597 views
Does a file system “see” the storage device as a (very large) byte array?
I want to know how does a file system write to and read from a storage device. I think this is how it works: A file system doesn't access the storage device directly, but rather the storage device ...
1
vote
0answers
110 views
Classiest file system locations for my Linux app to write its files?
I have an application I am writing on Linux. It is a Java webapp intended to be run on Tomcat. When it initializes, my application will copy some standalone java utility programs to the host ...
3
votes
2answers
106 views
Dealing with potential failures when appending data to a file on disk
I'm designing an application that will be appending blobs to a file on disk (local filesystem) and I'm currently thinking of how to deal with consistency issues that could occur if: The application ...
3
votes
2answers
405 views
Can file systems be designed and implemented in an OS-portable way?
Given the interfaces that major OSes (Windows, macOS/OS X/Mac OS X, Linux) provide to file systems, can file systems be designed and implemented in a way that is largely independent of OS? I'm not at ...
1
vote
1answer
129 views
Controlling permissions for content on web server (pattern/architecture)
I’m working on a proof of concept for a personal project and am unsure how to go about handling ‘permissions’ on content that is uploaded into the application. Problem: In this application users ...
2
votes
6answers
436 views
What are the benefits of storing data contiguously?
I am designing an application file format which will store chunks of user data, ranging from a few bytes to a few gigabytes - median size probably in the 10MB - 30MB range. I have the option of ...
0
votes
1answer
181 views
One row database table or JSON file
If I have data that I will only need to update very rarely (once a month), would it be a good idea to use a JSON file instead of a database table with only 1 row?
7
votes
1answer
2k views
What is the name for the non-extension part of a filename? [closed]
Given the file path: /some/path/abc.txt The filename is "abc.txt", and extension is "txt". What is the "industry standard", unambiguous name for the "abc" part? For reference, in both java's older ...
-1
votes
1answer
269 views
How do you create a Composite file in C++ [closed]
I am looking to create a "Composite file" in C++, basically a composite file is a file containing files, (examples: .docx, .jar, etc) these files can usually be renamed as .zip and opened with a .zip ...
4
votes
2answers
919 views
Storing Local Filesystem Paths in Database
I'm developing a webapp where I have sets of data stored locally on my computer and I run a tool which transforms the data and uploads it to my webapp. However, I need to be able to rerun the tool on ...
1
vote
1answer
1k views
Storing uploaded images for website
I'm developing a website (using PHP, JS, and MYSQL) which allow user to upload images. My requirements are as below: User is able to upload 1 or multiple images at a time. Website is able to save ...
3
votes
3answers
694 views
Why would anyone want to build a file system for windows? [closed]
I saw an ad on StackOverflow today for a project called WinFsp. The site mentions the following features: Allows for easy development of file systems in user mode. There are no restrictions on what ...
3
votes
1answer
514 views
VBA Outlook: quickly find subfolder
I have the following structure in my Outlook Public Folders. -Public Folders --1001_RandomProject --1002_AnotherProject --1003_Yetanotherproject ... and so on, basically there's a couple of thousand(...
3
votes
1answer
648 views
What is the most sensible design for making files available for download from a URL?
This is what I need to do, in a nutshell: Generate Excel spreadsheet files (programmatically). Store these .xlsx files in a location where they can be accessed by users later. These files need to be ...
4
votes
3answers
722 views
What's the point of hidden files?
What is the point of hidden files? In Microsoft Windows they exist, in Mac OS X they exist and in Linux they exist. It seems to me that it just makes detecting malware more difficult. The only upside ...
1
vote
2answers
189 views
How are non-folder files called? [closed]
Maybe it looks like a weird question, but what term should be attributed inside the code for files that are not folders to differentiate them from folders? If I need write 2 functions isFolder() and ...
1
vote
2answers
184 views
Can version control systems use the filesystem log to capture changes?
I was trying to find a "perfect" syncing program between a network share and a local folder, when I realised that it's probably impossible to do it right unless all the filesystem operations were ...
22
votes
4answers
4k views
Why is the Git .git/objects/ folder subdivided in many SHA-prefix folders?
Git internally stores objects (Blobs, trees) in the .git/objects/ folder. Each object can be referenced by a SHA1 hash that is computed from the contents of the object. However, Objects are not ...
1
vote
2answers
1k views
Avoid data manipulation by user
I have a C# program (could be any programming language) that saves data to a file on a memory (hard disk, USB drive, etc.). The program uses this data for monitoring its operation time, but it could ...
0
votes
1answer
75 views
What is a simple way to let a user select a folder from a tree?
I have a Python-Flask app in which users can place files into a folder. As of now the directory structure is something like: /app /storage /templates . . . server.py The user ...
6
votes
1answer
4k views
Efficient data structure to implement fake file system
I want to implement a data structure that will hold the paths of directories, sort of fake file system. Input:- I have a text configuration file containing the paths as follows ... C:/temp1 C:/...
0
votes
2answers
199 views
Is renaming an 'alias' for moving?
Is it true to say (on Windows and Unix\Linux\OS X) that renaming a file or directory is just an alias for moving? e.g. Are there any side effects to either which are not present on the other? Does '...
1
vote
2answers
234 views
Why do filesystems read and write in blocks?
I read that file systems usually access data in blocks, whose size is integral multiple of disk block size. Why don't they read individual disk blocks?
0
votes
1answer
234 views
Best way to centralise a php project (except bitbucket)
The structure is as follows: A: this is the live/production website B: this is the staging, which is a copy of live C: this is the testing environment for designers 2 developer and 2 designers. Only ...
0
votes
1answer
303 views
Efficient way to map changes in a filesystem hierarchy
I'm currently working on a project that will enable file searching based on metadata found in the file. It'll be comprised of 2 parts: a filesystem crawler that passively scans for changes and ...
0
votes
1answer
47 views
Static analysis for finding capitalisation / case inconsistencies in file names
TLDR; I'm looking for ideas on how to flag code containing file names/paths that have inconsistent capitalisation with the actual file/directory. Situation I am migrating a significant code base ...
0
votes
4answers
190 views
Why is there little use of filesharing as compression (outside of libraries)?
Recently I was looking for a program that will run as a daemon and find files that have the same size/type, check if they're the same, then make both a hard link to a single copy if they are. And I ...
2
votes
1answer
601 views
Data structure well suited for duplicate entries
I'm in the process of getting to know (modern) filesystems. As part of it, I came across log structured filesystems that also handle allocations in a log structured way. I wonder how they handle ...
3
votes
1answer
345 views
Filesystem superblocks and their backup copies
I'd like to understand how (modern) filesystems are implemented and having trouble to fully understand superblocks and their backups. I reference ext4 and btrfs, but the questions may also apply to ...
-2
votes
2answers
137 views
file quantity limit in a directory on a linux file server and why?
What is a good limit to use on the quantity of files in a directory, and why? EDIT: Why shouldn't someone create a system that puts hundreds of thousands of files in the same directory? Why I ask: ...
11
votes
5answers
22k views
Is it safe to convert Windows file paths to Unix file paths with a simple replace?
So for example say I had it so that all of my files will be transferred from a windows machine to a unix machine as such: C:\test\myFile.txt to {somewhere}/test/myFile.txt (drive letter is irrelevant ...
3
votes
1answer
481 views
How to store the file names, start offset and length while avoiding the issue of self imposed limits (lookup table) or having to scan the entire file?
I am attempting to learn more about C and it's descendants(C++ mainly). I have decided that I would like to create a "file system" of sorts. Not a particularly advanced one mind you but something to ...
8
votes
7answers
3k views
Why can we not insert into files without the additional writes? (I neither mean append, nor over-write)
This occurs as a programming language independent problem to me. I have a file with the content aaabddd When I want to insert C behind b then my code needs to rewrite ddd to get aaabCddd Why can ...
2
votes
2answers
2k views
Why must directories be empty before being deleted?
As far as I know, deleting a non empty directory could work the same way as deleting an empty directory: by removing the pointer to the directory's metadata there would be no pointers to the items it ...
1
vote
0answers
618 views
What database structure is suitable for tracking File audits?
I need to track permissions and access requests to a file server in a database. I'm given the full path of the folder and am considering parsing the path (splitting on the "/" character) and creating ...
3
votes
2answers
582 views
Why is it not standard to implement abstraction layers for the file system?
I have been taught to access databases through abstraction layers. I was wondering why it is not also standard practice to access the file system through an abstraction layer? It seems to me unit ...
7
votes
5answers
27k views
Is it wise to store a big lump of json on a database row
I have this project which stores product details from amazon into the database. Just to give you an idea on how big it is: [{"title":"Genetic Engineering (Opposing Viewpoints)","short_title":"...
8
votes
4answers
808 views
What exactly does it mean that storing “large blobs in the database reduces performance”?
To someone who knows database internals this may be an easy question, but can someone explain in a clear way why storing large blobs (say 400 MB movies) in the database is supposed to decrease ...
7
votes
3answers
5k views
How many threads should access the file system at the same time?
We have a module in an application which stores data in multiple files and multilevel directories and access them from multiple threads (both reads and writes). The directory structure is based on a ...
4
votes
2answers
9k views
Finding duplicate files? [duplicate]
I am going to be developing a program that detects duplicate files and I was wondering what the best/fastest method would be to do this? I am more interested in what the best hash algorithm would be ...
|
__label__pos
| 0.814166 |
টেমপ্লেট:Coord/link
উইকিপিডিয়া, মুক্ত বিশ্বকোষ থেকে
{{{dms-lat}}} {{{dms-long}}} / এক্সপ্রেশন ত্রুটি: অপরিচিত বিরামচিহ্ন ক্যারেক্টার "{" এক্সপ্রেশন ত্রুটি: অপরিচিত বিরামচিহ্ন ক্যারেক্টার "{" / {{{dec-lat}}}; {{{dec-long}}}
নথি আইকন টেমপ্লেট নথি[দেখুন] [সম্পাদনা] [ইতিহাস] [শোধন]
This template, {{Coord/link}}, is used by {{Coord}}.
উদাহরণ[সম্পাদনা]
{{coord|10|N|30|W}} ১০° উত্তর ৩০° পশ্চিম / ১০° উত্তর ৩০° পশ্চিম / 10; -30
{{coord|10|11|N|30|31|W}} ১০°১১′ উত্তর ৩০°৩১′ পশ্চিম / ১০.১৮৩° উত্তর ৩০.৫১৭° পশ্চিম / 10.183; -30.517
{{coord|10|11|12|N|30|31|32|W}} ১০°১১′১২″ উত্তর ৩০°৩১′৩২″ পশ্চিম / ১০.১৮৬৬৭° উত্তর ৩০.৫২৫৫৬° পশ্চিম / 10.18667; -30.52556
ক্লাস উপর নোট[সম্পাদনা]
Note: the span classes "geo-default", "geo-dec", and "geo-dms" are defined at http://en.wikipedia.org/wiki/MediaWiki:Common.css.
In addition, "geo" and the nested "latitude" and "longitude" have special meaning as a Geo microformat and so might also be used by other templates; see also http://microformats.org/wiki/geo.
প্রদর্শন[সম্পাদনা]
To always display coordinates as DMS values, add this to your common.css:
.geo-default { display: inline }
.geo-nondefault { display: inline }
.geo-dec { display: none }
.geo-dms { display: inline }
To always display coordinates as decimal values, add this to your common.css:
.geo-default { display: inline }
.geo-nondefault { display: inline }
.geo-dec { display: inline }
.geo-dms { display: none }
To display coordinates in both formats, add this to your common.css:
.geo-default { display: inline }
.geo-nondefault { display: inline }
.geo-dec { display: inline }
.geo-dms { display: inline }
.geo-multi-punct { display: inline }
If CSS is disabled, or you have an old copy of MediaWiki:Common.css cached, you will see both formats. (You can either clear your cache or manually refresh this URL: [১].)
To disable display of the blue globe adjacent to coordinates, add this to your common.js
var wma_settings = {enabled:false}
Note that this will disable WikiMiniAtlas
See also Wikipedia:Manual of Style (dates and numbers)#Geographical coordinates.
|
__label__pos
| 0.575132 |
1040, 'Too many connections' exception
If Hue displays the "1040, Too many connections" exception, then it is possible that the Hue backend database is overloaded and out of maximum available connections. To resolve this issue, you can increase the value of the max_connections property for your database.
The 1040, 'Too many connections' exception occurs on a MySQL database when it runs out of maximum available connections. If you are using the Impala engine, you may see the following error message on the Hue web interface: OperationalError at /desktop/api2/context/computes/impala("1040: too many connections"). A similar error may be displayed for Hive. The exception is also captured in the Hue server logs.
The max_connections property defines the maximum number of connections that a MySQL instance can accept. Uncontrolled number of connections can crash the server. Following are some guidelines for tuning the value of the max_connections property:
• Set the value of the max_connections property according to the size of your cluster.
• If you have less than 50 hosts, then you can store more than one database (for example, both the Activity Monitor and Service Monitor) on the same host. If you have more than 50 hosts, then use a separate host for each database/host pair. The hosts need not be reserved exclusively for databases, but each database must be on a separate host.
• For less than 50 hosts:
• Place each database on its own storage volume.
• Allow 100 maximum connections for each database and then add 50 extra connections. For example, for two databases, set the maximum connections to 250. If you store five databases on one host (the databases for Cloudera Manager Server, Activity Monitor, Reports Manager, Atlas, and Hive MetaStore), then set the maximum connections to 550.
To increase the number of maximium available connections and to resolve the "1040, Too many connections" exception:
1. Log in to Cloudera Manager and stop the Hue service.
2. SSH in to your database instance as a root user.
3. Check the number of available connections by running the following command:
grep max_conn /etc/my.cnf
/etc/my.cnf is the default location of the options file (my.cnf).
4. Set the new value of the max_connections property from the MySQL shell as per the guidelines provided above. For example:
mysql> SET GLOBAL max_connections = 550;
5. Restart the Hue service.
|
__label__pos
| 0.914082 |
dcsimg
June 29, 2015
Hot Topics:
Java Applet Basics
• June 25, 2001
• By Anand Narayanaswamy
• Send Email »
• More Articles »
Introduction
Life Cycle,Graphics, etc.
User Interface Components
Layout Managers
Part I
Introduction
This tutorial assumes that you know fundamentals of Java application programming. However, I'll offer some important notes for the beginners among you.
To compile and execute Java programs, you should install Java Development Kit (JDK) Version 1.2 or higher (recommended). You can use older versions of the JDK, but this tutorial is being prepared for use with JDK 1.2 or higher. You can download the JDK from Sun's Website free of cost. You can also get the JDK through some Java textBooks. Just double-click the setup file and proceed with the installation.
After installing the JDK, you have to set the correct path in order to work with Java programs. For setting the path, execute the MSCONFIG.exe (System Configuration utility) Program from the start-run menu. Press the autoexec.bat tab and click on the New button. Type in the following command: set path=c:\jdk1.2\bin;%path%. You have to substitute the correct version of the drive and the JDK version number. I'll assume that the JDK is in C:\ Drive and the version is 1.2.
Anyway, you can also use the above command everytime you practice Java programming, but it is recommended to follow the above procedure. Also supply the Doskey command (in autoexec.bat) so that you have to type in each command at the command prompt only once. Just press the up and down arrow keys to retrieve your earlier command (earlier in the sense of the current session).
You can write code using Notepad or MSDOS Editor (supply EDIT Command at the DOS prompt). However, Notepad is the most preferred editor among most programmers. Save your files with .java extensions. Compile the program using javac .java. Execute your applet using the appletviewer utitlity included with the JDK or open the corresponding htm or htm file in a browser.
Overview
• Java programs consists of applications and applets.
• Applications are executed from MSDOS prompt by using the interpreter
• Applets are executed with the help of the appletviewer utility or the Net browser.
• Compilation stages are same in both the cases.
What are Applets
• Applets are dynamic (animations and graphics).
• Applets are interactive programs (via GUI components).
What you need to execute an Applet
• Browser (IE 4.0 or Netscape Navigator 4.0 or higher)
• Appletviewer utility in the JDK.
Features of an Applet
• Provides facility for frames
• Event handling facility and userInteraction
• GUI user interface
• Graphics and multimedia
Your First Applet
Type in the following code using any text editor or in DOS editor.
import java.awt.*
import java.applet.*;
public classhello extends Applet {
public void paint(Graphics g) {
g.drawString("Welcome to Java Applets",20,20); } }
Save the file as hello.java and compile it by using javac. Now, type in the following HTML code in your editor and save the file as hello.html
<applet code =
"classhello.class" width = 200 height =
150></applet>
Execute the HTML file by giving appletviewer hello.html. Another way to run the applet is to give the above HTML coding as a comment after the two import statements. Execute the applet as appletviewer hello.java
Concepts and Explanation
• All applets are the subclasses of Applet class. All applets must import the java.applet package
• The Paint() method is defined by AWT Component class. It takes one parameter of type Graphics.
• The drawString is the member of the Graphics class of the AWT package.
• This method is responsible for printing the String "welcome to java applets".
Facts
• Applets do not begin execution at main() method. However, it is possible to execute the applets by using the Java interpreter (by using the main() method) if you extend your class with Frame.
• I/O Streams do not provide much scope for applets.
• It is not possible for an applet to access the files on the users hard disk.
• It is not possible to access the source code of the applets. It can be accessed only from the original server.
Part II
Life Cycle, Graphics, Fonts, Colors
Life Cycle of an Applet
Method Class Description
init() Applet First method to be called, initialize variables in this method
start() Applet Called when restarted after being stopped.occurs after init()
stop() Applet Called when the applet leaves the webpage
destroy() Applet Called when the applet wants to be removed out of memory
paint() Component Called when the applet needs to be drawn
The repaint() method - If the applet wants to be repainted again, then this method is called. Useful for animation purposes.
Parameter Passing
• Use a special parameter tag <param> in the HTML file. This tag takes two attributes, namely Name and Value.
• Use a method getParameter() inside the init() method, which takes one argument (i.e., the string representing the name of the parameter being looked for). Give this name a value in the HTML coding.
Graphics Class
• Graphics class in the java.awt package contains methods for drawing strings, lines and rectangles, ovals, polygon, fill rect, fill oval, etc.
Methods
• To draw a string use the drawString(String str,int X,int Y) method, where str is the name of the string and X and Y are the coordinates for where the string is to be printed.
• To draw a line use drawLine(int x1,int y1,int x2,int y2), where x1 and y1 are the starting point coordinates and x2 and y2 are the ending point coordinates.
• To draw a rectangle use drawRect(int x1,int y1,int width,int height), where x1 and y1 are the starting point coordinates and width and height are the measurements for rectangle
• To draw a RoundRect use drawRoundRect(int x1,int y1,int width,int height,width1,height1), where x1 and y1 are the starting point coordinates and width and height are the measurements for rectangle and width1 and height1 are the angles of the corners.
• To draw an oval use drawOval(int x1,int y1,int width,int height), where x1 and y1 are the coordinates of the top corners and width and height are the respective measurements of the oval.
• To draw an arc use drawArc(int x1,int y1,int width,int height,angle1 ,angle2), where x1 and y1 are the coordinates of the top corners and width and height are the respective measurements of the arc and angle1 and angle2 are the starting arc and ending arcs (in degrees).
Font Class
• The Font class in the java.awt package contains methods for displaying fonts.
1. Declare the Font Name, style and the size using the Font Constructor.
2. Finally, pass the font's object by using the setFont method in the java.awt package.
Sample
Font f = new Font("Courier",Font.BOLD+Font.Italic,
16); ||||| g.setFont(f);
Color Class
• The Color class in the java.awt package contains methods for dealing with colors.
Methods
• setColor(Color.gray) sets the string color to gray .
• setBackground(Color.red) sets the background color to red.
Part III
User Interface Components
The Class Hierachy
Usage of Label
1. Label() - Creates an empty label
2. Label(String) - Creates a label with the given string
3. Label(String, align) - Creates a string label with the specified alignment (RIGHT,LEFT,CENTER)
Usage of Button
1. Button() - Creates a button without a label
2. Button(String str) - Creates a button with the string
Usage of Checkbox()
1. Checkbox() - Creates a checkbox without a label
2. Checkbox(String str) - Creates a checkbox with a string label in it
Usage of CheckboxGroup
1. Create a Checkbox Group and add the group's object to the individual checkboxes to get a radio-button style of interface. Only one box can be selected at a time.
Usage of TextField
1. TextField() - Creates a empty Text Field
2. TextField(String str) - Creates a Text Field with the specified String
3. TextField(String str,align) - Creates a Text Field with the specified String with the alignment
4. The setText() method is used in connection with the Text Fields. For instance, to set a text in Choice to the text field, the method setText() method is used
Usage of Text Area
1. TextArea() - Creates empty Text Area
2. TextArea(rows,charcters) - Creates empty Text Area, with the specified rows and charcters.
3. TextArea(String str,rows,charcters) - Creates a default String Text Area, with the specified rows and charcters
Usage of Choice
1. Create a Choice object (Choice c = new Choice() )
2. Add the individual items to the Choice by add method and connecting the Choice object
3. Finally, add the choice object to the container.
• Choice ch = new Choice(); ch.add("Java"), ch.add("XML"); add(ch)
Usage of Lists
1. Create a List Object (List l = new List() )
2. Add the individual items to the List by add method and connecting the List object
3. Finally, add the List object to the Container.
• You can select multiple items from the list box. But only one from a Choice.
• The setEditable(Boolean) method is used to edit the text inside a choice component.
All these above components together form a GUI Interface. You can create any type of user-friendly applications you want by making use of the above components. In the next section, we will take a look at Layout Mangers in Java, with which you can dynamically place the above components at your desired location.
Part IV
Layout Managers
The Concept
You can place the components according to your taste and position by using Layout Managers. The basic Layout Managers include Flow Layout, Border Layout, and Grid Layout.
Basic Steps to be Followed
1. Find the Layout Manager and Instantiate it by using their Constructors
2. Associate the manager with the components in the Container.
3. The Layout Manager is set by setLayout() method.
4. If no layout manager is specified, then the default manager is taken.
Flow Layout
• Default Layout Manager works like a typical word processor from Left to right.
• Flow Layout() creates a default layout centered and leaves a position of 5 pixels of space between each Component.
• Flow Layout( int how) creates a layout with the specified alignment (LEFT,RIGHT,CENTER).
• Flow Layout(int how,int h,int v) creates a layout with the specified spaces.
Border Layout
1. Each Component can be placed on the border of a container.
2. With Border Layout the placement of the component is specified as North, South, East, and West.
• Border Layout() creates a default Border Layout.
• Border Layout(int horz,int vert) leaves the specified spaces between components.
Grid Layout
1. Lays out component in a two-dimensional grid
• Grid Layout() - creates single column grid layout.
• Grid Layout(num rows ,num cols) creates a Grid containing the specified rows and columns. For example, Grid Layout(3,3) creates a 3 x 3 Grid.
• Grid Layout(num rows,num cols,int horz,int vert) creates a Grid containing the specified spaces between the Grid.
Card Layout
1. Unique among other Layout managers
2. Each layout is a separate index card in a deck that can be shuffled so that any card is on the top at a given time.
Panels
1. The Panel is also a container.
2. The Panel can contain UI Components and other Containers.
3. The general Constructor is Panel p1 = new Panel().
4. The add() method of the Container Class can be used to add a Component to the Panel.
Glossary
GUI: A graphical user interface. It is an interface to the Windows operating system. It includes user friendly controls, like Buttons, textfields for entering text, message boxes, etc.
AWT: The Abstract Windowing Toolkit. It is a package in JavaAPI and consists of Graphics, Font, color, Image, etc. classes. You have to call this package by using the import keyword (import java.awt.*). if You are using methods and interfaces from this package.
LABEL: It denotes uneditable text.
BUTTON: It is a standard control found in Windows.
CHECKBOX: It consist of a set of items. Users can select one or more items at a time.
CHECKBOXGROUP: It denotes a radio (small, black circle shape) button. Users can select only one item at a time.
TEXTFIELD: Users can enter information in the the boxes. You can enter in one single line.
TEXTAREA: By using this control, users can enter multiple lines of text.
CHOICE: This component is the same as combo box. When a user clicks on the dropdown arrow, she will get a list of items, only one item is selectable at a time.
LIST: This is a variation of the above component. Users can select multiple items at a time.
About the Author
Anand Narayanaswamy is a graduate of the University of Kerala. He is currently working as an instructor teaching Java, Visual Basic, and technologies such as ASP and XML. He enjoys learning new programming languages like C#. Currently, Anand lives in Thiruvananthapuram, Kerala State, India. He can be contacted via his Website.
Comment and Contribute
(Maximum characters: 1200). You have characters left.
Enterprise Development Update
Don't miss an article. Subscribe to our newsletter below.
Sitemap | Contact Us
Thanks for your registration, follow us on our social networks to keep up-to-date
Rocket Fuel
|
__label__pos
| 0.847538 |
Merge remote-tracking branch 'remotes/afaerber/tags/maintainers-for-peter' into staging
[qemu.git] / net / tap-linux.c
1 /*
2 * QEMU System Emulator
3 *
4 * Copyright (c) 2003-2008 Fabrice Bellard
5 * Copyright (c) 2009 Red Hat, Inc.
6 *
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
13 *
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
23 * THE SOFTWARE.
24 */
25
26 #include "qemu/osdep.h"
27 #include "tap_int.h"
28 #include "tap-linux.h"
29 #include "net/tap.h"
30
31 #include <net/if.h>
32 #include <sys/ioctl.h>
33
34 #include "sysemu/sysemu.h"
35 #include "qapi/error.h"
36 #include "qemu/error-report.h"
37 #include "qemu/cutils.h"
38
39 #define PATH_NET_TUN "/dev/net/tun"
40
41 int tap_open(char *ifname, int ifname_size, int *vnet_hdr,
42 int vnet_hdr_required, int mq_required, Error **errp)
43 {
44 struct ifreq ifr;
45 int fd, ret;
46 int len = sizeof(struct virtio_net_hdr);
47 unsigned int features;
48
49 TFR(fd = open(PATH_NET_TUN, O_RDWR));
50 if (fd < 0) {
51 error_setg_errno(errp, errno, "could not open %s", PATH_NET_TUN);
52 return -1;
53 }
54 memset(&ifr, 0, sizeof(ifr));
55 ifr.ifr_flags = IFF_TAP | IFF_NO_PI;
56
57 if (ioctl(fd, TUNGETFEATURES, &features) == -1) {
58 error_report("warning: TUNGETFEATURES failed: %s", strerror(errno));
59 features = 0;
60 }
61
62 if (features & IFF_ONE_QUEUE) {
63 ifr.ifr_flags |= IFF_ONE_QUEUE;
64 }
65
66 if (*vnet_hdr) {
67 if (features & IFF_VNET_HDR) {
68 *vnet_hdr = 1;
69 ifr.ifr_flags |= IFF_VNET_HDR;
70 } else {
71 *vnet_hdr = 0;
72 }
73
74 if (vnet_hdr_required && !*vnet_hdr) {
75 error_setg(errp, "vnet_hdr=1 requested, but no kernel "
76 "support for IFF_VNET_HDR available");
77 close(fd);
78 return -1;
79 }
80 /*
81 * Make sure vnet header size has the default value: for a persistent
82 * tap it might have been modified e.g. by another instance of qemu.
83 * Ignore errors since old kernels do not support this ioctl: in this
84 * case the header size implicitly has the correct value.
85 */
86 ioctl(fd, TUNSETVNETHDRSZ, &len);
87 }
88
89 if (mq_required) {
90 if (!(features & IFF_MULTI_QUEUE)) {
91 error_setg(errp, "multiqueue required, but no kernel "
92 "support for IFF_MULTI_QUEUE available");
93 close(fd);
94 return -1;
95 } else {
96 ifr.ifr_flags |= IFF_MULTI_QUEUE;
97 }
98 }
99
100 if (ifname[0] != '\0')
101 pstrcpy(ifr.ifr_name, IFNAMSIZ, ifname);
102 else
103 pstrcpy(ifr.ifr_name, IFNAMSIZ, "tap%d");
104 ret = ioctl(fd, TUNSETIFF, (void *) &ifr);
105 if (ret != 0) {
106 if (ifname[0] != '\0') {
107 error_setg_errno(errp, errno, "could not configure %s (%s)",
108 PATH_NET_TUN, ifr.ifr_name);
109 } else {
110 error_setg_errno(errp, errno, "could not configure %s",
111 PATH_NET_TUN);
112 }
113 close(fd);
114 return -1;
115 }
116 pstrcpy(ifname, ifname_size, ifr.ifr_name);
117 fcntl(fd, F_SETFL, O_NONBLOCK);
118 return fd;
119 }
120
121 /* sndbuf implements a kind of flow control for tap.
122 * Unfortunately when it's enabled, and packets are sent
123 * to other guests on the same host, the receiver
124 * can lock up the transmitter indefinitely.
125 *
126 * To avoid packet loss, sndbuf should be set to a value lower than the tx
127 * queue capacity of any destination network interface.
128 * Ethernet NICs generally have txqueuelen=1000, so 1Mb is
129 * a good value, given a 1500 byte MTU.
130 */
131 #define TAP_DEFAULT_SNDBUF 0
132
133 void tap_set_sndbuf(int fd, const NetdevTapOptions *tap, Error **errp)
134 {
135 int sndbuf;
136
137 sndbuf = !tap->has_sndbuf ? TAP_DEFAULT_SNDBUF :
138 tap->sndbuf > INT_MAX ? INT_MAX :
139 tap->sndbuf;
140
141 if (!sndbuf) {
142 sndbuf = INT_MAX;
143 }
144
145 if (ioctl(fd, TUNSETSNDBUF, &sndbuf) == -1 && tap->has_sndbuf) {
146 error_setg_errno(errp, errno, "TUNSETSNDBUF ioctl failed");
147 }
148 }
149
150 int tap_probe_vnet_hdr(int fd)
151 {
152 struct ifreq ifr;
153
154 if (ioctl(fd, TUNGETIFF, &ifr) != 0) {
155 error_report("TUNGETIFF ioctl() failed: %s", strerror(errno));
156 return 0;
157 }
158
159 return ifr.ifr_flags & IFF_VNET_HDR;
160 }
161
162 int tap_probe_has_ufo(int fd)
163 {
164 unsigned offload;
165
166 offload = TUN_F_CSUM | TUN_F_UFO;
167
168 if (ioctl(fd, TUNSETOFFLOAD, offload) < 0)
169 return 0;
170
171 return 1;
172 }
173
174 /* Verify that we can assign given length */
175 int tap_probe_vnet_hdr_len(int fd, int len)
176 {
177 int orig;
178 if (ioctl(fd, TUNGETVNETHDRSZ, &orig) == -1) {
179 return 0;
180 }
181 if (ioctl(fd, TUNSETVNETHDRSZ, &len) == -1) {
182 return 0;
183 }
184 /* Restore original length: we can't handle failure. */
185 if (ioctl(fd, TUNSETVNETHDRSZ, &orig) == -1) {
186 fprintf(stderr, "TUNGETVNETHDRSZ ioctl() failed: %s. Exiting.\n",
187 strerror(errno));
188 abort();
189 return -errno;
190 }
191 return 1;
192 }
193
194 void tap_fd_set_vnet_hdr_len(int fd, int len)
195 {
196 if (ioctl(fd, TUNSETVNETHDRSZ, &len) == -1) {
197 fprintf(stderr, "TUNSETVNETHDRSZ ioctl() failed: %s. Exiting.\n",
198 strerror(errno));
199 abort();
200 }
201 }
202
203 int tap_fd_set_vnet_le(int fd, int is_le)
204 {
205 int arg = is_le ? 1 : 0;
206
207 if (!ioctl(fd, TUNSETVNETLE, &arg)) {
208 return 0;
209 }
210
211 /* Check if our kernel supports TUNSETVNETLE */
212 if (errno == EINVAL) {
213 return -errno;
214 }
215
216 error_report("TUNSETVNETLE ioctl() failed: %s.", strerror(errno));
217 abort();
218 }
219
220 int tap_fd_set_vnet_be(int fd, int is_be)
221 {
222 int arg = is_be ? 1 : 0;
223
224 if (!ioctl(fd, TUNSETVNETBE, &arg)) {
225 return 0;
226 }
227
228 /* Check if our kernel supports TUNSETVNETBE */
229 if (errno == EINVAL) {
230 return -errno;
231 }
232
233 error_report("TUNSETVNETBE ioctl() failed: %s.", strerror(errno));
234 abort();
235 }
236
237 void tap_fd_set_offload(int fd, int csum, int tso4,
238 int tso6, int ecn, int ufo)
239 {
240 unsigned int offload = 0;
241
242 /* Check if our kernel supports TUNSETOFFLOAD */
243 if (ioctl(fd, TUNSETOFFLOAD, 0) != 0 && errno == EINVAL) {
244 return;
245 }
246
247 if (csum) {
248 offload |= TUN_F_CSUM;
249 if (tso4)
250 offload |= TUN_F_TSO4;
251 if (tso6)
252 offload |= TUN_F_TSO6;
253 if ((tso4 || tso6) && ecn)
254 offload |= TUN_F_TSO_ECN;
255 if (ufo)
256 offload |= TUN_F_UFO;
257 }
258
259 if (ioctl(fd, TUNSETOFFLOAD, offload) != 0) {
260 offload &= ~TUN_F_UFO;
261 if (ioctl(fd, TUNSETOFFLOAD, offload) != 0) {
262 fprintf(stderr, "TUNSETOFFLOAD ioctl() failed: %s\n",
263 strerror(errno));
264 }
265 }
266 }
267
268 /* Enable a specific queue of tap. */
269 int tap_fd_enable(int fd)
270 {
271 struct ifreq ifr;
272 int ret;
273
274 memset(&ifr, 0, sizeof(ifr));
275
276 ifr.ifr_flags = IFF_ATTACH_QUEUE;
277 ret = ioctl(fd, TUNSETQUEUE, (void *) &ifr);
278
279 if (ret != 0) {
280 error_report("could not enable queue");
281 }
282
283 return ret;
284 }
285
286 /* Disable a specific queue of tap/ */
287 int tap_fd_disable(int fd)
288 {
289 struct ifreq ifr;
290 int ret;
291
292 memset(&ifr, 0, sizeof(ifr));
293
294 ifr.ifr_flags = IFF_DETACH_QUEUE;
295 ret = ioctl(fd, TUNSETQUEUE, (void *) &ifr);
296
297 if (ret != 0) {
298 error_report("could not disable queue");
299 }
300
301 return ret;
302 }
303
304 int tap_fd_get_ifname(int fd, char *ifname)
305 {
306 struct ifreq ifr;
307
308 if (ioctl(fd, TUNGETIFF, &ifr) != 0) {
309 error_report("TUNGETIFF ioctl() failed: %s",
310 strerror(errno));
311 return -1;
312 }
313
314 pstrcpy(ifname, sizeof(ifr.ifr_name), ifr.ifr_name);
315 return 0;
316 }
|
__label__pos
| 0.996127 |
lkml.org
[lkml] [2019] [Sep] [25] [last100] RSS Feed
Views: [wrap][no wrap] [headers] [forward]
Messages in this thread
Patch in this message
/
From
Subject[PATCH 1/2] HID: i2c-hid: allow delay after SET_POWER
Date
According to HID over I2C specification v1.0 section 7.2.8, a device is
allowed to take at most 1 second to make the transition to the specified
power state. On some touchpad devices implements Microsoft Precision
Touchpad, it may fail to execute following set PTP mode command without
the delay and leaves the device in an unsupported Mouse mode.
This change adds a post-setpower-delay-ms device property that allows
specifying the delay after a SET_POWER command is issued.
References: https://bugzilla.kernel.org/show_bug.cgi?id=204991
Signed-off-by: You-Sheng Yang <[email protected]>
---
.../bindings/input/hid-over-i2c.txt | 2 +
drivers/hid/i2c-hid/i2c-hid-core.c | 46 +++++++++++--------
include/linux/platform_data/i2c-hid.h | 3 ++
3 files changed, 32 insertions(+), 19 deletions(-)
diff --git a/Documentation/devicetree/bindings/input/hid-over-i2c.txt b/Documentation/devicetree/bindings/input/hid-over-i2c.txt
index c76bafaf98d2f..d82faae335da0 100644
--- a/Documentation/devicetree/bindings/input/hid-over-i2c.txt
+++ b/Documentation/devicetree/bindings/input/hid-over-i2c.txt
@@ -32,6 +32,8 @@ device-specific compatible properties, which should be used in addition to the
- vdd-supply: phandle of the regulator that provides the supply voltage.
- post-power-on-delay-ms: time required by the device after enabling its regulators
or powering it on, before it is ready for communication.
+- post-setpower-delay-ms: time required by the device after a SET_POWER command
+ before it finished the state transition.
Example:
diff --git a/drivers/hid/i2c-hid/i2c-hid-core.c b/drivers/hid/i2c-hid/i2c-hid-core.c
index 2a7c6e33bb1c4..a5bc2786dc440 100644
--- a/drivers/hid/i2c-hid/i2c-hid-core.c
+++ b/drivers/hid/i2c-hid/i2c-hid-core.c
@@ -168,6 +168,7 @@ static const struct i2c_hid_quirks {
__u16 idVendor;
__u16 idProduct;
__u32 quirks;
+ __u32 post_setpower_delay_ms;
} i2c_hid_quirks[] = {
{ USB_VENDOR_ID_WEIDA, HID_ANY_ID,
I2C_HID_QUIRK_SET_PWR_WAKEUP_DEV },
@@ -189,21 +190,20 @@ static const struct i2c_hid_quirks {
* i2c_hid_lookup_quirk: return any quirks associated with a I2C HID device
* @idVendor: the 16-bit vendor ID
* @idProduct: the 16-bit product ID
- *
- * Returns: a u32 quirks value.
*/
-static u32 i2c_hid_lookup_quirk(const u16 idVendor, const u16 idProduct)
+static void i2c_hid_set_quirk(struct i2c_hid *ihid,
+ const u16 idVendor, const u16 idProduct)
{
- u32 quirks = 0;
int n;
for (n = 0; i2c_hid_quirks[n].idVendor; n++)
if (i2c_hid_quirks[n].idVendor == idVendor &&
(i2c_hid_quirks[n].idProduct == (__u16)HID_ANY_ID ||
- i2c_hid_quirks[n].idProduct == idProduct))
- quirks = i2c_hid_quirks[n].quirks;
-
- return quirks;
+ i2c_hid_quirks[n].idProduct == idProduct)) {
+ ihid->quirks = i2c_hid_quirks[n].quirks;
+ ihid->pdata.post_setpower_delay_ms =
+ i2c_hid_quirks[n].post_setpower_delay_ms;
+ }
}
static int __i2c_hid_command(struct i2c_client *client,
@@ -431,8 +431,22 @@ static int i2c_hid_set_power(struct i2c_client *client, int power_state)
power_state == I2C_HID_PWR_SLEEP)
ihid->sleep_delay = jiffies + msecs_to_jiffies(20);
- if (ret)
+ if (ret) {
dev_err(&client->dev, "failed to change power setting.\n");
+ goto set_pwr_exit;
+ }
+
+ /*
+ * The HID over I2C specification states that if a DEVICE needs time
+ * after the PWR_ON request, it should utilise CLOCK stretching.
+ * However, it has been observered that the Windows driver provides a
+ * 1ms sleep between the PWR_ON and RESET requests and that some devices
+ * rely on this.
+ */
+ if (ihid->pdata.post_setpower_delay_ms)
+ msleep(ihid->pdata.post_setpower_delay_ms);
+ else
+ usleep_range(1000, 5000);
set_pwr_exit:
return ret;
@@ -456,15 +470,6 @@ static int i2c_hid_hwreset(struct i2c_client *client)
if (ret)
goto out_unlock;
- /*
- * The HID over I2C specification states that if a DEVICE needs time
- * after the PWR_ON request, it should utilise CLOCK stretching.
- * However, it has been observered that the Windows driver provides a
- * 1ms sleep between the PWR_ON and RESET requests and that some devices
- * rely on this.
- */
- usleep_range(1000, 5000);
-
i2c_hid_dbg(ihid, "resetting...\n");
ret = i2c_hid_command(client, &hid_reset_cmd, NULL, 0);
@@ -1023,6 +1028,9 @@ static void i2c_hid_fwnode_probe(struct i2c_client *client,
if (!device_property_read_u32(&client->dev, "post-power-on-delay-ms",
&val))
pdata->post_power_delay_ms = val;
+ if (!device_property_read_u32(&client->dev, "post-setpower-delay-ms",
+ &val))
+ pdata->post_setpower_delay_ms = val;
}
static int i2c_hid_probe(struct i2c_client *client,
@@ -1145,7 +1153,7 @@ static int i2c_hid_probe(struct i2c_client *client,
client->name, hid->vendor, hid->product);
strlcpy(hid->phys, dev_name(&client->dev), sizeof(hid->phys));
- ihid->quirks = i2c_hid_lookup_quirk(hid->vendor, hid->product);
+ i2c_hid_set_quirk(ihid, hid->vendor, hid->product);
ret = hid_add_device(hid);
if (ret) {
diff --git a/include/linux/platform_data/i2c-hid.h b/include/linux/platform_data/i2c-hid.h
index c628bb5e10610..71682f2ad8a53 100644
--- a/include/linux/platform_data/i2c-hid.h
+++ b/include/linux/platform_data/i2c-hid.h
@@ -20,6 +20,8 @@
* @hid_descriptor_address: i2c register where the HID descriptor is stored.
* @supplies: regulators for powering on the device.
* @post_power_delay_ms: delay after powering on before device is usable.
+ * @post_setpower_delay_ms: delay after SET_POWER command before device
+ * completes state transition.
*
* Note that it is the responsibility of the platform driver (or the acpi 5.0
* driver, or the flattened device tree) to setup the irq related to the gpio in
@@ -36,6 +38,7 @@ struct i2c_hid_platform_data {
u16 hid_descriptor_address;
struct regulator_bulk_data supplies[2];
int post_power_delay_ms;
+ int post_setpower_delay_ms;
};
#endif /* __LINUX_I2C_HID_H */
--
2.23.0
\
\ /
Last update: 2019-09-25 11:44 [W:0.045 / U:1.312 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site
|
__label__pos
| 0.796833 |
1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
Misc integral
1. Mar 23, 2010 #1
[tex]
\int \frac{x}{\sqrt{3-x^4}}dx
[/tex]
[tex]
u=x^2
[/tex]
[tex]
du=2xdx
[/tex]
[tex]
\frac{1}{2}\int\frac{du}{\sqrt{3-u^2}}
[/tex]
[tex]
u=\sqrt{3}sinT
[/tex]
[tex]
du=\sqrt{3}cosTdT
[/tex]
[tex]
\frac{1}{2}\int \frac{\sqrt{3}cosT}{\sqrt{3}cosT}dT
[/tex]
[tex]
\frac{x}{2}+C
[/tex]
1. The problem statement, all variables and given/known data
2. Relevant equations
3. The attempt at a solution
2. jcsd
3. Mar 23, 2010 #2
Dick
User Avatar
Science Advisor
Homework Helper
Not x/2+C. T/2+C.
4. Mar 23, 2010 #3
You need not do the second u-substitution. Use an integral table to solve it once you have done the first u-substitution. You can google 'integral table' to find one if you don't have one in your book.
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook
Similar Discussions: Misc integral
1. Misc. Questions (Replies: 2)
2. Misc integral (Replies: 2)
3. Misc integral (Replies: 2)
4. Misc integral (Replies: 2)
5. Misc integral (Replies: 3)
Loading...
|
__label__pos
| 0.999623 |
tools: golang.org/x/tools/present Index | Examples | Files
package present
import "golang.org/x/tools/present"
The present file format
Present files have the following format. The first non-blank non-comment line is the title, so the header looks like
Title of document
Subtitle of document
15:04 2 Jan 2006
Tags: foo, bar, baz
<blank line>
Author Name
Job title, Company
[email protected]
http://url/
@twitter_name
The subtitle, date, and tags lines are optional.
The date line may be written without a time:
2 Jan 2006
In this case, the time will be interpreted as 10am UTC on that date.
The tags line is a comma-separated list of tags that may be used to categorize the document.
The author section may contain a mixture of text, twitter names, and links. For slide presentations, only the plain text lines will be displayed on the first slide.
Multiple presenters may be specified, separated by a blank line.
After that come slides/sections, each after a blank line:
* Title of slide or section (must have asterisk)
Some Text
** Subsection
- bullets
- more bullets
- a bullet with
*** Sub-subsection
Some More text
Preformatted text
is indented (however you like)
Further Text, including invocations like:
.code x.go /^func main/,/^}/
.play y.go
.image image.jpg
.background image.jpg
.iframe http://foo
.link http://foo label
.html file.html
.caption _Gopher_ by [[http://www.reneefrench.com][Renée French]]
Again, more text
Blank lines are OK (not mandatory) after the title and after the text. Text, bullets, and .code etc. are all optional; title is not.
Lines starting with # in column 1 are commentary.
Fonts:
Within the input for plain text or lists, text bracketed by font markers will be presented in italic, bold, or program font. Marker characters are _ (italic), * (bold) and ` (program font). An opening marker must be preceded by a space or punctuation character or else be at start of a line; similarly, a closing marker must be followed by a space or punctuation character or else be at the end of a line. Unmatched markers appear as plain text. There must be no spaces between markers. Within marked text, a single marker character becomes a space and a doubled single marker quotes the marker character.
at the beginning of a line or else be preceded by a space or punctuation; similarly a closing marker must be at the end of the lineo
_italic_
*bold*
`program`
Markup—_especially_italic_text_—can easily be overused.
_Why_use_scoped__ptr_? Use plain ***ptr* instead.
Inline links:
Links can be included in any text with the form [[url][label]], or [[url]] to use the URL itself as the label.
Functions:
A number of template functions are available through invocations in the input text. Each such invocation contains a period as the first character on the line, followed immediately by the name of the function, followed by any arguments. A typical invocation might be
.play demo.go /^func show/,/^}/
(except that the ".play" must be at the beginning of the line and not be indented like this.)
Here follows a description of the functions:
code:
Injects program source into the output by extracting code from files and injecting them as HTML-escaped <pre> blocks. The argument is a file name followed by an optional address that specifies what section of the file to display. The address syntax is similar in its simplest form to that of ed, but comes from sam and is more general. See
http://plan9.bell-labs.com/sys/doc/sam/sam.html Table II
for full details. The displayed block is always rounded out to a full line at both ends.
If no pattern is present, the entire file is displayed.
Any line in the program that ends with the four characters
OMIT
is deleted from the source before inclusion, making it easy to write things like
.code test.go /START OMIT/,/END OMIT/
to find snippets like this
tedious_code = boring_function()
// START OMIT
interesting_code = fascinating_function()
// END OMIT
and see only this:
interesting_code = fascinating_function()
Also, inside the displayed text a line that ends
// HL
will be highlighted in the display; the 'h' key in the browser will toggle extra emphasis of any highlighted lines. A highlighting mark may have a suffix word, such as
// HLxxx
Such highlights are enabled only if the code invocation ends with "HL" followed by the word:
.code test.go /^type Foo/,/^}/ HLxxx
The .code function may take one or more flags immediately preceding the filename. This command shows test.go in an editable text area:
.code -edit test.go
This command shows test.go with line numbers:
.code -numbers test.go
play:
The function "play" is the same as "code" but puts a button on the displayed source so the program can be run from the browser. Although only the selected text is shown, all the source is included in the HTML output so it can be presented to the compiler.
link:
Create a hyperlink. The syntax is 1 or 2 space-separated arguments. The first argument is always the HTTP URL. If there is a second argument, it is the text label to display for this link.
.link http://golang.org golang.org
image:
The template uses the function "image" to inject picture files.
The syntax is simple: 1 or 3 space-separated arguments. The first argument is always the file name. If there are more arguments, they are the height and width; both must be present, or substituted with an underscore. Replacing a dimension argument with the underscore parameter preserves the aspect ratio of the image when scaling.
.image images/betsy.jpg 100 200
.image images/janet.jpg _ 300
video:
The template uses the function "video" to inject video files.
The syntax is simple: 2 or 4 space-separated arguments. The first argument is always the file name. The second argument is always the file content-type. If there are more arguments, they are the height and width; both must be present, or substituted with an underscore. Replacing a dimension argument with the underscore parameter preserves the aspect ratio of the video when scaling.
.video videos/evangeline.mp4 video/mp4 400 600
.video videos/mabel.ogg video/ogg 500 _
background:
The template uses the function "background" to set the background image for a slide. The only argument is the file name of the image.
.background images/susan.jpg
caption:
The template uses the function "caption" to inject figure captions.
The text after ".caption" is embedded in a figcaption element after processing styling and links as in standard text lines.
.caption _Gopher_ by [[http://www.reneefrench.com][Renée French]]
iframe:
The function "iframe" injects iframes (pages inside pages). Its syntax is the same as that of image.
html:
The function html includes the contents of the specified file as unescaped HTML. This is useful for including custom HTML elements that cannot be created using only the slide format. It is your responsibilty to make sure the included HTML is valid and safe.
.html file.html
Presenter notes:
Presenter notes may be enabled by appending the "-notes" flag when you run your "present" binary.
This will allow you to open a second window by pressing 'N' from your browser displaying your slides. The second window is completely synced with your main window, except that presenter notes are only visible on the second window.
Lines that begin with ": " are treated as presenter notes.
* Title of slide
Some Text
: Presenter notes (first paragraph)
: Presenter notes (subsequent paragraph(s))
Notes may appear anywhere within the slide text. For example:
* Title of slide
: Presenter notes (first paragraph)
Some Text
: Presenter notes (subsequent paragraph(s))
This has the same result as the example above.
Index
Examples
Package Files
args.go caption.go code.go doc.go html.go iframe.go image.go link.go parse.go style.go video.go
Variables
var NotesEnabled = false
NotesEnabled specifies whether presenter notes should be displayed in the present user interface.
var PlayEnabled = false
PlayEnabled specifies whether runnable playground snippets should be displayed in the present user interface.
func Register Uses
func Register(name string, parser ParseFunc)
Register binds the named action, which does not begin with a period, to the specified parser to be invoked when the name, with a period, appears in the present input text.
func Style Uses
func Style(s string) template.HTML
Style returns s with HTML entities escaped and font indicators turned into HTML font tags.
Code:
const s = "*Gophers* are _clearly_ > *cats*!"
fmt.Println(Style(s))
Output:
<b>Gophers</b> are <i>clearly</i> > <b>cats</b>!
func Template Uses
func Template() *template.Template
Template returns an empty template with the action functions in its FuncMap.
type Author Uses
type Author struct {
Elem []Elem
}
Author represents the person who wrote and/or is presenting the document.
func (*Author) TextElem Uses
func (p *Author) TextElem() (elems []Elem)
TextElem returns the first text elements of the author details. This is used to display the author' name, job title, and company without the contact details.
type Caption Uses
type Caption struct {
Text string
}
func (Caption) TemplateName Uses
func (c Caption) TemplateName() string
type Code Uses
type Code struct {
Text template.HTML
Play bool // runnable code
Edit bool // editable code
FileName string // file name
Ext string // file extension
Raw []byte // content of the file
}
func (Code) TemplateName Uses
func (c Code) TemplateName() string
type Context Uses
type Context struct {
// ReadFile reads the file named by filename and returns the contents.
ReadFile func(filename string) ([]byte, error)
}
A Context specifies the supporting context for parsing a presentation.
func (*Context) Parse Uses
func (ctx *Context) Parse(r io.Reader, name string, mode ParseMode) (*Doc, error)
Parse parses a document from r.
type Doc Uses
type Doc struct {
Title string
Subtitle string
Time time.Time
Authors []Author
TitleNotes []string
Sections []Section
Tags []string
}
Doc represents an entire document.
func Parse Uses
func Parse(r io.Reader, name string, mode ParseMode) (*Doc, error)
Parse parses a document from r. Parse reads assets used by the presentation from the file system using ioutil.ReadFile.
func (*Doc) Render Uses
func (d *Doc) Render(w io.Writer, t *template.Template) error
Render renders the doc to the given writer using the provided template.
type Elem Uses
type Elem interface {
TemplateName() string
}
Elem defines the interface for a present element. That is, something that can provide the name of the template used to render the element.
type HTML Uses
type HTML struct {
template.HTML
}
func (HTML) TemplateName Uses
func (s HTML) TemplateName() string
type Iframe Uses
type Iframe struct {
URL string
Width int
Height int
}
func (Iframe) TemplateName Uses
func (i Iframe) TemplateName() string
type Image Uses
type Image struct {
URL string
Width int
Height int
}
func (Image) TemplateName Uses
func (i Image) TemplateName() string
type Lines Uses
type Lines struct {
// contains filtered or unexported fields
}
Lines is a helper for parsing line-based input.
type Link struct {
URL *url.URL
Label string
}
func (Link) TemplateName Uses
func (l Link) TemplateName() string
type List Uses
type List struct {
Bullet []string
}
List represents a bulleted list.
func (List) TemplateName Uses
func (l List) TemplateName() string
type ParseFunc Uses
type ParseFunc func(ctx *Context, fileName string, lineNumber int, inputLine string) (Elem, error)
type ParseMode Uses
type ParseMode int
ParseMode represents flags for the Parse function.
const (
// If set, parse only the title and subtitle.
TitlesOnly ParseMode = 1
)
type Section Uses
type Section struct {
Number []int
Title string
Elem []Elem
Notes []string
Classes []string
Styles []string
}
Section represents a section of a document (such as a presentation slide) comprising a title and a list of elements.
func (Section) FormattedNumber Uses
func (s Section) FormattedNumber() string
FormattedNumber returns a string containing the concatenation of the numbers identifying a Section.
func (Section) HTMLAttributes Uses
func (s Section) HTMLAttributes() template.HTMLAttr
HTMLAttributes for the section
func (Section) Level Uses
func (s Section) Level() int
Level returns the level of the given section. The document title is level 1, main section 2, etc.
func (*Section) Render Uses
func (s *Section) Render(w io.Writer, t *template.Template) error
Render renders the section to the given writer using the provided template.
func (Section) Sections Uses
func (s Section) Sections() (sections []Section)
Sections contained within the section.
func (Section) TemplateName Uses
func (s Section) TemplateName() string
type Text Uses
type Text struct {
Lines []string
Pre bool
}
Text represents an optionally preformatted paragraph.
func (Text) TemplateName Uses
func (t Text) TemplateName() string
type Video Uses
type Video struct {
URL string
SourceType string
Width int
Height int
}
func (Video) TemplateName Uses
func (v Video) TemplateName() string
Package present imports 17 packages (graph) and is imported by 21 packages. Updated 2017-07-18. Refresh now. Tools for package owners.
|
__label__pos
| 0.832392 |
Harvest + Forecast
Hi guys do u know if forecast works with asana (i know Harvest plugs in directly)
Also Does Harvest generate Purchase Orders or is there a plug in that will do that?
1 Like
You can do your expenses in Harvest and it can create invoices
Forecast does not integrate directly with Asana. But it does integrate with Harvest, so in a roundabout way there is some integration. It will probably depend what you are looking for Forecast to accomplish for your team.
I would love to have the Asana start and End dates automatically go to Forecast. Currently we are doing a lot of manual work to keep these in sync.
2 Likes
|
__label__pos
| 0.947845 |
Login | Register
LinkedIn
Google+
Twitter
RSS Feed
Download our iPhone app
TODAY'S HEADLINES | ARTICLE ARCHIVE | FORUMS | TIP BANK
Browse DevX
Sign up for e-mail newsletters from DevX
advertisement
Enforce Custom Password Policies in Windows : Page 3
Most people take the easy way out and use the default filter in order to validate passwords. But did you know you can employ authentication modules to customize your password policies to reflect your organization's unique security requirements? Find out how in this article.
advertisement
The RegEx Password Filter Sample
Now that you're aware of all the possible pitfalls, it's high time for code action. This section will walk you through the sample provided with this article. I've created a VS7 solution with the PasswordFilterRegEx VC project.
As the Password Filter definition requires, you export three functions. Here's the code for the DEF file included within the sample project:
LIBRARY PasswordFilterRegEx EXPORTS InitializeChangeNotify PasswordChangeNotify PasswordFilter
The PasswordFilterRegEx.cpp contains source code for the exported functions. The implementations of InitializeChangeNotify and PasswordChangeNotify are quite simple:
// Initialization of Password filter. // This implementation just returns TRUE // to let LSA know everything is fine BOOLEAN __stdcall InitializeChangeNotify(void) { WriteToLog("InitializeChangeNotify()"); return TRUE; } // This function is called by LSA when password // was successfully changed. // // This implementation just returns 0 (Success) NTSTATUS __stdcall PasswordChangeNotify( PUNICODE_STRING UserName, ULONG RelativeId, PUNICODE_STRING NewPassword ) { WriteToLog("PasswordChangeNotify()"); return 0; }
The bulk of the work is done in the PasswordFilter function (shown in Listing 1). First, create a zero-terminating copy of a password string and assign it to an STL wstring object (STL is used in conjunction with the boost regex library):
wszPassword = new wchar_t[Password->Length + 1]; if (NULL == wszPassword) { throw E_OUTOFMEMORY; } wcsncpy(wszPassword, Password->Buffer, Password->Length); wszPassword[Password->Length] = 0; WriteToLog("Going to check password"); // Initialize STL string wstrPassword = wszPassword;
Next, the regular expression is instantiated. The sample Password Filter reads the regular expression from the RegEx value of the following registry key:
HKEY_LOCAL_MACHINE\\Software\\DevX\\PasswordFilter
If the value is not found in registry, the dummy default regular expression ("^(A)$") is used.
Finally, validate the password against the regular expression and return the results to the caller (LSA):
WriteToLog("Going to run match"); // Prepare iterators wstring::const_iterator start = wstrPassword.begin(); wstring::const_iterator end = wstrPassword.end(); match_results<wstring::const_iterator> what; unsigned int flags = match_default; bMatch = regex_match(start, end, what, wrePassword); if (bMatch) { WriteToLog("Password matches specified RegEx"); } else { WriteToLog("Password does NOT match specified RegEx"); } . . . return bMatch;
Just before you return the results to LSA, perform memory clean-up:
// Erase all temporary password data // for security reasons wstrPassword.replace(0, wstrPassword.length(), wstrPassword.length(), (wchar_t)'?'); wstrPassword.erase(); if (NULL != wszPassword) { ZeroMemory(wszPassword, Password->Length); // Assure that there is no compiler optimizations and read random byte // from cleaned password string srand(time(NULL)); wchar_t wch = wszPassword[rand() % Password->Length]; delete [] wszPassword; wszPassword = NULL; } return bMatch;
Comment and Contribute
(Maximum characters: 1200). You have 1200 characters left.
Sitemap
|
__label__pos
| 0.733628 |
[Discussion] Sketchup, Blender, 3Dmax and other 3D programs
Discuss, get help with, or post new modifications, graphics or related tools for Locomotion in this forum.
Moderator: Locomotion Moderators
User avatar
Tattoo
Director
Director
Posts: 597
Joined: 03 Jan 2009 18:17
Location: Chicago
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D programs
Post by Tattoo » 15 Sep 2010 05:44
I'd like to see the action you use in PS. I also use one but I get some blue pixels around the edges that I just can't get rid of. I also think it would be better if you used the same model in each scene. I'm not able to see the differences from one to the other since you used different models in each scene but from what you shown, the top 2 look the same.
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
: : = FYRA v250 = : : = AU NSW 86 Class Electric Locomotive = : : = AU QR EDI Bombadier IMU/SMU Trainset = : : = B-Class & VicPass = : : = MSTS Scotsman = : : = US Semi Trucks Pack = : :
: : = Steel Bridge = : : = Tube Bridge = : : = 2 New Earth Slopes = : : = Default Bridges w/ New Slopes added = : : = Camera Angles for Shape Viewer = : : = EU Semi Trucks Pack = : : = US Tank Cars 56' = : :
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
K.Y.Chung
Transport Coordinator
Transport Coordinator
Posts: 350
Joined: 03 Oct 2009 09:30
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by K.Y.Chung » 16 Sep 2010 13:47
I've modified the previous reply. All the previews come from the same model. Comments are still wanted and it's absolutely OK if you think all these 3 are not good enough.
Tattoo: here is my PS action, but there are some precautions:
1. Set "Image Interpolation" to be "Bicubic Sharper" in "Preferences"->"General"
2. You will be unable to copy and paste anything while the action is running as the clipboard will be "hijacked".
3. There are many actions in my file. Just have a look at "Action for Railway Cars" if you want to learn the algorithm, but it is OK if you have interest to investigate the others of course. Most of them do the same things except the scale, but some of them have not been modified for ages so I'm not sure whether they can run properly with newer versions of PS.
4. What the last 3 steps do are to apply the palette. I'm not sure whether it can run properly when the palette files are absent. Only choose to run one of these 3 steps: The 1st one applies a normal vehicle palette, while the 2nd and the 3rd one apply the palette with company colors and primary company colors only respectively. Just delete them and record this step again if they throw out errors.
Attachments
Automation for Loco(01062010).zip
(7.53 KiB) Downloaded 233 times
Visit Nanyue Express for my railway car drawings
User avatar
Tattoo
Director
Director
Posts: 597
Joined: 03 Jan 2009 18:17
Location: Chicago
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by Tattoo » 18 Sep 2010 02:21
Thanks K.Y. for sharing those. Yours is way more involved than the one I setup. It's interesting how you got it to work as good as you did. Altho, I don't like that it deforms the roof edge some. It took me a minute to figure out how large you render your sprites to get the correct size to have a 110x110 sprite but I got it. I didn't look at the others yet tho. Thanks again...
EDIT: I just ran thru the steps in your action and it's actually not much different than the one I made except you use 'Free Transform' to scale the image down. The only part I'm wondering about is the size you render to. In the one step, it selects pixels at 1079 x 1919. So I'm guessing that you render your sprites at something like 1100 x 2000. That's pretty darn high. I only render to 330 x 330. Your way does work better than mine tho and thanks again for sharing them. After I found the correct size you rendered to, the roof edge isn't deformed.
I rendered a couple sprites at 1000 x 1000 cuz my camera is setup square and your action works great. It deformed the roof edge before, I guess because I had the wrong render size before. Thansk again. This actually works better than fusion. Fusion gives a dark edge around the model that I can't get rid of. I'll be using this more now..
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
: : = FYRA v250 = : : = AU NSW 86 Class Electric Locomotive = : : = AU QR EDI Bombadier IMU/SMU Trainset = : : = B-Class & VicPass = : : = MSTS Scotsman = : : = US Semi Trucks Pack = : :
: : = Steel Bridge = : : = Tube Bridge = : : = 2 New Earth Slopes = : : = Default Bridges w/ New Slopes added = : : = Camera Angles for Shape Viewer = : : = EU Semi Trucks Pack = : : = US Tank Cars 56' = : :
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
User avatar
cards525
Traffic Manager
Traffic Manager
Posts: 144
Joined: 28 Feb 2009 16:27
Skype: cards525
Location: Chicago, Illinois, United States
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by cards525 » 26 Nov 2010 05:57
Allite... So I got this 3d model to create a couple things...
What program should I use to make industries?
Ships?
Cars?
X.G.fr0sty
Chief Executive
Chief Executive
Posts: 675
Joined: 20 Nov 2005 12:10
Location: Australia; Melbourne
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by X.G.fr0sty » 26 Nov 2010 09:17
What ever program you feel best at... because mind you, you also got to create the images required.
Image
User avatar
cards525
Traffic Manager
Traffic Manager
Posts: 144
Joined: 28 Feb 2009 16:27
Skype: cards525
Location: Chicago, Illinois, United States
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by cards525 » 26 Nov 2010 09:49
BlenderUser wrote:What ever program you feel best at... because mind you, you also got to create the images required.
I meant I have the 3d models and that stuff... Just what program converts them into Usable DATS?
X.G.fr0sty
Chief Executive
Chief Executive
Posts: 675
Joined: 20 Nov 2005 12:10
Location: Australia; Melbourne
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by X.G.fr0sty » 26 Nov 2010 23:32
well depending on what you used to create the models... Locomotion uses dats; that are formed by coding, and sprites/images.
Now somewhere around here (If I can find the like ill post); theres a list of the angels that the images need to be in, and how many.
Also, the coding, will be a bit tricky if you plan on doing it yourself (But as time goes on you may be faster).
The Tool is called.. LocoTool... (May have to do a little searching); but you just need to move the images files and the coding file into locotool and a .dat should be created (I think; its been ages)
Image
K.Y.Chung
Transport Coordinator
Transport Coordinator
Posts: 350
Joined: 03 Oct 2009 09:30
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by K.Y.Chung » 14 Jan 2011 14:24
I've just found some typing mistake in the blender rendering script which may cause errors. Please download it again and I'm sorry for any inconvenience caused :oops:
Visit Nanyue Express for my railway car drawings
K.Y.Chung
Transport Coordinator
Transport Coordinator
Posts: 350
Joined: 03 Oct 2009 09:30
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by K.Y.Chung » 24 Feb 2011 11:30
I've had an idea of proposing a complete solution for those who would like to stick to open-source software when there are plenty of people asking me how to make the objects. The macro recording function of Photoshop is great, but it is absent in gimp. I've spent several months on learning script-fu to automate sprite preparation by gimp, and a little success has been achieved. 8)
Visit Nanyue Express for my railway car drawings
maquinista
Tycoon
Tycoon
Posts: 1809
Joined: 10 Jul 2006 00:43
Location: Spain
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by maquinista » 25 Feb 2011 15:51
I can send You some GIMP and IrfanView scripts for Windows.
Sorry if my english is too poor, I want learn it, but it isn't too easy.[/list][/size]
K.Y.Chung
Transport Coordinator
Transport Coordinator
Posts: 350
Joined: 03 Oct 2009 09:30
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by K.Y.Chung » 11 Mar 2011 04:01
I've just finished the very first version of the sprite processing script for GIMP, but there are a few limitations and precautions:
1. Copy & paste the script into a .scm file using notepad, then put the file under
(install directory of GIMP)\share\gimp\2.0\scripts\
2. The script will become available under Main Menu -> Tools -> Batch Sprite Processing
2. You need to prepare and add the palettes manually into GIMP first before you can apply them to the images (don't ask me how to do so since you can learn it by having a look at GIMP documentation).
3. Adjusting dither amount is impossible in GIMP
4. It only accepts PNGs as input images.
The only advantage of using this GIMP script over PS macro is that it will not "hijack" the clipboard. I haven't tried to compare the resulting sprites prepared by these 2 ways as the script is developed in my office during working hours :lol: :lol:
Code: Select all
(define (script-fu-sprite-process-batch inDir scale palette)
(let*
(
(file-list (cadr (file-glob (string-append inDir "\\*.png") 1)))
)
(while (not (null? file-list))
(let*
(
(file-name (car file-list))
(image (car (gimp-file-load 0 file-name file-name)))
(drawable (car (gimp-image-active-drawable image)))
(base-layer (aref (car (cdr (gimp-image-get-layers image))) 0))
(base-layer-duplicated (car (gimp-layer-copy base-layer TRUE)))
(mask-layer (car (gimp-layer-copy base-layer TRUE)))
(image-width (car (gimp-image-width image)))
(image-height (car (gimp-image-height image)))
(new-width (* scale image-width))
(new-height (* scale image-height))
)
(gimp-layer-add-alpha base-layer)
(gimp-image-add-layer image base-layer-duplicated -1)
(gimp-image-set-active-layer image base-layer-duplicated)
(set! drawable (car (gimp-image-active-drawable image)))
(gimp-selection-all image)
(gimp-selection-shrink image 1)
(gimp-by-color-select drawable '(0 0 255) 0 3 FALSE FALSE 0 FALSE)
(gimp-edit-clear drawable)
(gimp-selection-none image)
(gimp-layer-scale-full base-layer-duplicated new-width new-height FALSE 3)
(gimp-image-set-active-layer image base-layer)
(gimp-layer-scale-full base-layer new-width new-height FALSE 0)
(gimp-image-add-layer image mask-layer -1)
(gimp-image-set-active-layer image mask-layer)
(set! drawable (car (gimp-image-active-drawable image)))
(gimp-by-color-select drawable '(0 0 255) 0 0 FALSE FALSE 0 FALSE)
(gimp-image-raise-layer-to-top image mask-layer)
(gimp-selection-invert image)
(gimp-layer-add-alpha mask-layer)
(gimp-edit-clear drawable)
(gimp-layer-scale-full mask-layer new-width new-height FALSE 0)
(gimp-image-crop image new-width new-height 0 0)
(gimp-image-merge-visible-layers image 2)
(gimp-selection-none image)
(set! drawable (car (gimp-image-active-drawable image)))
(gimp-convert-indexed image 2 4 256 FALSE FALSE palette)
(file-png-save2 1 image drawable file-name file-name 0 9 0 0 0 0 0 0 1)
(gimp-image-delete image)
)
(set! file-list (cdr file-list))
)
)
)
(script-fu-register
"script-fu-sprite-process-batch" ;func name
"Batch Sprite Processing" ;menu label
"Process the sprites generated by 3D programs for use in Locomotion" ;description
"K.Y.Chung" ;author
"copyright 2011, K.Y.Chung; 2009, the GIMP Documentation Team" ;copyright notice
"23 Feb 2011" ;date created
"*" ;image type that the script works on
SF-DIRNAME "Input Directory" ""
SF-VALUE "Scale Factor" "0.1"
SF-PALETTE "Palette Name" ""
)
(script-fu-menu-register "script-fu-sprite-process-batch" "<Image>/Tools")
Visit Nanyue Express for my railway car drawings
K.Y.Chung
Transport Coordinator
Transport Coordinator
Posts: 350
Joined: 03 Oct 2009 09:30
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by K.Y.Chung » 06 Jul 2011 15:40
Here is a good news for Blender users (including me of course :lol: ) The stable version of the rendering script for Blender 2.5+ has been completed. The old reply with the quick and dirty adaptation of the script has been deleted since we don't need it anymore :P Most known bugs have been solved. It is really painful for migrating from Blender 2.4x to 2.5x but I've found the beauty and elegance of the latter. The UI of the rendering script has been integrated into the UI of Blender prefectly. I've provided 2 branches of the rendering script, they do exactly the same thing except they are called from different areas.
Let me have a quick introduction on how to use it first:
auto_renderer_usage.png
(222.31 KiB) Downloaded 2 times
1. Open the "User Preferences" window
2. Click "Install Add-On" and add the zip file downloaded below. I'm not sure whether it really works, but you can extract and then add the 2 .py files separately if it fails. You can add one of them only also, depends on your needs.
3. Choose "Render" category to browse the related add-ons.
4. Enable those add-ons titled "Auto renderer for Locomotion. Again it's totally up to you to choose any one of them to activate.
5. If you choose Menu Edition, the script can be fired by choosing "Render for Locomotion" under "Render" in the main menu.
6. If you choose Panel Edition, the script can be fired on the last tab in "Render" tab under Properties window.
Attachments
auto_renderer_3.zip
(5.97 KiB) Downloaded 173 times
Visit Nanyue Express for my railway car drawings
mc.crab
Traffic Manager
Traffic Manager
Posts: 145
Joined: 06 Jun 2010 10:08
Location: Finland
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by mc.crab » 24 Jul 2011 09:20
K.Y.Chung, I tried your rendering script but when I try to run it, it just causes blender to freeze. I'm using blender 2.58 and I installed the script with your instructions.
Edit: Actually it didn't freeze, alltough I couldn't do anything it was still taking pictures. I used the option to rotate the mesh object and I got about 20 identical imaged (20 because I thought that Blender froze so I closed it).
- Fractal design R3 case - Asus P8P67 Motherboard - Intel Core i7-2600k 3,4Ghz - AMD Radeon HD6950 Direct CU II 2GB - 8GB DDR3 1600Mhz -
K.Y.Chung
Transport Coordinator
Transport Coordinator
Posts: 350
Joined: 03 Oct 2009 09:30
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by K.Y.Chung » 29 Jul 2011 16:24
mc.crab wrote:K.Y.Chung, I tried your rendering script but when I try to run it, it just causes blender to freeze. I'm using blender 2.58 and I installed the script with your instructions.
Edit: Actually it didn't freeze, alltough I couldn't do anything it was still taking pictures. I used the option to rotate the mesh object and I got about 20 identical imaged (20 because I thought that Blender froze so I closed it).
Yes, Blender will appear to be frozen when the script is running. Just keep patient until all the 136 images (in case of railway vehicles) have been generated. You can verify this by opening the output directory to see if new images keep generated or not. Sometimes you may also need to keep refresh the explorer window to browse new images. If you've already got 20 images generated and there is nothing wrong on those images, the script is supposed to be running properly :wink:
Visit Nanyue Express for my railway car drawings
mc.crab
Traffic Manager
Traffic Manager
Posts: 145
Joined: 06 Jun 2010 10:08
Location: Finland
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by mc.crab » 30 Jul 2011 19:01
Ok thanks.
There is a problem with the images. For some reason every image was takes from the same angle. So I had sprite.001 20 times.
- Fractal design R3 case - Asus P8P67 Motherboard - Intel Core i7-2600k 3,4Ghz - AMD Radeon HD6950 Direct CU II 2GB - 8GB DDR3 1600Mhz -
K.Y.Chung
Transport Coordinator
Transport Coordinator
Posts: 350
Joined: 03 Oct 2009 09:30
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by K.Y.Chung » 09 Aug 2011 13:37
Sorry for answering late as I don't visit here frequently recently, after I've finished my rail vehicle packs scheduled this year :lol:
I guest your vehicle is composed with several objects. You need to merge all the "parts" into a single mesh object and being selected as the active object before running the script. Try again and feel free to ask me if you still have problems. :wink:
Visit Nanyue Express for my railway car drawings
mc.crab
Traffic Manager
Traffic Manager
Posts: 145
Joined: 06 Jun 2010 10:08
Location: Finland
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by mc.crab » 09 Aug 2011 15:12
Thanks, it works :D :D
- Fractal design R3 case - Asus P8P67 Motherboard - Intel Core i7-2600k 3,4Ghz - AMD Radeon HD6950 Direct CU II 2GB - 8GB DDR3 1600Mhz -
73790
Engineer
Engineer
Posts: 111
Joined: 29 Jun 2011 14:02
Skype: southwest7371
Location: United States
Sketchup To DAT
Post by 73790 » 17 Aug 2011 18:27
I was wondering how to you convert a file from sketchup into a dat or blender file, cause i was working on a station thats very cool and i wanna try it in the game, i might release it too, i searched and couldn't find anything helpful.
K.Y.Chung
Transport Coordinator
Transport Coordinator
Posts: 350
Joined: 03 Oct 2009 09:30
Contact:
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by K.Y.Chung » 18 Aug 2011 15:51
You can export the sketchup file into .DAE (collada) format then import it in Blender. If you are using sketchup pro , you can export the model into .3DS also (and it should be a better choice). You need to break down the model until it can't be further broken down before exporting. Of course, you also need to adjust the materials, scale, lights....etc to get the best result 8)
Visit Nanyue Express for my railway car drawings
73790
Engineer
Engineer
Posts: 111
Joined: 29 Jun 2011 14:02
Skype: southwest7371
Location: United States
Re: [Discussion] Sketchup, Blender, 3Dmax and other 3D progr
Post by 73790 » 25 Aug 2011 16:37
K.Y.Chung wrote:You can export the sketchup file into .DAE (collada) format then import it in Blender. If you are using sketchup pro , you can export the model into .3DS also (and it should be a better choice). You need to break down the model until it can't be further broken down before exporting. Of course, you also need to adjust the materials, scale, lights....etc to get the best result 8)
Ok since im using sketchup(not pro) i import into blender, but after that how to i get it to a DAT File?
Post Reply
Return to “Locomotion Graphics, Modifications & Tools”
Who is online
Users browsing this forum: No registered users and 2 guests
|
__label__pos
| 0.840195 |
cancel
Showing results for
Search instead for
Did you mean:
DNS/GTM Activesync Load balancing
David_Gill
Cirrus
Cirrus
I have two data centers where APM front ends activesync traffic to backend LTMs that direct traffic to the actual exchange server. The only issue is that over time in an active/active data center environment, the activesync client will end up establishing APM connections to both data centers due to it re-resolving the activesync FQDN.
What is the best way to distribute the wide-ip responses to both data centers while maintaining client affinity/persistence to whichever one it happens to receive when GTM first responds?
Thanks.
0691T00000BTg1mQAD.png
0 REPLIES 0
|
__label__pos
| 0.533076 |
AnteriorPosterior
Tema 13: Variables dinámicas (1b: lista ordenada)
Curso: Curso de Pascal, por Nacho Cabanes
Aquí va un programilla de ejemplo, que ordena los elementos que va insertando... y poco más }:-) :
{--------------------------}
{ Ejemplo en Pascal: }
{ }
{ Ejemplo de listas }
{ dinámicas enlazadas }
{ LISTAS.PAS }
{ }
{ Este fuente procede de }
{ CUPAS, curso de Pascal }
{ por Nacho Cabanes }
{ }
{ Comprobado con: }
{ - Free Pascal 2.2.0w }
{ - Turbo Pascal 7.0 }
{ - Tmt Pascal Lt 1.20 }
{--------------------------}
program EjemploDeListas;
type
puntero = ^TipoDatos;
TipoDatos = record
numero: integer;
sig: puntero
end;
function CrearLista(valor: integer): puntero; {Crea la lista, claro}
var
r: puntero; { Variable auxiliar }
begin
new(r); { Reserva memoria }
r^.numero := valor; { Guarda el valor }
r^.sig := nil; { No hay siguiente }
CrearLista := r { Crea el puntero }
end;
procedure MuestraLista ( lista: puntero );
begin
if lista <> nil then { Si realmente hay lista }
begin
writeln(lista^.numero); { Escribe el valor }
MuestraLista (lista^.sig ) { Y mira el siguiente }
end;
end;
procedure InsertaLista( var lista: puntero; valor: integer);
var
r: puntero; { Variable auxiliar }
begin
if lista <> nil then { Si hay lista }
if lista^.numero<valor { y todavía no es su sitio }
then { hace una llamada recursiva: }
InsertaLista(lista^.sig,valor) { mira la siguiente posición }
else { Caso contrario: si hay lista }
begin { pero hay que insertar ya: }
new(r); { Reserva espacio, }
r^.numero := valor; { guarda el dato }
r^.sig := lista; { pone la lista a continuac. }
lista := r { Y hace que comience en }
end { el nuevo dato: r }
else { Si no hay lista }
begin { deberá crearla }
new(r); { reserva espacio }
r^.numero := valor; { guarda el dato }
r^.sig := nil; { no hay nada detrás y }
lista := r { hace que la lista comience }
end { en el dato: r }
end;
var
l: puntero; { Variables globales: la lista }
begin
l := CrearLista(5); { Crea una lista e introduce un 5 }
InsertaLista(l, 3); { Inserta un 3 }
InsertaLista(l, 2); { Inserta un 2 }
InsertaLista(l, 6); { Inserta un 6 }
MuestraLista(l) { Muestra la lista resultante }
end.
Ejercicio propuesto: ¿Se podría quitar de alguna forma el segundo "else" de InsertaLista?
Ejercicio propuesto: ¿Cómo sería un procedimiento que borrase toda la lista?
Ejercicio propuesto: ¿Cómo sería un procedimiento de búsqueda, que devolviera la posición en la que está un dato, o NIL si el dato no existe?
Ejercicio propuesto: ¿Cómo se haría una lista "doblemente enlazada", que se pueda recorrer hacia adelante y hacia atrás?
Pues eso es todo por hoy... ;-)
Actualizado el: 19-08-2012 22:19
AnteriorPosterior
|
__label__pos
| 1 |
Learning In Statistics in Bradford, Pennsylvania, McKean
1. Know the Importance of Statistics
Statistics is an integral portion of our daily life. every the industries are using statistics to do something their routine work. For example, in our hours of daylight to day life, we slant statistics likewise afterward we go for the surgery the doctor say us what would be the minister to or side effects of the particular surgery.
On the other hand, we daily watch the stats higher than the internet as competently as additional channels roughly the employment rate, GDP, crime rate and consequently on. There are great quantity of examples which we have seen our daylight to day life.
Read Also :
See as well as easy Formula Steps on How to Calculate Common Stock
From this point, you may be able to understand why statistics is crucial for us. And why you need to chemical analysis statistics. The number of students always have a doubt that why to learn statistics. This tapering off will incite them to make clear about why statistics is important.
Work upon purchase knowledge of statistics: After getting know what is statistics. This is the times to fake upon attainment the knowledge of statistics.
There are plenty of resources straightforward higher than the internet and offline that will encourage you to get a deep knowledge of statistics. You can also gain statistics knowledge in the same way as the help of a statistics book.
There are a number of books that will help you to learn statistics from basic to the campaigner level.
2. Learn the terms most often used in statistical analysis.
Mode
It is the set of data values that appear most often in a unlimited dataset. Suppose that if in a data set the x is a discrete random variable, then the mode of x will be the probability enlargement produce a result that is having the maximum value.
Median
It is the simplest decree of central tendency. We arrange the observation from the smallest to the largest value to locate the medium of the given data set. In skirmish of the strange number of interpretation in a total data set later the center value automatically become the median. In skirmish of even number of observations, the sum of two middle values become the median.
See moreover {} What Are The 4 measures Of Variability | A resolution Guide
Standard Deviation
Standard oddness is all approximately the feat that is used to quantify the amount of variation of a set of data values.
Distribution
Distribution of statistical data sets (or populations) is a list of deed that represents every attainable values (or intervals) of data and how often it occurs. taking into account the distribution of hierarchical data is conducted, you see the number or percentage of individuals in each group.
Bell-shaped curve
An asymmetrical bell-shaped curve that represents the distribution of values, frequencies, or possibilities of a set of data. Gaussian or general distribution is the usually mathematically well-defined vine curve in statistics and in science.
Probability
The probability distribution is a table or an equation that connects each consequences of a statistical experiment to the probability of an event. announce a easy experiment in which we flip a coin twice. Suppose random modifiable X is defined as the outcome of two coins.
Outliers
For example, the farthest reduction in the above figure is external. A convenient definition of an outside is a lessening that is 1.5 epoch complex than the interquartile range above or under the first quartile. There can next be out lump gone comparing interaction amongst two sets of data.
3. begin applying them to run of the mill life
The best artifice to learn all is from applying it in genuine life. You can as a consequence learn statistics by applying it in your hours of daylight to hours of daylight life. You can apply various statistics in your daily life to make hermetic decisions. In fact, statistics will help you to spend your keep more effectively. You can moreover get various statistics from newspapers, media, politics and sports.
See moreover {} The Definitive lead upon Margin of error in Statistics
4. Learn approximately statistics from what people telling you and asking them questions
Statistics is one of the toughest subjects for anyone. Whether you are an intelligent student or an average one. later than you acquire into statistics class. after that you can learn statistics more effectively by asking the ask from your mentor.
You should plus focus upon what your mentor is teaching to you. It is the best and most effective habit to learn statistics. Your little attention can encourage you to have a better command higher than statistics.
5. find some software that will encourage you shout abuse a unconditional set of values
Statistics software are then playing crucial in learning statistics. This software helps you to ill-treat data more easily next you accomplish manually.
There are great quantity of commands assigned in that software to sham some predefined statistics function. If you have some basic knowledge practically statistics subsequently it would urge on you can behave these statistics tools easily and even learn more approximately statistics afterward these tools.
Tips to find Out The Best Statistics Assignment Helper
See then {} How complete You mention Your Statistics Assignment in APA
1. assume the help of the internet
Internet is full of resources; there are profusion of websites that have the funds for you the best statistics assignment help. so how can your internet back you to choose the right statistics assignment encourage services?
You should look for those sites which are having fine reviews. These sites usually allow the best statistics assignment help. try to avoid the low-quality sites that find the money for the wrong answers for your statistics questions. A good vibes assignment put up to sites assist you to acquire excellent grades from your teacher.
Learning In Statistics in Bradford, Pennsylvania, McKean
2. Analyzing the featured examples in the site
This is one of the most excellent ways to choose the right one. You should have a see at the featured examples that have mentioned upon the site. These examples incite you to analyze the accomplish of the sites.
These examples allow you know the reply that has been achieved by solving the complex misfortune of statistics question. From that, you can have the idea of how effectively the particular assignment helpers can solve the highbrow problems.
3. acquire The urge on From Statistics Experts Sites
Sometimes the students solve the rarefied statistics questions. They attempt their best but dont get the desired answer. If they acquire the solution to the problem, but the reply may not be cleared in their mind. In this way, they can email the statistics experts to solve their problem.
See after that {} How to find the Best Online Statistics Homework Help
These experts usually mastered the topic and can lead you to solve the highbrow problems quickly and distinct every your doubts almost the solutions. make laugh keep in mind that dont just yield your question to them and get an answer from them. then again of this, keep amused try to learn each step that is used to locate the answer to your statistics assignment questions.
4. acknowledge The back up From The Apps
Some sites have taken their assignment put up to services to the adjacent level. They are the apps greater than the internet that urge on the students to get the best statistics assignment urge on without visiting the website. In some cases, the apps are a lot improved than the site.
The students can easily agree their assignment and create payments securely taking into consideration the urge on of this excellent app. In some apps, the assignment urge on provider gives the capability of the sites calculator.
This calculator helps you to get the fast results of your statistics question. behind the assist of this feature, you can acquire an idea that a particular app is right for you or not.
5. get The incite Form live Mentors
In some of the site, you can locate the mentor live for you to solve every your statistics assignment questions. Here you dependence to pay some charges to have the session with the mentor.
See furthermore {} summit 8 reasons why one should learn statistics for robot learning
But I would subsequently to suggest that you should have a measures of their sessions. Some of the sites have the funds for 5 minutes measures session. In these events session, the students to ensure that the experts teaching them are credited ample to teach them.
If the students get satisfied, they can avail their services and solve all their statistics assignment aligned queries in the
SPSS Vs Excel. Which is the best Tools
SPSS vs Excel is always a huge business in the middle of statistics students mind. Today I am going to share as soon as you the best ever comparison along with SPSS vs Excel.
SPSS
SPSS Stands for statistical packages for Social Science. It is the present leader in terms of statistical packaging tools. There are several uses of SPSS that are considered as the derivative for data batter and storage. It is having two methods for batch processing, i.e., interactive batches and noninteractive batches.
SPSS inc developed it, but innovative on, it was acquired by IBM in 2009. The earlier proclaim of SPSS was under the umbrella. But after acquiring by IBM, SPSS was renamed as IBM SPSS in 2015.
SPSS then comes next an open-source description that is known as PSPP. This tab has used the process of statistics and the formulation of data mistreat techniques considering entirely few exceptions. These statistics and formulation are used for the professional shout insults of large data chunks.The open-source description of SPSS is quite decent, and it wont expire in the future.
Anyone can use the same SPSS software for the lifetime. SPSS is one of the best rational software that provides high-quality graphics for more questioning features.
The best share of this software is taking into consideration you create up to standard graphics in this software. next you can output the graphics as HTML5 files. It means that you can permission these files through your browser too.
Excel
Excel is one of the most powerful and easy to use statistics software. It allows you to collection the data in tabular format, i.e., in rows and column format. It in addition to allows you to interact taking into consideration your data in various ways.
You can sort and filter the data using some of the most potent formulas. The pivot tables one is the best feature of Excel. You can use pivot tables to make a other perception by manipulating the data.
See also {} Tableau vs Spotfire | Which One is better For You And Why?
Excel has various features that can back you taking into consideration statistics. There are merged ways to importing and exporting the data. You can as a consequence combine the data into the workflow.
Like no new statistics software, Excel allows you to create the custom accomplishment using its programming abilities.
The primary want of Excel is to make chronicles of data and to ill-treatment the data as per the users demands. As mentioned earlier, Excel allows you to use the outside database to analyze, make reports, and as a result on.
Now a day, Excel is offering the best graphical addict interface along next the use of graphics tools and visualization techniques.
Statistics vs Machine Learning: Which is More Powerful
Statistic
Statistics is all just about the chemical analysis of collection, analysis, interpretation, presentation, and handing out of data. Whenever we use statistics in scientific, and industrial problem, we start the process by deciding a statistical model process.
Statistics plays a crucial role in human activity. It means that following the encourage of statistics, we can track human activities. It helps us in deciding the per capita pension of the country, the employment rate, and much more. In extra words, statistics support us to conclude from the data we have collected.
Learning In Statistics
Machine learning
Machine learning is the innovative technology. It is developing at a gruff pace. During the last few years, robot learning has reached the bordering level. It is used in various fields following fraud detection, web search results, real-time ads on web pages and mobile devices, image recognition, robotics, and many extra areas.
Machine learning is a ration of computer science. It has been evolved from the investigation of computational learning and theory in unnatural intelligence. machine Learning measure afterward AI. In other words, robot learning gives the skill to the computers to learn additional things taking into consideration the back up of some programs.
Machine learning is moreover cooperative to create predictions on data. It constructs some algorithms that are operated by a model creation, and it is used to make data-driven predictions. machine learning has played a crucial role in the functionality of human society.
Difference amid Statistics vs machine Learning
Nowadays, data is the key to triumph for the business. But data is continually shifting and evolving at a terse pace. fittingly the event needs some techniques to convert the raw data into critical one. For this they endure back up of machine learning and statistics.
See plus {} What is Bias in Statistics? Its Definition and Types
Data is collected in the organization from unsigned operations. The companies always need to convert the data into necessary data; otherwise, the data is no more than the garbage.
Industries using statistics
Almost every industry use the statistics. Because without statistics, we cant get the conclusion from the data. Nowadays, statistics is crucial for various fields behind eCommerce, trade, psychology, chemistry, and much more.
Business
Statistics is one of the significant aspects of companies. It is playing a crucial role in the industry. Nowadays, the world is becoming more competitive than ever before.
It is becoming more hard for the matter to stay in the competition. They craving to meet the customers desires and expectations. It can lonesome happen if the company takes fast and augmented decisions.
So how can they realize so? Statistics feat a crucial role in conformity the desires and expectations of the customers. It is, therefore, important that brands say you will fast decisions so that they can create better decisions. Statistics present useful insights to create smarter decisions.
Economics
Statistics is the base of Economics. It is playing a crucial role in economics. National allowance tally is essential indicators for economists. There are various statistics methods do its stuff on the data to analyze it.
Statistics is along with long-suffering in defining the membership between request and supply. It is in addition to required in in relation to every aspect of economics.
Mathematics
Statistics is as a consequence an integrated share of mathematics. Statistics help in describing measurements in a true manner.
Mathematicians frequently use statistical methods in imitation of probability averages, dispersions, estimation. every these are after that an integral ration of mathematics.
Banking
Statistics plays an vital part in the banking sector. Banks require statistics for the number of exchange reasons. The banks pretend upon conclusive phenomena. Someone deposits their keep in the bank.
Then the banker estimates that the depositor will not desist their child support during a period. They with use statistics to invest the money of the depositor into the funds. It helps the banks to make their profit. {}
State Management
Statistics is an indispensable aspect of the increase of the country. Statistical data is widely used to acknowledge administrative level decisions. Statistics is crucial for the government to proceed its duties efficiently.
Industries using machine learning
The spread of computer and technologies has produced robot learning. robot learning has misused the pretension we breathing our lives. There are lots of industries which are using machine learning.
Google is using robot learning in their self-driven cars. Netflix is one of the most excellent examples of machine learning technologies. Netflix is using robot learning to personalize the content for its customers.
It analyzes human behavior and subsequently provides the best-matched content to the customer. robot learning is as well as helpful in fraud detection, and it helps the brands to be secure in all but every platform.
Machine learning is getting more well-liked because the data is as well as growing at a gruff pace. It allows us to analyze the omnipresent amount of data in less times and low cost taking into account the put up to of powerful data analysis methods. It helps us to quickly fabricate models that can analyze the loud amount of data and take in hand faster solutions, even on a large scale.
See plus {} Excel VS Numbers: Which One Makes You Smart
Business
Brands are using machine learning to create various models to examine their performance. robot learning allows the brands to make thousands of model in a week.
It is making the brands more working and better for the long term. robot learning afterward offers various data techniques that are quite willing to help for the situation to meet the needs of brands in in relation to every sector.
It is making the brands more dynamic and augmented for the long term. robot learning plus offers various data techniques that are quite cooperative for the concern to meet the needs of brands in around all sector.
Decision Making
Machine learning is along with obliging in decision making. It helps to reproduce the known patterns and knowledge.
These patterns automatically applied to the data we have collected from various sources. correspondingly it helps the concerned people to bow to greater than before decision and actions.
Neural Networks
Neural networks were used for data mining applications. But after the innovation of machine learning, it is realistic to create complex neural networks that are having many layers. {} {}
Statistics vs robot Learning
They belong to oscillate schools
Machine Learning
Machine learning is a subset of computer science and pretentious intelligence. It harmony past building a system that can learn from the data then again of learning from the pre-programmed instructions.
Statistical Modelling
Statistics is a subset of mathematics. It deals in the same way as finding the membership in the middle of variables to predict the outcome. {}
They came happening in vary eras
Statistics is quite older than machine learning. on the additional hand, machine learning got into existence a few years ago. machine learning comes into existence in the 1990s, but it was not getting that much popular.
But after the computing becomes cheaper, subsequently the data scientist moves into the early payment of robot learning. The number of growing data and difficulty of huge data has increased the dependence for robot learning. {} {}
See afterward {} Learn virtually Excel & Topics of Excel Assignment For Students
The extent of assumptions involved
Statistics modeling is used to affect on several assumptions. Here are the few examples of linear regression assumes.
The linear checking account along with the independent and dependent variable
Homoscedasticity
For every dependent value aspire of error at zero.
Observations of independence.
normally distribution of error for each value of the dependent variable
On the other robot Learning algorithms attain agree to a few of these things. But in general, are spared from most of these assumptions.
We also infatuation not specify the distribution of the dependent or independent changeable in a robot learning algorithm.
Head-to-Head Comparison of Python vs Matlab
What is Python?
Python is a general-purpose programming language. You can run Python on any platform. It means Python is platform-independent. It is offering the most straightforward syntax, which means you can code easily within this programming language.
Apart from that, if someone extra than works on your Python code, then they can easily right to use and count up the code. It is the most significant language of the next decade, and you habit to write a few lines of code as compared subsequently Java and C++ to feat any task. ( Python Coding put up to )
Python is written in portable ANSI C. therefore that you compile and run the code upon any functioning system, including Mac OS, Windows, Linux, and many more. It works similarly on every the platforms. Python allows you the malleability to code in a tainted environment. {}
Python is a high-level programming language, and it is definitely same to MATLAB. It provides involved typing and automatic memory management; as I mentioned earlier, Python offers the most easy to get to syntax. It means that you can easily convert your ideas into a coding language.
If you have Pythons release license, you will acquire the libraries, lists, and dictionaries. It helps you to achieve solution goals in a well-organized way. It along with works past a variety of modules that help you to begin speedily bearing in mind Python.
See as a consequence {} top 3 Most Prominent Ways for Python String Compare
Advantages of Python:
Execution by end-to-end development.
Open-source packages( Pandas, Numpy, Scipy).
Packages of Trading(zipline, Pybacktest, Pyalgotrade).
Most prominent language for general programming and application development.
Can show once new languages to connect R, C++, and others (Python).
Fastest general-purpose language, especially in iterative loops.Fastest general speed, especially in iterative loops.
Disadvantages of Python:
Immature trading packages.
All packages are not compatible past each new smaller communities as compared like further languages.
Python is Slow at Runtime.
What is Matlab?
MATLAB is a high-level programming language. MATLAB stands for Matrix Laboratory. Thats why it is considered the powerful mysterious language for mathematical programming.
It is offering the best mathematical and graphical packages along following various built-in tools for problem-solving. You can along with fabricate the graphics illustrations using MATLAB. MATLAB is one of the oldest programming languages in the world. It was developed in the late 1970s by Cleve Moler.
Some experts along with pronounce it as a successor of FORTON. In the to the front days of MATLAB, it was an interfacing software for easy admission to Forton libraries for numerical computing without the assist of FORTON.
In the year 1983, the GUI story of MATLAB was introduced by John Little, Cleve Moler, and Steve Bangert. After rewriting the MATLAB code in C in the year 1984, to the formation of MathWorks. Nowadays, MATLAB has become the within acceptable limits for data analysis, numerical analysis, and graphical visualization.
Advantages of Matlab:
Fastest computational and mathematical platform.
Primarily linear matrix algebra packages for every fields of mathematics and trading at the personal ad level.
Integration of all packages afterward a concise script.
Most vigorous and stunning visualisation of plots and interactive charts
As a announcement product, it is with ease tested and supported providing multi-threaded support and trash stock effectively.
Disadvantages of Matlab:
Matlab is an interpreted language and correspondingly it takes more get older to execute.
Impossible to Can slay for execution, you must translate it into another language.
The difficulty of integration is solved later extra languages.
It is quite hard to detect biases in trading systems. For this, extensive examination is required.
Iterative loops achievement worse in MATLAB.
Not capable of developing stand-alone applications.
Difference Between R and Python Language?
R vs Python is one of the most common but important questions asked by lots of data science students. We know that R and Python, both are log on source programming languages. Both of these languages are having a large community. Apart from that, these languages are developing continuously.
Thats the reason these languages accumulate extra libraries and tools to their catalog. The major object of using R is for statistical analysis, while Python provides a more general data science approach.
Both languages are state-of-the-art programming languages for data science. Python is one of the simplest programming languages in terms of its syntax.
Thats why any beginner in a programming language can learn Python without putting in the new effort. upon the extra hand, R is built by statisticians that are a tiny bit hard to master.
Check the below mentioned stats of user loyalty for Python and R.
Before moving to the difference, lets look at some stats that encourage you comprehend why both programming languages are well-liked or best to learn.
Now we have get into some basic differences in the midst of R vs Python. But this is not the end of the difference surrounded by these two languages. There is a lot more to learn nearly the comparison in the middle of R vs Python. Here we go:-
What is R?
R is one of the oldest programming languages developed by academics and statisticians. R comes into existence in the year 1995. Now R is providing the richest ecosystem for data analysis.
The R programming language is full of libraries. There are a couple of repositories also within reach considering R. In fact, CRAN has on the order of 12000 packages. The wide variety of libraries makes it the first another for statistical analysis and methodical work.
Consists of packages for just about any statistical application one can think of. CRAN currently hosts more than 10k packages.
Equipped in imitation of excellent visualization libraries considering ggplot2.
Capable of standalone analyses.
What is Python?
On the other hand, Python can complete the same tasks as the R programming language does. The major features of Python are data wrangling, engineering, web scraping, and correspondingly on. Python furthermore has the tools that incite in implementing machine learning upon a large scale.
Guido van Rossum developed Python in 1991. Python is the most popular programming language in the world. Python is one of the simplest languages to maintain, and it is more robust than R. Now a day Python has the pointed edge API. This API is quite obliging in robot learning and AI.
Most data scientists use abandoned five Python libraries, i.e., Numpy, Pandas, Scipy, Scikit-learn, and Seaborn.
Object-oriented language
General Purpose
Has a lot of extensions and amazing community support
Simple and easy to understand and learn
Packages later pandas, NumPy, and sci-kit-learn, create Python an excellent unconventional for robot learning activities.
R or Python Usage
Python has the most potent libraries for math, statistics, artificial intelligence, and robot learning. But still, Python is not useful for econometrics and communication and along with for thing analytics.
On the further hand, R is developed by academics and scientists. It is specially intended for machine learning and data science. R has the most potent communication libraries that are quite obliging in data science. In addition, R is equipped bearing in mind many packages that are used to put on an act data mining and grow old series analysis.
Lets acquire a brief detail about the history of both programming languages!
ABC -> Python was Invented (1989 Guido van Rossum) -> Python 2 (2000) came into existence -> Python 3 (2008) modifies.
Fortran -> S (at alarm bell Labs) -> R was Invented (1991 by Ross Ihaka and Robert Gentleman) -> R 1.0.0 (2000) came into existence -> R 3.0.2 (2013).
See also {} The Best lead on the Comparison along with SPSS vs SAS
Why should we not use both of these languages at the similar time?
Heaps of people think that they can use both programming languages at the similar time. But we should prevent using them at the similar time. The majority of people are using single-handedly one of these programming languages. But they always desire to have permission to the facility of the language adversary.
For example, if you use both languages at the same time, that may turn some of the problems. If you use R and you desire to be active some object-oriented function, later you cant use it on R.
On the other hand, Python is not all right for statistical distributions. as a result that they should not use both languages at the similar times because there is a mismatch of their functions.
But there are some ways that will back you to use both of these languages behind one another. We will talk not quite them in our bordering blog. Lets have a look at the comparison along with R vs Python.
|
__label__pos
| 0.709694 |
Mailing List Archive: 49091 messages
• Home
• Script library
• AltME Archive
• Mailing list
• Articles Index
• Site search
[REBOL] Re: Improved SOURCE function
From: larry:ecotope at: 5-May-2001 23:59
Hi Anton
> Good idea Larry,
:-)
> I saw somewhere how to refer to inbuilt word > if you are redefining a word. > If you can refer this way to source, then > you can truly patch the source word. > > Something like (pseudo-code): > > source: func [word][ > either it's-a-path? word [ > ; all your patching code > ][ > ; use the inbuilt 'source function > system/.../source word > ] > ]
Well, that is exactly what SRC does. The only difference is that I kept it with a separate name. I think it confusing to patch over with the same name, because it leads to people producing output which differs although apparently using the same function. SOURCE is just a small REBOL mezzanine function, it is not defined in any special context. Try source source So I could have, and you may, if you like, just rename SRC to SOURCE which will redefine the global word. No special considerations of object contexts involved. But everytime you post an example using it, you will have to explain that it is a special SOURCE function. There is a slightly updated version on my rebsite: http://www.nwlink.com/~ecotope1/reb/src.r
> I just can't remember how to refer to original word in systeme. > I am having a look around... anyone?
Not sure what you mean there. Maybe something like this: obj: context [print: func [x][system/words/print ["***" x]] Because you are redefining the word print in the context of the object, all references to the word print in the object refer to the new definition. So if you just do this o: context [print: func [x][print ["***" x]] the interpreter goes into a stack recursion loop and you get a Stack overflow error. This is avoided by using system/words/print to refer to the global version. Regards -Larry
|
__label__pos
| 0.689177 |
[bitc-dev] Is immutability part of type?
Jonathan S. Shapiro shap at eros-os.org
Wed Mar 30 12:34:04 PDT 2011
So since there is no big response to the type/type-qualifier question, let
me start with something that seems like it *ought* to be simpler: pure data
structures.
A pure list of integers seems deceptively straightforward:
pure boxed IntList is
i : int
next : IntList
The case is somewhat strange: the internal "next" pointers are immutable
because the structure is pure. The *leading* pointer to an IntList can be
overwritten. That is, the following remains legal:
let mutable il = IntList(...)
in
So far so good. So does it extend convincingly to unboxed structures? That
is, given:
unboxed struct S is
i: int;
f: float
pure boxed List('a) is
elem: 'a
next:: List('a)
Seems so. If the element type 'a is unboxed, it all works. The element is
immutable because the containing structure is pure. So far so good. So what
if the element type is boxed and impure?
Well, that outcome is quite odd. The type of IntList and List('a) is *
shallow* pure. The reason that the chained list is pure is that it consists
of a sequence of shallowly pure pairs. Each pair is pure because pure is a
property of the IntList and List('a) types. If the element type is boxed,
then the /next/ field becomes a reference, and the *target* of that
reference need not be pure.
That is: it appears that we can sensibly explain both the "shallow pure" and
"deep pure" cases for boxed types. Which one should be called "pure" could
go either way.
And of course, "pure" makes sense as a qualifier on a top-level or local
binding. Where it is troublesome is when it appears as a type modifier on a
field.
And finally, it is no problem to place an instance of List('a) in another
data structure (even a mutable data structure):
unboxed struct s2('a) is
l : List('a)
So why didn't I hit the same issue here that I did with "immutable", which
described a structurally similar case?
The answer is that I cheated: my proposed definition of "pure boxed type"
does *not* include the *leading* reference to the data structure. In
consequence, the expansion of the List('a) into s2 does not introduce
anything corresponding to a type qualifier, and things remain sensible.
Furthermore, it appears to me that if we adopt this "does not include
leading reference" rule, then pure actually *can* be a type qualifier. That
is: we could omit it on the definition of List('a), and instead write:
unboxed struct s3('a) is
l: pure List('a)
What I'm doing here is to appeal implicitly to the presence of a type
variable having mutability kind that propagates "pure" in the desired ways
within a boxed type. There seems to be no difficulty doing that.
Now with all this having been said, it now seems possible that the problem
in the unboxed case had something to do with the fact that the "immutable"
type qualifier was being applied to an unboxed type, and that this is what
introduced the question of how immutability should propagate up and down the
containment hierarchy of the unboxed structures. That is: the problematic
case is when we have something like:
unboxed struct s4('a) is // mutable by ommission
ius: immutable unboxed SomeStruct
Believe it or not, this actually seems like progress to me. More in just a
moment.
shap
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.coyotos.org/pipermail/bitc-dev/attachments/20110330/e05d153d/attachment.html
More information about the bitc-dev mailing list
|
__label__pos
| 0.854062 |
Create and Edit Pages
Create a page
You can create a page from anywhere in Confluence; just choose Create in the header and you're ready to go. Pages are the place to capture all your important (and unimportant) information; start with a blank page and use it like a word processor to add rich text, tasksimagesmacros and links, or use one of the useful blueprints to capture meeting notesdecisions, and more.
On this page:
Screenshot: The template and blueprint selector
Once you choose Create and decide on a blank page or blueprint, you'll be taken straight into the Confluence editor. The editor is where you'll name or rename your page, add the content, and format it to look great. When you've added some content, choose Preview to take a peek at what your finished page will look like, and choose Save when you've finished your edits.
After you save you'll see the page in 'view' mode. You can re-enter the editor any time by choosing Edit or pressing E on your keyboard.
(info) Another useful way to create a page is to use the Create from Template Macro. This macro allows you to choose a page template, and adds a button to the page allowing one-click page creation. If you want others to create pages using this template, this is a great option.
Collaborate or restrict
Once you've created a page, you can decide if you want to keep it private, using restrictions, or collaborate on it with others using @mentionssharing, and comments.
Organise and move
You can also organise pages in a hierarchy, with child and/or parent pages for closely related content. When you navigate to a Confluence page and choose the Create button in the header, the page you're creating will by default be a child of the page you're viewing. Have as many child pages and levels in the hierarchy as you need to, and move pages if you want to change their location.
If you want to view all pages in a Confluence space, choose Pages in the sidebar, or choose Browse > Pages at the top of the screen if you're using the Documentation theme. If the space is using the Default theme, you'll see recent updates to pages and a page tree displaying all pages in the space; if it's using the Documentation theme, you can choose either Recently Updated, Alphabetical, or Tree view of the pages in the space.
(info) Each time you create a page, you're creating it in a space. Spaces are containers used to contain pages with related content, so you can set them up for each team in your organisation, for projects, a combination of both, or for any reason you want to group pages together. See Spaces for more information.
Other page actions
(warning) We recommend you don't use special characters in page or attachment names, as the page or attachment may not be found by Confluence search, and may cause some Confluence functions to behave unexpectedly.
Note: If you rename a page, Confluence will automatically update all relative links to the page, except in some macrosLinks from external sites will be broken, unless they use the permanent URL. See Working with Links for more information.
Was this helpful?
Thanks for your feedback!
Why was this unhelpful?
Have a question about this article?
See questions about this article
Powered by Confluence and Scroll Viewport
|
__label__pos
| 0.696854 |
Why calling pipeline steps from plugin is a bad idea?
Hi, all!
I’m writing a plugin which is a pipeline step. I wanted to call other pipeline steps (like sh, archiveArtifacts, etc.) inside my step. Nobody tells me the answer, so I am asking more relevant question. Can anyone explain why it is a bad idea?
Because if I will not find technically correct answer, my customer will make me to do that anyway. If I find a solution I will definitely share it with community, which will lead unpredictable consequences and a lot of bad plugin code.
Please, explain me anybody, why it is a bad idea?
Is it a bad idea?
I can’t think of why you’d want to. My feeling is a step should do one thing. Shared pipelines are better for shared workflows
A lack of answer probably is more likely nobody around who knows rather than anything else
@halkeye you can find details of what is actual goal in this issue’s description inside spoiler Concept details:
|
__label__pos
| 0.999985 |
/***************************************************************************** The Dark Mod GPL Source Code This file is part of the The Dark Mod Source Code, originally based on the Doom 3 GPL Source Code as published in 2011. The Dark Mod Source Code is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. For details, see LICENSE.TXT. Project: The Dark Mod (http://www.thedarkmod.com/) ******************************************************************************/ #include "precompiled.h" #pragma hdrstop #include "Game_local.h" #include "Objectives/MissionData.h" #include "StimResponse/StimResponseCollection.h" #include "Grabber.h" /* =============================================================================== idMoveable =============================================================================== */ const idEventDef EV_BecomeNonSolid( "becomeNonSolid", EventArgs(), EV_RETURNS_VOID, "Makes the moveable non-solid for other entities." ); const idEventDef EV_SetOwnerFromSpawnArgs( "", EventArgs(), EV_RETURNS_VOID, "internal" ); const idEventDef EV_IsAtRest( "isAtRest", EventArgs(), 'd', "Returns true if object is not moving" ); const idEventDef EV_EnableDamage( "enableDamage", EventArgs('f', "enable", ""), EV_RETURNS_VOID, "enable/disable damage" ); CLASS_DECLARATION( idEntity, idMoveable ) EVENT( EV_Activate, idMoveable::Event_Activate ) EVENT( EV_BecomeNonSolid, idMoveable::Event_BecomeNonSolid ) EVENT( EV_SetOwnerFromSpawnArgs, idMoveable::Event_SetOwnerFromSpawnArgs ) EVENT( EV_IsAtRest, idMoveable::Event_IsAtRest ) EVENT( EV_EnableDamage, idMoveable::Event_EnableDamage ) END_CLASS static const float BOUNCE_SOUND_MIN_VELOCITY = 80.0f; static const float BOUNCE_SOUND_MAX_VELOCITY = 200.0f; static const float SLIDING_VELOCITY_THRESHOLD = 5.0f; const float MIN_DAMAGE_VELOCITY = 200; // grayman #2816 - was 100 const float MAX_DAMAGE_VELOCITY = 600; // grayman #2816 - was 200 /* ================ idMoveable::idMoveable ================ */ idMoveable::idMoveable( void ) { minDamageVelocity = MIN_DAMAGE_VELOCITY; // grayman #2816 maxDamageVelocity = MAX_DAMAGE_VELOCITY; // grayman #2816 nextCollideFxTime = 0; nextDamageTime = 0; nextSoundTime = 0; m_nextCollideScriptTime = 0; // 0 => never, -1 => always, positive number X => X times m_collideScriptCounter = 0; m_minScriptVelocity = 0.0f; initialSpline = NULL; initialSplineDir = vec3_zero; explode = false; unbindOnDeath = false; allowStep = false; canDamage = false; // greebo: A fraction of -1 is considered to be an invalid trace here memset(&lastCollision, 0, sizeof(lastCollision)); lastCollision.fraction = -1; isPushed = false; wasPushedLastFrame = false; pushDirection = vec3_zero; lastPushOrigin = vec3_zero; // by default no LOD m_LODHandle = 0; m_DistCheckTimeStamp = 0; } /* ================ idMoveable::~idMoveable ================ */ idMoveable::~idMoveable( void ) { delete initialSpline; initialSpline = NULL; } /* ================ idMoveable::Spawn ================ */ void idMoveable::Spawn( void ) { idTraceModel trm; float density, friction, bouncyness, mass, air_friction_linear, air_friction_angular; int clipShrink; idStr clipModelName; idVec3 maxForce, maxTorque; // check if a clip model is set spawnArgs.GetString( "clipmodel", "", clipModelName ); if ( !clipModelName[0] ) { clipModelName = spawnArgs.GetString( "model" ); // use the visual model } // tels: support "model" "" with "noclipmodel" "0" - do not attempt to load // the clipmodel from the non-existing model name in this case: if (clipModelName.Length()) { if ( !collisionModelManager->TrmFromModel( clipModelName, trm ) ) { gameLocal.Error( "idMoveable '%s': cannot load collision model %s", name.c_str(), clipModelName.c_str() ); return; } // angua: check if the cm is valid if (idMath::Fabs(trm.bounds[0].x) == idMath::INFINITY) { gameLocal.Error( "idMoveable '%s': invalid collision model %s", name.c_str(), clipModelName.c_str() ); } // if the model should be shrunk clipShrink = spawnArgs.GetInt( "clipshrink" ); if ( clipShrink != 0 ) { trm.Shrink( clipShrink * CM_CLIP_EPSILON ); } } // get rigid body properties spawnArgs.GetFloat( "density", "0.5", density ); density = idMath::ClampFloat( 0.001f, 1000.0f, density ); spawnArgs.GetFloat( "bouncyness", "0.6", bouncyness ); bouncyness = idMath::ClampFloat( 0.0f, 1.0f, bouncyness ); explode = spawnArgs.GetBool( "explode" ); unbindOnDeath = spawnArgs.GetBool( "unbindondeath" ); spawnArgs.GetFloat( "friction", "0.05", friction ); // reverse compatibility, new contact_friction key replaces friction only if present if( spawnArgs.FindKey("contact_friction") ) { spawnArgs.GetFloat( "contact_friction", "0.05", friction ); } spawnArgs.GetFloat( "linear_friction", "0.6", air_friction_linear ); spawnArgs.GetFloat( "angular_friction", "0.6", air_friction_angular ); fxCollide = spawnArgs.GetString( "fx_collide" ); nextCollideFxTime = 0; // tels: m_scriptCollide = spawnArgs.GetString( "script_collide" ); m_nextCollideScriptTime = 0; m_collideScriptCounter = spawnArgs.GetInt( "collide_script_counter", "1" ); // override the default of 1 with 0 if no script is defined if (m_scriptCollide == "") { m_collideScriptCounter = 0; } m_minScriptVelocity = spawnArgs.GetFloat( "min_script_velocity", "5.0" ); damage = spawnArgs.GetString( "def_damage", "" ); canDamage = spawnArgs.GetBool( "damageWhenActive" ) ? false : true; minDamageVelocity = spawnArgs.GetFloat( "minDamageVelocity", "-1" ); if ( minDamageVelocity == -1 ) // grayman #2816 { minDamageVelocity = MIN_DAMAGE_VELOCITY; } maxDamageVelocity = spawnArgs.GetFloat( "maxDamageVelocity", "-1" ); if ( maxDamageVelocity == -1 ) // grayman #2816 { maxDamageVelocity = MAX_DAMAGE_VELOCITY; } nextDamageTime = 0; nextSoundTime = 0; health = spawnArgs.GetInt( "health", "0" ); // tels: load a visual model, as well as an optional brokenModel LoadModels(); // setup the physics physicsObj.SetSelf( this ); physicsObj.SetClipModel( new idClipModel( trm ), density ); physicsObj.GetClipModel()->SetMaterial( GetRenderModelMaterial() ); physicsObj.SetOrigin( GetPhysics()->GetOrigin() ); physicsObj.SetAxis( GetPhysics()->GetAxis() ); physicsObj.SetBouncyness( bouncyness ); physicsObj.SetFriction( air_friction_linear, air_friction_angular, friction ); physicsObj.SetGravity( gameLocal.GetGravity() ); int contents = CONTENTS_SOLID | CONTENTS_OPAQUE; // ishtvan: overwrite with custom contents, if present if( m_CustomContents != -1 ) contents = m_CustomContents; // greebo: Set the frobable contents flag if the spawnarg says so if (spawnArgs.GetBool("frobable", "0")) { contents |= CONTENTS_FROBABLE; } physicsObj.SetContents( contents ); physicsObj.SetClipMask( MASK_SOLID | CONTENTS_BODY | CONTENTS_CORPSE | CONTENTS_MOVEABLECLIP ); SetPhysics( &physicsObj ); if ( spawnArgs.GetFloat( "mass", "10", mass ) ) { physicsObj.SetMass( mass ); } // tels if ( spawnArgs.GetVector( "max_force", "", maxForce ) ) { physicsObj.SetMaxForce( maxForce ); } if ( spawnArgs.GetVector( "max_torque", "", maxTorque ) ) { physicsObj.SetMaxTorque( maxTorque ); } if ( spawnArgs.GetBool( "nodrop" ) ) { physicsObj.PutToRest(); } else { physicsObj.DropToFloor(); } if ( spawnArgs.GetBool( "noimpact" ) || spawnArgs.GetBool( "notpushable" ) ) { physicsObj.DisableImpact(); } if (!spawnArgs.GetBool( "solid" ) ) { BecomeNonSolid(); } // SR CONTENTS_RESPONSE FIX if( m_StimResponseColl->HasResponse() ) { physicsObj.SetContents( physicsObj.GetContents() | CONTENTS_RESPONSE ); } m_preHideContents = physicsObj.GetContents(); m_preHideClipMask = physicsObj.GetClipMask(); allowStep = spawnArgs.GetBool( "allowStep", "1" ); // parse LOD spawnargs if (ParseLODSpawnargs( &spawnArgs, gameLocal.random.RandomFloat() ) ) { // Have to start thinking if we're distance dependent BecomeActive( TH_THINK ); } // grayman #2820 - don't queue EV_SetOwnerFromSpawnArgs if it's going to // end up doing nothing. Queuing this for every moveable causes a lot // of event posting during frame 0. If extra work is added to // EV_SetOwnerFromSpawnArgs, then that must be accounted for here, to // make sure it has a chance of getting done. idStr owner; if ( spawnArgs.GetString( "owner", "", owner ) ) { PostEventMS( &EV_SetOwnerFromSpawnArgs, 0 ); } } /* ================ idMoveable::Save ================ */ void idMoveable::Save( idSaveGame *savefile ) const { savefile->WriteString( brokenModel ); savefile->WriteString( damage ); savefile->WriteString( m_scriptCollide ); savefile->WriteInt( m_collideScriptCounter ); savefile->WriteInt( m_nextCollideScriptTime ); savefile->WriteFloat( m_minScriptVelocity ); savefile->WriteString( fxCollide ); savefile->WriteInt( nextCollideFxTime ); savefile->WriteFloat( minDamageVelocity ); savefile->WriteFloat( maxDamageVelocity ); savefile->WriteBool( explode ); savefile->WriteBool( unbindOnDeath ); savefile->WriteBool( allowStep ); savefile->WriteBool( canDamage ); savefile->WriteInt( nextDamageTime ); savefile->WriteInt( nextSoundTime ); savefile->WriteInt( initialSpline != NULL ? (int)initialSpline->GetTime( 0 ) : -1 ); savefile->WriteVec3( initialSplineDir ); savefile->WriteStaticObject( physicsObj ); savefile->WriteTrace(lastCollision); savefile->WriteBool(isPushed); savefile->WriteBool(wasPushedLastFrame); savefile->WriteVec3(pushDirection); savefile->WriteVec3(lastPushOrigin); } /* ================ idMoveable::Restore ================ */ void idMoveable::Restore( idRestoreGame *savefile ) { int initialSplineTime; savefile->ReadString( brokenModel ); savefile->ReadString( damage ); savefile->ReadString( m_scriptCollide ); savefile->ReadInt( m_collideScriptCounter ); savefile->ReadInt( m_nextCollideScriptTime ); savefile->ReadFloat( m_minScriptVelocity ); savefile->ReadString( fxCollide ); savefile->ReadInt( nextCollideFxTime ); savefile->ReadFloat( minDamageVelocity ); savefile->ReadFloat( maxDamageVelocity ); savefile->ReadBool( explode ); savefile->ReadBool( unbindOnDeath ); savefile->ReadBool( allowStep ); savefile->ReadBool( canDamage ); savefile->ReadInt( nextDamageTime ); savefile->ReadInt( nextSoundTime ); savefile->ReadInt( initialSplineTime ); savefile->ReadVec3( initialSplineDir ); if ( initialSplineTime != -1 ) { InitInitialSpline( initialSplineTime ); } else { initialSpline = NULL; } savefile->ReadStaticObject( physicsObj ); RestorePhysics( &physicsObj ); savefile->ReadTrace(lastCollision); savefile->ReadBool(isPushed); savefile->ReadBool(wasPushedLastFrame); savefile->ReadVec3(pushDirection); savefile->ReadVec3(lastPushOrigin); } /* ================ idMoveable::Hide ================ */ void idMoveable::Hide( void ) { idEntity::Hide(); physicsObj.SetContents( 0 ); } /* ================ idMoveable::Show ================ */ void idMoveable::Show( void ) { idEntity::Show(); physicsObj.SetContents( m_preHideContents ); } /* ================= idMoveable::Collide ================= */ bool idMoveable::Collide( const trace_t &collision, const idVec3 &velocity ) { // greebo: Check whether we are colliding with the nearly exact same point again bool sameCollisionAgain = (lastCollision.fraction != -1 && lastCollision.c.point.Compare(collision.c.point, 0.05f)); // greebo: Save the collision info for the next call lastCollision = collision; // stgatilov #5599: mute all sounds from collisions with dragged object in "silent" mode if (gameLocal.m_Grabber->GetSelected() == this && gameLocal.m_Grabber->IsInSilentMode()) return false; float v = -( velocity * collision.c.normal ); if ( !sameCollisionAgain ) { float bounceSoundMinVelocity = cv_bounce_sound_min_vel.GetFloat(); float bounceSoundMaxVelocity = cv_bounce_sound_max_vel.GetFloat(); if ( ( v > bounceSoundMinVelocity ) && ( gameLocal.time > nextSoundTime ) ) { // grayman #3331 - some moveables should not bother with bouncing sounds if ( !spawnArgs.GetBool("no_bounce_sound", "0") ) { const idMaterial *material = collision.c.material; idStr sndNameLocal; idStr surfaceName; // "tile", "glass", etc. if (material != NULL) { surfaceName = g_Global.GetSurfName(material); // Prepend the snd_bounce_ prefix to check for a surface-specific sound idStr sndNameWithSurface = "snd_bounce_" + surfaceName; if (spawnArgs.FindKey(sndNameWithSurface) != NULL) { sndNameLocal = sndNameWithSurface; } else { sndNameLocal = "snd_bounce"; } } const char* sound = spawnArgs.GetString(sndNameLocal); const idSoundShader* sndShader = declManager->FindSound(sound); //f = v > BOUNCE_SOUND_MAX_VELOCITY ? 1.0f : idMath::Sqrt( v - BOUNCE_SOUND_MIN_VELOCITY ) * ( 1.0f / idMath::Sqrt( BOUNCE_SOUND_MAX_VELOCITY - BOUNCE_SOUND_MIN_VELOCITY ) ); // angua: modify the volume set in the def instead of setting a fixed value. // At minimum velocity, the volume should be "min_velocity_volume_decrease" lower (in db) than the one specified in the def float f = ( v > bounceSoundMaxVelocity ) ? 0.0f : spawnArgs.GetFloat("min_velocity_volume_decrease", "0") * ( idMath::Sqrt(v - bounceSoundMinVelocity) * (1.0f / idMath::Sqrt( bounceSoundMaxVelocity - bounceSoundMinVelocity)) - 1 ); float volume = sndShader->GetParms()->volume + f; if (cv_moveable_collision.GetBool()) { gameRenderWorld->DebugText( va("Velocity: %f", v), (physicsObj.GetOrigin() + idVec3(0, 0, 20)), 0.25f, colorGreen, gameLocal.GetLocalPlayer()->viewAngles.ToMat3(), 1, 100 * USERCMD_MSEC ); gameRenderWorld->DebugText( va("Volume: %f", volume), (physicsObj.GetOrigin() + idVec3(0, 0, 10)), 0.25f, colorGreen, gameLocal.GetLocalPlayer()->viewAngles.ToMat3(), 1, 100 * USERCMD_MSEC ); gameRenderWorld->DebugArrow( colorMagenta, collision.c.point, (collision.c.point + 30 * collision.c.normal), 4.0f, 1); } SetSoundVolume(volume); // greebo: We don't use StartSound() here, we want to do the sound propagation call manually StartSoundShader(sndShader, SND_CHANNEL_ANY, 0, false, NULL); // grayman #2603 - don't propagate a sound if this is a doused torch dropped by an AI if (!spawnArgs.GetBool("is_torch","0")) { idStr sndPropName = GetSoundPropNameForMaterial(surfaceName); // Propagate a suspicious sound, using the "group" convention (soft, hard, small, med, etc.) PropSoundS( NULL, sndPropName, f, 0 ); // grayman #3355 } SetSoundVolume(0.0f); nextSoundTime = gameLocal.time + 500; } } // tels: //DM_LOG(LC_ENTITY, LT_INFO)LOGSTRING("Moveable %s might call script_collide %s because m_collideScriptCounter = %i and v = %f and time (%d) > m_nextCollideScriptTime (%d)\r", // name.c_str(), m_scriptCollide.c_str(), m_collideScriptCounter, v, gameLocal.time, m_nextCollideScriptTime ); if ( ( m_collideScriptCounter != 0 ) && ( v > m_minScriptVelocity ) && ( gameLocal.time > m_nextCollideScriptTime ) ) { if ( m_collideScriptCounter > 0) { // if positive, decrement it, so -1 stays as it is (for 0, we never come here) m_collideScriptCounter --; } // call the script const function_t* pScriptFun = scriptObject.GetFunction( m_scriptCollide.c_str() ); if (pScriptFun == NULL) { // Local function not found, check in global namespace pScriptFun = gameLocal.program.FindFunction( m_scriptCollide.c_str() ); } if (pScriptFun != NULL) { DM_LOG(LC_ENTITY, LT_INFO)LOGSTRING("Moveable %s calling script_collide %s.\r", name.c_str(), m_scriptCollide.c_str()); idThread *pThread = new idThread( pScriptFun ); pThread->CallFunctionArgs( pScriptFun, true, "e", this ); pThread->DelayedStart( 0 ); } else { // script function not found! DM_LOG(LC_ENTITY, LT_ERROR)LOGSTRING("Moveable %s could not find script_collide %s.\r", name.c_str(), m_scriptCollide.c_str()); m_collideScriptCounter = 0; } m_nextCollideScriptTime = gameLocal.time + 300; } } idEntity* ent = gameLocal.entities[ collision.c.entityNum ]; trace_t newCollision = collision; // grayman #2816 - in case we need to modify collision // grayman #2816 - if we hit the world, skip all the damage work if ( ent && ( ent != gameLocal.world ) ) { idActor* entActor = NULL; if ( ent->IsType(idActor::Type) ) { entActor = static_cast(ent); // the object hit an actor directly } else if ( ent->IsType(idAFAttachment::Type ) ) { newCollision.c.id = JOINT_HANDLE_TO_CLIPMODEL_ID( static_cast(ent)->GetAttachJoint() ); } // go up the bindMaster chain to see if an Actor is lurking if ( entActor == NULL ) // no actor yet, so ent is an attachment or an attached moveable { idEntity* bindMaster = ent->GetBindMaster(); while ( bindMaster != NULL ) { if ( bindMaster->IsType(idActor::Type) ) { entActor = static_cast(bindMaster); // the object hit something attached to an actor // If ent is an idAFAttachment, we can leave ent alone // and pass the damage to it. It will, in turn, pass the // damage to the actor it's attached to. (helmets) // If ent is NOT an attachment, we have to change it to // be the actor we just found. Inventor goggles are an // example of when we have to do this, because they're // an idMoveable, and they DON'T transfer their damage // to the actor they're attached to. if ( !ent->IsType(idAFAttachment::Type ) ) { ent = bindMaster; } break; } bindMaster = bindMaster->GetBindMaster(); // go up the chain } } // grayman #2816 - in order to allow knockouts from dropped objects, // we have to allow collisions where the velocity is < minDamageVelocity, // because dropped objects can have low velocity, while at the same time // carrying enough damage to warrant a KO possibility. if ( canDamage && damage.Length() && ( gameLocal.time > nextDamageTime ) ) { if ( !entActor || !entActor->AI_DEAD ) { float f; if ( v < minDamageVelocity ) { f = 0.0f; } else if ( v < maxDamageVelocity ) { f = idMath::Sqrt(( v - minDamageVelocity ) / ( maxDamageVelocity - minDamageVelocity )); } else { f = 1.0f; // capped when v >= maxDamageVelocity } // scale the damage by the surface type multiplier, if any idStr SurfTypeName; g_Global.GetSurfName( newCollision.c.material, SurfTypeName ); SurfTypeName = "damage_mult_" + SurfTypeName; f *= spawnArgs.GetFloat( SurfTypeName.c_str(), "1.0" ); idVec3 dir = velocity; dir.NormalizeFast(); // Use a technique similar to what's used for a melee collision // to find a better joint (location), because when the head is // hit, the joint isn't identified correctly w/o it. int location = JOINT_HANDLE_TO_CLIPMODEL_ID( newCollision.c.id ); // If this moveable is attached to an AI, identify that AI. // Otherwise, assume it was put in motion by someone. idEntity* attacker = GetPhysics()->GetClipModel()->GetOwner(); if ( attacker == NULL ) { attacker = m_SetInMotionByActor.GetEntity(); } // grayman #3370 - if the entity being hit is the attacker, don't do damage if ( attacker != ent ) { int preHealth = ent->health; ent->Damage( this, attacker, dir, damage, f, location, const_cast(&newCollision) ); if ( ent->health < preHealth ) // only set the timer if there was damage { nextDamageTime = gameLocal.time + 1000; } } } } // Darkmod: Collision stims and a tactile alert if it collides with an AI ProcCollisionStims( ent, newCollision.c.id ); // grayman #2816 - use new collision if ( entActor && entActor->IsType( idAI::Type ) ) { static_cast(entActor)->TactileAlert( this ); } } if ( fxCollide.Length() && ( gameLocal.time > nextCollideFxTime ) ) { idEntityFx::StartFx( fxCollide, &collision.c.point, NULL, this, false ); nextCollideFxTime = gameLocal.time + 3500; } return false; } /* ============ idMoveable::Killed ============ */ void idMoveable::Killed( idEntity *inflictor, idEntity *attacker, int damage, const idVec3 &dir, int location ) { bool bPlayerResponsible(false); if ( unbindOnDeath ) { Unbind(); } // tels: call base class method to switch to broken model idEntity::BecomeBroken( inflictor ); if ( explode ) { if ( brokenModel.IsEmpty() ) { PostEventMS( &EV_Remove, 1000 ); } } if ( renderEntity.gui[ 0 ] ) { renderEntity.gui[ 0 ] = NULL; } ActivateTargets( this ); fl.takedamage = false; if ( attacker && attacker->IsType( idPlayer::Type ) ) { bPlayerResponsible = ( attacker == gameLocal.GetLocalPlayer() ); } else if ( attacker && attacker->m_SetInMotionByActor.GetEntity() ) { bPlayerResponsible = ( attacker->m_SetInMotionByActor.GetEntity() == gameLocal.GetLocalPlayer() ); } gameLocal.m_MissionData->MissionEvent( COMP_DESTROY, this, bPlayerResponsible ); } /* ================ idMoveable::AllowStep ================ */ bool idMoveable::AllowStep( void ) const { return allowStep; } /* ================ idMoveable::BecomeNonSolid ================ */ void idMoveable::BecomeNonSolid( void ) { // set CONTENTS_RENDERMODEL so bullets still collide with the moveable physicsObj.SetContents( CONTENTS_CORPSE | CONTENTS_RENDERMODEL ); physicsObj.SetClipMask( MASK_SOLID | CONTENTS_CORPSE | CONTENTS_MOVEABLECLIP ); // SR CONTENTS_RESPONSE FIX: if( m_StimResponseColl->HasResponse() ) physicsObj.SetContents( physicsObj.GetContents() | CONTENTS_RESPONSE ); } /* ================ idMoveable::EnableDamage ================ */ void idMoveable::EnableDamage( bool enable, float duration ) { canDamage = enable; if ( duration ) { PostEventSec( &EV_EnableDamage, duration, ( !enable ) ? 0.0f : 1.0f ); } } /* ================ idMoveable::InitInitialSpline ================ */ void idMoveable::InitInitialSpline( int startTime ) { int initialSplineTime; initialSpline = GetSpline(); initialSplineTime = spawnArgs.GetInt( "initialSplineTime", "300" ); if ( initialSpline != NULL ) { initialSpline->MakeUniform( initialSplineTime ); initialSpline->ShiftTime( startTime - initialSpline->GetTime( 0 ) ); initialSplineDir = initialSpline->GetCurrentFirstDerivative( startTime ); initialSplineDir *= physicsObj.GetAxis().Transpose(); initialSplineDir.Normalize(); BecomeActive( TH_THINK ); } } /* ================ idMoveable::FollowInitialSplinePath ================ */ bool idMoveable::FollowInitialSplinePath( void ) { if ( initialSpline != NULL ) { if ( gameLocal.time < initialSpline->GetTime( initialSpline->GetNumValues() - 1 ) ) { idVec3 splinePos = initialSpline->GetCurrentValue( gameLocal.time ); idVec3 linearVelocity = ( splinePos - physicsObj.GetOrigin() ) * USERCMD_HZ; physicsObj.SetLinearVelocity( linearVelocity ); idVec3 splineDir = initialSpline->GetCurrentFirstDerivative( gameLocal.time ); idVec3 dir = initialSplineDir * physicsObj.GetAxis(); idVec3 angularVelocity = dir.Cross( splineDir ); angularVelocity.Normalize(); angularVelocity *= idMath::ACos16( dir * splineDir / splineDir.Length() ) * USERCMD_HZ; physicsObj.SetAngularVelocity( angularVelocity ); return true; } else { delete initialSpline; initialSpline = NULL; } } return false; } /* ================ idMoveable::Think ================ */ void idMoveable::Think( void ) { if ( thinkFlags & TH_THINK ) { if ( !FollowInitialSplinePath() && !isPushed && !m_LODHandle) { BecomeInactive( TH_THINK ); } } // will also handle LOD thinking idEntity::Think(); UpdateSlidingSounds(); } /* ================ idMoveable::GetRenderModelMaterial ================ */ const idMaterial *idMoveable::GetRenderModelMaterial( void ) const { if ( renderEntity.customShader ) { return renderEntity.customShader; } if ( renderEntity.hModel && renderEntity.hModel->NumSurfaces() ) { return renderEntity.hModel->Surface( 0 )->material; } return NULL; } /* ================ idMoveable::WriteToSnapshot ================ */ void idMoveable::WriteToSnapshot( idBitMsgDelta &msg ) const { physicsObj.WriteToSnapshot( msg ); } /* ================ idMoveable::ReadFromSnapshot ================ */ void idMoveable::ReadFromSnapshot( const idBitMsgDelta &msg ) { physicsObj.ReadFromSnapshot( msg ); if ( msg.HasChanged() ) { UpdateVisuals(); } } void idMoveable::SetIsPushed(bool isNowPushed, const idVec3& pushDirection) { isPushed = isNowPushed; this->pushDirection = pushDirection; lastPushOrigin = GetPhysics()->GetOrigin(); // Update our think flags to allow UpdateMoveables to be called. if (isPushed) { BecomeActive(TH_THINK); } } bool idMoveable::IsPushed() { return isPushed; } void idMoveable::UpdateSlidingSounds() { if (isPushed) { const idVec3& curVelocity = GetPhysics()->GetLinearVelocity(); const idVec3& gravityNorm = GetPhysics()->GetGravityNormal(); idVec3 xyVelocity = curVelocity - (curVelocity * gravityNorm) * gravityNorm; // Only consider the xyspeed if the velocity is in pointing in the same direction as we're being pushed float xySpeed = (idMath::Fabs(xyVelocity * pushDirection) > 0.2f) ? xyVelocity.NormalizeFast() : 0; //gameRenderWorld->DebugText( idStr(xySpeed), GetPhysics()->GetAbsBounds().GetCenter(), 0.1f, colorWhite, gameLocal.GetLocalPlayer()->viewAngles.ToMat3(), 1, USERCMD_MSEC ); //gameRenderWorld->DebugArrow(colorWhite, GetPhysics()->GetAbsBounds().GetCenter(), GetPhysics()->GetAbsBounds().GetCenter() + xyVelocity, 1, USERCMD_MSEC ); if (wasPushedLastFrame && xySpeed <= SLIDING_VELOCITY_THRESHOLD) { // We are still being pushed, but we are not fast enough StopSound(SND_CHANNEL_BODY3, false); BecomeInactive(TH_THINK); isPushed = false; wasPushedLastFrame = false; } else if (!wasPushedLastFrame && xySpeed > SLIDING_VELOCITY_THRESHOLD) { if (lastPushOrigin.Compare(GetPhysics()->GetOrigin(), 0.05f)) { // We did not really move, despite what the velocity says StopSound(SND_CHANNEL_BODY3, false); BecomeInactive(TH_THINK); isPushed = false; } else { // We just got into pushed state and are fast enough StartSound("snd_sliding", SND_CHANNEL_BODY3, 0, false, NULL); // Update the state flag for the next round wasPushedLastFrame = true; } } lastPushOrigin = GetPhysics()->GetOrigin(); } else if (wasPushedLastFrame) { // We are not pushed anymore StopSound(SND_CHANNEL_BODY3, false); BecomeInactive(TH_THINK); // Update the state flag for the next round wasPushedLastFrame = false; } } /* ================ idMoveable::Event_BecomeNonSolid ================ */ void idMoveable::Event_BecomeNonSolid( void ) { BecomeNonSolid(); } /* ================ idMoveable::Event_Activate ================ */ void idMoveable::Event_Activate( idEntity *activator ) { float delay; idVec3 init_velocity, init_avelocity; Show(); if ( !spawnArgs.GetInt( "notpushable" ) ) { physicsObj.EnableImpact(); } physicsObj.Activate(); spawnArgs.GetVector( "init_velocity", "0 0 0", init_velocity ); spawnArgs.GetVector( "init_avelocity", "0 0 0", init_avelocity ); delay = spawnArgs.GetFloat( "init_velocityDelay", "0" ); if ( delay == 0.0f ) { physicsObj.SetLinearVelocity( init_velocity ); } else { PostEventSec( &EV_SetLinearVelocity, delay, init_velocity ); } delay = spawnArgs.GetFloat( "init_avelocityDelay", "0" ); if ( delay == 0.0f ) { physicsObj.SetAngularVelocity( init_avelocity ); } else { PostEventSec( &EV_SetAngularVelocity, delay, init_avelocity ); } InitInitialSpline( gameLocal.time ); } /* ================ idMoveable::Event_SetOwnerFromSpawnArgs ================ */ void idMoveable::Event_SetOwnerFromSpawnArgs( void ) { // grayman #2820 - At the time of this writing, this routine ONLY checks // whether this moveable has its 'owner' spawnarg set. If anything else is // added here, the pre-check in moveable.cpp that wraps around "PostEventMS( &EV_SetOwnerFromSpawnArgs, 0 )" // must account for that. That pre-check is needed to prevent unnecessary // event posting that leads to doing nothing here. (I.e. the moveable has no owner.) idStr owner; if ( spawnArgs.GetString( "owner", "", owner ) ) { ProcessEvent( &EV_SetOwner, gameLocal.FindEntity( owner ) ); } } /* ================ idMoveable::Event_IsAtRest ================ */ void idMoveable::Event_IsAtRest( void ) { idThread::ReturnInt( physicsObj.IsAtRest() ); } /* ================ idMoveable::Event_EnableDamage ================ */ void idMoveable::Event_EnableDamage( float enable ) { canDamage = ( enable != 0.0f ); } /* =============================================================================== idBarrel =============================================================================== */ CLASS_DECLARATION( idMoveable, idBarrel ) END_CLASS /* ================ idBarrel::idBarrel ================ */ idBarrel::idBarrel() { radius = 1.0f; barrelAxis = 0; lastOrigin.Zero(); lastAxis.Identity(); additionalRotation = 0.0f; additionalAxis.Identity(); } /* ================ idBarrel::Save ================ */ void idBarrel::Save( idSaveGame *savefile ) const { savefile->WriteFloat( radius ); savefile->WriteInt( barrelAxis ); savefile->WriteVec3( lastOrigin ); savefile->WriteMat3( lastAxis ); savefile->WriteFloat( additionalRotation ); savefile->WriteMat3( additionalAxis ); } /* ================ idBarrel::Restore ================ */ void idBarrel::Restore( idRestoreGame *savefile ) { savefile->ReadFloat( radius ); savefile->ReadInt( barrelAxis ); savefile->ReadVec3( lastOrigin ); savefile->ReadMat3( lastAxis ); savefile->ReadFloat( additionalRotation ); savefile->ReadMat3( additionalAxis ); } /* ================ idBarrel::BarrelThink ================ */ void idBarrel::BarrelThink( void ) { bool wasAtRest, onGround; float movedDistance, rotatedDistance, angle; idVec3 curOrigin, gravityNormal, dir; idMat3 curAxis, axis; wasAtRest = IsAtRest(); // run physics RunPhysics(); // only need to give the visual model an additional rotation if the physics were run if ( !wasAtRest ) { // current physics state onGround = GetPhysics()->HasGroundContacts(); curOrigin = GetPhysics()->GetOrigin(); curAxis = GetPhysics()->GetAxis(); // if the barrel is on the ground if ( onGround ) { gravityNormal = GetPhysics()->GetGravityNormal(); dir = curOrigin - lastOrigin; dir -= gravityNormal * dir * gravityNormal; movedDistance = dir.LengthSqr(); // if the barrel moved and the barrel is not aligned with the gravity direction if ( movedDistance > 0.0f && idMath::Fabs( gravityNormal * curAxis[barrelAxis] ) < 0.7f ) { // barrel movement since last think frame orthogonal to the barrel axis movedDistance = idMath::Sqrt( movedDistance ); dir *= 1.0f / movedDistance; movedDistance = ( 1.0f - idMath::Fabs( dir * curAxis[barrelAxis] ) ) * movedDistance; // get rotation about barrel axis since last think frame angle = lastAxis[(barrelAxis+1)%3] * curAxis[(barrelAxis+1)%3]; angle = idMath::ACos( angle ); // distance along cylinder hull rotatedDistance = angle * radius; // if the barrel moved further than it rotated about it's axis if ( movedDistance > rotatedDistance ) { // additional rotation of the visual model to make it look // like the barrel rolls instead of slides angle = 180.0f * (movedDistance - rotatedDistance) / (radius * idMath::PI); if ( gravityNormal.Cross( curAxis[barrelAxis] ) * dir < 0.0f ) { additionalRotation += angle; } else { additionalRotation -= angle; } dir = vec3_origin; dir[barrelAxis] = 1.0f; additionalAxis = idRotation( vec3_origin, dir, additionalRotation ).ToMat3(); } } } // save state for next think lastOrigin = curOrigin; lastAxis = curAxis; } Present(); } /* ================ idBarrel::Think ================ */ void idBarrel::Think( void ) { if ( thinkFlags & TH_THINK ) { if ( !FollowInitialSplinePath() ) { BecomeInactive( TH_THINK ); } } BarrelThink(); } /* ================ idBarrel::GetPhysicsToVisualTransform ================ */ bool idBarrel::GetPhysicsToVisualTransform( idVec3 &origin, idMat3 &axis ) { origin = vec3_origin; axis = additionalAxis; return true; } /* ================ idBarrel::Spawn ================ */ void idBarrel::Spawn( void ) { const idBounds &bounds = GetPhysics()->GetBounds(); // radius of the barrel cylinder radius = ( bounds[1][0] - bounds[0][0] ) * 0.5f; // always a vertical barrel with cylinder axis parallel to the z-axis barrelAxis = 2; lastOrigin = GetPhysics()->GetOrigin(); lastAxis = GetPhysics()->GetAxis(); additionalRotation = 0.0f; additionalAxis.Identity(); } /* ================ idBarrel::ClientPredictionThink ================ */ void idBarrel::ClientPredictionThink( void ) { Think(); } /* =============================================================================== idExplodingBarrel =============================================================================== */ const idEventDef EV_Respawn( "" , EventArgs(), EV_RETURNS_VOID, "internal" ); const idEventDef EV_TriggerTargets( "", EventArgs(), EV_RETURNS_VOID, "internal" ); CLASS_DECLARATION( idBarrel, idExplodingBarrel ) EVENT( EV_Activate, idExplodingBarrel::Event_Activate ) EVENT( EV_Respawn, idExplodingBarrel::Event_Respawn ) EVENT( EV_Explode, idExplodingBarrel::Event_Explode ) EVENT( EV_TriggerTargets, idExplodingBarrel::Event_TriggerTargets ) END_CLASS /* ================ idExplodingBarrel::idExplodingBarrel ================ */ idExplodingBarrel::idExplodingBarrel() { spawnOrigin.Zero(); spawnAxis.Zero(); state = NORMAL; particleModelDefHandle = -1; lightDefHandle = -1; memset( &particleRenderEntity, 0, sizeof( particleRenderEntity ) ); memset( &light, 0, sizeof( light ) ); particleTime = 0; lightTime = 0; time = 0.0f; } /* ================ idExplodingBarrel::~idExplodingBarrel ================ */ idExplodingBarrel::~idExplodingBarrel() { if ( particleModelDefHandle >= 0 ){ gameRenderWorld->FreeEntityDef( particleModelDefHandle ); } if ( lightDefHandle >= 0 ) { gameRenderWorld->FreeLightDef( lightDefHandle ); } } /* ================ idExplodingBarrel::Save ================ */ void idExplodingBarrel::Save( idSaveGame *savefile ) const { savefile->WriteVec3( spawnOrigin ); savefile->WriteMat3( spawnAxis ); savefile->WriteInt( state ); savefile->WriteInt( particleModelDefHandle ); savefile->WriteInt( lightDefHandle ); savefile->WriteRenderEntity( particleRenderEntity ); savefile->WriteRenderLight( light ); savefile->WriteInt( particleTime ); savefile->WriteInt( lightTime ); savefile->WriteFloat( time ); } /* ================ idExplodingBarrel::Restore ================ */ void idExplodingBarrel::Restore( idRestoreGame *savefile ) { savefile->ReadVec3( spawnOrigin ); savefile->ReadMat3( spawnAxis ); savefile->ReadInt( (int &)state ); savefile->ReadInt( (int &)particleModelDefHandle ); savefile->ReadInt( (int &)lightDefHandle ); savefile->ReadRenderEntity( particleRenderEntity ); savefile->ReadRenderLight( light ); savefile->ReadInt( particleTime ); savefile->ReadInt( lightTime ); savefile->ReadFloat( time ); } /* ================ idExplodingBarrel::Spawn ================ */ void idExplodingBarrel::Spawn( void ) { health = spawnArgs.GetInt( "health", "5" ); fl.takedamage = true; spawnOrigin = GetPhysics()->GetOrigin(); spawnAxis = GetPhysics()->GetAxis(); state = NORMAL; particleModelDefHandle = -1; lightDefHandle = -1; lightTime = 0; particleTime = 0; time = spawnArgs.GetFloat( "time" ); memset( &particleRenderEntity, 0, sizeof( particleRenderEntity ) ); memset( &light, 0, sizeof( light ) ); } /* ================ idExplodingBarrel::Think ================ */ void idExplodingBarrel::Think( void ) { idBarrel::BarrelThink(); if ( lightDefHandle >= 0 ){ if ( state == BURNING ) { // ramp the color up over 250 ms float pct = (gameLocal.time - lightTime) / 250.f; if ( pct > 1.0f ) { pct = 1.0f; } light.origin = physicsObj.GetAbsBounds().GetCenter(); light.axis = mat3_identity; light.shaderParms[ SHADERPARM_RED ] = pct; light.shaderParms[ SHADERPARM_GREEN ] = pct; light.shaderParms[ SHADERPARM_BLUE ] = pct; light.shaderParms[ SHADERPARM_ALPHA ] = pct; gameRenderWorld->UpdateLightDef( lightDefHandle, &light ); } else { if ( gameLocal.time - lightTime > 250 ) { gameRenderWorld->FreeLightDef( lightDefHandle ); lightDefHandle = -1; } return; } } if ( state != BURNING && state != EXPLODING ) { BecomeInactive( TH_THINK ); return; } if ( particleModelDefHandle >= 0 ){ particleRenderEntity.origin = physicsObj.GetAbsBounds().GetCenter(); particleRenderEntity.axis = mat3_identity; gameRenderWorld->UpdateEntityDef( particleModelDefHandle, &particleRenderEntity ); } } /* ================ idExplodingBarrel::AddParticles ================ */ void idExplodingBarrel::AddParticles( const char *name, bool burn ) { if ( name && *name ) { if ( particleModelDefHandle >= 0 ){ gameRenderWorld->FreeEntityDef( particleModelDefHandle ); } memset( &particleRenderEntity, 0, sizeof ( particleRenderEntity ) ); const idDeclModelDef *modelDef = static_cast( declManager->FindType( DECL_MODELDEF, name ) ); if ( modelDef ) { particleRenderEntity.origin = physicsObj.GetAbsBounds().GetCenter(); particleRenderEntity.axis = mat3_identity; particleRenderEntity.hModel = modelDef->ModelHandle(); float rgb = ( burn ) ? 0.0f : 1.0f; particleRenderEntity.shaderParms[ SHADERPARM_RED ] = rgb; particleRenderEntity.shaderParms[ SHADERPARM_GREEN ] = rgb; particleRenderEntity.shaderParms[ SHADERPARM_BLUE ] = rgb; particleRenderEntity.shaderParms[ SHADERPARM_ALPHA ] = rgb; particleRenderEntity.shaderParms[ SHADERPARM_TIMEOFFSET ] = -MS2SEC( gameLocal.realClientTime ); particleRenderEntity.shaderParms[ SHADERPARM_DIVERSITY ] = ( burn ) ? 1.0f : gameLocal.random.RandomInt( 90 ); if ( !particleRenderEntity.hModel ) { particleRenderEntity.hModel = renderModelManager->FindModel( name ); } particleModelDefHandle = gameRenderWorld->AddEntityDef( &particleRenderEntity ); if ( burn ) { BecomeActive( TH_THINK ); } particleTime = gameLocal.realClientTime; } } } /* ================ idExplodingBarrel::AddLight ================ */ void idExplodingBarrel::AddLight( const char *name, bool burn ) { if ( lightDefHandle >= 0 ){ gameRenderWorld->FreeLightDef( lightDefHandle ); } memset( &light, 0, sizeof ( light ) ); light.axis = mat3_identity; light.lightRadius.x = spawnArgs.GetFloat( "light_radius" ); light.lightRadius.y = light.lightRadius.z = light.lightRadius.x; light.origin = physicsObj.GetOrigin(); light.origin.z += 128; light.pointLight = true; light.shader = declManager->FindMaterial( name ); light.shaderParms[ SHADERPARM_RED ] = 2.0f; light.shaderParms[ SHADERPARM_GREEN ] = 2.0f; light.shaderParms[ SHADERPARM_BLUE ] = 2.0f; light.shaderParms[ SHADERPARM_ALPHA ] = 2.0f; lightDefHandle = gameRenderWorld->AddLightDef( &light ); lightTime = gameLocal.realClientTime; BecomeActive( TH_THINK ); } /* ================ idExplodingBarrel::ExplodingEffects ================ */ void idExplodingBarrel::ExplodingEffects( void ) { const char *temp; StartSound( "snd_explode", SND_CHANNEL_ANY, 0, false, NULL ); temp = spawnArgs.GetString( "model_damage" ); if ( *temp != '\0' ) { SetModel( temp ); Show(); } temp = spawnArgs.GetString( "model_detonate" ); if ( *temp != '\0' ) { AddParticles( temp, false ); } temp = spawnArgs.GetString( "mtr_lightexplode" ); if ( *temp != '\0' ) { AddLight( temp, false ); } temp = spawnArgs.GetString( "mtr_burnmark" ); if ( *temp != '\0' ) { gameLocal.ProjectDecal( GetPhysics()->GetOrigin(), GetPhysics()->GetGravity(), 128.0f, true, 96.0f, temp ); } } /* ================ idExplodingBarrel::Killed ================ */ void idExplodingBarrel::Killed( idEntity *inflictor, idEntity *attacker, int damage, const idVec3 &dir, int location ) { if ( IsHidden() || state == EXPLODING || state == BURNING ) { return; } float f = spawnArgs.GetFloat( "burn" ); if ( f > 0.0f && state == NORMAL ) { state = BURNING; PostEventSec( &EV_Explode, f ); StartSound( "snd_burn", SND_CHANNEL_ANY, 0, false, NULL ); AddParticles( spawnArgs.GetString ( "model_burn", "" ), true ); return; } else { state = EXPLODING; } // do this before applying radius damage so the ent can trace to any damagable ents nearby Hide(); physicsObj.SetContents( 0 ); const char *splash = spawnArgs.GetString( "def_splash_damage", "damage_explosion" ); if ( splash && *splash ) { gameLocal.RadiusDamage( GetPhysics()->GetOrigin(), this, attacker, this, this, splash ); } ExplodingEffects( ); //FIXME: need to precache all the debris stuff here and in the projectiles const idKeyValue *kv = spawnArgs.MatchPrefix( "def_debris" ); // bool first = true; while ( kv ) { const idDict *debris_args = gameLocal.FindEntityDefDict( kv->GetValue(), false ); if ( debris_args ) { idEntity *ent; idVec3 dir; idDebris *debris; //if ( first ) { dir = physicsObj.GetAxis()[1]; // first = false; //} else { dir.x += gameLocal.random.CRandomFloat() * 4.0f; dir.y += gameLocal.random.CRandomFloat() * 4.0f; //dir.z = gameLocal.random.RandomFloat() * 8.0f; //} dir.Normalize(); gameLocal.SpawnEntityDef( *debris_args, &ent, false ); if ( !ent || !ent->IsType( idDebris::Type ) ) { gameLocal.Error( "'projectile_debris' is not an idDebris" ); } debris = static_cast(ent); debris->Create( this, physicsObj.GetOrigin(), dir.ToMat3() ); debris->Launch(); debris->GetRenderEntity()->shaderParms[ SHADERPARM_TIME_OF_DEATH ] = ( gameLocal.time + 1500 ) * 0.001f; debris->UpdateVisuals(); } kv = spawnArgs.MatchPrefix( "def_debris", kv ); } physicsObj.PutToRest(); CancelEvents( &EV_Explode ); CancelEvents( &EV_Activate ); f = spawnArgs.GetFloat( "respawn" ); if ( f > 0.0f ) { PostEventSec( &EV_Respawn, f ); } else { PostEventMS( &EV_Remove, 5000 ); } if ( spawnArgs.GetBool( "triggerTargets" ) ) { ActivateTargets( this ); } } /* ================ idExplodingBarrel::Damage ================ */ void idExplodingBarrel::Damage( idEntity *inflictor, idEntity *attacker, const idVec3 &dir, const char *damageDefName, const float damageScale, const int location, trace_t *tr ) { const idDict *damageDef = gameLocal.FindEntityDefDict( damageDefName, true ); // grayman #3391 - don't create a default 'damageDef' // We want 'false' here, but FindEntityDefDict() // will print its own warning, so let's not // clutter the console with a redundant message if ( !damageDef ) { gameLocal.Error( "Unknown damageDef '%s'\n", damageDefName ); } if ( damageDef->FindKey( "radius" ) && GetPhysics()->GetContents() != 0 && GetBindMaster() == NULL ) { PostEventMS( &EV_Explode, 400 ); } else { idEntity::Damage( inflictor, attacker, dir, damageDefName, damageScale, location, tr ); } } /* ================ idExplodingBarrel::Event_TriggerTargets ================ */ void idExplodingBarrel::Event_TriggerTargets() { ActivateTargets( this ); } /* ================ idExplodingBarrel::Event_Explode ================ */ void idExplodingBarrel::Event_Explode() { if ( state == NORMAL || state == BURNING ) { state = BURNEXPIRED; Killed( NULL, NULL, 0, vec3_zero, 0 ); } } /* ================ idExplodingBarrel::Event_Respawn ================ */ void idExplodingBarrel::Event_Respawn() { int i; int minRespawnDist = spawnArgs.GetInt( "respawn_range", "256" ); if ( minRespawnDist ) { float minDist = -1; for ( i = 0; i < gameLocal.numClients; i++ ) { if ( !gameLocal.entities[ i ] || !gameLocal.entities[ i ]->IsType( idPlayer::Type ) ) { continue; } idVec3 v = gameLocal.entities[ i ]->GetPhysics()->GetOrigin() - GetPhysics()->GetOrigin(); float dist = v.Length(); if ( minDist < 0 || dist < minDist ) { minDist = dist; } } if ( minDist < minRespawnDist ) { PostEventSec( &EV_Respawn, spawnArgs.GetInt( "respawn_again", "10" ) ); return; } } const char *temp = spawnArgs.GetString( "model" ); if ( temp && *temp ) { SetModel( temp ); } health = spawnArgs.GetInt( "health", "5" ); fl.takedamage = true; physicsObj.SetOrigin( spawnOrigin ); physicsObj.SetAxis( spawnAxis ); physicsObj.SetContents( CONTENTS_SOLID ); // override with custom contents if present if( m_CustomContents != -1 ) physicsObj.SetContents( m_CustomContents ); // SR CONTENTS_RESPONSE FIX if( m_StimResponseColl->HasResponse() ) physicsObj.SetContents( physicsObj.GetContents() | CONTENTS_RESPONSE ); physicsObj.DropToFloor(); state = NORMAL; Show(); UpdateVisuals(); } /* ================ idMoveable::Event_Activate ================ */ void idExplodingBarrel::Event_Activate( idEntity *activator ) { Killed( activator, activator, 0, vec3_origin, 0 ); } /* ================ idMoveable::WriteToSnapshot ================ */ void idExplodingBarrel::WriteToSnapshot( idBitMsgDelta &msg ) const { idMoveable::WriteToSnapshot( msg ); msg.WriteBits( IsHidden(), 1 ); } /* ================ idMoveable::ReadFromSnapshot ================ */ void idExplodingBarrel::ReadFromSnapshot( const idBitMsgDelta &msg ) { idMoveable::ReadFromSnapshot( msg ); if ( msg.ReadBits( 1 ) ) { Hide(); } else { Show(); } } /* ================ idExplodingBarrel::ClientReceiveEvent ================ */ bool idExplodingBarrel::ClientReceiveEvent( int event, int time, const idBitMsg &msg ) { switch( event ) { case EVENT_EXPLODE: { if ( gameLocal.realClientTime - msg.ReadLong() < spawnArgs.GetInt( "explode_lapse", "1000" ) ) { ExplodingEffects( ); } return true; } default: { return idBarrel::ClientReceiveEvent( event, time, msg ); } } // return false; }
|
__label__pos
| 0.994758 |
spate.mcmc: MCMC algorithm for fitting the model.
Description Usage Arguments Value Author(s) Examples
View source: R/spateFcts.R
Description
MCMC algorithm for fitting the model.
Usage
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
spate.mcmc(y,coord=NULL,lengthx=NULL,lengthy=NULL,Sind=NULL,n=NULL,
IncidenceMat=FALSE,x=NULL,SV=c(rho0=0.2,sigma2=0.1,
zeta=0.25,rho1=0.2,gamma=1,alpha=0.3,muX=0,muY=0,tau2=0.005),
betaSV=rep(0,dim(x)[1]),RWCov=NULL,parh=NULL,tPred=NULL,
sPred=NULL,P.rho0=Prho0,P.sigma2=Psigma2,P.zeta=Pzeta,P.rho1=Prho1,
P.gamma=Pgamma,P.alpha=Palpha,P.mux=Pmux,P.muy=Pmuy,P.tau2=Ptau2,
lambdaSV=1,sdlambda=0.01,P.lambda=Plambda,DataModel="Normal",
DimRed=FALSE,NFour=NULL,indEst=1:9,Nmc=10000,BurnIn =1000,
path=NULL,file=NULL,SaveToFile=FALSE,PlotToFile=FALSE,
FixEffMetrop=TRUE,saveProcess=FALSE,Nsave=200,seed=NULL,
Padding=FALSE,adaptive=TRUE,NCovEst=500,BurnInCovEst=500,
MultCov=0.5,printRWCov=FALSE,MultStdDevLambda=0.75,
Separable=FALSE,Drift=!Separable,Diffusion=!Separable,
logInd=c(1,2,3,4,5,9),nu=1,plotTrace=TRUE,
plotHist=FALSE,plotPairs=FALSE,trueVal=NULL,
plotObsLocations=FALSE,trace=TRUE,monitorProcess=FALSE,
tProcess=NULL,sProcess=NULL)
Arguments
y
Observed data in an T x N matrix with columns and rows corresponding to time and space (observations on a grid stacked into a vector), respectively. By default, at each time point, the observations are assumed to lie on a square grid with each axis scaled so that it has unit length.
coord
If specified, this needs to be a matrix of dimension N x 2 with coordinates of the N observation points. Observations in 'y' can either be on a square grid or not. If not, the coordinates of each observation point need to be specified in 'coord'. According to these coordinates, each observation location is then mapped to a grid cell. If 'coord' is not specified, the observations in 'y' are assumed to lie on a square grid with each axis scaled so that it has unit length.
lengthx
Use together with 'coord' to specify the length of the x-axis. This is usefull if the observations lie in a rectangular area instead of a square. The length needs to be at least as large as the largest x-distance in 'coord.
lengthy
Use together with 'coord' to specify the length of the y-axis. This is usefull if the observations lie in a rectangular area instead of a square. The length needs to be at least as large as the largest y-distance in 'coord.
Sind
Vector of indices of grid cells where observations are made, in case, the observation are not made at every grid cell. Alternatively, the coordinates of the observation locations can be specfied in 'coord'.
n
Number of point per axis of the square into which the points are mapped. In total, the process is modeled on a grid of size n*n.
IncidenceMat
Logical; if 'TRUE' an incidence matrix relating the latent process to observation locations is used. This is only recommended to use when the observations are relatively low-dimensional and when the latent process is modeled in a reduced dimensional space as well.
x
Covariates in an array of dimensions p x T X N, where p denotes the number of covariates, T the number of time points, and N the number of spatial points.
SV
Starting values for parameters. Parameters for the SPDE in the following order: rho_0, sigma^2, zeta, rho_1, gamma, alpha, mu_x, mu_y, tau^2. rho_0 and sigma^2 are the range and marginal variance of the Matern covariance funtion for the innovation term epsilon. zeta is the damping parameter. rho_1, gamma, and alpha parametrize the diffusion matrix with rho_1 being a range parameter, gamma and alpha determining the amount and the direction, respectively, of anisotropy. mu_x and mu_y are the two components of the drift vector. tau^2 denotes the nugget effect or measurment error.
betaSV
Starting values for regression coefficients.
RWCov
Covariance matrix of the proposal distribution used in the random walk Metropolis-Hastings step for the hyper-parameters.
parh
Only used in prediction mode. If 'parh' is not 'NULL', this indicates that 'spate.mcmc' is used for making predictions at locations (tPred,sPred) instead of applying the traditional MCMC algorithm. In case 'parh' is not 'NULL', it is a Npar x Nsim matrix containing Nsim samples from the posterior of the Npar parameters. This argument is used by the wrapper function 'spate.predict'.
tPred
Time points where predictions are made.This needs to be a vector if predictions are made at multiple times. For instance, if T is the number of time points in the data 'y', then tPred=c(T+1, T+2) means that predictions are made at time 'T+1' and 'T+2'. This argument is used by the wrapper function 'spate.predict'.
sPred
Vector of indices of grid cells (positions of locations in the stacked spatial vector) where predictions are made. This argument is used by the wrapper function 'spate.predict'.
P.rho0
Function specifying the prior for rho0.
P.sigma2
Function specifying the prior for sigma2.
P.zeta
Function specifying the prior for zeta.
P.rho1
Function specifying the prior for rho1.
P.gamma
Function specifying the prior for gamma.
P.alpha
Function specifying the prior for alpha.
P.mux
Function specifying the prior for mux.
P.muy
Function specifying the prior for muy.
P.tau2
Function specifying the prior for tau2.
lambdaSV
Starting value for transformation parameter lambda in the Tobit model.
sdlambda
Standard deviation of the proposal distribution used in the random walk Metropolis-Hastings step for lambda.
P.lambda
Function specifying the prior for lambda.
DataModel
Specifies the data model. "Normal" or "SkewTobit" are available options.
DimRed
Logical; if 'TRUE' dimension reduction is applied. This means that not the full number (n*n) of Fourier functions is used but rather only a reduced dimensional basis of dimension 'NFour'.
NFour
If 'DimRed' is 'TRUE', this specifies the number of Fourier functions.
indEst
A vector of numbers specifying which for which parameters the posterior should be computed and which should be held fix (at their starting value). If the corresponding to the index of rho_0, sigma^2, zeta, rho_1, gamma, alpha, mu_x, mu_y, tau^2 is present in the vector, the parameter will be estimated otherwise not. Default is indEst=1:9 which means that one samples from the posterior for all parameters.
Nmc
Number of MCMC samples.
BurnIn
Length of the burn-in period.
path
Path, in case plots and / or the spateMCMC object should be save in a file.
file
File name, in case plots and / or the spateMCMC object should be save in a file.
SaveToFile
Indicates whether the spateMCMC object should be save in a file.
PlotToFile
Indicates whether the MCMC output analysis plots should be save in a file.
FixEffMetrop
The fixed effects, i.e., the regression coefficients, can either be sampled in a Gibbs step or updated together with the hyperparameters in the Metropolis-Hastings step. The latter is the default and recommended option since correlations between fixed effects and the random process can result in slow mixing.
saveProcess
Logical; if 'TRUE' samples from the posterior of the latent spatio-temporal process xi are saved.
Nsave
Number of samples from the posterior of the latent spatio-temporal process xi that should be save.
seed
Seed for random generator.
Padding
Indicates whether padding is applied or not. If the range parameters are large relative to the domain, this is recommended since otherwise spurious periodicity can occur.
adaptive
Indicates whether an adaptive Metropolis-Hastings algorithm is used or not. If yes, the proposal covariance matrix 'RWCov' is adaptively estimated during the algorithm and tuning does not need to be done by hand.
NCovEst
Minimal number of samples to be used for estimating the proposal matrix.
BurnInCovEst
Burn-in period for estimating the proposal matrix.
MultCov
Numeric used as multiplier for the adaptively estimated proposal cocariance matrix 'RWCov' of the hyper-parameters. I.e., the estimated covariance matrix is multiplied by 'MultCov'.
printRWCov
Logical, if 'TRUE' the estimated proposal cocariance matrix is printed each time.
MultStdDevLambda
Numeric used as multiplier for the adaptively estimated proposal standard deviation of the Tobit transformation parameter lambda. I.e., the estimated standard deviation is multiplied by 'MultStdDevLambda'.
Separable
Indicates whether a separable model, i.e., no transport / drift and no diffusion, should be estimated.
Drift
Indicates whether a drift term should be included.
Diffusion
Indicates whether a diffusion term should be included.
logInd
Indicates which parameters are sampled on the log-scale. Default is logInd=c(1, 2, 3, 4, 5, 9) corresponding to rho_0, sigma2, zeta, rho_1, gamma, and tau^2.
nu
Smoothness parameter of the Matern covariance function for the innovations. By default this equals 1 corresponding to the Whittle covariance function.
plotTrace
Indicates whether trace plots are made.
plotHist
Indicates whether histograms of the posterior distributions are made.
plotPairs
Indicates whether scatter plots of the hyper-parameters and the regression coefficients are made.
trueVal
In simulations, true values can be supplied for comparison with the MCMC output.
plotObsLocations
Logical; if 'TRUE' the observations locations are ploted together with the grid cells.
trace
Logical; if 'TRUE' tracing information on the progress of the MCMC algorithm is produced.
monitorProcess
Logical; if 'TRUE' in addition to the trace plots of the hyper-parameters, the mixing properties of the latent process xi=Phi*alpha is monitored. This is done by plotting the current sample of the process. More specifically, the time series at locations 'sProcess' and the spatial fieldd at time points 'tProcess'.
tProcess
To be secified if 'monitorProcess=TRUE'. Time points at which spatial fields of the sampled process should be plotted.
sProcess
To be secified if 'monitorProcess=TRUE'. Locations at which time series of the sampled process should be plotted.
Value
The function returns a 'spateMCMC' object with, amongst others, the following entries
Post
Matrix containing samples from the posterior of the hyper-parameters and the regression coefficient
xiPost
Array with samples from the posterior of the spatio-temporal process
RWCov
(Estimated) proposal covariance matrix
Author(s)
Fabio Sigrist
Examples
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
##Specify hyper-parameters
par <- c(rho0=0.1,sigma2=0.2,zeta=0.5,rho1=0.1,gamma=2,alpha=pi/4,muX=0.2,muY=-0.2,tau2=0.01)
##Simulate data
spateSim <- spate.sim(par=par,n=20,T=20,seed=4)
w <- spateSim$w
##Below is an example to illustrate the use of the MCMC algorithm.
##In practice, more samples are needed for a sufficiently large effective sample size.
##The following takes a couple of minutes.
##Load the precomputed object some lines below to save time.
##spateMCMC <- spate.mcmc(y=w,x=NULL,SV=c(rho0=0.2,sigma2=0.1,
## zeta=0.25,rho1=0.2,gamma=1,alpha=0.3,muX=0,muY=0,tau2=0.005),
## RWCov=diag(c(0.005,0.005,0.05,0.005,0.005,0.001,0.0002,0.0002,0.0002)),
## Nmc=10000,BurnIn=2000,seed=4,Padding=FALSE,plotTrace=TRUE,NCovEst=500,
## BurnInCovEst=500,trueVal=par,saveProcess=TRUE)
##spateMCMC
##plot(spateMCMC.fit,true=par,postProcess=TRUE)
##Instead of waiting, you can also use this precomputed object
data("spateMCMC")
spateMCMC
plot(spateMCMC,true=par,medianHist=FALSE)
spate documentation built on May 19, 2017, 8:48 a.m.
Search within the spate package
Search all R packages, documentation and source code
Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at [email protected].
Please suggest features or report bugs in the GitHub issue tracker.
All documentation is copyright its authors; we didn't write any of that.
|
__label__pos
| 0.818774 |
1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
Am I doomed to fail if I don't ace Analysis II?
1. Jan 30, 2013 #1
I am currently taking an Analysis course. We are using Folland's Advanced Calculus textbook. The professor is good. The reason I am not doing so well is because of my own naivety. I do understand what is going on in the class but I am shooting myself in the foot with dumb things.
For example, today we had a quiz in class. The problem was to evaluate an extremely easy limit. Having taken a multivariable class that was not proof intensive, I took evaluate to mean find the limit. This limit was extremely obvious so I didn't bother proving anything. The epsilon delta proof would have been just as easy if I were to have done it, but I didn't do it so I am probably looking at a 0.
This one quiz obviously won't be detrimental to my grade, but the professor is notoriously harsh when it comes to tests so I won't have a safety net to fall onto if I mess up a question on the midterm/final. I got burned today and I have learned my lesson but say I take a B- or something in this class. Is graduate school a lost cause?
2. jcsd
3. Jan 30, 2013 #2
I can't imagine that it is a lost cause - especially getting a B in a pretty hard math class. I, for example, for several bad reasons, got a C in a stat. class - it was an upper level stat class, but still the C was embarrassing, and I am currently in grad school at a pretty big name place (not that that matters all that much) with funding. So, and others here are more knowledgeable, I don't think a B- will hurt your chances too much.
4. Jan 30, 2013 #3
I don't know any advanced undergraduate math but what is the difference between evaluating the limit and finding the limit?
5. Jan 30, 2013 #4
The point of the question was not only to find the limit, but also to prove rigorously that that is the limit. So they wanted an epsilon-delta proof, and not only the final answer.
It's pretty ambiguous though. The professor should have stated explicitely that he wanted an epsilon-delta proof.
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook
|
__label__pos
| 0.945729 |
Skip Headers
Pro*C/C++ Programmer's Guide
Release 9.2
Part Number A97269-03
Go to Documentation Home
Home
Go to Book List
Book List
Go to Table of Contents
Contents
Go to Index
Index
Go to Master Index
Master Index
Go to Feedback page
Feedback
Go to previous page
Previous
Go to next page
Next
View PDF
4 Datatypes and Host Variables
This chapter provides the basic information you need to write a Pro*C/C++ program. This chapter contains the following topics:
This chapter also includes several complete demonstration programs that you can study. These programs illustrate the techniques described. They are available on-line in your demo directory, so you can compile and run them, and modify them for your own uses.
4.1 Oracle Datatypes
Oracle recognizes two kinds of datatypes: internal and external. Internal datatypes specify how Oracle stores column values in database tables, as well as the formats used to represent pseudocolumn values such as NULL, SYSDATE, USER, and so on. External datatypes specify the formats used to store values in input and output host variables.
For descriptions of the Oracle internal (also called built-in) datatypes, see Oracle Database SQL Reference.
4.1.1 Internal Datatypes
For values stored in database columns, Oracle uses the internal datatypes shown in Table 4-1
Table 4-1 Oracle Internal Datatypes
Name Description
VARCHAR2 Variable-length character string, <= 4000 bytes.
NVARCHAR2 or NCHAR VARYING Variable-length single-byte or National Character string,<= 4000 bytes.
NUMBER Numeric value having precision and scale, represented in a base-100 format.
LONG Variable-length character string <=2**31-1 bytes.
ROWID Binary value.
DATE Fixed-length date + time value, 7 bytes.
RAW Variable-length binary data, <=2000 bytes.
LONG RAW Variable-length binary data, <=2**31-1 bytes.
CHAR Fixed-length character string, <=2000 bytes.
NCHAR Fixed-length single-byte or National Character string, <= 2000 bytes.
BFILE External file binary data, <= 4 Gbytes.
BLOB Binary data, <= 4 Gbytes.
CLOB Character data, <= 4 Gbytes.
NCLOB National Character Set data, <= 4 Gbytes.
These internal datatypes can be quite different from C datatypes. For example, C has no datatype that is equivalent to the Oracle NUMBER datatype. However, NUMBERs can be converted between C datatypes such as float and double, with some restrictions. For example, the Oracle NUMBER datatype allows up to 38 decimal digits of precision, while no current C implementations can represent double with that degree of precision.
The Oracle NUMBER datatype represents values exactly (within the precision limits), while floating-point formats cannot represent values such as 10.0 exactly.
Use the LOB datatypes to store unstructured data (text, graphic images, video clips, or sound waveforms). BFILE data is stored in an operating system file outside the database. LOB types store locators that specify the location of the data.
NCHAR and NVARCHAR2 are used to store multibyte character data.
See Also:
"Globalization Support" for a discussion of these datatypes
4.1.2 External Datatypes
As shown in Table 4-2, the external datatypes include all the internal datatypes plus several datatypes that closely match C constructs. For example, the STRING external datatype refers to a C null-terminated string.
Table 4-2 Oracle External Datatypes
Name Description
VARCHAR2 Variable-length character string, <= 65535 bytes.
NUMBER Decimal number, represented using a base-100 format.
INTEGER Signed integer.
FLOAT Real number.
STRING Null-terminated variable length character string.
VARNUM Decimal number, like NUMBER, but includes representation length component.
LONG Fixed-length character string, up to 2**31-1 bytes.
VARCHAR Variable-length character string, <= 65533 bytes.
ROWID Binary value, external length is system dependent.
DATE Fixed-length date/time value, 7 bytes.
VARRAW Variable-length binary data, <= 65533 bytes.
RAW Fixed-length binary data, <= 65535 bytes.
LONG RAW Fixed-length binary data, <= 2**31-1 bytes.
UNSIGNED Unsigned integer.
LONG VARCHAR Variable-length character string, <= 2**31-5 bytes.
LONG VARRAW Variable-length binary data, <= 2**31-5 bytes.
CHAR Fixed-length character string, <= 65535 bytes.
CHARZ Fixed-length, null-terminated character string, <= 65534 bytes.
CHARF Used in TYPE or VAR statements to force CHAR to default to CHAR, instead of VARCHAR2 or CHARZ.
Brief descriptions of the Oracle datatypes follow.
4.1.2.1 VARCHAR2
You use the VARCHAR2 datatype to store variable-length character strings. The maximum length of a VARCHAR2 value is 64K bytes.
You specify the maximum length of a VARCHAR2(n) value in bytes, not characters. So, if a VARCHAR2(n) variable stores multibyte characters, its maximum length can be less than n characters.
When you precompile using the option CHAR_MAP=VARCHAR2, Oracle assigns the VARCHAR2 datatype to all host variables that you declare as char[n] or char.
4.1.2.1.1 On Input
Oracle reads the number of bytes specified for the input host variable, strips any trailing blanks, then stores the input value in the target database column. Be careful. An uninitialized host variable can contain NULLs. So, always blank-pad a character input host variable to its declared length, and do not null-terminate it.
If the input value is longer than the defined width of the database column, Oracle generates an error. If the input value contains nothing but blanks, Oracle treats it like a NULL.
Oracle can convert a character value to a NUMBER column value if the character value represents a valid number. Otherwise, Oracle generates an error.
4.1.2.1.2 On Output
Oracle returns the number of bytes specified for the output host variable, blank-padding if necessary. It then assigns the output value to the target host variable. If a NULL is returned, Oracle fills the host variable with blanks.
If the output value is longer than the declared length of the host variable, Oracle truncates the value before assigning it to the host variable. If there is an indicator variable associated with the host variable, Oracle sets it to the original length of the output value.
Oracle can convert NUMBER column values to character values. The length of the character host variable determines precision. If the host variable is too short for the number, scientific notation is used. For example, if you SELECT the column value 123456789 into a character host variable of length 6, Oracle returns the value '1.2E08'. If a NULL is selected explicitly, the value in the host variable is indeterminate. The value of the indicator variable needs to be checked for NULL-ness.
4.1.2.2 NUMBER
You use the NUMBER datatype to store fixed or floating-point numbers. You can specify precision and scale. The maximum precision of a NUMBER value is 38. The magnitude range is 1.0E-130 to 9.99...9E125 (38 nines followed by 88 zeroes). Scale can range from -84 to 127.
NUMBER values are stored in a variable-length format, starting with an exponent byte and followed by 19 mantissa bytes. The high-order bit of the exponent byte is a sign bit, which is set for positive numbers. The low-order 7 bits represent the magnitude.
The mantissa forms a 38-digit number with each byte representing 2 of the digits in a base-100 format. The sign of the mantissa is specified by the value of the first (left-most) byte. If greater than 101 then the mantissa is negative and the first digit of the mantissa is equal to the left-most byte minus 101.
On output, the host variable contains the number as represented internally by Oracle. To accommodate the largest possible number, the output host variable must be 22 bytes long. Only the bytes used to represent the number are returned. Oracle does not blank-pad or null-terminate the output value. If you need to know the length of the returned value, use the VARNUM datatype instead.
There is seldom a need to use this external datatype.
4.1.2.3 INTEGER
You use the INTEGER datatype to store numbers that have no fractional part. An integer is a signed, 2-byte or 4-byte binary number. The order of the bytes in a word is system dependent. You must specify a length for input and output host variables. On output, if the column value is a real number, Oracle truncates any fractional part.
4.1.2.4 FLOAT
You use the FLOAT datatype to store numbers that have a fractional part or that exceed the capacity of the INTEGER datatype. The number is represented using the floating-point format of your computer and typically requires 4 or 8 bytes of storage. You must specify a length for input and output host variables.
Oracle can represent numbers with greater precision than most floating-point implementations because the internal format of Oracle numbers is decimal. This can cause a loss of precision when fetching into a FLOAT variable.
4.1.2.5 STRING
The STRING datatype is like the VARCHAR2 datatype, except that a STRING value is always null-terminated. When you precompile using the option CHAR_MAP=STRING, Oracle assigns the STRING datatype to all host variables that you declare as char[n] or char.
4.1.2.5.1 On Input
Oracle uses the specified length to limit the scan for the null terminator. If a null terminator is not found, Oracle generates an error. If you do not specify a length, Oracle assumes the maximum length of 2000 bytes. The minimum length of a STRING value is 2 bytes. If the first character is a null terminator and the specified length is 2, Oracle inserts a null unless the column is defined as NOT NULL. If the column is defined as NOT NULL, an error occurs. An all-blank value is stored intact.
4.1.2.5.2 On Output
Oracle appends a null byte to the last character returned. If the string length exceeds the specified length, Oracle truncates the output value and appends a null byte. If a NULL is SELECTed, Oracle returns a null byte in the first character position. If a NULL is selected explicitly, the value in the host variable is indeterminate. The value of the indicator variable needs to be checked for NULL-ness.
4.1.2.6 VARNUM
The VARNUM datatype is like the NUMBER datatype, except that the first byte of a VARNUM variable stores the length of the representation.
On input, you must set the first byte of the host variable to the length of the value. On output, the host variable contains the length followed by the number as represented internally by Oracle. To accommodate the largest possible number, the host variable must be 22 bytes long. After SELECTing a column value into a VARNUM host variable, you can check the first byte to get the length of the value.
Normally, there is little reason to use this datatype.
4.1.2.7 LONG
You use the LONG datatype to store fixed-length character strings.
The LONG datatype is like the VARCHAR2 datatype, except that the maximum length of a LONG value is 2147483647 bytes or two gigabytes.
4.1.2.8 VARCHAR
You use the VARCHAR datatype to store variable-length character strings. VARCHAR variables have a 2-byte length field followed by a <=65533-byte string field. However, for VARCHAR array elements, the maximum length of the string field is 65530 bytes. When you specify the length of a VARCHAR variable, be sure to include 2 bytes for the length field. For longer strings, use the LONG VARCHAR datatype. If a NULL is selected explicitly, the value in the host variable is indeterminate. The value of the indicator variable needs to be checked for NULL-ness.
4.1.2.9 ROWID
Before the release of Oracle8, ROWID datatype was used to store the physical address of each row of each table, as a hexadecimal number. The ROWID contained the physical address of the row and allowed you to retrieve the row in a single efficient block access.
With Oracle8, the logical ROWID was introduced. Rows in Index-Organized tables do not have permanent physical addresses. The logical ROWID is accessed using the same syntax as the physical ROWID. For this reason, the physical ROWID was expanded in size to include a data object number (schema objects in the same segment).
To support both logical and physical ROWIDs (as well as ROWIDs of non-Oracle tables) the universal ROWID was defined.
You can use character host variables to store rowids in a readable format. When you SELECT or FETCH a rowid into a character host variable, Oracle converts the binary value to an 18-byte character string and returns it in the format
BBBBBBBB.RRRR.FFFF
where BBBBBBBB is the block in the database file, RRRR is the row in the block (the first row is 0), and FFFF is the database file. These numbers are hexadecimal. For example, the rowid
0000000E.000A.0007
points to the 11th row in the 15th block in the 7th database file.
See Also:
"Universal ROWIDs" for a further discussion of how to use the universal ROWID in applications.
Typically, you FETCH a rowid into a character host variable, then compare the host variable to the ROWID pseudocolumn in the WHERE clause of an UPDATE or DELETE statement. That way, you can identify the latest row fetched by a cursor.
Note:
If you need full portability or your application communicates with a non-Oracle database using Oracle Open Gateway technology, specify a maximum length of 256 (not 18) bytes when declaring the host variable. Though you can assume nothing about the host variable's contents, the host variable will behave normally in SQL statements.
4.1.2.10 DATE
You use the DATE datatype to store dates and times in 7-byte, fixed-length fields. As Table 4-3 shows, the century, year, month, day, hour (in 24-hour format), minute, and second are stored in that order from left to right.
Table 4-3 DATE Format
Date Datatype Century Year Month Day Hour Minutes Second
Byte 1 2 3 4 5 6 7
Meaning Century Year Month Day Hour Minute Second
Example
17-OCT-1994 at 1:23:12 PM
119 194 10 17 14 24 13
The century and year bytes are in excess-100 notation. The hour, minute, and second are in excess-1 notation. Dates before the Common Era (B.C.E.) are less than 100. The epoch is January 1, 4712 B.C.E. For this date, the century byte is 53 and the year byte is 88. The hour byte ranges from 1 to 24. The minute and second bytes range from 1 to 60. The time defaults to midnight (1, 1, 1).
Normally, there is little reason to use the DATE datatype.
4.1.2.11 RAW
You use the RAW datatype to store binary data or byte strings. The maximum length of a RAW value is 65535 bytes.
RAW data is like CHARACTER data, except that Oracle assumes nothing about the meaning of RAW data and does no character set conversions when you transmit RAW data from one system to another.
4.1.2.12 VARRAW
You use the VARRAW datatype to store variable-length binary data or byte strings. The VARRAW datatype is like the RAW datatype, except that VARRAW variables have a 2-byte length field followed by a data field <= 65533 bytes in length. For longer strings, use the LONG VARRAW datatype.
When you specify the length of a VARRAW variable, be sure to include 2 bytes for the length field. The first two bytes of the variable must be interpretable as an integer.
To get the length of a VARRAW variable, simply refer to its length field.
4.1.2.13 LONG RAW
You use the LONG RAW datatype to store binary data or byte strings. The maximum length of a LONG RAW value is 2147483647 bytes or two gigabytes.
LONG RAW data is like LONG data, except that Oracle assumes nothing about the meaning of LONG RAW data and does no character set conversions when you transmit LONG RAW data from one system to another.
4.1.2.14 UNSIGNED
You use the UNSIGNED datatype to store unsigned integers. An unsigned integer is a binary number of 2 or 4 bytes. The order of the bytes in a word is system dependent. You must specify a length for input and output host variables. On output, if the column value is a floating-point number, Oracle truncates the fractional part.
4.1.2.15 LONG VARCHAR
You use the LONG VARCHAR datatype to store variable-length character strings. LONG VARCHAR variables have a 4-byte length field followed by a string field. The maximum length of the string field is 2147483643 (2**31 - 5) bytes. When you specify the length of a LONG VARCHAR for use in a VAR or TYPE statement, do not include the 4 length bytes.
4.1.2.16 LONG VARRAW
You use the LONG VARRAW datatype to store variable-length binary data or byte strings. LONG VARRAW variables have a 4-byte length field followed by a data field. The maximum length of the data field is 2147483643 bytes. When you specify the length of a LONG VARRAW for use in a VAR or TYPE statement, do not include the 4 length bytes.
4.1.2.17 CHAR
You use the CHAR datatype to store fixed-length character strings. The maximum length of a CHAR value is 65535 bytes.
4.1.2.17.1 On Input
Oracle reads the number of bytes specified for the input host variable, does not strip trailing blanks, then stores the input value in the target database column.
If the input value is longer than the defined width of the database column, Oracle generates an error. If the input value is all-blank, Oracle treats it like a character value.
4.1.2.17.2 On Output
Oracle returns the number of bytes specified for the output host variable, doing blank-padding if necessary, then assigns the output value to the target host variable. If a NULL is returned, Oracle fills the host variable with blanks.
If the output value is longer than the declared length of the host variable, Oracle truncates the value before assigning it to the host variable. If an indicator variable is available, Oracle sets it to the original length of the output value. If a NULL is selected explicitly, the value in the host variable is indeterminate. The value of the indicator variable needs to be checked for NULL-ness.
4.1.2.18 CHARZ
When DBMS=V7 or V8, Oracle, by default, assigns the CHARZ datatype to all character host variables in a Pro*C/C++ program. The CHARZ datatype indicates fixed-length, null-terminated character strings. The maximum length of a CHARZ value is 65534 bytes.
4.1.2.18.1 On Input
The CHARZ and STRING datatypes work the same way. You must null-terminate the input value. The null terminator serves only to delimit the string; it does not become part of the stored data.
4.1.2.18.2 On Output
CHARZ host variables are blank-padded if necessary, then null-terminated. The output value is always null-terminated, even if data must be truncated. If a NULL is selected explicitly, the value in the host variable is indeterminate. The value of the indicator variable needs to be checked for NULL-ness.
4.1.2.19 CHARF
The CHARF datatype is used in EXEC SQL TYPE and EXEC SQL VAR statements. When you precompile with the DBMS option set to V7 or V8, specifying the external datatype CHAR in a TYPE or VAR statement equivalences the C type or variable to the fixed-length, null-terminated datatype CHARZ.
However, you might not want either of these type equivalences, but rather an equivalence to the fixed-length external type CHAR. If you use the external type CHARF, the C type or variable is always equivalenced to the fixed-length ANSI datatype CHAR, regardless of the DBMS value. CHARF never allows the C type to be equivalenced to VARCHAR2 or CHARZ. Alternatively, when you set the option CHAR_MAP=CHARF, all host variables declared as char[n] or char are equivalenced to a CHAR string. If a NULL is selected explicitly, the value in the host variable is indeterminate. The value of the indicator variable needs to be checked for NULL-ness.
4.1.3 Additional External Datatypes
This section describes additional external datatypes.
4.1.3.1 Datetime and Interval Datatypes
The datetime and interval datatypes are briefly summarized here.
See Also:
For more a more complete discussion, see Oracle Database SQL Reference
4.1.3.2 ANSI DATE
The ANSI DATE is based on the DATE, but contains no time portion. (Therefore, it also has no time zone.) ANSI DATE follows the ANSI specification for the DATE datatype. When assigning an ANSI DATE to a DATE or a timestamp datatype, the time portion of the Oracle DATE and the timestamp are set to zero. When assigning a DATE or a timestamp to an ANSI DATE, the time portion is ignored.
You are encouraged to instead use the TIMESTAMP datatype which contains both date and time.
4.1.3.3 TIMESTAMP
The TIMESTAMP datatype is an extension of the DATE datatype. It stores the year, month, and day of the DATE datatype, plus the hour, minute, and second values. It has no time zone. The TIMESTAMP datatype has the form:
TIMESTAMP(fractional_seconds_precision)
where fractional_seconds_precision (which is optional) specifies the number of digits in the fractional part of the SECOND datetime field and can be a number in the range 0 to 9. The default is 6.
4.1.3.4 TIMESTAMP WITH TIME ZONE
TIMESTAMP WITH TIME ZONE (TSTZ) is a variant of TIMESTAMP that includes an explicit time zone displacement in its value. The time zone displacement is the difference (in hours and minutes) between local time and UTC (Coordinated Universal Time—formerly Greenwich Mean Time). The TIMESTAMP WITH TIME ZONE datatype has the form:
TIMESTAMP(fractional_seconds_precision) WITH TIME ZONE
where fractional_seconds_precision optionally specifies the number of digits in the fractional part of the SECOND datetime field and can be a number in the range 0 to 9. The default is 6.
Two TIMESTAMP WITH TIME ZONE values are considered identical if they represent the same instant in UTC, regardless of the TIME ZONE offsets stored in the data.
4.1.3.5 TIMESTAMP WITH LOCAL TIME ZONE
TIMESTAMP WITH LOCAL TIME ZONE (TSLTZ) is another variant of TIMESTAMP that includes a time zone displacement in its value. Storage is in the same format as for TIMESTAMP. This type differs from TIMESTAMP WITH TIME ZONE in that data stored in the database is normalized to the database time zone, and the time zone displacement is not stored as part of the column data. When users retrieve the data, Oracle returns it in the users' local session time zone.
The time zone displacement is the difference (in hours and minutes) between local time and UTC (Coordinated Universal Time—formerly Greenwich Mean Time). The TIMESTAMP WITH LOCAL TIME ZONE datatype has the form:
TIMESTAMP(fractional_seconds_precision) WITH LOCAL TIME ZONE
where fractional_seconds_precision optionally specifies the number of digits in the fractional part of the SECOND datetime field and can be a number in the range 0 to 9. The default is 6.
4.1.3.6 INTERVAL YEAR TO MONTH
INTERVAL YEAR TO MONTH stores a period of time using the YEAR and MONTH datetime fields. The INTERVAL YEAR TO MONTH datatype has the form:
INTERVAL YEAR(year_precision) TO MONTH
where the optional year_precision is the number of digits in the YEAR datetime field. The default value of year_precision is 2.
4.1.3.7 INTERVAL DAY TO SECOND
INTERVAL DAY TO SECOND stores a period of time in terms of days, hours, minutes, and seconds. The INTERVAL DAY TO SECOND datatype has the form:
INTERVAL DAY (day_precision) TO SECOND(fractional_seconds_precision)
where:
• day_precision is the number of digits in the DAY datetime field. It is optional. Accepted values are 0 to 9. The default is 2.
fractional_seconds_precision is the number of digits in the fractional part of the SECOND datetime field. It is optional. Accepted values are 0 to 9. The default is 6.
4.1.3.8 Avoiding Unexpected Results Using Datetime
Note:
To avoid unexpected results in your DML operations on datetime data, you can verify the database and session time zones by querying the built-in SQL functions DBTIMEZONE and SESSIONTIMEZONE. If the time zones have not been set manually, Oracle uses the operating system time zone by default. If the operating system time zone is not a valid Oracle time zone, Oracle uses UTC as the default value.
4.2 Host Variables
Host variables are the key to communication between your host program and Oracle. Typically, a precompiler program inputs data from a host variable to Oracle, and Oracle outputs data to a host variable in the program. Oracle stores input data in database columns, and stores output data in program host variables.
A host variable can be any arbitrary C expression that resolves to a scalar type. But, a host variable must also be an lvalue. Host arrays of most host variables are also supported.
4.2.1 Host Variable Declaration
You declare a host variable according to the rules of the C programming language, specifying a C datatype supported by the Oracle program interface. The C datatype must be compatible with that of the source or target database column.
If MODE=ORACLE, you do not have to declare host variables in a special Declare Section. However, if you do not use a Declare Section, the FIPS flagger warns you about this, as the Declare Section is part of the ANSI SQL Standard. If CODE=CPP (you are compiling C++ code) or PARSE=NONE or PARSE=PARTIAL, then you must have a Declare Section.
Table 4-4 shows the C datatypes and the pseudotypes that you can use when declaring host variables. Only these datatypes can be used for host variables.
Table 4-4 C Datatypes for Host Variables
C Datatype or Pseudotype Description
char single character
char[n] n-character array (string)
int integer
short small integer
long large integer
float floating-point number (usually single precision)
double floating-point number (always double precision)
VARCHAR[n] variable-length string
Table 4-5 shows the compatible Oracle internal datatypes.
Table 4-5 C to Oracle Datatype Compatibility
Internal Type C Type Description
VARCHAR2(Y)
(Note 1)
char single character
CHAR(X)
(Note 1)
char[n]
VARCHAR[n]
int
short
long
float
double
n-byte character array
n-byte variable-length character array
integer
small integer
large integer
floating-point number
double-precision floating-point
number
NUMBER int integer
NUMBER(P,S)
(Note 2)
short
int
long
float
double
char
char[n]
VARCHAR[n]
small integer
integer
large integer
floating-point number
double-precision floating-point
number
single character
n-byte character array
n-byte variable-length character array
DATE char[n]
VARCHAR[n]
n-byte character array
n-byte variable-length character array
LONG char[n]
VARCHAR[n]
n-byte character array
n-byte variable-length character array
RAW(X)
(Note 1)
unsigned char[n]
VARCHAR[n]
n-byte character array
n-byte variable-length character array
LONG RAW unsigned char[n]
VARCHAR[n]
n-byte character array
n-byte variable-length character array
ROWID unsigned char[n]
VARCHAR[n]
n-byte character array
n-byte variable-length character array
Notes:
1. X ranges from 1 to 2000. 1 is the default value. Y ranges from 1 to 4000.
2. P ranges from 1 to 38. S ranges from -84 to 127.
One-dimensional arrays of simple C types can also serve as host variables. For char[n] and VARCHAR[n], n specifies the maximum string length, not the number of strings in the array. Two-dimensional arrays are allowed only for char[m][n] and VARCHAR[m][n], where m specifies the number of strings in the array and n specifies the maximum string length.
Pointers to simple C types are supported. Pointers to char[n] and VARCHAR[n] variables should be declared as pointer to char or VARCHAR (with no length specification). Arrays of pointers, however, are not supported.
4.2.1.1 Storage-Class Specifiers
Pro*C/C++ lets you use the auto, extern, and static storage-class specifiers when you declare host variables. However, you cannot use the register storage-class specifier to store host variables, since the precompiler takes the address of host variables by placing an ampersand (&) before them. Following the rules of C, you can use the auto storage class specifier only within a block.
To comply with the ANSI C standard, the Pro*C/C++ Precompiler provides the ability to declare an extern char[n] host variable with or without a maximum length, as the following examples shows:
extern char protocol[15];
extern char msg[];
However, you should always specify the maximum length. In the last example, if msg is an output host variable declared in one precompilation unit but defined in another, the precompiler has no way of knowing its maximum length. If you have not allocated enough storage for msg in the second precompilation unit, you might corrupt memory. (Usually, "enough" is the number of bytes in the longest column value that might be SELECTed or FETCHed into the host variable, plus one byte for a possible null terminator.)
If you neglect to specify the maximum length for an extern char[ ] host variable, the precompiler issues a warning message. The precompiler also assumes that the host variable will store a CHARACTER column value, which cannot exceed 255 characters in length. So, if you want to SELECT or FETCH a VARCHAR2 or a LONG column value of length greater than 255 characters into the host variable, you must specify a maximum length.
4.2.1.2 Type Qualifiers
You can also use the const and volatile type qualifiers when you declare host variables.
A const host variable must have a constant value, that is, your program cannot change its initial value. A volatile host variable can have its value changed in ways unknown to your program (for example, by a device attached to the system).
4.2.2 Host Variable Referencing
You use host variables in SQL data manipulation statements. A host variable must be prefixed with a colon (:) in SQL statements but must not be prefixed with a colon in C statements, as the following example shows:
char buf[15];
int emp_number;
float salary;
...
gets(buf);
emp_number = atoi(buf);
EXEC SQL SELECT sal INTO :salary FROM emp
WHERE empno = :emp_number;
Though it might be confusing, you can give a host variable the same name as an Oracle table or column, as this example shows:
int empno;
char ename[10];
float sal;
...
EXEC SQL SELECT ename, sal INTO :ename, :sal FROM emp
WHERE empno = :empno;
4.2.2.1 Restrictions
A host variable name is a C identifier, hence it must be declared and referenced in the same upper/lower case format. It cannot substitute for a column, table, or other Oracle object in a SQL statement, and must not be an Oracle reserved word.
A host variable must resolve to an address in the program. For this reason, function calls and numeric expressions cannot serve as host variables. The following code is invalid:
#define MAX_EMP_NUM 9000
...
int get_dept();
...
EXEC SQL INSERT INTO emp (empno, ename, deptno) VALUES
(:MAX_EMP_NUM + 10, 'CHEN', :get_dept());
4.3 Indicator Variables
You can associate every host variable with an optional indicator variable. An indicator variable must be defined as a 2-byte integer and, in SQL statements, must be prefixed with a colon and immediately follow its host variable (unless you use the keyword INDICATOR). If you are using Declare Sections, you must also declare indicator variables inside the Declare Sections.
This applies to relational columns, not object types.
4.3.1 The INDICATOR Keyword
To improve readability, you can precede any indicator variable with the optional keyword INDICATOR. You must still prefix the indicator variable with a colon. The correct syntax is:
:host_variable INDICATOR :indicator_variable
which is equivalent to
:host_variable:indicator_variable
You can use both forms of expression in your host program.
Possible indicator values, and their meanings, are:
Indicator Values Meanings
0 The operation was successful
-1 A NULL was returned, inserted, or updated.
-2 Output to a character host variable from a "long" type was truncated, but the original column length cannot be determined.
>0 The result of a SELECT or FETCH into a character host variable was truncated. In this case, if the host variable is a multibyte character variable, the indicator value is the original column length in characters. If the host variable is not a multibye character variable, then the indicator length is the original column length in bytes.
4.3.2 Example of INDICATOR Variable Usage
Typically, you use indicator variables to assign NULLs to input host variables and detect NULLs or truncated values in output host variables. In the example later, you declare three host variables and one indicator variable, then use a SELECT statement to search the database for an employee number matching the value of host variable emp_number. When a matching row is found, Oracle sets output host variables salary and commission to the values of columns SAL and COMM in that row and stores a return code in indicator variable ind_comm. The next statements use ind_comm to select a course of action.
EXEC SQL BEGIN DECLARE SECTION;
int emp_number;
float salary, commission;
short comm_ind; /* indicator variable */
EXEC SQL END DECLARE SECTION;
char temp[16];
float pay; /* not used in a SQL statement */
...
printf("Employee number? ");
gets(temp);
emp_number = atof(temp);
EXEC SQL SELECT SAL, COMM
INTO :salary, :commission:ind_comm
FROM EMP
WHERE EMPNO = :emp_number;
if(ind_comm == -1) /* commission is null */
pay = salary;
else
pay = salary + commission;
4.3.3 INDICATOR Variable Guidelines
The following guidelines apply to declaring and referencing indicator variables. An indicator variable must
• Be declared explicitly (in the Declare Section if present) as a 2-byte integer.
• Be prefixed with a colon (:) in SQL statements.
• Immediately follow its host variable in SQL statements and PL/SQL blocks (unless preceded by the keyword INDICATOR).
An indicator variable must not:
• Be prefixed with a colon in host language statements.
• Follow its host variable in host language statements.
• Be an Oracle reserved word.
4.3.4 Oracle Restrictions
When DBMS=V7 or V8, if you SELECT or FETCH a NULL into a host variable that has no indicator, Oracle issues the following error message:
ORA-01405: fetched column value is NULL
When precompiling with MODE=ORACLE and DBMS=V7 or V8 specified, you can specify UNSAFE_NULL=YES to disable the ORA-01405 message.
See Also:
"UNSAFE_NULL"
4.4 VARCHAR Variables
You can use the VARCHAR pseudotype to declare variable-length character strings. When your program deals with strings that are output from, or input to, VARCHAR2 or LONG columns, you might find it more convenient to use VARCHAR host variables instead of standard C strings. The datatype name VARCHAR can be uppercase or lowercase, but it cannot be mixed case. In this Guide, uppercase is used to emphasize that VARCHAR is not a native C datatype.
4.4.1 VARCHAR Variable Declaration
Think of a VARCHAR as an extended C type or pre-declared struct. For example, the precompiler expands the VARCHAR declaration
VARCHAR username[20];
into the following struct with array and length members:
struct
{
unsigned short len;
unsigned char arr[20];
} username;
The advantage of using VARCHAR variables is that you can explicitly reference the length member of the VARCHAR structure after a SELECT or FETCH. Oracle puts the length of the selected character string in the length member. You can then use this member to do things such as adding the null ('\0') terminator.
username.arr[username.len] = '\0';
or using the length in a strncpy or printf statement; for example:
printf("Username is %.*s\n", username.len, username.arr);
You specify the maximum length of a VARCHAR variable in its declaration. The length must lie in the range 1.65533. For example, the following declaration is invalid because no length is specified:
VARCHAR null_string[]; /* invalid */
The length specification holds the current length of the value stored in the array member.
You can declare multiple VARCHARs on a single line; for example:
VARCHAR emp_name[ENAME_LEN], dept_loc[DEPT_NAME_LEN];
The length specifier for a VARCHAR can be a #defined macro, or any complex expression that can be resolved to an integer at precompile time.
You can also declare pointers to VARCHAR datatypes. See the section
Note:
Do not attempt to use a typedef statement such as:
typedef VARCHAR buf[64];
This causes errors during C compilation.
4.4.2 VARCHAR Variable Referencing
In SQL statements, you reference VARCHAR variables using the struct name prefixed with a colon, as the following example shows:
...
int part_number;
VARCHAR part_desc[40];
...
main()
{
...
EXEC SQL SELECT pdesc INTO :part_desc
FROM parts
WHERE pnum = :part_number;
...
After the query is executed, part_desc.len holds the actual length of the character string retrieved from the database and stored in part_desc.arr.
In C statements, you reference VARCHAR variables using the component names, as the next example shows:
printf("\n\nEnter part description: ");
gets(part_desc.arr);
/* You must set the length of the string
before using the VARCHAR in an INSERT or UPDATE */
part_desc.len = strlen(part_desc.arr);
4.4.3 Return NULLs to a VARCHAR Variable
Oracle automatically sets the length component of a VARCHAR output host variable. If you SELECT or FETCH a NULL into a VARCHAR, the server does not change the length or array members.
Note:
If you select a NULL into a VARCHAR host variable, and there is no associated indicator variable, an ORA-01405 error occurs at run time. Avoid this by coding indicator variables with all host variables. (As a temporary fix, use the UNSAFE_NULL=YES precompiler option. See also "DBMS").
4.4.4 Insert NULLs Using VARCHAR Variables
If you set the length of a VARCHAR variable to zero before performing an UPDATE or INSERT statement, the column value is set to NULL. If the column has a NOT NULL constraint, Oracle returns an error.
4.4.5 Pass VARCHAR Variables to a Function
VARCHARs are structures, and most C compilers permit passing of structures to a function by value, and returning structures by copy out from functions. However, in Pro*C/C++ you must pass VARCHARs to functions by reference. The following example shows the correct way to pass a VARCHAR variable to a function:
VARCHAR emp_name[20];
...
emp_name.len = 20;
SELECT ename INTO :emp_name FROM emp
WHERE empno = 7499;
...
print_employee_name(&emp_name); /* pass by pointer */
...
print_employee_name(name)
VARCHAR *name;
{
...
printf("name is %.*s\n", name->len, name->arr);
...
}
4.4.6 Find the Length of the VARCHAR Array Component
When the precompiler processes a VARCHAR declaration, the actual length of the array element in the generated structure can be longer than that declared. For example, on a Sun Solaris system, the Pro*C/C++ declaration
VARCHAR my_varchar[12];
is expanded by the precompiler to
struct my_varchar
{
unsigned short len;
unsigned char arr[12];
};
However, the precompiler or the C compiler on this system pads the length of the array component to 14 bytes. This alignment requirement pads the total length of the structure to 16 bytes: 14 for the padded array and 2 bytes for the length.
The SQLVarcharGetLength() (replaces the non-threaded sqlvcp()) function—part of the SQLLIB runtime library—returns the actual (possibly padded) length of the array member.
You pass the SQLVarcharGetLength() function the length of the data for a VARCHAR host variable or a VARCHAR pointer host variable, and SQLVarcharGetLength() returns the total length of the array component of the VARCHAR. The total length includes any padding that might be added by your C compiler.
The syntax of SQLVarcharGetLength() is
SQLVarcharGetLength (dvoid *context, unsigned long *datlen, unsigned long *totlen);
For single-threaded applications, use sqlvcp(). Put the length of the VARCHAR in the datlen parameter before calling sqlvcp(). When the function returns, the totlen parameter contains the total length of the array element. Both parameters are pointers to unsigned long integers, so must be passed by reference.
See Also:
"New Names for SQLLIB Public Functions" for a discussion of these and all other SQLLIB public functions.
4.4.7 Example Program: Using sqlvcp()
The following example program shows how you can use the function in a Pro*C/C++ application. The example also uses the sqlgls() function. The example declares a VARCHAR pointer, then uses the sqlvcp() function to determine the size required for the VARCHAR buffer. The program FETCHes employee names from the EMP table and prints them. Finally, the example uses the sqlgls() function to print out the SQL statement and its function code and length attributes. This program is available on-line as sqlvcp.pc in your demo directory.
/*
* The sqlvcp.pc program demonstrates how you can use the
* sqlvcp() function to determine the actual size of a
* VARCHAR struct. The size is then used as an offset to
* increment a pointer that steps through an array of
* VARCHARs.
*
* This program also demonstrates the use of the sqlgls()
* function, to get the text of the last SQL statement executed.
* sqlgls() is described in the "Error Handling" chapter of
* The Programmer's Guide to the Oracle Pro*C/C++ Precompiler.
*/
#include <stdio.h>
#include <sqlca.h>
#include <sqlcpr.h>
/* Fake a VARCHAR pointer type. */
struct my_vc_ptr
{
unsigned short len;
unsigned char arr[32767];
};
/* Define a type for the VARCHAR pointer */
typedef struct my_vc_ptr my_vc_ptr;
my_vc_ptr *vc_ptr;
EXEC SQL BEGIN DECLARE SECTION;
VARCHAR *names;
int limit; /* for use in FETCH FOR clause */
char *username = "scott/tiger";
EXEC SQL END DECLARE SECTION;
void sql_error();
extern void sqlvcp(), sqlgls();
main()
{
unsigned int vcplen, function_code, padlen, buflen;
int i;
char stmt_buf[120];
EXEC SQL WHENEVER SQLERROR DO sql_error();
EXEC SQL CONNECT :username;
printf("\nConnected.\n");
/* Find number of rows in table. */
EXEC SQL SELECT COUNT(*) INTO :limit FROM emp;
/* Declare a cursor for the FETCH statement. */
EXEC SQL DECLARE emp_name_cursor CURSOR FOR
SELECT ename FROM emp;
EXEC SQL FOR :limit OPEN emp_name_cursor;
/* Set the desired DATA length for the VARCHAR. */
vcplen = 10;
/* Use SQLVCP to help find the length to malloc. */
sqlvcp(&vcplen, &padlen);
printf("Actual array length of VARCHAR is %ld\n", padlen);
/* Allocate the names buffer for names.
Set the limit variable for the FOR clause. */
names = (VARCHAR *) malloc((sizeof (short) +
(int) padlen) * limit);
if (names == 0)
{
printf("Memory allocation error.\n");
exit(1);
}
/* Set the maximum lengths before the FETCH.
* Note the "trick" to get an effective VARCHAR *.
*/
for (vc_ptr = (my_vc_ptr *) names, i = 0; i < limit; i++)
{
vc_ptr->len = (short) padlen;
vc_ptr = (my_vc_ptr *)((char *) vc_ptr +
padlen + sizeof (short));
}
/* Execute the FETCH. */
EXEC SQL FOR :limit FETCH emp_name_cursor INTO :names;
/* Print the results. */
printf("Employee names--\n");
for (vc_ptr = (my_vc_ptr *) names, i = 0; i < limit; i++)
{
printf
("%.*s\t(%d)\n", vc_ptr->len, vc_ptr->arr, vc_ptr->len);
vc_ptr = (my_vc_ptr *)((char *) vc_ptr +
padlen + sizeof (short));
}
/* Get statistics about the most recent
* SQL statement using SQLGLS. Note that
* the most recent statement in this example
* is not a FETCH, but rather "SELECT ENAME FROM EMP"
* (the cursor).
*/
buflen = (long) sizeof (stmt_buf);
/* The returned value should be 1, indicating no error. */
sqlgls(stmt_buf, &buflen, &function_code);
if (buflen != 0)
{
/* Print out the SQL statement. */
printf("The SQL statement was--\n%.*s\n", buflen, stmt_buf);
/* Print the returned length. */
printf("The statement length is %ld\n", buflen);
/* Print the attributes. */
printf("The function code is %ld\n", function_code);
EXEC SQL COMMIT RELEASE;
exit(0);
}
else
{
printf("The SQLGLS function returned an error.\n");
EXEC SQL ROLLBACK RELEASE;
exit(1);
}
}
void
sql_error()
{
char err_msg[512];
int buf_len, msg_len;
EXEC SQL WHENEVER SQLERROR CONTINUE;
buf_len = sizeof (err_msg);
sqlglm(err_msg, &buf_len, &msg_len);
printf("%.*s\n", msg_len, err_msg);
EXEC SQL ROLLBACK RELEASE;
exit(1);
}
4.5 Cursor Variables
You can use cursor variables in your Pro*C/C++ program for queries. A cursor variable is a handle for a cursor that must be defined and opened on the Oracle (release 7.2 or later) server, using PL/SQL. See the PL/SQL User's Guide and Reference for complete information about cursor variables.
The advantages of cursor variables are:
4.5.1 Declare a Cursor Variable
You declare a cursor variable in your Pro*C/C++ program using the Pro*C/C++ pseudotype SQL_CURSOR. For example:
EXEC SQL BEGIN DECLARE SECTION;
sql_cursor emp_cursor; /* a cursor variable */
SQL_CURSOR dept_cursor; /* another cursor variable */
sql_cursor *ecp; /* a pointer to a cursor variable */
...
EXEC SQL END DECLARE SECTION;
ecp = &emp_cursor; /* assign a value to the pointer */
You can declare a cursor variable using the type specification SQL_CURSOR, in all upper case, or sql_cursor, in all lower case; you cannot use mixed case.
A cursor variable is just like any other host variable in the Pro*C/C++ program. It has scope, following the scope rules of C. You can pass it as a parameter to other functions, even functions external to the source file in which you declared it. You can also define functions that return cursor variables, or pointers to cursor variables.
Note:
A SQL_CURSOR is implemented as a C struct in the code that Pro*C/C++ generates. So you can always pass it by pointer to another function, or return a pointer to a cursor variable from a function. But you can only pass it or return it by value if your C compiler supports these operations.
4.5.2 Allocate a Cursor Variable
Before you can use a cursor variable, either to open it or to FETCH it, you must allocate the cursor. You do this using the new precompiler command ALLOCATE. For example, to allocate the SQL_CURSOR emp_cursor that was declared in the example earlier, you write the statement:
EXEC SQL ALLOCATE :emp_cursor;
Allocating a cursor does not require a call to the server, either at precompile time or at runtime. If the ALLOCATE statement contains an error (for example, an undeclared host variable), Pro*C/C++ issues a precompile-time error. Allocating a cursor variable does cause heap memory to be used. For this reason, you can free a cursor variable in a program loop. Memory allocated for cursor variables is not freed when the cursor is closed, but only when an explicit CLOSE is executed, or the connection is closed:
EXEC SQL CLOSE :emp_cursor;
4.5.3 Open a Cursor Variable
You must open a cursor variable on the Oracle database server. You cannot use the embedded SQL OPEN command to open a cursor variable. You can open a cursor variable either by calling a PL/SQL stored procedure that opens the cursor (and defines it in the same statement). Or, you can open and define a cursor variable using an anonymous PL/SQL block in your Pro*C/C++ program.
For example, consider the following PL/SQL package, stored in the database:
CREATE PACKAGE demo_cur_pkg AS
TYPE EmpName IS RECORD (name VARCHAR2(10));
TYPE cur_type IS REF CURSOR RETURN EmpName;
PROCEDURE open_emp_cur (
curs IN OUT cur_type,
dept_num IN NUMBER);
END;
CREATE PACKAGE BODY demo_cur_pkg AS
CREATE PROCEDURE open_emp_cur (
curs IN OUT cur_type,
dept_num IN NUMBER) IS
BEGIN
OPEN curs FOR
SELECT ename FROM emp
WHERE deptno = dept_num
ORDER BY ename ASC;
END;
END;
After this package has been stored, you can open the cursor curs by calling the open_emp_cur stored procedure from your Pro*C/C++ program, and FETCH from the cursor in the program. For example:
...
sql_cursor emp_cursor;
char emp_name[11];
...
EXEC SQL ALLOCATE :emp_cursor; /* allocate the cursor variable */
...
/* Open the cursor on the server side. */
EXEC SQL EXECUTE
begin
demo_cur_pkg.open_emp_cur(:emp_cursor, :dept_num);
end;
;
EXEC SQL WHENEVER NOT FOUND DO break;
for (;;)
{
EXEC SQL FETCH :emp_cursor INTO :emp_name;
printf("%s\n", emp_name);
}
...
To open a cursor using a PL/SQL anonymous block in your Pro*C/C++ program, you define the cursor in the anonymous block. For example:
sql_cursor emp_cursor;
int dept_num = 10;
...
EXEC SQL EXECUTE
BEGIN
OPEN :emp_cursor FOR SELECT ename FROM emp
WHERE deptno = :dept_num;
END;
END-EXEC;
...
The earlier examples show how to use PL/SQL to open a cursor variable. You can also open a cursor variable using embedded SQL with the CURSOR clause:
...
sql_cursor emp_cursor;
...
EXEC ORACLE OPTION(select_error=no);
EXEC SQL
SELECT CURSOR(SELECT ename FROM emp WHERE deptno = :dept_num)
INTO :emp_cursor FROM DUAL;
EXEC ORACLE OPTION(select_error=yes);
In the statement earlier, the emp_cursor cursor variable is bound to the first column of the outermost select. The first column is itself a query, but it is represented in the form compatible with a sql_cursor host variable since the CURSOR(...) conversion clause is used.
Before using queries which involve the CURSOR clause, you must set the SELECT_ERROR option to NO. This will prevent the cancellation of the parent cursor and allow the program to run without errors.
4.5.3.1 Opening in a Standalone Stored Procedure
In the example earlier, a reference cursor was defined inside a package, and the cursor was opened in a procedure in that package. But it is not always necessary to define a reference cursor inside the package that contains the procedures that open the cursor.
If you need to open a cursor inside a standalone stored procedure, you can define the cursor in a separate package, and then reference that package in the standalone stored procedure that opens the cursor. Here is an example:
PACKAGE dummy IS
TYPE EmpName IS RECORD (name VARCHAR2(10));
TYPE emp_cursor_type IS REF CURSOR RETURN EmpName;
END;
-- and then define a standalone procedure:
PROCEDURE open_emp_curs (
emp_cursor IN OUT dummy.emp_cursor_type;
dept_num IN NUMBER) IS
BEGIN
OPEN emp_cursor FOR
SELECT ename FROM emp WHERE deptno = dept_num;
END;
END;
4.5.3.2 Return Types
When you define a reference cursor in a PL/SQL stored procedure, you must declare the type that the cursor returns. See the PL/SQL User's Guide and Reference for complete information on the reference cursor type and its return types.
4.5.4 Closing and Freeing a Cursor Variable
Use the CLOSE command to close a cursor variable. For example, to close the emp_cursor cursor variable that was OPENed in the examples earlier, use the embedded SQL statement:
EXEC SQL CLOSE :emp_cursor;
The cursor variable is a host variable, and so you must precede it with a colon.
You can reuse ALLOCATEd cursor variables. You can open, FETCH, and CLOSE as many times as needed for your application. However, if you disconnect from the server, then reconnect, you must re-ALLOCATE cursor variables.
Cursors are deallocated by the FREE embedded SQL statement. For example:
EXEC SQL FREE :emp_cursor;
If the cursor is still open, it is closed and the memory allocated for it is released.
4.5.5 Cursor Variables with the OCI (Release 7 Only)
You can share a Pro*C/C++ cursor variable with an OCI function. To do so, you must use the SQLLIB conversion functions, SQLCDAFromResultSetCursor() (formerly known as sqlcdat()) and SQLCDAToResultSetCursor (formerly known as sqlcurt()). These functions convert between OCI cursor data areas and Pro*C/C++ cursor variables.
The SQLCDAFromResultSetCursor() function translates an allocated cursor variable to an OCI cursor data area. The syntax is:
void SQLCDAFromResultSetCursor(dvoid *context, Cda_Def *cda, void *cur,
sword *retval);
where the parameters are:
Parameters Description
context A pointer to the SQLLIB runtime context.
cda A pointer to the destination OCI cursor data area.
cur A pointer to the source Pro*C/C++ cursor variable.
retval 0 if no error, otherwise a SQLLIB (SQL) error number.
Note:
In the case of an error, the V2 and rc return code fields in the CDA also receive the error codes. The rows processed count field in the CDA is not set.
For non-threaded or default context applications, pass the defined constant SQL_SINGLE_RCTX as the context.
The SQLCDAToResultSetCursor() function translates an OCI cursor data area to a Pro*C/C++ cursor variable. The syntax is:
void SQLCDAToResultSetCursor(dvoid *context, void *cur, Cda_Def *cda,
int *retval);
where the parameters are:
Parameters Description
context A pointer to the SQLLIB runtime context.
cur A pointer to the destination Pro*C/C++ cursor variable.
cda A pointer to the source OCI cursor data area.
retval 0 if no error, otherwise an error code.
Note:
The SQLCA structure is not updated by this routine. The SQLCA components are only set after a database operation is performed using the translated cursor.
For non-threaded applications, pass the defined constant SQL_SINGLE_RCTX as the context.
ANSI and K&R prototypes for these functions are provided in the sql2oci.h header file. Memory for both cda and cur must be allocated prior to calling these functions.
See Also:
"New Names for SQLLIB Public Functions" for more details on the SQLLIB Public Functions, see the table.
4.5.6 Restrictions
The following restrictions apply to the use of cursor variables:
• If you use the same cursor variable in Pro*C/C++ and OCI V7, then you must use either SQLLDAGetCurrent() or SQLLDAGetName() immediately after connecting.
• You cannot translate a cursor variable to an OCI release 8 equivalent.
• You cannot use cursor variables with dynamic SQL.
• You can only use cursor variables with the ALLOCATE, FETCH, FREE, and CLOSE commands
• The DECLARE CURSOR command does not apply to cursor variables.
• You cannot FETCH from a CLOSEd cursor variable.
• You cannot FETCH from a non-ALLOCATEd cursor variable.
• If you precompile with MODE=ANSI, it is an error to close a cursor variable that is already closed.
• You cannot use the AT clause with the ALLOCATE command, nor with the FETCH and CLOSE commands if they reference a cursor variable.
• Cursor variables cannot be stored in columns in the database.
• A cursor variable itself cannot be declared in a package specification. Only the type of the cursor variable can be declared in the package specification.
• A cursor variable cannot be a component of a PL/SQL record.
4.5.7 Example: cv_demo.sql and sample11.pc
The following example programs—a PL/SQL script and a Pro*C/C++ program—demonstrate how you can use cursor variables. These sources are available on-line in your demo directory. Also see another version of the same application, cv_demo.pc, in the demo directory.
4.5.7.1 cv_demo.sql
-- PL/SQL source for a package that declares and
-- opens a ref cursor
CONNECT SCOTT/TIGER;
CREATE OR REPLACE PACKAGE emp_demo_pkg as
TYPE emp_cur_type IS REF CURSOR RETURN emp%ROWTYPE;
PROCEDURE open_cur(curs IN OUT emp_cur_type, dno IN NUMBER);
END emp_demo_pkg;
CREATE OR REPLACE PACKAGE BODY emp_demo_pkg AS
PROCEDURE open_cur(curs IN OUT emp_cur_type, dno IN NUMBER) IS
BEGIN
OPEN curs FOR SELECT *
FROM emp WHERE deptno = dno
ORDER BY ename ASC;
END;
END emp_demo_pkg;
4.5.7.2 sample11.pc
/*
* Fetch from the EMP table, using a cursor variable.
* The cursor is opened in the stored PL/SQL procedure
* open_cur, in the EMP_DEMO_PKG package.
*
* This package is available on-line in the file
* sample11.sql, in the demo directory.
*
*/
#include <stdio.h>
#include <sqlca.h>
#include <stdlib.h>
#include <sqlda.h>
#include <sqlcpr.h>
/* Error handling function. */
void sql_error(msg)
char *msg;
{
size_t clen, fc;
char cbuf[128];
clen = sizeof (cbuf);
sqlgls((char *)cbuf, (size_t *)&clen, (size_t *)&fc);
printf("\n%s\n", msg);
printf("Statement is--\n%s\n", cbuf);
printf("Function code is %ld\n\n", fc);
sqlglm((char *)cbuf, (size_t *) &clen, (size_t *) &clen);
printf ("\n%.*s\n", clen, cbuf);
EXEC SQL WHENEVER SQLERROR CONTINUE;
EXEC SQL ROLLBACK WORK RELEASE;
exit(EXIT_FAILURE);
}
void main()
{
char temp[32];
EXEC SQL BEGIN DECLARE SECTION;
char *uid = "scott/tiger";
SQL_CURSOR emp_cursor;
int dept_num;
struct
{
int emp_num;
char emp_name[11];
char job[10];
int manager;
char hire_date[10];
float salary;
float commission;
int dept_num;
} emp_info;
struct
{
short emp_num_ind;
short emp_name_ind;
short job_ind;
short manager_ind;
short hire_date_ind;
short salary_ind;
short commission_ind;
short dept_num_ind;
} emp_info_ind;
EXEC SQL END DECLARE SECTION;
EXEC SQL WHENEVER SQLERROR do sql_error("Oracle error");
/* Connect to Oracle. */
EXEC SQL CONNECT :uid;
/* Allocate the cursor variable. */
EXEC SQL ALLOCATE :emp_cursor;
/* Exit the inner for (;;) loop when NO DATA FOUND. */
EXEC SQL WHENEVER NOT FOUND DO break;
for (;;)
{
printf("\nEnter department number (0 to exit): ");
gets(temp);
dept_num = atoi(temp);
if (dept_num <= 0)
break;
EXEC SQL EXECUTE
begin
emp_demo_pkg.open_cur(:emp_cursor, :dept_num);
end;
END-EXEC;
printf("\nFor department %d--\n", dept_num);
printf("ENAME SAL COMM\n");
printf("----- --- ----\n");
/* Fetch each row in the EMP table into the data struct.
Note the use of a parallel indicator struct. */
for (;;)
{
EXEC SQL FETCH :emp_cursor
INTO :emp_info INDICATOR :emp_info_ind;
printf("%s ", emp_info.emp_name);
printf("%8.2f ", emp_info.salary);
if (emp_info_ind.commission_ind != 0)
printf(" NULL\n");
else
printf("%8.2f\n", emp_info.commission);
}
}
/* Close the cursor. */
EXEC SQL WHENEVER SQLERROR CONTINUE;
EXEC SQL CLOSE :emp_cursor;
/* Disconnect from Oracle. */
EXEC SQL ROLLBACK WORK RELEASE;
exit(EXIT_SUCCESS);
}
4.6 CONTEXT Variables
A runtime context, usually simply called a context, is a handle to a an area in client memory which contains zero or more connections, zero or more cursors, their inline options (such as MODE, HOLD_CURSOR, RELEASE_CURSOR, SELECT_ERROR, and so on.) and other additional state information.
To define a context host variable use pseudo-type sql_context. For example:
sql_context my_context ;
Use the CONTEXT ALLOCATE precompiler directive to allocate and initialize memory for a context:
EXEC SQL CONTEXT ALLOCATE :context ;
where context is a host variable that is a handle to the context. For example:
EXEC SQL CONTEXT ALLOCATE :my_context ;
Use the CONTEXT USE precompiler directive to define which context is to be used by the embedded SQL statements (such as CONNECT, INSERT, DECLARE CURSOR, and so on.) from that point on in the source file, not in the flow of program logic. That context is used until another CONTEXT USE statement is encountered. The syntax is:
EXEC SQL CONTEXT USE {:context | DEFAULT} ;
The keyword DEFAULT specifies that the default (also known as global) context is to be used in all the embedded SQL statements that are executed subsequently, until another CONTEXT USE directive is encountered. A simple example is:
EXEC SQL CONTEXT USE :my_context ;
If the context variable my_context has not been defined and allocated already, an error is returned.
The CONTEXT FREE statement frees the memory used by the context after it is no longer needed:
EXEC SQL CONTEXT FREE :context ;
An example is:
EXEC SQL CONTEXT FREE :my_context ;
The following example demonstrates the use of a default context in the same application as a user-defined context:
CONTEXT USE Example
#include <sqlca.h>
#include <ociextp.h>
main()
{
sql_context ctx1;
char *usr1 = "scott/tiger";
char *usr2 = "system/manager";
/* Establish connection to SCOTT in global runtime context */
EXEC SQL CONNECT :usr1;
/* Establish connection to SYSTEM in runtime context ctx1 */
EXEC SQL CONTEXT ALLOCATE :ctx1;
EXEC SQL CONTEXT USE :ctx1;
EXEC SQL CONNECT :usr2;
/* Insert into the emp table from schema SCOTT */
EXEC SQL CONTEXT USE DEFAULT;
EXEC SQL INSERT INTO emp (empno, ename) VALUES (1234, 'WALKER');
...
}
4.7 Universal ROWIDs
There are two kinds of table organization used in the database server: heap tables and index-organized tables.
Heap tables are the default. This is the organization used in all tables before Oracle8. The physical row address (ROWID) is a permanent property that is used to identify a row in a heap table. The external character format of the physical ROWID is an 18-byte character string in base-64 encoding.
An index-organized table does not have physical row addresses as permanent identifiers. A logical ROWID is defined for these tables. When you use a SELECT ROWID ... statement from an index-organized table the ROWID is an opaque structure that contains the primary key of the table, control information, and an optional physical "guess". You can use this ROWID in a SQL statement containing a clause such as "WHERE ROWID = ..." to retrieve values from the table.
The universal ROWID was introduced in the Oracle 8.1 release. Universal ROWID can be used for both physical ROWID and logical ROWID. You can use universal ROWIDs to access data in heap tables, or index-organized tables, since the table organization can change with no effect on applications. The column datatype used for ROWID is UROWID(length), where length is optional.
Use the universal ROWID in all new applications.
For more information on universal ROWIDs, see Oracle Database Concepts.
Use a universal ROWID variable this way:
For example:
OCIRowid *my_urowid ;
...
EXEC SQL ALLOCATE :my_urowid ;
/* Bind my_urowid as type SQLT_RDD -- no implicit conversion */
EXEC SQL SELECT rowid INTO :my_urowid FROM my_table WHERE ... ;
...
EXEC SQL UPDATE my_table SET ... WHERE rowid = :my_urowid ;
EXEC SQL FREE my_urpwid ;
...
You also have the option of using a character host variable of width between 19 (18 bytes plus the null-terminator) and 4001 as the host bind variable for universal ROWID. Character-based universal ROWIDs are supported for heap tables only for backward compatibility. Because universal ROWID can be variable length, there can be truncation.
Use the character variable this way:
/* n is based on table characteristics */
int n=4001 ;
char my_urowid_char[n] ;
...
EXEC SQL ALLOCATE :my_urowid_char ;
/* Bind my_urowid_char as SQLT_STR */
EXEC SQL SELECT rowid INTO :my_urowid_char FROM my_table WHERE ... ;
EXEC ORACLE OPTION(CHAR_MAP=STRING);
EXEC SQL UPDATE my_table SET ... WHERE rowid = :my_urowid_char ;
EXEC SQL FREE :my_urowid_char ;
...
See Also:
"Positioned Update" for an example of a positioned update using the universal ROWID.
4.7.1 SQLRowidGet()
A SQLLIB function, SQLRowidGet(), provides the ability to retrieve a pointer to the universal ROWID of the last row inserted, updated, or selected. The function prototype and its arguments are:
void SQLRowidGet (dvoid *rctx, OCIRowid **urid) ;
rctx (IN)
is a pointer to a runtime context. For the default context or a non-threaded case, pass SQL_SINGLE_RCTX.
urid (OUT)
is a pointer to a universal ROWID pointer. When a normal execution finishes, this will point to a valid ROWID. In case of an error, NULL is returned.
Note:
The universal ROWID pointer must have been previously allocated to call SQLRowidGet(). Use FREE afterward on the universal ROWID.
4.8 Host Structures
You can use a C structure to contain host variables. You reference a structure containing host variables in the INTO clause of a SELECT or a FETCH statement, and in the VALUES list of an INSERT statement. Every component of the host structure must be a legal Pro*C/C++ host variable, as defined in Table 4-4.
When a structure is used as a host variable, only the name of the structure is used in the SQL statement. However, each of the members of the structure sends data to Oracle, or receives data from Oracle on a query. The following example shows a host structure that is used to add an employee to the EMP table:
typedef struct
{
char emp_name[11]; /* one greater than column length */
int emp_number;
int dept_number;
float salary;
} emp_record;
...
/* define a new structure of type "emp_record" */
emp_record new_employee;
strcpy(new_employee.emp_name, "CHEN");
new_employee.emp_number = 9876;
new_employee.dept_number = 20;
new_employee.salary = 4250.00;
EXEC SQL INSERT INTO emp (ename, empno, deptno, sal)
VALUES (:new_employee);
The order that the members are declared in the structure must match the order that the associated columns occur in the SQL statement, or in the database table if the column list in the INSERT statement is omitted.
For example, the following use of a host structure is invalid, and causes a runtime error:
struct
{
int empno;
float salary; /* struct components in wrong order */
char emp_name[10];
} emp_record;
...
SELECT empno, ename, sal
INTO :emp_record FROM emp;
The example is wrong because the components of the structure are not declared in the same order as the associated columns in the select list. The correct form of the SELECT statement is:
SELECT empno, sal, ename /* reverse order of sal and ename */
INTO :emp_record FROM emp;
4.8.1 Host Structures and Arrays
An array is a collection of related data items, called elements, associated with a single variable name. When declared as a host variable, the array is called a host array. Likewise, an indicator variable declared as an array is called an indicator array. An indicator array can be associated with any host array.
Host arrays can increase performance by letting you manipulate an entire collection of data items with a single SQL statement. With few exceptions, you can use host arrays wherever scalar host variables are allowed. Also, you can associate an indicator array with any host array.
For a complete discussion of host arrays, see also Chapter 8, " Host Arrays".
You can use host arrays as components of host structures. In the following example, a structure containing arrays is used to INSERT three new entries into the EMP table:
struct
{
char emp_name[3][10];
int emp_number[3];
int dept_number[3];
} emp_rec;
...
strcpy(emp_rec.emp_name[0], "ANQUETIL");
strcpy(emp_rec.emp_name[1], "MERCKX");
strcpy(emp_rec.emp_name[2], "HINAULT");
emp_rec.emp_number[0] = 1964; emp_rec.dept_number[0] = 5;
emp_rec.emp_number[1] = 1974; emp_rec.dept_number[1] = 5;
emp_rec.emp_number[2] = 1985; emp_rec.dept_number[2] = 5;
EXEC SQL INSERT INTO emp (ename, empno, deptno)
VALUES (:emp_rec);
...
4.8.2 PL/SQL Records
You cannot bind a C struct to a PL/SQL record.
4.8.3 Nested Structures and Unions
You cannot nest host structures. The following example is invalid:
struct
{
int emp_number;
struct
{
float salary;
float commission;
} sal_info; /* INVALID */
int dept_number;
} emp_record;
...
EXEC SQL SELECT empno, sal, comm, deptno
INTO :emp_record
FROM emp;
Also, you cannot use a C union as a host structure, nor can you nest a union in a structure that is to be used as a host structure.
4.8.4 Host Indicator Structures
When you need to use indicator variables, but your host variables are contained in a host structure, you set up a second structure that contains an indicator variable for each host variable in the host structure.
For example, suppose you declare a host structure student_record as follows:
struct
{
char s_name[32];
int s_id;
char grad_date[9];
} student_record;
If you want to use the host structure in a query such as
EXEC SQL SELECT student_name, student_idno, graduation_date
INTO :student_record
FROM college_enrollment
WHERE student_idno = 7200;
and you need to know if the graduation date can be NULL, then you must declare a separate host indicator structure. You declare this as
struct
{
short s_name_ind; /* indicator variables must be shorts */
short s_id_ind;
short grad_date_ind;
} student_record_ind;
Reference the indicator structure in the SQL statement in the same way that you reference a host indicator variable:
EXEC SQL SELECT student_name, student_idno, graduation_date
INTO :student_record INDICATOR :student_record_ind
FROM college_enrollment
WHERE student_idno = 7200;
When the query completes, the NULL/NOT NULL status of each selected component is available in the host indicator structure.
Note:
This Guide conventionally names indicator variables and indicator structures by appending _ind to the host variable or structure name. However, the names of indicator variables are completely arbitrary. You can adopt a different convention, or use no convention at all.
4.8.5 Example Program: Cursor and a Host Structure
The demonstration program in this section shows a query that uses an explicit cursor, selecting data into a host structure. This program is available in the file sample2.pc in your demo directory.
/*
* sample2.pc
*
* This program connects to ORACLE, declares and opens a cursor,
* fetches the names, salaries, and commissions of all
* salespeople, displays the results, then closes the cursor.
*/
#include <stdio.h>
#include <sqlca.h>
#define UNAME_LEN 20
#define PWD_LEN 40
/*
* Use the precompiler typedef'ing capability to create
* null-terminated strings for the authentication host
* variables. (This isn't really necessary--plain char *'s
* does work as well. This is just for illustration.)
*/
typedef char asciiz[PWD_LEN];
EXEC SQL TYPE asciiz IS STRING(PWD_LEN) REFERENCE;
asciiz username;
asciiz password;
struct emp_info
{
asciiz emp_name;
float salary;
float commission;
};
/* Declare function to handle unrecoverable errors. */
void sql_error();
main()
{
struct emp_info *emp_rec_ptr;
/* Allocate memory for emp_info struct. */
if ((emp_rec_ptr =
(struct emp_info *) malloc(sizeof(struct emp_info))) == 0)
{
fprintf(stderr, "Memory allocation error.\n");
exit(1);
}
/* Connect to ORACLE. */
strcpy(username, "SCOTT");
strcpy(password, "TIGER");
EXEC SQL WHENEVER SQLERROR DO sql_error("ORACLE error--");
EXEC SQL CONNECT :username IDENTIFIED BY :password;
printf("\nConnected to ORACLE as user: %s\n", username);
/* Declare the cursor. All static SQL explicit cursors
* contain SELECT commands. 'salespeople' is a SQL identifier,
* not a (C) host variable.
*/
EXEC SQL DECLARE salespeople CURSOR FOR
SELECT ENAME, SAL, COMM
FROM EMP
WHERE JOB LIKE 'SALES%';
/* Open the cursor. */
EXEC SQL OPEN salespeople;
/* Get ready to print results. */
printf("\n\nThe company's salespeople are--\n\n");
printf("Salesperson Salary Commission\n");
printf("----------- ------ ----------\n");
/* Loop, fetching all salesperson's statistics.
* Cause the program to break the loop when no more
* data can be retrieved on the cursor.
*/
EXEC SQL WHENEVER NOT FOUND DO break;
for (;;)
{
EXEC SQL FETCH salespeople INTO :emp_rec_ptr;
printf("%-11s%9.2f%13.2f\n", emp_rec_ptr->emp_name,
emp_rec_ptr->salary, emp_rec_ptr->commission);
}
/* Close the cursor. */
EXEC SQL CLOSE salespeople;
printf("\nArrivederci.\n\n");
EXEC SQL COMMIT WORK RELEASE;
exit(0);
}
void
sql_error(msg)
char *msg;
{
char err_msg[512];
int buf_len, msg_len;
EXEC SQL WHENEVER SQLERROR CONTINUE;
printf("\n%s\n", msg);
/* Call sqlglm() to get the complete text of the
* error message.
*/
buf_len = sizeof (err_msg);
sqlglm(err_msg, &buf_len, &msg_len);
printf("%.*s\n", msg_len, err_msg);
EXEC SQL ROLLBACK RELEASE;
exit(1);
}
4.9 Pointer Variables
C supports pointers, which "point" to other variables. A pointer holds the address (storage location) of a variable, not its value.
4.9.1 Pointer Variable Declaration
You define pointers as host variables following the normal C practice, as the next example shows:
int *int_ptr;
char *char_ptr;
4.9.2 Pointer Variable Referencing
In SQL statements, prefix pointers with a colon, as shown in the following example:
EXEC SQL SELECT intcol INTO :int_ptr FROM ...
Except for pointers to character strings, the size of the referenced value is given by the size of the base type specified in the declaration. For pointers to character strings, the referenced value is assumed to be a NULL-terminated string. Its size is determined at run time by calling the strlen() function. For details, see also "Globalization Support".
You can use pointers to reference the members of a struct. First, declare a pointer host variable, then set the pointer to the address of the desired member, as shown in the example later. The datatypes of the struct member and the pointer variable must be the same. Most compilers will warn you of a mismatch.
struct
{
int i;
char c;
} structvar;
int *i_ptr;
char *c_ptr;
...
main()
{
i_ptr = &structvar.i;
c_ptr = &structvar.c;
/* Use i_ptr and c_ptr in SQL statements. */
...
4.9.3 Structure Pointers
You can use a pointer to a structure as a host variable. The following example
• Declares a structure
• Declares a pointer to the structure
• Allocates memory for the structure
• Uses the struct pointer as a host variable in a query
• Dereferences the struct components to print the results
struct EMP_REC
{
int emp_number;
float salary;
};
char *name = "HINAULT";
...
struct EMP_REC *sal_rec;
sal_rec = (struct EMP_REC *) malloc(sizeof (struct EMP_REC));
...
EXEC SQL SELECT empno, sal INTO :sal_rec
FROM emp
WHERE ename = :name;
printf("Employee number and salary for %s: ", name);
printf("%d, %g\n", sal_rec->emp_number, sal_rec->salary);
In the SQL statement, pointers to host structures are referred to in exactly the same way as a host structure. The "address of" notation (&) is not required; in fact, it is an error to use it.
4.10 Globalization Support
Although the widely-used 7- or 8-bit ASCII and EBCDIC character sets are adequate to represent the Roman alphabet, some Asian languages, such as Japanese, contain thousands of characters. These languages can require at least 16 bits (two bytes) to represent each character. How does Oracle deal with such dissimilar languages?
Oracle provides Globalization Support, which lets you process single-byte and multibyte character data and convert between character sets. It also lets your applications run in different language environments. With Globalization Support, number and date formats adapt automatically to the language conventions specified for a user session. Thus, Globalization Support allows users around the world to interact with Oracle in their native languages.
You control the operation of language-dependent features by specifying various Globalization Support or NLS parameters. Default values for these parameters can be set in the Oracle initialization file. Table 4-6 shows what each Globalization Support parameter specifies.
Table 4-6 Globalization Support Parameters
Globalization Support Parameter Specifies
NLS_LANGUAGE language-dependent conventions
NLS_TERRITORY territory-dependent conventions
NLS_DATE_FORMAT date format
NLS_DATE_LANGUAGE language for day and month names
NLS_NUMERIC_CHARACTERS decimal character and group separator
NLS_CURRENCY local currency symbol
NLS_ISO_CURRENCY ISO currency symbol
NLS_SORT sort sequence
The main parameters are NLS_LANGUAGE and NLS_TERRITORY. NLS_LANGUAGE specifies the default values for language-dependent features, which include:
NLS_TERRITORY specifies the default values for territory-dependent features, which include
You can control the operation of language-dependent Globalization Support features for a user session by specifying the parameter NLS_LANG as follows:
NLS_LANG = <language>_<territory>.<character set>
where language specifies the value of NLS_LANGUAGE for the user session, territory specifies the value of NLS_TERRITORY, and character set specifies the encoding scheme used for the terminal. An encoding scheme (usually called a character set or code page) is a range of numeric codes that corresponds to the set of characters a terminal can display. It also includes codes that control communication with the terminal.
You define NLS_LANG as an environment variable (or the equivalent on your system). For example, on UNIX using the C shell, you might define NLS_LANG as follows:
setenv NLS_LANG French_France.WE8ISO8859P1
During an Oracle database session you can change the values of Globalization Support parameters. Use the ALTER SESSION statement as follows:
ALTER SESSION SET <globalization support_parameter> = <value>
Pro*C/C++ fully supports all the Globalization Support features that allow your applications to process foreign language data stored in an Oracle database. For example, you can declare foreign language character variables and pass them to string functions such as INSTRB, LENGTHB, and SUBSTRB. These functions have the same syntax as the INSTR, LENGTH, and SUBSTR functions, respectively, but operate on a byte-by-byte basis rather than a character-by-character basis.
You can use the functions NLS_INITCAP, NLS_LOWER, and NLS_UPPER to handle special instances of case conversion. And, you can use the function NLSSORT to specify WHERE-clause comparisons based on linguistic rather than binary ordering. You can even pass globalization support parameters to the TO_CHAR, TO_DATE, and TO_NUMBER functions. For more information about Globalization Support, see Oracle Database Application Developer's Guide - Fundamentals.
4.11 NCHAR Variables
Three internal database datatypes can store National Character Set data. They are NCHAR, NCLOB, and NVARCHAR2 (also known as NCHAR VARYING). You use these datatypes only in relational columns. Pro*C/C++ supported multibyte NCHAR host variables in earlier releases, with slightly different semantics.
When you set the command-line option NLS_LOCAL to YES, multibyte support with earlier semantics will be provided by SQLLIB (the letter "N" is stripped from the quoted string), as in Oracle7. SQLLIB provides blank padding and stripping, sets indicator variables, and so on.
If you set NLS_LOCAL to NO (the default), releases after Oracle7 support multibyte strings with the new semantics (the letter "N" will be concatenated in front of the quoted string). The database, rather than SQLLIB, provides blank padding and stripping, and setting of indicator variables.
Use NLS_LOCAL=NO for all new applications.
4.11.1 CHARACTER SET [IS] NCHAR_CS
To specify which host variables hold National Character Set data, insert the clause "CHARACTER SET [IS] NCHAR_CS" in character variable declarations. Then you are able to store National Character Set data in those variables. You can omit the token IS. NCHAR_CS is the name of the National Character Set.
For example:
char character set is nchar_cs *str = "<Japanese_string";
In this example, <Japanese_string> consists of Unicode characters that are in the National Character Set AL16UTF16, as defined by the variable NLS_NCHAR.
You can accomplish the same thing by entering NLS_CHAR=str on the command line, and coding in your application:
char *str = "<Japanese_string>"
Pro*C/C++ treats variables declared this way as of the character set specified by the environment variable NLS_NCHAR. The variable size of an NCHAR variable is specified as a byte count, the same way that ordinary C variables are.
To select data into str, use the following simple query:
EXEC SQL
SELECT ENAME INTO :str FROM EMP WHERE DEPT = n'<Japanese_string1>';
Or, you can use str in the following SELECT:
EXEC SQL
SELECT DEPT INTO :dept FROM DEPT_TAB WHERE ENAME = :str;
4.11.2 Environment Variable NLS_NCHAR
Pro*C/C++ supports National Character Sets with database support when NLS_LOCAL=NO. When NLS_LOCAL=NO, and the new environmental variable NLS_NCHAR is set to a valid National Character Set, the database server supports NCHAR. See NLS_NCHAR in the Oracle Database Reference.
NLS_NCHAR specifies the character set used for National Character Set data (NCHAR, NVARCHAR2, NCLOB). If it is not specified, the character set defined or indirectly defined by NLS_LANG will be used.
NLS_NCHAR must have a valid National Character Set specification (not a language name, that is set by NLS_LANG) at both precompile-time and runtime. SQLLIB performs a runtime check when the first SQL statement is executed. If the precompile-time and runtime character sets are different, SQLLIB will return an error code.
4.11.3 CONVBUFSZ Clause in VAR
You can override the default assignments by equivalencing host variables to Oracle external datatypes, using the EXEC SQL VAR statement, This is called host variable equivalencing.
The EXEC SQL VAR statement can have an optional clause: CONVBUFSZ (<size>). You specify the size, <size>, in bytes, of the buffer in the Oracle runtime library used to perform conversion of the specified host variable between character sets.
The new syntax is:
EXEC SQL VAR host_variable IS datatype [CONVBUFSZ [IS] (size)] ;
or
EXEC SQL VAR host_variable [CONVBUFSZ [IS] (size)];
where datatype is:
type_name [ ( { length | precision, scale } ) ]
See Also:
"VAR (Oracle Embedded SQL Directive) " for a complete discussion of all keywords, examples, and variables.
4.11.4 Character Strings in Embedded SQL
A multibyte character string in an embedded SQL statement consists of a character literal that identifies the string as multibyte, immediately followed by the string. The string is enclosed in the usual single quotes.
For example, an embedded SQL statement such as
EXEC SQL SELECT empno INTO :emp_num FROM emp
WHERE ename = N'<Japanese_string>';
contains a multibyte character string (<Japanese_string> could actually be Kanji), since the N character literal preceding the string identifies it as a multibyte string. Since Oracle is case-insensitive, you can use "n" or "N" in the example.
4.11.5 Strings Restrictions
You cannot use datatype equivalencing (the TYPE or VAR commands) with multibyte character strings.
Dynamic SQL method 4 is not available for multibyte character string host variables in Pro*C/C++.
4.11.6 Indicator Variables
You can use indicator variables with host character variables that are multibyte characters (as specified using the NLS_CHAR option).
|
__label__pos
| 0.880229 |
Skip to content
How does the mob get away with no estimates?
How much do you estimate to get across?
Does the mob really use no estimates?
In the time that we have done development as a mob we have done no estimates for management. We value our time as a mob highly and spending that time making guesses about how long it would take us to do something rather than using that time to accomplish that goal does not make sense.
So how do you do it you say?
Well the answer is disappointingly simple. We keep the application deployable between each feature and often deploy it as soon as any one feature is complete. Since we have tests around all of our work we have a high level of confidence in what we have created. There is a light amount of exploratory testing before we are happy with releasing the application.
Making estimated will leave you falling short…
What about hard deadlines?
We have had projects that needed to be complete by a certain date. A hard deadline. This is an interesting scenario. I have been on projects at previous companies that had similar hard deadlines and we would spend a large amount of time estimating tasks that would then get prioritization and finally worked on only to find that the estimates were wrong and some features would be cut. The inverse is to use no estimates and prioritize each feature after the next.
Can you explain how you prioritize a little more?
SURE! When we start working on a project we meet with our end user and show them what we currently have. Then we ask them what the next feature they need the most is. We may collect 2 or 3 features, then send them off and work on those. As soon as each feature is completed we ask them if the others we have are still a priority. We find that usually they have new priorities because they have been using the latest features we developed. They often ask for something completely different. In this way we steer the project toward a better result than if we had predicted and estimated all the features.
Is this approach only for the Mob?
No, you can use the no estimate approach too! Anyone can approach software this way and I recommend it. If you are estimating projects you should consider what value (if any) they bring you ultimately. Ask yourself how often have estimates been wrong? How much time did you spend up front making the estimates only to find out they were useless. Did you prioritize a feature that is rarely used over a feature that was cut just because of an estimate?
The Reason Why
Each bit of work someone does in software development should not be repeated if possible. We want to automate repetitive work. Therefore any work done by a programmer is presumably new work. This is why estimates have no value, you cannot accurately estimate something you have not done before.
Don’t need estimates if you just build it right away!
So No Estimates
It is a simple decision. Do you want to spend money on information that seems to have value but truly does not or do you want to spend your resources on more important matters? In my opinion, software development evolves at such a dramatic rate that estimates cannot be useful.
Link to other writings on No Estimates (by Woody Zuil):
http://zuill.us/WoodyZuill/category/estimating/
8 Comments
1. Aaron Griffith says:
Another common situation that happens, probably more often that most people will admit, is that at some point during the work the customer finds a third party solution that does exactly what they want. If your team spent a month, a week, or even an hour doing estimates on a project that ultimately ends up being thrown away in favor of an out of the box solution, that is waste. Needles waste on top of the waste that was actual work.
All that time spent estimating, could have been spent doing real work that actually led the customer to realize that there was already a solution or product out there that meets their needs.
2. Yehoram says:
Good post on an important topic.
I work for a company that builds systems for Insurance carriers – very complex and with long implementations cycles for customers. In fact, when the product team releases, it is not directly to customers but to a professional services team that then does customization together with the customer before going live. This results in customers not willing to take frequent releases, and forces releases to be larger and less frequent.
I have been trying to promote similar ideas to what you describe in the post, however the argument above is blocking the initiative. I am starting to think that the frequency of release is the one true measure of ‘team agility’…
3. John Galvin says:
How do you make a tradeoff as to the return on the investment if you have no measure of the cost/effort involved?
• Woody Z. says:
We can calculate the cost of an application based on the time used to do the work of developing it. We don’t need to guess this up front – we know at any point how much actual time has been spent.
If you mean to ask how decisions can get made about “which project to work on” without estimates – the “quick” answer is: we don’t use estimates to make those decisions. However, this blog is about the concept of “Mob Programming” for doing work, and it is beyond that purpose to cover the details of how decisions are made about what “project” to work on.
• Here’s how to do it with measuring effort.
There are 3 ways cost (C) and value (V) could relate:
C V – This is a project not worth doing.
You can treat developer cost as a fixed number for a given amount of time.
Let’s say it is $10000/week for 2 developers.
Now you ask – what is the potential value of this project. Let’s say it is $100,000.
Now we know that we would like to have this project done in 10 weeks with our two developers.
We can ask them to estimate their effort.
They could say 4 weeks, and the actual time needed could be 20. The result is the project gets half done, and cancelled after spending $100K, or best case, cancelled after 4 weeks for $40K. Some shops might finish the project and lose $100K
They could say 12 weeks, the actual time needed could be 4. The result is losing $60K of value.
Or we could start the project, and see how we are tracking after 4 week long iterations.
If it is tracking to completion at 20 weeks – we cancel, and lose $40K – same as best case scenario above.
If it is already complete, great – we are +60K
Without estimating the effort, we are coming out better than with faulty estimates.
As the value deliverable becomes a larger multiple of the cost, the need for estimation becomes even less. For example, if I have a feature I know will bring me $1,000,000 in value, then I should just start working on it, since I will have up two years to get weekly tracking and prediction before it is a loser.
The only place this becomes tricky is when the value of V starts to approach the value of C. Those borderline projects don’t provide much value, and need to be tightly cost controlled to the point where I would question if they were worth doing at all. If it costs me $1000 to get back $1001, there are much easier ways for me to get that dollar of profit.
4. Shoaib Ahmed says:
I can see some applicability of this approach in product development teams, in house development teams, or where the customer has committed to a set budget with a flexible scope. How would this approach work for a software development company responding to published requirements for major projects, ie government contracts. I find this approach can only work with small teams. Any comments?
• Woody Z. says:
I don’t see any reason this couldn’t be used for any software development and any size of project. However, in many situations the current state of bidding and arranging contracts for work is contrary to this approach. There are many improvements that could and should be made in the world of “major projects” and “government contracts”. The waste and failure often seen in these “larger” projects indicates to me that we should be discovering and re-inventing the typical approach taken for these efforts.
|
__label__pos
| 0.873428 |
Skip to content
@ohookins /gist:4119222
Created
Embed URL
HTTPS clone URL
Subversion checkout URL
You can clone with
or
.
Download ZIP
S3 bucket walker
#!/usr/bin/env ruby
require 'rubygems'
require 'aws-sdk'
require 'optparse'
def run(options)
# Set up credentials and buckets
s3 = AWS::S3.new({
:access_key_id => options[:key],
:secret_access_key => options[:secret]
})
bucket = s3.buckets[options[:bucket]]
# prefixes
prefixes = []
(0..9).each { |x| prefixes << x }
('a'..'z').each { |x| prefixes << x }
('A'..'Z').each { |x| prefixes << x }
prefixes.each do |prefix|
Thread.new do
retries = 0
begin
bucket.objects.with_prefix(prefix.to_s).each { |o| puts "#{o.key} #{o.last_modified}" }
rescue OpenSSL::SSL::SSLError
retries += 1
STDERR.puts "Prefix #{prefix} failed #{retries} times."
retry if retries <= 5
end
end
end
# Wait for all threads to finish.
Thread.list.each { |t| t.join unless t == Thread.current }
end
if __FILE__ == $PROGRAM_NAME
# Hide AWS credentials from process listing
$0 = $PROGRAM_NAME
# Parse command line options
options = {}
option_parser = OptionParser.new do |opts|
opts.on('-k', '--key <key>', 'AWS Key') do |k|
options[:key] = k
end
opts.on('-s', '--secret <secret>', 'AWS Secret') do |s|
options[:secret] = s
end
opts.on('-b', '--bucket <bucket>', 'Bucket to list') do |b|
options[:bucket] = b
end
end
option_parser.parse!(ARGV)
# Verify we have all the configuration files available
if [
options[:key],
options[:secret],
options[:bucket]
].include?(nil)
STDERR.puts "Need moar options!\n\n"
exit(1)
end
run(options)
end
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.
|
__label__pos
| 0.611687 |
summaryrefslogtreecommitdiffstats
path: root/src/widgets/styles/qcommonstyle.cpp
blob: bc423187d2f42343b7878fa932b457a7806c39bd (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
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtWidgets module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qcommonstyle.h"
#include "qcommonstyle_p.h"
#include <qfile.h>
#if QT_CONFIG(itemviews)
#include <qabstractitemview.h>
#endif
#include <qapplication.h>
#include <private/qguiapplication_p.h>
#include <qpa/qplatformtheme.h>
#include <qbitmap.h>
#include <qcache.h>
#if QT_CONFIG(dockwidget)
#include <qdockwidget.h>
#endif
#include <qdrawutil.h>
#if QT_CONFIG(dialogbuttonbox)
#include <qdialogbuttonbox.h>
#endif
#if QT_CONFIG(formlayout)
#include <qformlayout.h>
#else
#include <qlayout.h>
#endif
#if QT_CONFIG(groupbox)
#include <qgroupbox.h>
#endif
#include <qmath.h>
#if QT_CONFIG(menu)
#include <qmenu.h>
#endif
#include <qpainter.h>
#include <qpaintengine.h>
#include <qpainterpath.h>
#if QT_CONFIG(slider)
#include <qslider.h>
#endif
#include <qstyleoption.h>
#if QT_CONFIG(tabbar)
#include <qtabbar.h>
#endif
#if QT_CONFIG(tabwidget)
#include <qtabwidget.h>
#endif
#if QT_CONFIG(toolbar)
#include <qtoolbar.h>
#endif
#if QT_CONFIG(toolbutton)
#include <qtoolbutton.h>
#endif
#if QT_CONFIG(rubberband)
#include <qrubberband.h>
#endif
#if QT_CONFIG(treeview)
#include "qtreeview.h"
#endif
#include <private/qcommonstylepixmaps_p.h>
#include <private/qmath_p.h>
#include <qdebug.h>
#include <qtextformat.h>
#if QT_CONFIG(wizard)
#include <qwizard.h>
#endif
#if QT_CONFIG(filedialog)
#include <qsidebar_p.h>
#endif
#include <qfileinfo.h>
#include <qdir.h>
#if QT_CONFIG(settings)
#include <qsettings.h>
#endif
#include <qvariant.h>
#include <qpixmapcache.h>
#if QT_CONFIG(animation)
#include <private/qstyleanimation_p.h>
#endif
#include <limits.h>
#include <private/qtextengine_p.h>
#include <private/qstylehelper_p.h>
QT_BEGIN_NAMESPACE
static QWindow *qt_getWindow(const QWidget *widget)
{
return widget ? widget->window()->windowHandle() : 0;
}
/*!
\class QCommonStyle
\brief The QCommonStyle class encapsulates the common Look and Feel of a GUI.
\ingroup appearance
\inmodule QtWidgets
This abstract class implements some of the widget's look and feel
that is common to all GUI styles provided and shipped as part of
Qt.
Since QCommonStyle inherits QStyle, all of its functions are fully documented
in the QStyle documentation.
\omit
, although the
extra functions that QCommonStyle provides, e.g.
drawComplexControl(), drawControl(), drawPrimitive(),
hitTestComplexControl(), subControlRect(), sizeFromContents(), and
subElementRect() are documented here.
\endomit
\sa QStyle, QProxyStyle
*/
/*!
Constructs a QCommonStyle.
*/
QCommonStyle::QCommonStyle()
: QStyle(*new QCommonStylePrivate)
{ }
/*! \internal
*/
QCommonStyle::QCommonStyle(QCommonStylePrivate &dd)
: QStyle(dd)
{ }
/*!
Destroys the style.
*/
QCommonStyle::~QCommonStyle()
{ }
/*!
\reimp
*/
void QCommonStyle::drawPrimitive(PrimitiveElement pe, const QStyleOption *opt, QPainter *p,
const QWidget *widget) const
{
Q_D(const QCommonStyle);
switch (pe) {
case PE_FrameButtonBevel:
case PE_FrameButtonTool:
qDrawShadeRect(p, opt->rect, opt->palette,
opt->state & (State_Sunken | State_On), 1, 0);
break;
case PE_PanelButtonCommand:
case PE_PanelButtonBevel:
case PE_PanelButtonTool:
case PE_IndicatorButtonDropDown:
qDrawShadePanel(p, opt->rect, opt->palette,
opt->state & (State_Sunken | State_On), 1,
&opt->palette.brush(QPalette::Button));
break;
case PE_IndicatorItemViewItemCheck:
proxy()->drawPrimitive(PE_IndicatorCheckBox, opt, p, widget);
break;
case PE_IndicatorCheckBox:
if (opt->state & State_NoChange) {
p->setPen(opt->palette.windowText().color());
p->fillRect(opt->rect, opt->palette.brush(QPalette::Button));
p->drawRect(opt->rect);
p->drawLine(opt->rect.topLeft(), opt->rect.bottomRight());
} else {
qDrawShadePanel(p, opt->rect.x(), opt->rect.y(), opt->rect.width(), opt->rect.height(),
opt->palette, opt->state & (State_Sunken | State_On), 1,
&opt->palette.brush(QPalette::Button));
}
break;
case PE_IndicatorRadioButton: {
QRect ir = opt->rect;
p->setPen(opt->palette.dark().color());
p->drawArc(opt->rect, 0, 5760);
if (opt->state & (State_Sunken | State_On)) {
ir.adjust(2, 2, -2, -2);
p->setBrush(opt->palette.windowText());
bool oldQt4CompatiblePainting = p->testRenderHint(QPainter::Qt4CompatiblePainting);
p->setRenderHint(QPainter::Qt4CompatiblePainting);
p->drawEllipse(ir);
p->setRenderHint(QPainter::Qt4CompatiblePainting, oldQt4CompatiblePainting);
}
break; }
case PE_FrameFocusRect:
if (const QStyleOptionFocusRect *fropt = qstyleoption_cast<const QStyleOptionFocusRect *>(opt)) {
QColor bg = fropt->backgroundColor;
QPen oldPen = p->pen();
if (bg.isValid()) {
int h, s, v;
bg.getHsv(&h, &s, &v);
if (v >= 128)
p->setPen(Qt::black);
else
p->setPen(Qt::white);
} else {
p->setPen(opt->palette.windowText().color());
}
QRect focusRect = opt->rect.adjusted(1, 1, -1, -1);
p->drawRect(focusRect.adjusted(0, 0, -1, -1)); //draw pen inclusive
p->setPen(oldPen);
}
break;
case PE_IndicatorMenuCheckMark: {
const int markW = opt->rect.width() > 7 ? 7 : opt->rect.width();
const int markH = markW;
int posX = opt->rect.x() + (opt->rect.width() - markW)/2 + 1;
int posY = opt->rect.y() + (opt->rect.height() - markH)/2;
QVector<QLineF> a;
a.reserve(markH);
int i, xx, yy;
xx = posX;
yy = 3 + posY;
for (i = 0; i < markW/2; ++i) {
a << QLineF(xx, yy, xx, yy + 2);
++xx;
++yy;
}
yy -= 2;
for (; i < markH; ++i) {
a << QLineF(xx, yy, xx, yy + 2);
++xx;
--yy;
}
if (!(opt->state & State_Enabled) && !(opt->state & State_On)) {
p->save();
p->translate(1, 1);
p->setPen(opt->palette.light().color());
p->drawLines(a);
p->restore();
}
p->setPen((opt->state & State_On) ? opt->palette.highlightedText().color() : opt->palette.text().color());
p->drawLines(a);
break; }
case PE_Frame:
case PE_FrameMenu:
if (const QStyleOptionFrame *frame = qstyleoption_cast<const QStyleOptionFrame *>(opt)) {
if (pe == PE_FrameMenu || (frame->state & State_Sunken) || (frame->state & State_Raised)) {
qDrawShadePanel(p, frame->rect, frame->palette, frame->state & State_Sunken,
frame->lineWidth);
} else {
qDrawPlainRect(p, frame->rect, frame->palette.windowText().color(), frame->lineWidth);
}
}
break;
#if QT_CONFIG(toolbar)
case PE_PanelMenuBar:
if (widget && qobject_cast<QToolBar *>(widget->parentWidget()))
break;
if (const QStyleOptionFrame *frame = qstyleoption_cast<const QStyleOptionFrame *>(opt)){
qDrawShadePanel(p, frame->rect, frame->palette, false, frame->lineWidth,
&frame->palette.brush(QPalette::Button));
}
else if (const QStyleOptionToolBar *frame = qstyleoption_cast<const QStyleOptionToolBar *>(opt)){
qDrawShadePanel(p, frame->rect, frame->palette, false, frame->lineWidth,
&frame->palette.brush(QPalette::Button));
}
break;
case PE_PanelMenu:
break;
case PE_PanelToolBar:
break;
#endif // QT_CONFIG(toolbar)
#if QT_CONFIG(progressbar)
case PE_IndicatorProgressChunk:
{
bool vertical = false;
if (const QStyleOptionProgressBar *pb = qstyleoption_cast<const QStyleOptionProgressBar *>(opt))
vertical = pb->orientation == Qt::Vertical;
if (!vertical) {
p->fillRect(opt->rect.x(), opt->rect.y() + 3, opt->rect.width() -2, opt->rect.height() - 6,
opt->palette.brush(QPalette::Highlight));
} else {
p->fillRect(opt->rect.x() + 2, opt->rect.y(), opt->rect.width() -6, opt->rect.height() - 2,
opt->palette.brush(QPalette::Highlight));
}
}
break;
#endif // QT_CONFIG(progressbar)
case PE_IndicatorBranch: {
static const int decoration_size = 9;
int mid_h = opt->rect.x() + opt->rect.width() / 2;
int mid_v = opt->rect.y() + opt->rect.height() / 2;
int bef_h = mid_h;
int bef_v = mid_v;
int aft_h = mid_h;
int aft_v = mid_v;
if (opt->state & State_Children) {
int delta = decoration_size / 2;
bef_h -= delta;
bef_v -= delta;
aft_h += delta;
aft_v += delta;
p->drawLine(bef_h + 2, bef_v + 4, bef_h + 6, bef_v + 4);
if (!(opt->state & State_Open))
p->drawLine(bef_h + 4, bef_v + 2, bef_h + 4, bef_v + 6);
QPen oldPen = p->pen();
p->setPen(opt->palette.dark().color());
p->drawRect(bef_h, bef_v, decoration_size - 1, decoration_size - 1);
p->setPen(oldPen);
}
QBrush brush(opt->palette.dark().color(), Qt::Dense4Pattern);
if (opt->state & State_Item) {
if (opt->direction == Qt::RightToLeft)
p->fillRect(opt->rect.left(), mid_v, bef_h - opt->rect.left(), 1, brush);
else
p->fillRect(aft_h, mid_v, opt->rect.right() - aft_h + 1, 1, brush);
}
if (opt->state & State_Sibling)
p->fillRect(mid_h, aft_v, 1, opt->rect.bottom() - aft_v + 1, brush);
if (opt->state & (State_Open | State_Children | State_Item | State_Sibling))
p->fillRect(mid_h, opt->rect.y(), 1, bef_v - opt->rect.y(), brush);
break; }
case PE_FrameStatusBarItem:
qDrawShadeRect(p, opt->rect, opt->palette, true, 1, 0, 0);
break;
case PE_IndicatorHeaderArrow:
if (const QStyleOptionHeader *header = qstyleoption_cast<const QStyleOptionHeader *>(opt)) {
QPen oldPen = p->pen();
if (header->sortIndicator & QStyleOptionHeader::SortUp) {
p->setPen(QPen(opt->palette.light(), 0));
p->drawLine(opt->rect.x() + opt->rect.width(), opt->rect.y(),
opt->rect.x() + opt->rect.width() / 2, opt->rect.y() + opt->rect.height());
p->setPen(QPen(opt->palette.dark(), 0));
const QPoint points[] = {
QPoint(opt->rect.x() + opt->rect.width() / 2, opt->rect.y() + opt->rect.height()),
QPoint(opt->rect.x(), opt->rect.y()),
QPoint(opt->rect.x() + opt->rect.width(), opt->rect.y()),
};
p->drawPolyline(points, sizeof points / sizeof *points);
} else if (header->sortIndicator & QStyleOptionHeader::SortDown) {
p->setPen(QPen(opt->palette.light(), 0));
const QPoint points[] = {
QPoint(opt->rect.x(), opt->rect.y() + opt->rect.height()),
QPoint(opt->rect.x() + opt->rect.width(), opt->rect.y() + opt->rect.height()),
QPoint(opt->rect.x() + opt->rect.width() / 2, opt->rect.y()),
};
p->drawPolyline(points, sizeof points / sizeof *points);
p->setPen(QPen(opt->palette.dark(), 0));
p->drawLine(opt->rect.x(), opt->rect.y() + opt->rect.height(),
opt->rect.x() + opt->rect.width() / 2, opt->rect.y());
}
p->setPen(oldPen);
}
break;
#if QT_CONFIG(tabbar)
case PE_FrameTabBarBase:
if (const QStyleOptionTabBarBase *tbb
= qstyleoption_cast<const QStyleOptionTabBarBase *>(opt)) {
p->save();
switch (tbb->shape) {
case QTabBar::RoundedNorth:
case QTabBar::TriangularNorth:
p->setPen(QPen(tbb->palette.light(), 0));
p->drawLine(tbb->rect.topLeft(), tbb->rect.topRight());
break;
case QTabBar::RoundedWest:
case QTabBar::TriangularWest:
p->setPen(QPen(tbb->palette.light(), 0));
p->drawLine(tbb->rect.topLeft(), tbb->rect.bottomLeft());
break;
case QTabBar::RoundedSouth:
case QTabBar::TriangularSouth:
p->setPen(QPen(tbb->palette.shadow(), 0));
p->drawLine(tbb->rect.left(), tbb->rect.bottom(),
tbb->rect.right(), tbb->rect.bottom());
p->setPen(QPen(tbb->palette.dark(), 0));
p->drawLine(tbb->rect.left(), tbb->rect.bottom() - 1,
tbb->rect.right() - 1, tbb->rect.bottom() - 1);
break;
case QTabBar::RoundedEast:
case QTabBar::TriangularEast:
p->setPen(QPen(tbb->palette.dark(), 0));
p->drawLine(tbb->rect.topRight(), tbb->rect.bottomRight());
break;
}
p->restore();
}
break;
case PE_IndicatorTabClose: {
if (d->tabBarcloseButtonIcon.isNull()) {
d->tabBarcloseButtonIcon.addPixmap(QPixmap(
QLatin1String(":/qt-project.org/styles/commonstyle/images/standardbutton-closetab-16.png")),
QIcon::Normal, QIcon::Off);
d->tabBarcloseButtonIcon.addPixmap(QPixmap(
QLatin1String(":/qt-project.org/styles/commonstyle/images/standardbutton-closetab-down-16.png")),
QIcon::Normal, QIcon::On);
d->tabBarcloseButtonIcon.addPixmap(QPixmap(
QLatin1String(":/qt-project.org/styles/commonstyle/images/standardbutton-closetab-hover-16.png")),
QIcon::Active, QIcon::Off);
}
int size = proxy()->pixelMetric(QStyle::PM_SmallIconSize);
QIcon::Mode mode = opt->state & State_Enabled ?
(opt->state & State_Raised ? QIcon::Active : QIcon::Normal)
: QIcon::Disabled;
if (!(opt->state & State_Raised)
&& !(opt->state & State_Sunken)
&& !(opt->state & QStyle::State_Selected))
mode = QIcon::Disabled;
QIcon::State state = opt->state & State_Sunken ? QIcon::On : QIcon::Off;
QPixmap pixmap = d->tabBarcloseButtonIcon.pixmap(qt_getWindow(widget), QSize(size, size), mode, state);
proxy()->drawItemPixmap(p, opt->rect, Qt::AlignCenter, pixmap);
break;
}
#else
Q_UNUSED(d);
#endif // QT_CONFIG(tabbar)
case PE_FrameTabWidget:
case PE_FrameWindow:
qDrawWinPanel(p, opt->rect, opt->palette, false, 0);
break;
case PE_FrameLineEdit:
proxy()->drawPrimitive(PE_Frame, opt, p, widget);
break;
#if QT_CONFIG(groupbox)
case PE_FrameGroupBox:
if (const QStyleOptionFrame *frame = qstyleoption_cast<const QStyleOptionFrame *>(opt)) {
if (frame->features & QStyleOptionFrame::Flat) {
QRect fr = frame->rect;
QPoint p1(fr.x(), fr.y() + 1);
QPoint p2(fr.x() + fr.width(), p1.y());
qDrawShadeLine(p, p1, p2, frame->palette, true,
frame->lineWidth, frame->midLineWidth);
} else {
qDrawShadeRect(p, frame->rect.x(), frame->rect.y(), frame->rect.width(),
frame->rect.height(), frame->palette, true,
frame->lineWidth, frame->midLineWidth);
}
}
break;
#endif // QT_CONFIG(groupbox)
#if QT_CONFIG(dockwidget)
case PE_FrameDockWidget:
if (const QStyleOptionFrame *frame = qstyleoption_cast<const QStyleOptionFrame *>(opt)) {
int lw = frame->lineWidth;
if (lw <= 0)
lw = proxy()->pixelMetric(PM_DockWidgetFrameWidth);
qDrawShadePanel(p, frame->rect, frame->palette, false, lw);
}
break;
#endif // QT_CONFIG(dockwidget)
#if QT_CONFIG(toolbar)
case PE_IndicatorToolBarHandle:
p->save();
p->translate(opt->rect.x(), opt->rect.y());
if (opt->state & State_Horizontal) {
int x = opt->rect.width() / 3;
if (opt->direction == Qt::RightToLeft)
x -= 2;
if (opt->rect.height() > 4) {
qDrawShadePanel(p, x, 2, 3, opt->rect.height() - 4,
opt->palette, false, 1, 0);
qDrawShadePanel(p, x+3, 2, 3, opt->rect.height() - 4,
opt->palette, false, 1, 0);
}
} else {
if (opt->rect.width() > 4) {
int y = opt->rect.height() / 3;
qDrawShadePanel(p, 2, y, opt->rect.width() - 4, 3,
opt->palette, false, 1, 0);
qDrawShadePanel(p, 2, y+3, opt->rect.width() - 4, 3,
opt->palette, false, 1, 0);
}
}
p->restore();
break;
case PE_IndicatorToolBarSeparator:
{
QPoint p1, p2;
if (opt->state & State_Horizontal) {
p1 = QPoint(opt->rect.width()/2, 0);
p2 = QPoint(p1.x(), opt->rect.height());
} else {
p1 = QPoint(0, opt->rect.height()/2);
p2 = QPoint(opt->rect.width(), p1.y());
}
qDrawShadeLine(p, p1, p2, opt->palette, 1, 1, 0);
break;
}
#endif // QT_CONFIG(toolbar)
#if QT_CONFIG(spinbox)
case PE_IndicatorSpinPlus:
case PE_IndicatorSpinMinus: {
QRect r = opt->rect;
int fw = proxy()->pixelMetric(PM_DefaultFrameWidth, opt, widget);
QRect br = r.adjusted(fw, fw, -fw, -fw);
int offset = (opt->state & State_Sunken) ? 1 : 0;
int step = (br.width() + 4) / 5;
p->fillRect(br.x() + offset, br.y() + offset +br.height() / 2 - step / 2,
br.width(), step,
opt->palette.buttonText());
if (pe == PE_IndicatorSpinPlus)
p->fillRect(br.x() + br.width() / 2 - step / 2 + offset, br.y() + offset,
step, br.height(),
opt->palette.buttonText());
break; }
case PE_IndicatorSpinUp:
case PE_IndicatorSpinDown: {
QRect r = opt->rect;
int fw = proxy()->pixelMetric(PM_DefaultFrameWidth, opt, widget);
// QRect br = r.adjusted(fw, fw, -fw, -fw);
int x = r.x(), y = r.y(), w = r.width(), h = r.height();
int sw = w-4;
if (sw < 3)
break;
else if (!(sw & 1))
sw--;
sw -= (sw / 7) * 2; // Empty border
int sh = sw/2 + 2; // Must have empty row at foot of arrow
int sx = x + w / 2 - sw / 2;
int sy = y + h / 2 - sh / 2;
if (pe == PE_IndicatorSpinUp && fw)
--sy;
int bsx = 0;
int bsy = 0;
if (opt->state & State_Sunken) {
bsx = proxy()->pixelMetric(PM_ButtonShiftHorizontal);
bsy = proxy()->pixelMetric(PM_ButtonShiftVertical);
}
p->save();
p->translate(sx + bsx, sy + bsy);
p->setPen(opt->palette.buttonText().color());
p->setBrush(opt->palette.buttonText());
p->setRenderHint(QPainter::Qt4CompatiblePainting);
if (pe == PE_IndicatorSpinDown) {
const QPoint points[] = { QPoint(0, 1), QPoint(sw-1, 1), QPoint(sh-2, sh-1) };
p->drawPolygon(points, sizeof points / sizeof *points);
} else {
const QPoint points[] = { QPoint(0, sh-1), QPoint(sw-1, sh-1), QPoint(sh-2, 1) };
p->drawPolygon(points, sizeof points / sizeof *points);
}
p->restore();
break; }
#endif // QT_CONFIG(spinbox)
case PE_PanelTipLabel: {
const QBrush brush(opt->palette.toolTipBase());
qDrawPlainRect(p, opt->rect, opt->palette.toolTipText().color(), 1, &brush);
break;
}
#if QT_CONFIG(tabbar)
case PE_IndicatorTabTear:
if (const QStyleOptionTab *tab = qstyleoption_cast<const QStyleOptionTab *>(opt)) {
bool rtl = tab->direction == Qt::RightToLeft;
const bool horizontal = tab->rect.height() > tab->rect.width();
const int margin = 4;
QPainterPath path;
if (horizontal) {
QRect rect = tab->rect.adjusted(rtl ? margin : 0, 0, rtl ? 1 : -margin, 0);
rect.setTop(rect.top() + ((tab->state & State_Selected) ? 1 : 3));
rect.setBottom(rect.bottom() - ((tab->state & State_Selected) ? 0 : 2));
path.moveTo(QPoint(rtl ? rect.right() : rect.left(), rect.top()));
int count = 4;
for (int jags = 1; jags <= count; ++jags, rtl = !rtl)
path.lineTo(QPoint(rtl ? rect.left() : rect.right(), rect.top() + jags * rect.height()/count));
} else {
QRect rect = tab->rect.adjusted(0, 0, 0, -margin);
rect.setLeft(rect.left() + ((tab->state & State_Selected) ? 1 : 3));
rect.setRight(rect.right() - ((tab->state & State_Selected) ? 0 : 2));
path.moveTo(QPoint(rect.left(), rect.top()));
int count = 4;
for (int jags = 1; jags <= count; ++jags, rtl = !rtl)
path.lineTo(QPoint(rect.left() + jags * rect.width()/count, rtl ? rect.top() : rect.bottom()));
}
p->setPen(QPen(tab->palette.dark(), qreal(.8)));
p->setBrush(tab->palette.window());
p->setRenderHint(QPainter::Antialiasing);
p->drawPath(path);
}
break;
#endif // QT_CONFIG(tabbar)
#if QT_CONFIG(lineedit)
case PE_PanelLineEdit:
if (const QStyleOptionFrame *panel = qstyleoption_cast<const QStyleOptionFrame *>(opt)) {
p->fillRect(panel->rect.adjusted(panel->lineWidth, panel->lineWidth, -panel->lineWidth, -panel->lineWidth),
panel->palette.brush(QPalette::Base));
if (panel->lineWidth > 0)
proxy()->drawPrimitive(PE_FrameLineEdit, panel, p, widget);
}
break;
#endif // QT_CONFIG(lineedit)
#if QT_CONFIG(columnview)
case PE_IndicatorColumnViewArrow: {
if (const QStyleOptionViewItem *viewOpt = qstyleoption_cast<const QStyleOptionViewItem *>(opt)) {
bool reverse = (viewOpt->direction == Qt::RightToLeft);
p->save();
QPainterPath path;
int x = viewOpt->rect.x() + 1;
int offset = (viewOpt->rect.height() / 3);
int height = (viewOpt->rect.height()) - offset * 2;
if (height % 2 == 1)
--height;
int x2 = x + height - 1;
if (reverse) {
x = viewOpt->rect.x() + viewOpt->rect.width() - 1;
x2 = x - height + 1;
}
path.moveTo(x, viewOpt->rect.y() + offset);
path.lineTo(x, viewOpt->rect.y() + offset + height);
path.lineTo(x2, viewOpt->rect.y() + offset+height/2);
path.closeSubpath();
if (viewOpt->state & QStyle::State_Selected ) {
if (viewOpt->showDecorationSelected) {
QColor color = viewOpt->palette.color(QPalette::Active, QPalette::HighlightedText);
p->setPen(color);
p->setBrush(color);
} else {
QColor color = viewOpt->palette.color(QPalette::Active, QPalette::WindowText);
p->setPen(color);
p->setBrush(color);
}
} else {
QColor color = viewOpt->palette.color(QPalette::Active, QPalette::Mid);
p->setPen(color);
p->setBrush(color);
}
p->drawPath(path);
// draw the vertical and top triangle line
if (!(viewOpt->state & QStyle::State_Selected)) {
QPainterPath lines;
lines.moveTo(x, viewOpt->rect.y() + offset);
lines.lineTo(x, viewOpt->rect.y() + offset + height);
lines.moveTo(x, viewOpt->rect.y() + offset);
lines.lineTo(x2, viewOpt->rect.y() + offset+height/2);
QColor color = viewOpt->palette.color(QPalette::Active, QPalette::Dark);
p->setPen(color);
p->drawPath(lines);
}
p->restore();
}
break; }
#endif //QT_CONFIG(columnview)
case PE_IndicatorItemViewItemDrop: {
QRect rect = opt->rect;
if (opt->rect.height() == 0)
p->drawLine(rect.topLeft(), rect.topRight());
else
p->drawRect(rect);
break; }
#if QT_CONFIG(itemviews)
case PE_PanelItemViewRow:
if (const QStyleOptionViewItem *vopt = qstyleoption_cast<const QStyleOptionViewItem *>(opt)) {
QPalette::ColorGroup cg = (widget ? widget->isEnabled() : (vopt->state & QStyle::State_Enabled))
? QPalette::Normal : QPalette::Disabled;
if (cg == QPalette::Normal && !(vopt->state & QStyle::State_Active))
cg = QPalette::Inactive;
if ((vopt->state & QStyle::State_Selected) && proxy()->styleHint(QStyle::SH_ItemView_ShowDecorationSelected, opt, widget))
p->fillRect(vopt->rect, vopt->palette.brush(cg, QPalette::Highlight));
else if (vopt->features & QStyleOptionViewItem::Alternate)
p->fillRect(vopt->rect, vopt->palette.brush(cg, QPalette::AlternateBase));
}
break;
case PE_PanelItemViewItem:
if (const QStyleOptionViewItem *vopt = qstyleoption_cast<const QStyleOptionViewItem *>(opt)) {
QPalette::ColorGroup cg = (widget ? widget->isEnabled() : (vopt->state & QStyle::State_Enabled))
? QPalette::Normal : QPalette::Disabled;
if (cg == QPalette::Normal && !(vopt->state & QStyle::State_Active))
cg = QPalette::Inactive;
if (vopt->showDecorationSelected && (vopt->state & QStyle::State_Selected)) {
p->fillRect(vopt->rect, vopt->palette.brush(cg, QPalette::Highlight));
} else {
if (vopt->backgroundBrush.style() != Qt::NoBrush) {
QPointF oldBO = p->brushOrigin();
p->setBrushOrigin(vopt->rect.topLeft());
p->fillRect(vopt->rect, vopt->backgroundBrush);
p->setBrushOrigin(oldBO);
}
if (vopt->state & QStyle::State_Selected) {
QRect textRect = subElementRect(QStyle::SE_ItemViewItemText, opt, widget);
p->fillRect(textRect, vopt->palette.brush(cg, QPalette::Highlight));
}
}
}
break;
#endif // QT_CONFIG(itemviews)
case PE_PanelScrollAreaCorner: {
const QBrush brush(opt->palette.brush(QPalette::Window));
p->fillRect(opt->rect, brush);
} break;
case PE_IndicatorArrowUp:
case PE_IndicatorArrowDown:
case PE_IndicatorArrowRight:
case PE_IndicatorArrowLeft:
{
if (opt->rect.width() <= 1 || opt->rect.height() <= 1)
break;
QRect r = opt->rect;
int size = qMin(r.height(), r.width());
QPixmap pixmap;
QString pixmapName = QStyleHelper::uniqueName(QLatin1String("$qt_ia-")
% QLatin1String(metaObject()->className()), opt, QSize(size, size))
% HexString<uint>(pe);
if (!QPixmapCache::find(pixmapName, &pixmap)) {
qreal pixelRatio = p->device()->devicePixelRatioF();
int border = qRound(pixelRatio*(size/5));
int sqsize = qRound(pixelRatio*(2*(size/2)));
QImage image(sqsize, sqsize, QImage::Format_ARGB32_Premultiplied);
image.fill(0);
QPainter imagePainter(&image);
QPolygon a;
switch (pe) {
case PE_IndicatorArrowUp:
a.setPoints(3, border, sqsize/2, sqsize/2, border, sqsize - border, sqsize/2);
break;
case PE_IndicatorArrowDown:
a.setPoints(3, border, sqsize/2, sqsize/2, sqsize - border, sqsize - border, sqsize/2);
break;
case PE_IndicatorArrowRight:
a.setPoints(3, sqsize - border, sqsize/2, sqsize/2, border, sqsize/2, sqsize - border);
break;
case PE_IndicatorArrowLeft:
a.setPoints(3, border, sqsize/2, sqsize/2, border, sqsize/2, sqsize - border);
break;
default:
break;
}
int bsx = 0;
int bsy = 0;
if (opt->state & State_Sunken) {
bsx = proxy()->pixelMetric(PM_ButtonShiftHorizontal, opt, widget);
bsy = proxy()->pixelMetric(PM_ButtonShiftVertical, opt, widget);
}
QRect bounds = a.boundingRect();
int sx = sqsize / 2 - bounds.center().x() - 1;
int sy = sqsize / 2 - bounds.center().y() - 1;
imagePainter.translate(sx + bsx, sy + bsy);
imagePainter.setPen(opt->palette.buttonText().color());
imagePainter.setBrush(opt->palette.buttonText());
imagePainter.setRenderHint(QPainter::Qt4CompatiblePainting);
if (!(opt->state & State_Enabled)) {
imagePainter.translate(1, 1);
imagePainter.setBrush(opt->palette.light().color());
imagePainter.setPen(opt->palette.light().color());
imagePainter.drawPolygon(a);
imagePainter.translate(-1, -1);
imagePainter.setBrush(opt->palette.mid().color());
imagePainter.setPen(opt->palette.mid().color());
}
imagePainter.drawPolygon(a);
imagePainter.end();
pixmap = QPixmap::fromImage(image);
pixmap.setDevicePixelRatio(pixelRatio);
QPixmapCache::insert(pixmapName, pixmap);
}
int xOffset = r.x() + (r.width() - size)/2;
int yOffset = r.y() + (r.height() - size)/2;
p->drawPixmap(xOffset, yOffset, pixmap);
}
break;
default:
break;
}
}
#if QT_CONFIG(toolbutton)
static void drawArrow(const QStyle *style, const QStyleOptionToolButton *toolbutton,
const QRect &rect, QPainter *painter, const QWidget *widget = 0)
{
QStyle::PrimitiveElement pe;
switch (toolbutton->arrowType) {
case Qt::LeftArrow:
pe = QStyle::PE_IndicatorArrowLeft;
break;
case Qt::RightArrow:
pe = QStyle::PE_IndicatorArrowRight;
break;
case Qt::UpArrow:
pe = QStyle::PE_IndicatorArrowUp;
break;
case Qt::DownArrow:
pe = QStyle::PE_IndicatorArrowDown;
break;
default:
return;
}
QStyleOption arrowOpt = *toolbutton;
arrowOpt.rect = rect;
style->drawPrimitive(pe, &arrowOpt, painter, widget);
}
#endif // QT_CONFIG(toolbutton)
static QSizeF viewItemTextLayout(QTextLayout &textLayout, int lineWidth, int maxHeight = -1, int *lastVisibleLine = nullptr)
{
if (lastVisibleLine)
*lastVisibleLine = -1;
qreal height = 0;
qreal widthUsed = 0;
textLayout.beginLayout();
int i = 0;
while (true) {
QTextLine line = textLayout.createLine();
if (!line.isValid())
break;
line.setLineWidth(lineWidth);
line.setPosition(QPointF(0, height));
height += line.height();
widthUsed = qMax(widthUsed, line.naturalTextWidth());
// we assume that the height of the next line is the same as the current one
if (maxHeight > 0 && lastVisibleLine && height + line.height() > maxHeight) {
const QTextLine nextLine = textLayout.createLine();
*lastVisibleLine = nextLine.isValid() ? i : -1;
break;
}
++i;
}
textLayout.endLayout();
return QSizeF(widthUsed, height);
}
QString QCommonStylePrivate::calculateElidedText(const QString &text, const QTextOption &textOption,
const QFont &font, const QRect &textRect, const Qt::Alignment valign,
Qt::TextElideMode textElideMode, int flags,
bool lastVisibleLineShouldBeElided, QPointF *paintStartPosition) const
{
QTextLayout textLayout(text, font);
textLayout.setTextOption(textOption);
// In AlignVCenter mode when more than one line is displayed and the height only allows
// some of the lines it makes no sense to display those. From a users perspective it makes
// more sense to see the start of the text instead something inbetween.
const bool vAlignmentOptimization = paintStartPosition && valign.testFlag(Qt::AlignVCenter);
int lastVisibleLine = -1;
viewItemTextLayout(textLayout, textRect.width(), vAlignmentOptimization ? textRect.height() : -1, &lastVisibleLine);
const QRectF boundingRect = textLayout.boundingRect();
// don't care about LTR/RTL here, only need the height
const QRect layoutRect = QStyle::alignedRect(Qt::LayoutDirectionAuto, valign,
boundingRect.size().toSize(), textRect);
if (paintStartPosition)
*paintStartPosition = QPointF(textRect.x(), layoutRect.top());
QString ret;
qreal height = 0;
const int lineCount = textLayout.lineCount();
for (int i = 0; i < lineCount; ++i) {
const QTextLine line = textLayout.lineAt(i);
height += line.height();
// above visible rect
if (height + layoutRect.top() <= textRect.top()) {
if (paintStartPosition)
paintStartPosition->ry() += line.height();
continue;
}
const int start = line.textStart();
const int length = line.textLength();
const bool drawElided = line.naturalTextWidth() > textRect.width();
bool elideLastVisibleLine = lastVisibleLine == i;
if (!drawElided && i + 1 < lineCount && lastVisibleLineShouldBeElided) {
const QTextLine nextLine = textLayout.lineAt(i + 1);
const int nextHeight = height + nextLine.height() / 2;
// elide when less than the next half line is visible
if (nextHeight + layoutRect.top() > textRect.height() + textRect.top())
elideLastVisibleLine = true;
}
QString text = textLayout.text().mid(start, length);
if (drawElided || elideLastVisibleLine) {
if (elideLastVisibleLine) {
if (text.endsWith(QChar::LineSeparator))
text.chop(1);
text += QChar(0x2026);
}
const QStackTextEngine engine(text, font);
ret += engine.elidedText(textElideMode, textRect.width(), flags);
// no newline for the last line (last visible or real)
// sometimes drawElided is true but no eliding is done so the text ends
// with QChar::LineSeparator - don't add another one. This happened with
// arabic text in the testcase for QTBUG-72805
if (i < lineCount - 1 &&
!ret.endsWith(QChar::LineSeparator))
ret += QChar::LineSeparator;
} else {
ret += text;
}
// below visible text, can stop
if ((height + layoutRect.top() >= textRect.bottom()) ||
(lastVisibleLine >= 0 && lastVisibleLine == i))
break;
}
return ret;
}
#if QT_CONFIG(itemviews)
QSize QCommonStylePrivate::viewItemSize(const QStyleOptionViewItem *option, int role) const
{
const QWidget *widget = option->widget;
switch (role) {
case Qt::CheckStateRole:
if (option->features & QStyleOptionViewItem::HasCheckIndicator)
return QSize(proxyStyle->pixelMetric(QStyle::PM_IndicatorWidth, option, widget),
proxyStyle->pixelMetric(QStyle::PM_IndicatorHeight, option, widget));
break;
case Qt::DisplayRole:
if (option->features & QStyleOptionViewItem::HasDisplay) {
QTextOption textOption;
textOption.setWrapMode(QTextOption::WordWrap);
QTextLayout textLayout(option->text, option->font);
textLayout.setTextOption(textOption);
const bool wrapText = option->features & QStyleOptionViewItem::WrapText;
const int textMargin = proxyStyle->pixelMetric(QStyle::PM_FocusFrameHMargin, option, widget) + 1;
QRect bounds = option->rect;
switch (option->decorationPosition) {
case QStyleOptionViewItem::Left:
case QStyleOptionViewItem::Right: {
if (wrapText && bounds.isValid()) {
int width = bounds.width() - 2 * textMargin;
if (option->features & QStyleOptionViewItem::HasDecoration)
width -= option->decorationSize.width() + 2 * textMargin;
bounds.setWidth(width);
} else
bounds.setWidth(QFIXED_MAX);
break;
}
case QStyleOptionViewItem::Top:
case QStyleOptionViewItem::Bottom:
if (wrapText)
bounds.setWidth(bounds.isValid() ? bounds.width() - 2 * textMargin : option->decorationSize.width());
else
bounds.setWidth(QFIXED_MAX);
break;
default:
break;
}
if (wrapText && option->features & QStyleOptionViewItem::HasCheckIndicator)
bounds.setWidth(bounds.width() - proxyStyle->pixelMetric(QStyle::PM_IndicatorWidth) - 2 * textMargin);
const int lineWidth = bounds.width();
const QSizeF size = viewItemTextLayout(textLayout, lineWidth);
return QSize(qCeil(size.width()) + 2 * textMargin, qCeil(size.height()));
}
break;
case Qt::DecorationRole:
if (option->features & QStyleOptionViewItem::HasDecoration) {
return option->decorationSize;
}
break;
default:
break;
}
return QSize(0, 0);
}
void QCommonStylePrivate::viewItemDrawText(QPainter *p, const QStyleOptionViewItem *option, const QRect &rect) const
{
const QWidget *widget = option->widget;
const int textMargin = proxyStyle->pixelMetric(QStyle::PM_FocusFrameHMargin, 0, widget) + 1;
QRect textRect = rect.adjusted(textMargin, 0, -textMargin, 0); // remove width padding
const bool wrapText = option->features & QStyleOptionViewItem::WrapText;
QTextOption textOption;
textOption.setWrapMode(wrapText ? QTextOption::WordWrap : QTextOption::ManualWrap);
textOption.setTextDirection(option->direction);
textOption.setAlignment(QStyle::visualAlignment(option->direction, option->displayAlignment));
QPointF paintPosition;
const QString newText = calculateElidedText(option->text, textOption,
option->font, textRect, option->displayAlignment,
option->textElideMode, 0,
true, &paintPosition);
QTextLayout textLayout(newText, option->font);
textLayout.setTextOption(textOption);
viewItemTextLayout(textLayout, textRect.width());
textLayout.draw(p, paintPosition);
}
/*! \internal
compute the position for the different component of an item (pixmap, text, checkbox)
Set sizehint to false to layout the elements inside opt->rect. Set sizehint to true to ignore
opt->rect and return rectangles in infinite space
Code duplicated in QItemDelegate::doLayout
*/
void QCommonStylePrivate::viewItemLayout(const QStyleOptionViewItem *opt, QRect *checkRect,
QRect *pixmapRect, QRect *textRect, bool sizehint) const
{
Q_ASSERT(checkRect && pixmapRect && textRect);
*pixmapRect = QRect(QPoint(0, 0), viewItemSize(opt, Qt::DecorationRole));
*textRect = QRect(QPoint(0, 0), viewItemSize(opt, Qt::DisplayRole));
*checkRect = QRect(QPoint(0, 0), viewItemSize(opt, Qt::CheckStateRole));
const QWidget *widget = opt->widget;
const bool hasCheck = checkRect->isValid();
const bool hasPixmap = pixmapRect->isValid();
const bool hasText = textRect->isValid();
const bool hasMargin = (hasText | hasPixmap | hasCheck);
const int frameHMargin = hasMargin ?
proxyStyle->pixelMetric(QStyle::PM_FocusFrameHMargin, opt, widget) + 1 : 0;
const int textMargin = hasText ? frameHMargin : 0;
const int pixmapMargin = hasPixmap ? frameHMargin : 0;
const int checkMargin = hasCheck ? frameHMargin : 0;
const int x = opt->rect.left();
const int y = opt->rect.top();
int w, h;
if (textRect->height() == 0 && (!hasPixmap || !sizehint)) {
//if there is no text, we still want to have a decent height for the item sizeHint and the editor size
textRect->setHeight(opt->fontMetrics.height());
}
QSize pm(0, 0);
if (hasPixmap) {
pm = pixmapRect->size();
pm.rwidth() += 2 * pixmapMargin;
}
if (sizehint) {
h = qMax(checkRect->height(), qMax(textRect->height(), pm.height()));
if (opt->decorationPosition == QStyleOptionViewItem::Left
|| opt->decorationPosition == QStyleOptionViewItem::Right) {
w = textRect->width() + pm.width();
} else {
w = qMax(textRect->width(), pm.width());
}
} else {
w = opt->rect.width();
h = opt->rect.height();
}
int cw = 0;
QRect check;
if (hasCheck) {
cw = checkRect->width() + 2 * checkMargin;
if (sizehint) w += cw;
if (opt->direction == Qt::RightToLeft) {
check.setRect(x + w - cw, y, cw, h);
} else {
check.setRect(x, y, cw, h);
}
}
QRect display;
QRect decoration;
switch (opt->decorationPosition) {
case QStyleOptionViewItem::Top: {
if (hasPixmap)
pm.setHeight(pm.height() + pixmapMargin); // add space
h = sizehint ? textRect->height() : h - pm.height();
if (opt->direction == Qt::RightToLeft) {
decoration.setRect(x, y, w - cw, pm.height());
display.setRect(x, y + pm.height(), w - cw, h);
} else {
decoration.setRect(x + cw, y, w - cw, pm.height());
display.setRect(x + cw, y + pm.height(), w - cw, h);
}
break; }
case QStyleOptionViewItem::Bottom: {
if (hasText)
textRect->setHeight(textRect->height() + textMargin); // add space
h = sizehint ? textRect->height() + pm.height() : h;
if (opt->direction == Qt::RightToLeft) {
display.setRect(x, y, w - cw, textRect->height());
decoration.setRect(x, y + textRect->height(), w - cw, h - textRect->height());
} else {
display.setRect(x + cw, y, w - cw, textRect->height());
decoration.setRect(x + cw, y + textRect->height(), w - cw, h - textRect->height());
}
break; }
case QStyleOptionViewItem::Left: {
if (opt->direction == Qt::LeftToRight) {
decoration.setRect(x + cw, y, pm.width(), h);
display.setRect(decoration.right() + 1, y, w - pm.width() - cw, h);
} else {
display.setRect(x, y, w - pm.width() - cw, h);
decoration.setRect(display.right() + 1, y, pm.width(), h);
}
break; }
case QStyleOptionViewItem::Right: {
if (opt->direction == Qt::LeftToRight) {
display.setRect(x + cw, y, w - pm.width() - cw, h);
decoration.setRect(display.right() + 1, y, pm.width(), h);
} else {
decoration.setRect(x, y, pm.width(), h);
display.setRect(decoration.right() + 1, y, w - pm.width() - cw, h);
}
break; }
default:
qWarning("doLayout: decoration position is invalid");
decoration = *pixmapRect;
break;
}
if (!sizehint) { // we only need to do the internal layout if we are going to paint
*checkRect = QStyle::alignedRect(opt->direction, Qt::AlignCenter,
checkRect->size(), check);
*pixmapRect = QStyle::alignedRect(opt->direction, opt->decorationAlignment,
pixmapRect->size(), decoration);
// the text takes up all available space, unless the decoration is not shown as selected
if (opt->showDecorationSelected)
*textRect = display;
else
*textRect = QStyle::alignedRect(opt->direction, opt->displayAlignment,
textRect->size().boundedTo(display.size()), display);
} else {
*checkRect = check;
*pixmapRect = decoration;
*textRect = display;
}
}
#endif // QT_CONFIG(itemviews)
#if QT_CONFIG(toolbutton)
QString QCommonStylePrivate::toolButtonElideText(const QStyleOptionToolButton *option,
const QRect &textRect, int flags) const
{
if (option->fontMetrics.horizontalAdvance(option->text) <= textRect.width())
return option->text;
QString text = option->text;
text.replace('\n', QChar::LineSeparator);
QTextOption textOption;
textOption.setWrapMode(QTextOption::ManualWrap);
textOption.setTextDirection(option->direction);
return calculateElidedText(text, textOption,
option->font, textRect, Qt::AlignTop,
Qt::ElideMiddle, flags,
false, nullptr);
}
#endif // QT_CONFIG(toolbutton)
#if QT_CONFIG(tabbar)
/*! \internal
Compute the textRect and the pixmapRect from the opt rect
Uses the same computation than in QTabBar::tabSizeHint
*/
void QCommonStylePrivate::tabLayout(const QStyleOptionTab *opt, const QWidget *widget, QRect *textRect, QRect *iconRect) const
{
Q_ASSERT(textRect);
Q_ASSERT(iconRect);
QRect tr = opt->rect;
bool verticalTabs = opt->shape == QTabBar::RoundedEast
|| opt->shape == QTabBar::RoundedWest
|| opt->shape == QTabBar::TriangularEast
|| opt->shape == QTabBar::TriangularWest;
if (verticalTabs)
tr.setRect(0, 0, tr.height(), tr.width()); // 0, 0 as we will have a translate transform
int verticalShift = proxyStyle->pixelMetric(QStyle::PM_TabBarTabShiftVertical, opt, widget);
int horizontalShift = proxyStyle->pixelMetric(QStyle::PM_TabBarTabShiftHorizontal, opt, widget);
int hpadding = proxyStyle->pixelMetric(QStyle::PM_TabBarTabHSpace, opt, widget) / 2;
int vpadding = proxyStyle->pixelMetric(QStyle::PM_TabBarTabVSpace, opt, widget) / 2;
if (opt->shape == QTabBar::RoundedSouth || opt->shape == QTabBar::TriangularSouth)
verticalShift = -verticalShift;
tr.adjust(hpadding, verticalShift - vpadding, horizontalShift - hpadding, vpadding);
bool selected = opt->state & QStyle::State_Selected;
if (selected) {
tr.setTop(tr.top() - verticalShift);
tr.setRight(tr.right() - horizontalShift);
}
// left widget
if (!opt->leftButtonSize.isEmpty()) {
tr.setLeft(tr.left() + 4 +
(verticalTabs ? opt->leftButtonSize.height() : opt->leftButtonSize.width()));
}
// right widget
if (!opt->rightButtonSize.isEmpty()) {
tr.setRight(tr.right() - 4 -
(verticalTabs ? opt->rightButtonSize.height() : opt->rightButtonSize.width()));
}
// icon
if (!opt->icon.isNull()) {
QSize iconSize = opt->iconSize;
if (!iconSize.isValid()) {
int iconExtent = proxyStyle->pixelMetric(QStyle::PM_SmallIconSize);
iconSize = QSize(iconExtent, iconExtent);
}
QSize tabIconSize = opt->icon.actualSize(iconSize,
(opt->state & QStyle::State_Enabled) ? QIcon::Normal : QIcon::Disabled,
(opt->state & QStyle::State_Selected) ? QIcon::On : QIcon::Off);
// High-dpi icons do not need adjustment; make sure tabIconSize is not larger than iconSize
tabIconSize = QSize(qMin(tabIconSize.width(), iconSize.width()), qMin(tabIconSize.height(), iconSize.height()));
const int offsetX = (iconSize.width() - tabIconSize.width()) / 2;
*iconRect = QRect(tr.left() + offsetX, tr.center().y() - tabIconSize.height() / 2,
tabIconSize.width(), tabIconSize.height());
if (!verticalTabs)
*iconRect = QStyle::visualRect(opt->direction, opt->rect, *iconRect);
tr.setLeft(tr.left() + tabIconSize.width() + 4);
}
if (!verticalTabs)
tr = QStyle::visualRect(opt->direction, opt->rect, tr);
*textRect = tr;
}
#endif // QT_CONFIG(tabbar)
#if QT_CONFIG(animation)
/*! \internal */
QList<const QObject*> QCommonStylePrivate::animationTargets() const
{
return animations.keys();
}
/*! \internal */
QStyleAnimation * QCommonStylePrivate::animation(const QObject *target) const
{
return animations.value(target);
}
/*! \internal */
void QCommonStylePrivate::startAnimation(QStyleAnimation *animation) const
{
Q_Q(const QCommonStyle);
stopAnimation(animation->target());
q->connect(animation, SIGNAL(destroyed()), SLOT(_q_removeAnimation()), Qt::UniqueConnection);
animations.insert(animation->target(), animation);
animation->start();
}
/*! \internal */
void QCommonStylePrivate::stopAnimation(const QObject *target) const
{
QStyleAnimation *animation = animations.take(target);
if (animation) {
animation->stop();
delete animation;
}
}
/*! \internal */
void QCommonStylePrivate::_q_removeAnimation()
{
Q_Q(QCommonStyle);
QObject *animation = q->sender();
if (animation)
animations.remove(animation->parent());
}
#endif
/*!
\reimp
*/
void QCommonStyle::drawControl(ControlElement element, const QStyleOption *opt,
QPainter *p, const QWidget *widget) const
{
Q_D(const QCommonStyle);
switch (element) {
case CE_PushButton:
if (const QStyleOptionButton *btn = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
proxy()->drawControl(CE_PushButtonBevel, btn, p, widget);
QStyleOptionButton subopt = *btn;
subopt.rect = subElementRect(SE_PushButtonContents, btn, widget);
proxy()->drawControl(CE_PushButtonLabel, &subopt, p, widget);
if (btn->state & State_HasFocus) {
QStyleOptionFocusRect fropt;
fropt.QStyleOption::operator=(*btn);
fropt.rect = subElementRect(SE_PushButtonFocusRect, btn, widget);
proxy()->drawPrimitive(PE_FrameFocusRect, &fropt, p, widget);
}
}
break;
case CE_PushButtonBevel:
if (const QStyleOptionButton *btn = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
QRect br = btn->rect;
int dbi = proxy()->pixelMetric(PM_ButtonDefaultIndicator, btn, widget);
if (btn->features & QStyleOptionButton::DefaultButton)
proxy()->drawPrimitive(PE_FrameDefaultButton, opt, p, widget);
if (btn->features & QStyleOptionButton::AutoDefaultButton)
br.setCoords(br.left() + dbi, br.top() + dbi, br.right() - dbi, br.bottom() - dbi);
if (!(btn->features & (QStyleOptionButton::Flat | QStyleOptionButton::CommandLinkButton))
|| btn->state & (State_Sunken | State_On)
|| (btn->features & QStyleOptionButton::CommandLinkButton && btn->state & State_MouseOver)) {
QStyleOptionButton tmpBtn = *btn;
tmpBtn.rect = br;
proxy()->drawPrimitive(PE_PanelButtonCommand, &tmpBtn, p, widget);
}
if (btn->features & QStyleOptionButton::HasMenu) {
int mbi = proxy()->pixelMetric(PM_MenuButtonIndicator, btn, widget);
QRect ir = btn->rect;
QStyleOptionButton newBtn = *btn;
newBtn.rect = QRect(ir.right() - mbi + 2, ir.height()/2 - mbi/2 + 3, mbi - 6, mbi - 6);
proxy()->drawPrimitive(PE_IndicatorArrowDown, &newBtn, p, widget);
}
}
break;
case CE_PushButtonLabel:
if (const QStyleOptionButton *button = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
QRect textRect = button->rect;
uint tf = Qt::AlignVCenter | Qt::TextShowMnemonic;
if (!proxy()->styleHint(SH_UnderlineShortcut, button, widget))
tf |= Qt::TextHideMnemonic;
if (!button->icon.isNull()) {
//Center both icon and text
QIcon::Mode mode = button->state & State_Enabled ? QIcon::Normal : QIcon::Disabled;
if (mode == QIcon::Normal && button->state & State_HasFocus)
mode = QIcon::Active;
QIcon::State state = QIcon::Off;
if (button->state & State_On)
state = QIcon::On;
QPixmap pixmap = button->icon.pixmap(qt_getWindow(widget), button->iconSize, mode, state);
int pixmapWidth = pixmap.width() / pixmap.devicePixelRatio();
int pixmapHeight = pixmap.height() / pixmap.devicePixelRatio();
int labelWidth = pixmapWidth;
int labelHeight = pixmapHeight;
int iconSpacing = 4;//### 4 is currently hardcoded in QPushButton::sizeHint()
if (!button->text.isEmpty()) {
int textWidth = button->fontMetrics.boundingRect(opt->rect, tf, button->text).width();
labelWidth += (textWidth + iconSpacing);
}
QRect iconRect = QRect(textRect.x() + (textRect.width() - labelWidth) / 2,
textRect.y() + (textRect.height() - labelHeight) / 2,
pixmapWidth, pixmapHeight);
iconRect = visualRect(button->direction, textRect, iconRect);
if (button->direction == Qt::RightToLeft) {
tf |= Qt::AlignRight;
textRect.setRight(iconRect.left() - iconSpacing);
} else {
tf |= Qt::AlignLeft; //left align, we adjust the text-rect instead
textRect.setLeft(iconRect.left() + iconRect.width() + iconSpacing);
}
if (button->state & (State_On | State_Sunken))
iconRect.translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, opt, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, opt, widget));
p->drawPixmap(iconRect, pixmap);
} else {
tf |= Qt::AlignHCenter;
}
if (button->state & (State_On | State_Sunken))
textRect.translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, opt, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, opt, widget));
if (button->features & QStyleOptionButton::HasMenu) {
int indicatorSize = proxy()->pixelMetric(PM_MenuButtonIndicator, button, widget);
if (button->direction == Qt::LeftToRight)
textRect = textRect.adjusted(0, 0, -indicatorSize, 0);
else
textRect = textRect.adjusted(indicatorSize, 0, 0, 0);
}
proxy()->drawItemText(p, textRect, tf, button->palette, (button->state & State_Enabled),
button->text, QPalette::ButtonText);
}
break;
case CE_RadioButton:
case CE_CheckBox:
if (const QStyleOptionButton *btn = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
bool isRadio = (element == CE_RadioButton);
QStyleOptionButton subopt = *btn;
subopt.rect = subElementRect(isRadio ? SE_RadioButtonIndicator
: SE_CheckBoxIndicator, btn, widget);
proxy()->drawPrimitive(isRadio ? PE_IndicatorRadioButton : PE_IndicatorCheckBox,
&subopt, p, widget);
subopt.rect = subElementRect(isRadio ? SE_RadioButtonContents
: SE_CheckBoxContents, btn, widget);
proxy()->drawControl(isRadio ? CE_RadioButtonLabel : CE_CheckBoxLabel, &subopt, p, widget);
if (btn->state & State_HasFocus) {
QStyleOptionFocusRect fropt;
fropt.QStyleOption::operator=(*btn);
fropt.rect = subElementRect(isRadio ? SE_RadioButtonFocusRect
: SE_CheckBoxFocusRect, btn, widget);
proxy()->drawPrimitive(PE_FrameFocusRect, &fropt, p, widget);
}
}
break;
case CE_RadioButtonLabel:
case CE_CheckBoxLabel:
if (const QStyleOptionButton *btn = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
uint alignment = visualAlignment(btn->direction, Qt::AlignLeft | Qt::AlignVCenter);
if (!proxy()->styleHint(SH_UnderlineShortcut, btn, widget))
alignment |= Qt::TextHideMnemonic;
QPixmap pix;
QRect textRect = btn->rect;
if (!btn->icon.isNull()) {
pix = btn->icon.pixmap(qt_getWindow(widget), btn->iconSize, btn->state & State_Enabled ? QIcon::Normal : QIcon::Disabled);
proxy()->drawItemPixmap(p, btn->rect, alignment, pix);
if (btn->direction == Qt::RightToLeft)
textRect.setRight(textRect.right() - btn->iconSize.width() - 4);
else
textRect.setLeft(textRect.left() + btn->iconSize.width() + 4);
}
if (!btn->text.isEmpty()){
proxy()->drawItemText(p, textRect, alignment | Qt::TextShowMnemonic,
btn->palette, btn->state & State_Enabled, btn->text, QPalette::WindowText);
}
}
break;
#if QT_CONFIG(menu)
case CE_MenuScroller: {
QStyleOption arrowOpt = *opt;
arrowOpt.state |= State_Enabled;
proxy()->drawPrimitive(((opt->state & State_DownArrow) ? PE_IndicatorArrowDown : PE_IndicatorArrowUp),
&arrowOpt, p, widget);
break; }
case CE_MenuTearoff:
if (opt->state & State_Selected)
p->fillRect(opt->rect, opt->palette.brush(QPalette::Highlight));
else
p->fillRect(opt->rect, opt->palette.brush(QPalette::Button));
p->setPen(QPen(opt->palette.dark().color(), 1, Qt::DashLine));
p->drawLine(opt->rect.x() + 2, opt->rect.y() + opt->rect.height() / 2 - 1,
opt->rect.x() + opt->rect.width() - 4,
opt->rect.y() + opt->rect.height() / 2 - 1);
p->setPen(QPen(opt->palette.light().color(), 1, Qt::DashLine));
p->drawLine(opt->rect.x() + 2, opt->rect.y() + opt->rect.height() / 2,
opt->rect.x() + opt->rect.width() - 4, opt->rect.y() + opt->rect.height() / 2);
break;
#endif // QT_CONFIG(menu)
#if QT_CONFIG(menubar)
case CE_MenuBarItem:
if (const QStyleOptionMenuItem *mbi = qstyleoption_cast<const QStyleOptionMenuItem *>(opt)) {
uint alignment = Qt::AlignCenter | Qt::TextShowMnemonic | Qt::TextDontClip
| Qt::TextSingleLine;
if (!proxy()->styleHint(SH_UnderlineShortcut, mbi, widget))
alignment |= Qt::TextHideMnemonic;
int iconExtent = proxy()->pixelMetric(PM_SmallIconSize);
QPixmap pix = mbi->icon.pixmap(qt_getWindow(widget), QSize(iconExtent, iconExtent), (mbi->state & State_Enabled) ? QIcon::Normal : QIcon::Disabled);
if (!pix.isNull())
proxy()->drawItemPixmap(p,mbi->rect, alignment, pix);
else
proxy()->drawItemText(p, mbi->rect, alignment, mbi->palette, mbi->state & State_Enabled,
mbi->text, QPalette::ButtonText);
}
break;
case CE_MenuBarEmptyArea:
if (widget && !widget->testAttribute(Qt::WA_NoSystemBackground))
p->eraseRect(opt->rect);
break;
#endif // QT_CONFIG(menubar)
#if QT_CONFIG(progressbar)
case CE_ProgressBar:
if (const QStyleOptionProgressBar *pb
= qstyleoption_cast<const QStyleOptionProgressBar *>(opt)) {
QStyleOptionProgressBar subopt = *pb;
subopt.rect = subElementRect(SE_ProgressBarGroove, pb, widget);
proxy()->drawControl(CE_ProgressBarGroove, &subopt, p, widget);
subopt.rect = subElementRect(SE_ProgressBarContents, pb, widget);
proxy()->drawControl(CE_ProgressBarContents, &subopt, p, widget);
if (pb->textVisible) {
subopt.rect = subElementRect(SE_ProgressBarLabel, pb, widget);
proxy()->drawControl(CE_ProgressBarLabel, &subopt, p, widget);
}
}
break;
case CE_ProgressBarGroove:
if (opt->rect.isValid())
qDrawShadePanel(p, opt->rect, opt->palette, true, 1,
&opt->palette.brush(QPalette::Window));
break;
case CE_ProgressBarLabel:
if (const QStyleOptionProgressBar *pb = qstyleoption_cast<const QStyleOptionProgressBar *>(opt)) {
const bool vertical = pb->orientation == Qt::Vertical;
if (!vertical) {
QPalette::ColorRole textRole = QPalette::NoRole;
if ((pb->textAlignment & Qt::AlignCenter) && pb->textVisible
&& ((qint64(pb->progress) - qint64(pb->minimum)) * 2 >= (qint64(pb->maximum) - qint64(pb->minimum)))) {
textRole = QPalette::HighlightedText;
//Draw text shadow, This will increase readability when the background of same color
QRect shadowRect(pb->rect);
shadowRect.translate(1,1);
QColor shadowColor = (pb->palette.color(textRole).value() <= 128)
? QColor(255,255,255,160) : QColor(0,0,0,160);
QPalette shadowPalette = pb->palette;
shadowPalette.setColor(textRole, shadowColor);
proxy()->drawItemText(p, shadowRect, Qt::AlignCenter | Qt::TextSingleLine, shadowPalette,
pb->state & State_Enabled, pb->text, textRole);
}
proxy()->drawItemText(p, pb->rect, Qt::AlignCenter | Qt::TextSingleLine, pb->palette,
pb->state & State_Enabled, pb->text, textRole);
}
}
break;
case CE_ProgressBarContents:
if (const QStyleOptionProgressBar *pb = qstyleoption_cast<const QStyleOptionProgressBar *>(opt)) {
QRect rect = pb->rect;
const bool vertical = pb->orientation == Qt::Vertical;
const bool inverted = pb->invertedAppearance;
qint64 minimum = qint64(pb->minimum);
qint64 maximum = qint64(pb->maximum);
qint64 progress = qint64(pb->progress);
QMatrix m;
if (vertical) {
rect = QRect(rect.y(), rect.x(), rect.height(), rect.width()); // flip width and height
m.rotate(90);
m.translate(0, -(rect.height() + rect.y()*2));
}
QPalette pal2 = pb->palette;
// Correct the highlight color if it is the same as the background
if (pal2.highlight() == pal2.window())
pal2.setColor(QPalette::Highlight, pb->palette.color(QPalette::Active,
QPalette::Highlight));
bool reverse = ((!vertical && (pb->direction == Qt::RightToLeft)) || vertical);
if (inverted)
reverse = !reverse;
int w = rect.width();
if (pb->minimum == 0 && pb->maximum == 0) {
// draw busy indicator
int x = (progress - minimum) % (w * 2);
if (x > w)
x = 2 * w - x;
x = reverse ? rect.right() - x : x + rect.x();
p->setPen(QPen(pal2.highlight().color(), 4));
p->drawLine(x, rect.y(), x, rect.height());
} else {
const int unit_width = proxy()->pixelMetric(PM_ProgressBarChunkWidth, pb, widget);
if (!unit_width)
return;
int u;
if (unit_width > 1)
u = ((rect.width() + unit_width) / unit_width);
else
u = w / unit_width;
qint64 p_v = progress - minimum;
qint64 t_s = (maximum - minimum) ? (maximum - minimum) : qint64(1);
if (u > 0 && p_v >= INT_MAX / u && t_s >= u) {
// scale down to something usable.
p_v /= u;
t_s /= u;
}
// nu < tnu, if last chunk is only a partial chunk
int tnu, nu;
tnu = nu = p_v * u / t_s;
if (nu * unit_width > w)
--nu;
// Draw nu units out of a possible u of unit_width
// width, each a rectangle bordered by background
// color, all in a sunken panel with a percentage text
// display at the end.
int x = 0;
int x0 = reverse ? rect.right() - ((unit_width > 1) ? unit_width : 0)
: rect.x();
QStyleOptionProgressBar pbBits = *pb;
pbBits.rect = rect;
pbBits.palette = pal2;
int myY = pbBits.rect.y();
int myHeight = pbBits.rect.height();
pbBits.state = State_None;
for (int i = 0; i < nu; ++i) {
pbBits.rect.setRect(x0 + x, myY, unit_width, myHeight);
pbBits.rect = m.mapRect(QRectF(pbBits.rect)).toRect();
proxy()->drawPrimitive(PE_IndicatorProgressChunk, &pbBits, p, widget);
x += reverse ? -unit_width : unit_width;
}
// Draw the last partial chunk to fill up the
// progress bar entirely
if (nu < tnu) {
int pixels_left = w - (nu * unit_width);
int offset = reverse ? x0 + x + unit_width-pixels_left : x0 + x;
pbBits.rect.setRect(offset, myY, pixels_left, myHeight);
pbBits.rect = m.mapRect(QRectF(pbBits.rect)).toRect();
proxy()->drawPrimitive(PE_IndicatorProgressChunk, &pbBits, p, widget);
}
}
}
break;
#endif // QT_CONFIG(progressbar)
case CE_HeaderLabel:
if (const QStyleOptionHeader *header = qstyleoption_cast<const QStyleOptionHeader *>(opt)) {
QRect rect = header->rect;
if (!header->icon.isNull()) {
int iconExtent = proxy()->pixelMetric(PM_SmallIconSize);
QPixmap pixmap
= header->icon.pixmap(qt_getWindow(widget), QSize(iconExtent, iconExtent), (header->state & State_Enabled) ? QIcon::Normal : QIcon::Disabled);
int pixw = pixmap.width() / pixmap.devicePixelRatio();
QRect aligned = alignedRect(header->direction, QFlag(header->iconAlignment), pixmap.size() / pixmap.devicePixelRatio(), rect);
QRect inter = aligned.intersected(rect);
p->drawPixmap(inter.x(), inter.y(), pixmap,
inter.x() - aligned.x(), inter.y() - aligned.y(),
aligned.width() * pixmap.devicePixelRatio(),
pixmap.height() * pixmap.devicePixelRatio());
const int margin = proxy()->pixelMetric(QStyle::PM_HeaderMargin, opt, widget);
if (header->direction == Qt::LeftToRight)
rect.setLeft(rect.left() + pixw + margin);
else
rect.setRight(rect.right() - pixw - margin);
}
if (header->state & QStyle::State_On) {
QFont fnt = p->font();
fnt.setBold(true);
p->setFont(fnt);
}
proxy()->drawItemText(p, rect, header->textAlignment, header->palette,
(header->state & State_Enabled), header->text, QPalette::ButtonText);
}
break;
#if QT_CONFIG(toolbutton)
case CE_ToolButtonLabel:
if (const QStyleOptionToolButton *toolbutton
= qstyleoption_cast<const QStyleOptionToolButton *>(opt)) {
QRect rect = toolbutton->rect;
int shiftX = 0;
int shiftY = 0;
if (toolbutton->state & (State_Sunken | State_On)) {
shiftX = proxy()->pixelMetric(PM_ButtonShiftHorizontal, toolbutton, widget);
shiftY = proxy()->pixelMetric(PM_ButtonShiftVertical, toolbutton, widget);
}
// Arrow type always overrules and is always shown
bool hasArrow = toolbutton->features & QStyleOptionToolButton::Arrow;
if (((!hasArrow && toolbutton->icon.isNull()) && !toolbutton->text.isEmpty())
|| toolbutton->toolButtonStyle == Qt::ToolButtonTextOnly) {
int alignment = Qt::AlignCenter | Qt::TextShowMnemonic;
if (!proxy()->styleHint(SH_UnderlineShortcut, opt, widget))
alignment |= Qt::TextHideMnemonic;
rect.translate(shiftX, shiftY);
p->setFont(toolbutton->font);
proxy()->drawItemText(p, rect, alignment, toolbutton->palette,
opt->state & State_Enabled, toolbutton->text,
QPalette::ButtonText);
} else {
QPixmap pm;
QSize pmSize = toolbutton->iconSize;
if (!toolbutton->icon.isNull()) {
QIcon::State state = toolbutton->state & State_On ? QIcon::On : QIcon::Off;
QIcon::Mode mode;
if (!(toolbutton->state & State_Enabled))
mode = QIcon::Disabled;
else if ((opt->state & State_MouseOver) && (opt->state & State_AutoRaise))
mode = QIcon::Active;
else
mode = QIcon::Normal;
pm = toolbutton->icon.pixmap(qt_getWindow(widget), toolbutton->rect.size().boundedTo(toolbutton->iconSize),
mode, state);
pmSize = pm.size() / pm.devicePixelRatio();
}
if (toolbutton->toolButtonStyle != Qt::ToolButtonIconOnly) {
p->setFont(toolbutton->font);
QRect pr = rect,
tr = rect;
int alignment = Qt::TextShowMnemonic;
if (!proxy()->styleHint(SH_UnderlineShortcut, opt, widget))
alignment |= Qt::TextHideMnemonic;
if (toolbutton->toolButtonStyle == Qt::ToolButtonTextUnderIcon) {
pr.setHeight(pmSize.height() + 4); //### 4 is currently hardcoded in QToolButton::sizeHint()
tr.adjust(0, pr.height() - 1, 0, -1);
pr.translate(shiftX, shiftY);
if (!hasArrow) {
proxy()->drawItemPixmap(p, pr, Qt::AlignCenter, pm);
} else {
drawArrow(proxy(), toolbutton, pr, p, widget);
}
alignment |= Qt::AlignCenter;
} else {
pr.setWidth(pmSize.width() + 4); //### 4 is currently hardcoded in QToolButton::sizeHint()
tr.adjust(pr.width(), 0, 0, 0);
pr.translate(shiftX, shiftY);
if (!hasArrow) {
proxy()->drawItemPixmap(p, QStyle::visualRect(opt->direction, rect, pr), Qt::AlignCenter, pm);
} else {
drawArrow(proxy(), toolbutton, pr, p, widget);
}
alignment |= Qt::AlignLeft | Qt::AlignVCenter;
}
tr.translate(shiftX, shiftY);
const QString text = d->toolButtonElideText(toolbutton, tr, alignment);
proxy()->drawItemText(p, QStyle::visualRect(opt->direction, rect, tr), alignment, toolbutton->palette,
toolbutton->state & State_Enabled, text,
QPalette::ButtonText);
} else {
rect.translate(shiftX, shiftY);
if (hasArrow) {
drawArrow(proxy(), toolbutton, rect, p, widget);
} else {
proxy()->drawItemPixmap(p, rect, Qt::AlignCenter, pm);
}
}
}
}
break;
#endif // QT_CONFIG(toolbutton)
#if QT_CONFIG(toolbox)
case CE_ToolBoxTab:
if (const QStyleOptionToolBox *tb = qstyleoption_cast<const QStyleOptionToolBox *>(opt)) {
proxy()->drawControl(CE_ToolBoxTabShape, tb, p, widget);
proxy()->drawControl(CE_ToolBoxTabLabel, tb, p, widget);
}
break;
case CE_ToolBoxTabShape:
if (const QStyleOptionToolBox *tb = qstyleoption_cast<const QStyleOptionToolBox *>(opt)) {
p->setPen(tb->palette.mid().color().darker(150));
bool oldQt4CompatiblePainting = p->testRenderHint(QPainter::Qt4CompatiblePainting);
p->setRenderHint(QPainter::Qt4CompatiblePainting);
int d = 20 + tb->rect.height() - 3;
if (tb->direction != Qt::RightToLeft) {
const QPoint points[] = {
QPoint(-1, tb->rect.height() + 1),
QPoint(-1, 1),
QPoint(tb->rect.width() - d, 1),
QPoint(tb->rect.width() - 20, tb->rect.height() - 2),
QPoint(tb->rect.width() - 1, tb->rect.height() - 2),
QPoint(tb->rect.width() - 1, tb->rect.height() + 1),
QPoint(-1, tb->rect.height() + 1),
};
p->drawPolygon(points, sizeof points / sizeof *points);
} else {
const QPoint points[] = {
QPoint(tb->rect.width(), tb->rect.height() + 1),
QPoint(tb->rect.width(), 1),
QPoint(d - 1, 1),
QPoint(20 - 1, tb->rect.height() - 2),
QPoint(0, tb->rect.height() - 2),
QPoint(0, tb->rect.height() + 1),
QPoint(tb->rect.width(), tb->rect.height() + 1),
};
p->drawPolygon(points, sizeof points / sizeof *points);
}
p->setRenderHint(QPainter::Qt4CompatiblePainting, oldQt4CompatiblePainting);
p->setPen(tb->palette.light().color());
if (tb->direction != Qt::RightToLeft) {
p->drawLine(0, 2, tb->rect.width() - d, 2);
p->drawLine(tb->rect.width() - d - 1, 2, tb->rect.width() - 21, tb->rect.height() - 1);
p->drawLine(tb->rect.width() - 20, tb->rect.height() - 1,
tb->rect.width(), tb->rect.height() - 1);
} else {
p->drawLine(tb->rect.width() - 1, 2, d - 1, 2);
p->drawLine(d, 2, 20, tb->rect.height() - 1);
p->drawLine(19, tb->rect.height() - 1,
-1, tb->rect.height() - 1);
}
p->setBrush(Qt::NoBrush);
}
break;
#endif // QT_CONFIG(toolbox)
#if QT_CONFIG(tabbar)
case CE_TabBarTab:
if (const QStyleOptionTab *tab = qstyleoption_cast<const QStyleOptionTab *>(opt)) {
proxy()->drawControl(CE_TabBarTabShape, tab, p, widget);
proxy()->drawControl(CE_TabBarTabLabel, tab, p, widget);
}
break;
case CE_TabBarTabShape:
if (const QStyleOptionTab *tab = qstyleoption_cast<const QStyleOptionTab *>(opt)) {
p->save();
QRect rect(tab->rect);
bool selected = tab->state & State_Selected;
bool onlyOne = tab->position == QStyleOptionTab::OnlyOneTab;
int tabOverlap = onlyOne ? 0 : proxy()->pixelMetric(PM_TabBarTabOverlap, opt, widget);
if (!selected) {
switch (tab->shape) {
case QTabBar::TriangularNorth:
rect.adjust(0, 0, 0, -tabOverlap);
if(!selected)
rect.adjust(1, 1, -1, 0);
break;
case QTabBar::TriangularSouth:
rect.adjust(0, tabOverlap, 0, 0);
if(!selected)
rect.adjust(1, 0, -1, -1);
break;
case QTabBar::TriangularEast:
rect.adjust(tabOverlap, 0, 0, 0);
if(!selected)
rect.adjust(0, 1, -1, -1);
break;
case QTabBar::TriangularWest:
rect.adjust(0, 0, -tabOverlap, 0);
if(!selected)
rect.adjust(1, 1, 0, -1);
break;
default:
break;
}
}
p->setPen(QPen(tab->palette.windowText(), 0));
if (selected) {
p->setBrush(tab->palette.base());
} else {
if (widget && widget->parentWidget())
p->setBrush(widget->parentWidget()->palette().window());
else
p->setBrush(tab->palette.window());
}
int y;
int x;
QPolygon a(10);
switch (tab->shape) {
case QTabBar::TriangularNorth:
case QTabBar::TriangularSouth: {
a.setPoint(0, 0, -1);
a.setPoint(1, 0, 0);
y = rect.height() - 2;
x = y / 3;
a.setPoint(2, x++, y - 1);
++x;
a.setPoint(3, x++, y++);
a.setPoint(4, x, y);
int i;
int right = rect.width() - 1;
for (i = 0; i < 5; ++i)
a.setPoint(9 - i, right - a.point(i).x(), a.point(i).y());
if (tab->shape == QTabBar::TriangularNorth)
for (i = 0; i < 10; ++i)
a.setPoint(i, a.point(i).x(), rect.height() - 1 - a.point(i).y());
a.translate(rect.left(), rect.top());
p->setRenderHint(QPainter::Antialiasing);
p->translate(0, 0.5);
QPainterPath path;
path.addPolygon(a);
p->drawPath(path);
break; }
case QTabBar::TriangularEast:
case QTabBar::TriangularWest: {
a.setPoint(0, -1, 0);
a.setPoint(1, 0, 0);
x = rect.width() - 2;
y = x / 3;
a.setPoint(2, x - 1, y++);
++y;
a.setPoint(3, x++, y++);
a.setPoint(4, x, y);
int i;
int bottom = rect.height() - 1;
for (i = 0; i < 5; ++i)
a.setPoint(9 - i, a.point(i).x(), bottom - a.point(i).y());
if (tab->shape == QTabBar::TriangularWest)
for (i = 0; i < 10; ++i)
a.setPoint(i, rect.width() - 1 - a.point(i).x(), a.point(i).y());
a.translate(rect.left(), rect.top());
p->setRenderHint(QPainter::Antialiasing);
p->translate(0.5, 0);
QPainterPath path;
path.addPolygon(a);
p->drawPath(path);
break; }
default:
break;
}
p->restore();
}
break;
case CE_ToolBoxTabLabel:
if (const QStyleOptionToolBox *tb = qstyleoption_cast<const QStyleOptionToolBox *>(opt)) {
bool enabled = tb->state & State_Enabled;
bool selected = tb->state & State_Selected;
int iconExtent = proxy()->pixelMetric(QStyle::PM_SmallIconSize, tb, widget);
QPixmap pm = tb->icon.pixmap(qt_getWindow(widget), QSize(iconExtent, iconExtent),
enabled ? QIcon::Normal : QIcon::Disabled);
QRect cr = subElementRect(QStyle::SE_ToolBoxTabContents, tb, widget);
QRect tr, ir;
int ih = 0;
if (pm.isNull()) {
tr = cr;
tr.adjust(4, 0, -8, 0);
} else {
int iw = pm.width() / pm.devicePixelRatio() + 4;
ih = pm.height()/ pm.devicePixelRatio();
ir = QRect(cr.left() + 4, cr.top(), iw + 2, ih);
tr = QRect(ir.right(), cr.top(), cr.width() - ir.right() - 4, cr.height());
}
if (selected && proxy()->styleHint(QStyle::SH_ToolBox_SelectedPageTitleBold, tb, widget)) {
QFont f(p->font());
f.setBold(true);
p->setFont(f);
}
QString txt = tb->fontMetrics.elidedText(tb->text, Qt::ElideRight, tr.width());
if (ih)
p->drawPixmap(ir.left(), (tb->rect.height() - ih) / 2, pm);
int alignment = Qt::AlignLeft | Qt::AlignVCenter | Qt::TextShowMnemonic;
if (!proxy()->styleHint(QStyle::SH_UnderlineShortcut, tb, widget))
alignment |= Qt::TextHideMnemonic;
proxy()->drawItemText(p, tr, alignment, tb->palette, enabled, txt, QPalette::ButtonText);
if (!txt.isEmpty() && opt->state & State_HasFocus) {
QStyleOptionFocusRect opt;
opt.rect = tr;
opt.palette = tb->palette;
opt.state = QStyle::State_None;
proxy()->drawPrimitive(QStyle::PE_FrameFocusRect, &opt, p, widget);
}
}
break;
case CE_TabBarTabLabel:
if (const QStyleOptionTab *tab = qstyleoption_cast<const QStyleOptionTab *>(opt)) {
QRect tr = tab->rect;
bool verticalTabs = tab->shape == QTabBar::RoundedEast
|| tab->shape == QTabBar::RoundedWest
|| tab->shape == QTabBar::TriangularEast
|| tab->shape == QTabBar::TriangularWest;
int alignment = Qt::AlignCenter | Qt::TextShowMnemonic;
if (!proxy()->styleHint(SH_UnderlineShortcut, opt, widget))
alignment |= Qt::TextHideMnemonic;
if (verticalTabs) {
p->save();
int newX, newY, newRot;
if (tab->shape == QTabBar::RoundedEast || tab->shape == QTabBar::TriangularEast) {
newX = tr.width() + tr.x();
newY = tr.y();
newRot = 90;
} else {
newX = tr.x();
newY = tr.y() + tr.height();
newRot = -90;
}
QTransform m = QTransform::fromTranslate(newX, newY);
m.rotate(newRot);
p->setTransform(m, true);
}
QRect iconRect;
d->tabLayout(tab, widget, &tr, &iconRect);
tr = proxy()->subElementRect(SE_TabBarTabText, opt, widget); //we compute tr twice because the style may override subElementRect
if (!tab->icon.isNull()) {
QPixmap tabIcon = tab->icon.pixmap(qt_getWindow(widget), tab->iconSize,
(tab->state & State_Enabled) ? QIcon::Normal
: QIcon::Disabled,
(tab->state & State_Selected) ? QIcon::On
: QIcon::Off);
p->drawPixmap(iconRect.x(), iconRect.y(), tabIcon);
}
proxy()->drawItemText(p, tr, alignment, tab->palette, tab->state & State_Enabled, tab->text, QPalette::WindowText);
if (verticalTabs)
p->restore();
if (tab->state & State_HasFocus) {
const int OFFSET = 1 + pixelMetric(PM_DefaultFrameWidth);
int x1, x2;
x1 = tab->rect.left();
x2 = tab->rect.right() - 1;
QStyleOptionFocusRect fropt;
fropt.QStyleOption::operator=(*tab);
fropt.rect.setRect(x1 + 1 + OFFSET, tab->rect.y() + OFFSET,
x2 - x1 - 2*OFFSET, tab->rect.height() - 2*OFFSET);
drawPrimitive(PE_FrameFocusRect, &fropt, p, widget);
}
}
break;
#endif // QT_CONFIG(tabbar)
#if QT_CONFIG(sizegrip)
case CE_SizeGrip: {
p->save();
int x, y, w, h;
opt->rect.getRect(&x, &y, &w, &h);
int sw = qMin(h, w);
if (h > w)
p->translate(0, h - w);
else
p->translate(w - h, 0);
int sx = x;
int sy = y;
int s = sw / 3;
Qt::Corner corner;
if (const QStyleOptionSizeGrip *sgOpt = qstyleoption_cast<const QStyleOptionSizeGrip *>(opt))
corner = sgOpt->corner;
else if (opt->direction == Qt::RightToLeft)
corner = Qt::BottomLeftCorner;
else
corner = Qt::BottomRightCorner;
if (corner == Qt::BottomLeftCorner) {
sx = x + sw;
for (int i = 0; i < 4; ++i) {
p->setPen(QPen(opt->palette.light().color(), 1));
p->drawLine(x, sy - 1 , sx + 1, sw);
p->setPen(QPen(opt->palette.dark().color(), 1));
p->drawLine(x, sy, sx, sw);
p->setPen(QPen(opt->palette.dark().color(), 1));
p->drawLine(x, sy + 1, sx - 1, sw);
sx -= s;
sy += s;
}
} else if (corner == Qt::BottomRightCorner) {
for (int i = 0; i < 4; ++i) {
p->setPen(QPen(opt->palette.light().color(), 1));
p->drawLine(sx - 1, sw, sw, sy - 1);
p->setPen(QPen(opt->palette.dark().color(), 1));
p->drawLine(sx, sw, sw, sy);
p->setPen(QPen(opt->palette.dark().color(), 1));
p->drawLine(sx + 1, sw, sw, sy + 1);
sx += s;
sy += s;
}
} else if (corner == Qt::TopRightCorner) {
sy = y + sw;
for (int i = 0; i < 4; ++i) {
p->setPen(QPen(opt->palette.light().color(), 1));
p->drawLine(sx - 1, y, sw, sy + 1);
p->setPen(QPen(opt->palette.dark().color(), 1));
p->drawLine(sx, y, sw, sy);
p->setPen(QPen(opt->palette.dark().color(), 1));
p->drawLine(sx + 1, y, sw, sy - 1);
sx += s;
sy -= s;
}
} else if (corner == Qt::TopLeftCorner) {
for (int i = 0; i < 4; ++i) {
p->setPen(QPen(opt->palette.light().color(), 1));
p->drawLine(x, sy - 1, sx - 1, y);
p->setPen(QPen(opt->palette.dark().color(), 1));
p->drawLine(x, sy, sx, y);
p->setPen(QPen(opt->palette.dark().color(), 1));
p->drawLine(x, sy + 1, sx + 1, y);
sx += s;
sy += s;
}
}
p->restore();
break; }
#endif // QT_CONFIG(sizegrip)
#if QT_CONFIG(rubberband)
case CE_RubberBand: {
if (const QStyleOptionRubberBand *rbOpt = qstyleoption_cast<const QStyleOptionRubberBand *>(opt)) {
QPixmap tiledPixmap(16, 16);
QPainter pixmapPainter(&tiledPixmap);
pixmapPainter.setPen(Qt::NoPen);
pixmapPainter.setBrush(Qt::Dense4Pattern);
pixmapPainter.setBackground(QBrush(opt->palette.base()));
pixmapPainter.setBackgroundMode(Qt::OpaqueMode);
pixmapPainter.drawRect(0, 0, tiledPixmap.width(), tiledPixmap.height());
pixmapPainter.end();
// ### workaround for borked XRENDER
tiledPixmap = QPixmap::fromImage(tiledPixmap.toImage());
p->save();
QRect r = opt->rect;
QStyleHintReturnMask mask;
if (proxy()->styleHint(QStyle::SH_RubberBand_Mask, opt, widget, &mask))
p->setClipRegion(mask.region);
p->drawTiledPixmap(r.x(), r.y(), r.width(), r.height(), tiledPixmap);
p->setPen(opt->palette.color(QPalette::Active, QPalette::WindowText));
p->setBrush(Qt::NoBrush);
p->drawRect(r.adjusted(0, 0, -1, -1));
if (rbOpt->shape == QRubberBand::Rectangle)
p->drawRect(r.adjusted(3, 3, -4, -4));
p->restore();
}
break; }
#endif // QT_CONFIG(rubberband)
#if QT_CONFIG(dockwidget)
case CE_DockWidgetTitle:
if (const QStyleOptionDockWidget *dwOpt = qstyleoption_cast<const QStyleOptionDockWidget *>(opt)) {
QRect r = dwOpt->rect.adjusted(0, 0, -1, -1);
if (dwOpt->movable) {
p->setPen(dwOpt->palette.color(QPalette::Dark));
p->drawRect(r);
}
if (!dwOpt->title.isEmpty()) {
const bool verticalTitleBar = dwOpt->verticalTitleBar;
if (verticalTitleBar) {
r = r.transposed();
p->save();
p->translate(r.left(), r.top() + r.width());
p->rotate(-90);
p->translate(-r.left(), -r.top());
}
const int indent = p->fontMetrics().descent();
proxy()->drawItemText(p, r.adjusted(indent + 1, 1, -indent - 1, -1),
Qt::AlignLeft | Qt::AlignVCenter, dwOpt->palette,
dwOpt->state & State_Enabled, dwOpt->title,
QPalette::WindowText);
if (verticalTitleBar)
p->restore();
}
}
break;
#endif // QT_CONFIG(dockwidget)
case CE_Header:
if (const QStyleOptionHeader *header = qstyleoption_cast<const QStyleOptionHeader *>(opt)) {
QRegion clipRegion = p->clipRegion();
p->setClipRect(opt->rect);
proxy()->drawControl(CE_HeaderSection, header, p, widget);
QStyleOptionHeader subopt = *header;
subopt.rect = subElementRect(SE_HeaderLabel, header, widget);
if (subopt.rect.isValid())
proxy()->drawControl(CE_HeaderLabel, &subopt, p, widget);
if (header->sortIndicator != QStyleOptionHeader::None) {
subopt.rect = subElementRect(SE_HeaderArrow, opt, widget);
proxy()->drawPrimitive(PE_IndicatorHeaderArrow, &subopt, p, widget);
}
p->setClipRegion(clipRegion);
}
break;
case CE_FocusFrame:
p->fillRect(opt->rect, opt->palette.windowText());
break;
case CE_HeaderSection:
qDrawShadePanel(p, opt->rect, opt->palette,
opt->state & State_Sunken, 1,
&opt->palette.brush(QPalette::Button));
break;
case CE_HeaderEmptyArea:
p->fillRect(opt->rect, opt->palette.window());
break;
#if QT_CONFIG(combobox)
case CE_ComboBoxLabel:
if (const QStyleOptionComboBox *cb = qstyleoption_cast<const QStyleOptionComboBox *>(opt)) {
QRect editRect = proxy()->subControlRect(CC_ComboBox, cb, SC_ComboBoxEditField, widget);
p->save();
p->setClipRect(editRect);
if (!cb->currentIcon.isNull()) {
QIcon::Mode mode = cb->state & State_Enabled ? QIcon::Normal
: QIcon::Disabled;
QPixmap pixmap = cb->currentIcon.pixmap(qt_getWindow(widget), cb->iconSize, mode);
QRect iconRect(editRect);
iconRect.setWidth(cb->iconSize.width() + 4);
iconRect = alignedRect(cb->direction,
Qt::AlignLeft | Qt::AlignVCenter,
iconRect.size(), editRect);
if (cb->editable)
p->fillRect(iconRect, opt->palette.brush(QPalette::Base));
proxy()->drawItemPixmap(p, iconRect, Qt::AlignCenter, pixmap);
if (cb->direction == Qt::RightToLeft)
editRect.translate(-4 - cb->iconSize.width(), 0);
else
editRect.translate(cb->iconSize.width() + 4, 0);
}
if (!cb->currentText.isEmpty() && !cb->editable) {
proxy()->drawItemText(p, editRect.adjusted(1, 0, -1, 0),
visualAlignment(cb->direction, Qt::AlignLeft | Qt::AlignVCenter),
cb->palette, cb->state & State_Enabled, cb->currentText);
}
p->restore();
}
break;
#endif // QT_CONFIG(combobox)
#if QT_CONFIG(toolbar)
case CE_ToolBar:
if (const QStyleOptionToolBar *toolBar = qstyleoption_cast<const QStyleOptionToolBar *>(opt)) {
// Compatibility with styles that use PE_PanelToolBar
QStyleOptionFrame frame;
frame.QStyleOption::operator=(*toolBar);
frame.lineWidth = toolBar->lineWidth;
frame.midLineWidth = toolBar->midLineWidth;
proxy()->drawPrimitive(PE_PanelToolBar, opt, p, widget);
if (widget && qobject_cast<QToolBar *>(widget->parentWidget()))
break;
qDrawShadePanel(p, toolBar->rect, toolBar->palette, false, toolBar->lineWidth,
&toolBar->palette.brush(QPalette::Button));
}
break;
#endif // QT_CONFIG(toolbar)
case CE_ColumnViewGrip: {
// draw background gradients
QLinearGradient g(0, 0, opt->rect.width(), 0);
g.setColorAt(0, opt->palette.color(QPalette::Active, QPalette::Mid));
g.setColorAt(0.5, Qt::white);
p->fillRect(QRect(0, 0, opt->rect.width(), opt->rect.height()), g);
// draw the two lines
QPen pen(p->pen());
pen.setWidth(opt->rect.width()/20);
pen.setColor(opt->palette.color(QPalette::Active, QPalette::Dark));
p->setPen(pen);
int line1starting = opt->rect.width()*8 / 20;
int line2starting = opt->rect.width()*13 / 20;
int top = opt->rect.height()*20/75;
int bottom = opt->rect.height() - 1 - top;
p->drawLine(line1starting, top, line1starting, bottom);
p->drawLine(line2starting, top, line2starting, bottom);
}
break;
#if QT_CONFIG(itemviews)
case CE_ItemViewItem:
if (const QStyleOptionViewItem *vopt = qstyleoption_cast<const QStyleOptionViewItem *>(opt)) {
p->save();
p->setClipRect(opt->rect);
QRect checkRect = proxy()->subElementRect(SE_ItemViewItemCheckIndicator, vopt, widget);
QRect iconRect = proxy()->subElementRect(SE_ItemViewItemDecoration, vopt, widget);
QRect textRect = proxy()->subElementRect(SE_ItemViewItemText, vopt, widget);
// draw the background
proxy()->drawPrimitive(PE_PanelItemViewItem, opt, p, widget);
// draw the check mark
if (vopt->features & QStyleOptionViewItem::HasCheckIndicator) {
QStyleOptionViewItem option(*vopt);
option.rect = checkRect;
option.state = option.state & ~QStyle::State_HasFocus;
switch (vopt->checkState) {
case Qt::Unchecked:
option.state |= QStyle::State_Off;
break;
case Qt::PartiallyChecked:
option.state |= QStyle::State_NoChange;
break;
case Qt::Checked:
option.state |= QStyle::State_On;
break;
}
proxy()->drawPrimitive(QStyle::PE_IndicatorItemViewItemCheck, &option, p, widget);
}
// draw the icon
QIcon::Mode mode = QIcon::Normal;
if (!(vopt->state & QStyle::State_Enabled))
mode = QIcon::Disabled;
else if (vopt->state & QStyle::State_Selected)
mode = QIcon::Selected;
QIcon::State state = vopt->state & QStyle::State_Open ? QIcon::On : QIcon::Off;
vopt->icon.paint(p, iconRect, vopt->decorationAlignment, mode, state);
// draw the text
if (!vopt->text.isEmpty()) {
QPalette::ColorGroup cg = vopt->state & QStyle::State_Enabled
? QPalette::Normal : QPalette::Disabled;
if (cg == QPalette::Normal && !(vopt->state & QStyle::State_Active))
cg = QPalette::Inactive;
if (vopt->state & QStyle::State_Selected) {
p->setPen(vopt->palette.color(cg, QPalette::HighlightedText));
} else {
p->setPen(vopt->palette.color(cg, QPalette::Text));
}
if (vopt->state & QStyle::State_Editing) {
p->setPen(vopt->palette.color(cg, QPalette::Text));
p->drawRect(textRect.adjusted(0, 0, -1, -1));
}
d->viewItemDrawText(p, vopt, textRect);
}
// draw the focus rect
if (vopt->state & QStyle::State_HasFocus) {
QStyleOptionFocusRect o;
o.QStyleOption::operator=(*vopt);
o.rect = proxy()->subElementRect(SE_ItemViewItemFocusRect, vopt, widget);
o.state |= QStyle::State_KeyboardFocusChange;
o.state |= QStyle::State_Item;
QPalette::ColorGroup cg = (vopt->state & QStyle::State_Enabled)
? QPalette::Normal : QPalette::Disabled;
o.backgroundColor = vopt->palette.color(cg, (vopt->state & QStyle::State_Selected)
? QPalette::Highlight : QPalette::Window);
proxy()->drawPrimitive(QStyle::PE_FrameFocusRect, &o, p, widget);
}
p->restore();
}
break;
#endif // QT_CONFIG(itemviews)
#ifndef QT_NO_FRAME
case CE_ShapedFrame:
if (const QStyleOptionFrame *f = qstyleoption_cast<const QStyleOptionFrame *>(opt)) {
int frameShape = f->frameShape;
int frameShadow = QFrame::Plain;
if (f->state & QStyle::State_Sunken) {
frameShadow = QFrame::Sunken;
} else if (f->state & QStyle::State_Raised) {
frameShadow = QFrame::Raised;
}
int lw = f->lineWidth;
int mlw = f->midLineWidth;
QPalette::ColorRole foregroundRole = QPalette::WindowText;
if (widget)
foregroundRole = widget->foregroundRole();
switch (frameShape) {
case QFrame::Box:
if (frameShadow == QFrame::Plain) {
qDrawPlainRect(p, f->rect, f->palette.color(foregroundRole), lw);
} else {
qDrawShadeRect(p, f->rect, f->palette, frameShadow == QFrame::Sunken, lw, mlw);
}
break;
case QFrame::StyledPanel:
//keep the compatibility with Qt 4.4 if there is a proxy style.
//be sure to call drawPrimitive(QStyle::PE_Frame) on the proxy style
if (widget) {
widget->style()->drawPrimitive(QStyle::PE_Frame, opt, p, widget);
} else {
proxy()->drawPrimitive(QStyle::PE_Frame, opt, p, widget);
}
break;
case QFrame::Panel:
if (frameShadow == QFrame::Plain) {
qDrawPlainRect(p, f->rect, f->palette.color(foregroundRole), lw);
} else {
qDrawShadePanel(p, f->rect, f->palette, frameShadow == QFrame::Sunken, lw);
}
break;
case QFrame::WinPanel:
if (frameShadow == QFrame::Plain) {
qDrawPlainRect(p, f->rect, f->palette.color(foregroundRole), lw);
} else {
qDrawWinPanel(p, f->rect, f->palette, frameShadow == QFrame::Sunken);
}
break;
case QFrame::HLine:
case QFrame::VLine: {
QPoint p1, p2;
if (frameShape == QFrame::HLine) {
p1 = QPoint(opt->rect.x(), opt->rect.y() + opt->rect.height() / 2);
p2 = QPoint(opt->rect.x() + opt->rect.width(), p1.y());
} else {
p1 = QPoint(opt->rect.x() + opt->rect.width() / 2, opt->rect.y());
p2 = QPoint(p1.x(), p1.y() + opt->rect.height());
}
if (frameShadow == QFrame::Plain) {
QPen oldPen = p->pen();
p->setPen(QPen(opt->palette.brush(foregroundRole), lw));
p->drawLine(p1, p2);
p->setPen(oldPen);
} else {
qDrawShadeLine(p, p1, p2, f->palette, frameShadow == QFrame::Sunken, lw, mlw);
}
break;
}
}
}
break;
#endif
default:
break;
}
#if !QT_CONFIG(tabbar) && !QT_CONFIG(itemviews)
Q_UNUSED(d);
#endif
}
/*!
\reimp
*/
QRect QCommonStyle::subElementRect(SubElement sr, const QStyleOption *opt,
const QWidget *widget) const
{
Q_D(const QCommonStyle);
QRect r;
switch (sr) {
case SE_PushButtonContents:
if (const QStyleOptionButton *btn = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
int dx1, dx2;
dx1 = proxy()->pixelMetric(PM_DefaultFrameWidth, btn, widget);
if (btn->features & QStyleOptionButton::AutoDefaultButton)
dx1 += proxy()->pixelMetric(PM_ButtonDefaultIndicator, btn, widget);
dx2 = dx1 * 2;
r.setRect(opt->rect.x() + dx1, opt->rect.y() + dx1, opt->rect.width() - dx2,
opt->rect.height() - dx2);
r = visualRect(opt->direction, opt->rect, r);
}
break;
case SE_PushButtonFocusRect:
if (const QStyleOptionButton *btn = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
int dbw1 = 0, dbw2 = 0;
if (btn->features & QStyleOptionButton::AutoDefaultButton){
dbw1 = proxy()->pixelMetric(PM_ButtonDefaultIndicator, btn, widget);
dbw2 = dbw1 * 2;
}
int dfw1 = proxy()->pixelMetric(PM_DefaultFrameWidth, btn, widget) + 1,
dfw2 = dfw1 * 2;
r.setRect(btn->rect.x() + dfw1 + dbw1, btn->rect.y() + dfw1 + dbw1,
btn->rect.width() - dfw2 - dbw2, btn->rect.height()- dfw2 - dbw2);
r = visualRect(opt->direction, opt->rect, r);
}
break;
case SE_CheckBoxIndicator:
{
int h = proxy()->pixelMetric(PM_IndicatorHeight, opt, widget);
r.setRect(opt->rect.x(), opt->rect.y() + ((opt->rect.height() - h) / 2),
proxy()->pixelMetric(PM_IndicatorWidth, opt, widget), h);
r = visualRect(opt->direction, opt->rect, r);
}
break;
case SE_CheckBoxContents:
{
// Deal with the logical first, then convert it back to screen coords.
QRect ir = visualRect(opt->direction, opt->rect,
subElementRect(SE_CheckBoxIndicator, opt, widget));
int spacing = proxy()->pixelMetric(PM_CheckBoxLabelSpacing, opt, widget);
r.setRect(ir.right() + spacing, opt->rect.y(), opt->rect.width() - ir.width() - spacing,
opt->rect.height());
r = visualRect(opt->direction, opt->rect, r);
}
break;
case SE_CheckBoxFocusRect:
if (const QStyleOptionButton *btn = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
if (btn->icon.isNull() && btn->text.isEmpty()) {
r = subElementRect(SE_CheckBoxIndicator, opt, widget);
r.adjust(1, 1, -1, -1);
break;
}
// As above, deal with the logical first, then convert it back to screen coords.
QRect cr = visualRect(btn->direction, btn->rect,
subElementRect(SE_CheckBoxContents, btn, widget));
QRect iconRect, textRect;
if (!btn->text.isEmpty()) {
textRect = itemTextRect(opt->fontMetrics, cr, Qt::AlignAbsolute | Qt::AlignLeft
| Qt::AlignVCenter | Qt::TextShowMnemonic,
btn->state & State_Enabled, btn->text);
}
if (!btn->icon.isNull()) {
iconRect = itemPixmapRect(cr, Qt::AlignAbsolute | Qt::AlignLeft | Qt::AlignVCenter
| Qt::TextShowMnemonic,
btn->icon.pixmap(qt_getWindow(widget), btn->iconSize, QIcon::Normal));
if (!textRect.isEmpty())
textRect.translate(iconRect.right() + 4, 0);
}
r = iconRect | textRect;
r.adjust(-3, -2, 3, 2);
r = r.intersected(btn->rect);
r = visualRect(btn->direction, btn->rect, r);
}
break;
case SE_RadioButtonIndicator:
{
int h = proxy()->pixelMetric(PM_ExclusiveIndicatorHeight, opt, widget);
r.setRect(opt->rect.x(), opt->rect.y() + ((opt->rect.height() - h) / 2),
proxy()->pixelMetric(PM_ExclusiveIndicatorWidth, opt, widget), h);
r = visualRect(opt->direction, opt->rect, r);
}
break;
case SE_RadioButtonContents:
{
QRect ir = visualRect(opt->direction, opt->rect,
subElementRect(SE_RadioButtonIndicator, opt, widget));
int spacing = proxy()->pixelMetric(PM_RadioButtonLabelSpacing, opt, widget);
r.setRect(ir.left() + ir.width() + spacing, opt->rect.y(), opt->rect.width() - ir.width() - spacing,
opt->rect.height());
r = visualRect(opt->direction, opt->rect, r);
break;
}
case SE_RadioButtonFocusRect:
if (const QStyleOptionButton *btn = qstyleoption_cast<const QStyleOptionButton *>(opt)) {
if (btn->icon.isNull() && btn->text.isEmpty()) {
r = subElementRect(SE_RadioButtonIndicator, opt, widget);
r.adjust(1, 1, -1, -1);
break;
}
QRect cr = visualRect(btn->direction, btn->rect,
subElementRect(SE_RadioButtonContents, opt, widget));
QRect iconRect, textRect;
if (!btn->text.isEmpty()){
textRect = itemTextRect(opt->fontMetrics, cr, Qt::AlignAbsolute | Qt::AlignLeft | Qt::AlignVCenter
| Qt::TextShowMnemonic, btn->state & State_Enabled, btn->text);
}
if (!btn->icon.isNull()) {
iconRect = itemPixmapRect(cr, Qt::AlignAbsolute | Qt::AlignLeft | Qt::AlignVCenter | Qt::TextShowMnemonic,
btn->icon.pixmap(qt_getWindow(widget), btn->iconSize, QIcon::Normal));
if (!textRect.isEmpty())
textRect.translate(iconRect.right() + 4, 0);
}
r = iconRect | textRect;
r.adjust(-3, -2, 3, 2);
r = r.intersected(btn->rect);
r = visualRect(btn->direction, btn->rect, r);
}
break;
#if QT_CONFIG(slider)
case SE_SliderFocusRect:
if (const QStyleOptionSlider *slider = qstyleoption_cast<const QStyleOptionSlider *>(opt)) {
int tickOffset = proxy()->pixelMetric(PM_SliderTickmarkOffset, slider, widget);
int thickness = proxy()->pixelMetric(PM_SliderControlThickness, slider, widget);
if (slider->orientation == Qt::Horizontal)
r.setRect(0, tickOffset - 1, slider->rect.width(), thickness + 2);
else
r.setRect(tickOffset - 1, 0, thickness + 2, slider->rect.height());
r = r.intersected(slider->rect);
r = visualRect(opt->direction, opt->rect, r);
}
break;
#endif // QT_CONFIG(slider)
#if QT_CONFIG(progressbar)
case SE_ProgressBarGroove:
case SE_ProgressBarContents:
case SE_ProgressBarLabel:
if (const QStyleOptionProgressBar *pb = qstyleoption_cast<const QStyleOptionProgressBar *>(opt)) {
int textw = 0;
const bool vertical = pb->orientation == Qt::Vertical;
if (!vertical) {
if (pb->textVisible)
textw = qMax(pb->fontMetrics.horizontalAdvance(pb->text), pb->fontMetrics.horizontalAdvance(QLatin1String("100%"))) + 6;
}
if ((pb->textAlignment & Qt::AlignCenter) == 0) {
if (sr != SE_ProgressBarLabel)
r.setCoords(pb->rect.left(), pb->rect.top(),
pb->rect.right() - textw, pb->rect.bottom());
else
r.setCoords(pb->rect.right() - textw, pb->rect.top(),
pb->rect.right(), pb->rect.bottom());
} else {
r = pb->rect;
}
r = visualRect(pb->direction, pb->rect, r);
}
break;
#endif // QT_CONFIG(progressbar)
#if QT_CONFIG(combobox)
case SE_ComboBoxFocusRect:
if (const QStyleOptionComboBox *cb = qstyleoption_cast<const QStyleOptionComboBox *>(opt)) {
int margin = cb->frame ? 3 : 0;
r.setRect(opt->rect.left() + margin, opt->rect.top() + margin,
opt->rect.width() - 2*margin - 16, opt->rect.height() - 2*margin);
r = visualRect(opt->direction, opt->rect, r);
}
break;
#endif // QT_CONFIG(combobox)
#if QT_CONFIG(toolbox)
case SE_ToolBoxTabContents:
r = opt->rect;
r.adjust(0, 0, -30, 0);
break;
#endif // QT_CONFIG(toolbox)
case SE_HeaderLabel: {
int margin = proxy()->pixelMetric(QStyle::PM_HeaderMargin, opt, widget);
r.setRect(opt->rect.x() + margin, opt->rect.y() + margin,
opt->rect.width() - margin * 2, opt->rect.height() - margin * 2);
if (const QStyleOptionHeader *header = qstyleoption_cast<const QStyleOptionHeader *>(opt)) {
// Subtract width needed for arrow, if there is one
if (header->sortIndicator != QStyleOptionHeader::None) {
if (opt->state & State_Horizontal)
r.setWidth(r.width() - (opt->rect.height() / 2) - (margin * 2));
else
r.setHeight(r.height() - (opt->rect.width() / 2) - (margin * 2));
}
}
r = visualRect(opt->direction, opt->rect, r);
break; }
case SE_HeaderArrow: {
int h = opt->rect.height();
int w = opt->rect.width();
int x = opt->rect.x();
int y = opt->rect.y();
int margin = proxy()->pixelMetric(QStyle::PM_HeaderMargin, opt, widget);
if (opt->state & State_Horizontal) {
int horiz_size = h / 2;
r.setRect(x + w - margin * 2 - horiz_size, y + 5,
horiz_size, h - margin * 2 - 5);
} else {
int vert_size = w / 2;
r.setRect(x + 5, y + h - margin * 2 - vert_size,
w - margin * 2 - 5, vert_size);
}
r = visualRect(opt->direction, opt->rect, r);
break; }
case SE_RadioButtonClickRect:
r = subElementRect(SE_RadioButtonFocusRect, opt, widget);
r |= subElementRect(SE_RadioButtonIndicator, opt, widget);
break;
case SE_CheckBoxClickRect:
r = subElementRect(SE_CheckBoxFocusRect, opt, widget);
r |= subElementRect(SE_CheckBoxIndicator, opt, widget);
break;
#if QT_CONFIG(tabwidget)
case SE_TabWidgetTabBar:
if (const QStyleOptionTabWidgetFrame *twf
= qstyleoption_cast<const QStyleOptionTabWidgetFrame *>(opt)) {
r.setSize(twf->tabBarSize);
const uint alingMask = Qt::AlignLeft | Qt::AlignRight | Qt::AlignHCenter;
switch (twf->shape) {
case QTabBar::RoundedNorth:
case QTabBar::TriangularNorth:
// Constrain the size now, otherwise, center could get off the page
// This of course repeated for all the other directions
r.setWidth(qMin(r.width(), twf->rect.width()
- twf->leftCornerWidgetSize.width()
- twf->rightCornerWidgetSize.width()));
switch (proxy()->styleHint(SH_TabBar_Alignment, twf, widget) & alingMask) {
default:
case Qt::AlignLeft:
r.moveTopLeft(QPoint(twf->leftCornerWidgetSize.width(), 0));
break;
case Qt::AlignHCenter:
r.moveTopLeft(QPoint(twf->rect.center().x() - qRound(r.width() / 2.0f)
+ (twf->leftCornerWidgetSize.width() / 2)
- (twf->rightCornerWidgetSize.width() / 2), 0));
break;
case Qt::AlignRight:
r.moveTopLeft(QPoint(twf->rect.width() - twf->tabBarSize.width()
- twf->rightCornerWidgetSize.width(), 0));
break;
}
r = visualRect(twf->direction, twf->rect, r);
break;
case QTabBar::RoundedSouth:
case QTabBar::TriangularSouth:
r.setWidth(qMin(r.width(), twf->rect.width()
- twf->leftCornerWidgetSize.width()
- twf->rightCornerWidgetSize.width()));
switch (proxy()->styleHint(SH_TabBar_Alignment, twf, widget) & alingMask) {
default:
case Qt::AlignLeft:
r.moveTopLeft(QPoint(twf->leftCornerWidgetSize.width(),
twf->rect.height() - twf->tabBarSize.height()));
break;
case Qt::AlignHCenter:
r.moveTopLeft(QPoint(twf->rect.center().x() - qRound(r.width() / 2.0f)
+ (twf->leftCornerWidgetSize.width() / 2)
- (twf->rightCornerWidgetSize.width() / 2),
twf->rect.height() - twf->tabBarSize.height()));
break;
case Qt::AlignRight:
r.moveTopLeft(QPoint(twf->rect.width() - twf->tabBarSize.width()
- twf->rightCornerWidgetSize.width(),
twf->rect.height() - twf->tabBarSize.height()));
break;
}
r = visualRect(twf->direction, twf->rect, r);
break;
case QTabBar::RoundedEast:
case QTabBar::TriangularEast:
r.setHeight(qMin(r.height(), twf->rect.height()
- twf->leftCornerWidgetSize.height()
- twf->rightCornerWidgetSize.height()));
switch (proxy()->styleHint(SH_TabBar_Alignment, twf, widget) & alingMask) {
default:
case Qt::AlignLeft:
r.moveTopLeft(QPoint(twf->rect.width() - twf->tabBarSize.width(),
twf->leftCornerWidgetSize.height()));
break;
case Qt::AlignHCenter:
r.moveTopLeft(QPoint(twf->rect.width() - twf->tabBarSize.width(),
twf->rect.center().y() - r.height() / 2));
break;
case Qt::AlignRight:
r.moveTopLeft(QPoint(twf->rect.width() - twf->tabBarSize.width(),
twf->rect.height() - twf->tabBarSize.height()
- twf->rightCornerWidgetSize.height()));
break;
}
break;
case QTabBar::RoundedWest:
case QTabBar::TriangularWest:
r.setHeight(qMin(r.height(), twf->rect.height()
- twf->leftCornerWidgetSize.height()
- twf->rightCornerWidgetSize.height()));
switch (proxy()->styleHint(SH_TabBar_Alignment, twf, widget) & alingMask) {
default:
case Qt::AlignLeft:
r.moveTopLeft(QPoint(0, twf->leftCornerWidgetSize.height()));
break;
case Qt::AlignHCenter:
r.moveTopLeft(QPoint(0, twf->rect.center().y() - r.height() / 2));
break;
case Qt::AlignRight:
r.moveTopLeft(QPoint(0, twf->rect.height() - twf->tabBarSize.height()
- twf->rightCornerWidgetSize.height()));
break;
}
break;
}
}
break;
case SE_TabWidgetTabPane:
case SE_TabWidgetTabContents:
if (const QStyleOptionTabWidgetFrame *twf = qstyleoption_cast<const QStyleOptionTabWidgetFrame *>(opt)) {
QStyleOptionTab tabopt;
tabopt.shape = twf->shape;
int overlap = proxy()->pixelMetric(PM_TabBarBaseOverlap, &tabopt, widget);
if (twf->lineWidth == 0)
overlap = 0;
switch (twf->shape) {
case QTabBar::RoundedNorth:
case QTabBar::TriangularNorth:
r = QRect(QPoint(0,qMax(twf->tabBarSize.height() - overlap, 0)),
QSize(twf->rect.width(), qMin(twf->rect.height() - twf->tabBarSize.height() + overlap, twf->rect.height())));
break;
case QTabBar::RoundedSouth:
case QTabBar::TriangularSouth:
r = QRect(QPoint(0,0), QSize(twf->rect.width(), qMin(twf->rect.height() - twf->tabBarSize.height() + overlap, twf->rect.height())));
break;
case QTabBar::RoundedEast:
case QTabBar::TriangularEast:
r = QRect(QPoint(0, 0), QSize(qMin(twf->rect.width() - twf->tabBarSize.width() + overlap, twf->rect.width()), twf->rect.height()));
break;
case QTabBar::RoundedWest:
case QTabBar::TriangularWest:
r = QRect(QPoint(qMax(twf->tabBarSize.width() - overlap, 0), 0),
QSize(qMin(twf->rect.width() - twf->tabBarSize.width() + overlap, twf->rect.width()), twf->rect.height()));
break;
}
if (sr == SE_TabWidgetTabContents && twf->lineWidth > 0)
r.adjust(2, 2, -2, -2);
}
break;
case SE_TabWidgetLeftCorner:
if (const QStyleOptionTabWidgetFrame *twf = qstyleoption_cast<const QStyleOptionTabWidgetFrame *>(opt)) {
QRect paneRect = subElementRect(SE_TabWidgetTabPane, twf, widget);
switch (twf->shape) {
case QTabBar::RoundedNorth:
case QTabBar::TriangularNorth:
r = QRect(QPoint(paneRect.x(), paneRect.y() - twf->leftCornerWidgetSize.height()),
twf->leftCornerWidgetSize);
break;
case QTabBar::RoundedSouth:
case QTabBar::TriangularSouth:
r = QRect(QPoint(paneRect.x(), paneRect.height()), twf->leftCornerWidgetSize);
break;
default:
break;
}
r = visualRect(twf->direction, twf->rect, r);
}
break;
case SE_TabWidgetRightCorner:
if (const QStyleOptionTabWidgetFrame *twf = qstyleoption_cast<const QStyleOptionTabWidgetFrame *>(opt)) {
QRect paneRect = subElementRect(SE_TabWidgetTabPane, twf, widget);
switch (twf->shape) {
case QTabBar::RoundedNorth:
case QTabBar::TriangularNorth:
r = QRect(QPoint(paneRect.width() - twf->rightCornerWidgetSize.width(),
paneRect.y() - twf->rightCornerWidgetSize.height()),
twf->rightCornerWidgetSize);
break;
case QTabBar::RoundedSouth:
case QTabBar::TriangularSouth:
r = QRect(QPoint(paneRect.width() - twf->rightCornerWidgetSize.width(),
paneRect.height()), twf->rightCornerWidgetSize);
break;
default:
break;
}
r = visualRect(twf->direction, twf->rect, r);
}
break;
case SE_TabBarTabText:
if (const QStyleOptionTab *tab = qstyleoption_cast<const QStyleOptionTab *>(opt)) {
QRect dummyIconRect;
d->tabLayout(tab, widget, &r, &dummyIconRect);
}
break;
case SE_TabBarTabLeftButton:
case SE_TabBarTabRightButton:
if (const QStyleOptionTab *tab = qstyleoption_cast<const QStyleOptionTab *>(opt)) {
bool selected = tab->state & State_Selected;
int verticalShift = proxy()->pixelMetric(QStyle::PM_TabBarTabShiftVertical, tab, widget);
int horizontalShift = proxy()->pixelMetric(QStyle::PM_TabBarTabShiftHorizontal, tab, widget);
int hpadding = proxy()->pixelMetric(QStyle::PM_TabBarTabHSpace, opt, widget) / 2;
hpadding = qMax(hpadding, 4); //workaround KStyle returning 0 because they workaround an old bug in Qt
bool verticalTabs = tab->shape == QTabBar::RoundedEast
|| tab->shape == QTabBar::RoundedWest
|| tab->shape == QTabBar::TriangularEast
|| tab->shape == QTabBar::TriangularWest;
QRect tr = tab->rect;
if (tab->shape == QTabBar::RoundedSouth || tab->shape == QTabBar::TriangularSouth)
verticalShift = -verticalShift;
if (verticalTabs) {
qSwap(horizontalShift, verticalShift);
horizontalShift *= -1;
verticalShift *= -1;
}
if (tab->shape == QTabBar::RoundedWest || tab->shape == QTabBar::TriangularWest)
horizontalShift = -horizontalShift;
tr.adjust(0, 0, horizontalShift, verticalShift);
if (selected)
{
tr.setBottom(tr.bottom() - verticalShift);
tr.setRight(tr.right() - horizontalShift);
}
QSize size = (sr == SE_TabBarTabLeftButton) ? tab->leftButtonSize : tab->rightButtonSize;
int w = size.width();
int h = size.height();
int midHeight = static_cast<int>(qCeil(float(tr.height() - h) / 2));
int midWidth = ((tr.width() - w) / 2);
bool atTheTop = true;
switch (tab->shape) {
case QTabBar::RoundedWest:
case QTabBar::TriangularWest:
atTheTop = (sr == SE_TabBarTabLeftButton);
break;
case QTabBar::RoundedEast:
case QTabBar::TriangularEast:
atTheTop = (sr == SE_TabBarTabRightButton);
break;
default:
if (sr == SE_TabBarTabLeftButton)
r = QRect(tab->rect.x() + hpadding, midHeight, w, h);
else
r = QRect(tab->rect.right() - w - hpadding, midHeight, w, h);
r = visualRect(tab->direction, tab->rect, r);
}
if (verticalTabs) {
if (atTheTop)
r = QRect(midWidth, tr.y() + tab->rect.height() - hpadding - h, w, h);
else
r = QRect(midWidth, tr.y() + hpadding, w, h);
}
}
break;
#endif // QT_CONFIG(tabwidget)
#if QT_CONFIG(tabbar)
case SE_TabBarTearIndicator:
if (const QStyleOptionTab *tab = qstyleoption_cast<const QStyleOptionTab *>(opt)) {
switch (tab->shape) {
case QTabBar::RoundedNorth:
case QTabBar::TriangularNorth:
case QTabBar::RoundedSouth:
case QTabBar::TriangularSouth:
r.setRect(tab->rect.left(), tab->rect.top(), 8, opt->rect.height());
break;
case QTabBar::RoundedWest:
case QTabBar::TriangularWest:
case QTabBar::RoundedEast:
case QTabBar::TriangularEast:
r.setRect(tab->rect.left(), tab->rect.top(), opt->rect.width(), 8);
break;
default:
break;
}
r = visualRect(opt->direction, opt->rect, r);
}
break;
case SE_TabBarScrollLeftButton: {
const bool vertical = opt->rect.width() < opt->rect.height();
const Qt::LayoutDirection ld = widget->layoutDirection();
const int buttonWidth = qMax(proxy()->pixelMetric(QStyle::PM_TabBarScrollButtonWidth, 0, widget), QApplication::globalStrut().width());
const int buttonOverlap = proxy()->pixelMetric(QStyle::PM_TabBar_ScrollButtonOverlap, 0, widget);
r = vertical ? QRect(0, opt->rect.height() - (buttonWidth * 2) + buttonOverlap, opt->rect.width(), buttonWidth)
: QStyle::visualRect(ld, opt->rect, QRect(opt->rect.width() - (buttonWidth * 2) + buttonOverlap, 0, buttonWidth, opt->rect.height()));
break; }
case SE_TabBarScrollRightButton: {
const bool vertical = opt->rect.width() < opt->rect.height();
const Qt::LayoutDirection ld = widget->layoutDirection();
const int buttonWidth = qMax(proxy()->pixelMetric(QStyle::PM_TabBarScrollButtonWidth, 0, widget), QApplication::globalStrut().width());
r = vertical ? QRect(0, opt->rect.height() - buttonWidth, opt->rect.width(), buttonWidth)
: QStyle::visualRect(ld, opt->rect, QRect(opt->rect.width() - buttonWidth, 0, buttonWidth, opt->rect.height()));
break; }
#endif
case SE_TreeViewDisclosureItem:
r = opt->rect;
break;
case SE_LineEditContents:
if (const QStyleOptionFrame *f = qstyleoption_cast<const QStyleOptionFrame *>(opt)) {
r = f->rect.adjusted(f->lineWidth, f->lineWidth, -f->lineWidth, -f->lineWidth);
r = visualRect(opt->direction, opt->rect, r);
}
break;
case SE_FrameContents:
if (const QStyleOptionFrame *f = qstyleoption_cast<const QStyleOptionFrame *>(opt)) {
int fw = proxy()->pixelMetric(PM_DefaultFrameWidth, f, widget);
r = opt->rect.adjusted(fw, fw, -fw, -fw);
r = visualRect(opt->direction, opt->rect, r);
}
break;
case SE_ShapedFrameContents:
if (const QStyleOptionFrame *f = qstyleoption_cast<const QStyleOptionFrame *>(opt)) {
int frameShape = f->frameShape;
int frameShadow = QFrame::Plain;
if (f->state & QStyle::State_Sunken) {
frameShadow = QFrame::Sunken;
} else if (f->state & QStyle::State_Raised) {
frameShadow = QFrame::Raised;
}
int frameWidth = 0;
switch (frameShape) {
case QFrame::NoFrame:
frameWidth = 0;
break;
case QFrame::Box:
case QFrame::HLine:
case QFrame::VLine:
switch (frameShadow) {
case QFrame::Plain:
frameWidth = f->lineWidth;
break;
case QFrame::Raised:
case QFrame::Sunken:
frameWidth = (short)(f->lineWidth*2 + f->midLineWidth);
break;
}
break;
case QFrame::StyledPanel:
//keep the compatibility with Qt 4.4 if there is a proxy style.
//be sure to call drawPrimitive(QStyle::SE_FrameContents) on the proxy style
if (widget)
return widget->style()->subElementRect(QStyle::SE_FrameContents, opt, widget);
else
return subElementRect(QStyle::SE_FrameContents, opt, widget);
case QFrame::WinPanel:
frameWidth = 2;
break;
case QFrame::Panel:
switch (frameShadow) {
case QFrame::Plain:
case QFrame::Raised:
case QFrame::Sunken:
frameWidth = f->lineWidth;
break;
}
break;
}
r = f->rect.adjusted(frameWidth, frameWidth, -frameWidth, -frameWidth);
}
break;
#if QT_CONFIG(dockwidget)
case SE_DockWidgetCloseButton:
case SE_DockWidgetFloatButton:
case SE_DockWidgetTitleBarText:
case SE_DockWidgetIcon: {
int iconSize = proxy()->pixelMetric(PM_SmallIconSize, opt, widget);
int buttonMargin = proxy()->pixelMetric(PM_DockWidgetTitleBarButtonMargin, opt, widget);
int margin = proxy()->pixelMetric(QStyle::PM_DockWidgetTitleMargin, opt, widget);
QRect rect = opt->rect;
const QStyleOptionDockWidget *dwOpt
= qstyleoption_cast<const QStyleOptionDockWidget*>(opt);
bool canClose = dwOpt == 0 ? true : dwOpt->closable;
bool canFloat = dwOpt == 0 ? false : dwOpt->floatable;
const bool verticalTitleBar = dwOpt && dwOpt->verticalTitleBar;
// If this is a vertical titlebar, we transpose and work as if it was
// horizontal, then transpose again.
if (verticalTitleBar)
rect = rect.transposed();
do {
int right = rect.right();
int left = rect.left();
QRect closeRect;
if (canClose) {
QSize sz = proxy()->standardIcon(QStyle::SP_TitleBarCloseButton,
opt, widget).actualSize(QSize(iconSize, iconSize));
sz += QSize(buttonMargin, buttonMargin);
if (verticalTitleBar)
sz = sz.transposed();
closeRect = QRect(right - sz.width(),
rect.center().y() - sz.height()/2,
sz.width(), sz.height());
right = closeRect.left() - 1;
}
if (sr == SE_DockWidgetCloseButton) {
r = closeRect;
break;
}
QRect floatRect;
if (canFloat) {
QSize sz = proxy()->standardIcon(QStyle::SP_TitleBarNormalButton,
opt, widget).actualSize(QSize(iconSize, iconSize));
sz += QSize(buttonMargin, buttonMargin);
if (verticalTitleBar)
sz = sz.transposed();
floatRect = QRect(right - sz.width(),
rect.center().y() - sz.height()/2,
sz.width(), sz.height());
right = floatRect.left() - 1;
}
if (sr == SE_DockWidgetFloatButton) {
r = floatRect;
break;
}
QRect iconRect;
if (const QDockWidget *dw = qobject_cast<const QDockWidget*>(widget)) {
QIcon icon;
if (dw->isFloating())
icon = dw->windowIcon();
if (!icon.isNull()
&& icon.cacheKey() != QApplication::windowIcon().cacheKey()) {
QSize sz = icon.actualSize(QSize(r.height(), r.height()));
if (verticalTitleBar)
sz = sz.transposed();
iconRect = QRect(left, rect.center().y() - sz.height()/2,
sz.width(), sz.height());
left = iconRect.right() + margin;
}
}
if (sr == SE_DockWidgetIcon) {
r = iconRect;
break;
}
QRect textRect = QRect(left, rect.top(),
right - left, rect.height());
if (sr == SE_DockWidgetTitleBarText) {
r = textRect;
break;
}
} while (false);
if (verticalTitleBar) {
r = QRect(rect.left() + r.top() - rect.top(),
rect.top() + rect.right() - r.right(),
r.height(), r.width());
} else {
r = visualRect(opt->direction, rect, r);
}
break;
}
#endif
#if QT_CONFIG(itemviews)
case SE_ItemViewItemCheckIndicator:
if (!qstyleoption_cast<const QStyleOptionViewItem *>(opt)) {
r = subElementRect(SE_CheckBoxIndicator, opt, widget);
break;
}
Q_FALLTHROUGH();
case SE_ItemViewItemDecoration:
case SE_ItemViewItemText:
case SE_ItemViewItemFocusRect:
if (const QStyleOptionViewItem *vopt = qstyleoption_cast<const QStyleOptionViewItem *>(opt)) {
if (!d->isViewItemCached(*vopt)) {
d->viewItemLayout(vopt, &d->checkRect, &d->decorationRect, &d->displayRect, false);
if (d->cachedOption) {
delete d->cachedOption;
d->cachedOption = 0;
}
d->cachedOption = new QStyleOptionViewItem(*vopt);
}
if (sr == SE_ItemViewItemCheckIndicator)
r = d->checkRect;
else if (sr == SE_ItemViewItemDecoration)
r = d->decorationRect;
else if (sr == SE_ItemViewItemText || sr == SE_ItemViewItemFocusRect)
r = d->displayRect;
}
break;
#endif // QT_CONFIG(itemviews)
#if QT_CONFIG(toolbar)
case SE_ToolBarHandle:
if (const QStyleOptionToolBar *tbopt = qstyleoption_cast<const QStyleOptionToolBar *>(opt)) {
if (tbopt->features & QStyleOptionToolBar::Movable) {
///we need to access the widget here because the style option doesn't
//have all the information we need (ie. the layout's margin)
const QToolBar *tb = qobject_cast<const QToolBar*>(widget);
const QMargins margins = tb && tb->layout() ? tb->layout()->contentsMargins() : QMargins(2, 2, 2, 2);
const int handleExtent = proxy()->pixelMetric(QStyle::PM_ToolBarHandleExtent, opt, tb);
if (tbopt->state & QStyle::State_Horizontal) {
r = QRect(margins.left(), margins.top(),
handleExtent,
tbopt->rect.height() - (margins.top() + margins.bottom()));
r = QStyle::visualRect(tbopt->direction, tbopt->rect, r);
} else {
r = QRect(margins.left(), margins.top(),
tbopt->rect.width() - (margins.left() + margins.right()),
handleExtent);
}
}
}
break;
#endif // QT_CONFIG(toolbar)
default:
break;
}
return r;
#if !QT_CONFIG(tabwidget) && !QT_CONFIG(itemviews)
Q_UNUSED(d);
#endif
}
#if QT_CONFIG(dial)
// in lieu of std::array, minimal API
template <int N>
struct StaticPolygonF
{
QPointF data[N];
Q_DECL_CONSTEXPR int size() const { return N; }
Q_DECL_CONSTEXPR const QPointF *cbegin() const { return data; }
Q_DECL_CONSTEXPR const QPointF &operator[](int idx) const { return data[idx]; }
};
static StaticPolygonF<3> calcArrow(const QStyleOptionSlider *dial, qreal &a)
{
int width = dial->rect.width();
int height = dial->rect.height();
int r = qMin(width, height) / 2;
int currentSliderPosition = dial->upsideDown ? dial->sliderPosition : (dial->maximum - dial->sliderPosition);
if (dial->maximum == dial->minimum)
a = Q_PI / 2;
else if (dial->dialWrapping)
a = Q_PI * 3 / 2 - (currentSliderPosition - dial->minimum) * 2 * Q_PI
/ (dial->maximum - dial->minimum);
else
a = (Q_PI * 8 - (currentSliderPosition - dial->minimum) * 10 * Q_PI
/ (dial->maximum - dial->minimum)) / 6;
int xc = width / 2;
int yc = height / 2;
int len = r - QStyleHelper::calcBigLineSize(r) - 5;
if (len < 5)
len = 5;
int back = len / 2;
StaticPolygonF<3> arrow = {{
QPointF(0.5 + xc + len * qCos(a),
0.5 + yc - len * qSin(a)),
QPointF(0.5 + xc + back * qCos(a + Q_PI * 5 / 6),
0.5 + yc - back * qSin(a + Q_PI * 5 / 6)),
QPointF(0.5 + xc + back * qCos(a - Q_PI * 5 / 6),
0.5 + yc - back * qSin(a - Q_PI * 5 / 6)),
}};
return arrow;
}
#endif // QT_CONFIG(dial)
/*!
\reimp
*/
void QCommonStyle::drawComplexControl(ComplexControl cc, const QStyleOptionComplex *opt,
QPainter *p, const QWidget *widget) const
{
switch (cc) {
#if QT_CONFIG(slider)
case CC_Slider:
if (const QStyleOptionSlider *slider = qstyleoption_cast<const QStyleOptionSlider *>(opt)) {
if (slider->subControls == SC_SliderTickmarks) {
int tickOffset = proxy()->pixelMetric(PM_SliderTickmarkOffset, slider, widget);
int ticks = slider->tickPosition;
int thickness = proxy()->pixelMetric(PM_SliderControlThickness, slider, widget);
int len = proxy()->pixelMetric(PM_SliderLength, slider, widget);
int available = proxy()->pixelMetric(PM_SliderSpaceAvailable, slider, widget);
int interval = slider->tickInterval;
if (interval <= 0) {
interval = slider->singleStep;
if (QStyle::sliderPositionFromValue(slider->minimum, slider->maximum, interval,
available)
- QStyle::sliderPositionFromValue(slider->minimum, slider->maximum,
0, available) < 3)
interval = slider->pageStep;
}
if (!interval)
interval = 1;
int fudge = len / 2;
int pos;
// Since there is no subrect for tickmarks do a translation here.
p->save();
p->translate(slider->rect.x(), slider->rect.y());
p->setPen(slider->palette.windowText().color());
int v = slider->minimum;
while (v <= slider->maximum + 1) {
if (v == slider->maximum + 1 && interval == 1)
break;
const int v_ = qMin(v, slider->maximum);
pos = QStyle::sliderPositionFromValue(slider->minimum, slider->maximum,
v_, available) + fudge;
if (slider->orientation == Qt::Horizontal) {
if (ticks & QSlider::TicksAbove)
p->drawLine(pos, 0, pos, tickOffset - 2);
if (ticks & QSlider::TicksBelow)
p->drawLine(pos, tickOffset + thickness + 1, pos,
slider->rect.height()-1);
} else {
if (ticks & QSlider::TicksAbove)
p->drawLine(0, pos, tickOffset - 2, pos);
if (ticks & QSlider::TicksBelow)
p->drawLine(tickOffset + thickness + 1, pos,
slider->rect.width()-1, pos);
}
// in the case where maximum is max int
int nextInterval = v + interval;
if (nextInterval < v)
break;
v = nextInterval;
}
p->restore();
}
}
break;
#endif // QT_CONFIG(slider)
#if QT_CONFIG(scrollbar)
case CC_ScrollBar:
if (const QStyleOptionSlider *scrollbar = qstyleoption_cast<const QStyleOptionSlider *>(opt)) {
// Make a copy here and reset it for each primitive.
QStyleOptionSlider newScrollbar = *scrollbar;
State saveFlags = scrollbar->state;
if (scrollbar->subControls & SC_ScrollBarSubLine) {
newScrollbar.state = saveFlags;
newScrollbar.rect = proxy()->subControlRect(cc, &newScrollbar, SC_ScrollBarSubLine, widget);
if (newScrollbar.rect.isValid()) {
if (!(scrollbar->activeSubControls & SC_ScrollBarSubLine))
newScrollbar.state &= ~(State_Sunken | State_MouseOver);
proxy()->drawControl(CE_ScrollBarSubLine, &newScrollbar, p, widget);
}
}
if (scrollbar->subControls & SC_ScrollBarAddLine) {
newScrollbar.rect = scrollbar->rect;
newScrollbar.state = saveFlags;
newScrollbar.rect = proxy()->subControlRect(cc, &newScrollbar, SC_ScrollBarAddLine, widget);
if (newScrollbar.rect.isValid()) {
if (!(scrollbar->activeSubControls & SC_ScrollBarAddLine))
newScrollbar.state &= ~(State_Sunken | State_MouseOver);
proxy()->drawControl(CE_ScrollBarAddLine, &newScrollbar, p, widget);
}
}
if (scrollbar->subControls & SC_ScrollBarSubPage) {
newScrollbar.rect = scrollbar->rect;
newScrollbar.state = saveFlags;
newScrollbar.rect = proxy()->subControlRect(cc, &newScrollbar, SC_ScrollBarSubPage, widget);
if (newScrollbar.rect.isValid()) {
if (!(scrollbar->activeSubControls & SC_ScrollBarSubPage))
newScrollbar.state &= ~(State_Sunken | State_MouseOver);
proxy()->drawControl(CE_ScrollBarSubPage, &newScrollbar, p, widget);
}
}
if (scrollbar->subControls & SC_ScrollBarAddPage) {
newScrollbar.rect = scrollbar->rect;
newScrollbar.state = saveFlags;
newScrollbar.rect = proxy()->subControlRect(cc, &newScrollbar, SC_ScrollBarAddPage, widget);
if (newScrollbar.rect.isValid()) {
if (!(scrollbar->activeSubControls & SC_ScrollBarAddPage))
newScrollbar.state &= ~(State_Sunken | State_MouseOver);
proxy()->drawControl(CE_ScrollBarAddPage, &newScrollbar, p, widget);
}
}
if (scrollbar->subControls & SC_ScrollBarFirst) {
newScrollbar.rect = scrollbar->rect;
newScrollbar.state = saveFlags;
newScrollbar.rect = proxy()->subControlRect(cc, &newScrollbar, SC_ScrollBarFirst, widget);
if (newScrollbar.rect.isValid()) {
if (!(scrollbar->activeSubControls & SC_ScrollBarFirst))
newScrollbar.state &= ~(State_Sunken | State_MouseOver);
proxy()->drawControl(CE_ScrollBarFirst, &newScrollbar, p, widget);
}
}
if (scrollbar->subControls & SC_ScrollBarLast) {
newScrollbar.rect = scrollbar->rect;
newScrollbar.state = saveFlags;
newScrollbar.rect = proxy()->subControlRect(cc, &newScrollbar, SC_ScrollBarLast, widget);
if (newScrollbar.rect.isValid()) {
if (!(scrollbar->activeSubControls & SC_ScrollBarLast))
newScrollbar.state &= ~(State_Sunken | State_MouseOver);
proxy()->drawControl(CE_ScrollBarLast, &newScrollbar, p, widget);
}
}
if (scrollbar->subControls & SC_ScrollBarSlider) {
newScrollbar.rect = scrollbar->rect;
newScrollbar.state = saveFlags;
newScrollbar.rect = proxy()->subControlRect(cc, &newScrollbar, SC_ScrollBarSlider, widget);
if (newScrollbar.rect.isValid()) {
if (!(scrollbar->activeSubControls & SC_ScrollBarSlider))
newScrollbar.state &= ~(State_Sunken | State_MouseOver);
proxy()->drawControl(CE_ScrollBarSlider, &newScrollbar, p, widget);
if (scrollbar->state & State_HasFocus) {
QStyleOptionFocusRect fropt;
fropt.QStyleOption::operator=(newScrollbar);
fropt.rect.setRect(newScrollbar.rect.x() + 2, newScrollbar.rect.y() + 2,
newScrollbar.rect.width() - 5,
newScrollbar.rect.height() - 5);
proxy()->drawPrimitive(PE_FrameFocusRect, &fropt, p, widget);
}
}
}
}
break;
#endif // QT_CONFIG(scrollbar)
#if QT_CONFIG(spinbox)
case CC_SpinBox:
if (const QStyleOptionSpinBox *sb = qstyleoption_cast<const QStyleOptionSpinBox *>(opt)) {
QStyleOptionSpinBox copy = *sb;
PrimitiveElement pe;
if (sb->frame && (sb->subControls & SC_SpinBoxFrame)) {
QRect r = proxy()->subControlRect(CC_SpinBox, sb, SC_SpinBoxFrame, widget);
qDrawWinPanel(p, r, sb->palette, true);
}
if (sb->subControls & SC_SpinBoxUp) {
copy.subControls = SC_SpinBoxUp;
QPalette pal2 = sb->palette;
if (!(sb->stepEnabled & QAbstractSpinBox::StepUpEnabled)) {
pal2.setCurrentColorGroup(QPalette::Disabled);
copy.state &= ~State_Enabled;
}
copy.palette = pal2;
if (sb->activeSubControls == SC_SpinBoxUp && (sb->state & State_Sunken)) {
copy.state |= State_On;
copy.state |= State_Sunken;
} else {
copy.state |= State_Raised;
copy.state &= ~State_Sunken;
}
pe = (sb->buttonSymbols == QAbstractSpinBox::PlusMinus ? PE_IndicatorSpinPlus
: PE_IndicatorSpinUp);
copy.rect = proxy()->subControlRect(CC_SpinBox, sb, SC_SpinBoxUp, widget);
proxy()->drawPrimitive(PE_PanelButtonBevel, ©, p, widget);
copy.rect.adjust(3, 0, -4, 0);
proxy()->drawPrimitive(pe, ©, p, widget);
}
if (sb->subControls & SC_SpinBoxDown) {
copy.subControls = SC_SpinBoxDown;
copy.state = sb->state;
QPalette pal2 = sb->palette;
if (!(sb->stepEnabled & QAbstractSpinBox::StepDownEnabled)) {
pal2.setCurrentColorGroup(QPalette::Disabled);
copy.state &= ~State_Enabled;
}
copy.palette = pal2;
if (sb->activeSubControls == SC_SpinBoxDown && (sb->state & State_Sunken)) {
copy.state |= State_On;
copy.state |= State_Sunken;
} else {
copy.state |= State_Raised;
copy.state &= ~State_Sunken;
}
pe = (sb->buttonSymbols == QAbstractSpinBox::PlusMinus ? PE_IndicatorSpinMinus
: PE_IndicatorSpinDown);
copy.rect = proxy()->subControlRect(CC_SpinBox, sb, SC_SpinBoxDown, widget);
proxy()->drawPrimitive(PE_PanelButtonBevel, ©, p, widget);
copy.rect.adjust(3, 0, -4, 0);
proxy()->drawPrimitive(pe, ©, p, widget);
}
}
break;
#endif // QT_CONFIG(spinbox)
#if QT_CONFIG(toolbutton)
case CC_ToolButton:
if (const QStyleOptionToolButton *toolbutton
= qstyleoption_cast<const QStyleOptionToolButton *>(opt)) {
QRect button, menuarea;
button = proxy()->subControlRect(cc, toolbutton, SC_ToolButton, widget);
menuarea = proxy()->subControlRect(cc, toolbutton, SC_ToolButtonMenu, widget);
State bflags = toolbutton->state & ~State_Sunken;
if (bflags & State_AutoRaise) {
if (!(bflags & State_MouseOver) || !(bflags & State_Enabled)) {
bflags &= ~State_Raised;
}
}
State mflags = bflags;
if (toolbutton->state & State_Sunken) {
if (toolbutton->activeSubControls & SC_ToolButton)
bflags |= State_Sunken;
mflags |= State_Sunken;
}
QStyleOption tool = *toolbutton;
if (toolbutton->subControls & SC_ToolButton) {
if (bflags & (State_Sunken | State_On | State_Raised)) {
tool.rect = button;
tool.state = bflags;
proxy()->drawPrimitive(PE_PanelButtonTool, &tool, p, widget);
}
}
if (toolbutton->state & State_HasFocus) {
QStyleOptionFocusRect fr;
fr.QStyleOption::operator=(*toolbutton);
fr.rect.adjust(3, 3, -3, -3);
if (toolbutton->features & QStyleOptionToolButton::MenuButtonPopup)
fr.rect.adjust(0, 0, -proxy()->pixelMetric(QStyle::PM_MenuButtonIndicator,
toolbutton, widget), 0);
proxy()->drawPrimitive(PE_FrameFocusRect, &fr, p, widget);
}
QStyleOptionToolButton label = *toolbutton;
label.state = bflags;
int fw = proxy()->pixelMetric(PM_DefaultFrameWidth, opt, widget);
label.rect = button.adjusted(fw, fw, -fw, -fw);
proxy()->drawControl(CE_ToolButtonLabel, &label, p, widget);
if (toolbutton->subControls & SC_ToolButtonMenu) {
tool.rect = menuarea;
tool.state = mflags;
if (mflags & (State_Sunken | State_On | State_Raised))
proxy()->drawPrimitive(PE_IndicatorButtonDropDown, &tool, p, widget);
proxy()->drawPrimitive(PE_IndicatorArrowDown, &tool, p, widget);
} else if (toolbutton->features & QStyleOptionToolButton::HasMenu) {
int mbi = proxy()->pixelMetric(PM_MenuButtonIndicator, toolbutton, widget);
QRect ir = toolbutton->rect;
QStyleOptionToolButton newBtn = *toolbutton;
newBtn.rect = QRect(ir.right() + 5 - mbi, ir.y() + ir.height() - mbi + 4, mbi - 6, mbi - 6);
newBtn.rect = visualRect(toolbutton->direction, button, newBtn.rect);
proxy()->drawPrimitive(PE_IndicatorArrowDown, &newBtn, p, widget);
}
}
break;
#endif // QT_CONFIG(toolbutton)
case CC_TitleBar:
if (const QStyleOptionTitleBar *tb = qstyleoption_cast<const QStyleOptionTitleBar *>(opt)) {
QRect ir;
if (opt->subControls & SC_TitleBarLabel) {
QColor left = tb->palette.highlight().color();
QColor right = tb->palette.base().color();
QBrush fillBrush(left);
if (left != right) {
QPoint p1(tb->rect.x(), tb->rect.top() + tb->rect.height()/2);
QPoint p2(tb->rect.right(), tb->rect.top() + tb->rect.height()/2);
QLinearGradient lg(p1, p2);
lg.setColorAt(0, left);
lg.setColorAt(1, right);
fillBrush = lg;
}
p->fillRect(opt->rect, fillBrush);
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarLabel, widget);
p->setPen(tb->palette.highlightedText().color());
p->drawText(ir.x() + 2, ir.y(), ir.width() - 2, ir.height(),
Qt::AlignLeft | Qt::AlignVCenter | Qt::TextSingleLine, tb->text);
}
bool down = false;
QPixmap pm;
QStyleOption tool = *tb;
if (tb->subControls & SC_TitleBarCloseButton && tb->titleBarFlags & Qt::WindowSystemMenuHint) {
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarCloseButton, widget);
down = tb->activeSubControls & SC_TitleBarCloseButton && (opt->state & State_Sunken);
if ((tb->titleBarFlags & Qt::WindowType_Mask) == Qt::Tool
#if QT_CONFIG(dockwidget)
|| qobject_cast<const QDockWidget *>(widget)
#endif
)
pm = proxy()->standardIcon(SP_DockWidgetCloseButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(10, 10));
else
pm = proxy()->standardIcon(SP_TitleBarCloseButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(10, 10));
tool.rect = ir;
tool.state = down ? State_Sunken : State_Raised;
proxy()->drawPrimitive(PE_PanelButtonTool, &tool, p, widget);
p->save();
if (down)
p->translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, tb, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, tb, widget));
proxy()->drawItemPixmap(p, ir, Qt::AlignCenter, pm);
p->restore();
}
if (tb->subControls & SC_TitleBarMaxButton
&& tb->titleBarFlags & Qt::WindowMaximizeButtonHint
&& !(tb->titleBarState & Qt::WindowMaximized)) {
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarMaxButton, widget);
down = tb->activeSubControls & SC_TitleBarMaxButton && (opt->state & State_Sunken);
pm = proxy()->standardIcon(SP_TitleBarMaxButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(10, 10));
tool.rect = ir;
tool.state = down ? State_Sunken : State_Raised;
proxy()->drawPrimitive(PE_PanelButtonTool, &tool, p, widget);
p->save();
if (down)
p->translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, tb, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, tb, widget));
proxy()->drawItemPixmap(p, ir, Qt::AlignCenter, pm);
p->restore();
}
if (tb->subControls & SC_TitleBarMinButton
&& tb->titleBarFlags & Qt::WindowMinimizeButtonHint
&& !(tb->titleBarState & Qt::WindowMinimized)) {
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarMinButton, widget);
down = tb->activeSubControls & SC_TitleBarMinButton && (opt->state & State_Sunken);
pm = proxy()->standardIcon(SP_TitleBarMinButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(10, 10));
tool.rect = ir;
tool.state = down ? State_Sunken : State_Raised;
proxy()->drawPrimitive(PE_PanelButtonTool, &tool, p, widget);
p->save();
if (down)
p->translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, tb, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, tb, widget));
proxy()->drawItemPixmap(p, ir, Qt::AlignCenter, pm);
p->restore();
}
bool drawNormalButton = (tb->subControls & SC_TitleBarNormalButton)
&& (((tb->titleBarFlags & Qt::WindowMinimizeButtonHint)
&& (tb->titleBarState & Qt::WindowMinimized))
|| ((tb->titleBarFlags & Qt::WindowMaximizeButtonHint)
&& (tb->titleBarState & Qt::WindowMaximized)));
if (drawNormalButton) {
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarNormalButton, widget);
down = tb->activeSubControls & SC_TitleBarNormalButton && (opt->state & State_Sunken);
pm = proxy()->standardIcon(SP_TitleBarNormalButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(10, 10));
tool.rect = ir;
tool.state = down ? State_Sunken : State_Raised;
proxy()->drawPrimitive(PE_PanelButtonTool, &tool, p, widget);
p->save();
if (down)
p->translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, tb, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, tb, widget));
proxy()->drawItemPixmap(p, ir, Qt::AlignCenter, pm);
p->restore();
}
if (tb->subControls & SC_TitleBarShadeButton
&& tb->titleBarFlags & Qt::WindowShadeButtonHint
&& !(tb->titleBarState & Qt::WindowMinimized)) {
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarShadeButton, widget);
down = (tb->activeSubControls & SC_TitleBarShadeButton && (opt->state & State_Sunken));
pm = proxy()->standardIcon(SP_TitleBarShadeButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(10, 10));
tool.rect = ir;
tool.state = down ? State_Sunken : State_Raised;
proxy()->drawPrimitive(PE_PanelButtonTool, &tool, p, widget);
p->save();
if (down)
p->translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, tb, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, tb, widget));
proxy()->drawItemPixmap(p, ir, Qt::AlignCenter, pm);
p->restore();
}
if (tb->subControls & SC_TitleBarUnshadeButton
&& tb->titleBarFlags & Qt::WindowShadeButtonHint
&& tb->titleBarState & Qt::WindowMinimized) {
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarUnshadeButton, widget);
down = tb->activeSubControls & SC_TitleBarUnshadeButton && (opt->state & State_Sunken);
pm = proxy()->standardIcon(SP_TitleBarUnshadeButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(10, 10));
tool.rect = ir;
tool.state = down ? State_Sunken : State_Raised;
proxy()->drawPrimitive(PE_PanelButtonTool, &tool, p, widget);
p->save();
if (down)
p->translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, tb, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, tb, widget));
proxy()->drawItemPixmap(p, ir, Qt::AlignCenter, pm);
p->restore();
}
if (tb->subControls & SC_TitleBarContextHelpButton
&& tb->titleBarFlags & Qt::WindowContextHelpButtonHint) {
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarContextHelpButton, widget);
down = tb->activeSubControls & SC_TitleBarContextHelpButton && (opt->state & State_Sunken);
pm = proxy()->standardIcon(SP_TitleBarContextHelpButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(10, 10));
tool.rect = ir;
tool.state = down ? State_Sunken : State_Raised;
proxy()->drawPrimitive(PE_PanelButtonTool, &tool, p, widget);
p->save();
if (down)
p->translate(proxy()->pixelMetric(PM_ButtonShiftHorizontal, tb, widget),
proxy()->pixelMetric(PM_ButtonShiftVertical, tb, widget));
proxy()->drawItemPixmap(p, ir, Qt::AlignCenter, pm);
p->restore();
}
if (tb->subControls & SC_TitleBarSysMenu && tb->titleBarFlags & Qt::WindowSystemMenuHint) {
ir = proxy()->subControlRect(CC_TitleBar, tb, SC_TitleBarSysMenu, widget);
if (!tb->icon.isNull()) {
tb->icon.paint(p, ir);
} else {
int iconSize = proxy()->pixelMetric(PM_SmallIconSize, tb, widget);
pm = proxy()->standardIcon(SP_TitleBarMenuButton, &tool, widget).pixmap(qt_getWindow(widget), QSize(iconSize, iconSize));
tool.rect = ir;
p->save();
proxy()->drawItemPixmap(p, ir, Qt::AlignCenter, pm);
p->restore();
}
}
}
break;
#if QT_CONFIG(dial)
case CC_Dial:
if (const QStyleOptionSlider *dial = qstyleoption_cast<const QStyleOptionSlider *>(opt)) {
// OK, this is more a port of things over
p->save();
// avoid dithering
if (p->paintEngine()->hasFeature(QPaintEngine::Antialiasing))
p->setRenderHint(QPainter::Antialiasing);
int width = dial->rect.width();
int height = dial->rect.height();
qreal r = qMin(width, height) / 2;
qreal d_ = r / 6;
qreal dx = dial->rect.x() + d_ + (width - 2 * r) / 2 + 1;
qreal dy = dial->rect.y() + d_ + (height - 2 * r) / 2 + 1;
QRect br = QRect(int(dx), int(dy), int(r * 2 - 2 * d_ - 2), int(r * 2 - 2 * d_ - 2));
QPalette pal = opt->palette;
// draw notches
if (dial->subControls & QStyle::SC_DialTickmarks) {
p->setPen(pal.windowText().color());
p->drawLines(QStyleHelper::calcLines(dial));
}
if (dial->state & State_Enabled) {
p->setBrush(pal.brush(QPalette::ColorRole(proxy()->styleHint(SH_Dial_BackgroundRole,
dial, widget))));
p->setPen(Qt::NoPen);
p->drawEllipse(br);
p->setBrush(Qt::NoBrush);
}
p->setPen(QPen(pal.dark().color()));
p->drawArc(br, 60 * 16, 180 * 16);
p->setPen(QPen(pal.light().color()));
p->drawArc(br, 240 * 16, 180 * 16);
qreal a;
const StaticPolygonF<3> arrow = calcArrow(dial, a);
p->setPen(Qt::NoPen);
p->setBrush(pal.button());
p->setRenderHint(QPainter::Qt4CompatiblePainting);
p->drawPolygon(arrow.cbegin(), arrow.size());
a = QStyleHelper::angle(QPointF(width / 2, height / 2), arrow[0]);
p->setBrush(Qt::NoBrush);
if (a <= 0 || a > 200) {
p->setPen(pal.light().color());
p->drawLine(arrow[2], arrow[0]);
p->drawLine(arrow[1], arrow[2]);
p->setPen(pal.dark().color());
p->drawLine(arrow[0], arrow[1]);
} else if (a > 0 && a < 45) {
p->setPen(pal.light().color());
p->drawLine(arrow[2], arrow[0]);
p->setPen(pal.dark().color());
p->drawLine(arrow[1], arrow[2]);
p->drawLine(arrow[0], arrow[1]);
} else if (a >= 45 && a < 135) {
p->setPen(pal.dark().color());
p->drawLine(arrow[2], arrow[0]);
p->drawLine(arrow[1], arrow[2]);
p->setPen(pal.light().color());
p->drawLine(arrow[0], arrow[1]);
} else if (a >= 135 && a < 200) {
p->setPen(pal.dark().color());
p->drawLine(arrow[2], arrow[0]);
p->setPen(pal.light().color());
p->drawLine(arrow[0], arrow[1]);
p->drawLine(arrow[1], arrow[2]);
}
// draw focus rect around the dial
QStyleOptionFocusRect fropt;
fropt.rect = dial->rect;
fropt.state = dial->state;
fropt.palette = dial->palette;
if (fropt.state & QStyle::State_HasFocus) {
br.adjust(0, 0, 2, 2);
if (dial->subControls & SC_DialTickmarks) {
int r = qMin(width, height) / 2;
br.translate(-r / 6, - r / 6);
br.setWidth(br.width() + r / 3);
br.setHeight(br.height() + r / 3);
}
fropt.rect = br.adjusted(-2, -2, 2, 2);
proxy()->drawPrimitive(QStyle::PE_FrameFocusRect, &fropt, p, widget);
}
p->restore();
}
break;
#endif // QT_CONFIG(dial)
#if QT_CONFIG(groupbox)
case CC_GroupBox:
if (const QStyleOptionGroupBox *groupBox = qstyleoption_cast<const QStyleOptionGroupBox *>(opt)) {
// Draw frame
QRect textRect = proxy()->subControlRect(CC_GroupBox, opt, SC_GroupBoxLabel, widget);
QRect checkBoxRect = proxy()->subControlRect(CC_GroupBox, opt, SC_GroupBoxCheckBox, widget);
if (groupBox->subControls & QStyle::SC_GroupBoxFrame) {
QStyleOptionFrame frame;
frame.QStyleOption::operator=(*groupBox);
frame.features = groupBox->features;
frame.lineWidth = groupBox->lineWidth;
frame.midLineWidth = groupBox->midLineWidth;
frame.rect = proxy()->subControlRect(CC_GroupBox, opt, SC_GroupBoxFrame, widget);
p->save();
QRegion region(groupBox->rect);
if (!groupBox->text.isEmpty()) {
bool ltr = groupBox->direction == Qt::LeftToRight;
QRect finalRect;
if (groupBox->subControls & QStyle::SC_GroupBoxCheckBox) {
finalRect = checkBoxRect.united(textRect);
finalRect.adjust(ltr ? -4 : 0, 0, ltr ? 0 : 4, 0);
} else {
finalRect = textRect;
}
region -= finalRect;
}
p->setClipRegion(region);
proxy()->drawPrimitive(PE_FrameGroupBox, &frame, p, widget);
p->restore();
}
// Draw title
if ((groupBox->subControls & QStyle::SC_GroupBoxLabel) && !groupBox->text.isEmpty()) {
QColor textColor = groupBox->textColor;
if (textColor.isValid())
p->setPen(textColor);
int alignment = int(groupBox->textAlignment);
if (!proxy()->styleHint(QStyle::SH_UnderlineShortcut, opt, widget))
alignment |= Qt::TextHideMnemonic;
proxy()->drawItemText(p, textRect, Qt::TextShowMnemonic | Qt::AlignHCenter | alignment,
groupBox->palette, groupBox->state & State_Enabled, groupBox->text,
textColor.isValid() ? QPalette::NoRole : QPalette::WindowText);
if (groupBox->state & State_HasFocus) {
QStyleOptionFocusRect fropt;
fropt.QStyleOption::operator=(*groupBox);
fropt.rect = textRect;
proxy()->drawPrimitive(PE_FrameFocusRect, &fropt, p, widget);
}
}
// Draw checkbox
if (groupBox->subControls & SC_GroupBoxCheckBox) {
QStyleOptionButton box;
box.QStyleOption::operator=(*groupBox);
box.rect = checkBoxRect;
proxy()->drawPrimitive(PE_IndicatorCheckBox, &box, p, widget);
}
}
break;
#endif // QT_CONFIG(groupbox)
#if QT_CONFIG(mdiarea)
case CC_MdiControls:
{
QStyleOptionButton btnOpt;
btnOpt.QStyleOption::operator=(*opt);
btnOpt.state &= ~State_MouseOver;
int bsx = 0;
int bsy = 0;
const int buttonIconMetric = proxy()->pixelMetric(PM_TitleBarButtonIconSize, &btnOpt, widget);
const QSize buttonIconSize(buttonIconMetric, buttonIconMetric);
if (opt->subControls & QStyle::SC_MdiCloseButton) {
if (opt->activeSubControls & QStyle::SC_MdiCloseButton && (opt->state & State_Sunken)) {
btnOpt.state |= State_Sunken;
btnOpt.state &= ~State_Raised;
bsx = proxy()->pixelMetric(PM_ButtonShiftHorizontal);
bsy = proxy()->pixelMetric(PM_ButtonShiftVertical);
} else {
btnOpt.state |= State_Raised;
btnOpt.state &= ~State_Sunken;
bsx = 0;
bsy = 0;
}
btnOpt.rect = proxy()->subControlRect(CC_MdiControls, opt, SC_MdiCloseButton, widget);
proxy()->drawPrimitive(PE_PanelButtonCommand, &btnOpt, p, widget);
QPixmap pm = proxy()->standardIcon(SP_TitleBarCloseButton).pixmap(qt_getWindow(widget), buttonIconSize);
proxy()->drawItemPixmap(p, btnOpt.rect.translated(bsx, bsy), Qt::AlignCenter, pm);
}
if (opt->subControls & QStyle::SC_MdiNormalButton) {
if (opt->activeSubControls & QStyle::SC_MdiNormalButton && (opt->state & State_Sunken)) {
btnOpt.state |= State_Sunken;
btnOpt.state &= ~State_Raised;
bsx = proxy()->pixelMetric(PM_ButtonShiftHorizontal);
bsy = proxy()->pixelMetric(PM_ButtonShiftVertical);
} else {
btnOpt.state |= State_Raised;
btnOpt.state &= ~State_Sunken;
bsx = 0;
bsy = 0;
}
btnOpt.rect = proxy()->subControlRect(CC_MdiControls, opt, SC_MdiNormalButton, widget);
proxy()->drawPrimitive(PE_PanelButtonCommand, &btnOpt, p, widget);
QPixmap pm = proxy()->standardIcon(SP_TitleBarNormalButton).pixmap(qt_getWindow(widget), buttonIconSize);
proxy()->drawItemPixmap(p, btnOpt.rect.translated(bsx, bsy), Qt::AlignCenter, pm);
}
if (opt->subControls & QStyle::SC_MdiMinButton) {
if (opt->activeSubControls & QStyle::SC_MdiMinButton && (opt->state & State_Sunken)) {
btnOpt.state |= State_Sunken;
btnOpt.state &= ~State_Raised;
bsx = proxy()->pixelMetric(PM_ButtonShiftHorizontal);
bsy = proxy()->pixelMetric(PM_ButtonShiftVertical);
} else {
btnOpt.state |= State_Raised;
btnOpt.state &= ~State_Sunken;
bsx = 0;
bsy = 0;
}
btnOpt.rect = proxy()->subControlRect(CC_MdiControls, opt, SC_MdiMinButton, widget);
proxy()->drawPrimitive(PE_PanelButtonCommand, &btnOpt, p, widget);
QPixmap pm = proxy()->standardIcon(SP_TitleBarMinButton).pixmap(qt_getWindow(widget), buttonIconSize);
proxy()->drawItemPixmap(p, btnOpt.rect.translated(bsx, bsy), Qt::AlignCenter, pm);
}
}
break;
#endif // QT_CONFIG(mdiarea)
default:
qWarning("QCommonStyle::drawComplexControl: Control %d not handled", cc);
}
}
/*!
\reimp
*/
QStyle::SubControl QCommonStyle::hitTestComplexControl(ComplexControl cc, const QStyleOptionComplex *opt,
const QPoint &pt, const QWidget *widget) const
{
SubControl sc = SC_None;
switch (cc) {
#if QT_CONFIG(slider)
case CC_Slider:
if (const QStyleOptionSlider *slider = qstyleoption_cast<const QStyleOptionSlider *>(opt)) {
QRect r = proxy()->subControlRect(cc, slider, SC_SliderHandle, widget);
if (r.isValid() && r.contains(pt)) {
sc = SC_SliderHandle;
} else {
r = proxy()->subControlRect(cc, slider, SC_SliderGroove ,widget);
if (r.isValid() && r.contains(pt))
sc = SC_SliderGroove;
}
}
break;
#endif // QT_CONFIG(slider)
#if QT_CONFIG(scrollbar)
case CC_ScrollBar:
if (const QStyleOptionSlider *scrollbar = qstyleoption_cast<const QStyleOptionSlider *>(opt)) {
QRect r;
uint ctrl = SC_ScrollBarAddLine;
while (ctrl <= SC_ScrollBarGroove) {
r = proxy()->subControlRect(cc, scrollbar, QStyle::SubControl(ctrl), widget);
if (r.isValid() && r.contains(pt)) {
sc = QStyle::SubControl(ctrl);
break;
}
ctrl <<= 1;
}
}
break;
#endif // QT_CONFIG(scrollbar)
#if QT_CONFIG(toolbutton)
case CC_ToolButton:
if (const QStyleOptionToolButton *toolbutton = qstyleoption_cast<const QStyleOptionToolButton *>(opt)) {
QRect r;
uint ctrl = SC_ToolButton;
while (ctrl <= SC_ToolButtonMenu) {
r = proxy()->subControlRect(cc, toolbutton, QStyle::SubControl(ctrl), widget);
if (r.isValid() && r.contains(pt)) {
sc = QStyle::SubControl(ctrl);
break;
}
ctrl <<= 1;
}
}
break;
#endif // QT_CONFIG(toolbutton)
#if QT_CONFIG(spinbox)
case CC_SpinBox:
if (const QStyleOptionSpinBox *spinbox = qstyleoption_cast<const QStyleOptionSpinBox *>(opt)) {
QRect r;
uint ctrl = SC_SpinBoxUp;
while (ctrl <= SC_SpinBoxEditField) {
r = proxy()->subControlRect(cc, spinbox, QStyle::SubControl(ctrl), widget);
if (r.isValid() && r.contains(pt)) {
sc = QStyle::SubControl(ctrl);
break;
}
ctrl <<= 1;
}
}
break;
#endif // QT_CONFIG(spinbox)
case CC_TitleBar:
if (const QStyleOptionTitleBar *tb = qstyleoption_cast<const QStyleOptionTitleBar *>(opt)) {
QRect r;
uint ctrl = SC_TitleBarSysMenu;
while (ctrl <= SC_TitleBarLabel) {
r = proxy()->subControlRect(cc, tb, QStyle::SubControl(ctrl), widget);
if (r.isValid() && r.contains(pt)) {
sc = QStyle::SubControl(ctrl);
break;
}
ctrl <<= 1;
}
}
break;
#if QT_CONFIG(combobox)
case CC_ComboBox:
if (const QStyleOptionComboBox *cb = qstyleoption_cast<const QStyleOptionComboBox *>(opt)) {
QRect r;
uint ctrl = SC_ComboBoxArrow; // Start here and go down.
while (ctrl > 0) {
r = proxy()->subControlRect(cc, cb, QStyle::SubControl(ctrl), widget);
if (r.isValid() && r.contains(pt)) {
sc = QStyle::SubControl(ctrl);
break;
}
ctrl >>= 1;
}
}
break;
#endif // QT_CONFIG(combobox)
#if QT_CONFIG(groupbox)
case CC_GroupBox:
if (const QStyleOptionGroupBox *groupBox = qstyleoption_cast<const QStyleOptionGroupBox *>(opt)) {
QRect r;
uint ctrl = SC_GroupBoxCheckBox;
while (ctrl <= SC_GroupBoxFrame) {
r = proxy()->subControlRect(cc, groupBox, QStyle::SubControl(ctrl), widget);
if (r.isValid() && r.contains(pt)) {
sc = QStyle::SubControl(ctrl);
break;
}
ctrl <<= 1;
}
}
break;
#endif // QT_CONFIG(groupbox)
case CC_MdiControls:
{
QRect r;
uint ctrl = SC_MdiMinButton;
while (ctrl <= SC_MdiCloseButton) {
r = proxy()->subControlRect(CC_MdiControls, opt, QStyle::SubControl(ctrl), widget);
if (r.isValid() && r.contains(pt) && (opt->subControls & ctrl)) {
sc = QStyle::SubControl(ctrl);
return sc;
}
ctrl <<= 1;
}
}
break;
default:
qWarning("QCommonStyle::hitTestComplexControl: Case %d not handled", cc);
}
return sc;
}
/*!
\reimp
*/
QRect QCommonStyle::subControlRect(ComplexControl cc, const QStyleOptionComplex *opt,
SubControl sc, const QWidget *widget) const
{
QRect ret;
switch (cc) {
#if QT_CONFIG(slider)
case CC_Slider:
if (const QStyleOptionSlider *slider = qstyleoption_cast<const QStyleOptionSlider *>(opt)) {
int tickOffset = proxy()->pixelMetric(PM_SliderTickmarkOffset, slider, widget);
int thickness = proxy()->pixelMetric(PM_SliderControlThickness, slider, widget);
switch (sc) {
case SC_SliderHandle: {
int sliderPos = 0;
int len = proxy()->pixelMetric(PM_SliderLength, slider, widget);
bool horizontal = slider->orientation == Qt::Horizontal;
sliderPos = sliderPositionFromValue(slider->minimum, slider->maximum,
slider->sliderPosition,
(horizontal ? slider->rect.width()
: slider->rect.height()) - len,
slider->upsideDown);
if (horizontal)
ret.setRect(slider->rect.x() + sliderPos, slider->rect.y() + tickOffset, len, thickness);
else
ret.setRect(slider->rect.x() + tickOffset, slider->rect.y() + sliderPos, thickness, len);
break; }
case SC_SliderGroove:
if (slider->orientation == Qt::Horizontal)
ret.setRect(slider->rect.x(), slider->rect.y() + tickOffset,
slider->rect.width(), thickness);
else
ret.setRect(slider->rect.x() + tickOffset, slider->rect.y(),
thickness, slider->rect.height());
break;
default:
break;
}
ret = visualRect(slider->direction, slider->rect, ret);
}
break;
#endif // QT_CONFIG(slider)
#if QT_CONFIG(scrollbar)
case CC_ScrollBar:
if (const QStyleOptionSlider *scrollbar = qstyleoption_cast<const QStyleOptionSlider *>(opt)) {
const QRect scrollBarRect = scrollbar->rect;
int sbextent = 0;
if (!proxy()->styleHint(SH_ScrollBar_Transient, scrollbar, widget))
sbextent = proxy()->pixelMetric(PM_ScrollBarExtent, scrollbar, widget);
int maxlen = ((scrollbar->orientation == Qt::Horizontal) ?
scrollBarRect.width() : scrollBarRect.height()) - (sbextent * 2);
int sliderlen;
// calculate slider length
if (scrollbar->maximum != scrollbar->minimum) {
uint range = scrollbar->maximum - scrollbar->minimum;
sliderlen = (qint64(scrollbar->pageStep) * maxlen) / (range + scrollbar->pageStep);
int slidermin = proxy()->pixelMetric(PM_ScrollBarSliderMin, scrollbar, widget);
if (sliderlen < slidermin || range > INT_MAX / 2)
sliderlen = slidermin;
if (sliderlen > maxlen)
sliderlen = maxlen;
} else {
sliderlen = maxlen;
}
int sliderstart = sbextent + sliderPositionFromValue(scrollbar->minimum,
scrollbar->maximum,
scrollbar->sliderPosition,
maxlen - sliderlen,
scrollbar->upsideDown);
switch (sc) {
case SC_ScrollBarSubLine: // top/left button
if (scrollbar->orientation == Qt::Horizontal) {
int buttonWidth = qMin(scrollBarRect.width() / 2, sbextent);
ret.setRect(0, 0, buttonWidth, scrollBarRect.height());
} else {
int buttonHeight = qMin(scrollBarRect.height() / 2, sbextent);
ret.setRect(0, 0, scrollBarRect.width(), buttonHeight);
}
break;
case SC_ScrollBarAddLine: // bottom/right button
if (scrollbar->orientation == Qt::Horizontal) {
int buttonWidth = qMin(scrollBarRect.width()/2, sbextent);
ret.setRect(scrollBarRect.width() - buttonWidth, 0, buttonWidth, scrollBarRect.height());
} else {
int buttonHeight = qMin(scrollBarRect.height()/2, sbextent);
ret.setRect(0, scrollBarRect.height() - buttonHeight, scrollBarRect.width(), buttonHeight);
}
break;
case SC_ScrollBarSubPage: // between top/left button and slider
if (scrollbar->orientation == Qt::Horizontal)
ret.setRect(sbextent, 0, sliderstart - sbextent, scrollBarRect.height());
else
ret.setRect(0, sbextent, scrollBarRect.width(), sliderstart - sbextent);
break;
case SC_ScrollBarAddPage: // between bottom/right button and slider
if (scrollbar->orientation == Qt::Horizontal)
ret.setRect(sliderstart + sliderlen, 0,
maxlen - sliderstart - sliderlen + sbextent, scrollBarRect.height());
else
ret.setRect(0, sliderstart + sliderlen, scrollBarRect.width(),
maxlen - sliderstart - sliderlen + sbextent);
break;
case SC_ScrollBarGroove:
if (scrollbar->orientation == Qt::Horizontal)
ret.setRect(sbextent, 0, scrollBarRect.width() - sbextent * 2,
scrollBarRect.height());
else
ret.setRect(0, sbextent, scrollBarRect.width(),
scrollBarRect.height() - sbextent * 2);
break;
case SC_ScrollBarSlider:
if (scrollbar->orientation == Qt::Horizontal)
ret.setRect(sliderstart, 0, sliderlen, scrollBarRect.height());
else
ret.setRect(0, sliderstart, scrollBarRect.width(), sliderlen);
break;
default:
break;
}
ret = visualRect(scrollbar->direction, scrollBarRect, ret);
}
break;
#endif // QT_CONFIG(scrollbar)
#if QT_CONFIG(spinbox)
case CC_SpinBox:
if (const QStyleOptionSpinBox *spinbox = qstyleoption_cast<const QStyleOptionSpinBox *>(opt)) {
QSize bs;
int fw = spinbox->frame ? proxy()->pixelMetric(PM_SpinBoxFrameWidth, spinbox, widget) : 0;
bs.setHeight(qMax(8, spinbox->rect.height()/2 - fw));
// 1.6 -approximate golden mean
bs.setWidth(qMax(16, qMin(bs.height() * 8 / 5, spinbox->rect.width() / 4)));
bs = bs.expandedTo(QApplication::globalStrut());
int y = fw + spinbox->rect.y();
int x, lx, rx;
x = spinbox->rect.x() + spinbox->rect.width() - fw - bs.width();
lx = fw;
rx = x - fw;
switch (sc) {
case SC_SpinBoxUp:
if (spinbox->buttonSymbols == QAbstractSpinBox::NoButtons)
return QRect();
ret = QRect(x, y, bs.width(), bs.height());
break;
case SC_SpinBoxDown:
if (spinbox->buttonSymbols == QAbstractSpinBox::NoButtons)
return QRect();
ret = QRect(x, y + bs.height(), bs.width(), bs.height());
break;
case SC_SpinBoxEditField:
if (spinbox->buttonSymbols == QAbstractSpinBox::NoButtons) {
ret = QRect(lx, fw, spinbox->rect.width() - 2*fw, spinbox->rect.height() - 2*fw);
} else {
ret = QRect(lx, fw, rx, spinbox->rect.height() - 2*fw);
}
break;
case SC_SpinBoxFrame:
ret = spinbox->rect;
default:
break;
}
ret = visualRect(spinbox->direction, spinbox->rect, ret);
}
break;
#endif // Qt_NO_SPINBOX
#if QT_CONFIG(toolbutton)
case CC_ToolButton:
if (const QStyleOptionToolButton *tb = qstyleoption_cast<const QStyleOptionToolButton *>(opt)) {
int mbi = proxy()->pixelMetric(PM_MenuButtonIndicator, tb, widget);
ret = tb->rect;
switch (sc) {
case SC_ToolButton:
if ((tb->features
& (QStyleOptionToolButton::MenuButtonPopup | QStyleOptionToolButton::PopupDelay))
== QStyleOptionToolButton::MenuButtonPopup)
ret.adjust(0, 0, -mbi, 0);
break;
case SC_ToolButtonMenu:
if ((tb->features
& (QStyleOptionToolButton::MenuButtonPopup | QStyleOptionToolButton::PopupDelay))
== QStyleOptionToolButton::MenuButtonPopup)
ret.adjust(ret.width() - mbi, 0, 0, 0);
break;
default:
break;
}
ret = visualRect(tb->direction, tb->rect, ret);
}
break;
#endif // QT_CONFIG(toolbutton)
#if QT_CONFIG(combobox)
case CC_ComboBox:
if (const QStyleOptionComboBox *cb = qstyleoption_cast<const QStyleOptionComboBox *>(opt)) {
const qreal dpi = QStyleHelper::dpi(opt);
const int x = cb->rect.x(), y = cb->rect.y(), wi = cb->rect.width(), he = cb->rect.height();
const int margin = cb->frame ? qRound(QStyleHelper::dpiScaled(3, dpi)) : 0;
const int bmarg = cb->frame ? qRound(QStyleHelper::dpiScaled(2, dpi)) : 0;
const int xpos = x + wi - bmarg - qRound(QStyleHelper::dpiScaled(16, dpi));
switch (sc) {
case SC_ComboBoxFrame:
ret = cb->rect;
break;
case SC_ComboBoxArrow:
ret.setRect(xpos, y + bmarg, qRound(QStyleHelper::dpiScaled(16, opt)), he - 2*bmarg);
break;
case SC_ComboBoxEditField:
ret.setRect(x + margin, y + margin, wi - 2 * margin - qRound(QStyleHelper::dpiScaled(16, dpi)), he - 2 * margin);
break;
case SC_ComboBoxListBoxPopup:
ret = cb->rect;
break;
default:
break;
}
ret = visualRect(cb->direction, cb->rect, ret);
}
break;
#endif // QT_CONFIG(combobox)
case CC_TitleBar:
if (const QStyleOptionTitleBar *tb = qstyleoption_cast<const QStyleOptionTitleBar *>(opt)) {
const int controlMargin = 2;
const int controlHeight = tb->rect.height() - controlMargin *2;
const int delta = controlHeight + controlMargin;
int offset = 0;
bool isMinimized = tb->titleBarState & Qt::WindowMinimized;
bool isMaximized = tb->titleBarState & Qt::WindowMaximized;
switch (sc) {
case SC_TitleBarLabel:
if (tb->titleBarFlags & (Qt::WindowTitleHint | Qt::WindowSystemMenuHint)) {
ret = tb->rect;
if (tb->titleBarFlags & Qt::WindowSystemMenuHint)
ret.adjust(delta, 0, -delta, 0);
if (tb->titleBarFlags & Qt::WindowMinimizeButtonHint)
ret.adjust(0, 0, -delta, 0);
if (tb->titleBarFlags & Qt::WindowMaximizeButtonHint)
ret.adjust(0, 0, -delta, 0);
if (tb->titleBarFlags & Qt::WindowShadeButtonHint)
ret.adjust(0, 0, -delta, 0);
if (tb->titleBarFlags & Qt::WindowContextHelpButtonHint)
ret.adjust(0, 0, -delta, 0);
}
break;
case SC_TitleBarContextHelpButton:
if (tb->titleBarFlags & Qt::WindowContextHelpButtonHint)
offset += delta;
Q_FALLTHROUGH();
case SC_TitleBarMinButton:
if (!isMinimized && (tb->titleBarFlags & Qt::WindowMinimizeButtonHint))
offset += delta;
else if (sc == SC_TitleBarMinButton)
break;
Q_FALLTHROUGH();
case SC_TitleBarNormalButton:
if (isMinimized && (tb->titleBarFlags & Qt::WindowMinimizeButtonHint))
offset += delta;
else if (isMaximized && (tb->titleBarFlags & Qt::WindowMaximizeButtonHint))
offset += delta;
else if (sc == SC_TitleBarNormalButton)
break;
Q_FALLTHROUGH();
case SC_TitleBarMaxButton:
if (!isMaximized && (tb->titleBarFlags & Qt::WindowMaximizeButtonHint))
offset += delta;
else if (sc == SC_TitleBarMaxButton)
break;
Q_FALLTHROUGH();
case SC_TitleBarShadeButton:
if (!isMinimized && (tb->titleBarFlags & Qt::WindowShadeButtonHint))
offset += delta;
else if (sc == SC_TitleBarShadeButton)
break;
Q_FALLTHROUGH();
case SC_TitleBarUnshadeButton:
if (isMinimized && (tb->titleBarFlags & Qt::WindowShadeButtonHint))
offset += delta;
else if (sc == SC_TitleBarUnshadeButton)
break;
Q_FALLTHROUGH();
case SC_TitleBarCloseButton:
if (tb->titleBarFlags & Qt::WindowSystemMenuHint)
offset += delta;
else if (sc == SC_TitleBarCloseButton)
break;
ret.setRect(tb->rect.right() - offset, tb->rect.top() + controlMargin,
controlHeight, controlHeight);
break;
case SC_TitleBarSysMenu:
if (tb->titleBarFlags & Qt::WindowSystemMenuHint) {
ret.setRect(tb->rect.left() + controlMargin, tb->rect.top() + controlMargin,
controlHeight, controlHeight);
}
break;
default:
break;
}
ret = visualRect(tb->direction, tb->rect, ret);
}
break;
#if QT_CONFIG(groupbox)
case CC_GroupBox: {
if (const QStyleOptionGroupBox *groupBox = qstyleoption_cast<const QStyleOptionGroupBox *>(opt)) {
switch (sc) {
case SC_GroupBoxFrame:
case SC_GroupBoxContents: {
int topMargin = 0;
int topHeight = 0;
int verticalAlignment = proxy()->styleHint(SH_GroupBox_TextLabelVerticalAlignment, groupBox, widget);
bool hasCheckBox = groupBox->subControls & QStyle::SC_GroupBoxCheckBox;
if (groupBox->text.size() || hasCheckBox) {
int checkBoxHeight = hasCheckBox ? proxy()->pixelMetric(PM_IndicatorHeight, groupBox, widget) : 0;
topHeight = qMax(groupBox->fontMetrics.height(), checkBoxHeight);
if (verticalAlignment & Qt::AlignVCenter)
topMargin = topHeight / 2;
else if (verticalAlignment & Qt::AlignTop)
topMargin = topHeight;
}
QRect frameRect = groupBox->rect;
frameRect.setTop(topMargin);
if (sc == SC_GroupBoxFrame) {
ret = frameRect;
break;
}
int frameWidth = 0;
if ((groupBox->features & QStyleOptionFrame::Flat) == 0)
frameWidth = proxy()->pixelMetric(PM_DefaultFrameWidth, groupBox, widget);
ret = frameRect.adjusted(frameWidth, frameWidth + topHeight - topMargin,
-frameWidth, -frameWidth);
break;
}
case SC_GroupBoxCheckBox:
case SC_GroupBoxLabel: {
QFontMetrics fontMetrics = groupBox->fontMetrics;
int th = fontMetrics.height();
int tw = fontMetrics.size(Qt::TextShowMnemonic, groupBox->text + QLatin1Char(' ')).width();
int marg = (groupBox->features & QStyleOptionFrame::Flat) ? 0 : 8;
ret = groupBox->rect.adjusted(marg, 0, -marg, 0);
int indicatorWidth = proxy()->pixelMetric(PM_IndicatorWidth, opt, widget);
int indicatorHeight = proxy()->pixelMetric(PM_IndicatorHeight, opt, widget);
int indicatorSpace = proxy()->pixelMetric(PM_CheckBoxLabelSpacing, opt, widget) - 1;
bool hasCheckBox = groupBox->subControls & QStyle::SC_GroupBoxCheckBox;
int checkBoxWidth = hasCheckBox ? (indicatorWidth + indicatorSpace) : 0;
int checkBoxHeight = hasCheckBox ? indicatorHeight : 0;
int h = qMax(th, checkBoxHeight);
ret.setHeight(h);
// Adjusted rect for label + indicatorWidth + indicatorSpace
QRect totalRect = alignedRect(groupBox->direction, groupBox->textAlignment,
QSize(tw + checkBoxWidth, h), ret);
// Adjust totalRect if checkbox is set
if (hasCheckBox) {
bool ltr = groupBox->direction == Qt::LeftToRight;
int left = 0;
// Adjust for check box
if (sc == SC_GroupBoxCheckBox) {
left = ltr ? totalRect.left() : (totalRect.right() - indicatorWidth);
int top = totalRect.top() + (h - checkBoxHeight) / 2;
totalRect.setRect(left, top, indicatorWidth, indicatorHeight);
// Adjust for label
} else {
left = ltr ? (totalRect.left() + checkBoxWidth - 2) : totalRect.left();
int top = totalRect.top() + (h - th) / 2;
totalRect.setRect(left, top, totalRect.width() - checkBoxWidth, th);
}
}
ret = totalRect;
break;
}
default:
break;
}
}
break;
}
#endif // QT_CONFIG(groupbox)
#if QT_CONFIG(mdiarea)
case CC_MdiControls:
{
int numSubControls = 0;
if (opt->subControls & SC_MdiCloseButton)
++numSubControls;
if (opt->subControls & SC_MdiMinButton)
++numSubControls;
if (opt->subControls & SC_MdiNormalButton)
++numSubControls;
if (numSubControls == 0)
break;
int buttonWidth = opt->rect.width() / numSubControls - 1;
int offset = 0;
switch (sc) {
case SC_MdiCloseButton:
// Only one sub control, no offset needed.
if (numSubControls == 1)
break;
offset += buttonWidth + 2;
Q_FALLTHROUGH();
case SC_MdiNormalButton:
// No offset needed if
|
__label__pos
| 0.894515 |
1
Если класс помечен как @Validated, то cущность, у которой по крайней мере одно поле помечено моей кастомной аннотацией @Unique, будет проверена дважды. Более того, в первый раз валидатор будет иметь заинжекченный контекст и сервис, а во второй раз все будет null. Мне кажется, что из-за @Validated сущность проверяется дважды, но я не понимаю, почему и даже почему без внедренного контекста и сервиса?
Если класс не помечен, сущность проверяется нормально, даже с моей пользовательской аннотацией. Но валидация параметров не работает, например, publicString someFunction (@RequestParam ("email") @Email String email), и если отправить явно не email адрес, то всё пройдёт в сервис, а вот с @Validated на классе уже выдаст сообщение, что email не подходит.
Класс, который обслуживает аннотацию
public class UniqueValidator implements ConstraintValidator<Unique, Object> {
@Autowired
private ApplicationContext applicationContext;
@Autowired
private FieldValueExists service;
private String fieldName;
@Override
public void initialize(Unique unique) {
Class<? extends FieldValueExists> clazz = unique.service();
this.fieldName = unique.fieldName();
String serviceQualifier = unique.serviceQualifier();
if (!serviceQualifier.equals("")) {
this.service = this.applicationContext.getBean(serviceQualifier, clazz);
} else {
this.service = this.applicationContext.getBean(clazz);
}
}
@Override
public boolean isValid(Object o, ConstraintValidatorContext constraintValidatorContext) {
return !this.service.fieldValueExists(o, this.fieldName);
}
}
Аннотация
@Target(FIELD)
@Retention(RUNTIME)
@Constraint(validatedBy = UniqueValidator.class)
public @interface Unique {
String message() default "Field is not unique";
Class<?>[] groups() default {};
Class<? extends Payload>[] payload() default {};
Class<? extends FieldValueExists> service() default FieldValueExists.class;
String serviceQualifier() default "";
String fieldName();
}
Часть кода из сущности, поля которой проверяются моим валидатором
@JsonRootName("userCreate")
public class UserModelCreateDto {
@Size(min = 4, max = 32)
@NotBlank
@Unique(fieldName = "login", serviceQualifier = "userServiceImpl")
private String login;
Контроллер
@RestController
@Validated
public class AuthenticationController {
private static Logger LOG = Logger.getLogger(AuthenticationController.class);
@Autowired
private UserService userService;
@Autowired
private ModelMapper modelMapper;
@PostMapping("/sign-up")
@ResponseStatus(HttpStatus.OK)
public UserModelDto saveUser(@Valid @RequestBody UserModelCreateDto userModelCreateDto, BindingResult result) {
if (result.hasErrors()) {
throw new ValidationException(getValidationErrorsAsString(result));
} else {
UserModelDto user = userService.save(userModelCreateDto);
LOG.info("User #" + user.getId() + " has been create account");
return user;
}
}
Bean
@Bean
public Validator validator (final AutowireCapableBeanFactory autowireCapableBeanFactory) {
ValidatorFactory validatorFactory = Validation.byProvider( HibernateValidator.class )
.configure().constraintValidatorFactory(new SpringConstraintValidatorFactory(autowireCapableBeanFactory))
.buildValidatorFactory();
return validatorFactory.usingContext().getValidator();
}
1 ответ 1
2
Необходимо отключить валидацию, которую производит Hibernate.
spring.jpa.properties.javax.persistence.validation.mode=none
Ваш ответ
Нажимая «Отправить ответ», вы соглашаетесь с условиями пользования и подтверждаете, что прочитали политику конфиденциальности.
Всё ещё ищете ответ? Посмотрите другие вопросы с метками или задайте свой вопрос.
|
__label__pos
| 0.785675 |
dummy-link
ColorTypes
Basic color definitions and traits
Readme
ColorTypes
Build Status PkgEval codecov.io
This "minimalistic" package serves as the foundation for working with colors in Julia. It defines basic color types and their constructors, and sets up traits and show methods to make them easier to work with.
Of related interest is the Colors.jl package, which provides "colorimetry" and conversion functions for working with colors. You may also be interested in the ColorVectorSpace.jl package, which defines mathematical operations for certain color types. Both of these packages are based on ColorTypes, which ensures that any color objects will be broadly usable.
Types available in ColorTypes
The type hierarchy and abstract types
Here is the type hierarchy used in ColorTypes:
Types
• Colorant is the general term used for any object exported by this package. True colors are called Color; TransparentColor indicates an object that also has alpha-channel information.
• Color{T,3} is a 3-component color (like RGB = red, green, blue); Color{T,1} is a 1-component color (i.e., grayscale). AbstractGray{T} is a typealias for Color{T,1}.
• Most colors have both AlphaColor and ColorAlpha variants; for example, RGB has both ARGB and RGBA. These indicate different underlying storage in memory: AlphaColor stores the alpha-channel first, then the color, whereas ColorAlpha stores the color first, then the alpha-channel. Storage order can be particularly important for interfacing with certain external libraries (e.g., OpenGL and Cairo).
• To support generic programming, TransparentColor constructors always take the alpha channel last, independent of their internal storage order. That is, one uses
RGBA(red, green, blue, alpha)
RGBA(RGB(red, green, blue), alpha)
ARGB(red, green, blue, alpha) # note alpha is last
ARGB(RGB(red, green, blue), alpha)
This way you can write code with a generic C<:Colorant type and not worry about the proper order for supplying arguments to the constructor. See the traits section for some useful utilities.
Colors
RGB plus BGR, XRGB, RGBX, and RGB24: the AbstractRGB group
The sRGB colorspace.
struct RGB{T} <: AbstractRGB{T}
r::T # Red in [0,1]
g::T # Green in [0,1]
b::T # Blue in [0,1]
end
RGBs may be defined with two broad number types: FloatingPoint and FixedPoint. FixedPoint come from the FixedPointNumbers package, and represent fractional numbers internally using integers. For example, N0f8(1) creates a Normed{UInt8,8} (N0f8 for short) number with value equal to 1.0 but which internally is represented as 0xff. This strategy ensures that 1 always means "saturated color", regardless of how that value is represented. Ordinary integers should not be used, although the convenience constructor RGB(1,0,0) will create a value RGB{N0f8}(1.0, 0.0, 0.0).
The analogous BGR type is defined as
struct BGR{T} <: AbstractRGB{T}
b::T
g::T
r::T
end
i.e., identical to RGB except in the opposite storage order. One crucial point: for all AbstractRGB types, the constructor accepts values in the order (r,g,b) regardless of how they are arranged internally in memory.
XRGB and RGBX seem exactly like RGB, but internally they insert one extra ("invisible") padding element; when the element type is N0f8, these have favorable memory alignment for interfacing with libraries like OpenGL.
Finally, one may represent an RGB color as 8-bit values packed into a 32-bit integer:
struct RGB24 <: AbstractRGB{N0f8}
color::UInt32
end
The storage order is 0xAARRGGBB, where RR means the red channel, GG means the green, and BB means the blue. AA is ignored for RGB24; there is also an ARGB32, for which that byte represents alpha. Note that this type can also be constructed as RGB24(0.8,0.5,0.2). However, since this type has no fields named r, g, b, it is better to extract values from AbstractRGB objects using red(c), green(c), blue(c).
HSV
Hue-Saturation-Value. A common projection of RGB to cylindrical coordinates. This is also sometimes called "HSB" for Hue-Saturation-Brightness.
struct HSV{T} <: Color{T,3}
h::T # Hue in [0,360)
s::T # Saturation in [0,1]
v::T # Value in [0,1]
end
For HSV (and all remaining color types), T must be of FloatingPoint type, since the values range beyond what can be represented with most FixedPoint types.
HSL
Hue-Saturation-Lightness. Another common projection of RGB to cylindrical coordinates.
struct HSL{T} <: Color{T,3}
h::T # Hue in [0,360)
s::T # Saturation in [0,1]
l::T # Lightness in [0,1]
end
HSI
Hue, saturation, intensity, a variation of HSL and HSV commonly used in computer vision.
struct HSI{T} <: Color{T,3}
h::T
s::T
i::T
end
XYZ
The XYZ colorspace standardized by the CIE in 1931, based on experimental measurements of color perception culminating in the CIE standard observer (see Colors.jl's cie_color_match function).
struct XYZ{T} <: Color{T,3}
x::T
y::T
z::T
end
This colorspace is noteworthy because it is linear---values may be added or scaled as if they form a vector space. See further discussion in the ColorVectorSpace.jl package.
xyY
The xyY colorspace is another CIE standardized color space, based directly off of a transformation from XYZ. It was developed specifically because the xy chromaticity space is invariant to the lightness of the patch.
struct xyY{T} <: Color{T,3}
x::T
y::T
Y::T
end
Lab
A perceptually uniform colorspace standardized by the CIE in 1976. See also LUV, the associated colorspace standardized the same year.
struct Lab{T} <: Color{T,3}
l::T # Luminance in approximately [0,100]
a::T # Red/Green
b::T # Blue/Yellow
end
Luv
A perceptually uniform colorspace standardized by the CIE in 1976. See also LAB, a similar colorspace standardized the same year.
struct Luv{T} <: Color{T,3}
l::T # Luminance
u::T # Red/Green
v::T # Blue/Yellow
end
LCHab
The LAB colorspace reparameterized using cylindrical coordinates.
struct LCHab{T} <: Color{T,3}
l::T # Luminance in [0,100]
c::T # Chroma
h::T # Hue in [0,360)
end
LCHuv
The LUV colorspace reparameterized using cylindrical coordinates.
struct LCHuv{T} <: Color{T,3}
l::T # Luminance
c::T # Chroma
h::T # Hue
end
DIN99
The DIN99 uniform colorspace as described in the DIN 6176 specification.
struct DIN99{T} <: Color{T,3}
l::T # L99 (Lightness)
a::T # a99 (Red/Green)
b::T # b99 (Blue/Yellow)
end
DIN99d
The DIN99d uniform colorspace is an improvement on the DIN99 color space that adds a correction to the X tristimulus value in order to emulate the rotation term present in the DeltaE2000 equation.
struct DIN99d{T} <: Color{T,3}
l::T # L99d (Lightness)
a::T # a99d (Reddish/Greenish)
b::T # b99d (Bluish/Yellowish)
end
DIN99o
Revised version of the DIN99 uniform colorspace with modified coefficients for an improved metric. Similar to DIN99d X correction and the DeltaE2000 rotation term, DIN99o achieves comparable results by optimized a*/b* rotation and chroma compression terms.
struct DIN99o{T} <: Color{T,3}
l::T # L99o (Lightness)
a::T # a99o (Red/Green)
b::T # b99o (Blue/Yellow)
end
LMS
Long-Medium-Short cone response values. Multiple methods of converting to LMS space have been defined. Here the CAT02 chromatic adaptation matrix is used.
struct LMS{T} <: Color{T,3}
l::T # Long
m::T # Medium
s::T # Short
end
Like XYZ, LMS is a linear color space.
YIQ (NTSC)
A color-encoding format used by the NTSC broadcast standard.
struct YIQ{T} <: Color{T,3}
y::T
i::T
q::T
end
Y'CbCr
A color-encoding format common in video and digital photography.
struct YCbCr{T} <: Color{T,3}
y::T
cb::T
cr::T
end
Grayscale "colors"
Gray
Gray is a simple wrapper around a number:
struct Gray{T} <: AbstractGray{T}
val::T
end
In many situations you don't need a Gray wrapper, but there are times when it can be helpful to clarify meaning or assist with dispatching to appropriate methods. It is also present for consistency with the two corresponding grayscale-plus-transparency types, AGray and GrayA.
Gray24 and AGray32
Gray24 is a grayscale value encoded as a UInt32:
struct Gray24 <: AbstractGray{N0f8}
color::UInt32
end
The storage format is 0xAAIIIIII, where each II pair (I=intensity) must be identical. The AA is ignored, but in the corresponding AGray32 type it encodes alpha.
Traits (utility functions for instances and types)
One of the nicest things about this package is that it provides a rich set of trait-functions for working with color types:
• eltype(c) extracts the underlying element type, e.g., Float32
• length(c) extracts the number of components (including alpha, if present)
• alphacolor(c) and coloralpha(c) convert a Color to an object with transparency (either ARGB or RGBA, respectively).
• color_type(c) extracts the opaque (color-only) type of the object (e.g., RGB{N0f8} from an object of type ARGB{N0f8}).
• base_color_type(c) and base_colorant_type(c) extract type information and discard the element type (e.g., base_colorant_type(ARGB{N0f8}) yields ARGB)
• ccolor(Cdest, Csrc) helps pick a concrete element type for methods where the output may be left unstated, e.g., convert(RGB, c) rather than convert(RGB{N0f8}, c).
All of these methods are individually documented (typically with greater detail); just type ?ccolor at the REPL.
Getters
• red, green, blue extract channels from AbstractRGB types; gray extracts the intensity from a grayscale object
• alpha extracts the alpha channel from any Color object (returning 1 if there is no alpha channel)
• comp1, comp2, and comp3 extract color components in the order expected by the constructor
Functions
• mapc(f, c) executes the function f on each color channel of c, returning a new color in the same colorspace.
• reducec(op, v0, c) returns a single number based on a binary operator op across the color channels of c. v0 is the initial value.
• mapreducec(f, op, v0, c) is similar to reducec except it applies f to each color channel before combining values with op.
Extending ColorTypes and Colors
In most cases, adding a new color space is quite straightforward:
• Add your new type to types.jl, following the model of the other color types;
• Add the type to the list of exports in ColorTypes.jl;
• In the Colors package, add conversions to and from your new colorspace.
In special cases, there may be other considerations:
• For RGB-related types, 0 means "black" and 1 means "saturated." If your type has unusual numeric interpretation, you may need to add a new number type to FixedPointNumbers and set up appropriate eltype_default and eltype_ub traits.
• If your type has extra fields, check the "Generated code" section of types.jl carefully. You may need to define a colorfields function and/or call @make_constructors or @make_alpha manually.
First Commit
03/16/2015
Last Touched
10 days ago
Commits
230 commits
Requires:
|
__label__pos
| 0.933781 |
videocasterapp.net
Home > How To > Of Error Of Precision Formula
Of Error Of Precision Formula
The standard deviation of a population is The possibilities seem to The actual amount of teato express error as a relative error.Perform more than five trialsof measurements, and average the result.
Any measurements within this range This single measurement of the period suggests a precision of ±0.005 s, of why not try these out precision Absolute Error Formula The greatest possible error when measuring is considered and Robinson, D. of on an uncontrolled variable. (The temperature of the object for example).
To help answer these questions, we should first define the terms accuracy and precision: Accuracy digits that you write down implies the error in the measurement. Machines used in manufacturing often set tolerance intervals, or ranges in which formula to the value , using the TI-83+/84+ entry of pi as the actual value. your tools and measurements work well enough to get good data.
So you could report that the object to use a null difference method instead of measuring a quantity directly. The standard deviation s for this set of measurements is roughlyneed data on something. How To Calculate Precision Accuracy and Precision, and the difference between them.When analyzing experimental data, it is important thatvalue should be in the same decimal place as the uncertainty.
results every single time it is used. For example, when using a meter stick, one can measure to http://astro.physics.uiowa.edu/ITU/glossary/percent-error-formula/ analysis discussions because it is too general to be useful.Learn more Assign Concept Reading View Quiz View PowerPoint Template Accuracy is how it overestimates the uncertainty in the result.
Apply correct techniques when using thethe functional relationship is not clear or is incomplete.The range is always calculated by including the outlier, which How To Calculate Accuracy And Precision In Chemistry The length of a table in the laboratory isbecause of its association with the normal distribution that is frequently encountered in statistical analyses.
|sin θ|σθ = (0.423)(π/180) = 0.0074 (same result as above).The system returned: (22) Invalid argument TheBut don't make a error in the calibration of the measuring instruments.Practice Problems
open player in a new window About News Get your feet wet more info here formula random errors in x and y and is the propagated uncertainty in z.
With this method, problems of source instability are eliminated, and the measuring specification of the conditions changed. 2.NIST. Another example is AC noise causing to be one half of that measuring unit.Similarly, a manufacturer's tolerance rating generally assumesalso be expressed as a percent of error.
When adding correlated measurements, the uncertainty in the result is simply the sum of Examples:The smooth curve superimposed on the histogram is the gaussianreproducibility or agreement between repeated measurements.
If you measure the same object two different times, precision Accuracy and Precision - YouTube This is an Baird, D.C. If this ratio is less than 1.0, then Precision Calculator until the difference is reduced to zero.
his explanation and save them.University Science http://www.wikihow.com/Calculate-Precision or set to measure zero, when the sample is at zero.Absolute errors do not always give anbecause you may be discarding the most significant part of the investigation! precision
An Introduction to English: 4. After some searching, you find an electronic balance Percent Error Definition Chemistry that has the highest level of precision.our best estimate of this elusive true value?The final result should then be reported as:
The experimenter might consistently read an instrument incorrectly, or might letis likely to deviate from the unknown, true, value of the quantity.Experimentation: An Introduction to Measurementan estimate of the total combined standard uncertainty Uc of the value.this is our "ideal" value, and use it to estimate the accuracy of our result.
This packet also discusses error, and gives examples of how error can affect the http://videocasterapp.net/how-to/guide-repeatability-error-formula.php good to about 1 part in 500" or "precise to about 0.2%".To record this measurement as either 0.4 or 0.42819667 would imply that you only knowestimates of the error of a given measurement. An experimental value should be rounded to How To Calculate Accuracy And Precision In Excel overlap, then the measurements are said to be consistent (they agree).
So how do you worthwhile to repeat a measurement several times. However, all measurements have some degree of uncertaintyand the number 66.770 has 5 significant figures. In the example if the estimated error is 0.02 m you would
If a coverage factor is used, there should be a clear explanation of its Perhaps the uncertainties were underestimated, there may have been a systematic error that1. The process of evaluating the uncertainty associated with a Percentage Error Definition of This fact gives us a key for
As more and more measurements are made, the histogram will more closely follow the time that you try to measure it, your result is obviously uncertain. measurement result is often called uncertainty analysis or error analysis. Propagation of errors Once you have some experimental measurements, you usually How To Calculate Precision From Standard Deviation the needle of a voltmeter to fluctuate.A measuring instrument shows the
Measurement error is the amount of inaccuracy.Precision is a measure of how well must be validated by experiment, and not the other way around. A scientist might also make the statement that this measurement "is formula So how do we report our findings foraverage to zero if you average many measurements.
Therefore, the error can be estimated using equation 14.1 and the conventional 11, 14, 13, 12. is 0.428 m, you imply an uncertainty of about 0.001 m.
B.) the relative error in
Example: Diameter of tennis ball OverviewThere are certain basic concepts in analytical chemistry that is pretty easy. If your scale says 19.2 (8.7 kg) every single time report a result of 0.43 ± 0.02 m, not 0.428 ± 0.02 m.
In the case of random error only, good precision
However, we have the It is clear that systematic errors do not was not considered, or there may be a true difference between these values.
|
__label__pos
| 0.987258 |
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
I'm having a textfield there the users is meant to insert a URL then this code below should run and store the URL in "email" but instead of storing the URL it stores "NAN"...
if ($("input[name='email']").val().length == 0 ){
alert("You Need To Set A Email URL");
}
else{
localStorage.setItem("email", +("input[name='email']").val);
}
Why? And what's wrong with the my jQuery?
share|improve this question
1
+ when used as a unary operator is a shortcut for parseInt(_, 10) – Niet the Dark Absol May 26 '13 at 11:50
"Why? And what's wrong with the my jQuery?" Just ask your console. Often console like speaking. – A. Wolff May 26 '13 at 11:51
@Kolink it's more a number parser, it parse a string to number (float/integer) not just to integer as parseInt() – A. Wolff May 26 '13 at 11:54
Ah, yeah. So more like parseFloat. – Niet the Dark Absol May 26 '13 at 12:02
up vote 2 down vote accepted
You are doing this
localStorage.setItem("email", +("input[name='email']").val);
Here are couple of problems
• You are retrieving input value properly. val is nothing in this case.
• + operator should not used in this case.
So try this
else{
localStorage.setItem("email", $("input[name='email']").val());
}
JS Fiddle Example
share|improve this answer
A couple of things.
+("input[name='email']").val
^-- Should be $
--------------------------^ .val()
.val() is a method, you need to call it.
$ is the correct alias for jQuery
share|improve this answer
try with parentesis
if ($("input[name='email']").val().length == 0 ){
alert("You Need To Set A Email URL");
}
else{
localStorage.setItem("email", +("input[name='email']").val());
}
share|improve this answer
Ops, i can't reply, when i typing there is already an answer :( sorry – Valerio Cicero May 26 '13 at 11: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.862429 |
Course Details
OVERVIEW
Software development is a dynamic and highly sought-after skill in the digital age. In 2023, it continues to be a promising field with a wide range of opportunities. Here's everything you need to know about software development and why learning it as a skill in 2023 is an excellent choice:
What is Software Development?
Software development is the process of creating, designing, testing, and maintaining computer programs and applications. It encompasses a broad spectrum of activities, from writing code to designing user interfaces and ensuring software functions correctly.
Why Learn Software Development in 2023?
1. High Demand: The demand for software developers is consistently high, as businesses across various industries rely on technology to operate efficiently and innovate. This trend is expected to continue in 2023 and beyond.
2. Versatility: Software development skills are transferable across industries and can be applied to a wide range of projects, from mobile apps and web development to artificial intelligence and cybersecurity.
3. Creative Problem Solving: Software developers are problem solvers by nature. They tackle complex issues, write efficient code, and find innovative solutions to improve processes and user experiences.
4. Remote Work Opportunities: Many software development roles offer the flexibility to work remotely, providing a better work-life balance and access to a global job market.
Job Opportunities in Software Development:
1. Front-End Developer: Focuses on creating the user interface and user experience of web and mobile applications. They work with technologies like HTML, CSS, and JavaScript.
2. Back-End Developer: Manages the server-side of applications, handling databases, servers, and application logic. Common technologies include Python, Java, Ruby, and Node.js.
3. Full-Stack Developer: skills in both front-end and back-end development, allowing them to work on all aspects of a software project.
4. Mobile App Developer: Specializes in creating applications for iOS (using Swift or Objective-C) or Android (using Java or Kotlin).
5. Data Scientist/Engineer: Analyzes and interprets data to solve complex problems and build data-driven applications. Requires expertise in languages like Python etc
6. DevOps Engineer: Manages the development, testing, and deployment of software, emphasizing automation and collaboration between development and IT operations teams.
Earning Potential:
The earning potential for software developers can vary based on factors like experience, location, specialization, and the type of projects they work on.
Here are some ways software developers can earn money:
1. Salary: Full-time software developers can earn competitive salaries, with senior developers earning significantly more. Salaries can vary by region, with tech hubs generally offering higher compensation.
2. Freelancing: Many software developers choose to work as freelancers, allowing them to set their rates and work with various clients and projects.
Freelance developers often charge per project or hourly.
3. Consulting: Experienced software developers may offer consulting services, where they provide expertise and guidance to businesses looking to develop or optimize their software solutions.
4. Building and Selling Software: Some developers create their software products, such as mobile apps or SaaS (Software as a Service) solutions, and generate income through sales or subscriptions.
Career Development:
Software development offers numerous opportunities for career growth and advancement:
1. Specialization: You can specialize in areas like machine learning, cybersecurity, cloud computing, or blockchain development, which can lead to more specialized roles and higher earning potential.
2. Management Roles: With experience, you can transition into roles such as software development manager, engineering manager, or chief technology officer (CTO), where you oversee development teams and shape the technical direction of organizations.
3. Continuous Learning: Staying updated with the latest programming languages, frameworks, and development methodologies is crucial for career advancement. Regularly improving your skills and adapting to new technologies is essential in this rapidly evolving field.
4. Networking: Building a strong professional network within the tech community can lead to mentorship, collaboration, and new opportunities, such as job offers, partnerships, or entrepreneurial ventures.
In conclusion, software development is a versatile and lucrative field with a promising outlook in 2023 and beyond. Learning software development can provide you with a rewarding career, opportunities for creativity, problemsolving, and the chance to contribute to shaping the digital future. Whether you're a beginner or an experienced developer, there are always opportunities to grow and excel in this field.
|
__label__pos
| 0.999574 |
3v4l.org
run code in 200+ php & hhvm versions
Bugs & Features
<?php namespace Test; class Test { public function __construct(string $s, int $i) {} } $a = new Test();
based on Wa1EY
Finding entry points
Branch analysis from position: 0
1 jumps found. (Code = 62) Position 1 = -2
filename: /in/7OsA3
function name: (null)
number of ops: 5
compiled vars: !0 = $a
line #* E I O op fetch ext return operands
-------------------------------------------------------------------------------------
4 0 E > NOP
9 1 NEW $2 :-5
2 DO_FCALL 0
3 ASSIGN !0, $2
4 > RETURN 1
Class Test\Test:
Function __construct:
Finding entry points
Branch analysis from position: 0
1 jumps found. (Code = 62) Position 1 = -2
filename: /in/7OsA3
function name: __construct
number of ops: 3
compiled vars: !0 = $s, !1 = $i
line #* E I O op fetch ext return operands
-------------------------------------------------------------------------------------
6 0 E > RECV !0
1 RECV !1
2 > RETURN null
End of function __construct
End of class Test\Test.
Generated using Vulcan Logic Dumper, using php 7.3.0
|
__label__pos
| 0.882248 |
×
Are you trying to figure out how to delete a file in your Linux Server?
This guide will help you.
Removing or deleting a file or directory in Linux operating systems can be implemented by using the rm command or unlink command.
Here at LinuxAPT, as part of our Server Management Services, we regularly help our Customers to perform Software Installation tasks on their Server.
In this context, you will learn how to delete a given file on a Linux system using the command line option.
How to remove a file using the rm command syntax?
Basically, rm (short for remove) is a Linux command which can be used to delete files from a Server filesystem. Generally, deleting a file requires write permission on the parent directory (and execute permission, in order to enter the directory in the first place). The command syntax is as follows to delete the specified files and directories;
rm {file-name}
rm [options] {file-name}
unlink {file-name}
rm -f -r {file-name}
Here;
i. -f: This will forcefully remove file
ii. -r: This will help to remove the contents of directories recursively
When rm command used just with the file names, rm deletes all given files without confirmation by the user.
For instance, to remove or delete a file, lets say file1.txt, execute the command;
rm file1.txt
To delete multiple files in Linux,let's say file1.mp4, file2.doc and file3.txt, then execute;
rm file1.mp4 file2.doc file3.txt
ls
How to delete all files recursively in Linux?
To remove all files and sub-directories from a directory recursively, execute the command;
rm -rf mydir
Where "mydir" is the name of the directory you want to delete.
How to delete a file and prompt before removal in Linux?
To request confirmation before attempting to remove each file, pass the -i option to the rm command as shown below:
rm -i file_name
Where "file_name" is the name of the file.
To get a confirmation of file removal or deletion, you can use the Force rm command "-v" as seen below;
rm -v file1.txt file2.doc
removed 'file1.txt'
removed 'file2.doc'
How to delete empty directories?
To delete or remove empty directory use rmdir command and not the rm command as shown below:
rmdir mydirectory
rmdir dirNameHere
rmdir docs
How to read a list of all files to delete from a text file?
The rm command is often used in conjunction with xargs to supply a list of files to delete. Create a file called file.txt. The execute;
cat file.txt
List of to delete:
file1
/tmp/file2.txt
~/data.txt
Next, delete all file listed in file.txt by executing the command:
xargs rm
How to delete a file named -file4.txt or a directory named -file4?
To delete a file called -file4.txt, execute:
rm -- -file4.txt
OR
rm -- ./-file4.txt
To delete a directory called -file4, execute:
rm -r -f -- -file4
The two -- dashes tells rm command the end of the options and rest of the part is nothing but a file or directory name begins with a dash.
Warning.
Never run rm -rf / as an administrator or normal Linux user.
[This may crash your computer]
The following command will delete all files on your computer if executed;
rm -rf /
rm -rf *
[Need urgent support to Install Software on your Ubuntu Server? We are available to help you today.]
Conclusion
More Linux Tutorials
We create Linux HowTos and Tutorials for Sys Admins. Visit us on IbmiMedia.com
Also for Tech related tips, Visit forum.outsourcepath.com or General Technical tips on www.outsourcepath.com
|
__label__pos
| 0.975476 |
Ignore:
Timestamp:
Apr 8, 2008, 2:46:03 AM (12 years ago)
Author:
gz
Message:
Assorted cleanup:
In infrastructure:
• add *test-verbose* and :verbose argument to do-test and do-tests. Avoid random output if false, only show failures
• muffle-wawrnings and/or bind *suppress-compiler-warnings* in some tests that unavoidably generate them (mainly with duplicate typecase/case clauses)
• Add record-source-file for tests so meta-. can find them
• If *catch-errors* (or the :catch-errors arg) is :break, enter a breakloop when catch an error
• Make test fns created by *compile-tests* have names, so can find them in backtraces
• fix misc compiler warnings
• Fixed cases of duplicate test numbers
• Disable note :make-condition-with-compound-name for openmcl.
In tests themselves:
I commented out the following tests with #+bogus-test, because they just seemed wrong to me:
lambda.47
lambda.50
upgraded-array-element-type.8
upgraded-array-element-type.nil.1
pathname-match-p.5
load.17
load.18
macrolet.47
ctypecase.15
In addition, I commented out the following tests with #+bogus-test because I was too lazy to make a note
for "doesn't signal underflow":
exp.error.8 exp.error.9 exp.error.10 exp.error.11 expt.error.8 expt.error.9 expt.error.10 expt.error.11
Finally, I entered bug reports in trac, and then commented out the tests
below with #+known-bug-NNN, where nnn is the ticket number in trac:
ticket#268: encode-universal-time.3 encode-universal-time.3.1
ticket#269: macrolet.36
ticket#270: values.20 values.21
ticket#271: defclass.error.13 defclass.error.22
ticket#272: phase.10 phase.12 asin.5 asin.6 asin.8
ticket#273: phase.18 phase.19 acos.8
ticket#274: exp.error.4 exp.error.5 exp.error.6 exp.error.7
ticket#275: car.error.2 cdr.error.2
ticket#276: map.error.11
ticket#277: subtypep.cons.43
ticket#278: subtypep-function.3
ticket#279: subtypep-complex.8
ticket#280: open.output.19 open.io.19 file-position.8 file-length.4 file-length.5 read-byte.4 stream-element-type.2 stream-element-type.3
ticket#281: open.65
ticket#288: set-syntax-from-char.sharp.1
File:
1 edited
Legend:
Unmodified
Added
Removed
• trunk/tests/ansi-tests/upgraded-array-element-type.lsp
r8991 r9045
9696;;; of UAET(Ty) (see section 15.1.2.1, paragraph 3)
9797
98#+bogus-test ;; This requirement is unsatisfiable in any implementation that
99;; has two upgraded array element types U1 and U2, not subtypes of each
100;; other and with a non-empty intersection. Given an object x in the
101;; intersection, the UAET of `(eql ,x) is either U1 or U2, say U1.
102;; Then `(eql ,x) is a subtype of U2 but its UAET is not a subtype of U2.
103;; Example: U1 = (unsigned-byte 8), U2 = (signed-byte 8)
98104(deftest upgraded-array-element-type.8
99105 (let ((upgraded-types (mapcar #'upgraded-array-element-type
111117;;; Tests of upgrading NIL (it should be type equivalent to NIL)
112118
119#+bogus-test
113120(deftest upgraded-array-element-type.nil.1
114121 (let ((uaet-nil (upgraded-array-element-type nil)))
Note: See TracChangeset for help on using the changeset viewer.
|
__label__pos
| 0.72977 |
首页 > Spring Cloud 阅读：15,558
Spring Cloud Feign的自定义配置及使用
Feign 提供了很多的扩展机制，让用户可以更加灵活的使用，这节我们来学习 Feign 的一些自定义配置。
日志配置
有时候我们遇到 Bug，比如接口调用失败、参数没收到等问题，或者想看看调用性能，就需要配置 Feign 的日志了，以此让 Feign 把请求信息输出来。
首先定义一个配置类，代码如下所示。
@Configuration
public class FeignConfiguration {
/**
* 日志级别
*
* @return
*/
@Bean
Logger.Level feignLoggerLevel() {
return Logger.Level.FULL;
}
}
通过源码可以看到日志等级有 4 种，分别是：
• NONE：不输出日志。
• BASIC：只输出请求方法的 URL 和响应的状态码以及接口执行的时间。
• HEADERS：将 BASIC 信息和请求头信息输出。
• FULL：输出完整的请求信息。
Feign 日志等级源码如下图所示：
public enum Level {
NONE,
BASIC,
HEADERS,
FULL
}
配置类建好后，我们需要在 Feign Client 中的 @FeignClient 注解中指定使用的配置类，代码如下所示。
@FeignClient(value = "eureka-client-user-service", configuration = FeignConfiguration. class)
public interface UserRemoteClient {
// ...
}
在配置文件中执行 Client 的日志级别才能正常输出日志，格式是“logging.level.client 类地址=级别”。
logging.level.net.biancheng.feign_demo.remote.UserRemoteClient=DEBUG
最后通过 Feign 调用我们的 /user/hello 接口，就可以看到控制台输出的调用信息了，如图 1 所示。
调用信息
图 1 调用信息
契约配置
Spring Cloud 在 Feign 的基础上做了扩展，可以让 Feign 支持 Spring MVC 的注解来调用。原生的 Feign 是不支持 Spring MVC 注解的，原生的使用方法我们在后面会讲解。
如果你想在 Spring Cloud 中使用原生的注解方式来定义客户端也是可以的，通过配置契约来改变这个配置，Spring Cloud 中默认的是 SpringMvcContract，代码如下所示。
@Configuration
public class FeignConfiguration {
@Bean
public Contract feignContract() {
return new feign.Contract.Default();
}
}
当你配置使用默认的契约后，之前定义的 Client 就用不了，之前上面的注解是 Spring MVC 的注解。
Basic 认证配置
通常我们调用的接口都是有权限控制的，很多时候可能认证的值是通过参数去传递的，还有就是通过请求头去传递认证信息，比如 Basic 认证方式。在 Feign 中我们可以直接配置 Basic 认证，代码如下所示。
@Configuration
public class FeignConfiguration {
@Bean
public BasicAuthRequestInterceptor basicAuthRequestInterceptor() {
return new BasicAuthRequestInterceptor("user", "password");
}
}
或者你可以自定义属于自己的认证方式，其实就是自定义一个请求拦截器。在请求之前做认证操作，然后往请求头中设置认证之后的信息。通过实现 RequestInterceptor 接口来自定义认证方式，代码如下所示。
public class FeignBasicAuthRequestInterceptor implements RequestInterceptor {
public FeignBasicAuthRequestInterceptor() {
}
@Override
public void apply(RequestTemplate template) {
// 业务逻辑
}
}
然后将配置改成我们自定义的就可以了，这样当 Feign 去请求接口的时候，每次请求之前都会进入 FeignBasicAuthRequestInterceptor 的 apply 方法中，在里面就可以做属于你的逻辑了，代码如下所示。
@Configuration
public class FeignConfiguration {
@Bean
public FeignBasicAuthRequestInterceptor basicAuthRequestInterceptor() {
return new FeignBasicAuthRequestInterceptor();
}
}
超时时间配置
通过 Options 可以配置连接超时时间和读取超时时间（代码如下所示），Options 的第一个参数是连接超时时间（ms），默认值是 10×1000；第二个是取超时时间（ms），默认值是 60×1000。
@Configuration
public class FeignConfiguration {
@Bean
public Request.Options options() {
return new Request.Options(5000, 10000);
}
}
客户端组件配置
Feign 中默认使用 JDK 原生的 URLConnection 发送 HTTP 请求，我们可以集成别的组件来替换掉 URLConnection，比如 Apache HttpClient，OkHttp。
配置 OkHttp 只需要加入 OkHttp 的依赖，代码如下所示。
<dependency>
<groupId>io.github.openfeign</groupId>
<artifactId>feign-okhttp</artifactId>
</dependency>
然后修改配置，将 Feign 的 HttpClient 禁用，启用 OkHttp，配置如下：
#feign 使用 okhttp
feign.httpclient.enabled=false
feign.okhttp.enabled=true
关于配置可参考源码 org.springframework.cloud.openfeign.FeignAutoConfiguration。
HttpClient 自动配置源码如下所示：
@Configuration
@ConditionalOnClass(ApacheHttpClient.class)
@ConditionalOnMissingClass("com.netflix.loadbalancer.ILoadBalancer")
@ConditionalOnProperty(value = "feign.httpclient.enabled", matchIfMissing = true)
protected static class HttpClientFeignConfiguration {
@Autowired(required = false)
private HttpClient httpClient;
@Bean
@ConditionalOnMissingBean(Client.class)
public Client feignClient() {
if (this.httpClient != null) {
return new ApacheHttpClient(this.httpClient);
}
return new ApacheHttpClient();
}
}
OkHttp 自动配置源码如下所示：
@Configuration
@ConditionalOnClass(OkHttpClient.class)
@ConditionalOnMissingClass("com.netflix.loadbalancer.ILoadBalancer")
@ConditionalOnProperty(value = "feign.okhttp.enabled", matchIfMissing = true)
protected static class OkHttpFeignConfiguration {
@Autowired(required = false)
private okhttp3.OkHttpClient okHttpClient;
@Bean
@ConditionalOnMissingBean(Client.class)
public Client feignClient() {
if (this.okHttpClient != null) {
return new OkHttpClient(this.okHttpClient);
}
return new OkHttpClient();
}
}
上面所示两段代码分别是配置 HttpClient 和 OkHttp 的方法。其通过 @ConditionalOnProperty 中的值来决定启用哪种客户端（HttpClient 和 OkHttp），@ConditionalOnClass 表示对应的类在 classpath 目录下存在时，才会去解析对应的配置文件。
GZIP 压缩配置
开启压缩可以有效节约网络资源，提升接口性能，我们可以配置 GZIP 来压缩数据：
feign.compression.request.enabled=true
feign.compression.response.enabled=true
还可以配置压缩的类型、最小压缩值的标准：
feign.compression.request.mime-types=text/xml,application/xml,application/json
feign.compression.request.min-request-size=2048
只有当 Feign 的 Http Client 不是 okhttp3 的时候，压缩才会生效，配置源码在 org.spring-framework.cloud.openfeign.encoding.FeignAcceptGzipEncodingAutoConfiguration，代码如下所示。
@Configuration
@EnableConfigurationProperties(FeignClientEncodingProperties.class)
@ConditionalOnClass(Feign.class)
@ConditionalOnBean(Client.class)
@ConditionalOnProperty(value = "feign.compression.response.enabled", matchIfMissing = false)
@ConditionalOnMissingBean(type = "okhttp3.OkHttpClient")
@AutoConfigureAfter(FeignAutoConfiguration.class)
public class FeignAcceptGzipEncodingAutoConfiguration {
@Bean
public FeignAcceptGzipEncodingInterceptor feignAcceptGzipEncodingInterceptor(
FeignClientEncodingProperties properties) {
return new FeignAcceptGzipEncodingInterceptor(properties);
}
}
核心代码就是 @ConditionalOnMissingBean（type="okhttp3.OkHttpClient"），表示 Spring BeanFactory 中不包含指定的 bean 时条件匹配，也就是没有启用 okhttp3 时才会进行压缩配置。
编码器解码器配置
Feign 中提供了自定义的编码解码器设置，同时也提供了多种编码器的实现，比如 Gson、Jaxb、Jackson。我们可以用不同的编码解码器来处理数据的传输。如果你想传输 XML 格式的数据，可以自定义 XML 编码解码器来实现获取使用官方提供的 Jaxb。
配置编码解码器只需要在 Feign 的配置类中注册 Decoder 和 Encoder 这两个类即可，代码如下所示。
@Bean
public Decoder decoder() {
return new MyDecoder();
}
@Bean
public Encoder encoder() {
return new MyEncoder();
}
使用配置自定义 Feign 的配置
除了使用代码的方式来对 Feign 进行配置，我们还可以通过配置文件的方式来指定 Feign 的配置。
# 链接超时时间
feign.client.config.feignName.connectTimeout=5000
# 读取超时时间
feign.client.config.feignName.readTimeout=5000
# 日志等级
feign.client.config.feignName.loggerLevel=full
# 重试
feign.client.config.feignName.retryer=com.example.SimpleRetryer
# 拦截器
feign.client.config.feignName.requestInterceptors[0]=com.example.FooRequestInterceptor
feign.client.config.feignName.requestInterceptors[1]=com.example.BarRequestInterceptor
# 编码器
feign.client.config.feignName.encoder=com.example.SimpleEncoder
# 解码器
feign.client.config.feignName.decoder=com.example.SimpleDecoder
# 契约
feign.client.config.feignName.contract=com.example.SimpleContract
继承特性
Feign 的继承特性可以让服务的接口定义单独抽出来，作为公共的依赖，以方便使用。
创建一个 Maven 项目 feign-inherit-api，用于存放 API 接口的定义，增加 Feign 的依赖，代码如下所示。
<dependency>
<groupId>org.springframework.cloud</groupId>
<artifactId>spring-cloud-starter-openfeign</artifactId>
</dependency>
定义接口，指定服务名称，代码如下所示。
@FeignClient("feign-inherit-provide")
public interface UserRemoteClient {
@GetMapping("/user/name")
String getName();
}
创建一个服务提供者 feign-inherit-provide，引入 feign-inherit-api，代码如下所示。
<dependency>
<groupId>net.biancheng</groupId>
<artifactId>feign-inherit-api</artifactId>
<version>0.0.1-SNAPSHOT</version>
</dependency>
实现 UserRemoteClient 接口，代码如下所示。
@RestController
public class DemoController implements UserRemoteClient {
@Override
public String getName() {
return "zhangsan";
}
}
创建一个服务消费者 feign-inherit-consume，同样需要引入 feign-inherit-api 用于调用 feign-inherit-provide 提供的 /user/name 接口，代码如下所示。
@RestController
public class DemoController {
@Autowired
private UserRemoteClient userRemoteClient;
@GetMapping("/call")
public String callHello() {
String result = userRemoteClient.getName();
System.out.println("getName调用结果：" + result);
}
}
通过将接口的定义单独抽出来，服务提供方去实现接口，服务消费方直接就可以引入定义好的接口进行调用，非常方便。
多参数请求构造
多参数请求构造分为 GET 请求和 POST 请求两种方式，首先来看 GET 请求的多参数请求构造方式，代码如下所示。
@GetMapping("/user/info")
String getUserInfo(@RequestParam("name")String name,@RequestParam("age")int age);
另一种是通过 Map 来传递多个参数，参数数量可以动态改变，笔者在这里还是推荐大家用固定的参数方式，不要用 Map 来传递参数，Map 传递参数最大的问题是可以随意传参。代码如下所示。
@GetMapping("/user/detail")
String getUserDetail(@RequestParam Map<String, Object> param);
POST 请求多参数就定义一个参数类，通过 @RequestBody 注解的方式来实现，代码如下所示。
@PostMapping("/user/add")
String addUser(@RequestBody User user);
实现类中也需要加上 @RequestBody 注解，代码如下所示。
@RestController
public class DemoController implements UserRemoteClient {
@Override
public String addUser(@RequestBody User user) {
return user.getName();
}
}
注意：使用继承特性的时候实现类也需要加上 @RequestBody 注解。
编程帮，一个分享编程知识的公众号。跟着站长一起学习，每天都有进步。
通俗易懂，深入浅出，一篇文章只讲一个知识点。
文章不深奥，不需要钻研，在公交、在地铁、在厕所都可以阅读，随时随地涨姿势。
文章不涉及代码，不烧脑细胞，人人都可以学习。
当你决定关注「编程帮」，你已然超越了90%的程序员！
编程帮二维码
微信扫描二维码关注
|
__label__pos
| 0.544096 |
Вариант имени Алиеча
Мы пойдём своим путём!
Простой dhcp-сервер на perl, пример однопоточного udp-сервера
Однажды сильно припёрло написать свой dhcp-сервер. Для обслуживания кучи relay’ев. Функционал полный был даже не нужен. Точнее так: нужно было, чтобы он до конца не был реализован. Например, не нужно было сохранять время аренды адреса, но нужно было назначать параметры клиентам в зависимости от номера vlan’а, откуда к нам перенаправлен запрос. И решено было всё это написать на perl, благо даже модуль есть специальный — Net::DHCP::Packet.
Так как, фактически, соотношение номера vlan’а и сетевая адресация происходили в определённой известной зависимости, своя реализация dhcp-сервера была выполнена в формате «запустил и забыл». Никакой необходимости в изменении конфигурации на лету. Просто незачем менять конфигурацию. А ещё отсутствовал ввод-вывод на диск (не надо было писать журнал), так что он (dhcp-сервер) как был запущен, так и здравствует на виртуальной машине до сих пор. Натуральная вещь в себе…
Ну а тут я выложу пример простой программы на 150 строчек кода, который делает всё тоже самое, но с минимальными зависимостями. И для человека, желающего быстро разобраться с Net::DHCP::Packet будет полезно, и как пример простого однопоточного udp-сервера сгодится:
#!/usr/bin/perl
# Оглашаем прагмы
use strict;
use warnings;
# и подключаем модули.
use sigtrap qw(handler toggle_work_flag normal-signals);
use IO::Socket::INET;
use Net::IP qw(:PROC);
use Net::DHCP::Packet;
use Net::DHCP::Constants;
# Начинаем код с оглашения конфигурации.
my %config = (
'bind_addr' => "17.31.255.145", # на этот адрес "сядет" наш сервер
'bind_port' => "6767", # порт, который сервер будет слушать
'vlan_min' => 1000, # минимальный номер vlan'а
'vlan_max' => 5999, # максимальный номер vlan'а
'ipv4_range' => "172.16.0.0/16", # префикс с маской, который мы отдаём клиентам
'dns_servers' => "172.17.17.17 172.18.18.18", # адреса dns-серверов, одной строкой с пробелами
'lease_time' => 86400 # ttl аренды адреса в секундах
);
# Нам надо подготовить значения для определения начала и конца префикса.
# А раз это нужно всегда, то сделаем это один раз и заблаговременно.
prepare_address_space(\%config) or die("Can't calculate address space!\n");
# Мы будем отслеживать необходимость завершения через данную переменную.
my $we_work = 1;
# Открываем сокет. Обязательно в не блокируемом режиме. Иначе рабочий цикл
# будет залипать каждый раз, когда будет простаивать.
my $socket = IO::Socket::INET->new(
LocalAddr => $config{'bind_addr'},
LocalPort => $config{'bind_port'},
Proto => 'udp',
Blocking => 0
) or die("Can't create udp socket: " . $! . "\n");
# И пока пользователь не пошлёт серверу сигнал завершения,
# $we_work будет TRUE, а всё это будет крутится...
while($we_work) {
# У нас не блокируемый режим на сокете. А значит recv вернет TRUE
# только при наличии считанного из сокета сообщения.
if($socket->recv(my $in_msg, 512)) {
# Если в сообщении был "мусор", то есть нечто, что не будет воспринято как dhcp-пакет,
# то Net::DHCP::Packet умрёт и всё выполнение в след за ним. Нам так не надо.
# Чтобы так не было, пытаемся отдавать пакет для создания объекта только в eval.
# Если внутри eval случится какая проблема, то вернётся undef и нас выкинет на следующий виток цикла.
my $packet = eval{
Net::DHCP::Packet->new($in_msg);
} or next();
# Там нужны для работы имя интерфейса (то, которое отдал нам relay) и тип запроса.
my $iface = $packet->getOptionValue(82); # это для isc-dhcp-relay, на коммутаторах может быть другое поле
my $messagetype = $packet->getOptionValue(DHO_DHCP_MESSAGE_TYPE());
# Структуры данных для формирвоания ответа:
my $answer;
my $to_client;
# Строка с Option 82 определена, тип сообщений - discover, адреса удалось "посчитать".
if((defined($iface)) and ($messagetype eq DHCPDISCOVER()) and ($to_client = calculate_address(\%config, $iface))) {
$answer = Net::DHCP::Packet->new(
Comment => $packet->comment(),
Op => BOOTREPLY(),
Hops => $packet->hops(),
Xid => $packet->xid(),
Flags => $packet->flags(),
Ciaddr => $packet->ciaddr(),
Yiaddr => $to_client->{'client'},
Siaddr => $packet->siaddr(),
Giaddr => $packet->giaddr(),
Chaddr => $packet->chaddr(),
DHO_DHCP_MESSAGE_TYPE() => DHCPOFFER(),
DHO_DHCP_SERVER_IDENTIFIER() => $config{'bind_addr'}
);
$answer->addOptionValue(DHO_DHCP_LEASE_TIME(), $config{'lease_time'});
$answer->addOptionValue(DHO_SUBNET_MASK(), $to_client->{'mask'});
$answer->addOptionValue(DHO_ROUTERS(), $to_client->{'router'});
$answer->addOptionValue(DHO_DOMAIN_NAME_SERVERS(), $config{'dns_servers'});
$answer->addOptionValue(82, $packet->getOptionValue(82));
}
# Строка с Option 82 определена, тип сообщений - request, адреса удалось "посчитать".
elsif((defined($iface)) and ($messagetype eq DHCPREQUEST()) and ($to_client = calculate_address(\%config, $iface))) {
# В реквесте присутствует запрос на определённый адрес. Достанем этот адрес из запроса.
my $requested_address = $packet->getOptionValue(DHO_DHCP_REQUESTED_ADDRESS());
# Адрес удалось достать из запроса, и он соответствует тому, который должен быть у клиента.
if((defined($requested_address)) and ($requested_address eq $to_client->{'client'})) {
$answer = new Net::DHCP::Packet(
Comment => $packet->comment(),
Op => BOOTREPLY(),
Hops => $packet->hops(),
Xid => $packet->xid(),
Flags => $packet->flags(),
Ciaddr => $packet->ciaddr(),
Yiaddr => $to_client->{'client'},
Siaddr => $packet->siaddr(),
Giaddr => $packet->giaddr(),
Chaddr => $packet->chaddr(),
DHO_DHCP_MESSAGE_TYPE() => DHCPACK(),
DHO_DHCP_SERVER_IDENTIFIER() => $config{'bind_addr'}
);
$answer->addOptionValue(DHO_DHCP_LEASE_TIME(), $config{'lease_time'});
$answer->addOptionValue(DHO_SUBNET_MASK(), $to_client->{'mask'});
$answer->addOptionValue(DHO_ROUTERS(), $to_client->{'router'});
$answer->addOptionValue(DHO_DOMAIN_NAME_SERVERS(), $config{'dns_servers'});
$answer->addOptionValue(82, $packet->getOptionValue(82));
}
# Либо адрес не был указан, либо он не соответствовал допустимому.
else {
$answer = new Net::DHCP::Packet(
Comment => $packet->comment(),
Op => BOOTREPLY(),
Hops => $packet->hops(),
Xid => $packet->xid(),
Flags => $packet->flags(),
Ciaddr => $packet->ciaddr(),
Yiaddr => '0.0.0.0',
Siaddr => $packet->siaddr(),
Giaddr => $packet->giaddr(),
Chaddr => $packet->chaddr(),
DHO_DHCP_SERVER_IDENTIFIER() => $config{'bind_addr'},
DHO_DHCP_MESSAGE_TYPE() => DHCPNAK(),
DHO_DHCP_MESSAGE(), "Bad request...",
);
}
}
# Если ответ сформирован, то надо его подготовить к отправке,
# и, собственно, отправить клиенту. Кстати, IO::Socket::INET помнит,
# от кого мы в последний раз recv делали. Ему и отправится ответ.
if($answer) {
my $to_send = $answer->serialize();
$socket->send($to_send) if($to_send);
}
}
}
# Закрыли сокет и ушли на покой...
$socket->close();
exit(0);
# Данная функция вызывается sigtrap'ом при получении сигнала "нормального" завершения.
# Всего лишь изменяет $we_work на FALSE.
sub toggle_work_flag {
$we_work = 0;
return(1);
}
# Функция добавляет в конфигурационный хеш записи о минимальном и максимальном значении
# числовой интерпретации адресного пространства. С ними потом мы будем сравнивать
# то, что будет получаться при расчёте подсетей клиентов. Это чтобы лишнего не отдавать.
sub prepare_address_space {
my $config = shift();
my $ip = Net::IP->new($config->{'ipv4_range'});
return(undef) unless($ip); # таки да, Net::IP->new() умеет возвращать undef
$config->{'first_ipv4_int'} = $ip->intip(); # числовое значение первого
$config->{'last_ipv4_int'} = $ip->last_int(); # числовое значение последнего адреса
return(1);
}
# Функция расчёта адреса клиента. По логике для ПЕРВОЙ сети из 192.168.0.0 мы получим:
# 192.168.0.1 - роутер, 192.168.0.2 - клиент. К солению это хардкод. Не нашёл, как сделать
# расчёт ip-адресов клиентов настраиваемым, без усложнения и раздутия кода.
# Впрочем может оно и не надо, так как смена логики расчёта (не адресного пространства в целом,
# оно то меняется легко, прямо в начале, в хеше конфигурации) приведёт пересмотру логики работы всей сети.
sub calculate_address {
my $config = shift();
my $iface = shift();
# $iface содержит ИМЯ. Мы должны уметь извлекать НОМЕР vlan'а из имени.
my $vlan_num;
# Пример для имён типа vlan[номер vlan'а]:
if($iface =~ /^.{2}vlan(\d+)$/) {
$vlan_num = $1;
}
# Пример для имён eth[номер сетевой].[номер vlan'а]:
elsif($iface =~ /^.{2}eth\d+\.(\d+)$/) {
$vlan_num = $1;
}
# Не смогли извлечь? Ну и посчитать не сможем...
else {
return(undef);
}
# Если номер vlan'а меньше или больше пределов, установленных нами, то считать не будем.
if(($vlan_num < $config->{'vlan_min'}) or ($vlan_num > $config->{'vlan_max'})) {
return(undef);
}
my $real_num = $vlan_num - $config->{'vlan_min'}; # реальный номер сети, отсчёт от 0
my $net_int = $config->{'first_ipv4_int'} + (4 * $real_num); # числовое представление ПЕРВОГО АДРЕСА в сети
my $router_int = $net_int + 1; # числовое представления АДРЕСА РОУТЕРА
my $client_int = $router_int + 1; # числовое представление АДРЕСА КЛИЕНТА
my $bcast_int = $client_int + 1; # числовое представление ШИРОКОВЕЩАТЕЛЬНОГО АДРЕСА
# Если наш широковещательный адрес находится за адресным
# пространством общего префикса, то отдаём undef.
if($bcast_int > $config->{'last_ipv4_int'}) {
return(undef);
}
my $client = {
'mask' => "255.255.255.252", # хардкод, маска под четыре адреса в сети... поменяете логику, поменяйте и маску ;)
'router' => ip_bintoip(ip_inttobin($router_int, 4), 4),
'client' => ip_bintoip(ip_inttobin($client_int, 4), 4)
};
return($client);
}
Добавить комментарий
Ваш e-mail не будет опубликован. Обязательные поля помечены *
Можно использовать следующие HTML-теги и атрибуты:
<a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>
− 2 = 2
|
__label__pos
| 0.64678 |
serde 1.0.123
A generic serialization/deserialization framework
Documentation
Serde is a framework for serializing and deserializing Rust data structures efficiently and generically.
You may be looking for:
Serde in action
use serde::{Serialize, Deserialize};
#[derive(Serialize, Deserialize, Debug)]
struct Point {
x: i32,
y: i32,
}
fn main() {
let point = Point { x: 1, y: 2 };
// Convert the Point to a JSON string.
let serialized = serde_json::to_string(&point).unwrap();
// Prints serialized = {"x":1,"y":2}
println!("serialized = {}", serialized);
// Convert the JSON string back to a Point.
let deserialized: Point = serde_json::from_str(&serialized).unwrap();
// Prints deserialized = Point { x: 1, y: 2 }
println!("deserialized = {:?}", deserialized);
}
Getting help
Serde is one of the most widely used Rust libraries so any place that Rustaceans congregate will be able to help you out. For chat, consider trying the #general or #beginners channels of the unofficial community Discord, the #rust-usage channel of the official Rust Project Discord, or the #general stream in Zulip. For asynchronous, consider the [rust] tag on StackOverflow, the /r/rust subreddit which has a pinned weekly easy questions post, or the Rust Discourse forum. It's acceptable to file a support issue in this repo but they tend not to get as many eyes as any of the above and may get closed without a response after some time.
|
__label__pos
| 0.983782 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.