hbc bcho

## meta-tags.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                bcho
                / meta-tags.md
            
            
              Created
              October 12, 2016 06:44
                — forked from kevinSuttle/meta-tags.md
            
              
                List of Usable HTML Meta and Link Tags
              
          
    Copied from http://code.lancepollard.com/complete-list-of-html-meta-tags/
Basic HTML Meta Tags

<meta charset='UTF-8'>
<meta name='keywords' content='your, tags'>
<meta name='description' content='150 words'>
<meta name='subject' content='your website's subject'>
<meta name='copyright' content='company name'>

  
## handlers.py
#coding: utf-8

from logging.handlers import SMTPHandler as _SMTPHandler


class SMTPHandler(_SMTPHandler):

    def __init__(self, *args, **kwargs):
        super(SMTPHandler, self).__init__(*args, **kwargs)
        self._timeout = 15

## gist:6804046
2.16③  已知指针la和lb分别指向两个无头结点单链表中
的首元结点。 下列算法是从表la中删除自第i个元素起共
len个元素后，将它们插入到表lb中第i个元素之前。试问
此算法是否正确? 若有错，则请改正之。

实现下列函数：
Status DeleteAndInsertSub(LinkList &la, LinkList &lb,
                          int i, int j, int len);
// la和lb分别指向两个单链表中第一个结点，        */
/* 本算法是从la表中删去自第i个元素起共len个元素，*/

## anyview
2.16③  已知指针la和lb分别指向两个无头结点单链表中
的首元结点。 下列算法是从表la中删除自第i个元素起共
len个元素后，将它们插入到表lb中第i个元素之前。试问
此算法是否正确? 若有错，则请改正之。

实现下列函数：
Status DeleteAndInsertSub(LinkList &la, LinkList &lb,
                          int i, int j, int len);
// la和lb分别指向两个单链表中第一个结点，        */
/* 本算法是从la表中删去自第i个元素起共len个元素，*/

## index.html
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>know your web</title>
    <link rel="stylesheet" href="web.css" />
</head>
<body>
    <h1 class="title cool">hello, world!</h1>
    <script type="text/javascript" src="web.js"></script>

## deliver-solidot.sh
#!/usr/bin/env bash

deliver_target=(example1@kindle.cn example2@kindle.cn)

smtp_account="your-deliver@your-gmail.com"
smpt_password="******"

issue_archive_dir="/srv/ebook-deliver/archives"
issue_name="solidot-$(date +%Y%m%d)"

## index.html
<!doctype html>
<html>
  <head>
    <meta charset="utf-8" />
    <title>metro</title>
    <link rel="stylesheet" href="style.css" />
  </head>
  <body>
    <div class="container grid-home grid-wrap">
      <div class="grid-block-wrap grid-block-span1" data-grid-row="1" data-grid-col="1"></div>

## except.c
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include "except.h"

#define T  except_t

except_frame *except_stack = NULL;

void except_raise(const T *e, const char *file, int line)

## clients.py
#coding: utf-8

import sys
import gobject

import dbus
import dbus.mainloop.glib

from service import service_name, object_path

## gameoflife.pde
int FPS = 4;
int COUNT = 20;
int SIZE = 10;
int MAP_WIDTH = COUNT * SIZE;
int MAP_HEIGHT = COUNT * SIZE;
color BACKGROUND_COLOR = color(255, 255, 255, 0);

/* cells */
bool DEAD = false;
bool ALIVE = true;
	#coding: utf-8

	from logging.handlers import SMTPHandler as _SMTPHandler


	class SMTPHandler(_SMTPHandler):

	def __init__(self, args, *kwargs):
	super(SMTPHandler, self).__init__(args, *kwargs)
	self._timeout = 15
	2.16③ 已知指针la和lb分别指向两个无头结点单链表中
	的首元结点。下列算法是从表la中删除自第i个元素起共
	len个元素后，将它们插入到表lb中第i个元素之前。试问
	此算法是否正确? 若有错，则请改正之。

	实现下列函数：
	Status DeleteAndInsertSub(LinkList &la, LinkList &lb,
	int i, int j, int len);
	// la和lb分别指向两个单链表中第一个结点， */
	/* 本算法是从la表中删去自第i个元素起共len个元素，*/
	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8">
	<title>know your web</title>
	<link rel="stylesheet" href="web.css" />
	</head>
	<body>
	<h1 class="title cool">hello, world!</h1>
	<script type="text/javascript" src="web.js"></script>
	#!/usr/bin/env bash

	deliver_target=(example1@kindle.cn example2@kindle.cn)

	smtp_account="your-deliver@your-gmail.com"
	smpt_password="******"

	issue_archive_dir="/srv/ebook-deliver/archives"
	issue_name="solidot-$(date +%Y%m%d)"
	<!doctype html>
	<html>
	<head>
	<meta charset="utf-8" />
	<title>metro</title>
	<link rel="stylesheet" href="style.css" />
	</head>
	<body>
	<div class="container grid-home grid-wrap">
	<div class="grid-block-wrap grid-block-span1" data-grid-row="1" data-grid-col="1"></div>
	#include <stdlib.h>
	#include <stdio.h>
	#include <assert.h>
	#include "except.h"

	#define T except_t

	except_frame *except_stack = NULL;

	void except_raise(const T e, const char file, int line)
	#coding: utf-8

	import sys
	import gobject

	import dbus
	import dbus.mainloop.glib

	from service import service_name, object_path
	int FPS = 4;
	int COUNT = 20;
	int SIZE = 10;
	int MAP_WIDTH = COUNT * SIZE;
	int MAP_HEIGHT = COUNT * SIZE;
	color BACKGROUND_COLOR = color(255, 255, 255, 0);

	/* cells */
	bool DEAD = false;
	bool ALIVE = true;