Usted buscó: performance (Italiano - Coreano)

Italiano

Traductor

performance

Traductor

Coreano

Traductor
Traductor

Traduce al momento textos, documentos y pistas de voz con Lara

¡Traducir ahora!

Contribuciones humanas

De traductores profesionales, empresas, páginas web y repositorios de traducción de libre uso.

Añadir una traducción

Italiano

Coreano

Información

Italiano

performance

Coreano

퍼포먼스

Última actualización: 2012-12-07
Frecuencia de uso: 1
Calidad:

Referencia: Wikipedia

Italiano

era la mia miglior performance da fidanzata, e l'hai rovinata con la medicina.

Coreano

여자친구로서 최고의 대사였는데 의사의 의무로 망쳐 놓네요

Última actualización: 2016-10-28
Frecuencia de uso: 1
Calidad:

Referencia: Wikipedia

Italiano

questa pagina ti permette di abilitare vari effetti. per avere le migliori performance è consigliabile non abilitare gli effetti grafici.

Coreano

이 페이지에서 다양한 위젯 스타일 효과를 적용할 수 있습니다. 성능을 원하신다면 모든 효과를 끄시기 바랍니다.

Última actualización: 2011-10-23
Frecuencia de uso: 1
Calidad:

Referencia: Wikipedia

Italiano

o delle perversioni... parliamone, perche' so che tutti avete delle performance da baraccone all'attivo.

Coreano

아니면 변태적인 건요? 그거 얘기해봐요 왜냐면 여러분들도 각자 이상한 짓들 할 테니까요

Última actualización: 2016-10-28
Frecuencia de uso: 1
Calidad:

Referencia: Wikipedia

Italiano

dara' la sua performance d'addio nel ruolo di melpomene, personaggio col quale ha debuttato nel mio primo balletto.

Coreano

그녀는 제 첫 작품이기도 했고 그녀가 연기하기도 했던 '멜포메네'를 마지막으로 연기하게 될 것입니다

Última actualización: 2016-10-28
Frecuencia de uso: 1
Calidad:

Referencia: Wikipedia

Italiano

tutti voi avete avuto la fortuna ed il privilegio di essere stati stregati, trascinati, e a volte perfino devastati, dalle performance di questa straordinaria artista della nostra compagnia.

Coreano

모두 잘 알고 계시겠지만 누구나 한번은 그녀의 황홀함에 넋을 잃고 아름다움에 빠져보신 적이 있겠죠

Última actualización: 2016-10-28
Frecuencia de uso: 1
Calidad:

Referencia: Wikipedia

Italiano

alcuni filesystem unix possono essere montati con l' aggiornamento dell'atime disabilitato per aumentare le performance di tali applicazioni; gli spool delle news usenet costituiscono un esempo frequente.

Coreano

주의: 파일에 접근한 시간은 파일을 읽어들인후에 접근이 막혔을 때마다 바뀌는 것이 지원됩니다.이렇게 하는 것은 정기적으로 매우 많은 파일이나 디렉토리에 어플리케이션에서 접근할 때 꽤 많은 자원을 요구합니다.몇몇 유닉스 시스템에서는 그런 어플리케이션의 퍼포먼스 증가를 막기 위해서 접근시간 업데이트 설정을 꺼놓고 마운트 하기도 합니다. usenet 뉴스 스풀이 일반적인 예입니다. 그런 파일시스템에는 이 함수는 별로 쓸모 없을것입니다.

Última actualización: 2011-10-24
Frecuencia de uso: 1
Calidad:

Referencia: Wikipedia

Italiano

se si deve usare un simile criterio in stringhe che non conten - gono caratteri di "a capo", le performance migliori si possono ottenere abilitando pcre_dotall, oppure iniziando il criterio con ^.* in modo da richiedere un se si deve usare un simile criterio in stringhe che non conten - gono caratteri di "a capo", le performance migliori si possono ottenere abilitando pcre_dotall, oppure iniziando il criterio con ^.* in modo da richiedere un ancoraggio esplicito.

Coreano

with both maximizing and minimizing repetition, failure of what follows normally causes the repeated item to be re- evaluated to see if a different number of repeats allows the rest of the pattern to match. sometimes it is useful to prevent this, either to change the nature of the match, or to cause it fail earlier than it otherwise might, when the author of the pattern knows there is no point in carrying on. consider, for example, the pattern \d+foo when applied to the subject line 123456bar after matching all 6 digits and then failing to match "foo", the normal action of the matcher is to try again with only 5 digits matching the \d+ item, and then with 4, and so on, before ultimately failing. once-only subpatterns provide the means for specifying that once a portion of the pattern has matched, it is not to be re-evaluated in this way, so the matcher would give up immediately on failing to match "foo" the first time. the notation is another kind of special parenthesis, starting with (? as in this example: (? \d+)bar this kind of parenthesis "locks up" the part of the pattern it contains once it has matched, and a failure further into the pattern is prevented from backtracking into it. back- tracking past it to previous items, however, works as normal. an alternative description is that a subpattern of this type matches the string of characters that an identical standalone pattern would match, if anchored at the current point in the subject string. once-only subpatterns are not capturing subpatterns. simple cases such as the above example can be thought of as a maximizing repeat that must swallow everything it can. so, while both \d+ and \d+? are prepared to adjust the number of digits they match in order to make the rest of the pattern match, (? \d+) can only match an entire sequence of digits. this construction can of course contain arbitrarily complicated subpatterns, and it can be nested. once-only subpatterns can be used in conjunction with look- behind assertions to specify efficient matching at the end of the subject string. consider a simple pattern such as abcd$ when applied to a long string which does not match. because matching proceeds from left to right, pcre will look for each "a" in the subject and then see if what follows matches the rest of the pattern. if the pattern is specified as ^.*abcd$ then the initial .* matches the entire string at first, but when this fails (because there is no following "a"), it backtracks to match all but the last character, then all but the last two characters, and so on. once again the search for "a" covers the entire string, from right to left, so we are no better off. however, if the pattern is written as ^(? .*)(? =abcd) then there can be no backtracking for the .* item; it can match only the entire string. the subsequent lookbehind assertion does a single test on the last four characters. if it fails, the match fails immediately. for long strings, this approach makes a significant difference to the processing time. when a pattern contains an unlimited repeat inside a subpattern that can itself be repeated an unlimited number of times, the use of a once-only subpattern is the only way to avoid some failing matches taking a very long time indeed. the pattern (\d+_bar_ \d+ )*[!?] matches an unlimited number of substrings that either consist of non-digits, or digits enclosed in, followed by either! or?. when it matches, it runs quickly. however, if it is applied to aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa it takes a long time before reporting failure. this is because the string can be divided between the two repeats in a large number of ways, and all have to be tried. (the example used [!?] rather than a single character at the end, because both pcre and perl have an optimization that allows for fast failure when a single character is used. they remember the last single character that is required for a match, and fail early if it is not present in the string.) if the pattern is changed to ((? \d+)_bar_ \d+ )*[!?] sequences of non-digits cannot be broken, and failure happens quickly.

Última actualización: 2011-10-24
Frecuencia de uso: 1
Calidad:

Referencia: Wikipedia
Advertencia: contiene formato HTML invisible

Obtenga una traducción de calidad con
10,366,912,140 contribuciones humanas

Usuarios que están solicitando ayuda en este momento:



Utilizamos cookies para mejorar nuestros servicios. Al continuar navegando está aceptando su uso. Más información. De acuerdo