Update parquet files (step 6 of 296)

spaces/1acneusushi/gradio-2dmoleculeeditor/data/Buku Matematika Kelas 6.pdf.md

@@ -1,101 +0,0 @@
-
-<br> - H2: The Content of Buku Matematika Kelas 6.pdf <br> - H2: The Benefits of Buku Matematika Kelas 6.pdf <br> - H2: How to Download Buku Matematika Kelas 6.pdf <br> - Conclusion: A summary of the main points and a call to action <br> - FAQs: Some common questions and answers about Buku Matematika Kelas 6.pdf | # Article with HTML formatting <h1>Buku Matematika Kelas 6.pdf: A Guide for Students and Teachers</h1>
- <p>If you are a student or a teacher of grade 6 mathematics in Indonesia, you might have heard of Buku Matematika Kelas 6.pdf. This is a book that follows the curriculum of 2013 and has been revised in 2018 by the Ministry of Education and Culture. It is a book that covers various topics and skills in mathematics, such as negative integers, mixed operations, circles, prisms, pyramids, cones, spheres, and data analysis. In this article, we will explain what Buku Matematika Kelas 6.pdf is, what it contains, what its benefits are, and how you can download it for free.</p>
-<h2>Buku Matematika Kelas 6.pdf</h2><br /><p><b><b>DOWNLOAD</b> &#127379; <a href="https://byltly.com/2uKzSr">https://byltly.com/2uKzSr</a></b></p><br /><br />
- <h2>The Content of Buku Matematika Kelas 6.pdf</h2>
- <p>Buku Matematika Kelas 6.pdf consists of two parts: a book for students and a book for teachers. The book for students is called Buku Siswa and the book for teachers is called Buku Guru. Both books are available in PDF format and can be easily opened and read using various gadgets. They can also be displayed as slide presentations.</p>
- <p>The book for students has eight chapters that correspond to the eight competencies that are expected from grade 6 students. Each chapter has several subtopics that are explained in detail with examples, exercises, tasks, and activities. The book also features some interesting sections, such as observing, reasoning, questioning, knowing the figures, practice questions, group assignments, and others. These sections are designed to help students develop their scientific skills, higher-order thinking skills, problem-based learning skills, literacy skills, and connection skills.</p>
- <p>The book for teachers is a guide and a reference for teachers in teaching mathematics, especially in grade 6 elementary school or madrasah ibtidaiyah. The book provides some tips and suggestions on how to plan, implement, and evaluate the learning process using Buku Siswa. The book also explains the learning objectives, indicators, materials, methods, media, resources, assessment tools, and feedback for each subtopic.</p>
- <h2>The Benefits of Buku Matematika Kelas 6.pdf</h2>
- <p>Buku Matematika Kelas 6.pdf has many benefits for both students and teachers. Some of the benefits are:</p>
- <ul>
-<li>It is aligned with the curriculum of 2013 that has been revised in 2018. It reflects the latest changes and updates in the mathematics education field.</li>
-<li>It is comprehensive and thorough. It covers all the topics and skills that are required for grade 6 students. It also provides enough exercises and tasks to practice and reinforce the concepts.</li>
-<li>It is engaging and interactive. It uses a variety of methods and media to present the information. It also encourages students to participate actively in the learning process by observing, questioning, reasoning, trying, and communicating.</li>
-<li>It is relevant and contextual. It connects the mathematics concepts with real-life situations and problems. It also relates the mathematics concepts with other subjects and disciplines.</li>
-<li>It is accessible and free. It can be downloaded easily from the internet without any cost. It can also be used with different devices and platforms.</li>
-</ul>
- <h2>How to Download Buku Matematika Kelas 6.pdf</h2>
- <p>If you are interested in using Buku Matematika Kelas 6.pdf for your learning or teaching purposes, you can download it from the following links:</p>
- <table>
-<tr>
-<th>Book</th>
-<th>Link</th>
-</tr>
-<tr>
-<td>Buku Siswa</td>
-<td><a href="https://www.pendidikanterkini.com/2021/05/buku-matematika-kelas-6-k13.html">https://www.pendidikanterkini.com/2021/05/buku-matematika-kelas-6-k13.html</a></td>
-</tr>
-<tr>
-<td>Buku Guru</td>
-<td><a href="https://www.pendidikanterkini.com/2021/05/buku-matematika-kelas-6-k13.html">https://www.pendidikanterkini.com/2021/05/buku-matematika-kelas-6-k13.html</a></td>
-</tr>
-<tr>
-<td>Buku Siswa dan Buku Guru (zip file)</td>
-<td><a href="https://www.ayomadrasah.id/2020/01/download-buku-matematika-kelas-6-k13.html">https://www.ayomadrasah.id/2020/01/download-buku-matematika-kelas-6-k13.html</a></td>
-</tr>
-</table>
- <p>After downloading the files, you can open them using any PDF reader software or application. You can also print them if you prefer to have a hard copy.</p>
- <h2>Conclusion</h2>
- <p>Buku Matematika Kelas 6.pdf is a valuable resource for students and teachers of grade 6 mathematics in Indonesia. It follows the curriculum of 2013 that has been revised in 2018 by the Ministry of Education and Culture. It covers various topics and skills in mathematics in a comprehensive, engaging, interactive, relevant, and contextual way. It also provides enough exercises and tasks to practice and reinforce the concepts. Moreover, it can be downloaded easily from the internet without any cost.</p>
- <p>If you want to improve your mathematics knowledge and skills or help your students do so, you should consider using Buku Matematika Kelas 6.pdf as your learning or teaching material. You will not regret it!</p>
-<p>Download Buku Matematika Kelas 6 Kurikulum 2013 pdf<br />
-Buku Matematika Kelas 6 Semester 1 dan 2 pdf<br />
-Buku Matematika Kelas 6 SD/MI pdf<br />
-Buku Matematika Kelas 6 Edisi Revisi 2018 pdf<br />
-Buku Matematika Kelas 6 Penerbit Erlangga pdf<br />
-Buku Matematika Kelas 6 Penerbit Esis pdf<br />
-Buku Matematika Kelas 6 Penerbit Yudhistira pdf<br />
-Buku Matematika Kelas 6 Penerbit Intan Pariwara pdf<br />
-Buku Matematika Kelas 6 Penerbit Ganeca Exact pdf<br />
-Buku Matematika Kelas 6 Penerbit Quadra pdf<br />
-Buku Matematika Kelas 6 Tema 1 Hidup Rukun pdf<br />
-Buku Matematika Kelas 6 Tema 2 Selalu Berhemat Energi pdf<br />
-Buku Matematika Kelas 6 Tema 3 Cita-Citaku pdf<br />
-Buku Matematika Kelas 6 Tema 4 Peduli Terhadap Makhluk Hidup pdf<br />
-Buku Matematika Kelas 6 Tema 5 Bangga Sebagai Bangsa Indonesia pdf<br />
-Buku Matematika Kelas 6 Tema 6 Kesehatan dan Olahraga pdf<br />
-Buku Matematika Kelas 6 Tema 7 Permainan Tradisional pdf<br />
-Buku Matematika Kelas 6 Tema 8 Lingkungan Sahabat Kita pdf<br />
-Buku Matematika Kelas 6 Tema 9 Makanan Sehat dan Bergizi pdf<br />
-Buku Matematika Kelas 6 Tema 10 Peristiwa dalam Kehidupan pdf<br />
-Ringkasan Materi Buku Matematika Kelas 6 pdf<br />
-Soal dan Pembahasan Buku Matematika Kelas 6 pdf<br />
-Latihan Ulangan Harian Buku Matematika Kelas 6 pdf<br />
-Latihan Ulangan Tengah Semester Buku Matematika Kelas 6 pdf<br />
-Latihan Ulangan Akhir Semester Buku Matematika Kelas 6 pdf<br />
-Latihan Ujian Sekolah Berstandar Nasional (USBN) Buku Matematika Kelas 6 pdf<br />
-Latihan Ujian Nasional Berbasis Komputer (UNBK) Buku Matematika Kelas 6 pdf<br />
-Kunci Jawaban Buku Matematika Kelas 6 pdf<br />
-RPP dan Silabus Buku Matematika Kelas 6 pdf<br />
-Lembar Kerja Siswa (LKS) Buku Matematika Kelas 6 pdf<br />
-Modul Pembelajaran Jarak Jauh (PJJ) Buku Matematika Kelas 6 pdf<br />
-Video Pembelajaran Interaktif (VPI) Buku Matematika Kelas 6 pdf<br />
-Media Pembelajaran Digital (MPD) Buku Matematika Kelas 6 pdf<br />
-Evaluasi Diri dan Remedial (EDR) Buku Matematika Kelas 6 pdf<br />
-Penilaian Kinerja dan Portofolio (PKP) Buku Matematika Kelas 6 pdf<br />
-Penilaian HOTS (Higher Order Thinking Skills) Buku Matematika Kelas 6 pdf<br />
-Penilaian Afektif dan Psikomotorik (PAP) Buku Matematika Kelas 6 pdf<br />
-Penilaian Autentik dan Holistik (PAH) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Kompetensi (PBK) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Proyek (PBP) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Kinerja (PBK) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Portofolio (PBP) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Produk (PBP) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Proses (PBP) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Kemampuan Berpikir Kritis (PBKBK) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Kemampuan Berpikir Kreatif (PBKBK) Buku Matematika Kelas 6 pdf<br />
-Penilaian Berbasis Kemampuan Memecahkan Masalah (PBKMM) Buku Matematika Kelas 6 pdf <br />
-Penilaian Berbasis Kemampuan Komunikasi Efektif (PBKKE) Buku Matematika Kelas </p>
- <h2>FAQs</h2>
- <p>Here are some common questions and answers about Buku Matematika Kelas 6.pdf:</p>
- <ol>
-<li><b>What is Buku Matematika Kelas 6.pdf?</b><br>Buku Matematika Kelas 6.pdf is a book that follows the curriculum of 2013 and has been revised in 2018 by the Ministry of Education and Culture. It is a book that covers various topics and skills in mathematics for grade 6 students in Indonesia.</li>
-<li><b>What are the two parts of Buku Matematika Kelas 6.pdf?</b><br>Buku Matematika Kelas 6.pdf consists of two parts: a book for students (Buku Siswa) and a book for teachers (Buku Guru). Both books are available in PDF format.</li>
-<li><b>What are some of the benefits of Buku Matematika Kelas 6.pdf?</b><br>Buku Matematika Kelas 6.pdf has many benefits for both students and teachers. Some of them are: it is aligned with the latest curriculum; it is comprehensive and thorough; it is engaging and interactive; it is relevant and contextual; it is accessible and free.</li>
-<li><b>How can I download Buku Matematika Kelas 6.pdf?</b><br>You can download Buku Matematika Kelas 6.pdf from several links on the internet. Some of them are provided in this article.</li>
-<li><b>How can I use Buku Matematika Kelas 6.pdf?</b><br>You can use Buku Matematika Kelas 6.pdf as your learning or teaching material for grade 6 mathematics. You can open it using any PDF reader software or application. You can also print it if you prefer to have a hard copy.</li>
-</ol>
- </p> 0a6ba089eb<br />
-<br />
-<br />

spaces/1acneusushi/gradio-2dmoleculeeditor/data/Descargar Crack Memories On Tv 4.1.1 32l Crez des albums photo pour votre TV ou votre ordinateur.md

@@ -1,149 +0,0 @@
-<br />
-<h1>Descargar Crack Memories On Tv 4.1.1 32l</h1>
-<p>Do you want to turn your photos and videos into amazing slideshows that you can watch on your TV or share online? Do you want to do it easily and quickly, without spending a lot of money or time? If so, then you need <strong>Memories On TV</strong>, a powerful and user-friendly software that lets you create stunning slideshows with just a few clicks. And if you want to unlock all the features and benefits of this software, then you need <strong>Crack Memories On Tv 4.1.1 32l</strong>, a simple and effective tool that will activate your copy of Memories On TV for free.</p>
-<h2>Descargar Crack Memories On Tv 4.1.1 32l</h2><br /><p><b><b>Download</b> &#9733;&#9733;&#9733; <a href="https://byltly.com/2uKwWy">https://byltly.com/2uKwWy</a></b></p><br /><br />
-<p>In this article, we will tell you everything you need to know about Memories On TV and Crack Memories On Tv 4.1.1 32l, including what they are, how they work, how to download and install them, and how to use them to create amazing slideshows that will impress your friends and family.</p>
-<h2>What is Memories On TV?</h2>
-<p><strong>Memories On TV</strong> is a software program that allows you to create photo/video slideshows that you can watch on your TV or computer, or share online via YouTube, Facebook, or email. You can use it to make slideshows for weddings, birthdays, anniversaries, vacations, or any other occasion that you want to remember and celebrate.</p>
-<h3>Features and benefits of Memories On TV</h3>
-<p>Some of the features and benefits of Memories On TV are:</p>
-<ul>
-<li>It supports various image formats, such as JPG, PNG, BMP, GIF, TIFF, etc.</li>
-<li>It supports various video formats, such as AVI, MPEG, WMV, MOV, MP4, etc.</li>
-<li>It allows you to add captions, titles, credits, and logos to your slideshows.</li>
-<li>It allows you to adjust the brightness, contrast, color, and orientation of your photos.</li>
-<li>It allows you to crop, rotate, zoom, pan, and flip your photos and videos.</li>
-<li>It allows you to apply various effects and filters to your photos and videos.</li>
-<li>It allows you to add background music and sound effects to your slideshows.</li>
-<li>It allows you to synchronize the music and the images according to the beat or the duration.</li>
-<li>It allows you to add transitions between the slides.</li>
-<li>It allows you to preview your slideshows before burning them or exporting them.</li>
-<li>It allows you to burn your slideshows to DVD or CD with a built-in menu system.</li>
-<li>It allows you to export your slideshows as video files that can be played on any device or platform.</li>
-<li>It has a simple and intuitive interface that makes it easy for anyone to use.</li>
-</ul>
-<h3>How to download and install Memories On TV 4.1.1</h3>
-<p>To download and install Memories On TV 4.1.1 on your computer, follow these steps:</p>
-<ol>
-<li>Go to <a href="https://easmaruranmi.wixsite.com/grankestcomria/post/descargar-crack-memories-on-tv-4-1-1">this website</a>  and click on the <strong>Download</strong> button.</li>
-<li>Save the file <strong>MOTVSetup.exe</strong> on your computer.</li>
-<li>Double-click on the file <strong>MOTVSetup.exe</strong> and follow the instructions on the screen.</li>
-<li>Select the language of your choice and click on <strong>Next</strong>.</li>
-<li>Read the license agreement and click on <strong>I Agree</strong>.</li>
-<li>Select the destination folder where you want to install Memories On TV and click on <strong>Next</strong>.</li>
-<li>Select the components that you want to install and click on <strong>Next</strong>.</li>
-<li>Select the start menu folder where you want to create shortcuts for Memories On TV and click on <strong>Next</strong>.</li>
-<li>Select whether you want to create a desktop icon for Memories On TV and click on <strong>Next</strong>.</li>
-<li>Click on <strong>Install</strong> to start the installation process.</li>
-<li>Wait for the installation process to finish and click on <strong>Finish</strong>.</li>
-</ol>
- <h2>What is Crack Memories On Tv 4.1.1 32l?</h2>
- <p><strong>Crack Memories On Tv 4.1.1 32l</strong> is a small program that can activate your copy of Memories On TV for free. It works by generating a valid serial number that can unlock all the features and benefits of Memories On TV without paying anything.</p>
- <h3>Why do you need Crack Memories On Tv 4.1.1 32l?</h3>
- <p>You need Crack Memories On Tv 4.1.1 32l if you want to enjoy all the advantages of Memories On TV without spending any money or time. With Crack Memories On Tv 4.1.1 32l, you can:</p>
- <ul>
- <li>Create unlimited slideshows with no watermark or limitation.</li>
- <li>Add as many photos and videos as you want without worrying about the size or quality.</li>
- <li>Edit your photos and videos with advanced tools and effects without any restriction.</li>
- <li>Burn your slideshows to DVD or CD with high-quality output without any error.</li>
- <li>Export your slideshows as video files with any format or resolution without any loss.</li>
- <li>Share your slideshows online with anyone without any hassle.</li>
- </ul>
- <h3>How to download and use Crack Memories On Tv 4.1.1 32l?</h3>
- <p>To download and use Crack Memories On Tv 4.1.1 32l on your computer, follow these steps:</p>
- <ol>
- <li>Go to <a href="https://soundcloud.com/tuoconyniyo/descargar-crack-memories-on-tv-411-32l">this website</a>and click on the <strong>MORE</strong> button.</li>
- <li>Select <strong>Dowload file</strong>.</li>
- <li>Select a location where you want save it on your computer.</li>
- <li>The file name is <code><b>CMTV41132L.zip</b></code>. Extract it using WinRAR or any other program that can unzip files.</li>
- <li>You will see two files: <code><b>CMTV41132L.exe</b></code>, which is the crack program;and <code><b>CMTV41132L.txt</b></code>, which contains instructions on how use it.</li>
- <li>To use Crack Memories On Tv 4.1.1 32l , first make sure that MemorysOnTV is not running on your computer . Then double-click on CMTV41132L.exe . A window will open asking for a serial number . Copy one of serial numbers from CMTV41132L.txt file . Paste it into window . Click OK . A message will appear saying that MemorysOnTV has been activated successfully . Click OK again . Close window . </li>
- <li>You can now run MemorysOnTV normally . You will see that all features are unlocked . You can create , edit , burn , export , share unlimited slide shows with no problem . Enjoy ! </li>
- </ol>
- <h2>Tips and tricks for using Memories On TV and Crack Memories On Tv 4.1.1 32l</h2>
-<p>Now that you have downloaded and installed Memories On TV and Crack Memories On Tv 4.1.1 32l, you can start creating amazing slideshows with your photos and videos. Here are some tips and tricks that will help you make the most out of these tools:</p>
-<h3>How to create stunning slideshows with Memories On TV</h3>
-<p>To create a slideshow with Memories On TV, follow these steps:</p>
-<p>Download Crack Memories On Tv 4.1.1 32l Full Version<br />
-How to Crack Memories On Tv 4.1.1 32l for Free<br />
-Memories On Tv 4.1.1 32l Crack Serial Keygen<br />
-Memories On Tv 4.1.1 32l Crack Patch Download<br />
-Memories On Tv 4.1.1 32l Crack License Key Activation<br />
-Memories On Tv 4.1.1 32l Crack Torrent Magnet Link<br />
-Memories On Tv 4.1.1 32l Crack No Survey No Password<br />
-Memories On Tv 4.1.1 32l Crack Online Generator<br />
-Memories On Tv 4.1.1 32l Crack Working Tested<br />
-Memories On Tv 4.1.1 32l Crack Latest Update<br />
-Descargar Gratis Crack Memories On Tv 4.1.1 32l Español<br />
-Descargar Crack Memories On Tv 4.1.1 32l Mega Mediafire<br />
-Descargar Crack Memories On Tv 4.1.1 32l Sin Virus<br />
-Descargar Crack Memories On Tv 4.1.1 32l Facil Rapido<br />
-Descargar Crack Memories On Tv 4.1.1 32l Windows Mac Linux<br />
-Descargar Crack Memories On Tv 4.1.1 32l Portable USB<br />
-Descargar Crack Memories On Tv 4.1.1 32l Ultima Version<br />
-Descargar Crack Memories On Tv 4.1.1 32l Premium Pro<br />
-Descargar Crack Memories On Tv 4.1.1 32l Mod Apk Android<br />
-Descargar Crack Memories On Tv 4.1.1 32l Full HD Quality<br />
-Download Free Crack Memories On Tv 4.1.1 32l English<br />
-Download Crack Memories On Tv 4.1.1 32l Google Drive Dropbox<br />
-Download Crack Memories On Tv 4.1.1 32l Without Virus<br />
-Download Crack Memories On Tv 4.1.1 32l Easy Fast<br />
-Download Crack Memories On Tv 4.1.1 32l Windows Mac Linux<br />
-Download Crack Memories On Tv 4.1.1 32l Portable USB<br />
-Download Crack Memories On Tv 4.1.1 32l Latest Version<br />
-Download Crack Memories On Tv 4.1.1 32l Premium Pro<br />
-Download Crack Memories On Tv 4.1.1 32l Mod Apk Android<br />
-Download Crack Memories On Tv 4.1.1 32l Full HD Quality<br />
-Télécharger Gratuitement Crack Memories On Tv 4.1.1 French <br />
-Télécharger Crack Memories On Tv</p>
-<ol>
-<li>Launch Memories On TV and click on <strong>New Project</strong>.</li>
-<li>Select the folder where your photos and videos are stored and click on <strong>OK</strong>.</li>
-<li>Drag and drop your photos and videos to the timeline at the bottom of the screen.</li>
-<li>Arrange them in the order that you want them to appear in your slideshow.</li>
-<li>To add captions, titles, credits, or logos to your slides, click on the <strong>Text</strong> button on the toolbar and select the type of text that you want to add.</li>
-<li>To adjust the brightness, contrast, color, or orientation of your photos, click on the <strong>Edit</strong> button on the toolbar and select the option that you want to apply.</li>
-<li>To crop, rotate, zoom, pan, or flip your photos and videos, click on the <strong>Transform</strong> button on the toolbar and select the option that you want to apply.</li>
-<li>To apply effects and filters to your photos and videos, click on the <strong>Effects</strong> button on the toolbar and select the effect or filter that you want to apply.</li>
-<li>To add background music and sound effects to your slideshow, click on the <strong>Audio</strong> button on the toolbar and select the option that you want to add.</li>
-<li>To synchronize the music and the images according to the beat or the duration, click on the <strong>Sync</strong> button on the toolbar and select the option that you want to use.</li>
-<li>To add transitions between the slides, click on the <strong>Transitions</strong> button on the toolbar and select the transition that you want to use.</li>
-<li>To preview your slideshow before burning it or exporting it, click on the <strong>Preview</strong> button on the toolbar and watch your slideshow on the screen.</li>
-</ol>
- <h3>How to add effects, music, and transitions to your slideshows</h3>
- <p>One of the best features of Memories On TV is that it allows you to add various effects, music, and transitions to your slideshows. Here are some tips on how to use them effectively:</p>
- <ul>
- <li>To make your slideshows more dynamic and interesting, use different effects and filters for different photos and videos. For example, you can use a sepia effect for old photos, a black-and-white effect for vintage photos, a blur effect for dreamy photos, etc.</li>
- <li>To make your slideshows more emotional and expressive, use appropriate background music and sound effects for different themes and moods. For example, you can use a romantic music for a wedding slideshow, a cheerful music for a birthday slideshow, a sad music for a memorial slideshow, etc.</li>
- <li>To make your slideshows more smooth and seamless, use transitions that match the style and pace of your slideshow. For example, you can use a fade transition for a slow-paced slideshow, a wipe transition for a fast-paced slideshow, a dissolve transition for a soft slideshow, etc.</li>
- </ul>
- <h3>How to burn your slideshows to DVD or share them online</h3>
- <p>After creating your slideshow with Memories On TV , you can burn it to DVD or CD with a built-in menu system , or export it as video file that can be played on any device or platform . You can also share it online via YouTube , Facebook , or email . Here are some tips on how to do it :</p>
- <ul>
- <li>To burn your slideshow to DVD or CD , click on the <strong>Burn</strong> button on the toolbar . Select whether you want to burn it as DVD-Video , VCD , SVCD , or MiniDVD . Select whether you want to use NTSC or PAL format . Select whether you want to use 4:3 or 16:9 aspect ratio . Select whether you want to use stereo or surround sound . Select whether you want to create a menu system for your DVD or CD . Click on <strong>Burn</strong> again . Insert a blank DVD or CD into your drive . Wait for the burning process to finish . </li>
- <li>To export your slideshow as video file , click on the <strong>Export</strong> button on the toolbar . Select whether you want to export it as AVI , MPEG , WMV , MOV , MP4 , FLV , or MKV file . Select whether you want to use high quality or low quality output . Select whether you want to use custom settings or presets for your video file . Click on <strong>Export</strong> again . Choose a location where you want save it on your computer . Wait for exporting process finish . </li>
- <li>To share your slideshow online , click on <strong>Publish Online</strong> button toolbar . Select whether you want share it via YouTube , Facebook , or email . Enter required information such as account details , title , description , tags , etc . Click on <strong>Publish Online</strong> again . Wait for uploading process finish . You will get link that you can copy paste share with anyone . </li>
- </ul>
- <h2>Conclusion</h2>
- <p>In conclusion , Memories On TV is a great software program that allows you create photo/video slideshows that you can watch on your TV or computer , or share online via YouTube , Facebook , or email . You can use it make slideshows for weddings , birthdays , anniversaries , vacations , or any other occasion that you want remember celebrate . And with Crack Memories On Tv 4.1.1 32l , you can activate your copy of Memories On TV for free unlock all features benefits of this software without paying anything . </p>
- <h3>Summary of main points </h3>
- <p>In this article , we have told everything need know about Memories On TV Crack Memories On Tv 4.1.1 32l , including what they are how they work how download install them how use them create amazing slideshows that will impress friends family . We have also given some tips tricks that will help make most out these tools . </p>
- <h3>Call action </h3>
- <p>If want try Memories On TV Crack Memories On Tv 4.1.1 32l yourself see how easy fun it is create stunning slideshows with photos videos , then don't wait any longer download them now from links provided in this article follow instructions given in this article start creating slideshows today ! You won't regret it ! </p>
- <h2>Frequently Asked Questions (FAQs)</h2>
- <p>Here are some frequently asked questions (FAQs) about Memories On TV and Crack Memories On Tv 4.1.1 32l:</p>
- <ol>
-<li><b>Is Memories On TV safe to download and install?</b><br>
-Yes, Memories On TV is safe to download and install. It does not contain any viruses, malware, spyware, or adware. It does not harm your computer or compromise your privacy.</li>
-<li><b>Is Crack Memories On Tv 4.1.1 32l safe to download and use?</b><br>
-Yes, Crack Memories On Tv 4.1.1 32l is safe to download and use. It does not contain any viruses, malware, spyware, or adware. It does not harm your computer or compromise your privacy. It only activates your copy of Memories On TV for free.</li>
-<li><b>Does Crack Memories On Tv 4.1.1 32l work with any version of Memories On TV?</b><br>
-No, Crack Memories On Tv 4.1.1 32l only works with Memories On TV 4.1.1. If you have a different version of Memories On TV, you need to find a different crack program that matches your version.</li>
-<li><b>Does Crack Memories On Tv 4.1.1 32l work with any operating system?</b><br>
-Yes, Crack Memories On Tv 4.1.1 32l works with any operating system that supports Memories On TV, such as Windows XP, Windows Vista, Windows 7, Windows 8, Windows 10, etc.</li>
-<li><b>Does Crack Memories On Tv 4.1.1 32l affect the quality or performance of Memories On TV?</b><br>
-No, Crack Memories On Tv 4.1.1 32l does not affect the quality or performance of Memories On TV. It only unlocks all the features and benefits of Memories On TV without paying anything.</li>
-</ol>
- </p> 0a6ba089eb<br />
-<br />
-<br />

spaces/1acneusushi/gradio-2dmoleculeeditor/data/Download Memoriesontv 4 Crack Serial 11 with Keygen [Working Tested].md

@@ -1,85 +0,0 @@
-
-<h1>Memoriesontv 4 Crack Serial 11: What You Need to Know</h1>
-<p>If you are looking for a way to create stunning slideshows from your photos and videos, you might have heard of Memoriesontv. This software allows you to add effects, transitions, music, captions, and more to your slideshows and burn them to DVD or share them online. However, Memoriesontv is not a free software, and you need to pay for a license key to use it without limitations. That's why some people resort to using crack serials to unlock the full features of Memoriesontv without paying. In this article, we will explain what Memoriesontv 4 Crack Serial 11 is, how to get it, what are the risks and drawbacks of using it, and what are some alternatives to using it.</p>
- <h2>Introduction</h2>
-<h3>What is Memoriesontv?</h3>
-<p>Memoriesontv is a software developed by CodeJam Pte Ltd that allows you to create professional-looking slideshows from your photos and videos. You can import your media files from your computer, camera, scanner, or other devices, and organize them into albums. You can then customize your slideshows by adding effects, transitions, music, captions, clipart, and more. You can also edit your photos and videos with basic tools such as crop, rotate, resize, color correction, red-eye removal, etc. Once you are done with your slideshow creation, you can preview it on your computer screen or TV. You can also burn it to DVD or CD with a built-in disc menu creator. Alternatively, you can export it as a video file or upload it to YouTube or Facebook directly from the software.</p>
-<h2>Memoriesontv 4 Crack Serial 11</h2><br /><p><b><b>DOWNLOAD</b> ::: <a href="https://byltly.com/2uKxHU">https://byltly.com/2uKxHU</a></b></p><br /><br />
- <h3>What is a crack serial?</h3>
-<p>A crack serial is a code that is used to bypass the registration or activation process of a software. It is usually generated by hackers or crackers who modify the original software code to remove or disable the protection mechanisms that prevent unauthorized use. A crack serial can be entered into the software interface or applied as a patch file that modifies the software executable file. By using a crack serial, you can access the full features of a software without paying for a license key.</p>
- <h3>Why do people use crack serials for Memoriesontv?</h3>
-<p>Some people use crack serials for Memoriesontv because they want to save money and avoid paying for a license key. The official price of Memoriesontv is $59.99 for the Pro edition and $39.99 for the Standard edition. Some people might find this price too expensive or unreasonable for a slideshow software. They might also think that they will only use the software once or twice and not need it anymore. Therefore, they look for ways to get the software for free or at a lower cost.</p>
-<p>Memoriesontv 4 full version with keygen download<br />
-How to activate Memoriesontv 4 using serial number<br />
-Memoriesontv 4 cracked software free download<br />
-Memoriesontv 4 license key generator online<br />
-Memoriesontv 4 patch for windows 11<br />
-Memoriesontv 4 registration code and email<br />
-Memoriesontv 4 torrent download with crack<br />
-Memoriesontv 4 activation key 2023<br />
-Memoriesontv 4 serial key list<br />
-Memoriesontv 4 crack only download<br />
-Memoriesontv 4 product key finder<br />
-Memoriesontv 4 crack for mac os<br />
-Memoriesontv 4 keygen.exe download<br />
-Memoriesontv 4 crack file download<br />
-Memoriesontv 4 serial number verification<br />
-Memoriesontv 4 crack reddit<br />
-Memoriesontv 4 keygen online<br />
-Memoriesontv 4 crack no survey<br />
-Memoriesontv 4 serial key free download<br />
-Memoriesontv 4 crack latest version<br />
-Memoriesontv 4 activation code generator<br />
-Memoriesontv 4 crack zip file download<br />
-Memoriesontv 4 serial number generator<br />
-Memoriesontv 4 crack for windows 10<br />
-Memoriesontv 4 keygen download free<br />
-Memoriesontv 4 crack and keygen download<br />
-Memoriesontv 4 serial number and activation code<br />
-Memoriesontv 4 crack for pc download<br />
-Memoriesontv 4 keygen and patch download<br />
-Memoriesontv 4 crack without serial number<br />
-Memoriesontv 4 serial key generator online<br />
-Memoriesontv 4 crack direct download link<br />
-Memoriesontv 4 serial number free download<br />
-Memoriesontv 4 crack for linux<br />
-Memoriesontv 4 keygen and crack download<br />
-Memoriesontv 4 serial number and email address<br />
-Memoriesontv 4 crack for android download<br />
-Memoriesontv 4 keygen and serial number download<br />
-Memoriesontv 4 crack with serial key download<br />
-Memoriesontv 4 activation code free download<br />
-Memoriesontv 4 crack rar file download<br />
-Memoriesontv 4 serial number and license key<br />
-Memoriesontv 4 crack for ios download<br />
-Memoriesontv 4 keygen and activation code download<br />
-Memoriesontv 4 crack with license key download<br />
-Memoriesontv 4 activation code and email address</p>
- <h2>How to get Memoriesontv 4 Crack Serial 11</h2>
-<h3>Download from official website</h3>
-<p>The first option to get Memoriesontv 4 Crack Serial 11 is to download it from the official website of CodeJam Pte Ltd. The website offers a free trial version of Memoriesontv that you can download and install on your computer. The trial version has some limitations such as watermarking your slideshows, limiting the number of photos per album, and restricting some features such as DVD burning and video exporting. However, you can unlock these limitations by entering a crack serial that you can find on various websites on the internet. Some examples of websites that provide crack serials for Memoriesontv are Smart Serials, KeyGenNinja, and SerialBay. These websites claim to offer valid and working crack serials for various versions of Memoriesontv, including version 4.</p>
- <h3>Download from third-party websites</h3>
-<p>The second option to get Memoriesontv 4 Crack Serial 11 is to download it from third-party websites that host cracked versions of the software. These websites offer direct downloads of Memoriesontv that have been modified or patched by hackers or crackers to bypass the registration or activation process. You do not need to enter any crack serial or apply any patch file when you install these cracked versions of Memoriesontv. Some examples of websites that offer cracked versions of Memoriesontv are Softpedia, Softonic, and FileHippo. These websites claim to offer safe and virus-free downloads of Memoriesontv that have been tested by their editors or users.</p>
- <h3>Download from keygen or generator</h3>
-<p>The third option to get Memoriesontv 4 Crack Serial 11 is to download it from a keygen or generator program that can create crack serials for various software products. A keygen or generator is a software tool that can generate random codes that match the algorithm or pattern of a specific software license key. You can download these programs from various websites on the internet and run them on your computer. Some examples of websites that offer keygen or generator programs for Memoriesontv are YouTube, Praxis Benefits, and SoundCloud. These websites claim to offer working and verified keygen or generator programs for Memoriesontv that can produce valid and unlimited crack serials.</p>
- <h2>Risks and drawbacks of using Memoriesontv 4 Crack Serial 11</h2>
-<h3>Legal issues</h3>
-<p>One of the main risks of using Memoriesontv 4 Crack Serial 11 is that it is illegal and unethical. By using a crack serial, you are violating the terms and conditions of CodeJam Pte Ltd and infringing their intellectual property rights. You are also depriving them of their rightful revenue and profit from their software product. This could result in legal consequences such as fines, lawsuits, or even criminal charges if you are caught using or distributing crack serials for Memoriesontv.</p>
- <h3>Malware and viruses</h3>
-<p>Another risk of using Memoriesontv 4 Crack Serial 11 is that it could expose your computer to malware and viruses. Since crack serials are generated by hackers or crackers who have malicious intentions, they could embed harmful code into the crack serial itself or into the software executable file that they modify or patch. This could compromise your computer security and privacy by installing spyware, ransomware, trojans, worms, keyloggers with an internet connection. The main drawback is that they might require an account or subscription to use some features or remove watermarks.</p>
- <h2>Conclusion</h2>
-<p>Memoriesontv 4 Crack Serial 11 is a code that can unlock the full features of Memoriesontv, a software that allows you to create slideshows from your photos and videos. However, using a crack serial is illegal, unethical, risky, and not recommended. You could face legal issues, malware and viruses, performance and quality issues, and other problems by using a crack serial. Therefore, it is better to use alternatives to using Memoriesontv 4 Crack Serial 11, such as buying a licensed version of Memoriesontv, using a free or open-source slideshow software, or using an online slideshow maker. These alternatives are safer, legal, and more reliable than using a crack serial.</p>
- <h2>FAQs</h2>
-<h3>What is the difference between Memoriesontv Pro and Standard editions?</h3>
-<p>The Pro edition of Memoriesontv has more features than the Standard edition, such as video support, clipart library, disc menu creation, video export options, and more. The Pro edition also costs more than the Standard edition ($59.99 vs $39.99).</p>
- <h3>How can I get technical support or customer service from CodeJam Pte Ltd?</h3>
-<p>You can get technical support or customer service from CodeJam Pte Ltd by visiting their website and clicking on the Support tab. You can also email them at [email protected] or call them at +65 6220 8837.</p>
- <h3>What are some examples of free or open-source slideshow software?</h3>
-<p>Some examples of free or open-source slideshow software are LibreOffice Impress, OpenOffice Impress, Google Slides, and Zoho Show. These software allow you to create and edit slideshows from your photos and videos with various effects, transitions, music, captions, and more.</p>
- <h3>What are some examples of online slideshow makers?</h3>
-<p>Some examples of online slideshow makers are Canva, Prezi, Powtoon, and Visme. These online tools allow you to choose from hundreds of templates, themes, and styles for your slideshows. You can also add effects, transitions, music, captions, and more to your slideshows with drag-and-drop features.</p>
- <h3>What are some advantages and disadvantages of using Memoriesontv?</h3>
-<p>Some advantages of using Memoriesontv are that it allows you to create professional-looking slideshows from your photos and videos with various effects, transitions, music, captions, and more. It also allows you to burn your slideshows to DVD or CD with a built-in disc menu creator or export them as video files or upload them to YouTube or Facebook directly from the software. Some disadvantages of using Memoriesontv are that it is not a free software and requires a license key to use it without limitations. It also might not have as many templates or options as some other slideshow software or online tools.</p>
- </p> 0a6ba089eb<br />
-<br />
-<br />

spaces/1pelhydcardo/ChatGPT-prompt-generator/assets/Descargar Extreme Car Driving Simulator APK Un juego de conduccin realista y divertido.md

@@ -1,122 +0,0 @@
-
-<h1>Extreme Car Driving Simulator: A Realistic and Fun Driving Game for Android</h1>
-<p>Do you love driving cars? Do you want to experience the thrill of driving in a realistic and open world environment? If yes, then you should try Extreme Car Driving Simulator, a popular and exciting driving game for Android devices. In this game, you can drive various cars with different features and performance, and enjoy the realistic physics and car damage effects. You can also explore a large and detailed city with traffic, ramps, obstacles, and more. Whether you want to drive fast, drift, or crash your car, Extreme Car Driving Simulator will give you the freedom and fun you are looking for.</p>
-<h2>extreme car driving simulator descargar apk</h2><br /><p><b><b>Download Zip</b> &#127379; <a href="https://urlin.us/2uSScA">https://urlin.us/2uSScA</a></b></p><br /><br />
-<h2>What is Extreme Car Driving Simulator?</h2>
-<p>Extreme Car Driving Simulator is a driving game developed by AxesInMotion Racing, a studio that specializes in creating realistic and immersive car games. The game was released in 2015 and has since gained over 100 million downloads on Google Play Store. It is one of the best-rated driving games on the platform, with an average rating of 4.3 out of 5 stars.</p>
-<h3>Features of Extreme Car Driving Simulator</h3>
-<p>Extreme Car Driving Simulator has many features that make it stand out from other driving games. Here are some of them:</p>
-<h4>Drive with traffic</h4>
-<p>You can choose to drive with traffic or without traffic in the game. Driving with traffic will make the game more challenging and realistic, as you will have to avoid collisions and follow the traffic rules. You can also honk your horn, flash your lights, and use your indicators to communicate with other drivers.</p>
-<h4>Full real HUD</h4>
-<p>The game has a full real HUD that shows you important information such as your speed, gear, revs, and fuel level. You can also see the status of your ABS, TC, and ESP systems, which you can turn on or off depending on your preference.</p>
-<h4>ABS, TC and ESP simulation</h4>
-<p>The game simulates the anti-lock braking system (ABS), traction control (TC), and electronic stability program (ESP) of real cars. These systems help you control your car better and prevent skidding, spinning, or losing control. You can also turn them off if you want to test your driving skills without any assistance.</p>
-<h4>Explore a detailed open world environment</h4>
-<p>The game has a large and detailed open world environment that you can explore freely. You can drive around the city, which has various buildings, roads, bridges, tunnels, and landmarks. You can also find ramps, loops, obstacles, and other elements that you can use to perform stunts and tricks. The game also has different weather conditions and time of day effects that add to the realism and variety of the game.</p>
-<p>extreme car driving simulator 2023 descargar apk<br />
-extreme car driving simulator mod apk descargar gratis<br />
-extreme car driving simulator hack apk descargar<br />
-extreme car driving simulator 2 descargar apk<br />
-extreme car driving simulator 3d descargar apk<br />
-extreme car driving simulator apk descargar ultima version<br />
-extreme car driving simulator apk descargar para pc<br />
-extreme car driving simulator apk descargar android<br />
-extreme car driving simulator apk descargar uptodown<br />
-extreme car driving simulator apk descargar mega<br />
-extreme car driving simulator pro apk descargar<br />
-extreme car driving simulator full apk descargar<br />
-extreme car driving simulator premium apk descargar<br />
-extreme car driving simulator unlimited money apk descargar<br />
-extreme car driving simulator offline apk descargar<br />
-extreme car driving simulator online apk descargar<br />
-extreme car driving simulator real physics engine apk descargar<br />
-extreme car driving simulator free roam apk descargar<br />
-extreme car driving simulator open world apk descargar<br />
-extreme car driving simulator city drive apk descargar<br />
-extreme car driving simulator drift mode apk descargar<br />
-extreme car driving simulator racing mode apk descargar<br />
-extreme car driving simulator traffic mode apk descargar<br />
-extreme car driving simulator police chase mode apk descargar<br />
-extreme car driving simulator zombie mode apk descargar<br />
-extreme car driving simulator multiplayer mode apk descargar<br />
-extreme car driving simulator custom cars apk descargar<br />
-extreme car driving simulator new cars apk descargar<br />
-extreme car driving simulator best cars apk descargar<br />
-extreme car driving simulator all cars unlocked apk descargar<br />
-extreme car driving simulator realistic graphics apk descargar<br />
-extreme car driving simulator hd graphics apk descargar<br />
-extreme car driving simulator low graphics apk descargar<br />
-extreme car driving simulator high graphics mod apk descargar<br />
-extreme car driving simulator no ads apk descargar<br />
-extreme car driving simulator no internet apk descargar<br />
-extreme car driving simulator no root apk descargar<br />
-extreme car driving simulator latest version apk descargar<br />
-extreme car driving simulator old version apk descargar<br />
-extreme car driving simulator beta version apk descargar<br />
-como descargar e instalar extreme car driving simulator apk <br />
-como jugar a extreme car driving simulator sin descargar el apk <br />
-donde puedo descargar el juego de extreme car driving simulator en formato apk <br />
-que es el juego de extreme car driving simulator y como se descarga el archivo apk <br />
-como actualizar el juego de extreme car driving simulator desde el archivo apk <br />
-como solucionar los problemas de instalacion del juego de extreme car driving simulator con el archivo apk <br />
-como conseguir monedas infinitas en el juego de extreme car driving simulator con el archivo modificado de la aplicacion (modded/hacked)</p>
-<h4>Realistic car damage</h4>
-<p>The game has a realistic car damage system that shows you the effects of your driving actions. You can see your car get dented, scratched, or smashed depending on how hard you hit something. You can also see parts of your car fall off or fly away after a collision. The game also has a repair button that you can use to fix your car instantly if you don't want to see it damaged.</p>
-<h4>Accurate physics</h4>
-<p>The game has an accurate physics engine that makes the driving experience more realistic and fun. You can feel the weight, speed, and inertia of your car as you drive it. You can also see how your car reacts to different surfaces, slopes, curves, and jumps. The game also <h4>Control your car with different options</h4>
-<p>The game gives you different options to control your car. You can choose between tilt, buttons, or steering wheel modes. You can also adjust the sensitivity and position of the controls according to your liking. You can also change the camera view from inside or outside the car, or use the free camera mode to see your car from any angle.</p>
-<h3>How to download and install Extreme Car Driving Simulator APK?</h3>
-<p>If you want to play Extreme Car Driving Simulator on your Android device, you will need to download and install the APK file of the game. APK stands for Android Package Kit, and it is a file format that contains all the necessary files and data for an Android application. Here are the requirements and steps to download and install Extreme Car Driving Simulator APK:</p>
-<h4>Requirements for Extreme Car Driving Simulator APK</h4>
-<ul>
-<li>You will need an Android device that runs on Android 4.1 or higher.</li>
-<li>You will need at least 100 MB of free storage space on your device.</li>
-<li>You will need a stable internet connection to download the APK file.</li>
-<li>You will need to enable the installation of apps from unknown sources on your device. To do this, go to Settings > Security > Unknown Sources and toggle it on.</li>
-</ul>
-<h4>Steps to download and install Extreme Car Driving Simulator APK</h4>
-<ol>
-<li>Go to a trusted and reliable website that offers the APK file of Extreme Car Driving Simulator. You can use this link as an example.</li>
-<li>Click on the download button and wait for the APK file to be downloaded on your device.</li>
-<li>Once the download is complete, locate the APK file in your device's file manager and tap on it.</li>
-<li>Follow the instructions on the screen to install the game on your device.</li>
-<li>After the installation is done, you can launch the game from your app drawer or home screen and enjoy driving.</li>
-</ol>
-<h3>Why should you play Extreme Car Driving Simulator?</h3>
-<p>Extreme Car Driving Simulator is a game that will appeal to anyone who loves driving cars and wants to have a realistic and fun experience. Here are some of the pros and cons of playing this game:</p>
-<h4>Pros of Extreme Car Driving Simulator</h4>
-<ul>
-<li>The game has high-quality graphics and sound effects that create a immersive atmosphere.</li>
-<li>The game has a variety of cars with different features and performance that you can unlock and customize.</li>
-<li>The game has a large and detailed open world environment that you can explore freely and find many surprises.</li>
-<li>The game has a realistic physics and car damage system that makes the driving experience more challenging and fun.</li>
-<li>The game has different modes and options that you can choose from depending on your mood and preference.</li>
-</ul>
-<h4>Cons of Extreme Car Driving Simulator</h4>
-<ul>
-<li>The game may have some bugs and glitches that affect the gameplay and performance.</li>
-<li>The game may have some ads and in-app purchases that may interrupt or limit your enjoyment.</li>
-<li>The game may require a lot of battery power and storage space on your device.</li>
-</ul>
- <h2>Conclusion</h2>
- <p>Extreme Car Driving Simulator is a driving game that will give you a realistic and fun driving experience on your Android device. You can drive various cars with different features and performance, and enjoy the realistic physics and car damage effects. You can also explore a large and detailed city with traffic, ramps, obstacles, and more. Whether you want to drive fast, drift, or crash your car, Extreme Car Driving Simulator will give you the freedom and fun you are looking for. You can download and install the APK file of the game from a trusted website and start driving today.</p>
- <p>If you have any questions or feedback about Extreme Car Driving Simulator, feel free to ask them in the comments section below. Here are some FAQs that may help you:</p>
- <h3>Frequently Asked Questions</h3>
- <ol>
- <li><b>Is Extreme Car Driving Simulator free?</b></li>
- <p>Yes, Extreme Car Driving Simulator is free to download and play. However, it may have some ads and in-app purchases that may affect your gameplay or enjoyment.</p>
- <li><b>Is Extreme Car Driving Simulator safe?</b></li>
- <p>Yes, Extreme Car Driving Simulator is safe to play as long as you download it from a trusted and reliable website. However, you should always be careful when downloading any app from unknown sources, as they may contain viruses or malware that may harm your device or data.</p>
- <li><b>Is Extreme Car Driving Simulator offline?</b></li>
- <p>No, Extreme Car Driving Simulator requires an internet connection to run properly. You will need a stable internet connection to download the APK file, update the game, and access some of the features and content of the game.</p>
- <li><b>How can I unlock more cars in Extreme Car Driving Simulator?</b></li>
- <p>You can unlock more cars in Extreme Car Driving Simulator by earning coins and gems in the game. You can earn coins and gems by completing missions, driving with traffic, performing stunts, and watching ads. You can also buy coins and gems with real money if you want to unlock cars faster.</p>
- <li><b>How can I customize my car in Extreme Car Driving Simulator?</b></li>
- <p>You can customize your car in Extreme Car Driving Simulator by going to the garage menu and selecting the car you want to modify. You can change the color, wheels, spoilers, and stickers of your car. You can also upgrade the engine, brakes, suspension, and turbo of your car to improve its performance.</p>
- <li><b>How can I contact the developer of Extreme Car Driving Simulator?</b></li>
- <p>You can contact the developer of Extreme Car Driving Simulator by sending an email to [email protected]. You can also visit their website or follow them on Facebook, Twitter, or Instagram for more information and updates about the game.</p>
-</ol>
- <p>I hope you enjoyed reading this article and learned something new about Extreme Car Driving Simulator. If you did, please share it with your friends and family who might be interested in this game. Thank you for your time and attention.</p> 197e85843d<br />
-<br />
-<br />

spaces/1phancelerku/anime-remove-background/Descarga Soul Knight Mod APK con gemas y monedas ilimitadas y todo desbloqueado.md

@@ -1,137 +0,0 @@
-
-<h1>Soul Knight Mod Apk Todo Desbloqueado: Cómo Descargar y Jugar el Juego de Calabozos Más Divertido</h1>
- <p>¿Te gustan los juegos de acción, aventura y exploración? ¿Te apasionan los juegos de estilo roguelike con gráficos pixelados y una gran variedad de armas y personajes? ¿Quieres disfrutar de una experiencia de juego sin límites ni restricciones? Entonces, te encantará <strong>Soul Knight Mod Apk Todo Desbloqueado</strong>, una versión modificada del juego original que te permite acceder a todas las características y beneficios del juego desde el principio.</p>
-<h2>soul knight mod apk todo desbloqueado</h2><br /><p><b><b>Download</b> &gt; <a href="https://jinyurl.com/2uNOix">https://jinyurl.com/2uNOix</a></b></p><br /><br />
- <p>En este artículo, te contaremos todo lo que necesitas saber sobre Soul Knight, el juego de calabozos más divertido y adictivo que puedes jugar en tu dispositivo Android o iOS. Te explicaremos qué es Soul Knight, qué es Soul Knight Mod Apk Todo Desbloqueado, cómo descargarlo e instalarlo, cómo jugarlo y algunos consejos y trucos para mejorar tu rendimiento. Además, al final del artículo, responderemos a algunas preguntas frecuentes que pueden surgirte sobre el juego.</p>
- <h2>¿Qué es Soul Knight?</h2>
- <p>Soul Knight es un juego de rol y acción desarrollado por ChillyRoom Inc. que se lanzó en febrero de 2017 para Android y iOS. El juego está inspirado en el juego Enter The Gungeon (un juego de disparos con elementos roguelike producido por Dodge Roll y Devolver Digital).</p>
- <h3>Características del juego</h3>
- <p>Soul Knight tiene las siguientes características:</p>
- <ul>
-<li>Más de 20 héroes únicos con habilidades especiales. Puedes elegir entre un pícaro, un arquero elfo, un mago y muchos más.</li>
-<li>Más de 400 armas diferentes que puedes usar para eliminar a los monstruos que te atacan. Hay pist <p>olas, escopetas, rifles, espadas, lanzallamas y mucho más.</li>
-<li>Un sistema de generación aleatoria de calabozos que hace que cada partida sea diferente y única. Nunca sabrás qué te espera en la próxima habitación.</li>
-<li>Un modo multijugador cooperativo local que te permite jugar con hasta 3 amigos en la misma pantalla. Puedes compartir las armas y los objetos con tus compañeros y ayudaros mutuamente.</li>
-<li>Un estilo gráfico retro y colorido que recuerda a los juegos clásicos de 8 bits y 16 bits. El juego tiene un aspecto nostálgico y encantador.</li>
-<li>Un humor irreverente y divertido que se refleja en los diálogos, los personajes y las situaciones. El juego no se toma muy en serio a sí mismo y te hará reír con sus ocurrencias.</li>
-</ul>
- <h3>Historia del juego</h3>
- <p>La historia de Soul Knight es muy simple y no tiene mucha importancia para el desarrollo del juego. Según el propio juego, "en un tiempo de espadas y pistolas, la piedra mágica que mantiene el equilibrio del mundo es robada por alienígenas de alta tecnología. El mundo pende de un hilo. Todo depende de ti recuperar la piedra mágica...".</p>
- <p>Así pues, tu objetivo es entrar en los calabozos infestados de monstruos y alienígenas, encontrar la piedra mágica y devolverla a su lugar. Por el camino, tendrás que enfrentarte a todo tipo de enemigos y jefes, recolectar armas y objetos, y sobrevivir a las trampas y los obstáculos.</p>
-<p>soul knight mod apk gemas infinitas<br />
-soul knight mod apk monedas ilimitadas<br />
-soul knight mod apk personajes desbloqueados<br />
-soul knight mod apk armas desbloqueadas<br />
-soul knight mod apk ultima version<br />
-soul knight mod apk descargar gratis<br />
-soul knight mod apk sin anuncios<br />
-soul knight mod apk energia infinita<br />
-soul knight mod apk modo dios<br />
-soul knight mod apk mega<br />
-soul knight mod apk mediafıre<br />
-soul knight mod apk android 1<br />
-soul knight mod apk hackeado<br />
-soul knight mod apk 2023<br />
-soul knight mod apk 5.2.4<br />
-soul knight mod apk skins desbloqueadas<br />
-soul knight mod apk plantas infinitas<br />
-soul knight mod apk mascotas desbloqueadas<br />
-soul knight mod apk actualizado<br />
-soul knight mod apk online<br />
-soul knight mod apk offline<br />
-soul knight mod apk no root<br />
-soul knight mod apk facil de instalar<br />
-soul knight mod apk español<br />
-soul knight mod apk full<br />
-soul knight mod apk premium<br />
-soul knight mod apk vip<br />
-soul knight mod apk pro<br />
-soul knight mod apk oro infinito<br />
-soul knight mod apk vida infinita<br />
-soul knight mod apk balas infinitas<br />
-soul knight mod apk daño aumentado<br />
-soul knight mod apk velocidad aumentada<br />
-soul knight mod apk inmortalidad<br />
-soul knight mod apk invencible<br />
-soul knight mod apk todo gratis<br />
-soul knight mod apk todo ilimitado<br />
-soul knight mod apk todo hackeado<br />
-soul knight mod apk todo facil<br />
-soul knight mod apk todo rapido</p>
- <h2>¿Qué es Soul Knight Mod Apk Todo Desbloqueado?</h2>
- <p>Soul Knight Mod Apk Todo Desbloqueado es una versión modificada del juego original que te permite disfrutar de todas las ventajas y beneficios del juego desde el principio. Con este mod apk, no tendrás que gastar dinero real ni esperar a desbloquear los contenidos del juego. Podrás acceder a todo lo siguiente:</p>
- <h3>Ventajas de usar el mod apk</h3>
- <ul>
-<li>Todos los héroes desbloqueados. Podrás elegir entre más de 20 personajes diferentes con habilidades únicas y personalizarlos a tu gusto.</li>
-<li>Todas las armas desbloqueadas. Podrás usar cualquiera de las más de 400 armas disponibles en el juego sin restricciones ni limitaciones.</li>
-<li>Todos los objetos desbloqueados. Podrás equiparte con todo tipo de objetos que te ayudarán en tu aventura, como pociones, granadas, anillos, mascotas y más.</li>
-<li>Todos los niveles desbloqueados. Podrás explorar todos los calabozos del juego sin tener que completarlos en orden ni cumplir con ciertos requisitos.</li>
-<li>Todos los modos de juego desbloqueados. Podrás jugar en el modo normal, el modo difícil, el modo jefe o el modo infinito según tu preferencia.</li>
-<li>Dinero ilimitado. Podrás comprar todo lo que quieras en las tiendas del juego sin preocuparte por el precio ni por tu saldo.</li>
-<li>Energía ilimitada. Podrás usar tu habilidad especial tantas veces como quieras sin tener que esperar a que se recargue.</li>
-<li>Sin anuncios. Podrás jugar sin interrupciones ni molestias por parte de la publicidad.</li>
-</ul>
- <h3>Cómo descargar e instalar el mod apk</h3>
- <p>Para descargar e instalar el mod apk de Soul Knight Todo Desbloqueado, solo tienes que seguir estos pasos:</p>
- <ol>
-<li>Descarga el archivo apk desde este <a href="">enlace</a>. El archivo tiene un tamaño de unos 100 MB y es seguro y confiable.</li>
-<li>Abre el archivo apk desde tu gestor de archivos o desde la carpeta de descargas de tu dispositivo.</li>
-<li>Acepta los permisos e inicia la instalación. El proceso puede tardar unos segundos o minutos dependiendo de tu velocidad de conexión y de tu dispositivo.</li>
-<li>Una vez instalado el juego, abrelo y disfruta de Soul Knight Mod Apk Todo Desbloqueado.</li y un jefe final que tendrás que derrotar para avanzar al siguiente. Por ejemplo, hay calabozos de bosque, de hielo, de lava, de desierto y de espacio.</p>
- <p>Para explorar los calabozos, solo tienes que usar el joystick virtual de la parte inferior izquierda para moverte y el botón de disparo de la parte inferior derecha para atacar. También puedes usar el botón de habilidad especial de la parte superior derecha para activar el poder único de tu héroe. Además, puedes cambiar de arma pulsando en el icono del arma en la parte superior izquierda o recoger nuevas armas que encuentres por el camino.</p>
- <p>Cada calabozo tiene varias habitaciones que tendrás que atravesar hasta llegar al jefe. Algunas habitaciones están vacías, otras tienen enemigos que tendrás que eliminar, y otras tienen objetos o personajes que te pueden ayudar o perjudicar. Por ejemplo, puedes encontrar tiendas donde comprar armas u objetos, estatuas que te dan bendiciones o maldiciones, cofres que contienen tesoros o trampas, o personajes secundarios que te ofrecen misiones o consejos.</p>
- <h3>Usa las armas y los objetos</h3>
- <p>Una de las características más divertidas y variadas de Soul Knight es la gran cantidad de armas y objetos que puedes usar en tu aventura. Hay más de 400 armas diferentes que puedes encontrar, comprar o fusionar, cada una con su propio tipo de disparo, daño, cadencia, alcance y efecto especial. Por ejemplo, hay armas que disparan balas normales, otras que disparan rayos láser, otras que disparan misiles teledirigidos, otras que disparan bolas de fuego, y así sucesivamente.</p>
- <p>Además, hay muchos objetos que puedes equiparte o usar para mejorar tu rendimiento o tu supervivencia. Por ejemplo, hay pociones que te curan o te dan energía, granadas que explotan y dañan a los enemigos cercanos, anillos que te dan bonificaciones permanentes o temporales, mascotas que te acompañan y te ayudan en el combate, y mucho más.</p>
- <p>Para usar las armas y los objetos, solo tienes que pulsar en el icono correspondiente en la pantalla. Puedes llevar hasta dos armas al mismo tiempo y cambiar entre ellas cuando quieras. También puedes llevar hasta tres objetos diferentes y usarlos cuando los necesites. Además, puedes fusionar o mejorar tus armas usando las forjas o los talleres que encuentres en los calabozos.</p>
- <h3>Combate a los enemigos y los jefes</h3>
- <p>El principal desafío de Soul Knight es enfrentarte a los numerosos enemigos y jefes que te atacarán sin piedad en los calabozos. Hay más de 200 tipos de enemigos diferentes, cada uno con su propio aspecto, comportamiento y habilidad. Por ejemplo, hay esqueletos que te lanzan huesos, zombis que te muerden, arañas que te lanzan telarañas, robots que te disparan láseres, alienígenas que se teletransportan y muchos más.</p>
- <p>Para combatir a los enemigos, tendrás que usar tus armas, tus objetos y tu habilidad especial con inteligencia y estrategia. Tendrás que tener en cuenta el tipo de arma que usas, el tipo de enemigo al que te enfrentas y el entorno en el que te encuentras. También tendrás que esquivar los ataques enemigos moviéndote por la pantalla y aprovechando los obstáculos o las coberturas.</p>
- <p>Al final de cada calabozo, tendrás que enfrentarte a un jefe final que será mucho más fuerte y resistente que los demás enemigos. Cada jefe tiene su propio diseño , su patrón de ataque y su debilidad. Por ejemplo, hay un jefe que es una planta gigante que te lanza espinas, otro que es un dragón de hielo que te congela, otro que es un caballero oscuro que te persigue con su espada y muchos más.</p>
- <p>Para derrotar a los jefes, tendrás que usar tus mejores armas, tus objetos más útiles y tu habilidad especial más poderosa. Tendrás que estar atento a sus movimientos y a sus señales para anticiparte a sus ataques y evitarlos. También tendrás que buscar sus puntos débiles y aprovecharlos para infligirles más daño.</p>
- <h2>Consejos y trucos para jugar Soul Knight Mod Apk Todo Desbloqueado</h2>
- <p>Soul Knight Mod Apk Todo Desbloqueado es un juego muy divertido y adictivo, pero también puede ser muy desafiante y frustrante si no sabes cómo jugarlo bien. Por eso, te vamos a dar algunos consejos y trucos para que puedas mejorar tu rendimiento y disfrutar más del juego. Estos son algunos de ellos:</p>
- <h3>Aprovecha tu habilidad especial</h3>
- <p>Cada héroe tiene una habilidad especial que puede marcar la diferencia en el combate. Estas habilidades pueden ser ofensivas, defensivas o de apoyo, y tienen un tiempo de recarga que varía según el héroe. Por ejemplo, el caballero puede usar dos armas al mismo tiempo durante unos segundos, el asesino puede volverse invisible y lanzar cuchillos, el alquimista puede lanzar bombas venenosas y curarse a sí mismo, y así sucesivamente.</p>
- <p>Para aprovechar tu habilidad especial, tienes que saber cuándo y cómo usarla. No la desperdicies en situaciones innecesarias o fáciles, sino que guárdala para los momentos más difíciles o decisivos. Por ejemplo, puedes usarla para escapar de una situación peligrosa, para acabar con un grupo de enemigos o para enfrentarte a un jefe. También tienes que tener en cuenta el tipo de habilidad que tienes y cómo se complementa con tu arma y tu estilo de juego.</p>
- <h3>Gestiona tu energía y tu salud</h3>
- <p>Otro aspecto importante de Soul Knight es la gestión de tu energía y tu salud. La energía es el recurso que necesitas para usar tus armas, mientras que la salud es el indicador de tu vida. Ambos se pueden ver en la parte superior izquierda de la pantalla.</p>
- <p>Para gestionar tu energía y tu salud, tienes que tener en cuenta lo siguiente:</p>
- <ul>
-<li>No malgastes tu energía disparando sin sentido o usando armas que consumen mucha energía. Intenta disparar solo cuando tengas un objetivo claro y usa armas que se adapten a tu nivel de energía.</li>
-<li>Recupera tu energía usando las pociones azules que encuentres por el camino o comprando en las tiendas. También puedes recargar tu energía usando las fuentes o los generadores que hay en algunos calabozos.</li>
-<li>No arriesgues tu salud recibiendo daño innecesario o exponiéndote al fuego enemigo. Intenta esquivar los ataques enemigos moviéndote por la pantalla y aprovechando los obstáculos o las coberturas.</li>
-<li>Recupera tu salud usando las pociones rojas que encuentres por el camino o comprando en las tiendas. También puedes curarte usando algunas habilidades especiales o algunos objetos como el anillo de vida o la mascota vampiro.</li>
-</ul>
- <h3>Busca las estatuas y los cofres</h3>
- <p>En los calabozos de Soul Knight hay muchos secretos y sorpresas que puedes descubrir si exploras bien cada habitación. Algunos de estos secretos son las estatuas y los cofres, que te pueden dar beneficios o perjuicios según lo que hagas con ellos.</p>
- <p>Las estatuas son objetos que representan a diferentes personajes o criaturas del juego. Puedes interactuar con ellas usando una moneda dorada o una moneda plateada. Si usas una moneda dorada, la estatua te dará una bendición, que es un efecto positivo temporal o permanente. Por ejemplo, puede aumentar tu daño, tu velocidad, tu resist encia o tu suerte. Si usas una moneda plateada, la estatua te dará una maldición, que es un efecto negativo temporal o permanente. Por ejemplo, puede reducir tu daño, tu velocidad, tu resistencia o tu suerte. Por lo tanto, ten cuidado con lo que usas y con lo que eliges.</p>
- <p>Los cofres son objetos que contienen tesoros o trampas. Puedes abrirlos usando una llave o rompiéndolos con tu arma. Si abres un cofre con una llave, obtendrás un tesoro, que puede ser una arma, un objeto o una moneda. Si rompes un cofre con tu arma, puede que obtengas un tesoro o una trampa, que puede ser un enemigo, una explosión o una maldición. Por lo tanto, piensa bien si vale la pena arriesgarte o no.</p>
- <h3>Fusiona y mejora tus armas</h3>
- <p>Otro consejo para jugar a Soul Knight Mod Apk Todo Desbloqueado es fusionar y mejorar tus armas para hacerlas más poderosas y eficaces. Para fusionar tus armas, tienes que usar las forjas que hay en algunos calabozos. Las forjas te permiten combinar dos armas del mismo tipo para obtener una nueva arma con mejores características y efectos. Por ejemplo, puedes fusionar dos pistolas para obtener una pistola doble, o dos escopetas para obtener una escopeta de doble cañón.</p>
- <p>Para mejorar tus armas, tienes que usar los talleres que hay en algunos calabozos. Los talleres te permiten aumentar el nivel de tus armas usando monedas doradas. Al aumentar el nivel de tus armas, aumentas su daño, su cadencia, su alcance y su efecto especial. Por ejemplo, puedes mejorar una pistola normal para que dispare más rápido, más lejos y con más fuerza.</p>
- <h2>Conclusión</h2>
- <p>Soul Knight Mod Apk Todo Desbloqueado es un juego de rol y acción muy divertido y adictivo que te hará pasar horas de diversión y entretenimiento. Con este mod apk, podrás disfrutar de todas las ventajas y beneficios del juego sin tener que gastar dinero ni esperar a desbloquear los contenidos. Podrás acceder a todos los héroes, todas las armas, todos los objetos, todos los niveles y todos los modos de juego desde el principio.</p>
- <p>Además, podrás explorar los calabozos generados aleatoriamente, usar las armas y los objetos más variados y originales, combatir a los enemigos y los jefes más desafiantes y divertidos, y jugar con tus amigos en el modo multijugador cooperativo local. Todo ello con un estilo gráfico retro y colorido y un humor irreverente y divertido.</p>
- <p>Si te gustan los juegos de estilo roguelike con gráficos pixelados y una gran variedad de armas y personajes, no dudes en descargar Soul Knight Mod Apk Todo Desbloqueado y empezar a jugar ya. Te aseguramos que no te arrepentirás.</p>
- <h2>Preguntas frecuentes</h2>
- <p>A continuación, responderemos a algunas preguntas frecuentes que pueden surgirte sobre Soul Knight Mod Apk Todo Desbloqueado:</p>
- <h4>¿Es seguro descargar e instalar Soul Knight Mod Apk Todo Desbloqueado?</h4>
- <p>Sí, es seguro descargar e instalar Soul Knight Mod Apk Todo Desbloqueado desde el enlace que te hemos proporcionado en este artículo. El archivo apk es seguro y confiable, y no contiene virus ni malware. Además, no necesitas rootear ni jailbreakear tu dispositivo para instalarlo.</p>
- <h4>¿Es compatible Soul Knight Mod Apk Todo Desbloqueado con mi dispositivo?</h4>
- <p>Soul Knight Mod Apk Todo Desbloqueado es compatible con la mayoría de los dispositivos Android e iOS que tengan al menos la versión 4.1 o superior del sistema operativo. Sin embargo, puede haber algunos dispositivos que no sean compatibles o que presenten problemas de rendimiento o estabilidad. En ese caso, te recomendamos que pruebes el juego original o que contactes con el desarrollador para solucionar el problema.</p>
- <h4>¿Puedo jugar online con Soul Knight Mod Apk Todo Desbloqueado?</h4>
- <p>No, no puedes jugar online con Soul Knight Mod Apk Todo Desbloqueado con otros jugadores que no estén en tu misma red local. El juego solo tiene un modo multijugador cooperativo local que te permite jugar con hasta 3 amigos en la misma pantalla. Para jugar con tus amigos, solo tienes que conectaros a la misma red wifi y pulsar en el icono de multijugador en el menú principal. Luego, podréis elegir vuestros héroes y entrar en los calabozos juntos.</p>
- <h4>¿Puedo actualizar Soul Knight Mod Apk Todo Desbloqueado?</h4>
- <p>Sí, puedes actualizar Soul Knight Mod Apk Todo Desbloqueado cuando haya una nueva versión disponible. Para actualizar el juego, solo tienes que descargar el nuevo archivo apk desde el mismo enlace que te hemos proporcionado en este artículo y seguir los mismos pasos que para instalarlo. No hace falta que desinstales la versión anterior, solo sobrescríbela con la nueva. Así, podrás disfrutar de las últimas novedades y mejoras del juego.</p>
- <h4>¿Qué otros juegos similares a Soul Knight Mod Apk Todo Desbloqueado me recomiendas?</h4>
- <p>Si te gusta Soul Knight Mod Apk Todo Desbloqueado, quizás también te gusten otros juegos similares que tienen un estilo de juego parecido o que están inspirados en el mismo género. Algunos de estos juegos son:</p>
- <ul>
-<li>Enter The Gungeon: el juego que inspiró a Soul Knight, un juego de disparos con elementos roguelike donde tienes que explorar un calabozo lleno de armas y balas vivientes.</li>
-<li>Archero: un juego de acción y aventura donde controlas a un arquero que tiene que avanzar por diferentes niveles llenos de enemigos y obstáculos.</li>
-<li>Dead Cells: un juego de plataformas y acción con elementos roguelike donde controlas a un guerrero inmortal que tiene que escapar de una prisión maldita.</li>
-<li>The Binding of Isaac: un juego de acción y aventura con elementos roguelike donde controlas a un niño que tiene que huir de su madre loca y explorar un sótano lleno de monstruos y secretos.</li>
-<li>Rogue Legacy: un juego de plataformas y acción con elementos roguelike donde controlas a un héroe que tiene que explorar un castillo generacional lleno de peligros y sorpresas.</li>
-</ul></p> 401be4b1e0<br />
-<br />
-<br />

spaces/1phancelerku/anime-remove-background/Download and Play Special Forces Group 2 with God Mod APK and Get Ready for Intense Shooter Action.md

@@ -1,25 +0,0 @@
-<br />
-<h1>Special Forces Group 2: A Thrilling FPS Game for Android</h1>
-<p>If you are a fan of first-person shooter (FPS) games, you might have heard of Special Forces Group 2, a popular game for Android devices. This game is developed by ForgeGames, a company that specializes in creating realistic and immersive shooting games. Special Forces Group 2 is one of their best creations, as it offers a variety of game modes, weapons, maps, and characters to choose from. You can play this game solo or with your friends online or offline, and enjoy the adrenaline rush of shooting your enemies in different scenarios.</p>
-<h2>Features of Special Forces Group 2</h2>
-<p>Special Forces Group 2 has many features that make it stand out from other FPS games. Here are some of them:</p>
-<h2>special forces group 2 god mod apk download</h2><br /><p><b><b>DOWNLOAD</b> &#10038; <a href="https://jinyurl.com/2uNTYZ">https://jinyurl.com/2uNTYZ</a></b></p><br /><br />
-<ul>
-<li><b>Singleplayer and multiplayer modes</b>: You can play this game alone with bots or with other players online or via WiFi router. You can also create your own room and invite your friends to join you.</li>
-<li><b>9 game modes to choose from</b>: You can choose from different game modes, such as Classic, Resurrection, Capture the Flag, Zombie Mode, BombMode, Knives, Deathmatch, ArmsRace, and Sniper. Each mode has its own rules and objectives, so you will never get bored.</li>
-<li><b>Weapons skins and characters customization</b>: You can customize your weapons and characters with different skins. There are 134 weapons skins and 8 characters per team to choose from. You can also change the color of your crosshair, blood, and chat.</li>
-<li><b>30+ maps to explore</b>: You can play on different maps, such as desert, city, snow, forest, and more. Each map has its own layout, obstacles, and hiding spots. You can also use grenades, bulletproof vests, and other items to help you in your missions.</li>
-</ul>
-<h2>How to Download and Install Special Forces Group 2 on Android</h2>
-<p>If you want to download and install Special Forces Group 2 on your Android device, you can follow these simple steps:</p>
-<ol>
-<li><b>Step 1</b>: Go to the official website or a trusted source that provides the APK file and the OBB file for Special Forces Group 2. For example, you can go to [APKdone](^1^), a website that offers free and safe downloads for Android games.</li>
-<li><b>Step 2</b>: Download the APK file and the OBB file for Special Forces Group 2. The APK file is about 40 MB in size, while the OBB file is about 300 MB in size. Make sure you have enough storage space on your device before downloading.</li>
-<li><b>Step 3 , you should be careful of the compatibility issues and the risks of using God Mod APK, as mentioned above.</li>
-<li><b>Q4: Can I play online with God Mod APK?</b></li>
-<li>A4: You can play online with God Mod APK, but you may face some problems, such as lag, disconnects, or bans. You may also encounter other players who are using God Mod APK or other cheats, which may ruin your gaming experience.</li>
-<li><b>Q5: What are some alternatives to God Mod APK?</b></li>
-<li>A5: Some alternatives to God Mod APK are normal APK, modded OBB, or hacked data. These are different ways of modifying the game files to get some advantages in the game. However, they also have their own drawbacks and risks, so you should use them with caution.</li>
-</ul></p> 197e85843d<br />
-<br />
-<br />

spaces/1phancelerku/anime-remove-background/Download emulator black ps2 android with these simple steps.md

@@ -1,224 +0,0 @@
-<br />
-<h1>How to Download and Install Emulator Black PS2 Android</h1>
-<p>If you are a fan of PlayStation 2 games and want to play them on your Android device, you might be interested in Emulator Black PS2 Android. This is a powerful and reliable PS2 emulator that can run most of the PS2 games smoothly and with high-quality graphics. In this article, we will show you what Emulator Black PS2 Android is, why you need it, how to download and install it, how to configure and optimize it, and how to solve some common issues. Let's get started!</p>
- <h2>What is Emulator Black PS2 Android?</h2>
-<p>Emulator Black PS2 Android is a new PS2 emulator that was launched in late 2021 by a developer named Tahlreth. It is based on the PCSX2 emulator, which is a popular and well-established emulator for PC. Tahlreth got the permission from the PCSX2 developers to use their code and licensed it under the LGPL license. Unlike some other shady PS2 emulators on Android, such as DamonPS2, Emulator Black PS2 Android does not steal code or charge money for its features.</p>
-<h2>download emulator black ps2 android</h2><br /><p><b><b>Download Zip</b> &#9193; <a href="https://jinyurl.com/2uNKk9">https://jinyurl.com/2uNKk9</a></b></p><br /><br />
-<p>Emulator Black PS2 Android has many features that make it one of the best PS2 emulators on Android. Some of these features are:</p>
-<ul>
-<li>It supports both OpenGL and Vulkan graphics renderers, which can improve the graphics quality and performance of the games.</li>
-<li>It allows you to adjust various settings, such as resolution, framerate, aspect ratio, anti-aliasing, texture filtering, audio latency, controller layout, and more.</li>
-<li>It supports save states, which let you save and load your game progress at any point.</li>
-<li>It supports widescreen patches and upscaling, which can enhance the appearance of the games on modern devices.</li>
-<li>It supports touchscreen and Bluetooth controller input, which gives you more options to control the games.</li>
-<li>It supports loading games from your device storage or external sources, such as Google Drive or Dropbox.</li>
-</ul>
- <h2>Why do you need Emulator Black PS2 Android?</h2>
-<p>Emulator Black PS2 Android is a great way to enjoy your favorite PS2 games on your Android device. There are many benefits of using this emulator, such as:</p>
-<ul>
-<li>You can play hundreds of PS2 games that are not available on any other platform.</li>
-<li>You can play PS2 games anytime and anywhere without needing a console or a TV.</li>
-<li>You can play PS2 games with better graphics and sound than the original hardware.</li>
-<li>You can play PS2 games with more convenience and customization than the original hardware.</li>
-</ul>
-<p>However, playing PS2 games on Android is not an easy task. There are many challenges that you might face when using a PS2 emulator on Android, such as:</p>
-<ul>
-<li>You need a powerful device that can handle the high demands of PS2 emulation. The developer of Emulator Black PS2 Android recommends a Snapdragon 845-level processor or better, with four large CPU cores (Cortex-A75 or higher) and an Adreno GPU.</li>
-<li>You need enough storage space to store the emulator app and the PS2 game files. The emulator app is about 30 MB, while the PS2 game files can range from 500 MB to 4 GB each.</li>
-<li>You need to obtain the PS2 game files legally and ethically. You can either rip them from your own PS2 discs using a PC and a DVD drive, or download them from legitimate sources that have the permission of the game publishers. You should not download or share pirated or illegal PS2 game files.</li>
-<li>You need to tweak and test the emulator settings for each game to find the best balance between quality and performance. Not all games will run perfectly on the emulator, and some might require specific settings or patches to work properly.</li>
-</ul>
-<p>Fortunately, Emulator Black PS2 Android is designed to overcome these challenges and provide you with the best PS2 emulation experience on Android. It has a user-friendly interface, a fast and stable performance, a high compatibility rate, and a helpful community. It also has regular updates and bug fixes that improve its functionality and features.</p>
- <h2>How to download and install Emulator Black PS2 Android?</h2>
-<p>Downloading and installing Emulator Black PS2 Android is very easy and straightforward. You have two options to get the emulator app on your device:</p>
-<ol>
-<li>Download it from the official website. You can visit the website of Emulator Black PS2 Android at <a href="">https://emulatorblackps2android.com</a> and click on the download button. This will download the latest version of the emulator app as an APK file. You can then install it by tapping on the file and following the instructions.</li>
-<li>Download it from the Google Play Store. You can also find Emulator Black PS2 Android on the Google Play Store by searching for its name or scanning this QR code: <img src="" alt="QR code for Emulator Black PS2 Android">. This will take you to the app page, where you can tap on the install button. This will download and install the emulator app automatically.</li>
-</ol>
-<p>After you have installed the emulator app, you need to grant it some permissions to access your device storage, camera, microphone, and location. These permissions are necessary for the emulator to function properly and load your PS2 games. You can grant these permissions by going to your device settings, finding Emulator Black PS2 Android in the list of apps, and toggling on the permissions.</p>
-<p>download aethersx2 ps2 emulator for android<br />
-download deus ex play ps2 emulator for android<br />
-download pro playstation ps2 emulator for android<br />
-download golden ps2 emulator for android<br />
-download gold ps2 emulator for android<br />
-download new ps2 emulator for android<br />
-download free pro ps2 emulator for android<br />
-download free hd ps2 emulator for android<br />
-download pro ppss2 emulator for android<br />
-download playstation 2 emulator for android apk<br />
-download best ps2 emulator for android 2023<br />
-download damonps2 pro ps2 emulator for android<br />
-download pcsx2 emulator for android phone<br />
-download playstation 2 games for android emulator<br />
-download black ps2 game iso for android<br />
-how to play black ps2 on android with aethersx2<br />
-how to install deus ex play ps2 emulator on android<br />
-how to configure pro playstation ps2 emulator on android<br />
-how to use golden ps2 emulator on android device<br />
-how to run gold ps2 emulator on android tablet<br />
-how to set up new ps2 emulator on android smartphone<br />
-how to optimize free pro ps2 emulator on android performance<br />
-how to improve free hd ps2 emulator on android graphics<br />
-how to fix pro ppss2 emulator on android errors<br />
-how to download playstation 2 bios for android emulator<br />
-best settings for aethersx2 ps2 emulator on android<br />
-best games for deus ex play ps2 emulator on android<br />
-best features of pro playstation ps2 emulator on android<br />
-best alternatives to golden ps2 emulator on android<br />
-best tips and tricks for gold ps2 emulator on android<br />
-new updates for new ps2 emulator on android 2023<br />
-new cheats for free pro ps2 emulator on android 2023<br />
-new mods for free hd ps2 emulator on android 2023<br />
-new roms for pro ppss2 emulator on android 2023<br />
-new version of playstation 2 emulator for android apk 2023<br />
-compare aethersx2 vs damonps2 pro ps2 emulator for android<br />
-compare deus ex play vs pcsx2 ps2 emulator for android phone<br />
-compare pro playstation vs playstation 2 games for android emulator<br />
-compare golden vs gold ps2 emulator for android 2023<br />
-compare new vs free pro ps2 emulator for android performance<br />
-compare free hd vs pro ppss2 emulator for android graphics<br />
-compare playstation 2 bios vs playstation 2 iso for android emulator<br />
-review of aethersx2 ps2 emulator for android 2023<br />
-review of deus ex play ps2 emulator for android 2023<br />
-review of pro playstation ps2 emulator for android 2023</p>
- <h2>How to load PS2 games on Emulator Black PS2 Android?</h2>
-<p>Once you have installed the emulator app and granted it the permissions, you can start loading your PS2 games on it. You have two options to load your PS2 games:</p>
-<ol>
-<li>Load them from your device storage. If you have stored your PS2 game files on your device storage, such as your internal memory or SD card, you can load them directly from there. You just need to launch the emulator app, tap on the "Load Game" button, and browse to the folder where you have saved your PS2 game files. You can then select the game file that you want to play and tap on it.</li>
-<li>Load them from external sources. If you have stored your PS2 game files on external sources, such as Google Drive or Dropbox, you can load them from there as well. You just need to launch the emulator app, tap on the "Load Game" button, and tap on the "Cloud" icon. This will open a menu where you can choose which cloud service you want to use. You can then sign in with your account and access your PS2 game files. You can then select the game file that you want to play and tap on it.</li>
-</ol>
-<p>Note that Emulator Black PS2 Android supports both ISO and CSO formats for PS2 game files. ISO is the standard format that preserves all the data of the original disc, while CSO is a compressed format that reduces the file size but may lose some quality or functionality. You can choose whichever format suits your preference and storage space.</p>
- <h2>How to configure and optimize Emulator Black PS2 Android?</h2>
-<p>Emulator Black PS2 Android has a lot of settings and options that you can adjust to configure and optimize the emulator according to your device and game. You can access these settings by tapping on the "Settings" button on the main menu of the emulator app. Here are some of the main settings and options that you can tweak:</p>
-<h3>Graphics settings</h3>
-<p>The graphics settings allow you to change the graphics renderer, resolution, framerate, aspect ratio, anti-aliasing, texture filtering, and other options that affect the visual quality and performance of the games. You can find these settings under the "Graphics" tab in the settings menu. Here are some of the graphics settings and what they do:</p>
-<table>
-<tr>
-<th>Setting</th>
-<th>Description</th>
-</tr>
-<tr>
-<td>Renderer</td>
-<td>This lets you choose between OpenGL and Vulkan as the graphics renderer for the emulator. OpenGL is more compatible and stable, but Vulkan is more powerful and efficient. You can try both and see which one works better for your device and game.</td>
-</tr>
-<tr>
-<td>Resolution</td>
-<td>This lets you choose the resolution of the game output. The higher the resolution, the sharper and clearer the game will look, but it will also consume more resources and battery. You can choose from several presets, such as native (the original resolution of the PS2), 2x native, 3x native, 4x native, or custom (where you can enter your own resolution).</td>
-</tr>
-<tr>
-<td>Framerate</td>
-<td>This lets you choose the framerate of the game output. The higher the framerate, the smoother and more fluid the game will run, but it will also consume more resources and battery. You can choose from several presets, such as 30 FPS (the standard framerate of most PS2 games), 60 FPS (the ideal framerate for smooth gameplay), or custom (where you can enter your own framerate).</td>
-</tr>
-<tr>
-<td>Aspect ratio</td>
-<td>This lets you choose the aspect ratio of the game output. The aspect ratio is the ratio between the width and height of the screen. You can choose from several presets, such as 4:3 (the original aspect ratio of most PS2 games), 16:9 (the widescreen aspect ratio of modern devices), or custom (where you can enter your own aspect ratio).</td>
-</tr>
-<tr>
-<td>Anti-aliasing</td>
-<td>This lets you choose whether to enable or disable anti-aliasing for the game output. Anti-aliasing is a technique that smooths out the jagged edges of the graphics, making them look more realistic and less pixelated. However, it also consumes more resources and battery. You can choose from several levels of anti-aliasing, such as none, 2x, 4x, or 8x.</td>
-</tr>
-<tr>
-<td>Texture filtering</td>
-<td>This lets you choose whether to enable or disable texture filtering for the game output. Texture filtering is a technique that improves the quality and sharpness of the textures, making them look more detailed and less blurry. However, it also consumes more resources and battery. You can choose from several levels of texture filtering, such as none, bilinear, trilinear, or anisotropic.</td>
-</tr>
-<tr>
-<td>Other options</td>
-<td>There are also some other options that you can toggle on or off in the graphics settings, such as:</td>
-</tr> <ul>
-<li>Widescreen patch: This applies a patch to the game that makes it compatible with the widescreen aspect ratio, without stretching or cropping the image.</li>
-<li>Upscaling: This enhances the resolution and quality of the game graphics, making them look more crisp and smooth.</li>
-<li>Frame skipping: This skips some frames of the game output, making it run faster but less smoothly.</li>
-<li>Vsync: This synchronizes the framerate of the game output with the refresh rate of your device screen, preventing screen tearing and stuttering.</li>
-</ul>
-<h3>Sound settings</h3>
-<p>The sound settings allow you to change the sound latency, volume, and quality of the games. You can find these settings under the "Sound" tab in the settings menu. Here are some of the sound settings and what they do:</p>
-<table>
-<tr>
-<th>Setting</th>
-<th>Description</th>
-</tr>
-<tr>
-<td>Latency</td>
-<td>This lets you choose the latency of the sound output. The latency is the delay between the sound being generated by the emulator and being played by your device. The lower the latency, the more responsive and accurate the sound will be, but it will also consume more resources and battery. You can choose from several presets, such as low, medium, high, or custom (where you can enter your own latency).</td>
-</tr>
-<tr>
-<td>Volume</td>
-<td>This lets you choose the volume of the sound output. You can adjust the volume by using a slider or entering a value between 0 and 100.</td>
-</tr>
-<tr>
-<td>Quality</td>
-<td>This lets you choose the quality of the sound output. The quality is the fidelity and clarity of the sound, which depends on factors such as sampling rate, bit depth, and channels. The higher the quality, the better and richer the sound will be, but it will also consume more resources and battery. You can choose from several presets, such as low, medium, high, or custom (where you can enter your own quality).</td>
-</tr>
-</table>
- <h3>Controls settings</h3>
-<p>The controls settings allow you to change the input method, layout, sensitivity, and vibration of the games. You can find these settings under the "Controls" tab in the settings menu. Here are some of the controls settings and what they do:</p>
-<table>
-<tr>
-<th>Setting</th>
-<th>Description</th>
-</tr>
-<tr>
-<td>Input method</td>
-<td>This lets you choose between touchscreen and Bluetooth controller as your input method for the games. If you choose touchscreen, you will see a virtual controller on your device screen that mimics the PS2 controller buttons and sticks. If you choose Bluetooth controller, you will need to pair your device with a compatible Bluetooth controller that has enough buttons and sticks to map to the PS2 controller.</td>
-</tr>
-<tr>
-<td>Layout</td>
-<td>This lets you customize the layout of the virtual controller on your device screen. You can drag and drop each button and stick to any position on your screen. You can also resize and rotate them by using pinch and twist gestures. You can save your layout as a preset and load it for different games.</td>
-</tr>
-<tr>
-<td>Sensitivity</td>
-<td>This lets you adjust the sensitivity of each stick on your virtual or Bluetooth controller. The sensitivity is how fast and responsive the stick is to your input. You can adjust the sensitivity by using a slider or entering a value between 0 and 100.</td>
-</tr>
-<tr>
-<td>Vibration</td>
-<td>This lets you enable or disable vibration for your virtual or Bluetooth controller. Vibration is a feature that makes your controller rumble or shake when certain events happen in the game, such as shooting, hitting, or exploding. However, it also consumes more resources and battery.</td>
-</tr> <h3>Performance settings</h3>
-<p>The performance settings allow you to change the CPU and GPU emulation modes, speed hacks, and power saving options of the games. You can find these settings under the "Performance" tab in the settings menu. Here are some of the performance settings and what they do:</p>
-<table>
-<tr>
-<th>Setting</th>
-<th>Description</th>
-</tr>
-<tr>
-<td>CPU emulation mode</td>
-<td>This lets you choose between interpreter and recompiler as the CPU emulation mode for the games. The CPU emulation mode is how the emulator translates the PS2 CPU instructions to your device CPU instructions. Interpreter is more accurate and compatible, but slower and more resource-intensive. Recompiler is faster and more efficient, but less accurate and compatible. You can try both and see which one works better for your device and game.</td>
-</tr>
-<tr>
-<td>GPU emulation mode</td>
-<td>This lets you choose between software and hardware as the GPU emulation mode for the games. The GPU emulation mode is how the emulator renders the PS2 graphics to your device screen. Software is more accurate and compatible, but slower and more resource-intensive. Hardware is faster and more efficient, but less accurate and compatible. You can try both and see which one works better for your device and game.</td>
-</tr>
-<tr>
-<td>Speed hacks</td>
-<td>This lets you enable or disable some speed hacks for the games. Speed hacks are some tricks that the emulator uses to boost the speed of the games, such as skipping some calculations, frames, or effects. However, they can also cause some glitches, errors, or crashes in some games. You can choose from several presets, such as none, safe, balanced, or aggressive.</td>
-</tr>
-<tr>
-<td>Power saving</td>
-<td>This lets you enable or disable some power saving options for the games. Power saving options are some features that the emulator uses to reduce the battery consumption of your device, such as lowering the brightness, sound, or resolution of the games. However, they can also affect the quality and performance of the games. You can choose from several presets, such as none, low, medium, or high.</td>
-</tr>
-</table>
- <h2>Conclusion</h2>
-<p>Emulator Black PS2 Android is a fantastic PS2 emulator that can let you play your favorite PS2 games on your Android device with ease and enjoyment. It has many features and settings that you can customize and optimize to suit your preferences and needs. It also has a high compatibility rate and a supportive community that can help you with any issues or questions. If you are looking for a way to relive your PS2 memories or discover new PS2 gems on your Android device, you should definitely give Emulator Black PS2 Android a try!</p>
- <h3>Frequently Asked Questions</h3>
-<p>Here are some of the frequently asked questions about Emulator Black PS2 Android:</p>
-<ol>
-<li><b>Is Emulator Black PS2 Android free?</b></li>
-<p>Yes, Emulator Black PS2 Android is completely free to download and use. It does not have any ads or in-app purchases. However, if you want to support the developer and the project, you can donate via PayPal or Patreon.</p>
- <li><b>Is Emulator Black PS2 Android legal?</b></li>
-<p>Yes, Emulator Black PS2 Android is legal as long as you use it with your own legally obtained PS2 game files. You should not download or share any pirated or illegal PS2 game files.</p>
- <li><b>Is Emulator Black PS2 Android safe?</b></li>
-<p>Yes, Emulator Black PS2 Android is safe as long as you download it from its official website or the Google Play Store. It does not contain any malware or viruses that can harm your device or data.</p>
- <li><b>What are the minimum requirements for Emulator Black PS2 Android?</b></li>
-<p>The minimum requirements for Emulator Black PS2 Android are:</p>
-<ul>
-<li>An Android device running Android 7.0 or higher.</li>
-<li>A Snapdragon 845-level processor or better, with four large CPU cores (Cortex-A75 or higher) and an Adreno GPU.</li>
-<li>At least 4 GB of RAM.</li>
-<li>At least 10 GB of free storage space.</li>
-<li>A stable internet connection.</li>
-</ul>
- <li><b>Where can I get more information and help about Emulator Black PS2 Android?</b></li>
-<p>You can get more information and help about Emulator Black PS2 Android by visiting its official website at <a href="">https://emulatorblackps2android.com</a>, where you can find FAQs, tutorials, guides, forums, blogs, social media links, contact details, and more.</p>
- </ol>
- <p <p>I hope you enjoyed this article and learned something new about Emulator Black PS2 Android. If you have any feedback or suggestions, please let me know in the comments section below. Thank you for reading and happy gaming!</p> 197e85843d<br />
-<br />
-<br />

spaces/1phancelerku/anime-remove-background/Enjoy the Smooth and Comprehensive Gameplay of Battle Royale 3D - Warrior63 with Mod APK.md

@@ -1,98 +0,0 @@
-
-<h1>Battle Royale 3D - Warrior63 Mod APK Download: A Guide for Android Users</h1>
- <p>If you are a fan of survival shooting games, you might want to try Battle Royale 3D - Warrior63, a popular mobile game that challenges you to be the last man standing in a fierce combat. In this article, we will tell you everything you need to know about this game, and how to download and install the mod apk version for free. Read on to find out more!</p>
- <h2>What is Battle Royale 3D - Warrior63?</h2>
- <p>Battle Royale 3D - Warrior63 is a game developed by LQ-GAME, a Chinese studio that specializes in creating action-packed games for Android devices. The game was released in 2020 and has since gained millions of downloads and positive reviews from players around the world.</p>
-<h2>battle royale 3d warrior 63 mod apk download</h2><br /><p><b><b>Download</b> &#9734;&#9734;&#9734;&#9734;&#9734; <a href="https://jinyurl.com/2uNQig">https://jinyurl.com/2uNQig</a></b></p><br /><br />
- <p>The game is inspired by the popular genre of battle royale, where you have to compete with other players in a shrinking map and eliminate them until you are the only survivor. The game features a mega battle map in 4km x 4km, with various terrains such as land, sea, mountains, and buildings. You can also use vehicles and weapons to enhance your mobility and firepower.</p>
- <h3>Features of the game</h3>
- <p>Some of the features that make Battle Royale 3D - Warrior63 stand out from other similar games are:</p>
- <ul>
-<li>A variety of weapons, such as pistols, rifles, submachine guns, sniper guns, grenades, and more.</li>
-<li>A new weapon control system that makes shooting more smooth and stable.</li>
-<li>A new custom key mapping that allows you to personalize your controls for a better gaming experience.</li>
-<li>A new player level system that rewards you with coins and diamonds as you progress.</li>
-<li>Three different game modes: Death Battle, Team Battle, and Training Challenge.</li>
-<li>Optimized enemy direction tips and network stability.</li>
-<li>A fix for a weapon picking bug.</li>
-</ul>
- <h3>How to play the game</h3>
- <p>The gameplay of Battle Royale 3D - Warrior63 is simple and straightforward. You start by choosing a game mode and entering a match with other players. You can either play solo or team up with your friends. Then, you parachute onto the map and search for weapons and resources. You have to be quick and careful, as the map will shrink over time and force you to move closer to your enemies. You also have to avoid the poison circle and enemy attacks, while looking for opportunities to defeat them. The last player or team alive wins the match.</p>
- <h2>Why download the mod apk version?</h2>
- <p>While Battle Royale 3D - Warrior63 is free to play, it also contains some in-app purchases that require real money. These include coins and diamonds that can be used to buy new weapons, skins, vehicles, and other items. If you want to enjoy the game without spending any money, you might want to download the mod apk version instead.</p>
- <h3>Benefits of the mod apk</h3>
- <p>The mod apk version of Battle Royale 3D - Warrior63 is a modified version that gives you some advantages over the original version. Some of the benefits of the mod apk are:</p>
- <ul>
-<li>Unlimited coins and diamonds that can be used to buy anything you want in the game.</li>
-<li>Optimized graphics and performance that make the game run faster and smoother on your device.</li>
-<li>Weak enemy mode that makes your opponents easier to kill.</li>
-</ul>
- <h3>How to download and install the mod apk</h3>
- <p>To download and install the mod apk version of Battle Royale 3D - Warrior63, you need to follow these steps:</p>
- <ol>
-<li>Go to a trusted website that provides the mod apk file for Battle Royale 3D - Warrior63. You can search for it on Google or use this link: .</li>
-<li>Download the mod apk file to your device. Make sure you have enough storage space and a stable internet connection.</li>
-<li>Enable the installation of apps from unknown sources on your device. You can do this by going to Settings > Security > Unknown Sources and toggling it on.</li>
-<li>Locate the mod apk file on your device and tap on it to start the installation process. Follow the instructions on the screen and wait for it to finish.</li>
-<li>Launch the game and enjoy the mod features.</li>
-</ol>
- <h2>Tips and tricks for playing Battle Royale 3D - Warrior63</h2>
- <p>Now that you have downloaded and installed the mod apk version of Battle Royale 3D - Warrior63, you might want to know some tips and tricks that can help you improve your skills and win more matches. Here are some of them:</p>
-<p>battle royale 3d warrior 63 mod apk free download<br />
-download battle royale 3d warrior 63 mod apk latest version<br />
-battle royale 3d warrior 63 mod apk unlimited money<br />
-how to install battle royale 3d warrior 63 mod apk<br />
-battle royale 3d warrior 63 mod apk android<br />
-battle royale 3d warrior 63 mod apk happymod<br />
-battle royale 3d warrior 63 mod apk offline<br />
-battle royale 3d warrior 63 mod apk no root<br />
-battle royale 3d warrior 63 mod apk online<br />
-battle royale 3d warrior 63 mod apk obb<br />
-battle royale 3d warrior 63 mod apk revdl<br />
-battle royale 3d warrior 63 mod apk rexdl<br />
-battle royale 3d warrior 63 mod apk update<br />
-battle royale 3d warrior 63 mod apk hack<br />
-battle royale 3d warrior 63 mod apk cheat<br />
-battle royale 3d warrior 63 mod apk gameplay<br />
-battle royale 3d warrior 63 mod apk review<br />
-battle royale 3d warrior 63 mod apk features<br />
-battle royale 3d warrior 63 mod apk tips and tricks<br />
-battle royale 3d warrior 63 mod apk guide<br />
-battle royale 3d warrior 63 mod apk best weapons<br />
-battle royale 3d warrior 63 mod apk new map<br />
-battle royale 3d warrior 63 mod apk custom key mapping<br />
-battle royale 3d warrior 63 mod apk weak enemy<br />
-battle royale 3d warrior 63 mod apk optimized<br />
-battle royale 3d warrior 63 mod apk net energy gain<br />
-battle royale 3d warrior 63 mod apk death battle mode<br />
-battle royale 3d warrior 63 mod apk team battle mode<br />
-battle royale 3d warrior 63 mod apk training challenge mode<br />
-battle royale 3d warrior 63 mod apk player level system<br />
-battle royale 3d warrior 63 mod apk windows crossover<br />
-battle royale 3d warrior 63 mod apk vehicle control mode<br />
-download game battle royale 3d warrior 63 mod apk for android<br />
-download game battle royale 3d warrior mega map for android free with unlimited money and weak enemy hack cheat offline online latest version obb rexdl revdl happymod net energy gain vehicle control mode windows crossover player level system death team training challenge modes custom key mapping optimized features tips and tricks guide best weapons new map review gameplay no root install unlimited money and weak enemy hack cheat offline online latest version obb rexdl revdl happymod net energy gain vehicle control mode windows crossover player level system death team training challenge modes custom key mapping optimized features tips and tricks guide best weapons new map review gameplay no root install</p>
- <h3>Customize your controls</h3>
- <p>One of the best features of Battle Royale 3D - Warrior63 is that it allows you to customize your controls according to your preference. You can access the custom key mapping by tapping on the gear icon on the top right corner of the screen and then selecting Control. You can adjust the size, position, and transparency of the buttons, as well as switch between different control modes. You can also save different control schemes for different game modes. Experiment with different settings until you find the one that suits you best.</p>
- <h3>Use vehicles and weapons wisely</h3>
- <p>Vehicles and weapons are essential tools for survival in Battle Royale 3D - Warrior63. You can find them scattered around the map, or buy them with coins and diamonds in the shop. Vehicles can help you move faster and escape from danger, but they also make you more visible and vulnerable to enemy fire. Weapons can help you eliminate your enemies, but they also have different characteristics such as range, accuracy, recoil, and ammo capacity. You should always choose the vehicle and weapon that match your play style and situation. For example, if you want to snipe from a distance, you should use a sniper rifle and a motorcycle. If you want to rush into close combat, you should use a submachine gun and a car.</p>
- <h3>Avoid the poison circle and enemy attacks</h3>
- <p>The poison circle is a deadly mechanic that forces you to move closer to your enemies as the match progresses. It appears as a blue circle on the map that shrinks over time. If you are outside of it, you will lose health gradually until you die. You should always pay attention to the poison circle and plan your movements accordingly. You should also avoid staying in one place for too long, as you might attract enemy attention and get ambushed. You should always be alert and aware of your surroundings, and use cover and camouflage to hide from enemy sight.</p>
- <h2>Conclusion</h2>
- <p>Battle Royale 3D - Warrior63 is a fun and exciting game that will test your survival skills and reflexes in a realistic 3D environment. You can download the mod apk version of the game for free and enjoy unlimited coins, diamonds, weak enemies, and more. You can also follow our tips and tricks to improve your gameplay and win more matches. Download Battle Royale 3D - Warrior63 mod apk now and join the ultimate battle royale!</p>
- <h2>FAQs</h2>
- <p>Here are some frequently asked questions about Battle Royale 3D - Warrior63 mod apk:</p>
- <ul>
-<li><b>Is Battle Royale 3D - Warrior63 mod apk safe to download?</b><br>
-Yes, Battle Royale 3D - Warrior63 mod apk is safe to download as long as you use a trusted website that provides the file. You should also scan the file with an antivirus program before installing it.</li>
-<li><b>Do I need to root my device to use Battle Royale 3D - Warrior63 mod apk?</b><br>
-No, you do not need to root your device to use Battle Royale 3D - Warrior63 mod apk. You just need to enable the installation of apps from unknown sources on your device.</li>
-<li><b>Will I get banned for using Battle Royale 3D - Warrior63 mod apk?</b><br>
-There is a low risk of getting banned for using Battle Royale 3D - Warrior63 mod apk, as the game does not have a strict anti-cheat system. However, you should still be careful and avoid using obvious cheats such as flying or teleporting.</li>
-<li><b>Can I play Battle Royale 3D - Warrior63 mod apk with my friends?</b>< br>
-Yes, you can play Battle Royale 3D - Warrior63 mod apk with your friends. You can either join a team battle mode or create a private room and invite your friends to join. You can also chat with your teammates and coordinate your strategies.</li>
-<li><b>How can I update Battle Royale 3D - Warrior63 mod apk?</b><br>
-To update Battle Royale 3D - Warrior63 mod apk, you need to download the latest version of the mod apk file from the same website that you used before. Then, you need to uninstall the old version of the game and install the new one. You should also backup your game data before updating to avoid losing your progress.</li>
-</ul></p> 197e85843d<br />
-<br />
-<br />

spaces/1toTree/lora_test/README.md

@@ -1,12 +0,0 @@
----
-title: LoRa ppdiffusers dreambooth
-emoji: 🎨🎞️
-colorFrom: pink
-colorTo: purple
-sdk: gradio
-sdk_version: 3.18.0
-app_file: app.py
-pinned: false
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference

spaces/AI-ANK/PaLM-Kosmos-Vision/README.md

@@ -1,13 +0,0 @@
----
-title: PaLM Kosmos Vision
-emoji: 🚀
-colorFrom: blue
-colorTo: gray
-sdk: streamlit
-sdk_version: 1.28.1
-app_file: app.py
-pinned: false
-license: mit
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference

spaces/AIGC-Audio/AudioGPT/NeuralSeq/vocoders/base_vocoder.py

@@ -1,39 +0,0 @@
-import importlib
-VOCODERS = {}
-
-
-def register_vocoder(cls):
-    VOCODERS[cls.__name__.lower()] = cls
-    VOCODERS[cls.__name__] = cls
-    return cls
-
-
-def get_vocoder_cls(hparams):
-    if hparams['vocoder'] in VOCODERS:
-        return VOCODERS[hparams['vocoder']]
-    else:
-        vocoder_cls = hparams['vocoder']
-        pkg = ".".join(vocoder_cls.split(".")[:-1])
-        cls_name = vocoder_cls.split(".")[-1]
-        vocoder_cls = getattr(importlib.import_module(pkg), cls_name)
-        return vocoder_cls
-
-
-class BaseVocoder:
-    def spec2wav(self, mel):
-        """
-
-        :param mel: [T, 80]
-        :return: wav: [T']
-        """
-
-        raise NotImplementedError
-
-    @staticmethod
-    def wav2spec(wav_fn):
-        """
-
-        :param wav_fn: str
-        :return: wav, mel: [T, 80]
-        """
-        raise NotImplementedError

spaces/AILab-CVC/SEED-LLaMA/start.sh

@@ -1,11 +0,0 @@
-
-nohup python3 gradio_demo/seed_llama_flask.py \
-    --image_transform configs/transform/clip_transform.yaml \
-    --tokenizer configs/tokenizer/seed_llama_tokenizer_hf.yaml \
-    --model configs/llm/seed_llama_14b_8bit.yaml \
-    --port 7890 \
-    --llm_device cuda:0 \
-    --tokenizer_device cuda:0 \
-    --offload_encoder >./output.out &
-
-python3 gradio_demo/seed_llama_gradio.py --server_port 7860 --request_address http://127.0.0.1:7890/generate --model_type seed-llama-14b

spaces/Abrish-Aadi/Chest-Xray-anomaly-detection/README.md

@@ -1,13 +0,0 @@
----
-title: Chest Xray Anomaly Detection
-emoji: 🌖
-colorFrom: purple
-colorTo: indigo
-sdk: gradio
-sdk_version: 3.23.0
-app_file: app.py
-pinned: false
-license: apache-2.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference

spaces/AchyuthGamer/MagicPrompt-Stable-Diffusion/README.md

@@ -1,14 +0,0 @@
----
-title: MagicPrompt Stable Diffusion
-emoji: 🍄
-colorFrom: red
-colorTo: indigo
-sdk: gradio
-sdk_version: 3.3.1
-app_file: app.py
-pinned: false
-license: mit
-duplicated_from: Gustavosta/MagicPrompt-Stable-Diffusion
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference

spaces/Adapter/T2I-Adapter/test_adapter.py

@@ -1,80 +0,0 @@
-import os
-
-import cv2
-import torch
-from basicsr.utils import tensor2img
-from pytorch_lightning import seed_everything
-from torch import autocast
-
-from ldm.inference_base import (diffusion_inference, get_adapters, get_base_argument_parser, get_sd_models)
-from ldm.modules.extra_condition import api
-from ldm.modules.extra_condition.api import (ExtraCondition, get_adapter_feature, get_cond_model)
-
-torch.set_grad_enabled(False)
-
-
-def main():
-    supported_cond = [e.name for e in ExtraCondition]
-    parser = get_base_argument_parser()
-    parser.add_argument(
-        '--which_cond',
-        type=str,
-        required=True,
-        choices=supported_cond,
-        help='which condition modality you want to test',
-    )
-    opt = parser.parse_args()
-    which_cond = opt.which_cond
-    if opt.outdir is None:
-        opt.outdir = f'outputs/test-{which_cond}'
-    os.makedirs(opt.outdir, exist_ok=True)
-    if opt.resize_short_edge is None:
-        print(f"you don't specify the resize_shot_edge, so the maximum resolution is set to {opt.max_resolution}")
-    opt.device = torch.device("cuda") if torch.cuda.is_available() else torch.device("cpu")
-
-    # support two test mode: single image test, and batch test (through a txt file)
-    if opt.prompt.endswith('.txt'):
-        assert opt.prompt.endswith('.txt')
-        image_paths = []
-        prompts = []
-        with open(opt.prompt, 'r') as f:
-            lines = f.readlines()
-            for line in lines:
-                line = line.strip()
-                image_paths.append(line.split('; ')[0])
-                prompts.append(line.split('; ')[1])
-    else:
-        image_paths = [opt.cond_path]
-        prompts = [opt.prompt]
-    print(image_paths)
-
-    # prepare models
-    sd_model, sampler = get_sd_models(opt)
-    adapter = get_adapters(opt, getattr(ExtraCondition, which_cond))
-    cond_model = None
-    if opt.cond_inp_type == 'image':
-        cond_model = get_cond_model(opt, getattr(ExtraCondition, which_cond))
-
-    process_cond_module = getattr(api, f'get_cond_{which_cond}')
-
-    # inference
-    with torch.inference_mode(), \
-            sd_model.ema_scope(), \
-            autocast('cuda'):
-        for test_idx, (cond_path, prompt) in enumerate(zip(image_paths, prompts)):
-            seed_everything(opt.seed)
-            for v_idx in range(opt.n_samples):
-                # seed_everything(opt.seed+v_idx+test_idx)
-                cond = process_cond_module(opt, cond_path, opt.cond_inp_type, cond_model)
-
-                base_count = len(os.listdir(opt.outdir)) // 2
-                cv2.imwrite(os.path.join(opt.outdir, f'{base_count:05}_{which_cond}.png'), tensor2img(cond))
-
-                adapter_features, append_to_context = get_adapter_feature(cond, adapter)
-                opt.prompt = prompt
-                result = diffusion_inference(opt, sd_model, sampler, adapter_features, append_to_context)
-                cv2.imwrite(os.path.join(opt.outdir, f'{base_count:05}_result.png'), tensor2img(result))
-
-
-if __name__ == '__main__':
-    main()

spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/plugins/shockwavepipeline-plugin.js

@@ -1,14 +0,0 @@
-import ShockwavePostFxPipeline from './shockwavepipeline.js';
-import BasePostFxPipelinePlugin from './utils/renderer/postfxpipeline/BasePostFxPipelinePlugin.js';
-import SetValue from './utils/object/SetValue.js';
-
-class ShockwavePipelinePlugin extends BasePostFxPipelinePlugin {
-    constructor(pluginManager) {
-        super(pluginManager);
-        this.setPostPipelineClass(ShockwavePostFxPipeline, 'rexShockwavePostFx');
-    }
-}
-
-SetValue(window, 'RexPlugins.Pipelines.ShockwavePostFx', ShockwavePostFxPipeline);
-
-export default ShockwavePipelinePlugin;

spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/maker/builders/utils/SetTextureProperties.js

@@ -1,22 +0,0 @@
-const ProperiteList = ['tint', 'alpha', 'visible', 'flipX', 'flipY'];
-
-var SetTextureProperties = function (gameObject, data) {
-    for (var i = 0, cnt = ProperiteList.length; i < cnt; i++) {
-        var key = ProperiteList[i];
-        var value = data[key];
-        if (value !== undefined) {
-            gameObject[key] = value;
-        }
-    }
-
-    if (data.cropResize && !gameObject.resize) {
-        gameObject.resize = function (width, height) {
-            gameObject.setCrop(0, 0, width, height);
-            return gameObject;
-        }
-    }
-
-    return gameObject;
-}
-
-export default SetTextureProperties;

spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/templates/ui/pages/methods/HasPage.js

@@ -1,5 +0,0 @@
-var HasPage = function (key) {
-    return this.sizerChildren.hasOwnProperty(key);
-}
-
-export default HasPage;

spaces/AlekseyKorshuk/accompaniment-generator/app.py

@@ -1,108 +0,0 @@
-import streamlit as st
-import numpy as np
-import pretty_midi
-from accompaniment_generator.generator.base import Generator
-import os
-import uuid
-import time
-from midi2audio import FluidSynth
-from scipy.io import wavfile
-
-ABOUT_TEXT = "🤗 Accompaniment Generator - generate accompaniment part with chord using Evolutionary algorithm."
-CONTACT_TEXT = """
-_Built by Aleksey Korshuk with love_ ❤️ 
-[![Follow](https://img.shields.io/github/followers/AlekseyKorshuk?style=social)](https://github.com/AlekseyKorshuk)
-
-[![Follow](https://img.shields.io/twitter/follow/alekseykorshuk?style=social)](https://twitter.com/intent/follow?screen_name=alekseykorshuk)
-
-Star project repository:
-[![GitHub stars](https://img.shields.io/github/stars/AlekseyKorshuk/accompaniment-generator?style=social)](https://github.com/AlekseyKorshuk/accompaniment-generator)
-"""
-st.sidebar.markdown(
-    """
-<style>
-.aligncenter {
-    text-align: center;
-}
-</style>
-<p class="aligncenter">
-    <img src="https://seeklogo.com/images/A/apple-music-logo-4FBA5FADCC-seeklogo.com.png" width="220" />
-</p>
-""",
-    unsafe_allow_html=True,
-)
-
-st.sidebar.markdown(ABOUT_TEXT)
-st.sidebar.markdown(CONTACT_TEXT)
-
-
-def inference(audio, num_epoch, chord_duration):
-    generator = Generator()
-    if chord_duration == 0.0:
-        chord_duration = None
-    output_midi_data = generator(audio, num_epoch=int(num_epoch), chord_duration=chord_duration)[0]
-    name = uuid.uuid4()
-    output_midi_data.write(f'{name}.mid')
-    fs = FluidSynth("font.sf2")
-    fs.midi_to_audio(f'{name}.mid', f'{name}.wav')
-    fs.midi_to_audio(audio, f'{name}-init.wav')
-    # time.sleep(2)
-    print([f'{name}-init.wav', f'{name}.wav'])
-    return f'{name}-init.wav', f'{name}.wav'
-
-
-st.title("Accompaniment Generator")
-
-st.markdown(
-    "App to generate accompaniment for MIDI music file with Evolutionary algorithm. Check out [project repository](https://github.com/AlekseyKorshuk/accompaniment-generator).")
-
-article = "<p style='text-align: center'>" \
-          "<a href='https://github.com/AlekseyKorshuk/accompaniment-generator' target='_blank'>Github Repo</a>" \
-          "</p>"
-
-from os import listdir
-from os.path import isfile, join
-
-onlyfiles = [f for f in listdir("./examples") if isfile(join("./examples", f))]
-
-model_name = st.selectbox(
-    'Select example MIDI file (will be used only for empty file field):',
-    onlyfiles
-)
-
-uploaded_file = st.file_uploader(
-    'Upload MIDI file:'
-)
-
-num_epoch = st.number_input("Number of epochs:",
-                            min_value=1,
-                            max_value=1000,
-                            step=1,
-                            value=1,
-                            )
-
-chord_duration = st.number_input("Custom chord duration is seconds (leave zero for auto-calculation):",
-                                 min_value=0.0,
-                                 max_value=1000.0,
-                                 step=0.0001,
-                                 value=0.0,
-                                 format="%.4f"
-                                 )
-
-generate_image_button = st.button("Generate")
-
-if generate_image_button:
-    input_file = f"./examples/{model_name}"
-    if uploaded_file is not None:
-        input_file = uploaded_file.name
-        with open(input_file, 'wb') as f:
-            f.write(uploaded_file.getvalue())
-    # print(uploaded_file.getvalue())
-    with st.spinner(text=f"Generating, this may take some time..."):
-        before, after = inference(input_file, num_epoch, chord_duration)
-    st.markdown("Before:")
-    st.audio(before)
-    st.markdown("After:")
-    st.audio(after)
-    if uploaded_file is not None:
-        os.remove(input_file)

spaces/Alichuan/VITS-Umamusume-voice-synthesizer/mel_processing.py

@@ -1,101 +0,0 @@
-import torch
-import torch.utils.data
-from librosa.filters import mel as librosa_mel_fn
-
-MAX_WAV_VALUE = 32768.0
-
-
-def dynamic_range_compression_torch(x, C=1, clip_val=1e-5):
-    """
-    PARAMS
-    ------
-    C: compression factor
-    """
-    return torch.log(torch.clamp(x, min=clip_val) * C)
-
-
-def dynamic_range_decompression_torch(x, C=1):
-    """
-    PARAMS
-    ------
-    C: compression factor used to compress
-    """
-    return torch.exp(x) / C
-
-
-def spectral_normalize_torch(magnitudes):
-    output = dynamic_range_compression_torch(magnitudes)
-    return output
-
-
-def spectral_de_normalize_torch(magnitudes):
-    output = dynamic_range_decompression_torch(magnitudes)
-    return output
-
-
-mel_basis = {}
-hann_window = {}
-
-
-def spectrogram_torch(y, n_fft, sampling_rate, hop_size, win_size, center=False):
-    if torch.min(y) < -1.:
-        print('min value is ', torch.min(y))
-    if torch.max(y) > 1.:
-        print('max value is ', torch.max(y))
-
-    global hann_window
-    dtype_device = str(y.dtype) + '_' + str(y.device)
-    wnsize_dtype_device = str(win_size) + '_' + dtype_device
-    if wnsize_dtype_device not in hann_window:
-        hann_window[wnsize_dtype_device] = torch.hann_window(win_size).to(dtype=y.dtype, device=y.device)
-
-    y = torch.nn.functional.pad(y.unsqueeze(1), (int((n_fft-hop_size)/2), int((n_fft-hop_size)/2)), mode='reflect')
-    y = y.squeeze(1)
-
-    spec = torch.stft(y, n_fft, hop_length=hop_size, win_length=win_size, window=hann_window[wnsize_dtype_device],
-                      center=center, pad_mode='reflect', normalized=False, onesided=True, return_complex=False)
-
-    spec = torch.sqrt(spec.pow(2).sum(-1) + 1e-6)
-    return spec
-
-
-def spec_to_mel_torch(spec, n_fft, num_mels, sampling_rate, fmin, fmax):
-    global mel_basis
-    dtype_device = str(spec.dtype) + '_' + str(spec.device)
-    fmax_dtype_device = str(fmax) + '_' + dtype_device
-    if fmax_dtype_device not in mel_basis:
-        mel = librosa_mel_fn(sampling_rate, n_fft, num_mels, fmin, fmax)
-        mel_basis[fmax_dtype_device] = torch.from_numpy(mel).to(dtype=spec.dtype, device=spec.device)
-    spec = torch.matmul(mel_basis[fmax_dtype_device], spec)
-    spec = spectral_normalize_torch(spec)
-    return spec
-
-
-def mel_spectrogram_torch(y, n_fft, num_mels, sampling_rate, hop_size, win_size, fmin, fmax, center=False):
-    if torch.min(y) < -1.:
-        print('min value is ', torch.min(y))
-    if torch.max(y) > 1.:
-        print('max value is ', torch.max(y))
-
-    global mel_basis, hann_window
-    dtype_device = str(y.dtype) + '_' + str(y.device)
-    fmax_dtype_device = str(fmax) + '_' + dtype_device
-    wnsize_dtype_device = str(win_size) + '_' + dtype_device
-    if fmax_dtype_device not in mel_basis:
-        mel = librosa_mel_fn(sampling_rate, n_fft, num_mels, fmin, fmax)
-        mel_basis[fmax_dtype_device] = torch.from_numpy(mel).to(dtype=y.dtype, device=y.device)
-    if wnsize_dtype_device not in hann_window:
-        hann_window[wnsize_dtype_device] = torch.hann_window(win_size).to(dtype=y.dtype, device=y.device)
-
-    y = torch.nn.functional.pad(y.unsqueeze(1), (int((n_fft-hop_size)/2), int((n_fft-hop_size)/2)), mode='reflect')
-    y = y.squeeze(1)
-
-    spec = torch.stft(y, n_fft, hop_length=hop_size, win_length=win_size, window=hann_window[wnsize_dtype_device],
-                      center=center, pad_mode='reflect', normalized=False, onesided=True)
-
-    spec = torch.sqrt(spec.pow(2).sum(-1) + 1e-6)
-
-    spec = torch.matmul(mel_basis[fmax_dtype_device], spec)
-    spec = spectral_normalize_torch(spec)
-
-    return spec

spaces/Androidonnxfork/CivitAi-to-Diffusers/diffusers/examples/community/multilingual_stable_diffusion.py

@@ -1,436 +0,0 @@
-import inspect
-from typing import Callable, List, Optional, Union
-
-import torch
-from transformers import (
-    CLIPImageProcessor,
-    CLIPTextModel,
-    CLIPTokenizer,
-    MBart50TokenizerFast,
-    MBartForConditionalGeneration,
-    pipeline,
-)
-
-from diffusers import DiffusionPipeline
-from diffusers.configuration_utils import FrozenDict
-from diffusers.models import AutoencoderKL, UNet2DConditionModel
-from diffusers.pipelines.stable_diffusion import StableDiffusionPipelineOutput
-from diffusers.pipelines.stable_diffusion.safety_checker import StableDiffusionSafetyChecker
-from diffusers.schedulers import DDIMScheduler, LMSDiscreteScheduler, PNDMScheduler
-from diffusers.utils import deprecate, logging
-
-
-logger = logging.get_logger(__name__)  # pylint: disable=invalid-name
-
-
-def detect_language(pipe, prompt, batch_size):
-    """helper function to detect language(s) of prompt"""
-
-    if batch_size == 1:
-        preds = pipe(prompt, top_k=1, truncation=True, max_length=128)
-        return preds[0]["label"]
-    else:
-        detected_languages = []
-        for p in prompt:
-            preds = pipe(p, top_k=1, truncation=True, max_length=128)
-            detected_languages.append(preds[0]["label"])
-
-        return detected_languages
-
-
-def translate_prompt(prompt, translation_tokenizer, translation_model, device):
-    """helper function to translate prompt to English"""
-
-    encoded_prompt = translation_tokenizer(prompt, return_tensors="pt").to(device)
-    generated_tokens = translation_model.generate(**encoded_prompt, max_new_tokens=1000)
-    en_trans = translation_tokenizer.batch_decode(generated_tokens, skip_special_tokens=True)
-
-    return en_trans[0]
-
-
-class MultilingualStableDiffusion(DiffusionPipeline):
-    r"""
-    Pipeline for text-to-image generation using Stable Diffusion in different languages.
-
-    This model inherits from [`DiffusionPipeline`]. Check the superclass documentation for the generic methods the
-    library implements for all the pipelines (such as downloading or saving, running on a particular device, etc.)
-
-    Args:
-        detection_pipeline ([`pipeline`]):
-            Transformers pipeline to detect prompt's language.
-        translation_model ([`MBartForConditionalGeneration`]):
-            Model to translate prompt to English, if necessary. Please refer to the
-            [model card](https://huggingface.co/docs/transformers/model_doc/mbart) for details.
-        translation_tokenizer ([`MBart50TokenizerFast`]):
-            Tokenizer of the translation model.
-        vae ([`AutoencoderKL`]):
-            Variational Auto-Encoder (VAE) Model to encode and decode images to and from latent representations.
-        text_encoder ([`CLIPTextModel`]):
-            Frozen text-encoder. Stable Diffusion uses the text portion of
-            [CLIP](https://huggingface.co/docs/transformers/model_doc/clip#transformers.CLIPTextModel), specifically
-            the [clip-vit-large-patch14](https://huggingface.co/openai/clip-vit-large-patch14) variant.
-        tokenizer (`CLIPTokenizer`):
-            Tokenizer of class
-            [CLIPTokenizer](https://huggingface.co/docs/transformers/v4.21.0/en/model_doc/clip#transformers.CLIPTokenizer).
-        unet ([`UNet2DConditionModel`]): Conditional U-Net architecture to denoise the encoded image latents.
-        scheduler ([`SchedulerMixin`]):
-            A scheduler to be used in combination with `unet` to denoise the encoded image latens. Can be one of
-            [`DDIMScheduler`], [`LMSDiscreteScheduler`], or [`PNDMScheduler`].
-        safety_checker ([`StableDiffusionSafetyChecker`]):
-            Classification module that estimates whether generated images could be considered offensive or harmful.
-            Please, refer to the [model card](https://huggingface.co/runwayml/stable-diffusion-v1-5) for details.
-        feature_extractor ([`CLIPImageProcessor`]):
-            Model that extracts features from generated images to be used as inputs for the `safety_checker`.
-    """
-
-    def __init__(
-        self,
-        detection_pipeline: pipeline,
-        translation_model: MBartForConditionalGeneration,
-        translation_tokenizer: MBart50TokenizerFast,
-        vae: AutoencoderKL,
-        text_encoder: CLIPTextModel,
-        tokenizer: CLIPTokenizer,
-        unet: UNet2DConditionModel,
-        scheduler: Union[DDIMScheduler, PNDMScheduler, LMSDiscreteScheduler],
-        safety_checker: StableDiffusionSafetyChecker,
-        feature_extractor: CLIPImageProcessor,
-    ):
-        super().__init__()
-
-        if hasattr(scheduler.config, "steps_offset") and scheduler.config.steps_offset != 1:
-            deprecation_message = (
-                f"The configuration file of this scheduler: {scheduler} is outdated. `steps_offset`"
-                f" should be set to 1 instead of {scheduler.config.steps_offset}. Please make sure "
-                "to update the config accordingly as leaving `steps_offset` might led to incorrect results"
-                " in future versions. If you have downloaded this checkpoint from the Hugging Face Hub,"
-                " it would be very nice if you could open a Pull request for the `scheduler/scheduler_config.json`"
-                " file"
-            )
-            deprecate("steps_offset!=1", "1.0.0", deprecation_message, standard_warn=False)
-            new_config = dict(scheduler.config)
-            new_config["steps_offset"] = 1
-            scheduler._internal_dict = FrozenDict(new_config)
-
-        if safety_checker is None:
-            logger.warning(
-                f"You have disabled the safety checker for {self.__class__} by passing `safety_checker=None`. Ensure"
-                " that you abide to the conditions of the Stable Diffusion license and do not expose unfiltered"
-                " results in services or applications open to the public. Both the diffusers team and Hugging Face"
-                " strongly recommend to keep the safety filter enabled in all public facing circumstances, disabling"
-                " it only for use-cases that involve analyzing network behavior or auditing its results. For more"
-                " information, please have a look at https://github.com/huggingface/diffusers/pull/254 ."
-            )
-
-        self.register_modules(
-            detection_pipeline=detection_pipeline,
-            translation_model=translation_model,
-            translation_tokenizer=translation_tokenizer,
-            vae=vae,
-            text_encoder=text_encoder,
-            tokenizer=tokenizer,
-            unet=unet,
-            scheduler=scheduler,
-            safety_checker=safety_checker,
-            feature_extractor=feature_extractor,
-        )
-
-    def enable_attention_slicing(self, slice_size: Optional[Union[str, int]] = "auto"):
-        r"""
-        Enable sliced attention computation.
-
-        When this option is enabled, the attention module will split the input tensor in slices, to compute attention
-        in several steps. This is useful to save some memory in exchange for a small speed decrease.
-
-        Args:
-            slice_size (`str` or `int`, *optional*, defaults to `"auto"`):
-                When `"auto"`, halves the input to the attention heads, so attention will be computed in two steps. If
-                a number is provided, uses as many slices as `attention_head_dim // slice_size`. In this case,
-                `attention_head_dim` must be a multiple of `slice_size`.
-        """
-        if slice_size == "auto":
-            # half the attention head size is usually a good trade-off between
-            # speed and memory
-            slice_size = self.unet.config.attention_head_dim // 2
-        self.unet.set_attention_slice(slice_size)
-
-    def disable_attention_slicing(self):
-        r"""
-        Disable sliced attention computation. If `enable_attention_slicing` was previously invoked, this method will go
-        back to computing attention in one step.
-        """
-        # set slice_size = `None` to disable `attention slicing`
-        self.enable_attention_slicing(None)
-
-    @torch.no_grad()
-    def __call__(
-        self,
-        prompt: Union[str, List[str]],
-        height: int = 512,
-        width: int = 512,
-        num_inference_steps: int = 50,
-        guidance_scale: float = 7.5,
-        negative_prompt: Optional[Union[str, List[str]]] = None,
-        num_images_per_prompt: Optional[int] = 1,
-        eta: float = 0.0,
-        generator: Optional[torch.Generator] = None,
-        latents: Optional[torch.FloatTensor] = None,
-        output_type: Optional[str] = "pil",
-        return_dict: bool = True,
-        callback: Optional[Callable[[int, int, torch.FloatTensor], None]] = None,
-        callback_steps: int = 1,
-        **kwargs,
-    ):
-        r"""
-        Function invoked when calling the pipeline for generation.
-
-        Args:
-            prompt (`str` or `List[str]`):
-                The prompt or prompts to guide the image generation. Can be in different languages.
-            height (`int`, *optional*, defaults to 512):
-                The height in pixels of the generated image.
-            width (`int`, *optional*, defaults to 512):
-                The width in pixels of the generated image.
-            num_inference_steps (`int`, *optional*, defaults to 50):
-                The number of denoising steps. More denoising steps usually lead to a higher quality image at the
-                expense of slower inference.
-            guidance_scale (`float`, *optional*, defaults to 7.5):
-                Guidance scale as defined in [Classifier-Free Diffusion Guidance](https://arxiv.org/abs/2207.12598).
-                `guidance_scale` is defined as `w` of equation 2. of [Imagen
-                Paper](https://arxiv.org/pdf/2205.11487.pdf). Guidance scale is enabled by setting `guidance_scale >
-                1`. Higher guidance scale encourages to generate images that are closely linked to the text `prompt`,
-                usually at the expense of lower image quality.
-            negative_prompt (`str` or `List[str]`, *optional*):
-                The prompt or prompts not to guide the image generation. Ignored when not using guidance (i.e., ignored
-                if `guidance_scale` is less than `1`).
-            num_images_per_prompt (`int`, *optional*, defaults to 1):
-                The number of images to generate per prompt.
-            eta (`float`, *optional*, defaults to 0.0):
-                Corresponds to parameter eta (η) in the DDIM paper: https://arxiv.org/abs/2010.02502. Only applies to
-                [`schedulers.DDIMScheduler`], will be ignored for others.
-            generator (`torch.Generator`, *optional*):
-                A [torch generator](https://pytorch.org/docs/stable/generated/torch.Generator.html) to make generation
-                deterministic.
-            latents (`torch.FloatTensor`, *optional*):
-                Pre-generated noisy latents, sampled from a Gaussian distribution, to be used as inputs for image
-                generation. Can be used to tweak the same generation with different prompts. If not provided, a latents
-                tensor will ge generated by sampling using the supplied random `generator`.
-            output_type (`str`, *optional*, defaults to `"pil"`):
-                The output format of the generate image. Choose between
-                [PIL](https://pillow.readthedocs.io/en/stable/): `PIL.Image.Image` or `np.array`.
-            return_dict (`bool`, *optional*, defaults to `True`):
-                Whether or not to return a [`~pipelines.stable_diffusion.StableDiffusionPipelineOutput`] instead of a
-                plain tuple.
-            callback (`Callable`, *optional*):
-                A function that will be called every `callback_steps` steps during inference. The function will be
-                called with the following arguments: `callback(step: int, timestep: int, latents: torch.FloatTensor)`.
-            callback_steps (`int`, *optional*, defaults to 1):
-                The frequency at which the `callback` function will be called. If not specified, the callback will be
-                called at every step.
-
-        Returns:
-            [`~pipelines.stable_diffusion.StableDiffusionPipelineOutput`] or `tuple`:
-            [`~pipelines.stable_diffusion.StableDiffusionPipelineOutput`] if `return_dict` is True, otherwise a `tuple.
-            When returning a tuple, the first element is a list with the generated images, and the second element is a
-            list of `bool`s denoting whether the corresponding generated image likely represents "not-safe-for-work"
-            (nsfw) content, according to the `safety_checker`.
-        """
-        if isinstance(prompt, str):
-            batch_size = 1
-        elif isinstance(prompt, list):
-            batch_size = len(prompt)
-        else:
-            raise ValueError(f"`prompt` has to be of type `str` or `list` but is {type(prompt)}")
-
-        if height % 8 != 0 or width % 8 != 0:
-            raise ValueError(f"`height` and `width` have to be divisible by 8 but are {height} and {width}.")
-
-        if (callback_steps is None) or (
-            callback_steps is not None and (not isinstance(callback_steps, int) or callback_steps <= 0)
-        ):
-            raise ValueError(
-                f"`callback_steps` has to be a positive integer but is {callback_steps} of type"
-                f" {type(callback_steps)}."
-            )
-
-        # detect language and translate if necessary
-        prompt_language = detect_language(self.detection_pipeline, prompt, batch_size)
-        if batch_size == 1 and prompt_language != "en":
-            prompt = translate_prompt(prompt, self.translation_tokenizer, self.translation_model, self.device)
-
-        if isinstance(prompt, list):
-            for index in range(batch_size):
-                if prompt_language[index] != "en":
-                    p = translate_prompt(
-                        prompt[index], self.translation_tokenizer, self.translation_model, self.device
-                    )
-                    prompt[index] = p
-
-        # get prompt text embeddings
-        text_inputs = self.tokenizer(
-            prompt,
-            padding="max_length",
-            max_length=self.tokenizer.model_max_length,
-            return_tensors="pt",
-        )
-        text_input_ids = text_inputs.input_ids
-
-        if text_input_ids.shape[-1] > self.tokenizer.model_max_length:
-            removed_text = self.tokenizer.batch_decode(text_input_ids[:, self.tokenizer.model_max_length :])
-            logger.warning(
-                "The following part of your input was truncated because CLIP can only handle sequences up to"
-                f" {self.tokenizer.model_max_length} tokens: {removed_text}"
-            )
-            text_input_ids = text_input_ids[:, : self.tokenizer.model_max_length]
-        text_embeddings = self.text_encoder(text_input_ids.to(self.device))[0]
-
-        # duplicate text embeddings for each generation per prompt, using mps friendly method
-        bs_embed, seq_len, _ = text_embeddings.shape
-        text_embeddings = text_embeddings.repeat(1, num_images_per_prompt, 1)
-        text_embeddings = text_embeddings.view(bs_embed * num_images_per_prompt, seq_len, -1)
-
-        # here `guidance_scale` is defined analog to the guidance weight `w` of equation (2)
-        # of the Imagen paper: https://arxiv.org/pdf/2205.11487.pdf . `guidance_scale = 1`
-        # corresponds to doing no classifier free guidance.
-        do_classifier_free_guidance = guidance_scale > 1.0
-        # get unconditional embeddings for classifier free guidance
-        if do_classifier_free_guidance:
-            uncond_tokens: List[str]
-            if negative_prompt is None:
-                uncond_tokens = [""] * batch_size
-            elif type(prompt) is not type(negative_prompt):
-                raise TypeError(
-                    f"`negative_prompt` should be the same type to `prompt`, but got {type(negative_prompt)} !="
-                    f" {type(prompt)}."
-                )
-            elif isinstance(negative_prompt, str):
-                # detect language and translate it if necessary
-                negative_prompt_language = detect_language(self.detection_pipeline, negative_prompt, batch_size)
-                if negative_prompt_language != "en":
-                    negative_prompt = translate_prompt(
-                        negative_prompt, self.translation_tokenizer, self.translation_model, self.device
-                    )
-                if isinstance(negative_prompt, str):
-                    uncond_tokens = [negative_prompt]
-            elif batch_size != len(negative_prompt):
-                raise ValueError(
-                    f"`negative_prompt`: {negative_prompt} has batch size {len(negative_prompt)}, but `prompt`:"
-                    f" {prompt} has batch size {batch_size}. Please make sure that passed `negative_prompt` matches"
-                    " the batch size of `prompt`."
-                )
-            else:
-                # detect language and translate it if necessary
-                if isinstance(negative_prompt, list):
-                    negative_prompt_languages = detect_language(self.detection_pipeline, negative_prompt, batch_size)
-                    for index in range(batch_size):
-                        if negative_prompt_languages[index] != "en":
-                            p = translate_prompt(
-                                negative_prompt[index], self.translation_tokenizer, self.translation_model, self.device
-                            )
-                            negative_prompt[index] = p
-                uncond_tokens = negative_prompt
-
-            max_length = text_input_ids.shape[-1]
-            uncond_input = self.tokenizer(
-                uncond_tokens,
-                padding="max_length",
-                max_length=max_length,
-                truncation=True,
-                return_tensors="pt",
-            )
-            uncond_embeddings = self.text_encoder(uncond_input.input_ids.to(self.device))[0]
-
-            # duplicate unconditional embeddings for each generation per prompt, using mps friendly method
-            seq_len = uncond_embeddings.shape[1]
-            uncond_embeddings = uncond_embeddings.repeat(1, num_images_per_prompt, 1)
-            uncond_embeddings = uncond_embeddings.view(batch_size * num_images_per_prompt, seq_len, -1)
-
-            # For classifier free guidance, we need to do two forward passes.
-            # Here we concatenate the unconditional and text embeddings into a single batch
-            # to avoid doing two forward passes
-            text_embeddings = torch.cat([uncond_embeddings, text_embeddings])
-
-        # get the initial random noise unless the user supplied it
-
-        # Unlike in other pipelines, latents need to be generated in the target device
-        # for 1-to-1 results reproducibility with the CompVis implementation.
-        # However this currently doesn't work in `mps`.
-        latents_shape = (batch_size * num_images_per_prompt, self.unet.config.in_channels, height // 8, width // 8)
-        latents_dtype = text_embeddings.dtype
-        if latents is None:
-            if self.device.type == "mps":
-                # randn does not work reproducibly on mps
-                latents = torch.randn(latents_shape, generator=generator, device="cpu", dtype=latents_dtype).to(
-                    self.device
-                )
-            else:
-                latents = torch.randn(latents_shape, generator=generator, device=self.device, dtype=latents_dtype)
-        else:
-            if latents.shape != latents_shape:
-                raise ValueError(f"Unexpected latents shape, got {latents.shape}, expected {latents_shape}")
-            latents = latents.to(self.device)
-
-        # set timesteps
-        self.scheduler.set_timesteps(num_inference_steps)
-
-        # Some schedulers like PNDM have timesteps as arrays
-        # It's more optimized to move all timesteps to correct device beforehand
-        timesteps_tensor = self.scheduler.timesteps.to(self.device)
-
-        # scale the initial noise by the standard deviation required by the scheduler
-        latents = latents * self.scheduler.init_noise_sigma
-
-        # prepare extra kwargs for the scheduler step, since not all schedulers have the same signature
-        # eta (η) is only used with the DDIMScheduler, it will be ignored for other schedulers.
-        # eta corresponds to η in DDIM paper: https://arxiv.org/abs/2010.02502
-        # and should be between [0, 1]
-        accepts_eta = "eta" in set(inspect.signature(self.scheduler.step).parameters.keys())
-        extra_step_kwargs = {}
-        if accepts_eta:
-            extra_step_kwargs["eta"] = eta
-
-        for i, t in enumerate(self.progress_bar(timesteps_tensor)):
-            # expand the latents if we are doing classifier free guidance
-            latent_model_input = torch.cat([latents] * 2) if do_classifier_free_guidance else latents
-            latent_model_input = self.scheduler.scale_model_input(latent_model_input, t)
-
-            # predict the noise residual
-            noise_pred = self.unet(latent_model_input, t, encoder_hidden_states=text_embeddings).sample
-
-            # perform guidance
-            if do_classifier_free_guidance:
-                noise_pred_uncond, noise_pred_text = noise_pred.chunk(2)
-                noise_pred = noise_pred_uncond + guidance_scale * (noise_pred_text - noise_pred_uncond)
-
-            # compute the previous noisy sample x_t -> x_t-1
-            latents = self.scheduler.step(noise_pred, t, latents, **extra_step_kwargs).prev_sample
-
-            # call the callback, if provided
-            if callback is not None and i % callback_steps == 0:
-                callback(i, t, latents)
-
-        latents = 1 / 0.18215 * latents
-        image = self.vae.decode(latents).sample
-
-        image = (image / 2 + 0.5).clamp(0, 1)
-
-        # we always cast to float32 as this does not cause significant overhead and is compatible with bfloat16
-        image = image.cpu().permute(0, 2, 3, 1).float().numpy()
-
-        if self.safety_checker is not None:
-            safety_checker_input = self.feature_extractor(self.numpy_to_pil(image), return_tensors="pt").to(
-                self.device
-            )
-            image, has_nsfw_concept = self.safety_checker(
-                images=image, clip_input=safety_checker_input.pixel_values.to(text_embeddings.dtype)
-            )
-        else:
-            has_nsfw_concept = None
-
-        if output_type == "pil":
-            image = self.numpy_to_pil(image)
-
-        if not return_dict:
-            return (image, has_nsfw_concept)
-
-        return StableDiffusionPipelineOutput(images=image, nsfw_content_detected=has_nsfw_concept)

spaces/Androidonnxfork/CivitAi-to-Diffusers/diffusers/src/diffusers/commands/fp16_safetensors.py

@@ -1,138 +0,0 @@
-# Copyright 2023 The HuggingFace Team. All rights reserved.
-#
-# Licensed 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.
-
-"""
-Usage example:
-    diffusers-cli fp16_safetensors --ckpt_id=openai/shap-e --fp16 --use_safetensors
-"""
-
-import glob
-import json
-from argparse import ArgumentParser, Namespace
-from importlib import import_module
-
-import huggingface_hub
-import torch
-from huggingface_hub import hf_hub_download
-from packaging import version
-
-from ..utils import is_safetensors_available, logging
-from . import BaseDiffusersCLICommand
-
-
-def conversion_command_factory(args: Namespace):
-    return FP16SafetensorsCommand(
-        args.ckpt_id,
-        args.fp16,
-        args.use_safetensors,
-        args.use_auth_token,
-    )
-
-
-class FP16SafetensorsCommand(BaseDiffusersCLICommand):
-    @staticmethod
-    def register_subcommand(parser: ArgumentParser):
-        conversion_parser = parser.add_parser("fp16_safetensors")
-        conversion_parser.add_argument(
-            "--ckpt_id",
-            type=str,
-            help="Repo id of the checkpoints on which to run the conversion. Example: 'openai/shap-e'.",
-        )
-        conversion_parser.add_argument(
-            "--fp16", action="store_true", help="If serializing the variables in FP16 precision."
-        )
-        conversion_parser.add_argument(
-            "--use_safetensors", action="store_true", help="If serializing in the safetensors format."
-        )
-        conversion_parser.add_argument(
-            "--use_auth_token",
-            action="store_true",
-            help="When working with checkpoints having private visibility. When used `huggingface-cli login` needs to be run beforehand.",
-        )
-        conversion_parser.set_defaults(func=conversion_command_factory)
-
-    def __init__(self, ckpt_id: str, fp16: bool, use_safetensors: bool, use_auth_token: bool):
-        self.logger = logging.get_logger("diffusers-cli/fp16_safetensors")
-        self.ckpt_id = ckpt_id
-        self.local_ckpt_dir = f"/tmp/{ckpt_id}"
-        self.fp16 = fp16
-
-        if is_safetensors_available():
-            self.use_safetensors = use_safetensors
-        else:
-            raise ImportError(
-                "When `use_safetensors` is set to True, the `safetensors` library needs to be installed. Install it via `pip install safetensors`."
-            )
-
-        if not self.use_safetensors and not self.fp16:
-            raise NotImplementedError(
-                "When `use_safetensors` and `fp16` both are False, then this command is of no use."
-            )
-
-        self.use_auth_token = use_auth_token
-
-    def run(self):
-        if version.parse(huggingface_hub.__version__) < version.parse("0.9.0"):
-            raise ImportError(
-                "The huggingface_hub version must be >= 0.9.0 to use this command. Please update your huggingface_hub"
-                " installation."
-            )
-        else:
-            from huggingface_hub import create_commit
-            from huggingface_hub._commit_api import CommitOperationAdd
-
-        model_index = hf_hub_download(repo_id=self.ckpt_id, filename="model_index.json", token=self.use_auth_token)
-        with open(model_index, "r") as f:
-            pipeline_class_name = json.load(f)["_class_name"]
-        pipeline_class = getattr(import_module("diffusers"), pipeline_class_name)
-        self.logger.info(f"Pipeline class imported: {pipeline_class_name}.")
-
-        # Load the appropriate pipeline. We could have use `DiffusionPipeline`
-        # here, but just to avoid any rough edge cases.
-        pipeline = pipeline_class.from_pretrained(
-            self.ckpt_id, torch_dtype=torch.float16 if self.fp16 else torch.float32, use_auth_token=self.use_auth_token
-        )
-        pipeline.save_pretrained(
-            self.local_ckpt_dir,
-            safe_serialization=True if self.use_safetensors else False,
-            variant="fp16" if self.fp16 else None,
-        )
-        self.logger.info(f"Pipeline locally saved to {self.local_ckpt_dir}.")
-
-        # Fetch all the paths.
-        if self.fp16:
-            modified_paths = glob.glob(f"{self.local_ckpt_dir}/*/*.fp16.*")
-        elif self.use_safetensors:
-            modified_paths = glob.glob(f"{self.local_ckpt_dir}/*/*.safetensors")
-
-        # Prepare for the PR.
-        commit_message = f"Serialize variables with FP16: {self.fp16} and safetensors: {self.use_safetensors}."
-        operations = []
-        for path in modified_paths:
-            operations.append(CommitOperationAdd(path_in_repo="/".join(path.split("/")[4:]), path_or_fileobj=path))
-
-        # Open the PR.
-        commit_description = (
-            "Variables converted by the [`diffusers`' `fp16_safetensors`"
-            " CLI](https://github.com/huggingface/diffusers/blob/main/src/diffusers/commands/fp16_safetensors.py)."
-        )
-        hub_pr_url = create_commit(
-            repo_id=self.ckpt_id,
-            operations=operations,
-            commit_message=commit_message,
-            commit_description=commit_description,
-            repo_type="model",
-            create_pr=True,
-        ).pr_url
-        self.logger.info(f"PR created here: {hub_pr_url}.")

spaces/Andy1621/uniformer_image_detection/configs/hrnet/cascade_mask_rcnn_hrnetv2p_w40_20e_coco.py

@@ -1,11 +0,0 @@
-_base_ = './cascade_mask_rcnn_hrnetv2p_w32_20e_coco.py'
-# model settings
-model = dict(
-    pretrained='open-mmlab://msra/hrnetv2_w40',
-    backbone=dict(
-        type='HRNet',
-        extra=dict(
-            stage2=dict(num_channels=(40, 80)),
-            stage3=dict(num_channels=(40, 80, 160)),
-            stage4=dict(num_channels=(40, 80, 160, 320)))),
-    neck=dict(type='HRFPN', in_channels=[40, 80, 160, 320], out_channels=256))

spaces/Andy1621/uniformer_image_detection/configs/hrnet/mask_rcnn_hrnetv2p_w32_2x_coco.py

@@ -1,4 +0,0 @@
-_base_ = './mask_rcnn_hrnetv2p_w32_1x_coco.py'
-# learning policy
-lr_config = dict(step=[16, 22])
-runner = dict(type='EpochBasedRunner', max_epochs=24)

spaces/Andy1621/uniformer_image_detection/configs/mask_rcnn/mask_rcnn_x101_32x4d_fpn_1x_coco.py

@@ -1,13 +0,0 @@
-_base_ = './mask_rcnn_r101_fpn_1x_coco.py'
-model = dict(
-    pretrained='open-mmlab://resnext101_32x4d',
-    backbone=dict(
-        type='ResNeXt',
-        depth=101,
-        groups=32,
-        base_width=4,
-        num_stages=4,
-        out_indices=(0, 1, 2, 3),
-        frozen_stages=1,
-        norm_cfg=dict(type='BN', requires_grad=True),
-        style='pytorch'))

spaces/Andy1621/uniformer_image_detection/configs/retinanet/retinanet_r101_caffe_fpn_1x_coco.py

@@ -1,4 +0,0 @@
-_base_ = './retinanet_r50_caffe_fpn_1x_coco.py'
-model = dict(
-    pretrained='open-mmlab://detectron2/resnet101_caffe',
-    backbone=dict(depth=101))

spaces/Andy1621/uniformer_image_segmentation/configs/hrnet/fcn_hr18s_512x512_160k_ade20k.py

@@ -1,9 +0,0 @@
-_base_ = './fcn_hr18_512x512_160k_ade20k.py'
-model = dict(
-    pretrained='open-mmlab://msra/hrnetv2_w18_small',
-    backbone=dict(
-        extra=dict(
-            stage1=dict(num_blocks=(2, )),
-            stage2=dict(num_blocks=(2, 2)),
-            stage3=dict(num_modules=3, num_blocks=(2, 2, 2)),
-            stage4=dict(num_modules=2, num_blocks=(2, 2, 2, 2)))))

spaces/AnimalEquality/chatbot/nbs/styles.css

@@ -1,37 +0,0 @@
-.cell {
-  margin-bottom: 1rem;
-}
-
-.cell > .sourceCode {
-  margin-bottom: 0;
-}
-
-.cell-output > pre {
-  margin-bottom: 0;
-}
-
-.cell-output > pre, .cell-output > .sourceCode > pre, .cell-output-stdout > pre {
-  margin-left: 0.8rem;
-  margin-top: 0;
-  background: none;
-  border-left: 2px solid lightsalmon;
-  border-top-left-radius: 0;
-  border-top-right-radius: 0;
-}
-
-.cell-output > .sourceCode {
-  border: none;
-}
-
-.cell-output > .sourceCode {
-  background: none;
-  margin-top: 0;
-}
-
-div.description {
-  padding-left: 2px;
-  padding-top: 5px;
-  font-style: italic;
-  font-size: 135%;
-  opacity: 70%;
-}

spaces/Artrajz/vits-simple-api/bert_vits2/modules.py

@@ -1,459 +0,0 @@
-import copy
-import math
-import numpy as np
-import scipy
-import torch
-from torch import nn
-from torch.nn import functional as F
-
-from torch.nn import Conv1d, ConvTranspose1d, AvgPool1d, Conv2d
-from torch.nn.utils import weight_norm, remove_weight_norm
-
-from bert_vits2 import commons
-from bert_vits2.commons import init_weights, get_padding
-from bert_vits2.transforms import piecewise_rational_quadratic_transform
-from bert_vits2.attentions import Encoder
-
-LRELU_SLOPE = 0.1
-
-
-class LayerNorm(nn.Module):
-    def __init__(self, channels, eps=1e-5):
-        super().__init__()
-        self.channels = channels
-        self.eps = eps
-
-        self.gamma = nn.Parameter(torch.ones(channels))
-        self.beta = nn.Parameter(torch.zeros(channels))
-
-    def forward(self, x):
-        x = x.transpose(1, -1)
-        x = F.layer_norm(x, (self.channels,), self.gamma, self.beta, self.eps)
-        return x.transpose(1, -1)
-
-
-class ConvReluNorm(nn.Module):
-    def __init__(self, in_channels, hidden_channels, out_channels, kernel_size, n_layers, p_dropout):
-        super().__init__()
-        self.in_channels = in_channels
-        self.hidden_channels = hidden_channels
-        self.out_channels = out_channels
-        self.kernel_size = kernel_size
-        self.n_layers = n_layers
-        self.p_dropout = p_dropout
-        assert n_layers > 1, "Number of layers should be larger than 0."
-
-        self.conv_layers = nn.ModuleList()
-        self.norm_layers = nn.ModuleList()
-        self.conv_layers.append(nn.Conv1d(in_channels, hidden_channels, kernel_size, padding=kernel_size // 2))
-        self.norm_layers.append(LayerNorm(hidden_channels))
-        self.relu_drop = nn.Sequential(
-            nn.ReLU(),
-            nn.Dropout(p_dropout))
-        for _ in range(n_layers - 1):
-            self.conv_layers.append(nn.Conv1d(hidden_channels, hidden_channels, kernel_size, padding=kernel_size // 2))
-            self.norm_layers.append(LayerNorm(hidden_channels))
-        self.proj = nn.Conv1d(hidden_channels, out_channels, 1)
-        self.proj.weight.data.zero_()
-        self.proj.bias.data.zero_()
-
-    def forward(self, x, x_mask):
-        x_org = x
-        for i in range(self.n_layers):
-            x = self.conv_layers[i](x * x_mask)
-            x = self.norm_layers[i](x)
-            x = self.relu_drop(x)
-        x = x_org + self.proj(x)
-        return x * x_mask
-
-
-class DDSConv(nn.Module):
-    """
-    Dialted and Depth-Separable Convolution
-    """
-
-    def __init__(self, channels, kernel_size, n_layers, p_dropout=0.):
-        super().__init__()
-        self.channels = channels
-        self.kernel_size = kernel_size
-        self.n_layers = n_layers
-        self.p_dropout = p_dropout
-
-        self.drop = nn.Dropout(p_dropout)
-        self.convs_sep = nn.ModuleList()
-        self.convs_1x1 = nn.ModuleList()
-        self.norms_1 = nn.ModuleList()
-        self.norms_2 = nn.ModuleList()
-        for i in range(n_layers):
-            dilation = kernel_size ** i
-            padding = (kernel_size * dilation - dilation) // 2
-            self.convs_sep.append(nn.Conv1d(channels, channels, kernel_size,
-                                            groups=channels, dilation=dilation, padding=padding
-                                            ))
-            self.convs_1x1.append(nn.Conv1d(channels, channels, 1))
-            self.norms_1.append(LayerNorm(channels))
-            self.norms_2.append(LayerNorm(channels))
-
-    def forward(self, x, x_mask, g=None):
-        if g is not None:
-            x = x + g
-        for i in range(self.n_layers):
-            y = self.convs_sep[i](x * x_mask)
-            y = self.norms_1[i](y)
-            y = F.gelu(y)
-            y = self.convs_1x1[i](y)
-            y = self.norms_2[i](y)
-            y = F.gelu(y)
-            y = self.drop(y)
-            x = x + y
-        return x * x_mask
-
-
-class WN(torch.nn.Module):
-    def __init__(self, hidden_channels, kernel_size, dilation_rate, n_layers, gin_channels=0, p_dropout=0):
-        super(WN, self).__init__()
-        assert (kernel_size % 2 == 1)
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size,
-        self.dilation_rate = dilation_rate
-        self.n_layers = n_layers
-        self.gin_channels = gin_channels
-        self.p_dropout = p_dropout
-
-        self.in_layers = torch.nn.ModuleList()
-        self.res_skip_layers = torch.nn.ModuleList()
-        self.drop = nn.Dropout(p_dropout)
-
-        if gin_channels != 0:
-            cond_layer = torch.nn.Conv1d(gin_channels, 2 * hidden_channels * n_layers, 1)
-            self.cond_layer = torch.nn.utils.weight_norm(cond_layer, name='weight')
-
-        for i in range(n_layers):
-            dilation = dilation_rate ** i
-            padding = int((kernel_size * dilation - dilation) / 2)
-            in_layer = torch.nn.Conv1d(hidden_channels, 2 * hidden_channels, kernel_size,
-                                       dilation=dilation, padding=padding)
-            in_layer = torch.nn.utils.weight_norm(in_layer, name='weight')
-            self.in_layers.append(in_layer)
-
-            # last one is not necessary
-            if i < n_layers - 1:
-                res_skip_channels = 2 * hidden_channels
-            else:
-                res_skip_channels = hidden_channels
-
-            res_skip_layer = torch.nn.Conv1d(hidden_channels, res_skip_channels, 1)
-            res_skip_layer = torch.nn.utils.weight_norm(res_skip_layer, name='weight')
-            self.res_skip_layers.append(res_skip_layer)
-
-    def forward(self, x, x_mask, g=None, **kwargs):
-        output = torch.zeros_like(x)
-        n_channels_tensor = torch.IntTensor([self.hidden_channels])
-
-        if g is not None:
-            g = self.cond_layer(g)
-
-        for i in range(self.n_layers):
-            x_in = self.in_layers[i](x)
-            if g is not None:
-                cond_offset = i * 2 * self.hidden_channels
-                g_l = g[:, cond_offset:cond_offset + 2 * self.hidden_channels, :]
-            else:
-                g_l = torch.zeros_like(x_in)
-
-            acts = commons.fused_add_tanh_sigmoid_multiply(
-                x_in,
-                g_l,
-                n_channels_tensor)
-            acts = self.drop(acts)
-
-            res_skip_acts = self.res_skip_layers[i](acts)
-            if i < self.n_layers - 1:
-                res_acts = res_skip_acts[:, :self.hidden_channels, :]
-                x = (x + res_acts) * x_mask
-                output = output + res_skip_acts[:, self.hidden_channels:, :]
-            else:
-                output = output + res_skip_acts
-        return output * x_mask
-
-    def remove_weight_norm(self):
-        if self.gin_channels != 0:
-            torch.nn.utils.remove_weight_norm(self.cond_layer)
-        for l in self.in_layers:
-            torch.nn.utils.remove_weight_norm(l)
-        for l in self.res_skip_layers:
-            torch.nn.utils.remove_weight_norm(l)
-
-
-class ResBlock1(torch.nn.Module):
-    def __init__(self, channels, kernel_size=3, dilation=(1, 3, 5)):
-        super(ResBlock1, self).__init__()
-        self.convs1 = nn.ModuleList([
-            weight_norm(Conv1d(channels, channels, kernel_size, 1, dilation=dilation[0],
-                               padding=get_padding(kernel_size, dilation[0]))),
-            weight_norm(Conv1d(channels, channels, kernel_size, 1, dilation=dilation[1],
-                               padding=get_padding(kernel_size, dilation[1]))),
-            weight_norm(Conv1d(channels, channels, kernel_size, 1, dilation=dilation[2],
-                               padding=get_padding(kernel_size, dilation[2])))
-        ])
-        self.convs1.apply(init_weights)
-
-        self.convs2 = nn.ModuleList([
-            weight_norm(Conv1d(channels, channels, kernel_size, 1, dilation=1,
-                               padding=get_padding(kernel_size, 1))),
-            weight_norm(Conv1d(channels, channels, kernel_size, 1, dilation=1,
-                               padding=get_padding(kernel_size, 1))),
-            weight_norm(Conv1d(channels, channels, kernel_size, 1, dilation=1,
-                               padding=get_padding(kernel_size, 1)))
-        ])
-        self.convs2.apply(init_weights)
-
-    def forward(self, x, x_mask=None):
-        for c1, c2 in zip(self.convs1, self.convs2):
-            xt = F.leaky_relu(x, LRELU_SLOPE)
-            if x_mask is not None:
-                xt = xt * x_mask
-            xt = c1(xt)
-            xt = F.leaky_relu(xt, LRELU_SLOPE)
-            if x_mask is not None:
-                xt = xt * x_mask
-            xt = c2(xt)
-            x = xt + x
-        if x_mask is not None:
-            x = x * x_mask
-        return x
-
-    def remove_weight_norm(self):
-        for l in self.convs1:
-            remove_weight_norm(l)
-        for l in self.convs2:
-            remove_weight_norm(l)
-
-
-class ResBlock2(torch.nn.Module):
-    def __init__(self, channels, kernel_size=3, dilation=(1, 3)):
-        super(ResBlock2, self).__init__()
-        self.convs = nn.ModuleList([
-            weight_norm(Conv1d(channels, channels, kernel_size, 1, dilation=dilation[0],
-                               padding=get_padding(kernel_size, dilation[0]))),
-            weight_norm(Conv1d(channels, channels, kernel_size, 1, dilation=dilation[1],
-                               padding=get_padding(kernel_size, dilation[1])))
-        ])
-        self.convs.apply(init_weights)
-
-    def forward(self, x, x_mask=None):
-        for c in self.convs:
-            xt = F.leaky_relu(x, LRELU_SLOPE)
-            if x_mask is not None:
-                xt = xt * x_mask
-            xt = c(xt)
-            x = xt + x
-        if x_mask is not None:
-            x = x * x_mask
-        return x
-
-    def remove_weight_norm(self):
-        for l in self.convs:
-            remove_weight_norm(l)
-
-
-class Log(nn.Module):
-    def forward(self, x, x_mask, reverse=False, **kwargs):
-        if not reverse:
-            y = torch.log(torch.clamp_min(x, 1e-5)) * x_mask
-            logdet = torch.sum(-y, [1, 2])
-            return y, logdet
-        else:
-            x = torch.exp(x) * x_mask
-            return x
-
-
-class Flip(nn.Module):
-    def forward(self, x, *args, reverse=False, **kwargs):
-        x = torch.flip(x, [1])
-        if not reverse:
-            logdet = torch.zeros(x.size(0)).to(dtype=x.dtype, device=x.device)
-            return x, logdet
-        else:
-            return x
-
-
-class ElementwiseAffine(nn.Module):
-    def __init__(self, channels):
-        super().__init__()
-        self.channels = channels
-        self.m = nn.Parameter(torch.zeros(channels, 1))
-        self.logs = nn.Parameter(torch.zeros(channels, 1))
-
-    def forward(self, x, x_mask, reverse=False, **kwargs):
-        if not reverse:
-            y = self.m + torch.exp(self.logs) * x
-            y = y * x_mask
-            logdet = torch.sum(self.logs * x_mask, [1, 2])
-            return y, logdet
-        else:
-            x = (x - self.m) * torch.exp(-self.logs) * x_mask
-            return x
-
-
-class ResidualCouplingLayer(nn.Module):
-    def __init__(self,
-                 channels,
-                 hidden_channels,
-                 kernel_size,
-                 dilation_rate,
-                 n_layers,
-                 p_dropout=0,
-                 gin_channels=0,
-                 mean_only=False):
-        assert channels % 2 == 0, "channels should be divisible by 2"
-        super().__init__()
-        self.channels = channels
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size
-        self.dilation_rate = dilation_rate
-        self.n_layers = n_layers
-        self.half_channels = channels // 2
-        self.mean_only = mean_only
-
-        self.pre = nn.Conv1d(self.half_channels, hidden_channels, 1)
-        self.enc = WN(hidden_channels, kernel_size, dilation_rate, n_layers, p_dropout=p_dropout,
-                      gin_channels=gin_channels)
-        self.post = nn.Conv1d(hidden_channels, self.half_channels * (2 - mean_only), 1)
-        self.post.weight.data.zero_()
-        self.post.bias.data.zero_()
-
-    def forward(self, x, x_mask, g=None, reverse=False):
-        x0, x1 = torch.split(x, [self.half_channels] * 2, 1)
-        h = self.pre(x0) * x_mask
-        h = self.enc(h, x_mask, g=g)
-        stats = self.post(h) * x_mask
-        if not self.mean_only:
-            m, logs = torch.split(stats, [self.half_channels] * 2, 1)
-        else:
-            m = stats
-            logs = torch.zeros_like(m)
-
-        if not reverse:
-            x1 = m + x1 * torch.exp(logs) * x_mask
-            x = torch.cat([x0, x1], 1)
-            logdet = torch.sum(logs, [1, 2])
-            return x, logdet
-        else:
-            x1 = (x1 - m) * torch.exp(-logs) * x_mask
-            x = torch.cat([x0, x1], 1)
-            return x
-
-
-class ConvFlow(nn.Module):
-    def __init__(self, in_channels, filter_channels, kernel_size, n_layers, num_bins=10, tail_bound=5.0):
-        super().__init__()
-        self.in_channels = in_channels
-        self.filter_channels = filter_channels
-        self.kernel_size = kernel_size
-        self.n_layers = n_layers
-        self.num_bins = num_bins
-        self.tail_bound = tail_bound
-        self.half_channels = in_channels // 2
-
-        self.pre = nn.Conv1d(self.half_channels, filter_channels, 1)
-        self.convs = DDSConv(filter_channels, kernel_size, n_layers, p_dropout=0.)
-        self.proj = nn.Conv1d(filter_channels, self.half_channels * (num_bins * 3 - 1), 1)
-        self.proj.weight.data.zero_()
-        self.proj.bias.data.zero_()
-
-    def forward(self, x, x_mask, g=None, reverse=False):
-        x0, x1 = torch.split(x, [self.half_channels] * 2, 1)
-        h = self.pre(x0)
-        h = self.convs(h, x_mask, g=g)
-        h = self.proj(h) * x_mask
-
-        b, c, t = x0.shape
-        h = h.reshape(b, c, -1, t).permute(0, 1, 3, 2)  # [b, cx?, t] -> [b, c, t, ?]
-
-        unnormalized_widths = h[..., :self.num_bins] / math.sqrt(self.filter_channels)
-        unnormalized_heights = h[..., self.num_bins:2 * self.num_bins] / math.sqrt(self.filter_channels)
-        unnormalized_derivatives = h[..., 2 * self.num_bins:]
-
-        x1, logabsdet = piecewise_rational_quadratic_transform(x1,
-                                                               unnormalized_widths,
-                                                               unnormalized_heights,
-                                                               unnormalized_derivatives,
-                                                               inverse=reverse,
-                                                               tails='linear',
-                                                               tail_bound=self.tail_bound
-                                                               )
-
-        x = torch.cat([x0, x1], 1) * x_mask
-        logdet = torch.sum(logabsdet * x_mask, [1, 2])
-        if not reverse:
-            return x, logdet
-        else:
-            return x
-
-
-class TransformerCouplingLayer(nn.Module):
-    def __init__(self,
-                 channels,
-                 hidden_channels,
-                 kernel_size,
-                 n_layers,
-                 n_heads,
-                 p_dropout=0,
-                 filter_channels=0,
-                 mean_only=False,
-                 wn_sharing_parameter=None,
-                 gin_channels=0
-                 ):
-        assert channels % 2 == 0, "channels should be divisible by 2"
-        super().__init__()
-        self.channels = channels
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size
-        self.n_layers = n_layers
-        self.half_channels = channels // 2
-        self.mean_only = mean_only
-
-        self.pre = nn.Conv1d(self.half_channels, hidden_channels, 1)
-        self.enc = Encoder(hidden_channels, filter_channels, n_heads, n_layers, kernel_size, p_dropout, isflow=True,
-                           gin_channels=gin_channels) if wn_sharing_parameter is None else wn_sharing_parameter
-        self.post = nn.Conv1d(hidden_channels, self.half_channels * (2 - mean_only), 1)
-        self.post.weight.data.zero_()
-        self.post.bias.data.zero_()
-
-    def forward(self, x, x_mask, g=None, reverse=False):
-        x0, x1 = torch.split(x, [self.half_channels] * 2, 1)
-        h = self.pre(x0) * x_mask
-        h = self.enc(h, x_mask, g=g)
-        stats = self.post(h) * x_mask
-        if not self.mean_only:
-            m, logs = torch.split(stats, [self.half_channels] * 2, 1)
-        else:
-            m = stats
-            logs = torch.zeros_like(m)
-
-        if not reverse:
-            x1 = m + x1 * torch.exp(logs) * x_mask
-            x = torch.cat([x0, x1], 1)
-            logdet = torch.sum(logs, [1, 2])
-            return x, logdet
-        else:
-            x1 = (x1 - m) * torch.exp(-logs) * x_mask
-            x = torch.cat([x0, x1], 1)
-            return x
-
-        x1, logabsdet = piecewise_rational_quadratic_transform(x1,
-                                                               unnormalized_widths,
-                                                               unnormalized_heights,
-                                                               unnormalized_derivatives,
-                                                               inverse=reverse,
-                                                               tails='linear',
-                                                               tail_bound=self.tail_bound
-                                                               )
-
-        x = torch.cat([x0, x1], 1) * x_mask
-        logdet = torch.sum(logabsdet * x_mask, [1, 2])
-        if not reverse:
-            return x, logdet
-        else:
-            return x

spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_vendor/pygments/cmdline.py

@@ -1,668 +0,0 @@
-"""
-    pygments.cmdline
-    ~~~~~~~~~~~~~~~~
-
-    Command line interface.
-
-    :copyright: Copyright 2006-2022 by the Pygments team, see AUTHORS.
-    :license: BSD, see LICENSE for details.
-"""
-
-import os
-import sys
-import shutil
-import argparse
-from textwrap import dedent
-
-from pip._vendor.pygments import __version__, highlight
-from pip._vendor.pygments.util import ClassNotFound, OptionError, docstring_headline, \
-    guess_decode, guess_decode_from_terminal, terminal_encoding, \
-    UnclosingTextIOWrapper
-from pip._vendor.pygments.lexers import get_all_lexers, get_lexer_by_name, guess_lexer, \
-    load_lexer_from_file, get_lexer_for_filename, find_lexer_class_for_filename
-from pip._vendor.pygments.lexers.special import TextLexer
-from pip._vendor.pygments.formatters.latex import LatexEmbeddedLexer, LatexFormatter
-from pip._vendor.pygments.formatters import get_all_formatters, get_formatter_by_name, \
-    load_formatter_from_file, get_formatter_for_filename, find_formatter_class
-from pip._vendor.pygments.formatters.terminal import TerminalFormatter
-from pip._vendor.pygments.formatters.terminal256 import Terminal256Formatter, TerminalTrueColorFormatter
-from pip._vendor.pygments.filters import get_all_filters, find_filter_class
-from pip._vendor.pygments.styles import get_all_styles, get_style_by_name
-
-
-def _parse_options(o_strs):
-    opts = {}
-    if not o_strs:
-        return opts
-    for o_str in o_strs:
-        if not o_str.strip():
-            continue
-        o_args = o_str.split(',')
-        for o_arg in o_args:
-            o_arg = o_arg.strip()
-            try:
-                o_key, o_val = o_arg.split('=', 1)
-                o_key = o_key.strip()
-                o_val = o_val.strip()
-            except ValueError:
-                opts[o_arg] = True
-            else:
-                opts[o_key] = o_val
-    return opts
-
-
-def _parse_filters(f_strs):
-    filters = []
-    if not f_strs:
-        return filters
-    for f_str in f_strs:
-        if ':' in f_str:
-            fname, fopts = f_str.split(':', 1)
-            filters.append((fname, _parse_options([fopts])))
-        else:
-            filters.append((f_str, {}))
-    return filters
-
-
-def _print_help(what, name):
-    try:
-        if what == 'lexer':
-            cls = get_lexer_by_name(name)
-            print("Help on the %s lexer:" % cls.name)
-            print(dedent(cls.__doc__))
-        elif what == 'formatter':
-            cls = find_formatter_class(name)
-            print("Help on the %s formatter:" % cls.name)
-            print(dedent(cls.__doc__))
-        elif what == 'filter':
-            cls = find_filter_class(name)
-            print("Help on the %s filter:" % name)
-            print(dedent(cls.__doc__))
-        return 0
-    except (AttributeError, ValueError):
-        print("%s not found!" % what, file=sys.stderr)
-        return 1
-
-
-def _print_list(what):
-    if what == 'lexer':
-        print()
-        print("Lexers:")
-        print("~~~~~~~")
-
-        info = []
-        for fullname, names, exts, _ in get_all_lexers():
-            tup = (', '.join(names)+':', fullname,
-                   exts and '(filenames ' + ', '.join(exts) + ')' or '')
-            info.append(tup)
-        info.sort()
-        for i in info:
-            print(('* %s\n    %s %s') % i)
-
-    elif what == 'formatter':
-        print()
-        print("Formatters:")
-        print("~~~~~~~~~~~")
-
-        info = []
-        for cls in get_all_formatters():
-            doc = docstring_headline(cls)
-            tup = (', '.join(cls.aliases) + ':', doc, cls.filenames and
-                   '(filenames ' + ', '.join(cls.filenames) + ')' or '')
-            info.append(tup)
-        info.sort()
-        for i in info:
-            print(('* %s\n    %s %s') % i)
-
-    elif what == 'filter':
-        print()
-        print("Filters:")
-        print("~~~~~~~~")
-
-        for name in get_all_filters():
-            cls = find_filter_class(name)
-            print("* " + name + ':')
-            print("    %s" % docstring_headline(cls))
-
-    elif what == 'style':
-        print()
-        print("Styles:")
-        print("~~~~~~~")
-
-        for name in get_all_styles():
-            cls = get_style_by_name(name)
-            print("* " + name + ':')
-            print("    %s" % docstring_headline(cls))
-
-
-def _print_list_as_json(requested_items):
-    import json
-    result = {}
-    if 'lexer' in requested_items:
-        info = {}
-        for fullname, names, filenames, mimetypes in get_all_lexers():
-            info[fullname] = {
-                'aliases': names,
-                'filenames': filenames,
-                'mimetypes': mimetypes
-            }
-        result['lexers'] = info
-
-    if 'formatter' in requested_items:
-        info = {}
-        for cls in get_all_formatters():
-            doc = docstring_headline(cls)
-            info[cls.name] = {
-                'aliases': cls.aliases,
-                'filenames': cls.filenames,
-                'doc': doc
-            }
-        result['formatters'] = info
-
-    if 'filter' in requested_items:
-        info = {}
-        for name in get_all_filters():
-            cls = find_filter_class(name)
-            info[name] = {
-                'doc': docstring_headline(cls)
-            }
-        result['filters'] = info
-
-    if 'style' in requested_items:
-        info = {}
-        for name in get_all_styles():
-            cls = get_style_by_name(name)
-            info[name] = {
-                'doc': docstring_headline(cls)
-            }
-        result['styles'] = info
-
-    json.dump(result, sys.stdout)
-
-def main_inner(parser, argns):
-    if argns.help:
-        parser.print_help()
-        return 0
-
-    if argns.V:
-        print('Pygments version %s, (c) 2006-2022 by Georg Brandl, Matthäus '
-              'Chajdas and contributors.' % __version__)
-        return 0
-
-    def is_only_option(opt):
-        return not any(v for (k, v) in vars(argns).items() if k != opt)
-
-    # handle ``pygmentize -L``
-    if argns.L is not None:
-        arg_set = set()
-        for k, v in vars(argns).items():
-            if v:
-                arg_set.add(k)
-
-        arg_set.discard('L')
-        arg_set.discard('json')
-
-        if arg_set:
-            parser.print_help(sys.stderr)
-            return 2
-
-        # print version
-        if not argns.json:
-            main(['', '-V'])
-        allowed_types = {'lexer', 'formatter', 'filter', 'style'}
-        largs = [arg.rstrip('s') for arg in argns.L]
-        if any(arg not in allowed_types for arg in largs):
-            parser.print_help(sys.stderr)
-            return 0
-        if not largs:
-            largs = allowed_types
-        if not argns.json:
-            for arg in largs:
-                _print_list(arg)
-        else:
-            _print_list_as_json(largs)
-        return 0
-
-    # handle ``pygmentize -H``
-    if argns.H:
-        if not is_only_option('H'):
-            parser.print_help(sys.stderr)
-            return 2
-        what, name = argns.H
-        if what not in ('lexer', 'formatter', 'filter'):
-            parser.print_help(sys.stderr)
-            return 2
-        return _print_help(what, name)
-
-    # parse -O options
-    parsed_opts = _parse_options(argns.O or [])
-
-    # parse -P options
-    for p_opt in argns.P or []:
-        try:
-            name, value = p_opt.split('=', 1)
-        except ValueError:
-            parsed_opts[p_opt] = True
-        else:
-            parsed_opts[name] = value
-
-    # encodings
-    inencoding = parsed_opts.get('inencoding', parsed_opts.get('encoding'))
-    outencoding = parsed_opts.get('outencoding', parsed_opts.get('encoding'))
-
-    # handle ``pygmentize -N``
-    if argns.N:
-        lexer = find_lexer_class_for_filename(argns.N)
-        if lexer is None:
-            lexer = TextLexer
-
-        print(lexer.aliases[0])
-        return 0
-
-    # handle ``pygmentize -C``
-    if argns.C:
-        inp = sys.stdin.buffer.read()
-        try:
-            lexer = guess_lexer(inp, inencoding=inencoding)
-        except ClassNotFound:
-            lexer = TextLexer
-
-        print(lexer.aliases[0])
-        return 0
-
-    # handle ``pygmentize -S``
-    S_opt = argns.S
-    a_opt = argns.a
-    if S_opt is not None:
-        f_opt = argns.f
-        if not f_opt:
-            parser.print_help(sys.stderr)
-            return 2
-        if argns.l or argns.INPUTFILE:
-            parser.print_help(sys.stderr)
-            return 2
-
-        try:
-            parsed_opts['style'] = S_opt
-            fmter = get_formatter_by_name(f_opt, **parsed_opts)
-        except ClassNotFound as err:
-            print(err, file=sys.stderr)
-            return 1
-
-        print(fmter.get_style_defs(a_opt or ''))
-        return 0
-
-    # if no -S is given, -a is not allowed
-    if argns.a is not None:
-        parser.print_help(sys.stderr)
-        return 2
-
-    # parse -F options
-    F_opts = _parse_filters(argns.F or [])
-
-    # -x: allow custom (eXternal) lexers and formatters
-    allow_custom_lexer_formatter = bool(argns.x)
-
-    # select lexer
-    lexer = None
-
-    # given by name?
-    lexername = argns.l
-    if lexername:
-        # custom lexer, located relative to user's cwd
-        if allow_custom_lexer_formatter and '.py' in lexername:
-            try:
-                filename = None
-                name = None
-                if ':' in lexername:
-                    filename, name = lexername.rsplit(':', 1)
-
-                    if '.py' in name:
-                        # This can happen on Windows: If the lexername is
-                        # C:\lexer.py -- return to normal load path in that case
-                        name = None
-
-                if filename and name:
-                    lexer = load_lexer_from_file(filename, name,
-                                                 **parsed_opts)
-                else:
-                    lexer = load_lexer_from_file(lexername, **parsed_opts)
-            except ClassNotFound as err:
-                print('Error:', err, file=sys.stderr)
-                return 1
-        else:
-            try:
-                lexer = get_lexer_by_name(lexername, **parsed_opts)
-            except (OptionError, ClassNotFound) as err:
-                print('Error:', err, file=sys.stderr)
-                return 1
-
-    # read input code
-    code = None
-
-    if argns.INPUTFILE:
-        if argns.s:
-            print('Error: -s option not usable when input file specified',
-                  file=sys.stderr)
-            return 2
-
-        infn = argns.INPUTFILE
-        try:
-            with open(infn, 'rb') as infp:
-                code = infp.read()
-        except Exception as err:
-            print('Error: cannot read infile:', err, file=sys.stderr)
-            return 1
-        if not inencoding:
-            code, inencoding = guess_decode(code)
-
-        # do we have to guess the lexer?
-        if not lexer:
-            try:
-                lexer = get_lexer_for_filename(infn, code, **parsed_opts)
-            except ClassNotFound as err:
-                if argns.g:
-                    try:
-                        lexer = guess_lexer(code, **parsed_opts)
-                    except ClassNotFound:
-                        lexer = TextLexer(**parsed_opts)
-                else:
-                    print('Error:', err, file=sys.stderr)
-                    return 1
-            except OptionError as err:
-                print('Error:', err, file=sys.stderr)
-                return 1
-
-    elif not argns.s:  # treat stdin as full file (-s support is later)
-        # read code from terminal, always in binary mode since we want to
-        # decode ourselves and be tolerant with it
-        code = sys.stdin.buffer.read()  # use .buffer to get a binary stream
-        if not inencoding:
-            code, inencoding = guess_decode_from_terminal(code, sys.stdin)
-            # else the lexer will do the decoding
-        if not lexer:
-            try:
-                lexer = guess_lexer(code, **parsed_opts)
-            except ClassNotFound:
-                lexer = TextLexer(**parsed_opts)
-
-    else:  # -s option needs a lexer with -l
-        if not lexer:
-            print('Error: when using -s a lexer has to be selected with -l',
-                  file=sys.stderr)
-            return 2
-
-    # process filters
-    for fname, fopts in F_opts:
-        try:
-            lexer.add_filter(fname, **fopts)
-        except ClassNotFound as err:
-            print('Error:', err, file=sys.stderr)
-            return 1
-
-    # select formatter
-    outfn = argns.o
-    fmter = argns.f
-    if fmter:
-        # custom formatter, located relative to user's cwd
-        if allow_custom_lexer_formatter and '.py' in fmter:
-            try:
-                filename = None
-                name = None
-                if ':' in fmter:
-                    # Same logic as above for custom lexer
-                    filename, name = fmter.rsplit(':', 1)
-
-                    if '.py' in name:
-                        name = None
-
-                if filename and name:
-                    fmter = load_formatter_from_file(filename, name,
-                                                     **parsed_opts)
-                else:
-                    fmter = load_formatter_from_file(fmter, **parsed_opts)
-            except ClassNotFound as err:
-                print('Error:', err, file=sys.stderr)
-                return 1
-        else:
-            try:
-                fmter = get_formatter_by_name(fmter, **parsed_opts)
-            except (OptionError, ClassNotFound) as err:
-                print('Error:', err, file=sys.stderr)
-                return 1
-
-    if outfn:
-        if not fmter:
-            try:
-                fmter = get_formatter_for_filename(outfn, **parsed_opts)
-            except (OptionError, ClassNotFound) as err:
-                print('Error:', err, file=sys.stderr)
-                return 1
-        try:
-            outfile = open(outfn, 'wb')
-        except Exception as err:
-            print('Error: cannot open outfile:', err, file=sys.stderr)
-            return 1
-    else:
-        if not fmter:
-            if os.environ.get('COLORTERM','') in ('truecolor', '24bit'):
-                fmter = TerminalTrueColorFormatter(**parsed_opts)
-            elif '256' in os.environ.get('TERM', ''):
-                fmter = Terminal256Formatter(**parsed_opts)
-            else:
-                fmter = TerminalFormatter(**parsed_opts)
-        outfile = sys.stdout.buffer
-
-    # determine output encoding if not explicitly selected
-    if not outencoding:
-        if outfn:
-            # output file? use lexer encoding for now (can still be None)
-            fmter.encoding = inencoding
-        else:
-            # else use terminal encoding
-            fmter.encoding = terminal_encoding(sys.stdout)
-
-    # provide coloring under Windows, if possible
-    if not outfn and sys.platform in ('win32', 'cygwin') and \
-       fmter.name in ('Terminal', 'Terminal256'):  # pragma: no cover
-        # unfortunately colorama doesn't support binary streams on Py3
-        outfile = UnclosingTextIOWrapper(outfile, encoding=fmter.encoding)
-        fmter.encoding = None
-        try:
-            import pip._vendor.colorama.initialise as colorama_initialise
-        except ImportError:
-            pass
-        else:
-            outfile = colorama_initialise.wrap_stream(
-                outfile, convert=None, strip=None, autoreset=False, wrap=True)
-
-    # When using the LaTeX formatter and the option `escapeinside` is
-    # specified, we need a special lexer which collects escaped text
-    # before running the chosen language lexer.
-    escapeinside = parsed_opts.get('escapeinside', '')
-    if len(escapeinside) == 2 and isinstance(fmter, LatexFormatter):
-        left = escapeinside[0]
-        right = escapeinside[1]
-        lexer = LatexEmbeddedLexer(left, right, lexer)
-
-    # ... and do it!
-    if not argns.s:
-        # process whole input as per normal...
-        try:
-            highlight(code, lexer, fmter, outfile)
-        finally:
-            if outfn:
-                outfile.close()
-        return 0
-    else:
-        # line by line processing of stdin (eg: for 'tail -f')...
-        try:
-            while 1:
-                line = sys.stdin.buffer.readline()
-                if not line:
-                    break
-                if not inencoding:
-                    line = guess_decode_from_terminal(line, sys.stdin)[0]
-                highlight(line, lexer, fmter, outfile)
-                if hasattr(outfile, 'flush'):
-                    outfile.flush()
-            return 0
-        except KeyboardInterrupt:  # pragma: no cover
-            return 0
-        finally:
-            if outfn:
-                outfile.close()
-
-
-class HelpFormatter(argparse.HelpFormatter):
-    def __init__(self, prog, indent_increment=2, max_help_position=16, width=None):
-        if width is None:
-            try:
-                width = shutil.get_terminal_size().columns - 2
-            except Exception:
-                pass
-        argparse.HelpFormatter.__init__(self, prog, indent_increment,
-                                        max_help_position, width)
-
-
-def main(args=sys.argv):
-    """
-    Main command line entry point.
-    """
-    desc = "Highlight an input file and write the result to an output file."
-    parser = argparse.ArgumentParser(description=desc, add_help=False,
-                                     formatter_class=HelpFormatter)
-
-    operation = parser.add_argument_group('Main operation')
-    lexersel = operation.add_mutually_exclusive_group()
-    lexersel.add_argument(
-        '-l', metavar='LEXER',
-        help='Specify the lexer to use.  (Query names with -L.)  If not '
-        'given and -g is not present, the lexer is guessed from the filename.')
-    lexersel.add_argument(
-        '-g', action='store_true',
-        help='Guess the lexer from the file contents, or pass through '
-        'as plain text if nothing can be guessed.')
-    operation.add_argument(
-        '-F', metavar='FILTER[:options]', action='append',
-        help='Add a filter to the token stream.  (Query names with -L.) '
-        'Filter options are given after a colon if necessary.')
-    operation.add_argument(
-        '-f', metavar='FORMATTER',
-        help='Specify the formatter to use.  (Query names with -L.) '
-        'If not given, the formatter is guessed from the output filename, '
-        'and defaults to the terminal formatter if the output is to the '
-        'terminal or an unknown file extension.')
-    operation.add_argument(
-        '-O', metavar='OPTION=value[,OPTION=value,...]', action='append',
-        help='Give options to the lexer and formatter as a comma-separated '
-        'list of key-value pairs. '
-        'Example: `-O bg=light,python=cool`.')
-    operation.add_argument(
-        '-P', metavar='OPTION=value', action='append',
-        help='Give a single option to the lexer and formatter - with this '
-        'you can pass options whose value contains commas and equal signs. '
-        'Example: `-P "heading=Pygments, the Python highlighter"`.')
-    operation.add_argument(
-        '-o', metavar='OUTPUTFILE',
-        help='Where to write the output.  Defaults to standard output.')
-
-    operation.add_argument(
-        'INPUTFILE', nargs='?',
-        help='Where to read the input.  Defaults to standard input.')
-
-    flags = parser.add_argument_group('Operation flags')
-    flags.add_argument(
-        '-v', action='store_true',
-        help='Print a detailed traceback on unhandled exceptions, which '
-        'is useful for debugging and bug reports.')
-    flags.add_argument(
-        '-s', action='store_true',
-        help='Process lines one at a time until EOF, rather than waiting to '
-        'process the entire file.  This only works for stdin, only for lexers '
-        'with no line-spanning constructs, and is intended for streaming '
-        'input such as you get from `tail -f`. '
-        'Example usage: `tail -f sql.log | pygmentize -s -l sql`.')
-    flags.add_argument(
-        '-x', action='store_true',
-        help='Allow custom lexers and formatters to be loaded from a .py file '
-        'relative to the current working directory. For example, '
-        '`-l ./customlexer.py -x`. By default, this option expects a file '
-        'with a class named CustomLexer or CustomFormatter; you can also '
-        'specify your own class name with a colon (`-l ./lexer.py:MyLexer`). '
-        'Users should be very careful not to use this option with untrusted '
-        'files, because it will import and run them.')
-    flags.add_argument('--json', help='Output as JSON. This can '
-        'be only used in conjunction with -L.',
-        default=False,
-        action='store_true')
-
-    special_modes_group = parser.add_argument_group(
-        'Special modes - do not do any highlighting')
-    special_modes = special_modes_group.add_mutually_exclusive_group()
-    special_modes.add_argument(
-        '-S', metavar='STYLE -f formatter',
-        help='Print style definitions for STYLE for a formatter '
-        'given with -f. The argument given by -a is formatter '
-        'dependent.')
-    special_modes.add_argument(
-        '-L', nargs='*', metavar='WHAT',
-        help='List lexers, formatters, styles or filters -- '
-        'give additional arguments for the thing(s) you want to list '
-        '(e.g. "styles"), or omit them to list everything.')
-    special_modes.add_argument(
-        '-N', metavar='FILENAME',
-        help='Guess and print out a lexer name based solely on the given '
-        'filename. Does not take input or highlight anything. If no specific '
-        'lexer can be determined, "text" is printed.')
-    special_modes.add_argument(
-        '-C', action='store_true',
-        help='Like -N, but print out a lexer name based solely on '
-        'a given content from standard input.')
-    special_modes.add_argument(
-        '-H', action='store', nargs=2, metavar=('NAME', 'TYPE'),
-        help='Print detailed help for the object <name> of type <type>, '
-        'where <type> is one of "lexer", "formatter" or "filter".')
-    special_modes.add_argument(
-        '-V', action='store_true',
-        help='Print the package version.')
-    special_modes.add_argument(
-        '-h', '--help', action='store_true',
-        help='Print this help.')
-    special_modes_group.add_argument(
-        '-a', metavar='ARG',
-        help='Formatter-specific additional argument for the -S (print '
-        'style sheet) mode.')
-
-    argns = parser.parse_args(args[1:])
-
-    try:
-        return main_inner(parser, argns)
-    except BrokenPipeError:
-        # someone closed our stdout, e.g. by quitting a pager.
-        return 0
-    except Exception:
-        if argns.v:
-            print(file=sys.stderr)
-            print('*' * 65, file=sys.stderr)
-            print('An unhandled exception occurred while highlighting.',
-                  file=sys.stderr)
-            print('Please report the whole traceback to the issue tracker at',
-                  file=sys.stderr)
-            print('<https://github.com/pygments/pygments/issues>.',
-                  file=sys.stderr)
-            print('*' * 65, file=sys.stderr)
-            print(file=sys.stderr)
-            raise
-        import traceback
-        info = traceback.format_exception(*sys.exc_info())
-        msg = info[-1].strip()
-        if len(info) >= 3:
-            # extract relevant file and position info
-            msg += '\n   (f%s)' % info[-2].split('\n')[0].strip()[1:]
-        print(file=sys.stderr)
-        print('*** Error while highlighting:', file=sys.stderr)
-        print(msg, file=sys.stderr)
-        print('*** If this is a bug you want to report, please rerun with -v.',
-              file=sys.stderr)
-        return 1

spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_vendor/pygments/style.py

@@ -1,197 +0,0 @@
-"""
-    pygments.style
-    ~~~~~~~~~~~~~~
-
-    Basic style object.
-
-    :copyright: Copyright 2006-2022 by the Pygments team, see AUTHORS.
-    :license: BSD, see LICENSE for details.
-"""
-
-from pip._vendor.pygments.token import Token, STANDARD_TYPES
-
-# Default mapping of ansixxx to RGB colors.
-_ansimap = {
-    # dark
-    'ansiblack': '000000',
-    'ansired': '7f0000',
-    'ansigreen': '007f00',
-    'ansiyellow': '7f7fe0',
-    'ansiblue': '00007f',
-    'ansimagenta': '7f007f',
-    'ansicyan': '007f7f',
-    'ansigray': 'e5e5e5',
-    # normal
-    'ansibrightblack': '555555',
-    'ansibrightred': 'ff0000',
-    'ansibrightgreen': '00ff00',
-    'ansibrightyellow': 'ffff00',
-    'ansibrightblue': '0000ff',
-    'ansibrightmagenta': 'ff00ff',
-    'ansibrightcyan': '00ffff',
-    'ansiwhite': 'ffffff',
-}
-# mapping of deprecated #ansixxx colors to new color names
-_deprecated_ansicolors = {
-    # dark
-    '#ansiblack': 'ansiblack',
-    '#ansidarkred': 'ansired',
-    '#ansidarkgreen': 'ansigreen',
-    '#ansibrown': 'ansiyellow',
-    '#ansidarkblue': 'ansiblue',
-    '#ansipurple': 'ansimagenta',
-    '#ansiteal': 'ansicyan',
-    '#ansilightgray': 'ansigray',
-    # normal
-    '#ansidarkgray': 'ansibrightblack',
-    '#ansired': 'ansibrightred',
-    '#ansigreen': 'ansibrightgreen',
-    '#ansiyellow': 'ansibrightyellow',
-    '#ansiblue': 'ansibrightblue',
-    '#ansifuchsia': 'ansibrightmagenta',
-    '#ansiturquoise': 'ansibrightcyan',
-    '#ansiwhite': 'ansiwhite',
-}
-ansicolors = set(_ansimap)
-
-
-class StyleMeta(type):
-
-    def __new__(mcs, name, bases, dct):
-        obj = type.__new__(mcs, name, bases, dct)
-        for token in STANDARD_TYPES:
-            if token not in obj.styles:
-                obj.styles[token] = ''
-
-        def colorformat(text):
-            if text in ansicolors:
-                return text
-            if text[0:1] == '#':
-                col = text[1:]
-                if len(col) == 6:
-                    return col
-                elif len(col) == 3:
-                    return col[0] * 2 + col[1] * 2 + col[2] * 2
-            elif text == '':
-                return ''
-            elif text.startswith('var') or text.startswith('calc'):
-                return text
-            assert False, "wrong color format %r" % text
-
-        _styles = obj._styles = {}
-
-        for ttype in obj.styles:
-            for token in ttype.split():
-                if token in _styles:
-                    continue
-                ndef = _styles.get(token.parent, None)
-                styledefs = obj.styles.get(token, '').split()
-                if not ndef or token is None:
-                    ndef = ['', 0, 0, 0, '', '', 0, 0, 0]
-                elif 'noinherit' in styledefs and token is not Token:
-                    ndef = _styles[Token][:]
-                else:
-                    ndef = ndef[:]
-                _styles[token] = ndef
-                for styledef in obj.styles.get(token, '').split():
-                    if styledef == 'noinherit':
-                        pass
-                    elif styledef == 'bold':
-                        ndef[1] = 1
-                    elif styledef == 'nobold':
-                        ndef[1] = 0
-                    elif styledef == 'italic':
-                        ndef[2] = 1
-                    elif styledef == 'noitalic':
-                        ndef[2] = 0
-                    elif styledef == 'underline':
-                        ndef[3] = 1
-                    elif styledef == 'nounderline':
-                        ndef[3] = 0
-                    elif styledef[:3] == 'bg:':
-                        ndef[4] = colorformat(styledef[3:])
-                    elif styledef[:7] == 'border:':
-                        ndef[5] = colorformat(styledef[7:])
-                    elif styledef == 'roman':
-                        ndef[6] = 1
-                    elif styledef == 'sans':
-                        ndef[7] = 1
-                    elif styledef == 'mono':
-                        ndef[8] = 1
-                    else:
-                        ndef[0] = colorformat(styledef)
-
-        return obj
-
-    def style_for_token(cls, token):
-        t = cls._styles[token]
-        ansicolor = bgansicolor = None
-        color = t[0]
-        if color in _deprecated_ansicolors:
-            color = _deprecated_ansicolors[color]
-        if color in ansicolors:
-            ansicolor = color
-            color = _ansimap[color]
-        bgcolor = t[4]
-        if bgcolor in _deprecated_ansicolors:
-            bgcolor = _deprecated_ansicolors[bgcolor]
-        if bgcolor in ansicolors:
-            bgansicolor = bgcolor
-            bgcolor = _ansimap[bgcolor]
-
-        return {
-            'color':        color or None,
-            'bold':         bool(t[1]),
-            'italic':       bool(t[2]),
-            'underline':    bool(t[3]),
-            'bgcolor':      bgcolor or None,
-            'border':       t[5] or None,
-            'roman':        bool(t[6]) or None,
-            'sans':         bool(t[7]) or None,
-            'mono':         bool(t[8]) or None,
-            'ansicolor':    ansicolor,
-            'bgansicolor':  bgansicolor,
-        }
-
-    def list_styles(cls):
-        return list(cls)
-
-    def styles_token(cls, ttype):
-        return ttype in cls._styles
-
-    def __iter__(cls):
-        for token in cls._styles:
-            yield token, cls.style_for_token(token)
-
-    def __len__(cls):
-        return len(cls._styles)
-
-
-class Style(metaclass=StyleMeta):
-
-    #: overall background color (``None`` means transparent)
-    background_color = '#ffffff'
-
-    #: highlight background color
-    highlight_color = '#ffffcc'
-
-    #: line number font color
-    line_number_color = 'inherit'
-
-    #: line number background color
-    line_number_background_color = 'transparent'
-
-    #: special line number font color
-    line_number_special_color = '#000000'
-
-    #: special line number background color
-    line_number_special_background_color = '#ffffc0'
-
-    #: Style definitions for individual token types.
-    styles = {}
-
-    # Attribute for lexers defined within Pygments. If set
-    # to True, the style is not shown in the style gallery
-    # on the website. This is intended for language-specific
-    # styles.
-    web_style_gallery_exclude = False

spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_vendor/rich/_extension.py

@@ -1,10 +0,0 @@
-from typing import Any
-
-
-def load_ipython_extension(ip: Any) -> None:  # pragma: no cover
-    # prevent circular import
-    from pip._vendor.rich.pretty import install
-    from pip._vendor.rich.traceback import install as tr_install
-
-    install()
-    tr_install()

spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_vendor/rich/_wrap.py

@@ -1,56 +0,0 @@
-import re
-from typing import Iterable, List, Tuple
-
-from ._loop import loop_last
-from .cells import cell_len, chop_cells
-
-re_word = re.compile(r"\s*\S+\s*")
-
-
-def words(text: str) -> Iterable[Tuple[int, int, str]]:
-    position = 0
-    word_match = re_word.match(text, position)
-    while word_match is not None:
-        start, end = word_match.span()
-        word = word_match.group(0)
-        yield start, end, word
-        word_match = re_word.match(text, end)
-
-
-def divide_line(text: str, width: int, fold: bool = True) -> List[int]:
-    divides: List[int] = []
-    append = divides.append
-    line_position = 0
-    _cell_len = cell_len
-    for start, _end, word in words(text):
-        word_length = _cell_len(word.rstrip())
-        if line_position + word_length > width:
-            if word_length > width:
-                if fold:
-                    chopped_words = chop_cells(word, max_size=width, position=0)
-                    for last, line in loop_last(chopped_words):
-                        if start:
-                            append(start)
-
-                        if last:
-                            line_position = _cell_len(line)
-                        else:
-                            start += len(line)
-                else:
-                    if start:
-                        append(start)
-                    line_position = _cell_len(word)
-            elif line_position and start:
-                append(start)
-                line_position = _cell_len(word)
-        else:
-            line_position += _cell_len(word)
-    return divides
-
-
-if __name__ == "__main__":  # pragma: no cover
-    from .console import Console
-
-    console = Console(width=10)
-    console.print("12345 abcdefghijklmnopqrstuvwyxzABCDEFGHIJKLMNOPQRSTUVWXYZ 12345")
-    print(chop_cells("abcdefghijklmnopqrstuvwxyz", 10, position=2))

spaces/Awesimo/jojogan/e4e/criteria/lpips/networks.py

@@ -1,96 +0,0 @@
-from typing import Sequence
-
-from itertools import chain
-
-import torch
-import torch.nn as nn
-from torchvision import models
-
-from criteria.lpips.utils import normalize_activation
-
-
-def get_network(net_type: str):
-    if net_type == 'alex':
-        return AlexNet()
-    elif net_type == 'squeeze':
-        return SqueezeNet()
-    elif net_type == 'vgg':
-        return VGG16()
-    else:
-        raise NotImplementedError('choose net_type from [alex, squeeze, vgg].')
-
-
-class LinLayers(nn.ModuleList):
-    def __init__(self, n_channels_list: Sequence[int]):
-        super(LinLayers, self).__init__([
-            nn.Sequential(
-                nn.Identity(),
-                nn.Conv2d(nc, 1, 1, 1, 0, bias=False)
-            ) for nc in n_channels_list
-        ])
-
-        for param in self.parameters():
-            param.requires_grad = False
-
-
-class BaseNet(nn.Module):
-    def __init__(self):
-        super(BaseNet, self).__init__()
-
-        # register buffer
-        self.register_buffer(
-            'mean', torch.Tensor([-.030, -.088, -.188])[None, :, None, None])
-        self.register_buffer(
-            'std', torch.Tensor([.458, .448, .450])[None, :, None, None])
-
-    def set_requires_grad(self, state: bool):
-        for param in chain(self.parameters(), self.buffers()):
-            param.requires_grad = state
-
-    def z_score(self, x: torch.Tensor):
-        return (x - self.mean) / self.std
-
-    def forward(self, x: torch.Tensor):
-        x = self.z_score(x)
-
-        output = []
-        for i, (_, layer) in enumerate(self.layers._modules.items(), 1):
-            x = layer(x)
-            if i in self.target_layers:
-                output.append(normalize_activation(x))
-            if len(output) == len(self.target_layers):
-                break
-        return output
-
-
-class SqueezeNet(BaseNet):
-    def __init__(self):
-        super(SqueezeNet, self).__init__()
-
-        self.layers = models.squeezenet1_1(True).features
-        self.target_layers = [2, 5, 8, 10, 11, 12, 13]
-        self.n_channels_list = [64, 128, 256, 384, 384, 512, 512]
-
-        self.set_requires_grad(False)
-
-
-class AlexNet(BaseNet):
-    def __init__(self):
-        super(AlexNet, self).__init__()
-
-        self.layers = models.alexnet(True).features
-        self.target_layers = [2, 5, 8, 10, 12]
-        self.n_channels_list = [64, 192, 384, 256, 256]
-
-        self.set_requires_grad(False)
-
-
-class VGG16(BaseNet):
-    def __init__(self):
-        super(VGG16, self).__init__()
-
-        self.layers = models.vgg16(True).features
-        self.target_layers = [4, 9, 16, 23, 30]
-        self.n_channels_list = [64, 128, 256, 512, 512]
-
-        self.set_requires_grad(False)

spaces/Ayemos/highlight_text_based_on_surprisals/README.md

@@ -1,12 +0,0 @@
----
-title: Highlight text based on readability (=surprisal)
-emoji: 🐠
-colorFrom: yellow
-colorTo: pink
-sdk: gradio
-sdk_version: 3.9
-app_file: app.py
-pinned: false
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference

spaces/Bart92/RVC_HF/go-tensorboard.bat

@@ -1,2 +0,0 @@
-python fixes/tensor-launch.py
-pause

spaces/Big-Web/MMSD/env/Lib/site-packages/pip/_vendor/pyproject_hooks/_impl.py

@@ -1,330 +0,0 @@
-import json
-import os
-import sys
-import tempfile
-from contextlib import contextmanager
-from os.path import abspath
-from os.path import join as pjoin
-from subprocess import STDOUT, check_call, check_output
-
-from ._in_process import _in_proc_script_path
-
-
-def write_json(obj, path, **kwargs):
-    with open(path, 'w', encoding='utf-8') as f:
-        json.dump(obj, f, **kwargs)
-
-
-def read_json(path):
-    with open(path, encoding='utf-8') as f:
-        return json.load(f)
-
-
-class BackendUnavailable(Exception):
-    """Will be raised if the backend cannot be imported in the hook process."""
-    def __init__(self, traceback):
-        self.traceback = traceback
-
-
-class BackendInvalid(Exception):
-    """Will be raised if the backend is invalid."""
-    def __init__(self, backend_name, backend_path, message):
-        super().__init__(message)
-        self.backend_name = backend_name
-        self.backend_path = backend_path
-
-
-class HookMissing(Exception):
-    """Will be raised on missing hooks (if a fallback can't be used)."""
-    def __init__(self, hook_name):
-        super().__init__(hook_name)
-        self.hook_name = hook_name
-
-
-class UnsupportedOperation(Exception):
-    """May be raised by build_sdist if the backend indicates that it can't."""
-    def __init__(self, traceback):
-        self.traceback = traceback
-
-
-def default_subprocess_runner(cmd, cwd=None, extra_environ=None):
-    """The default method of calling the wrapper subprocess.
-
-    This uses :func:`subprocess.check_call` under the hood.
-    """
-    env = os.environ.copy()
-    if extra_environ:
-        env.update(extra_environ)
-
-    check_call(cmd, cwd=cwd, env=env)
-
-
-def quiet_subprocess_runner(cmd, cwd=None, extra_environ=None):
-    """Call the subprocess while suppressing output.
-
-    This uses :func:`subprocess.check_output` under the hood.
-    """
-    env = os.environ.copy()
-    if extra_environ:
-        env.update(extra_environ)
-
-    check_output(cmd, cwd=cwd, env=env, stderr=STDOUT)
-
-
-def norm_and_check(source_tree, requested):
-    """Normalise and check a backend path.
-
-    Ensure that the requested backend path is specified as a relative path,
-    and resolves to a location under the given source tree.
-
-    Return an absolute version of the requested path.
-    """
-    if os.path.isabs(requested):
-        raise ValueError("paths must be relative")
-
-    abs_source = os.path.abspath(source_tree)
-    abs_requested = os.path.normpath(os.path.join(abs_source, requested))
-    # We have to use commonprefix for Python 2.7 compatibility. So we
-    # normalise case to avoid problems because commonprefix is a character
-    # based comparison :-(
-    norm_source = os.path.normcase(abs_source)
-    norm_requested = os.path.normcase(abs_requested)
-    if os.path.commonprefix([norm_source, norm_requested]) != norm_source:
-        raise ValueError("paths must be inside source tree")
-
-    return abs_requested
-
-
-class BuildBackendHookCaller:
-    """A wrapper to call the build backend hooks for a source directory.
-    """
-
-    def __init__(
-            self,
-            source_dir,
-            build_backend,
-            backend_path=None,
-            runner=None,
-            python_executable=None,
-    ):
-        """
-        :param source_dir: The source directory to invoke the build backend for
-        :param build_backend: The build backend spec
-        :param backend_path: Additional path entries for the build backend spec
-        :param runner: The :ref:`subprocess runner <Subprocess Runners>` to use
-        :param python_executable:
-            The Python executable used to invoke the build backend
-        """
-        if runner is None:
-            runner = default_subprocess_runner
-
-        self.source_dir = abspath(source_dir)
-        self.build_backend = build_backend
-        if backend_path:
-            backend_path = [
-                norm_and_check(self.source_dir, p) for p in backend_path
-            ]
-        self.backend_path = backend_path
-        self._subprocess_runner = runner
-        if not python_executable:
-            python_executable = sys.executable
-        self.python_executable = python_executable
-
-    @contextmanager
-    def subprocess_runner(self, runner):
-        """A context manager for temporarily overriding the default
-        :ref:`subprocess runner <Subprocess Runners>`.
-
-        .. code-block:: python
-
-            hook_caller = BuildBackendHookCaller(...)
-            with hook_caller.subprocess_runner(quiet_subprocess_runner):
-                ...
-        """
-        prev = self._subprocess_runner
-        self._subprocess_runner = runner
-        try:
-            yield
-        finally:
-            self._subprocess_runner = prev
-
-    def _supported_features(self):
-        """Return the list of optional features supported by the backend."""
-        return self._call_hook('_supported_features', {})
-
-    def get_requires_for_build_wheel(self, config_settings=None):
-        """Get additional dependencies required for building a wheel.
-
-        :returns: A list of :pep:`dependency specifiers <508>`.
-        :rtype: list[str]
-
-        .. admonition:: Fallback
-
-            If the build backend does not defined a hook with this name, an
-            empty list will be returned.
-        """
-        return self._call_hook('get_requires_for_build_wheel', {
-            'config_settings': config_settings
-        })
-
-    def prepare_metadata_for_build_wheel(
-            self, metadata_directory, config_settings=None,
-            _allow_fallback=True):
-        """Prepare a ``*.dist-info`` folder with metadata for this project.
-
-        :returns: Name of the newly created subfolder within
-                  ``metadata_directory``, containing the metadata.
-        :rtype: str
-
-        .. admonition:: Fallback
-
-            If the build backend does not define a hook with this name and
-            ``_allow_fallback`` is truthy, the backend will be asked to build a
-            wheel via the ``build_wheel`` hook and the dist-info extracted from
-            that will be returned.
-        """
-        return self._call_hook('prepare_metadata_for_build_wheel', {
-            'metadata_directory': abspath(metadata_directory),
-            'config_settings': config_settings,
-            '_allow_fallback': _allow_fallback,
-        })
-
-    def build_wheel(
-            self, wheel_directory, config_settings=None,
-            metadata_directory=None):
-        """Build a wheel from this project.
-
-        :returns:
-            The name of the newly created wheel within ``wheel_directory``.
-
-        .. admonition:: Interaction with fallback
-
-            If the ``build_wheel`` hook was called in the fallback for
-            :meth:`prepare_metadata_for_build_wheel`, the build backend would
-            not be invoked. Instead, the previously built wheel will be copied
-            to ``wheel_directory`` and the name of that file will be returned.
-        """
-        if metadata_directory is not None:
-            metadata_directory = abspath(metadata_directory)
-        return self._call_hook('build_wheel', {
-            'wheel_directory': abspath(wheel_directory),
-            'config_settings': config_settings,
-            'metadata_directory': metadata_directory,
-        })
-
-    def get_requires_for_build_editable(self, config_settings=None):
-        """Get additional dependencies required for building an editable wheel.
-
-        :returns: A list of :pep:`dependency specifiers <508>`.
-        :rtype: list[str]
-
-        .. admonition:: Fallback
-
-            If the build backend does not defined a hook with this name, an
-            empty list will be returned.
-        """
-        return self._call_hook('get_requires_for_build_editable', {
-            'config_settings': config_settings
-        })
-
-    def prepare_metadata_for_build_editable(
-            self, metadata_directory, config_settings=None,
-            _allow_fallback=True):
-        """Prepare a ``*.dist-info`` folder with metadata for this project.
-
-        :returns: Name of the newly created subfolder within
-                  ``metadata_directory``, containing the metadata.
-        :rtype: str
-
-        .. admonition:: Fallback
-
-            If the build backend does not define a hook with this name and
-            ``_allow_fallback`` is truthy, the backend will be asked to build a
-            wheel via the ``build_editable`` hook and the dist-info
-            extracted from that will be returned.
-        """
-        return self._call_hook('prepare_metadata_for_build_editable', {
-            'metadata_directory': abspath(metadata_directory),
-            'config_settings': config_settings,
-            '_allow_fallback': _allow_fallback,
-        })
-
-    def build_editable(
-            self, wheel_directory, config_settings=None,
-            metadata_directory=None):
-        """Build an editable wheel from this project.
-
-        :returns:
-            The name of the newly created wheel within ``wheel_directory``.
-
-        .. admonition:: Interaction with fallback
-
-            If the ``build_editable`` hook was called in the fallback for
-            :meth:`prepare_metadata_for_build_editable`, the build backend
-            would not be invoked. Instead, the previously built wheel will be
-            copied to ``wheel_directory`` and the name of that file will be
-            returned.
-        """
-        if metadata_directory is not None:
-            metadata_directory = abspath(metadata_directory)
-        return self._call_hook('build_editable', {
-            'wheel_directory': abspath(wheel_directory),
-            'config_settings': config_settings,
-            'metadata_directory': metadata_directory,
-        })
-
-    def get_requires_for_build_sdist(self, config_settings=None):
-        """Get additional dependencies required for building an sdist.
-
-        :returns: A list of :pep:`dependency specifiers <508>`.
-        :rtype: list[str]
-        """
-        return self._call_hook('get_requires_for_build_sdist', {
-            'config_settings': config_settings
-        })
-
-    def build_sdist(self, sdist_directory, config_settings=None):
-        """Build an sdist from this project.
-
-        :returns:
-            The name of the newly created sdist within ``wheel_directory``.
-        """
-        return self._call_hook('build_sdist', {
-            'sdist_directory': abspath(sdist_directory),
-            'config_settings': config_settings,
-        })
-
-    def _call_hook(self, hook_name, kwargs):
-        extra_environ = {'PEP517_BUILD_BACKEND': self.build_backend}
-
-        if self.backend_path:
-            backend_path = os.pathsep.join(self.backend_path)
-            extra_environ['PEP517_BACKEND_PATH'] = backend_path
-
-        with tempfile.TemporaryDirectory() as td:
-            hook_input = {'kwargs': kwargs}
-            write_json(hook_input, pjoin(td, 'input.json'), indent=2)
-
-            # Run the hook in a subprocess
-            with _in_proc_script_path() as script:
-                python = self.python_executable
-                self._subprocess_runner(
-                    [python, abspath(str(script)), hook_name, td],
-                    cwd=self.source_dir,
-                    extra_environ=extra_environ
-                )
-
-            data = read_json(pjoin(td, 'output.json'))
-            if data.get('unsupported'):
-                raise UnsupportedOperation(data.get('traceback', ''))
-            if data.get('no_backend'):
-                raise BackendUnavailable(data.get('traceback', ''))
-            if data.get('backend_invalid'):
-                raise BackendInvalid(
-                    backend_name=self.build_backend,
-                    backend_path=self.backend_path,
-                    message=data.get('backend_error', '')
-                )
-            if data.get('hook_missing'):
-                raise HookMissing(data.get('missing_hook_name') or hook_name)
-            return data['return_val']

spaces/Big-Web/MMSD/env/Lib/site-packages/pip/_vendor/tenacity/tornadoweb.py

@@ -1,59 +0,0 @@
-# Copyright 2017 Elisey Zanko
-#
-# Licensed 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.
-
-import sys
-import typing
-
-from pip._vendor.tenacity import BaseRetrying
-from pip._vendor.tenacity import DoAttempt
-from pip._vendor.tenacity import DoSleep
-from pip._vendor.tenacity import RetryCallState
-
-from tornado import gen
-
-if typing.TYPE_CHECKING:
-    from tornado.concurrent import Future
-
-_RetValT = typing.TypeVar("_RetValT")
-
-
-class TornadoRetrying(BaseRetrying):
-    def __init__(self, sleep: "typing.Callable[[float], Future[None]]" = gen.sleep, **kwargs: typing.Any) -> None:
-        super().__init__(**kwargs)
-        self.sleep = sleep
-
-    @gen.coroutine  # type: ignore[misc]
-    def __call__(
-        self,
-        fn: "typing.Callable[..., typing.Union[typing.Generator[typing.Any, typing.Any, _RetValT], Future[_RetValT]]]",
-        *args: typing.Any,
-        **kwargs: typing.Any,
-    ) -> "typing.Generator[typing.Any, typing.Any, _RetValT]":
-        self.begin()
-
-        retry_state = RetryCallState(retry_object=self, fn=fn, args=args, kwargs=kwargs)
-        while True:
-            do = self.iter(retry_state=retry_state)
-            if isinstance(do, DoAttempt):
-                try:
-                    result = yield fn(*args, **kwargs)
-                except BaseException:  # noqa: B902
-                    retry_state.set_exception(sys.exc_info())  # type: ignore[arg-type]
-                else:
-                    retry_state.set_result(result)
-            elif isinstance(do, DoSleep):
-                retry_state.prepare_for_next_attempt()
-                yield self.sleep(do)
-            else:
-                raise gen.Return(do)

spaces/Big-Web/MMSD/env/Lib/site-packages/setuptools/_distutils/spawn.py

@@ -1,109 +0,0 @@
-"""distutils.spawn
-
-Provides the 'spawn()' function, a front-end to various platform-
-specific functions for launching another program in a sub-process.
-Also provides the 'find_executable()' to search the path for a given
-executable name.
-"""
-
-import sys
-import os
-import subprocess
-
-from distutils.errors import DistutilsExecError
-from distutils.debug import DEBUG
-from distutils import log
-
-
-def spawn(cmd, search_path=1, verbose=0, dry_run=0, env=None):  # noqa: C901
-    """Run another program, specified as a command list 'cmd', in a new process.
-
-    'cmd' is just the argument list for the new process, ie.
-    cmd[0] is the program to run and cmd[1:] are the rest of its arguments.
-    There is no way to run a program with a name different from that of its
-    executable.
-
-    If 'search_path' is true (the default), the system's executable
-    search path will be used to find the program; otherwise, cmd[0]
-    must be the exact path to the executable.  If 'dry_run' is true,
-    the command will not actually be run.
-
-    Raise DistutilsExecError if running the program fails in any way; just
-    return on success.
-    """
-    # cmd is documented as a list, but just in case some code passes a tuple
-    # in, protect our %-formatting code against horrible death
-    cmd = list(cmd)
-
-    log.info(subprocess.list2cmdline(cmd))
-    if dry_run:
-        return
-
-    if search_path:
-        executable = find_executable(cmd[0])
-        if executable is not None:
-            cmd[0] = executable
-
-    env = env if env is not None else dict(os.environ)
-
-    if sys.platform == 'darwin':
-        from distutils.util import MACOSX_VERSION_VAR, get_macosx_target_ver
-
-        macosx_target_ver = get_macosx_target_ver()
-        if macosx_target_ver:
-            env[MACOSX_VERSION_VAR] = macosx_target_ver
-
-    try:
-        proc = subprocess.Popen(cmd, env=env)
-        proc.wait()
-        exitcode = proc.returncode
-    except OSError as exc:
-        if not DEBUG:
-            cmd = cmd[0]
-        raise DistutilsExecError(
-            "command {!r} failed: {}".format(cmd, exc.args[-1])
-        ) from exc
-
-    if exitcode:
-        if not DEBUG:
-            cmd = cmd[0]
-        raise DistutilsExecError(
-            "command {!r} failed with exit code {}".format(cmd, exitcode)
-        )
-
-
-def find_executable(executable, path=None):
-    """Tries to find 'executable' in the directories listed in 'path'.
-
-    A string listing directories separated by 'os.pathsep'; defaults to
-    os.environ['PATH'].  Returns the complete filename or None if not found.
-    """
-    _, ext = os.path.splitext(executable)
-    if (sys.platform == 'win32') and (ext != '.exe'):
-        executable = executable + '.exe'
-
-    if os.path.isfile(executable):
-        return executable
-
-    if path is None:
-        path = os.environ.get('PATH', None)
-        if path is None:
-            try:
-                path = os.confstr("CS_PATH")
-            except (AttributeError, ValueError):
-                # os.confstr() or CS_PATH is not available
-                path = os.defpath
-        # bpo-35755: Don't use os.defpath if the PATH environment variable is
-        # set to an empty string
-
-    # PATH='' doesn't match, whereas PATH=':' looks in the current directory
-    if not path:
-        return None
-
-    paths = path.split(os.pathsep)
-    for p in paths:
-        f = os.path.join(p, executable)
-        if os.path.isfile(f):
-            # the file exists, we have a shot at spawn working
-            return f
-    return None

spaces/CVPR/LIVE/thrust/thrust/detail/reference.h

@@ -1,178 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed 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.
- */
-
-#pragma once
-
-#include <thrust/detail/config.h>
-#include <thrust/detail/type_traits.h>
-#include <thrust/detail/use_default.h>
-#include <thrust/detail/reference_forward_declaration.h>
-#include <ostream>
-
-
-namespace thrust
-{
-namespace detail
-{
-
-template<typename> struct is_wrapped_reference;
-
-}
-
-// the base type for all of thrust's system-annotated references.
-// for reasonable reference-like semantics, derived types must reimplement the following:
-// 1. constructor from pointer
-// 2. copy constructor
-// 3. templated copy constructor from other reference
-// 4. templated assignment from other reference
-// 5. assignment from value_type
-template<typename Element, typename Pointer, typename Derived>
-  class reference
-{
-  private:
-    typedef typename thrust::detail::eval_if<
-      thrust::detail::is_same<Derived,use_default>::value,
-      thrust::detail::identity_<reference>,
-      thrust::detail::identity_<Derived>
-    >::type derived_type;
-
-    // hint for is_wrapped_reference lets it know that this type (or a derived type)
-    // is a wrapped reference
-    struct wrapped_reference_hint {};
-    template<typename> friend struct thrust::detail::is_wrapped_reference;
-
-  public:
-    typedef Pointer                                              pointer;
-    typedef typename thrust::detail::remove_const<Element>::type value_type;
-
-    __host__ __device__
-    explicit reference(const pointer &ptr);
-
-#if THRUST_CPP_DIALECT >= 2011
-    reference(const reference &) = default;
-#endif
-
-    template<typename OtherElement, typename OtherPointer, typename OtherDerived>
-    __host__ __device__
-    reference(const reference<OtherElement,OtherPointer,OtherDerived> &other,
-              typename thrust::detail::enable_if_convertible<
-                typename reference<OtherElement,OtherPointer,OtherDerived>::pointer,
-                pointer
-              >::type * = 0);
-
-    __host__ __device__
-    derived_type &operator=(const reference &other);
-
-    // XXX this may need an enable_if
-    template<typename OtherElement, typename OtherPointer, typename OtherDerived>
-    __host__ __device__
-    derived_type &operator=(const reference<OtherElement,OtherPointer,OtherDerived> &other);
-
-    __host__ __device__
-    derived_type &operator=(const value_type &x);
-
-    __host__ __device__
-    pointer operator&() const;
-
-    __host__ __device__
-    operator value_type () const;
-
-    __host__ __device__
-    void swap(derived_type &other);
-
-    derived_type &operator++();
-
-    value_type operator++(int);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator+=(const value_type &rhs);
-
-    derived_type &operator--();
-
-    value_type operator--(int);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator-=(const value_type &rhs);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator*=(const value_type &rhs);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator/=(const value_type &rhs);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator%=(const value_type &rhs);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator<<=(const value_type &rhs);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator>>=(const value_type &rhs);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator&=(const value_type &rhs);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator|=(const value_type &rhs);
-
-    // XXX parameterize the type of rhs
-    derived_type &operator^=(const value_type &rhs);
-
-  private:
-    const pointer m_ptr;
-
-    // allow access to m_ptr for other references
-    template <typename OtherElement, typename OtherPointer, typename OtherDerived> friend class reference;
-
-    template<typename System>
-    __host__ __device__
-    inline value_type strip_const_get_value(const System &system) const;
-
-    template<typename OtherPointer>
-    __host__ __device__
-    inline void assign_from(OtherPointer src);
-
-    // XXX this helper exists only to avoid warnings about null references from the other assign_from
-    template<typename System1, typename System2, typename OtherPointer>
-    inline __host__ __device__
-    void assign_from(System1 *system1, System2 *system2, OtherPointer src);
-
-    template<typename System, typename OtherPointer>
-    __host__ __device__
-    inline void strip_const_assign_value(const System &system, OtherPointer src);
-
-    // XXX this helper exists only to avoid warnings about null references from the other swap
-    template<typename System>
-    inline __host__ __device__
-    void swap(System *system, derived_type &other);
-
-    // XXX this helper exists only to avoid warnings about null references from operator value_type ()
-    template<typename System>
-    inline __host__ __device__
-    value_type convert_to_value_type(System *system) const;
-}; // end reference
-
-// Output stream operator
-template<typename Element, typename Pointer, typename Derived,
-         typename charT, typename traits>
-std::basic_ostream<charT, traits> &
-operator<<(std::basic_ostream<charT, traits> &os,
-           const reference<Element, Pointer, Derived> &y);
-
-} // end thrust
-
-#include <thrust/detail/reference.inl>
-

spaces/CVPR/LIVE/thrust/thrust/partition.h

@@ -1,1439 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed 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.
- */
-
-
-/*! \file partition.h
- *  \brief Reorganizes a range based on a predicate
- */
-
-#pragma once
-
-#include <thrust/detail/config.h>
-#include <thrust/detail/execution_policy.h>
-#include <thrust/pair.h>
-
-namespace thrust
-{
-
-
-/*! \addtogroup reordering
- *  \ingroup algorithms
- *
- *  \addtogroup partitioning
- *  \ingroup reordering
- *  \{
- */
-
-
-/*! \p partition reorders the elements <tt>[first, last)</tt> based on the function
- *  object \p pred, such that all of the elements that satisfy \p pred precede the
- *  elements that fail to satisfy it. The postcondition is that, for some iterator
- *  \c middle in the range <tt>[first, last)</tt>, <tt>pred(*i)</tt> is \c true for every
- *  iterator \c i in the range <tt>[first,middle)</tt> and \c false for every iterator
- *  \c i in the range <tt>[middle, last)</tt>. The return value of \p partition is
- *  \c middle.
- *
- *  Note that the relative order of elements in the two reordered sequences is not
- *  necessarily the same as it was in the original sequence. A different algorithm,
- *  \p stable_partition, does guarantee to preserve the relative order.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The beginning of the sequence to reorder.
- *  \param last The end of the sequence to reorder.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return An iterator referring to the first element of the second partition, that is,
- *          the sequence of the elements which do not satisfy \p pred.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator's \c value_type is convertible to \p Predicate's \c argument_type,
- *          and \p ForwardIterator is mutable.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  The following code snippet demonstrates how to use \p partition to reorder a
- *  sequence so that even numbers precede odd numbers using the \p thrust::host execution policy for parallelization:
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/execution_policy.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  const int N = sizeof(A)/sizeof(int);
- *  thrust::partition(thrust::host,
- *                    A, A + N,
- *                    is_even());
- *  // A is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \see http://www.sgi.com/tech/stl/partition.html
- *  \see \p stable_partition
- *  \see \p partition_copy
- */
-template<typename DerivedPolicy,
-         typename ForwardIterator,
-         typename Predicate>
-__host__ __device__
-  ForwardIterator partition(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                            ForwardIterator first,
-                            ForwardIterator last,
-                            Predicate pred);
-
-
-/*! \p partition reorders the elements <tt>[first, last)</tt> based on the function
- *  object \p pred, such that all of the elements that satisfy \p pred precede the
- *  elements that fail to satisfy it. The postcondition is that, for some iterator
- *  \c middle in the range <tt>[first, last)</tt>, <tt>pred(*i)</tt> is \c true for every
- *  iterator \c i in the range <tt>[first,middle)</tt> and \c false for every iterator
- *  \c i in the range <tt>[middle, last)</tt>. The return value of \p partition is
- *  \c middle.
- *
- *  Note that the relative order of elements in the two reordered sequences is not
- *  necessarily the same as it was in the original sequence. A different algorithm,
- *  \p stable_partition, does guarantee to preserve the relative order.
- *
- *  \param first The beginning of the sequence to reorder.
- *  \param last The end of the sequence to reorder.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return An iterator referring to the first element of the second partition, that is,
- *          the sequence of the elements which do not satisfy \p pred.
- *
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator's \c value_type is convertible to \p Predicate's \c argument_type,
- *          and \p ForwardIterator is mutable.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  The following code snippet demonstrates how to use \p partition to reorder a
- *  sequence so that even numbers precede odd numbers.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  const int N = sizeof(A)/sizeof(int);
- *  thrust::partition(A, A + N,
- *                     is_even());
- *  // A is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \see http://www.sgi.com/tech/stl/partition.html
- *  \see \p stable_partition
- *  \see \p partition_copy
- */
-template<typename ForwardIterator,
-         typename Predicate>
-  ForwardIterator partition(ForwardIterator first,
-                            ForwardIterator last,
-                            Predicate pred);
-
-
-/*! \p partition reorders the elements <tt>[first, last)</tt> based on the function
- *  object \p pred applied to a stencil range <tt>[stencil, stencil + (last - first))</tt>,
- *  such that all of the elements whose corresponding stencil element satisfies \p pred precede all of the elements whose
- *  corresponding stencil element fails to satisfy it. The postcondition is that, for some iterator
- *  \c middle in the range <tt>[first, last)</tt>, <tt>pred(*stencil_i)</tt> is \c true for every iterator
- *  \c stencil_i in the range <tt>[stencil,stencil + (middle - first))</tt> and \c false for every iterator \c stencil_i
- *  in the range <tt>[stencil + (middle - first), stencil + (last - first))</tt>.
- *  The return value of \p stable_partition is \c middle.
- *
- *  Note that the relative order of elements in the two reordered sequences is not
- *  necessarily the same as it was in the original sequence. A different algorithm,
- *  \p stable_partition, does guarantee to preserve the relative order.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The beginning of the sequence to reorder.
- *  \param last The end of the sequence to reorder.
- *  \param stencil The beginning of the stencil sequence.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return An iterator referring to the first element of the second partition, that is,
- *          the sequence of the elements whose stencil elements do not satisfy \p pred.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator is mutable.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The ranges <tt>[first,last)</tt> and <tt>[stencil, stencil + (last - first))</tt> shall not overlap.
- *
- *  The following code snippet demonstrates how to use \p partition to reorder a
- *  sequence so that even numbers precede odd numbers using the \p thrust::host execution policy for parallelization:
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/execution_policy.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {0, 1, 0, 1, 0, 1, 0, 1, 0,  1};
- *  int S[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  const int N = sizeof(A)/sizeof(int);
- *  thrust::partition(thrust::host, A, A + N, S, is_even());
- *  // A is now {1, 1, 1, 1, 1, 0, 0, 0, 0, 0}
- *  // S is unmodified
- *  \endcode
- *
- *  \see http://www.sgi.com/tech/stl/partition.html
- *  \see \p stable_partition
- *  \see \p partition_copy
- */
-template<typename DerivedPolicy,
-         typename ForwardIterator,
-         typename InputIterator,
-         typename Predicate>
-__host__ __device__
-  ForwardIterator partition(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                            ForwardIterator first,
-                            ForwardIterator last,
-                            InputIterator stencil,
-                            Predicate pred);
-
-
-/*! \p partition reorders the elements <tt>[first, last)</tt> based on the function
- *  object \p pred applied to a stencil range <tt>[stencil, stencil + (last - first))</tt>,
- *  such that all of the elements whose corresponding stencil element satisfies \p pred precede all of the elements whose
- *  corresponding stencil element fails to satisfy it. The postcondition is that, for some iterator
- *  \c middle in the range <tt>[first, last)</tt>, <tt>pred(*stencil_i)</tt> is \c true for every iterator
- *  \c stencil_i in the range <tt>[stencil,stencil + (middle - first))</tt> and \c false for every iterator \c stencil_i
- *  in the range <tt>[stencil + (middle - first), stencil + (last - first))</tt>.
- *  The return value of \p stable_partition is \c middle.
- *
- *  Note that the relative order of elements in the two reordered sequences is not
- *  necessarily the same as it was in the original sequence. A different algorithm,
- *  \p stable_partition, does guarantee to preserve the relative order.
- *
- *  \param first The beginning of the sequence to reorder.
- *  \param last The end of the sequence to reorder.
- *  \param stencil The beginning of the stencil sequence.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return An iterator referring to the first element of the second partition, that is,
- *          the sequence of the elements whose stencil elements do not satisfy \p pred.
- *
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator is mutable.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The ranges <tt>[first,last)</tt> and <tt>[stencil, stencil + (last - first))</tt> shall not overlap.
- *
- *  The following code snippet demonstrates how to use \p partition to reorder a
- *  sequence so that even numbers precede odd numbers.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {0, 1, 0, 1, 0, 1, 0, 1, 0,  1};
- *  int S[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  const int N = sizeof(A)/sizeof(int);
- *  thrust::partition(A, A + N, S, is_even());
- *  // A is now {1, 1, 1, 1, 1, 0, 0, 0, 0, 0}
- *  // S is unmodified
- *  \endcode
- *
- *  \see http://www.sgi.com/tech/stl/partition.html
- *  \see \p stable_partition
- *  \see \p partition_copy
- */
-template<typename ForwardIterator,
-         typename InputIterator,
-         typename Predicate>
-  ForwardIterator partition(ForwardIterator first,
-                            ForwardIterator last,
-                            InputIterator stencil,
-                            Predicate pred);
-
-
-/*! \p partition_copy differs from \p partition only in that the reordered
- *  sequence is written to difference output sequences, rather than in place.
- *
- *  \p partition_copy copies the elements <tt>[first, last)</tt> based on the
- *  function object \p pred. All of the elements that satisfy \p pred are copied
- *  to the range beginning at \p out_true and all the elements that fail to satisfy it
- *  are copied to the range beginning at \p out_false.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The beginning of the sequence to reorder.
- *  \param last The end of the sequence to reorder.
- *  \param out_true The destination of the resulting sequence of elements which satisfy \p pred.
- *  \param out_false The destination of the resulting sequence of elements which fail to satisfy \p pred.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return A \p pair p such that <tt>p.first</tt> is the end of the output range beginning
- *          at \p out_true and <tt>p.second</tt> is the end of the output range beginning at
- *          \p out_false.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type and \p InputIterator's \c value_type
- *          is convertible to \p OutputIterator1 and \p OutputIterator2's \c value_types.
- *  \tparam OutputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam OutputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The input range shall not overlap with either output range.
- *
- *  The following code snippet demonstrates how to use \p partition_copy to separate a
- *  sequence into two output sequences of even and odd numbers using the \p thrust::host execution policy for parallelization:
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/execution_policy.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  int result[10];
- *  const int N = sizeof(A)/sizeof(int);
- *  int *evens = result;
- *  int *odds  = result + 5;
- *  thrust::partition_copy(thrust::host, A, A + N, evens, odds, is_even());
- *  // A remains {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
- *  // result is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  // evens points to {2, 4, 6, 8, 10}
- *  // odds points to {1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \note The relative order of elements in the two reordered sequences is not
- *  necessarily the same as it was in the original sequence. A different algorithm,
- *  \p stable_partition_copy, does guarantee to preserve the relative order.
- *
- *  \see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf
- *  \see \p stable_partition_copy
- *  \see \p partition
- */
-template<typename DerivedPolicy,
-         typename InputIterator,
-         typename OutputIterator1,
-         typename OutputIterator2,
-         typename Predicate>
-__host__ __device__
-  thrust::pair<OutputIterator1,OutputIterator2>
-    partition_copy(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                   InputIterator first,
-                   InputIterator last,
-                   OutputIterator1 out_true,
-                   OutputIterator2 out_false,
-                   Predicate pred);
-
-
-/*! \p partition_copy differs from \p partition only in that the reordered
- *  sequence is written to difference output sequences, rather than in place.
- *
- *  \p partition_copy copies the elements <tt>[first, last)</tt> based on the
- *  function object \p pred. All of the elements that satisfy \p pred are copied
- *  to the range beginning at \p out_true and all the elements that fail to satisfy it
- *  are copied to the range beginning at \p out_false.
- *
- *  \param first The beginning of the sequence to reorder.
- *  \param last The end of the sequence to reorder.
- *  \param out_true The destination of the resulting sequence of elements which satisfy \p pred.
- *  \param out_false The destination of the resulting sequence of elements which fail to satisfy \p pred.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return A \p pair p such that <tt>p.first</tt> is the end of the output range beginning
- *          at \p out_true and <tt>p.second</tt> is the end of the output range beginning at
- *          \p out_false.
- *
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type and \p InputIterator's \c value_type
- *          is convertible to \p OutputIterator1 and \p OutputIterator2's \c value_types.
- *  \tparam OutputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam OutputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The input range shall not overlap with either output range.
- *
- *  The following code snippet demonstrates how to use \p partition_copy to separate a
- *  sequence into two output sequences of even and odd numbers.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  int result[10];
- *  const int N = sizeof(A)/sizeof(int);
- *  int *evens = result;
- *  int *odds  = result + 5;
- *  thrust::partition_copy(A, A + N, evens, odds, is_even());
- *  // A remains {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
- *  // result is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  // evens points to {2, 4, 6, 8, 10}
- *  // odds points to {1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \note The relative order of elements in the two reordered sequences is not
- *  necessarily the same as it was in the original sequence. A different algorithm,
- *  \p stable_partition_copy, does guarantee to preserve the relative order.
- *
- *  \see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf
- *  \see \p stable_partition_copy
- *  \see \p partition
- */
-template<typename InputIterator,
-         typename OutputIterator1,
-         typename OutputIterator2,
-         typename Predicate>
-  thrust::pair<OutputIterator1,OutputIterator2>
-    partition_copy(InputIterator first,
-                   InputIterator last,
-                   OutputIterator1 out_true,
-                   OutputIterator2 out_false,
-                   Predicate pred);
-
-
-/*! \p partition_copy differs from \p partition only in that the reordered
- *  sequence is written to difference output sequences, rather than in place.
- *
- *  \p partition_copy copies the elements <tt>[first, last)</tt> based on the
- *  function object \p pred which is applied to a range of stencil elements. All of the elements
- *  whose corresponding stencil element satisfies \p pred are copied to the range beginning at \p out_true
- *  and all the elements whose stencil element fails to satisfy it are copied to the range beginning
- *  at \p out_false.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The beginning of the sequence to reorder.
- *  \param last The end of the sequence to reorder.
- *  \param stencil The beginning of the stencil sequence.
- *  \param out_true The destination of the resulting sequence of elements which satisfy \p pred.
- *  \param out_false The destination of the resulting sequence of elements which fail to satisfy \p pred.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return A \p pair p such that <tt>p.first</tt> is the end of the output range beginning
- *          at \p out_true and <tt>p.second</tt> is the end of the output range beginning at
- *          \p out_false.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p OutputIterator1 and \p OutputIterator2's \c value_types.
- *  \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator2's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam OutputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam OutputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The input ranges shall not overlap with either output range.
- *
- *  The following code snippet demonstrates how to use \p partition_copy to separate a
- *  sequence into two output sequences of even and odd numbers using the \p thrust::host execution
- *  policy for parallelization.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/functional.h>
- *  #include <thrust/execution_policy.h>
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  int S[] = {0, 1, 0, 1, 0, 1, 0, 1, 0,  1};
- *  int result[10];
- *  const int N = sizeof(A)/sizeof(int);
- *  int *evens = result;
- *  int *odds  = result + 5;
- *  thrust::stable_partition_copy(thrust::host, A, A + N, S, evens, odds, thrust::identity<int>());
- *  // A remains {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
- *  // S remains {0, 1, 0, 1, 0, 1, 0, 1, 0,  1}
- *  // result is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  // evens points to {2, 4, 6, 8, 10}
- *  // odds points to {1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \note The relative order of elements in the two reordered sequences is not
- *  necessarily the same as it was in the original sequence. A different algorithm,
- *  \p stable_partition_copy, does guarantee to preserve the relative order.
- *
- *  \see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf
- *  \see \p stable_partition_copy
- *  \see \p partition
- */
-template<typename DerivedPolicy,
-         typename InputIterator1,
-         typename InputIterator2,
-         typename OutputIterator1,
-         typename OutputIterator2,
-         typename Predicate>
-__host__ __device__
-  thrust::pair<OutputIterator1,OutputIterator2>
-    partition_copy(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                   InputIterator1 first,
-                   InputIterator1 last,
-                   InputIterator2 stencil,
-                   OutputIterator1 out_true,
-                   OutputIterator2 out_false,
-                   Predicate pred);
-
-
-/*! \p partition_copy differs from \p partition only in that the reordered
- *  sequence is written to difference output sequences, rather than in place.
- *
- *  \p partition_copy copies the elements <tt>[first, last)</tt> based on the
- *  function object \p pred which is applied to a range of stencil elements. All of the elements
- *  whose corresponding stencil element satisfies \p pred are copied to the range beginning at \p out_true
- *  and all the elements whose stencil element fails to satisfy it are copied to the range beginning
- *  at \p out_false.
- *
- *  \param first The beginning of the sequence to reorder.
- *  \param last The end of the sequence to reorder.
- *  \param stencil The beginning of the stencil sequence.
- *  \param out_true The destination of the resulting sequence of elements which satisfy \p pred.
- *  \param out_false The destination of the resulting sequence of elements which fail to satisfy \p pred.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return A \p pair p such that <tt>p.first</tt> is the end of the output range beginning
- *          at \p out_true and <tt>p.second</tt> is the end of the output range beginning at
- *          \p out_false.
- *
- *  \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p OutputIterator1 and \p OutputIterator2's \c value_types.
- *  \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator2's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam OutputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam OutputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The input ranges shall not overlap with either output range.
- *
- *  The following code snippet demonstrates how to use \p partition_copy to separate a
- *  sequence into two output sequences of even and odd numbers.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/functional.h>
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  int S[] = {0, 1, 0, 1, 0, 1, 0, 1, 0,  1};
- *  int result[10];
- *  const int N = sizeof(A)/sizeof(int);
- *  int *evens = result;
- *  int *odds  = result + 5;
- *  thrust::stable_partition_copy(A, A + N, S, evens, odds, thrust::identity<int>());
- *  // A remains {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
- *  // S remains {0, 1, 0, 1, 0, 1, 0, 1, 0,  1}
- *  // result is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  // evens points to {2, 4, 6, 8, 10}
- *  // odds points to {1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \note The relative order of elements in the two reordered sequences is not
- *  necessarily the same as it was in the original sequence. A different algorithm,
- *  \p stable_partition_copy, does guarantee to preserve the relative order.
- *
- *  \see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf
- *  \see \p stable_partition_copy
- *  \see \p partition
- */
-template<typename InputIterator1,
-         typename InputIterator2,
-         typename OutputIterator1,
-         typename OutputIterator2,
-         typename Predicate>
-  thrust::pair<OutputIterator1,OutputIterator2>
-    partition_copy(InputIterator1 first,
-                   InputIterator1 last,
-                   InputIterator2 stencil,
-                   OutputIterator1 out_true,
-                   OutputIterator2 out_false,
-                   Predicate pred);
-
-
-/*! \p stable_partition is much like \p partition : it reorders the elements in the
- *  range <tt>[first, last)</tt> based on the function object \p pred, such that all of
- *  the elements that satisfy \p pred precede all of the elements that fail to satisfy
- *  it. The postcondition is that, for some iterator \p middle in the range
- *  <tt>[first, last)</tt>, <tt>pred(*i)</tt> is \c true for every iterator \c i in the
- *  range <tt>[first,middle)</tt> and \c false for every iterator \c i in the range
- *  <tt>[middle, last)</tt>. The return value of \p stable_partition is \c middle.
- *
- *  \p stable_partition differs from \p partition in that \p stable_partition is
- *  guaranteed to preserve relative order. That is, if \c x and \c y are elements in
- *  <tt>[first, last)</tt>, and \c stencil_x and \c stencil_y are the stencil elements
- *  in corresponding positions within <tt>[stencil, stencil + (last - first))</tt>,
- *  and <tt>pred(stencil_x) == pred(stencil_y)</tt>, and if \c x precedes
- *  \c y, then it will still be true after \p stable_partition that \c x precedes \c y.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The first element of the sequence to reorder.
- *  \param last One position past the last element of the sequence to reorder.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return An iterator referring to the first element of the second partition, that is,
- *          the sequence of the elements which do not satisfy pred.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator's \c value_type is convertible to \p Predicate's \c argument_type,
- *          and \p ForwardIterator is mutable.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  The following code snippet demonstrates how to use \p stable_partition to reorder a
- *  sequence so that even numbers precede odd numbers using the \p thrust::host execution policy for parallelization:
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/execution_policy.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  const int N = sizeof(A)/sizeof(int);
- *  thrust::stable_partition(thrust::host,
- *                           A, A + N,
- *                           is_even());
- *  // A is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \see http://www.sgi.com/tech/stl/stable_partition.html
- *  \see \p partition
- *  \see \p stable_partition_copy
- */
-template<typename DerivedPolicy,
-         typename ForwardIterator,
-         typename Predicate>
-__host__ __device__
-  ForwardIterator stable_partition(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                                   ForwardIterator first,
-                                   ForwardIterator last,
-                                   Predicate pred);
-
-
-/*! \p stable_partition is much like \p partition : it reorders the elements in the
- *  range <tt>[first, last)</tt> based on the function object \p pred, such that all of
- *  the elements that satisfy \p pred precede all of the elements that fail to satisfy
- *  it. The postcondition is that, for some iterator \p middle in the range
- *  <tt>[first, last)</tt>, <tt>pred(*i)</tt> is \c true for every iterator \c i in the
- *  range <tt>[first,middle)</tt> and \c false for every iterator \c i in the range
- *  <tt>[middle, last)</tt>. The return value of \p stable_partition is \c middle.
- *
- *  \p stable_partition differs from \p partition in that \p stable_partition is
- *  guaranteed to preserve relative order. That is, if \c x and \c y are elements in
- *  <tt>[first, last)</tt>, and \c stencil_x and \c stencil_y are the stencil elements
- *  in corresponding positions within <tt>[stencil, stencil + (last - first))</tt>,
- *  and <tt>pred(stencil_x) == pred(stencil_y)</tt>, and if \c x precedes
- *  \c y, then it will still be true after \p stable_partition that \c x precedes \c y.
- *
- *  \param first The first element of the sequence to reorder.
- *  \param last One position past the last element of the sequence to reorder.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return An iterator referring to the first element of the second partition, that is,
- *          the sequence of the elements which do not satisfy pred.
- *
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator's \c value_type is convertible to \p Predicate's \c argument_type,
- *          and \p ForwardIterator is mutable.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  The following code snippet demonstrates how to use \p stable_partition to reorder a
- *  sequence so that even numbers precede odd numbers.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  const int N = sizeof(A)/sizeof(int);
- *  thrust::stable_partition(A, A + N,
- *                            is_even());
- *  // A is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \see http://www.sgi.com/tech/stl/stable_partition.html
- *  \see \p partition
- *  \see \p stable_partition_copy
- */
-template<typename ForwardIterator,
-         typename Predicate>
-  ForwardIterator stable_partition(ForwardIterator first,
-                                   ForwardIterator last,
-                                   Predicate pred);
-
-
-/*! \p stable_partition is much like \p partition: it reorders the elements in the
- *  range <tt>[first, last)</tt> based on the function object \p pred applied to a stencil
- *  range <tt>[stencil, stencil + (last - first))</tt>, such that all of
- *  the elements whose corresponding stencil element satisfies \p pred precede all of the elements whose
- *  corresponding stencil element fails to satisfy it. The postcondition is that, for some iterator
- *  \c middle in the range <tt>[first, last)</tt>, <tt>pred(*stencil_i)</tt> is \c true for every iterator
- *  \c stencil_i in the range <tt>[stencil,stencil + (middle - first))</tt> and \c false for every iterator \c stencil_i
- *  in the range <tt>[stencil + (middle - first), stencil + (last - first))</tt>.
- *  The return value of \p stable_partition is \c middle.
- *
- *  \p stable_partition differs from \p partition in that \p stable_partition is
- *  guaranteed to preserve relative order. That is, if \c x and \c y are elements in
- *  <tt>[first, last)</tt>, such that <tt>pred(x) == pred(y)</tt>, and if \c x precedes
- *  \c y, then it will still be true after \p stable_partition that \c x precedes \c y.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The first element of the sequence to reorder.
- *  \param last One position past the last element of the sequence to reorder.
- *  \param stencil The beginning of the stencil sequence.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return An iterator referring to the first element of the second partition, that is,
- *          the sequence of the elements whose stencil elements do not satisfy \p pred.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator is mutable.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The range <tt>[first, last)</tt> shall not overlap with the range <tt>[stencil, stencil + (last - first))</tt>.
- *
- *  The following code snippet demonstrates how to use \p stable_partition to reorder a
- *  sequence so that even numbers precede odd numbers using the \p thrust::host execution policy for parallelization:
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/execution_policy.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {0, 1, 0, 1, 0, 1, 0, 1, 0,  1};
- *  int S[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  const int N = sizeof(A)/sizeof(int);
- *  thrust::stable_partition(thrust::host, A, A + N, S, is_even());
- *  // A is now {1, 1, 1, 1, 1, 0, 0, 0, 0, 0}
- *  // S is unmodified
- *  \endcode
- *
- *  \see http://www.sgi.com/tech/stl/stable_partition.html
- *  \see \p partition
- *  \see \p stable_partition_copy
- */
-template<typename DerivedPolicy,
-         typename ForwardIterator,
-         typename InputIterator,
-         typename Predicate>
-__host__ __device__
-  ForwardIterator stable_partition(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                                   ForwardIterator first,
-                                   ForwardIterator last,
-                                   InputIterator stencil,
-                                   Predicate pred);
-
-
-/*! \p stable_partition is much like \p partition: it reorders the elements in the
- *  range <tt>[first, last)</tt> based on the function object \p pred applied to a stencil
- *  range <tt>[stencil, stencil + (last - first))</tt>, such that all of
- *  the elements whose corresponding stencil element satisfies \p pred precede all of the elements whose
- *  corresponding stencil element fails to satisfy it. The postcondition is that, for some iterator
- *  \c middle in the range <tt>[first, last)</tt>, <tt>pred(*stencil_i)</tt> is \c true for every iterator
- *  \c stencil_i in the range <tt>[stencil,stencil + (middle - first))</tt> and \c false for every iterator \c stencil_i
- *  in the range <tt>[stencil + (middle - first), stencil + (last - first))</tt>.
- *  The return value of \p stable_partition is \c middle.
- *
- *  \p stable_partition differs from \p partition in that \p stable_partition is
- *  guaranteed to preserve relative order. That is, if \c x and \c y are elements in
- *  <tt>[first, last)</tt>, such that <tt>pred(x) == pred(y)</tt>, and if \c x precedes
- *  \c y, then it will still be true after \p stable_partition that \c x precedes \c y.
- *
- *  \param first The first element of the sequence to reorder.
- *  \param last One position past the last element of the sequence to reorder.
- *  \param stencil The beginning of the stencil sequence.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return An iterator referring to the first element of the second partition, that is,
- *          the sequence of the elements whose stencil elements do not satisfy \p pred.
- *
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator is mutable.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The range <tt>[first, last)</tt> shall not overlap with the range <tt>[stencil, stencil + (last - first))</tt>.
- *
- *  The following code snippet demonstrates how to use \p stable_partition to reorder a
- *  sequence so that even numbers precede odd numbers.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {0, 1, 0, 1, 0, 1, 0, 1, 0,  1};
- *  int S[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  const int N = sizeof(A)/sizeof(int);
- *  thrust::stable_partition(A, A + N, S, is_even());
- *  // A is now {1, 1, 1, 1, 1, 0, 0, 0, 0, 0}
- *  // S is unmodified
- *  \endcode
- *
- *  \see http://www.sgi.com/tech/stl/stable_partition.html
- *  \see \p partition
- *  \see \p stable_partition_copy
- */
-template<typename ForwardIterator,
-         typename InputIterator,
-         typename Predicate>
-  ForwardIterator stable_partition(ForwardIterator first,
-                                   ForwardIterator last,
-                                   InputIterator stencil,
-                                   Predicate pred);
-
-
-/*! \p stable_partition_copy differs from \p stable_partition only in that the reordered
- *  sequence is written to different output sequences, rather than in place.
- *
- *  \p stable_partition_copy copies the elements <tt>[first, last)</tt> based on the
- *  function object \p pred. All of the elements that satisfy \p pred are copied
- *  to the range beginning at \p out_true and all the elements that fail to satisfy it
- *  are copied to the range beginning at \p out_false.
- *
- *  \p stable_partition_copy differs from \p partition_copy in that
- *  \p stable_partition_copy is guaranteed to preserve relative order. That is, if
- *  \c x and \c y are elements in <tt>[first, last)</tt>, such that
- *  <tt>pred(x) == pred(y)</tt>, and if \c x precedes \c y, then it will still be true
- *  after \p stable_partition_copy that \c x precedes \c y in the output.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The first element of the sequence to reorder.
- *  \param last One position past the last element of the sequence to reorder.
- *  \param out_true The destination of the resulting sequence of elements which satisfy \p pred.
- *  \param out_false The destination of the resulting sequence of elements which fail to satisfy \p pred.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return A \p pair p such that <tt>p.first</tt> is the end of the output range beginning
- *          at \p out_true and <tt>p.second</tt> is the end of the output range beginning at
- *          \p out_false.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type and \p InputIterator's \c value_type
- *          is convertible to \p OutputIterator1 and \p OutputIterator2's \c value_types.
- *  \tparam OutputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam OutputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The input ranges shall not overlap with either output range.
- *
- *  The following code snippet demonstrates how to use \p stable_partition_copy to
- *  reorder a sequence so that even numbers precede odd numbers using the \p thrust::host execution policy for parallelization:
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/execution_policy.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  int result[10];
- *  const int N = sizeof(A)/sizeof(int);
- *  int *evens = result;
- *  int *odds  = result + 5;
- *  thrust::stable_partition_copy(thrust::host, A, A + N, evens, odds, is_even());
- *  // A remains {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
- *  // result is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  // evens points to {2, 4, 6, 8, 10}
- *  // odds points to {1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf
- *  \see \p partition_copy
- *  \see \p stable_partition
- */
-template<typename DerivedPolicy,
-         typename InputIterator,
-         typename OutputIterator1,
-         typename OutputIterator2,
-         typename Predicate>
-__host__ __device__
-  thrust::pair<OutputIterator1,OutputIterator2>
-    stable_partition_copy(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                          InputIterator first,
-                          InputIterator last,
-                          OutputIterator1 out_true,
-                          OutputIterator2 out_false,
-                          Predicate pred);
-
-
-/*! \p stable_partition_copy differs from \p stable_partition only in that the reordered
- *  sequence is written to different output sequences, rather than in place.
- *
- *  \p stable_partition_copy copies the elements <tt>[first, last)</tt> based on the
- *  function object \p pred. All of the elements that satisfy \p pred are copied
- *  to the range beginning at \p out_true and all the elements that fail to satisfy it
- *  are copied to the range beginning at \p out_false.
- *
- *  \p stable_partition_copy differs from \p partition_copy in that
- *  \p stable_partition_copy is guaranteed to preserve relative order. That is, if
- *  \c x and \c y are elements in <tt>[first, last)</tt>, such that
- *  <tt>pred(x) == pred(y)</tt>, and if \c x precedes \c y, then it will still be true
- *  after \p stable_partition_copy that \c x precedes \c y in the output.
- *
- *  \param first The first element of the sequence to reorder.
- *  \param last One position past the last element of the sequence to reorder.
- *  \param out_true The destination of the resulting sequence of elements which satisfy \p pred.
- *  \param out_false The destination of the resulting sequence of elements which fail to satisfy \p pred.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return A \p pair p such that <tt>p.first</tt> is the end of the output range beginning
- *          at \p out_true and <tt>p.second</tt> is the end of the output range beginning at
- *          \p out_false.
- *
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type and \p InputIterator's \c value_type
- *          is convertible to \p OutputIterator1 and \p OutputIterator2's \c value_types.
- *  \tparam OutputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam OutputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The input ranges shall not overlap with either output range.
- *
- *  The following code snippet demonstrates how to use \p stable_partition_copy to
- *  reorder a sequence so that even numbers precede odd numbers.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  ...
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  int result[10];
- *  const int N = sizeof(A)/sizeof(int);
- *  int *evens = result;
- *  int *odds  = result + 5;
- *  thrust::stable_partition_copy(A, A + N, evens, odds, is_even());
- *  // A remains {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
- *  // result is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  // evens points to {2, 4, 6, 8, 10}
- *  // odds points to {1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf
- *  \see \p partition_copy
- *  \see \p stable_partition
- */
-template<typename InputIterator,
-         typename OutputIterator1,
-         typename OutputIterator2,
-         typename Predicate>
-  thrust::pair<OutputIterator1,OutputIterator2>
-    stable_partition_copy(InputIterator first,
-                          InputIterator last,
-                          OutputIterator1 out_true,
-                          OutputIterator2 out_false,
-                          Predicate pred);
-
-
-/*! \p stable_partition_copy differs from \p stable_partition only in that the reordered
- *  sequence is written to different output sequences, rather than in place.
- *
- *  \p stable_partition_copy copies the elements <tt>[first, last)</tt> based on the
- *  function object \p pred which is applied to a range of stencil elements. All of the elements
- *  whose corresponding stencil element satisfies \p pred are copied to the range beginning at \p out_true
- *  and all the elements whose stencil element fails to satisfy it are copied to the range beginning
- *  at \p out_false.
- *
- *  \p stable_partition_copy differs from \p partition_copy in that
- *  \p stable_partition_copy is guaranteed to preserve relative order. That is, if
- *  \c x and \c y are elements in <tt>[first, last)</tt>, such that
- *  <tt>pred(x) == pred(y)</tt>, and if \c x precedes \c y, then it will still be true
- *  after \p stable_partition_copy that \c x precedes \c y in the output.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The first element of the sequence to reorder.
- *  \param last One position past the last element of the sequence to reorder.
- *  \param stencil The beginning of the stencil sequence.
- *  \param out_true The destination of the resulting sequence of elements which satisfy \p pred.
- *  \param out_false The destination of the resulting sequence of elements which fail to satisfy \p pred.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return A \p pair p such that <tt>p.first</tt> is the end of the output range beginning
- *          at \p out_true and <tt>p.second</tt> is the end of the output range beginning at
- *          \p out_false.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p OutputIterator1 and \p OutputIterator2's \c value_types.
- *  \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator2's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam OutputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam OutputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The input ranges shall not overlap with either output range.
- *
- *  The following code snippet demonstrates how to use \p stable_partition_copy to
- *  reorder a sequence so that even numbers precede odd numbers using the \p thrust::host execution policy for parallelization:
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/functional.h>
- *  #include <thrust/execution_policy.h>
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  int S[] = {0, 1, 0, 1, 0, 1, 0, 1, 0,  1};
- *  int result[10];
- *  const int N = sizeof(A)/sizeof(int);
- *  int *evens = result;
- *  int *odds  = result + 5;
- *  thrust::stable_partition_copy(thrust::host, A, A + N, S, evens, odds, thrust::identity<int>());
- *  // A remains {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
- *  // S remains {0, 1, 0, 1, 0, 1, 0, 1, 0,  1}
- *  // result is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  // evens points to {2, 4, 6, 8, 10}
- *  // odds points to {1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf
- *  \see \p partition_copy
- *  \see \p stable_partition
- */
-template<typename DerivedPolicy,
-         typename InputIterator1,
-         typename InputIterator2,
-         typename OutputIterator1,
-         typename OutputIterator2,
-         typename Predicate>
-__host__ __device__
-  thrust::pair<OutputIterator1,OutputIterator2>
-    stable_partition_copy(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                          InputIterator1 first,
-                          InputIterator1 last,
-                          InputIterator2 stencil,
-                          OutputIterator1 out_true,
-                          OutputIterator2 out_false,
-                          Predicate pred);
-
-
-/*! \p stable_partition_copy differs from \p stable_partition only in that the reordered
- *  sequence is written to different output sequences, rather than in place.
- *
- *  \p stable_partition_copy copies the elements <tt>[first, last)</tt> based on the
- *  function object \p pred which is applied to a range of stencil elements. All of the elements
- *  whose corresponding stencil element satisfies \p pred are copied to the range beginning at \p out_true
- *  and all the elements whose stencil element fails to satisfy it are copied to the range beginning
- *  at \p out_false.
- *
- *  \p stable_partition_copy differs from \p partition_copy in that
- *  \p stable_partition_copy is guaranteed to preserve relative order. That is, if
- *  \c x and \c y are elements in <tt>[first, last)</tt>, such that
- *  <tt>pred(x) == pred(y)</tt>, and if \c x precedes \c y, then it will still be true
- *  after \p stable_partition_copy that \c x precedes \c y in the output.
- *
- *  \param first The first element of the sequence to reorder.
- *  \param last One position past the last element of the sequence to reorder.
- *  \param stencil The beginning of the stencil sequence.
- *  \param out_true The destination of the resulting sequence of elements which satisfy \p pred.
- *  \param out_false The destination of the resulting sequence of elements which fail to satisfy \p pred.
- *  \param pred A function object which decides to which partition each element of the
- *              sequence <tt>[first, last)</tt> belongs.
- *  \return A \p pair p such that <tt>p.first</tt> is the end of the output range beginning
- *          at \p out_true and <tt>p.second</tt> is the end of the output range beginning at
- *          \p out_false.
- *
- *  \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p OutputIterator1 and \p OutputIterator2's \c value_types.
- *  \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
- *          and \p InputIterator2's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam OutputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam OutputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The input ranges shall not overlap with either output range.
- *
- *  The following code snippet demonstrates how to use \p stable_partition_copy to
- *  reorder a sequence so that even numbers precede odd numbers.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/functional.h>
- *  ...
- *  int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *  int S[] = {0, 1, 0, 1, 0, 1, 0, 1, 0,  1};
- *  int result[10];
- *  const int N = sizeof(A)/sizeof(int);
- *  int *evens = result;
- *  int *odds  = result + 5;
- *  thrust::stable_partition_copy(A, A + N, S, evens, odds, thrust::identity<int>());
- *  // A remains {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
- *  // S remains {0, 1, 0, 1, 0, 1, 0, 1, 0,  1}
- *  // result is now {2, 4, 6, 8, 10, 1, 3, 5, 7, 9}
- *  // evens points to {2, 4, 6, 8, 10}
- *  // odds points to {1, 3, 5, 7, 9}
- *  \endcode
- *
- *  \see http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf
- *  \see \p partition_copy
- *  \see \p stable_partition
- */
-template<typename InputIterator1,
-         typename InputIterator2,
-         typename OutputIterator1,
-         typename OutputIterator2,
-         typename Predicate>
-  thrust::pair<OutputIterator1,OutputIterator2>
-    stable_partition_copy(InputIterator1 first,
-                          InputIterator1 last,
-                          InputIterator2 stencil,
-                          OutputIterator1 out_true,
-                          OutputIterator2 out_false,
-                          Predicate pred);
-
-
-/*! \} // end stream_compaction
- */
-
-/*! \} // end reordering
- */
-
-/*! \addtogroup searching
- *  \{
- */
-
-
-/*! \p partition_point returns an iterator pointing to the end of the true
- *  partition of a partitioned range. \p partition_point requires the input range
- *  <tt>[first,last)</tt> to be a partition; that is, all elements which satisfy
- *  <tt>pred</tt> shall appear before those that do not.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The beginning of the range to consider.
- *  \param last The end of the range to consider.
- *  \param pred A function object which decides to which partition each element of the
- *              range <tt>[first, last)</tt> belongs.
- *  \return An iterator \c mid such that <tt>all_of(first, mid, pred)</tt>
- *          and <tt>none_of(mid, last, pred)</tt> are both true.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The range <tt>[first, last)</tt> shall be partitioned by \p pred.
- *
- *  \note Though similar, \p partition_point is not redundant with \p find_if_not.
- *        \p partition_point's precondition provides an opportunity for a
- *        faster implemention.
- *
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/execution_policy.h>
- *
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  
- *  ...
- *
- *  int A[] = {2, 4, 6, 8, 10, 1, 3, 5, 7, 9};
- *  int * B = thrust::partition_point(thrust::host, A, A + 10, is_even());
- *  // B - A is 5
- *  // [A, B) contains only even values
- *  \endcode
- *
- *  \see \p partition
- *  \see \p find_if_not
- */
-template<typename DerivedPolicy, typename ForwardIterator, typename Predicate>
-__host__ __device__
-  ForwardIterator partition_point(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                                  ForwardIterator first,
-                                  ForwardIterator last,
-                                  Predicate pred);
-
-
-/*! \p partition_point returns an iterator pointing to the end of the true
- *  partition of a partitioned range. \p partition_point requires the input range
- *  <tt>[first,last)</tt> to be a partition; that is, all elements which satisfy
- *  <tt>pred</tt> shall appear before those that do not.
- *  \param first The beginning of the range to consider.
- *  \param last The end of the range to consider.
- *  \param pred A function object which decides to which partition each element of the
- *              range <tt>[first, last)</tt> belongs.
- *  \return An iterator \c mid such that <tt>all_of(first, mid, pred)</tt>
- *          and <tt>none_of(mid, last, pred)</tt> are both true.
- *
- *  \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
- *          and \p ForwardIterator's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *
- *  \pre The range <tt>[first, last)</tt> shall be partitioned by \p pred.
- *
- *  \note Though similar, \p partition_point is not redundant with \p find_if_not.
- *        \p partition_point's precondition provides an opportunity for a
- *        faster implemention.
- *
- *  \code
- *  #include <thrust/partition.h>
- *
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  
- *  ...
- *
- *  int A[] = {2, 4, 6, 8, 10, 1, 3, 5, 7, 9};
- *  int * B = thrust::partition_point(A, A + 10, is_even());
- *  // B - A is 5
- *  // [A, B) contains only even values
- *  \endcode
- *
- *  \see \p partition
- *  \see \p find_if_not
- */
-template<typename ForwardIterator, typename Predicate>
-  ForwardIterator partition_point(ForwardIterator first,
-                                  ForwardIterator last,
-                                  Predicate pred);
-
-/*! \} // searching
- */
-
-/*! \addtogroup reductions
- *  \{
- *  \addtogroup predicates
- *  \{
- */
-
-
-/*! \p is_partitioned returns \c true if the given range 
- *  is partitioned with respect to a predicate, and \c false otherwise.
- *
- *  Specifically, \p is_partitioned returns \c true if <tt>[first, last)</tt>
- *  is empty of if <tt>[first, last)</tt> is partitioned by \p pred, i.e. if
- *  all elements that satisfy \p pred appear before those that do not.
- *
- *  The algorithm's execution is parallelized as determined by \p exec.
- *
- *  \param exec The execution policy to use for parallelization.
- *  \param first The beginning of the range to consider.
- *  \param last The end of the range to consider.
- *  \param pred A function object which decides to which partition each element of the
- *         range <tt>[first, last)</tt> belongs.
- *  \return \c true if the range <tt>[first, last)</tt> is partitioned with respect
- *          to \p pred, or if <tt>[first, last)</tt> is empty. \c false, otherwise.
- *
- *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *  
- *  \code
- *  #include <thrust/partition.h>
- *  #include <thrust/execution_policy.h>
- *
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  
- *  ...
- *
- *  int A[] = {2, 4, 6, 8, 10, 1, 3, 5, 7, 9};
- *  int B[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *
- *  thrust::is_partitioned(thrust::host, A, A + 10, is_even()); // returns true
- *  thrust::is_partitioned(thrust::host, B, B + 10, is_even()); // returns false
- *  \endcode
- *
- *  \see \p partition
- */
-template<typename DerivedPolicy, typename InputIterator, typename Predicate>
-__host__ __device__
-  bool is_partitioned(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
-                      InputIterator first,
-                      InputIterator last,
-                      Predicate pred);
-
-
-/*! \p is_partitioned returns \c true if the given range 
- *  is partitioned with respect to a predicate, and \c false otherwise.
- *
- *  Specifically, \p is_partitioned returns \c true if <tt>[first, last)</tt>
- *  is empty of if <tt>[first, last)</tt> is partitioned by \p pred, i.e. if
- *  all elements that satisfy \p pred appear before those that do not.
- *
- *  \param first The beginning of the range to consider.
- *  \param last The end of the range to consider.
- *  \param pred A function object which decides to which partition each element of the
- *         range <tt>[first, last)</tt> belongs.
- *  \return \c true if the range <tt>[first, last)</tt> is partitioned with respect
- *          to \p pred, or if <tt>[first, last)</tt> is empty. \c false, otherwise.
- *
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Input Iterator</a>,
- *          and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type.
- *  \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
- *  
- *  \code
- *  #include <thrust/partition.h>
- *
- *  struct is_even
- *  {
- *    __host__ __device__
- *    bool operator()(const int &x)
- *    {
- *      return (x % 2) == 0;
- *    }
- *  };
- *  
- *  ...
- *
- *  int A[] = {2, 4, 6, 8, 10, 1, 3, 5, 7, 9};
- *  int B[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
- *
- *  thrust::is_partitioned(A, A + 10, is_even()); // returns true
- *  thrust::is_partitioned(B, B + 10, is_even()); // returns false
- *  \endcode
- *
- *  \see \p partition
- */
-template<typename InputIterator, typename Predicate>
-  bool is_partitioned(InputIterator first,
-                      InputIterator last,
-                      Predicate pred);
-
-
-/*! \} // end predicates
- *  \} // end reductions
- */
-
-
-} // end thrust
-
-#include <thrust/detail/partition.inl>
-

spaces/CVPR/LIVE/thrust/thrust/random/detail/normal_distribution_base.h

@@ -1,149 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed 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.
- */
-
-/*
- * Copyright Jens Maurer 2000-2001
- * Distributed under the Boost Software License, Version 1.0. (See
- * accompanying file LICENSE_1_0.txt or copy at
- * http://www.boost.org/LICENSE_1_0.txt)
- */
-
-#pragma once
-
-#include <thrust/detail/config.h>
-#include <thrust/pair.h>
-#include <thrust/random/uniform_real_distribution.h>
-#include <limits>
-#include <cmath>
-
-namespace thrust
-{
-namespace random
-{
-namespace detail
-{
-
-// this version samples the normal distribution directly
-// and uses the non-standard math function erfcinv
-template<typename RealType>
-  class normal_distribution_nvcc
-{
-  protected:
-    template<typename UniformRandomNumberGenerator>
-    __host__ __device__
-    RealType sample(UniformRandomNumberGenerator &urng, const RealType mean, const RealType stddev)
-    {
-      typedef typename UniformRandomNumberGenerator::result_type uint_type;
-      const uint_type urng_range = UniformRandomNumberGenerator::max - UniformRandomNumberGenerator::min;
-
-      // Constants for conversion
-      const RealType S1 = static_cast<RealType>(1) / urng_range;
-      const RealType S2 = S1 / 2;
-
-      RealType S3 = static_cast<RealType>(-1.4142135623730950488016887242097); // -sqrt(2)
-
-      // Get the integer value
-      uint_type u = urng() - UniformRandomNumberGenerator::min;
-
-      // Ensure the conversion to float will give a value in the range [0,0.5)
-      if(u > (urng_range / 2))
-      {
-        u = urng_range - u;
-        S3 = -S3;
-      }
-
-      // Convert to floating point in [0,0.5)
-      RealType p = u*S1 + S2;
-
-      // Apply inverse error function
-      return mean + stddev * S3 * erfcinv(2 * p);
-    }
-
-    // no-op
-    __host__ __device__
-    void reset() {}
-};
-
-// this version samples the normal distribution using
-// Marsaglia's "polar method"
-template<typename RealType>
-  class normal_distribution_portable
-{
-  protected:
-    normal_distribution_portable()
-      : m_r1(), m_r2(), m_cached_rho(), m_valid(false)
-    {}
-
-    normal_distribution_portable(const normal_distribution_portable &other)
-      : m_r1(other.m_r1), m_r2(other.m_r2), m_cached_rho(other.m_cached_rho), m_valid(other.m_valid)
-    {}
-
-    void reset()
-    {
-      m_valid = false;
-    }
-
-    // note that we promise to call this member function with the same mean and stddev
-    template<typename UniformRandomNumberGenerator>
-    __host__ __device__
-    RealType sample(UniformRandomNumberGenerator &urng, const RealType mean, const RealType stddev)
-    {
-      // implementation from Boost
-      // allow for Koenig lookup
-      using std::sqrt; using std::log; using std::sin; using std::cos;
-
-      if(!m_valid)
-      {
-        uniform_real_distribution<RealType> u01;
-        m_r1 = u01(urng);
-        m_r2 = u01(urng);
-        m_cached_rho = sqrt(-RealType(2) * log(RealType(1)-m_r2));
-
-        m_valid = true;
-      }
-      else
-      {
-        m_valid = false;
-      }
-
-      const RealType pi = RealType(3.14159265358979323846);
-
-      RealType result = m_cached_rho * (m_valid ?
-                          cos(RealType(2)*pi*m_r1) :
-                          sin(RealType(2)*pi*m_r1));
-
-      return mean + stddev * result;
-    }
-
-  private:
-    RealType m_r1, m_r2, m_cached_rho;
-    bool m_valid;
-};
-
-template<typename RealType>
-  struct normal_distribution_base
-{
-#if THRUST_DEVICE_COMPILER == THRUST_DEVICE_COMPILER_NVCC && !defined(__NVCOMPILER_CUDA__)
-  typedef normal_distribution_nvcc<RealType> type;
-#else
-  typedef normal_distribution_portable<RealType> type;
-#endif
-};
-
-} // end detail
-} // end random
-} // end thrust
-

spaces/CVPR/LIVE/thrust/thrust/system/cuda/detail/assign_value.h

@@ -1,102 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed 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.
- */
-
-#pragma once
-
-#if THRUST_DEVICE_COMPILER == THRUST_DEVICE_COMPILER_NVCC
-#include <thrust/detail/config.h>
-#include <thrust/system/cuda/config.h>
-#include <thrust/system/cuda/detail/execution_policy.h>
-#include <thrust/detail/raw_pointer_cast.h>
-#include <thrust/system/cuda/detail/copy.h>
-
-
-namespace thrust
-{
-namespace cuda_cub {
-
-
-template<typename DerivedPolicy, typename Pointer1, typename Pointer2>
-inline __host__ __device__
-  void assign_value(thrust::cuda::execution_policy<DerivedPolicy> &exec, Pointer1 dst, Pointer2 src)
-{
-  // XXX war nvbugs/881631
-  struct war_nvbugs_881631
-  {
-    __host__ inline static void host_path(thrust::cuda::execution_policy<DerivedPolicy> &exec, Pointer1 dst, Pointer2 src)
-    {
-      cuda_cub::copy(exec, src, src + 1, dst);
-    }
-
-    __device__ inline static void device_path(thrust::cuda::execution_policy<DerivedPolicy> &, Pointer1 dst, Pointer2 src)
-    {
-      *thrust::raw_pointer_cast(dst) = *thrust::raw_pointer_cast(src);
-    }
-  };
-
-  if (THRUST_IS_HOST_CODE) {
-    #if THRUST_INCLUDE_HOST_CODE
-      war_nvbugs_881631::host_path(exec,dst,src);
-    #endif
-  } else {
-    #if THRUST_INCLUDE_DEVICE_CODE
-      war_nvbugs_881631::device_path(exec,dst,src);
-    #endif
-  }
-} // end assign_value()
-
-
-template<typename System1, typename System2, typename Pointer1, typename Pointer2>
-inline __host__ __device__
-  void assign_value(cross_system<System1,System2> &systems, Pointer1 dst, Pointer2 src)
-{
-  // XXX war nvbugs/881631
-  struct war_nvbugs_881631
-  {
-    __host__ inline static void host_path(cross_system<System1,System2> &systems, Pointer1 dst, Pointer2 src)
-    {
-      // rotate the systems so that they are ordered the same as (src, dst)
-      // for the call to thrust::copy
-      cross_system<System2,System1> rotated_systems = systems.rotate();
-      cuda_cub::copy(rotated_systems, src, src + 1, dst);
-    }
-
-    __device__ inline static void device_path(cross_system<System1,System2> &, Pointer1 dst, Pointer2 src)
-    {
-      // XXX forward the true cuda::execution_policy inside systems here
-      //     instead of materializing a tag
-      thrust::cuda::tag cuda_tag;
-      thrust::cuda_cub::assign_value(cuda_tag, dst, src);
-    }
-  };
-
-  if (THRUST_IS_HOST_CODE) {
-    #if THRUST_INCLUDE_HOST_CODE
-      war_nvbugs_881631::host_path(systems,dst,src);
-    #endif
-  } else {
-    #if THRUST_INCLUDE_DEVICE_CODE
-      war_nvbugs_881631::device_path(systems,dst,src);
-    #endif
-  }
-} // end assign_value()
-
-
-
-
-} // end cuda_cub
-} // end namespace thrust
-#endif

spaces/CVPR/LIVE/thrust/thrust/system/detail/sequential/assign_value.h

@@ -1,43 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed 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.
- */
-
-#pragma once
-
-#include <thrust/detail/config.h>
-#include <thrust/system/detail/sequential/execution_policy.h>
-#include <thrust/detail/raw_pointer_cast.h>
-
-namespace thrust
-{
-namespace system
-{
-namespace detail
-{
-namespace sequential
-{
-
-template<typename DerivedPolicy, typename Pointer1, typename Pointer2>
-__host__ __device__
-  void assign_value(sequential::execution_policy<DerivedPolicy> &, Pointer1 dst, Pointer2 src)
-{
-  *thrust::raw_pointer_cast(dst) = *thrust::raw_pointer_cast(src);
-} // end assign_value()
-
-} // end sequential
-} // end detail
-} // end system
-} // end thrust
-

spaces/CVPR/LIVE/thrust/thrust/system/omp/detail/get_value.h

@@ -1,23 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed 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.
- */
-
-#pragma once
-
-#include <thrust/detail/config.h>
-
-// this system inherits get_value
-#include <thrust/system/cpp/detail/get_value.h>
-

spaces/CVPR/lama-example/bin/blur_predicts.py

@@ -1,57 +0,0 @@
-#!/usr/bin/env python3
-
-import os
-
-import cv2
-import numpy as np
-import tqdm
-
-from saicinpainting.evaluation.data import PrecomputedInpaintingResultsDataset
-from saicinpainting.evaluation.utils import load_yaml
-
-
-def main(args):
-    config = load_yaml(args.config)
-
-    if not args.predictdir.endswith('/'):
-        args.predictdir += '/'
-
-    dataset = PrecomputedInpaintingResultsDataset(args.datadir, args.predictdir, **config.dataset_kwargs)
-
-    os.makedirs(os.path.dirname(args.outpath), exist_ok=True)
-
-    for img_i in tqdm.trange(len(dataset)):
-        pred_fname = dataset.pred_filenames[img_i]
-        cur_out_fname = os.path.join(args.outpath, pred_fname[len(args.predictdir):])
-        os.makedirs(os.path.dirname(cur_out_fname), exist_ok=True)
-
-        sample = dataset[img_i]
-        img = sample['image']
-        mask = sample['mask']
-        inpainted = sample['inpainted']
-
-        inpainted_blurred = cv2.GaussianBlur(np.transpose(inpainted, (1, 2, 0)),
-                                             ksize=(args.k, args.k),
-                                             sigmaX=args.s, sigmaY=args.s,
-                                             borderType=cv2.BORDER_REFLECT)
-
-        cur_res = (1 - mask) * np.transpose(img, (1, 2, 0)) + mask * inpainted_blurred
-        cur_res = np.clip(cur_res * 255, 0, 255).astype('uint8')
-        cur_res = cv2.cvtColor(cur_res, cv2.COLOR_RGB2BGR)
-        cv2.imwrite(cur_out_fname, cur_res)
-
-
-if __name__ == '__main__':
-    import argparse
-
-    aparser = argparse.ArgumentParser()
-    aparser.add_argument('config', type=str, help='Path to evaluation config')
-    aparser.add_argument('datadir', type=str,
-                         help='Path to folder with images and masks (output of gen_mask_dataset.py)')
-    aparser.add_argument('predictdir', type=str,
-                         help='Path to folder with predicts (e.g. predict_hifill_baseline.py)')
-    aparser.add_argument('outpath', type=str, help='Where to put results')
-    aparser.add_argument('-s', type=float, default=0.1, help='Gaussian blur sigma')
-    aparser.add_argument('-k', type=int, default=5, help='Kernel size in gaussian blur')
-
-    main(aparser.parse_args())

spaces/CVPR/ml-talking-face/toxicity_estimator/module.py

@@ -1,51 +0,0 @@
-from googleapiclient import discovery
-import argparse
-import json
-import os
-
-API_KEY = os.environ['PERSPECTIVE_API_KEY']
-
-class PerspectiveAPI:
-    def __init__(self):
-        self.client = discovery.build(
-                        "commentanalyzer",
-                        "v1alpha1",
-                        developerKey=API_KEY,
-                        discoveryServiceUrl="https://commentanalyzer.googleapis.com/$discovery/rest?version=v1alpha1",
-                        static_discovery=False,
-                    )
-    @staticmethod
-    def _get_request(text):
-        return {
-            'comment': {'text': text},
-            'requestedAttributes': {'TOXICITY': {}}
-        }
-    
-    def _infer(self, text):
-        request = self._get_request(text)
-        response = self.client.comments().analyze(body=request).execute()
-        return response
-    
-    def infer(self, text):
-        return self._infer(text)
-        
-    def get_score(self, text, label='TOXICITY'):
-        response = self._infer(text)
-        return response['attributeScores'][label]['spanScores'][0]['score']['value']
-    
-
-def parse_args():
-    parser = argparse.ArgumentParser(
-        description='Perspective API Test.')
-    parser.add_argument('-i', '--input-text', type=str, required=True)
-    args = parser.parse_args()
-    return args    
-
-
-if __name__ == '__main__':
-    args = parse_args()
-    
-    perspective_api = PerspectiveAPI()
-    score = perspective_api.get_score(args.input_text)
-
-    print(score)

spaces/Chloe0222/Chloe/README.md

@@ -1,12 +0,0 @@
----
-title: Chloe
-emoji: 🐢
-colorFrom: gray
-colorTo: indigo
-sdk: gradio
-sdk_version: 3.18.0
-app_file: app.py
-pinned: false
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference

spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/gradio/templates/cdn/assets/TabItem.svelte_svelte_type_style_lang-1276453b.js

@@ -1,2 +0,0 @@
-import{S as G,e as H,s as K,G as w,a9 as O,N as j,O as T,K as k,U as A,p as g,M as v,H as P,ay as Q,ab as R,ac as U,ad as F,z as J,v as L,A as p,w as I,a4 as S,B as V,D as W,m as B,aA as C,P as N,Q as X,R as z}from"./index-1d65707a.js";function D(n,e,l){const s=n.slice();return s[14]=e[l],s[16]=l,s}function Y(n){let e,l=n[14].name+"",s,f,d,_;function i(){return n[12](n[14],n[16])}return{c(){e=j("button"),s=N(l),f=T(),k(e,"class","svelte-kqij2n")},m(u,m){g(u,e,m),v(e,s),v(e,f),d||(_=X(e,"click",i),d=!0)},p(u,m){n=u,m&8&&l!==(l=n[14].name+"")&&z(s,l)},d(u){u&&p(e),d=!1,_()}}}function Z(n){let e,l=n[14].name+"",s,f;return{c(){e=j("button"),s=N(l),f=T(),k(e,"class","selected svelte-kqij2n")},m(d,_){g(d,e,_),v(e,s),v(e,f)},p(d,_){_&8&&l!==(l=d[14].name+"")&&z(s,l)},d(d){d&&p(e)}}}function M(n,e){let l,s;function f(i,u){return i[14].id===i[4]?Z:Y}let d=f(e),_=d(e);return{key:n,first:null,c(){l=B(),_.c(),s=B(),this.first=l},m(i,u){g(i,l,u),_.m(i,u),g(i,s,u)},p(i,u){e=i,d===(d=f(e))&&_?_.p(e,u):(_.d(1),_=d(e),_&&(_.c(),_.m(s.parentNode,s)))},d(i){i&&(p(l),p(s)),_.d(i)}}}function x(n){let e,l,s=[],f=new Map,d,_,i,u=w(n[3]);const m=t=>t[14].id;for(let t=0;t<u.length;t+=1){let o=D(n,u,t),r=m(o);f.set(r,s[t]=M(r,o))}const b=n[11].default,c=O(b,n,n[10],null);return{c(){e=j("div"),l=j("div");for(let t=0;t<s.length;t+=1)s[t].c();d=T(),c&&c.c(),k(l,"class","tab-nav scroll-hide svelte-kqij2n"),k(e,"class",_="tabs "+n[2].join(" ")+" svelte-kqij2n"),k(e,"id",n[1]),A(e,"hide",!n[0])},m(t,o){g(t,e,o),v(e,l);for(let r=0;r<s.length;r+=1)s[r]&&s[r].m(l,null);v(e,d),c&&c.m(e,null),i=!0},p(t,[o]){o&408&&(u=w(t[3]),s=P(s,o,m,1,t,u,f,l,Q,M,null,D)),c&&c.p&&(!i||o&1024)&&R(c,b,t,t[10],i?F(b,t[10],o,null):U(t[10]),null),(!i||o&4&&_!==(_="tabs "+t[2].join(" ")+" svelte-kqij2n"))&&k(e,"class",_),(!i||o&2)&&k(e,"id",t[1]),(!i||o&5)&&A(e,"hide",!t[0])},i(t){i||(J(c,t),i=!0)},o(t){L(c,t),i=!1},d(t){t&&p(e);for(let o=0;o<s.length;o+=1)s[o].d();c&&c.d(t)}}}const $={};function ee(n,e,l){let s,f,{$$slots:d={},$$scope:_}=e,{visible:i=!0}=e,{elem_id:u="id"}=e,{elem_classes:m=[]}=e,{selected:b}=e,c=[];const t=I(!1);S(n,t,a=>l(4,f=a));const o=I(0);S(n,o,a=>l(13,s=a));const r=V();W($,{register_tab:a=>(c.push({name:a.name,id:a.id}),t.update(h=>h??a.id),l(3,c),c.length-1),unregister_tab:a=>{const h=c.findIndex(y=>y.id===a.id);c.splice(h,1),t.update(y=>y===a.id?c[h]?.id||c[c.length-1]?.id:y)},selected_tab:t,selected_tab_index:o});function q(a){l(9,b=a),C(t,f=a,f),C(o,s=c.findIndex(h=>h.id===a),s),r("change")}const E=(a,h)=>{q(a.id),r("select",{value:a.name,index:h})};return n.$$set=a=>{"visible"in a&&l(0,i=a.visible),"elem_id"in a&&l(1,u=a.elem_id),"elem_classes"in a&&l(2,m=a.elem_classes),"selected"in a&&l(9,b=a.selected),"$$scope"in a&&l(10,_=a.$$scope)},n.$$.update=()=>{n.$$.dirty&512&&b!==null&&q(b)},[i,u,m,c,f,t,o,r,q,b,_,d,E]}class le extends G{constructor(e){super(),H(this,e,ee,x,K,{visible:0,elem_id:1,elem_classes:2,selected:9})}}export{le as T,$ as a};
-//# sourceMappingURL=TabItem.svelte_svelte_type_style_lang-1276453b.js.map