- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for Macedo (0.28 sec)
-
src/main/resources/fess_indices/fess/it/stopwords.txt
farò farai farà faremo farete faranno farei faresti farebbe faremmo fareste farebbero facevo facevi faceva facevamo facevate facevano feci facesti fece facemmo faceste fecero facessi facesse facessimo facessero facendo sto stai sta stiamo stanno stia stiate stiano starò starai starà staremo
Plain Text - Registered: Mon Apr 15 08:04:17 GMT 2024 - Last Modified: Mon Nov 27 12:59:36 GMT 2023 - 1.8K bytes - Viewed (0) -
docs/erasure/README.md
![Erasure](https://github.com/minio/minio/blob/master/docs/screenshots/erasure-code.jpg?raw=true) ## What is Bit Rot protection? Bit Rot, also known as data rot or silent data corruption is a data loss issue faced by disk drives today. Data on the drive may silently get corrupted without signaling an error has occurred, making bit rot more dangerous than a permanent hard drive failure.
Plain Text - Registered: Sun Apr 14 19:28:10 GMT 2024 - Last Modified: Thu Sep 29 04:28:45 GMT 2022 - 4.1K bytes - Viewed (0) -
RELEASE.md
Egor-Krivov, Elia Palme, Eric Platon, Fabrizio Milo, Gaetan Semet, Georg Nebehay, Gu Wang, Gustav Larsson, @haosdent, Harold Cooper, Hw-Zz, @ichuang, Igor Babuschkin, Igor Macedo Quintanilha, Ilya Edrenkin, @ironhead, Jakub Kolodziejczyk, Jennifer Guo, Jihun Choi, Jonas Rauber, Josh Bleecher Snyder, @jpangburn, Jules Gagnon-Marchand, Karen Brems, @kborer, Kirill Bobyrev, Laurent
Plain Text - Registered: Tue Apr 16 12:39:09 GMT 2024 - Last Modified: Wed Apr 03 20:27:38 GMT 2024 - 727.4K bytes - Viewed (8) -
okhttp/src/main/kotlin/okhttp3/internal/connection/ConnectPlan.kt
override fun handleSuccess(): RealConnection { user.updateRouteDatabaseAfterSuccess(route) val connection = this.connection!! user.connectionConnectEnd(connection, route) // If we raced another call connecting to this host, coalesce the connections. This makes for // 3 different lookups in the connection pool! val pooled3 = routePlanner.planReusePooledConnection(this, routes)
Plain Text - Registered: Fri Apr 19 11:42:09 GMT 2024 - Last Modified: Wed Apr 17 05:15:48 GMT 2024 - 18.5K bytes - Viewed (0) -
lib/time/zoneinfo.zip
America/Iqaluit America/Jamaica America/Jujuy America/Juneau America/Kentucky/Louisville America/Kentucky/Monticello America/Knox_IN America/Kralendijk America/La_Paz America/Lima America/Los_Angeles America/Louisville America/Lower_Princes America/Maceio America/Managua America/Manaus America/Marigot America/Martinique America/Matamoros America/Mazatlan America/Mendoza America/Menominee America/Merida America/Metlakatla America/Mexico_City America/Miquelon America/Moncton America/Monterrey America/Montevideo...
ZIP Archive - Registered: Tue Apr 16 11:13:10 GMT 2024 - Last Modified: Fri Feb 02 18:20:41 GMT 2024 - 392.3K bytes - Viewed (1) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
pred.next = succ; if (pred.thread == null) { // We raced with another node that unlinked pred. Restart. continue restart; } } else if (!ATOMIC_HELPER.casWaiters(this, curr, succ)) { // We are unlinking head continue restart; // We raced with an add or complete } curr = succ; } break; } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
} L created = supplier.get(); ArrayReference<L> newRef = new ArrayReference<>(created, index, queue); while (!locks.compareAndSet(index, existingRef, newRef)) { // we raced, we need to re-read and try again existingRef = locks.get(index); existing = existingRef == null ? null : existingRef.get(); if (existing != null) { return existing; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1) -
src/main/webapp/js/admin/adminlte.min.js.map
MO,EAAeD,EAASE,SAAS3H,GAAe4H,QAChDC,EAAeH,EAAWI,KAAK9H,GAAwB4H,QAC7DpH,KAAKM,SAAS+G,EAAcH,GAG9BF,EAAaO,OAAOC,UAAUxH,KAAKE,QAAQwG,gBAAgB,WACzDO,EAAS1G,SAASd,GAClBT,EAAEmC,EAAKlB,UAAUa,QAAQE,MAGvBhB,KAAKE,QAAQ0G,eACf5G,KAAKyH,kBAzEYrH,EA6ErBE,SAAA,SAAS0G,EAAcC,GAAU,IAAAlB,EAAA/F,KACzBa,EAAiB7B,EAAEK,MAAMA,EAAMC,WAErC0H,EAAaO,OAAOG,QAAQ1H,KAAKE,QAAQwG,gBAAgB,WACvDO,EAASzG,YAAYf,GACrBT,EAAE+G,EAAK9F,UAAUa,QAAQD,GACzBmG,EAAaM,KAAQ9H,EAArB,MAAwCA,GAA0BkI,UAClEV,EAAaM,KAAK9H,GAAegB,YAAYf,OApF5BW,EAwFrB...
Plain Text - Registered: Mon Apr 15 08:04:17 GMT 2024 - Last Modified: Wed Feb 12 07:55:41 GMT 2020 - 77K bytes - Viewed (1) -
docs/pt/docs/async.md
Mas nesse caso, se você trouxesse os 8 ex-caixas / cozinheiros / agora-faxineiros, e cada um deles (mais você) pudessem dividir a casa para limpá-la, vocês fariam toda a limpeza em **paralelo**, com a ajuda extra, e terminariam muito mais cedo. Nesse cenário, cada um dos faxineiros (incluindo você) poderia ser um processador, fazendo a sua parte do trabalho.
Plain Text - Registered: Sun Apr 14 07:19:09 GMT 2024 - Last Modified: Sun Mar 31 23:52:53 GMT 2024 - 22.2K bytes - Viewed (0) -
src/main/resources/fess_indices/_aws/fess.json
"fanno", "faccia", "facciate", "facciano", "farò", "farai", "farà", "faremo", "farete", "faranno", "farei", "faresti", "farebbe", "faremmo", "fareste", "farebbero", "facevo", "facevi", "faceva", "facevamo", "facevate", "facevano", "feci", "facesti", "fece", "facemmo", "faceste", "fecero", "facessi", "facesse", "facessimo", "facessero", "facendo", "sto", "stai", "sta", "stiamo", "stanno", "stia", "stiate", "stiano", "starò", "starai", "starà", "staremo", "starete", "staranno", "starei", "staresti", "starebbe",...
Json - Registered: Mon Apr 15 08:04:17 GMT 2024 - Last Modified: Tue Mar 23 12:38:28 GMT 2021 - 117.3K bytes - Viewed (0)