CUDA: accelerating applications with CUDA C/C + + (NVIDIA course)

The foundation of C/C + + accelerated computing With the technology and tools you have now, you are close to getting ready to start accelerating your actual applications. This section will provide you with the following details: a. Set up your own CUDA environment b. How best to continue learning in d ...

Posted on Fri, 14 Feb 2020 05:04:13 -0500 by ljCharlie

ItemTouchHelper to realize interactive animation

Catalogue introduction 01. Drag needs to realize functions 02. Several important methods 03. Simple implementation ideas 04. Drag effect optimization 05. Complete code display Hot wire Blog notes summary [from March 2016 to now], including Java foundation and in-depth knowledge points, Android te ...

Posted on Fri, 14 Feb 2020 02:32:24 -0500 by haydndup

Learning diary of slam beginners

Learning SLAM for the first time, because one note cannot be used in ubuntu, I decided to use CSDN to record my learning notes. The purpose of publishing is to share and exchange progress with you. Most of the notes come from the experience of the big guys. I will also attach a link. If there is infring ...

Posted on Fri, 14 Feb 2020 02:00:26 -0500 by grantf

Data Structure:Tree: unordered tree,Binary Search Tree,AVL,B Tree,Red Black Tree

Article directory tree Basic concepts Properties of binary tree Binary tree classification Construction and traversal of unordered tree BinTree.h Test code main.cpp BST binary search tree BSTree.h main.cpp AVL balanced binary search tree: self balancing Four attitudes of AVL tree imbalance L ...

Posted on Fri, 14 Feb 2020 00:51:44 -0500 by kev wood

11. SpringBoot -- scheduled tasks

  Development tools: STS Code download link: https://github.com/theIndoorTrain/Springboot/tree/52ef6c0c805913db1e66ed18671c322e284233f0 Preface: We talked about Quartz task scheduling before. Now, let's talk about Spring's own task scheduling. In the spring boot project, this super simple scheduling method will bring us convenience. ...

Posted on Thu, 13 Feb 2020 14:14:53 -0500 by ILYAS415

Python implements a desktop translation tool

Python has been in use for a long time, initially based on interest in reptiles. With the continuous deepening, I gradually changed to other languages, after all, the job opportunities are really too few. Many skills will be forgotten if they are not used for a long time, and they will be sorted out for beginners to learn and discuss. Compared ...

Posted on Wed, 12 Feb 2020 09:53:29 -0500 by ineedhelpbigtime

Hitokoto spider one word library crawler development diary

Original address: http://bili33.top/2020/02/11/Hitokoto-Spider/ Recently, although there are classes at home (school starts), but the two and a half hours of rest time at noon and the free time at night are really idle, what do you want to do Then I found octopus on my student's computer desktop, and wh ...

Posted on Wed, 12 Feb 2020 05:31:49 -0500 by Gafaddict

PyQt5 builds interactive web&python application through QWebEngineView and QWebChannel

PyQt5 builds interactive web & Python application through QWebEngineView and QWebChannel First of all, let's talk about the benefits of building interactive web & Python applications through QWebEngineView and QWebChannel. Ha ha, everything needs to be created 1. It can greatly shorten your ...

Posted on Wed, 12 Feb 2020 04:00:55 -0500 by QWERTYtech

Ballerina: Hello World

Preface Ballerina is a fully open source compile time strong type language with the vision of making it easy for programmers in the cloud native era to write the software they want Open source address: https://github.com/ballerina-platform/ballerina-lang Example Download the package of corresponding platform for installation https://ballerina.i ...

Posted on Wed, 12 Feb 2020 03:50:00 -0500 by TwistedLogix

Leetcode sorting classic

215: Kth Element Before solving the problem, review the Eight classic methods Direct insert sort This link The content is easy to understand Count sort not understood Sorting: time complexity O(NlogN), space complexity O(1) public int findKthLargest(int[] nums, int k) { Arrays.sort(nums); retur ...

Posted on Wed, 12 Feb 2020 01:03:00 -0500 by Jason28