Django1.9 AttributeError at /books/ type object 'Books' has no attribute 'Objects'

时间:2016-04-29 11:40:14

标签: python django

内插入元素。

错误:

from django.conf.urls import url,include
from . import views
urlpatterns = [
    url(r'^$',views.index),

]
来自图书目录的

文件:

model.py

"""testproject URL Configuration

The `urlpatterns` list routes URLs to views. For more information please see:
    https://docs.djangoproject.com/en/1.9/topics/http/urls/
Examples:
Function views
    1. Add an import:  from my_app import views
    2. Add a URL to urlpatterns:  url(r'^$', views.home, name='home')
Class-based views
    1. Add an import:  from other_app.views import Home
    2. Add a URL to urlpatterns:  url(r'^$', Home.as_view(), name='home')
Including another URLconf
    1. Add an import:  from blog import urls as blog_urls
    2. Import the include() function: from django.conf.urls import url, include
    3. Add a URL to urlpatterns:  url(r'^blog/', include(blog_urls))
"""
from django.conf.urls import url,include
from django.contrib import admin
admin.autodiscover()

urlpatterns = [
    url(r'^admin/', admin.site.urls),
    url(r'^books/', include('books.urls')),
]

views.py

$scope.getTotal = function(){
    var total = 0;
    for(var i = 0; i < $scope.cart.products.length; i++){
        var product = $scope.cart.products[i];
        total += (product.price);
    }
    return total;
}

urls.py

let n: Int = Int(Process.arguments[1])!
来自root的

: urls.py

class TreeNode {
    var left, right : TreeNode?
    var item : Int

    init(_ left: TreeNode?, _ right: TreeNode?, _ item: Int) {
        self.left = left
        self.right = right
        self.item = item
    }

    func check() -> Int {
        guard let left = left, let right = right else {
            return item
        }
        return item + left.check() - right.check()
    }
}

func bottomUpTree(item: Int, _ depth: Int) -> TreeNode {
    if depth > 0 {
        return
            TreeNode(
                bottomUpTree(2*item-1, depth-1),
                bottomUpTree(2*item, depth-1),
                item
        )
    }
    else {
        return
            TreeNode(nil,nil,item)
    }
}


let n: Int = Int(Process.arguments[1])!
let minDepth = 4
let maxDepth = n
let stretchDepth = n + 1

let check = bottomUpTree(0,stretchDepth).check()
print("stretch tree of depth \(stretchDepth)\t check: \(check)")

let longLivedTree = bottomUpTree(0,maxDepth)

var depth = minDepth
while depth <= maxDepth {
    let iterations = 1 << (maxDepth - depth + minDepth)
    var check = 0
    for i in 0..<iterations {
        check += bottomUpTree(i,depth).check()
        check += bottomUpTree(-i,depth).check()
    }
    print("\(iterations*2)\t trees of depth \(depth)\t check: \(check)")
    depth += 2
}

print("long lived tree of depth \(maxDepth)\t check: \(longLivedTree.check())")

1 个答案:

答案 0 :(得分:0)

请更改

def index(request):
    booklist =  Books.objects.all() #Objects changed to objects ; 
    return HttpResponse(booklist)