 通过容器内运行的应用使用Gmail API

I'm wondering how to use Gmail API from an app running inside the container (of GKE)?
For my local development, I can run the example https://developers.google.com/gmail/api/quickstart/go to get a code then the program saves a token, send an email successfully (I've changed the scope, the example only has readonly)
But I don't have the interactive terminal for the container running in K8S, so I set the credentials and token as env var for the process running inside the container (my program consumes the env var, and local testing sent the email successfully), it doesn't seem to be able to contact Gmail API.
The exact error is :
Post https://www.googleapis.com/gmail/v1/users/me/messages/send?alt=json&prettyPrint=false: dial tcp: i/o timeout"
So I have two question here:
 why is container in GKE is unable to contact www.googleapis.com
 What's the best way of handling gmail api inside a container? Am I missing steps to setup google APIs?
Thanks, Bill
这似乎是退出的dns pod之一，导致dns查找挂起并导致tcp I / O超时：</ p >
kubedns5dcfcbf5fbw2vjc 0/4 ExitCode：0 23 3d </ code> </ p>
在修复了pod后，现在的应用程序是 能够通过gmail API发送电子邮件。</ p>
</ div>
展开原文
原文
It appears to be one of the dns pod exited that caused dns lookup to hang and resulted in tcp i/o timeout:
kubedns5dcfcbf5fbw2vjc 0/4 ExitCode:0 23 3d
after fixing the pod, now the application is able to send email thru gmail APIs.
docker在使用windows containers模式内存受限_course
201709141. 环境是 Win10 专业版 + Docker for windows. 2. 把Docker转换到windows containers 模式下。我的程序最多占用内存不到1G, 但是在Linux containers模式下面是完全可以超过1G 的。求大神指点。。。
Docker安装报错 Containers Windows Feature is not available，别的地方都找不到解决方案。_course
20200213报错信息： ``` Containers Windows Feature is not available 在 CommunityInstaller.EnableFeaturesAction.GetFeaturesToEnable() 在 CommunityInstaller.EnableFeaturesAction.<DoAsync>d__29.MoveNext()  引发异常的上一位置中堆栈跟踪的末尾  在 System.Runtime.ExceptionServices.ExceptionDispatchInfo.Throw() 在 CommunityInstaller.InstallWorkflow.<HandleD4WPackageAsync>d__29.MoveNext()  引发异常的上一位置中堆栈跟踪的末尾  在 System.Runtime.ExceptionServices.ExceptionDispatchInfo.Throw() 在 System.Runtime.CompilerServices.TaskAwaiter.HandleNonSuccessAndDebuggerNotification(Task task) 在 CommunityInstaller.InstallWorkflow.<ProcessAsync>d__24.MoveNext() ``` 系统是Win10家庭版，已安装HyperV并开启，Bios也已经设置虚拟化：已启用，注册表也把EditionID改成了Professional，不知道为什么会有问题。 ![图片说明](https://imgask.csdn.net/upload/202002/13/1581579708_494006.png)
windows server containers 和 docker 什么关系_course
20160310Containers技术是什么，有哪些优点？ Windows server支持哪些容器技术？ windows server containers 和 docker 什么关系？
centos7部署Hyperledger Fabric e2e示例遇到的问题_course
20180223到Chaincode is installed on remote peer PEER2 这一步为止是成功的。 接下来出现错误 Error: Error endorsing chaincode: rpc error: code = Unknown desc = Error starting container: Post http://unix.sock/containers/create?name=devpeer0.org2.example.commycc1.0: dial unix /host/var/run/docker.sock: connect: permission denied 请教大家，错误可能是什么导致的呢？
Containers _course
20171130Problem Description At a container terminal, containers arrive from the hinterland, one by one, by rail, by road, or by small ships. The containers are piled up as they arrive. Then the huge cargo ships arrive, each one capable of carrying thousands of containers. The containers are loaded into the ships that will bring them to far away shores. Or the other way round, containers are brought in over sea, piled up, and transported to the hinterland one by one. Anyway, a huge parking lot is needed, to store the containers waiting for further transportation. ![](http://acm.hdu.edu.cn/data/images/3499_1.png) Building the new container terminal at the mouth of the river was a good choice. But there are disadvantages as well. The ground is very muddy, and building on firm ground would have been substantially cheaper. It will be important to build the parking lot not larger than necessary. A container is 40 feet long and 8 feet wide. Containers are stacked, but a stack will be at most five containers high. The stacks are organized in rows. Next to a container stack, and between two container stacks (along the long side of the containers) a space of 2 feet is needed for catching the containers. Next to a row of stacks, and between two stacks (along the short side of the containers) a space of 4 feet is needed for the crane that lifts the containers. All containers are placed in the same direction, as the cranes can not make turns on the parking lot. The parking lot should be rectangular. Given the required capacity of the parking lot, what will be the best dimension for the parking lot? In the first place the area should be minimal. The second condition is that the parking lot should be as square as possible. Below you see a plan for a parking lot with a capacity of 8 stacks. Two rows of four containers each turns out to be the best solution here, with a total area of 92 × 42 = 3864. A parking lot with 8 container stacks. Input On the first line one positive number: the number of testcases, at most 100. After that per testcase: A single positive integer n (n ≤ 1012) on a single line: the required capacity (number of containers) for the parking lot. Output Per testcase: A single line, containing the length, width (length ≥ width) and area of the optimal solution. The optimal solution has the least possible area, and if there are multiple solutions having the same area, the difference length  width should be minimal. Use the sample format. Sample Input 6 1 15 22 29 36 43 Sample Output 48 X 12 = 576 48 X 32 = 1536 52 X 48 = 2496 92 X 32 = 2944 92 X 42 = 3864 136 X 32 = 4352
vs2017添加dockerfile文件后项目报错_course
20190322严重性 代码 说明 项目 文件 行 禁止显示状态 错误 由于文件无效，项目 “C:\Users\.nuget\packages\microsoft.visualstudio.azure.containers.tools.targets\1.0.2105168\build\Container.targets”不由 (3,3) 处的 “C:\Users\.nuget\packages\microsoft.visualstudio.azure.containers.tools.targets\1.0.2105168\build\Microsoft.VisualStudio.Azure.Containers.Tools.Targets.targets”导入。 DB.Web C:\Users\.nuget\packages\microsoft.visualstudio.azure.containers.tools.targets\1.0.2105168\build\Container.targets 3 创建完dockerfile文件后就报错这个求解决方案
Depot _course
20170811Description A Finnish high technology company has a big rectangular depot. The depot has a worker and a manager. The sides of the depot, in the order around it, are called left, top, right and bottom. The depot area is divided into equalsized squares by dividing the area into rows and columns. The rows are numbered starting from the top with integers 1,2,... and the columns are numbered starting from the left with integers 1,2,... The depot has containers, which are used to store invaluable technological devices. The containers have distinct identification numbers. Each container occupies one square. The depot is so big, that the number of containers ever to arrive is smaller than the number of rows and smaller than the number of columns. The containers are not removed from the depot, but sometimes a new container arrives. The entry to the depot is at the top left corner. The worker has arranged the containers around the top left corner of the depot in such a way that he will be able to find them by their identification numbers. He uses the following method. Suppose that the identification number of the next container to be inserted is k (container k, for short). The worker travels the first row starting from the left and looks for the first container with identification number larger than k. If no such container is found, then container k is placed immediately after the rightmost of the containers previously in the row. If such a container l is found, then container l is replaced by container k, and l is inserted to the following row using the same method. If the worker reaches a row having no containers, the container is placed in the leftmost square of that row. Suppose that containers 3,4,9,2,5,1 have arrived to the depot in this order. Then the placement of the containers at the depot is as follows. 1 4 5 2 9 3 The manager comes to the worker and they have the following dialogue: Manager: Did container 5 arrive before container 4? Worker: No, that is impossible. Manager: Oh, so you can tell the arrival order of the containers by their placement. Worker: Generally not. For instance, the containers now in the depot could have arrived in the order 3,2,1,4,9,5 or in the order 3,2,1,9,4,5 or in one of 14 other orders. As the manager does not want to show that the worker seems much smarter, he goes away. You are to help the manager and write a program which, given a container placement, counts all possible orders in which they might have arrived. Input Your program is to read from standard input. The first line contains one integer R: the number of rows with containers in them. The following R lines contain information about rows 1,...,R starting from the top as follows. First on each of those lines is an integer M: the number of containers in that row. Following that, there are M integers on the line: the identification numbers of the containers in the row starting from the left. All container identification numbers I satisfy 1 <= I <= 50. Let N be the number of containers in the depot, then 1 <= N <= 13. Output Your program is to write to standard output. The output contains an integer: the number of possible orders in which containers might have arrived. An arrival order should be counted only once. Sample Input 3 3 1 4 5 2 2 9 1 3 Sample Output 16
一个数字的乘法问题，用C语言怎么实现这个算法的优化呢？_course
20181216Problem Description At a container terminal, containers arrive from the hinterland, one by one, by rail, by road, or by small ships. The containers are piled up as they arrive. Then the huge cargo ships arrive, each one capable of carrying thousands of containers. The containers are loaded into the ships that will bring them to far away shores. Or the other way round, containers are brought in over sea, piled up, and transported to the hinterland one by one. Anyway, a huge parking lot is needed, to store the containers waiting for further transportation. Building the new container terminal at the mouth of the river was a good choice. But there are disadvantages as well. The ground is very muddy, and building on firm ground would have been substantially cheaper. It will be important to build the parking lot not larger than necessary. A container is 40 feet long and 8 feet wide. Containers are stacked, but a stack will be at most five containers high. The stacks are organized in rows. Next to a container stack, and between two container stacks (along the long side of the containers) a space of 2 feet is needed for catching the containers. Next to a row of stacks, and between two stacks (along the short side of the containers) a space of 4 feet is needed for the crane that lifts the containers. All containers are placed in the same direction, as the cranes can not make turns on the parking lot. The parking lot should be rectangular. Given the required capacity of the parking lot, what will be the best dimension for the parking lot? In the first place the area should be minimal. The second condition is that the parking lot should be as square as possible. Below you see a plan for a parking lot with a capacity of 8 stacks. Two rows of four containers each turns out to be the best solution here, with a total area of 92 × 42 = 3864. A parking lot with 8 container stacks. Input On the first line one positive number: the number of testcases, at most 100. After that per testcase: A single positive integer n (n ≤ 1012) on a single line: the required capacity (number of containers) for the parking lot. Output Per testcase: A single line, containing the length, width (length ≥ width) and area of the optimal solution. The optimal solution has the least possible area, and if there are multiple solutions having the same area, the difference length  width should be minimal. Use the sample format. Sample Input 6 1 15 22 29 36 43 Sample Output 48 X 12 = 576 48 X 32 = 1536 52 X 48 = 2496 92 X 32 = 2944 92 X 42 = 3864 136 X 32 = 4352
Just Pour the Water _course
20170226Shirly is a very clever girl. Now she has two containers (A and B), each with some water. Every minute, she pours half of the water in A into B, and simultaneous pours half of the water in B into A. As the pouring continues, she finds it is very easy to calculate the amount of water in A and B at any time. It is really an easy job :). But now Shirly wants to know how to calculate the amount of water in each container if there are more than two containers. Then the problem becomes challenging. Now Shirly has N (2 <= N <= 20) containers (numbered from 1 to N). Every minute, each container is supposed to pour water into another K containers (K may vary for different containers). Then the water will be evenly divided into K portions and accordingly poured into anther K containers. Now the question is: how much water exists in each container at some specified time? For example, container 1 is specified to pour its water into container 1, 2, 3. Then in every minute, container 1 will pour its 1/3 of its water into container 1, 2, 3 separately (actually, 1/3 is poured back to itself, this is allowed by the rule of the game). Input Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <= 10) which is the number of test cases. And it will be followed by T consecutive test cases. Each test case starts with a line containing an integer N, the number of containers. The second line contains N floating numbers, denoting the initial water in each container. The following N lines describe the relations that one container(from 1 to N) will pour water into the others. Each line starts with an integer K (0 <= K <= N) followed by K integers. Each integer ([1, N]) represents a container that should pour water into by the current container. The last line is an integer M (1<= M <= 1,000,000,000) denoting the pouring will continue for M minutes. Output For each test case, output contains N floating numbers to two decimal places, the amount of water remaining in each container after the pouring in one line separated by one space. There is no space at the end of the line. Sample Input 1 2 100.00 100.00 1 2 2 1 2 2 Sample Output 75.00 125.00
Hadoop中yarn 界面显示_course
20170905yarn界面增加allocatedMB, allocatedVCores, and runningContainers三个字段，如何进行配置
集装箱的装货问题要求最小化集装箱数，怎么用C语言的程序的代码的设计的思想的办法来解决的呢_course
20190615Problem Description At a container terminal, containers arrive from the hinterland, one by one, by rail, by road, or by small ships. The containers are piled up as they arrive. Then the huge cargo ships arrive, each one capable of carrying thousands of containers. The containers are loaded into the ships that will bring them to far away shores. Or the other way round, containers are brought in over sea, piled up, and transported to the hinterland one by one. Anyway, a huge parking lot is needed, to store the containers waiting for further transportation. Building the new container terminal at the mouth of the river was a good choice. But there are disadvantages as well. The ground is very muddy, and building on firm ground would have been substantially cheaper. It will be important to build the parking lot not larger than necessary. A container is 40 feet long and 8 feet wide. Containers are stacked, but a stack will be at most five containers high. The stacks are organized in rows. Next to a container stack, and between two container stacks (along the long side of the containers) a space of 2 feet is needed for catching the containers. Next to a row of stacks, and between two stacks (along the short side of the containers) a space of 4 feet is needed for the crane that lifts the containers. All containers are placed in the same direction, as the cranes can not make turns on the parking lot. The parking lot should be rectangular. Given the required capacity of the parking lot, what will be the best dimension for the parking lot? In the first place the area should be minimal. The second condition is that the parking lot should be as square as possible. Below you see a plan for a parking lot with a capacity of 8 stacks. Two rows of four containers each turns out to be the best solution here, with a total area of 92 × 42 = 3864. A parking lot with 8 container stacks. Input On the first line one positive number: the number of testcases, at most 100. After that per testcase: A single positive integer n (n ≤ 1012) on a single line: the required capacity (number of containers) for the parking lot. Output Per testcase: A single line, containing the length, width (length ≥ width) and area of the optimal solution. The optimal solution has the least possible area, and if there are multiple solutions having the same area, the difference length  width should be minimal. Use the sample format. Sample Input 6 1 15 22 29 36 43 Sample Output 48 X 12 = 576 48 X 32 = 1536 52 X 48 = 2496 92 X 32 = 2944 92 X 42 = 3864 136 X 32 = 4352
Containers C语言的程序_course
20190831Problem Description At a container terminal, containers arrive from the hinterland, one by one, by rail, by road, or by small ships. The containers are piled up as they arrive. Then the huge cargo ships arrive, each one capable of carrying thousands of containers. The containers are loaded into the ships that will bring them to far away shores. Or the other way round, containers are brought in over sea, piled up, and transported to the hinterland one by one. Anyway, a huge parking lot is needed, to store the containers waiting for further transportation. Building the new container terminal at the mouth of the river was a good choice. But there are disadvantages as well. The ground is very muddy, and building on firm ground would have been substantially cheaper. It will be important to build the parking lot not larger than necessary. A container is 40 feet long and 8 feet wide. Containers are stacked, but a stack will be at most five containers high. The stacks are organized in rows. Next to a container stack, and between two container stacks (along the long side of the containers) a space of 2 feet is needed for catching the containers. Next to a row of stacks, and between two stacks (along the short side of the containers) a space of 4 feet is needed for the crane that lifts the containers. All containers are placed in the same direction, as the cranes can not make turns on the parking lot. The parking lot should be rectangular. Given the required capacity of the parking lot, what will be the best dimension for the parking lot? In the first place the area should be minimal. The second condition is that the parking lot should be as square as possible. Below you see a plan for a parking lot with a capacity of 8 stacks. Two rows of four containers each turns out to be the best solution here, with a total area of 92 × 42 = 3864. A parking lot with 8 container stacks. Input On the first line one positive number: the number of testcases, at most 100. After that per testcase: A single positive integer n (n ≤ 1012) on a single line: the required capacity (number of containers) for the parking lot. Output Per testcase: A single line, containing the length, width (length ≥ width) and area of the optimal solution. The optimal solution has the least possible area, and if there are multiple solutions having the same area, the difference length  width should be minimal. Use the sample format. Sample Input 6 1 15 22 29 36 43 Sample Output 48 X 12 = 576 48 X 32 = 1536 52 X 48 = 2496 92 X 32 = 2944 92 X 42 = 3864 136 X 32 = 4352
Containers 是怎么编写的呢_course
20190909Problem Description At a container terminal, containers arrive from the hinterland, one by one, by rail, by road, or by small ships. The containers are piled up as they arrive. Then the huge cargo ships arrive, each one capable of carrying thousands of containers. The containers are loaded into the ships that will bring them to far away shores. Or the other way round, containers are brought in over sea, piled up, and transported to the hinterland one by one. Anyway, a huge parking lot is needed, to store the containers waiting for further transportation. Building the new container terminal at the mouth of the river was a good choice. But there are disadvantages as well. The ground is very muddy, and building on firm ground would have been substantially cheaper. It will be important to build the parking lot not larger than necessary. A container is 40 feet long and 8 feet wide. Containers are stacked, but a stack will be at most five containers high. The stacks are organized in rows. Next to a container stack, and between two container stacks (along the long side of the containers) a space of 2 feet is needed for catching the containers. Next to a row of stacks, and between two stacks (along the short side of the containers) a space of 4 feet is needed for the crane that lifts the containers. All containers are placed in the same direction, as the cranes can not make turns on the parking lot. The parking lot should be rectangular. Given the required capacity of the parking lot, what will be the best dimension for the parking lot? In the first place the area should be minimal. The second condition is that the parking lot should be as square as possible. Below you see a plan for a parking lot with a capacity of 8 stacks. Two rows of four containers each turns out to be the best solution here, with a total area of 92 × 42 = 3864. A parking lot with 8 container stacks. Input On the first line one positive number: the number of testcases, at most 100. After that per testcase: A single positive integer n (n ≤ 1012) on a single line: the required capacity (number of containers) for the parking lot. Output Per testcase: A single line, containing the length, width (length ≥ width) and area of the optimal solution. The optimal solution has the least possible area, and if there are multiple solutions having the same area, the difference length  width should be minimal. Use the sample format. Sample Input 6 1 15 22 29 36 43 Sample Output 48 X 12 = 576 48 X 32 = 1536 52 X 48 = 2496 92 X 32 = 2944 92 X 42 = 3864 136 X 32 = 4352
Containers 的编程的计算_course
20190923Problem Description At a container terminal, containers arrive from the hinterland, one by one, by rail, by road, or by small ships. The containers are piled up as they arrive. Then the huge cargo ships arrive, each one capable of carrying thousands of containers. The containers are loaded into the ships that will bring them to far away shores. Or the other way round, containers are brought in over sea, piled up, and transported to the hinterland one by one. Anyway, a huge parking lot is needed, to store the containers waiting for further transportation. Building the new container terminal at the mouth of the river was a good choice. But there are disadvantages as well. The ground is very muddy, and building on firm ground would have been substantially cheaper. It will be important to build the parking lot not larger than necessary. A container is 40 feet long and 8 feet wide. Containers are stacked, but a stack will be at most five containers high. The stacks are organized in rows. Next to a container stack, and between two container stacks (along the long side of the containers) a space of 2 feet is needed for catching the containers. Next to a row of stacks, and between two stacks (along the short side of the containers) a space of 4 feet is needed for the crane that lifts the containers. All containers are placed in the same direction, as the cranes can not make turns on the parking lot. The parking lot should be rectangular. Given the required capacity of the parking lot, what will be the best dimension for the parking lot? In the first place the area should be minimal. The second condition is that the parking lot should be as square as possible. Below you see a plan for a parking lot with a capacity of 8 stacks. Two rows of four containers each turns out to be the best solution here, with a total area of 92 × 42 = 3864. A parking lot with 8 container stacks. Input On the first line one positive number: the number of testcases, at most 100. After that per testcase: A single positive integer n (n ≤ 1012) on a single line: the required capacity (number of containers) for the parking lot. Output Per testcase: A single line, containing the length, width (length ≥ width) and area of the optimal solution. The optimal solution has the least possible area, and if there are multiple solutions having the same area, the difference length  width should be minimal. Use the sample format. Sample Input 6 1 15 22 29 36 43 Sample Output 48 X 12 = 576 48 X 32 = 1536 52 X 48 = 2496 92 X 32 = 2944 92 X 42 = 3864 136 X 32 = 4352
数字乘法的数位问题，如何利用C语言技术方式加以的解决_course
20190304Problem Description At a container terminal, containers arrive from the hinterland, one by one, by rail, by road, or by small ships. The containers are piled up as they arrive. Then the huge cargo ships arrive, each one capable of carrying thousands of containers. The containers are loaded into the ships that will bring them to far away shores. Or the other way round, containers are brought in over sea, piled up, and transported to the hinterland one by one. Anyway, a huge parking lot is needed, to store the containers waiting for further transportation. Building the new container terminal at the mouth of the river was a good choice. But there are disadvantages as well. The ground is very muddy, and building on firm ground would have been substantially cheaper. It will be important to build the parking lot not larger than necessary. A container is 40 feet long and 8 feet wide. Containers are stacked, but a stack will be at most five containers high. The stacks are organized in rows. Next to a container stack, and between two container stacks (along the long side of the containers) a space of 2 feet is needed for catching the containers. Next to a row of stacks, and between two stacks (along the short side of the containers) a space of 4 feet is needed for the crane that lifts the containers. All containers are placed in the same direction, as the cranes can not make turns on the parking lot. The parking lot should be rectangular. Given the required capacity of the parking lot, what will be the best dimension for the parking lot? In the first place the area should be minimal. The second condition is that the parking lot should be as square as possible. Below you see a plan for a parking lot with a capacity of 8 stacks. Two rows of four containers each turns out to be the best solution here, with a total area of 92 × 42 = 3864. A parking lot with 8 container stacks. Input On the first line one positive number: the number of testcases, at most 100. After that per testcase: A single positive integer n (n ≤ 1012) on a single line: the required capacity (number of containers) for the parking lot. Output Per testcase: A single line, containing the length, width (length ≥ width) and area of the optimal solution. The optimal solution has the least possible area, and if there are multiple solutions having the same area, the difference length  width should be minimal. Use the sample format. Sample Input 6 1 15 22 29 36 43 Sample Output 48 X 12 = 576 48 X 32 = 1536 52 X 48 = 2496 92 X 32 = 2944 92 X 42 = 3864 136 X 32 = 4352
软件测试2小时入门
20181010本课程内容系统、全面、简洁、通俗易懂，通过2个多小时的介绍，让大家对软件测试有个系统的理解和认识，具备基本的软件测试理论基础。 主要内容分为5个部分： 1 软件测试概述，了解测试是什么、测试的对象、原则、流程、方法、模型； 2.常用的黑盒测试用例设计方法及示例演示； 3 常用白盒测试用例设计方法及示例演示； 4.自动化测试优缺点、使用范围及示例‘； 5.测试经验谈。
 43.19MB
智鼎(附答案).zip
20200422并不是完整题库，但是有智鼎在线2019年9、10、11三个月的试题，有十七套以上题目，普通的网申行测题足以对付，可以在做题时自己总结一些规律，都不是很难
 43KB
炉温系统的PID控制器设计——MATLAB程序
20180517本文主要研究的课题是：炉温系统的PID控制器设计研究 ，并且在MATLAB的大环境下进行模拟仿真。 (1)第一章 介绍课题的研究背景、意义以及发展现状。 (2)第二章 建立炉温系统数学模型 (3)第三
Java进阶高手课Java基础编程提升
20200427课程聚焦Java基础编程提升的核心知识点，以真实场景项目实战为导向，循序渐进，深入浅出的了解Java基础编程，讲解Java这门使用广泛的编程语言，助你能够游刃有余地游走在这些技术之中。
Python进阶Pandas数据分析库
20181218您观看课程学习后 免费入群领取【超全Python资料包+17本学习电子书】 Pandas是python中非常常用的数据分析库，在数据分析，机器学习，深度学习等领域经常被使用。本课程会讲解到pandas中最核心的一些知识点，包括Series以及DataFrame的构建，赋值，操作，选择数据，合并等等，以及使用pandas对文件进行读取和写入，使用pandas绘图等等。
Mysql数据库基础入门视频教程
20181024Mysql数据库基础入门视频课程：属于零基础Mysql数据库教程，从数据库的基本专业术语介绍到数据库软件的下载使用 一步一步带你安装MySql。SQL阶段你将学会如果使用数据定义语言DDL,数据操作语言DML,数据查询语言DQL 在学会各中查询语句之后,会带你学习数据的完整性, 掌握如果正确的向数据库中添加数据 以上掌握技能之后,将会带你学习如何进行多表操作,关系的建立,各种连接查询等. 常用函数,事务的学习,您将学到什么是事务的提交,回滚,并发操作及脏读,幻读. 最后视图,存储过程,索引的学习,将会带你掌握更高级的数据库技术.
微信公众平台开发入门
20150106本套课程的设计完全是为初学者量身打造，课程内容由浅入深，课程讲解通俗易懂，代码实现简洁清晰。通过本课程的学习，学员能够入门微信公众平台开发，能够胜任企业级的订阅号、服务号、企业号的应用开发工作。 通过本课程的学习，学员能够对微信公众平台有一个清晰的、系统性的认识。例如，公众号是什么，它有什么特点，它能做什么，怎么开发公众号。 其次，通过本课程的学习，学员能够掌握微信公众平台开发的方法、技术和应用实现。例如，开发者文档怎么看，开发环境怎么搭建，基本的消息交互如何实现，常用的方法技巧有哪些，真实应用怎么开发。
 下载 低功耗蓝牙和专有射频技术在HID的应用
 下载 浏览器兼容的JS写法总结
 学院 JavaWeb母婴用品购物商城毕业设计 大学生毕业设计教学视频
 博客 牛客SQL练习第7题
 下载 电源技术中的分析多功能锂电池充电板设计与应用
 博客 【Java笔试题】1
 下载 通信与网络中的浅析层绞式光纤带光缆的结构及套管设计
 学院 Unity热更新框架基于ILRuntime
 下载 双MOCCII的电流模式多功能滤波器的设计[图]
 学院 CMake工程管理入门精讲
 下载 科学认识通信基站辐射
 下载 电源技术中的解析开关变压器的伏秒容量与测量
 学院 C#之面向对象
 学院 PHP微信小程序服装购物商城大学生毕业设计教学视频
 学院 JavaWeb家具家居购物商城毕业设计 大学生毕业设计教学视频
 博客 Java初级程序员需要知道的基本Java代码规范
 学院 PHP微信化妆品小程序商城 大学生毕业设计 教学视频
 学院 项目管理工具箱
 下载 模拟技术中的分析振荡器及天线的集成式设计
 下载 电源技术中的节能减排必须以科学为根据
 博客 牛客SQL练习第8题
 学院 Java微信小程序服装商城 大学生毕业设计教学视频
 学院 软件测试之测试模型及方法概论
 下载 JavaScript事件处理的方式(三种)
 博客 20201022
 学院 轻松学习单片机
 下载 ASP.NET中Cookie的使用方法
 博客 python数据分析之matplotlib、numpy、pandas模块基础源码
 学院 PHP微信小程序校园图书商城 大学生毕业设计 教学视频
 博客 抛弃注意力，类Transformer新模型实现新SOTA